Results 261 to 270 of about 1,576,829 (311)
Some of the next articles are maybe not open access.
A Structural linearization principle for processes
Formal Methods in System Design, 1993In [1], an induction principle for processes was given which allows one to apply model-checking techniques to parameterized families of processes. A limitation of the induction principle is that it does not apply to the case in which one process depends directly upon a parameterized number of processes, which number grows without bound. This would seem
Robert P. Kurshan +3 more
openaire +1 more source
Characterization of Linear Structures
Designs, Codes and Cryptography, 2001Let \(F\) be a function defined from \(F_2^m\) to \(F_2^n\) and \((\alpha,a)\) be an element of \(F_2^m\times F_2^n\), with \(\alpha\neq 0\). Then \((\alpha,a)\) is defined to be a linear structure of \(F\) if \(F(x)= F(x+\alpha)+ a\) for all \(x\in F_2^m\).
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
Identification of Linear Structures
Journal of Dynamic Systems, Measurement, and Control, 1984Experimental frequency response data for a linear dynamic system is used to obtain system transfer functions. An easily implemented multi-degree-of-freedom technique which is applicable to linear structures having moderate, non-proportional viscous damping is presented.
openaire +1 more source
Syntax, 2017
AbstractThe linearization of unboundedly many syntactic structures given a finite number of ordering instructions poses a compositionality problem similar to the semantic problem of determining the meanings of unboundedly many structures. We discuss this challenge and use various constructions such as Right‐Node Raising that have been argued to involve
Bachrach, Asaf, Katzir, Roni
openaire +1 more source
AbstractThe linearization of unboundedly many syntactic structures given a finite number of ordering instructions poses a compositionality problem similar to the semantic problem of determining the meanings of unboundedly many structures. We discuss this challenge and use various constructions such as Right‐Node Raising that have been argued to involve
Bachrach, Asaf, Katzir, Roni
openaire +1 more source
Linear A and Linear B: Structural and contextual concerns
Aegean Scripts. Proceedings of the 14th Mycenological Colloquium 2-6 September, Copenhagen 2015, 2017Of all the Aegean writing systems, Linear B is by far the best known and understood: it has the largest number of inscriptions, a signary whose repertoire we can reconstruct with a high degree of accuracy, well secured sign values for the majority of signs and a well understood underlying language, Greek.
Meissner, T, Steele, PM
openaire +1 more source
On Linearized Poisson Structures
Mathematical Notes, 2001The linearizability of a given Poisson structure \(\Psi \) at a non-zero dimensional symplectic leaf B (\(\dim B\geq 1\)) is studied. Two basic structures are introduced: a normal bundle \(E\) to the symplectic leaf \(B\) and the pull-back \(\Psi _{f}\) of the Poisson structure \(\Psi \) to \(E\) via an exponential map \(f\).
openaire +2 more sources
On the Concatenated Structure of a Linear Code
Applicable Algebra in Engineering, Communication and Computing, 1998Let \(F_q\) be a finite field with \(q\) elements and denote by \(C(n,k,d)\) a linear code of length \(n\) over \(F_q\) of dimension \(k\) and minimum distance \(d\). Define \(B(n_B,k_B,d_B)\) over \(F_q\) to be an inner code, \(E(n_E,k_E,d_E)\) over \(F_{q^{k_B}}\) to be an outer code and \({\mathcal C}\) to be the concatenateed code, obtained by ...
openaire +2 more sources
STRUCTURE OF SKEW LINEAR SEMIGROUPS
International Journal of Algebra and Computation, 1993It is known that if \(K\) is a field and \(S \subseteq M_ n(K)\) is a semigroup, then there exists a chain of ideals \(J_ 1 \subseteq J_ 2 \subseteq\dots\subseteq J_ t = S\) of \(S\), \(t \leq 2^ n + n\), such that \(J_ 1\) and all factors \(J_ i/J_{i-1}\), \(i = 2,3,\dots,t\) are uniform (recall that a semigroup \(S\) is called uniform if \(S\) embeds
openaire +2 more sources
Linear and non-linear structural relaxation
Journal of Non-Crystalline Solids, 1991Abstract The widely applied Tool-Narayanaswamy (TN) model for structural relaxation associated with the glass transition is discussed and critiqued. The TN model accounts for the non-exponential character of the structural relaxation by effectively invoking a distribution of relaxation times and for the non-linear character by allowing the relaxation
C.T. Moynihan +2 more
openaire +1 more source

