Results 281 to 290 of about 5,206,546 (317)
Some of the next articles are maybe not open access.
IEEE Transactions on Computers, 1968
Abstract—A system is linear if and only if it is zero-state linear, zero-input linear, and its input-output state equation has the decompostion property. In this note, it is shown that zero-state linearity is sufficient to imply that the set of states accessible from the zero state can be made into a vector space over the output field and the zeroinput
K. Doty, H. Frank
openaire +2 more sources
Abstract—A system is linear if and only if it is zero-state linear, zero-input linear, and its input-output state equation has the decompostion property. In this note, it is shown that zero-state linearity is sufficient to imply that the set of states accessible from the zero state can be made into a vector space over the output field and the zeroinput
K. Doty, H. Frank
openaire +2 more sources
Linear active control for linear and non linear structures
Proceedings Intelligent Information Systems. IIS'97, 2002This paper summarizes the basic approaches and the results obtained by the authors regarding the active control of structures. The optimal design of linear active control algorithms for nominally linear oscillators and their validation for non-linear systems (Van der Pol and Duffing oscillators), unknown and stochastic forcing functions, delayed and ...
BARATTA, ALESSANDRO +2 more
openaire +2 more sources
Linear domains and linear maps
1994We study the symmetric monoidal closed category LIN of linear domains. Its objects are inverse limits of finite, bounded complete posets with respect to projection-embedding pairs preserving all suprema. The full reflective subcategory LL of linear lattices is a denotational model of linear logic; the negation is A ↦ A op and !(A) is the lattice of all
openaire +1 more source
On linear programs with linear complementarity constraints
Journal of Global Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jing Hu +3 more
openaire +1 more source
Linear proofs and linear logic
2005In [3] a modification of the Connection Method [2] called Linear Proofs was introduced which constituted a new logical approach to plan generation. Inspired by this idea in [7] a similar approach based on Linear Logic was presented. The present paper analyses the relationship of these two approaches and shows to which extent they are equivalent and ...
openaire +1 more source
Linear and non-linear filtering in stereopsis
Vision Research, 1994To better understand the spatial filtering operations underlying stereopsis, and their relationship to those underlying monocular localization of the same stimuli, we examined the dependence of stereoacuity on carrier and envelope size of Gabor patches.
R F, Hess, L M, Wilcox
openaire +2 more sources
Training linear SVMs in linear time
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 2006Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for high-dimensional sparse data commonly encountered in applications like text classification, word-sense disambiguation, and drug design. These applications involve a large number of examples n as well as a large number of features N, while each ...
openaire +1 more source
On the Independence of Linear Functionals of Linear Processes
SIAM Journal on Applied Mathematics, 1969A class of continuous parameter random processes is defined whose members, $x(t)$, are integrals of a nonstationary random “filter” function, $h(t,\lambda )$, with respect to an independent increments process $Z(\lambda )$. Linear functionals l of $x(t)$ expressible as integrals of a random function $\phi (\lambda )$ with respect to $Z(\lambda )$ are ...
openaire +2 more sources
Linear Systems and Linearization
2010Key to the analysis of nonlinear systems is determining the stability of the equilibria. The classical method of determining stability is to linearize the system about the equilibrium and to determine exponential rates of growth and decay for the associated linear system. The framework for carrying this out is taken up in this chapter.
openaire +1 more source
On Linear Cryptanalysis with Many Linear Approximations
2009In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a block-cipher without putting any restriction on these approximations. We quantify here the entropy of the key given the plaintext-ciphertext pairs statistics which is a much more accurate measure than the ones studied earlier.
Benoît Gérard, Jean-Pierre Tillich
openaire +2 more sources