Results 211 to 220 of about 291,869 (259)
BAAR: A framework for blockchain-based anonymous and revocable user authentication scheme. [PDF]
Ahmed M, Ahmad A, Zeshan F, Akram S.
europepmc +1 more source
Autonomous microfluidic labs: progress and prospects.
Damir S +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Reactability of Discrete Time Systems
IEEE Control Systems Letters, 2023An important property of a dynamical system is its reactivity, i.e., the initial rate of growth of the norm of the state vector. However, most literature on reactivity has focused on continuous time systems. Here we define the reactivity of discrete time systems and apply it to characterize the dynamics of network systems and Markov chains.
Amirhossein Nazerian +3 more
openaire +1 more source
On Stabilization of Discrete Time-Varying Systems
SIAM Journal on Control and Optimization, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Artur Babiarz +2 more
openaire +1 more source
Linearization of Discrete-Time Systems
SIAM Journal on Control and Optimization, 1996The paper deals with discrete-time nonlinear systems of the form \(x(k+1) = f(x(k), u(k))\) with \(x(\cdot) \in \mathbb{R}^n\) and \(u(\cdot) \in \mathbb{R}^m\) and \(f\) an analytic map. Using an algebraic formalism based on tools from difference algebra and exterior differential systems, a characterization of accessibility of the system is found ...
Aranda Bricaire, Eduardo +2 more
openaire +3 more sources
Discrete-time differential systems
Signal Processing, 2015In this paper we formulate a coherent discrete-time signals and systems theory taking derivative concepts as basis. Two derivatives - nabla (forward) and delta (backward) - are defined and generalized to fractional orders, obtaining two formulations that are discrete versions of the well-known Grunwald-Letnikov derivatives.
Manuel Duarte Ortigueira +2 more
openaire +1 more source
Invertibility of Discrete-Time Systems
IFAC Proceedings Volumes, 1992Abstract Formulae which permit the computation of the rank of discrete-time systems are given. We are utilizing some classical mathematical tools, such as the notion of filtrations and the associated Hilbert polynomials.
S. El Asml, M. Fliess
openaire +1 more source
Discrete-Time Systems with the Decomposition Property
IEEE Transactions on Computers, 1970The decomposition property, a necessary condition for linearity, is defined for discrete-time systems. N-state machines with this property have finite memory μ≤N−1. Linear and autonomous systems are important classes of systems with decomposition. Several representations of systems with decomposition are given and a general form of the discrete-time ...
Keith L. Doty, Howard Frank
openaire +1 more source
Linearizing Discrete-Time Hybrid Systems
IEEE Transactions on Automatic Control, 2017Model-based design approaches for embedded systems aim at generating correct-by-construction control software, guaranteeing that the closed-loop system (controller and plant) meets given system level formal specifications. This technical note addresses control synthesis for safety and reachability properties of possibly nonlinear discrete-time hybrid ...
ALIMGUZHIN, VADIM +4 more
openaire +3 more sources

