Event-triggered sliding mode control for switched genetic regulatory networks with persistent dwell time

This paper focus on the event-triggered sliding mode controller design for discrete-time switched genetic regulatory networks (GRNs) with persistent dwell time (PDT) switching. Firstly, the observation error dynamics of switched GRNs with PDT is constructed in the light of event-triggered sliding mode control (SMC) scheme. Next, sufficient conditions are derived to ensure the exponential stability of the augmented plant. Moreover, an event-triggered SMC law is synthesized to impel the system trajectories onto the sliding surface in a finite time. Finally, a verification example is provided to illustrate the effectiveness and potential of the proposed method.     

Some Properties of Solutions to the Novikov Equation with Weak Dissipation Terms

In this paper, we investigate the Novikov equation with weak dissipation terms. First, we give the local well-posedness and the blow-up scenario. Then, we discuss the global existence of the solutions under certain conditions. After that, on condition that the compactly supported initial data keeps its sign, we prove the infinite propagation speed of our solutions, and establish the large time behavior. Finally, we also elaborate the persistence property of our solutions in weighted Sobolev space.     

Single machine group scheduling with ordered criteria

The single machine group scheduling problem is considered. Jobs are classified into several groups on the basis of group technology, i.e. jobs of the same group have to be processed jointly. A machine set-up time independent of the group sequence is needed between each two consecutive groups. A schedule specifies the sequence of groups and the sequence of jobs in each group. The quality of a schedule is measured by the criteriaF ₁, ...,F _m ordered by their relative importance. The objective is to minimize the least important criterionF _m subject to the schedule being optimal with respect to the more important criterionF _m–1 which is minimized on the set of schedules minimizing criterionF _m–2 and so on. The most important criterion isF ₁, which is minimized on the set of all feasible schedules. An approach to solve this multicriterion problem in polynomial time is presented if functionsF ₁, ...,F _m have special properties. The total weighted completion time and the total weighted exponential time are the examples of functionsF ₁, ...,F _m–1 and the maximum cost is an example of functionF _m for which our approach can be applied.The research of the authors was partially supported by a KBN Grant No. 3 P 406 003 05, the Fundamental Research Fund of Belarus, Project N 60-242, and the Deutsche Forschungsgemeinschaft, Project Schema, respectively. The paper was completed while the first author was visiting the University of Melbourne.     

Lower semicontinuous solutions of the Bellman equation for the minimum time problem

The minimum time problem associated with a nonlinear control system is considered, and the unicity of the lower semicontinuous solution of the corresponding Bellman equation is investigated. A main tool in our approach is the Kruzkov transformation that enables us to work on ⁿ –{0}, where {0} is the target set, instead of the unknown reachable set.This research was carried out while the first author was visiting the Department of Mathematics, University of Genova, Genova, Italy.     

Large deviation analysis of the single server queue

We establish the large deviation principle (LDP) for the virtual waiting time and queue length processes in the GI/GI/1 queue. The rate functions are found explicitly. As an application, we obtain the logarithmic asymptotics of the probabilities that the virtual waiting time and queue length exceed high levels at large times. Additional new results deal with the LDP for renewal processes and with the derivation of unconditional LDPs for conditional ones. Our approach applies in large deviations ideas and methods of weak convergence theory.This work was supported in part by AT&T Bell Labs.     

Covering with blocks in the non-symmetric case

Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW _n as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW _n are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW _n in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday.     

Stochastic phase lockings in a relaxation oscillator forced by a periodic input with additive noise: A first-passage-time approach

Noise effects on phase lockings in a system consisting of a piecewise-linear van der Pol relaxation oscillator driven by a periodic input are studied. The problem of finding the period of the oscillator is reduced to the first-passage-time problem of the Ornstein-Uhlenbeck process with time-varying boundary. The probability density functions of the first-passage time are used to define the operator which governs a transition of an input phase density after one cycle of the oscillator. Phase lockings in a stochastic sense are investigated on the basis of the density evolution by the operator.     

Probabilistic approach to homoclinic chaos

Three-dimensional systems possessing a homoclinic orbit associated to a saddle focus with eigenvalues ±i, – and giving rise to homoclinic chaos when the Shil'nikov condition < is satisfied are studied. The 2D Poincaré map and its 1D contractions capturing the essential features of the flow are given. At homoclinicity, these 1D maps are found to be piecewise linear. This property allows one to reduce the Frobenius—Perron equation to a master equation whose solution is analytically known. The probabilistic properties such as the time autocorrelation function of the state variablex are explicitly derived.     

The occupation time of Brownian motion in a ball

LetW be a Wiener process of dimensiond3, starting from 0, and letX(t) be the total time spent byW in the ball centered at 0 with radiust. We give an affirmative answer to a conjecture of Taylor and Tricot⁽¹⁶⁾ on the tail distribution ofX(t). Lévy's lower functions ofX(t) are characterized by an integral test.     

Small ball probabilities for a Wiener process under weighted sup-norms,with an application to the supremum of bessel local times

LetR be the radial part of ad-dimensional Wiener process, starting from 0. In this paper, small ball probabilities are evaluated for sup_0<11(t ^–p R(t)) and sup _t 0(e ^–1 R(t)), withp[0, 1/2]. Chung's law of the iterated logarithm is established for the supremum of the local times of a two-dimensional Bessel process.