Results 241 to 250 of about 2,306,692 (293)
Some of the next articles are maybe not open access.
Theory of Probability & Its Applications, 1963
Queuing systems are considered, in which calls arrive in batches of size $\xi $ and are served in batches of size $\eta $ the period of time between two successive arrivals of batches of calls is equal to $\tau $; the time of a service is equal to $\sigma $. The quantities $\xi $,$\eta $, $\tau $ and $\sigma $ are discrete random variables.
openaire +1 more source
Queuing systems are considered, in which calls arrive in batches of size $\xi $ and are served in batches of size $\eta $ the period of time between two successive arrivals of batches of calls is equal to $\tau $; the time of a service is equal to $\sigma $. The quantities $\xi $,$\eta $, $\tau $ and $\sigma $ are discrete random variables.
openaire +1 more source
Physics Letters A, 1992
Abstract An integrable discrete-time version of the Neumann system is presented. It obtains from the Toda-lattice spectral problem by requiring the potential to be restricted to a suitable finite-dimensional manifold. The analogy with the continuous Neumann system is explained. Some interesting open problems are briefly outlined.
openaire +1 more source
Abstract An integrable discrete-time version of the Neumann system is presented. It obtains from the Toda-lattice spectral problem by requiring the potential to be restricted to a suitable finite-dimensional manifold. The analogy with the continuous Neumann system is explained. Some interesting open problems are briefly outlined.
openaire +1 more source
On a System of Discrete Distributions
Biometrika, 1967Using the difference equation analogous to Pearson's differential equation, a system of discreate distributions is developed. This is found to contain many of the distributions in common usage. The choice of distribution usually depends on only the first three moments. Some examples are given.
openaire +3 more sources
1993
The author considers the relation of graphs to languages resp. the relation of graph theory to formal language theory. Mainly he investigates the dense hierarchies of graphs and languages.
openaire +2 more sources
The author considers the relation of graphs to languages resp. the relation of graph theory to formal language theory. Mainly he investigates the dense hierarchies of graphs and languages.
openaire +2 more sources
Continuous-discrete interval observers for systems with discrete measurements
52nd IEEE Conference on Decision and Control, 2013We consider linear continuous-time systems with input, output and additive disturbances when measurements are only available at discrete instants. For these systems, we solve a state estimation problem by constructing a family of continuous-discrete time-invariant interval observers.
Mazenc, Frédéric, Dinh, Thach Ngoc
openaire +2 more sources
On the structure of discrete systems
1996The intention of this article is to present a general, uniform and concise mathematical framework for modelling of systems, especially discrete systems. As basic structures families and relations, defined as families of families represented in parameterized form, are used, which allows the representation of dual and polymorphic relations.
openaire +1 more source
SYNCHRONIZATION BEHAVIOR IN DISCRETE SYSTEMS
International Journal of Modern Physics C, 2011This work explores the synchronization behavior in discrete systems with both discrete time and discrete state. In order to describe the self-driven function of the node’s state, a state transfer matrix is introduced. Three typical network structures (random network, small-world network and scale-free network) are numerically studied in order to ...
Zheng, Jian-Feng +3 more
openaire +1 more source
On observability of discrete-event systems
Information Sciences, 1988The supervised discrete-event system is considered. The set of possible events is partitioned into the sets of controllable and observable events. State transitions are governed by the language generated by the transition function and the alphabet of event labels.
Feng Lin 0001, Walter Murray Wonham
openaire +2 more sources
Stabilizing unstable discrete systems
Physical Review E, 2001A general method for stabilizing unstable discrete systems to a fixed point or high-period orbit is developed analytically and numerically in this paper. It is shown that the method can be equally applied to the systems with one or more positive Lyapunov exponents.
S, Bu, S, Wang, H, Ye
openaire +2 more sources
Detectability of Discrete Event Systems
IEEE Transactions on Automatic Control, 2007In this note, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observations.
Shaolong Shu +2 more
openaire +1 more source