An algorithm for generating equivalent Poisson packet traffic based on empirical traffic data is presented in this paper. Two steps are required in order to produce equivalent Poisson packet traffic. Real traffic trace is analyzed in the first step. In the second step, a new equivalent synthetic Poisson traffic is generated in such a way that the first order statistical parameters remain unchan...

In this paper, we first establish a basic theorem on the zeros of general transcendental functions. Based on the basic theorem, we develop a decomposition technique to investigate the stability of some exponential polynomials, that is, to find conditions under which all zeros of the exponential polynomials have negative real parts. The technique combines the D-decomposition and τ -decomposition...

We study stability of linear time-varying differential-algebraic equations (DAEs). The Bohl exponent is introduced and finiteness of the Bohl exponent is characterized, the equivalence of exponential stability and a negative Bohl exponent is shown and shift properties are derived. We also show that the Bohl exponent is invariant under the set of Bohl transformations. For the class of DAEs which...

We study stability of linear time-varying differential-algebraic equations (DAEs). The Bohl exponent is introduced and finiteness of the Bohl exponent is characterized, the equivalence of exponential stability and a negative Bohl exponent is shown and shift properties are derived. We also show that the Bohl exponent is invariant under the set of Bohl transformations. For the class of DAEs which...

We initiate the study of fairness in reinforcement learning, where the actions of a learning algorithm may affect its environment and future rewards. Our fairness constraint requires that an algorithm never prefers one action over another if the long-term (discounted) reward of choosing the latter action is higher. Our first result is negative: despite the fact that fairness is consistent with ...

We initiate the study of fairness in reinforcement learning, where the actions of a learning algorithm may affect its environment and future rewards. Our fairness constraint requires that an algorithm never prefers one action over another if the long-term (discounted) reward of choosing the latter action is higher. Our first result is negative: despite the fact that fairness is consistent with ...

Gap-acceptance capacity models apply to the analysis of minor movements at two-way stop and give-way (yield) sign-controlled intersections, entry streams at roundabouts and opposed (permitted) turns at signalised intersections. The same modelling principles apply to all these cases with different model parameters representing the intersection geometry, control and driver behaviour at different ...

We prove a quantitative estimate, with power saving error term, for the number of simple closed geodesics length at most $L$ on compact surface equipped Riemannian metric negative curvature. The proof relies exponential mixing rate Teichmüller geodesic flow.

The investigations are made on the exponential synchronization of the stochastic Lur’e system with nonlinear coupling and impulsive disturbance. The impulsive effects in complex networks could play a positive or a negative role for synchronization. For the sake of simplification and efficiency, a single impulsive controller is designed to realize the synchronization of the impulsive dynamical n...

We show that the generating functions of the generalized Catalan numbers can be identified with the moment generating functions of probability density functions related to the Brownian motion stochastic process. Specifically, the probability density functions are exponential mixtures of inverse Gaussian (EMIG) probability density functions, which arise as the first passage time distributions to...