THE M/M/c QUEUE WITH （e,d） SETUP TIME

The authors present a new queueing model with （e, d） setup time. Using the quasi-birth-and-death process and matrix-geometric method, the authors obtain the stationary distribution of queue length and the LST of waiting time of a customer in the system. Furthermore, the conditional stochastic decomposition results of queue length and waiting time are given.     

Queue size distribution of Geo/G/1 queue under the Min(<Emphasis Type="Italic">N,D</Emphasis>)-policy

This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D, whichever occurs first (Min(N,D)-policy). By using renewal process theory and total probability decomposition technique, the authors study the transient and equilibrium properties of the queue length from the beginning of the arbitrary initial state, and obtain both the recursive expression of the z-transformation of the transient queue length distribution and the recursive formula for calculating the steady state queue length at arbitrary time epoch n ⁺. Meanwhile, the authors obtain the explicit expressions of the additional queue length distribution. Furthermore, the important relations between the steady state queue length distributions at different time epochs n ^-, n and n ⁺ are also reported. Finally, the authors give numerical examples to illustrate the effect of system parameters on the steady state queue length distribution, and also show from numerical results that the expressions of the steady state queue length distribution is important in the system capacity design.     

ON APPROXIMATION BY REPRODUCING KERNEL SPACES IN WEIGHTED L^p SPACES

In this paper, we investigate the order of approximation by reproducing kernel spaces on （-1, 1） in weighted L^p spaces. We first restate the translation network from the view of reproducing kernel spaces and then construct a sequence of approximating operators with the help of Jacobi orthogonal polynomials, with which we establish a kind of Jackson inequality to describe the error estimate. Finally, The results are used to discuss an approximation problem arising from learning theory.     

A perishable inventory system with service facilities, <Emphasis Type="Italic">MAP</Emphasis> arrivals and <Emphasis Type="Italic">PH</Emphasis> — Service times

We consider a continuous review perishable （s,S） inventory system with a service facility consisting of a waiting hall of finite capacity and a single server. We assume two types of customers, ordinary and negative, arrive according to a Markovian Arrival Process （MAP）. An ordinary customer joins the queue and a negative customer instead of joining the queue removes one ordinary customer from the queue. The removal rule adopted in this paper is RCE （removal of a customer from the end）. The individual customer＇s unit demand is satisfied after a random time of service which is assumed to have a phase-type distribution. The life time of each item and the lead time of the reorders have been assumed to be independent exponential distributions. The joint probability distribution of the number of customers in the system and the inventory level is obtained for the steady state case. Various stationary system performance measures are computed and the total expected cost rate is calculated. The results are illustrated numerically.     

The structure of departure process and optimal control strategy <Emphasis Type="Italic">N</Emphasis>* for <Emphasis Type="Italic">Geo/G</Emphasis>/1 discrete-time queue with multiple server vacations and Min(<Emphasis Type="Italic">N,V</Emphasis>)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n⁺ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0⁺, n⁺] from any initial state. Meanwhile, the relationship among departure process, server’s state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures, including the expected length of server busy period, server’s actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N* for minimizing the system cost under a given cost structure.     

延迟D-策略Geo/G/1排队系统的队长分布及容量的优化设计

考虑延迟D-策略离散时间Geo/G/1排队系统, 使用全概率分解技术, 从任意初始状态出发, 研究了队长的瞬态和稳态性质, 推导出了在任意时刻n⁺ 瞬态队长分布的z-变换的递推表达式和稳态队长分布的递推表达式, 并获得稳态队长的随机分解结果, 同时得到了系统在三种任意时刻(n^-, n, n⁺)处稳态队长分布的重要关系. 最后, 通过数值实例, 讨论了稳态队长分布对系统参数的敏感性, 并阐述了获得便于计算的稳态队长分布的表达式在系统容量优化设计中的重要应用价值.     

<Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript> disturbance attenuation for a class of time-delay Hamiltonian systems

This paper considers the problem of L ₂-disturbance attenuation for a class of time-delay port-controlled Hamiltonian systems. A γ-dissipative inequality is established by using a proper control law and a storage function. Then based on the Razumikhin stability theorem, a sufficient condition is proposed for the asymptotically stability of the closed-loop system. Finally, the authors investigate the case that there are time-invariant uncertainties belonging to some convex bounded polytypic domain and an L ₂ disturbance attenuation control law is proposed. Study of illustrative example with simulation shows that the presented method in this paper works very well in the disturbance attenuation of time-delay Hamiltonian systems.     

Transient Queue Size Distribution Solution of Geom / G / 1 Queue with Feedback-A Recursive Method

This paper considers the Geom / G / 1 queueing model with feedback according to a late arrival system with delayed access (LASDA). Using recursive method, this paper studies the transient property of the queue size from the initial state N(0⁺) = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n ⁺ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n ⁻, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered (being different from the relations given in M / G / 1 queueing system). The model discussed in this paper can be widely applied in all kinds of communications and computer network. This research is supported by the National Natural Science Foundation of China under Grant No. 70871084, the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001, and the Scientific Research Fund of Southwestern University of Finance and Economics.     

IMPROVED ROBUST H-INFINITY ESTIMATION FOR UNCERTAIN CONTINUOUS-TIME SYSTEMS

The design of full-order robust estimators is investigated for continuous-time polytopic uncertain systems. The main purpose is to obtain a stable linear estimator such that the estimation error system remains robustly stable with a prescribed H∞ attenuation level. Firstly, a simple alternative proof is given for an improved LMI representation of H∞ performance proposed recently. Based on the performance criterion which keeps the Lyapunov matrix out of the product of the system dynamic matrices, a sufficient condition for the existence of the robust estimator is provided in terms of linear matrix inequalities. It is shown that the proposed design strategy allows the use of parameterdependent Lyapunov functions and hence it is less conservative than the earlier results. A numerical example is employed to illustrate the feasibility and advantage of the proposed design.     

MINIMAX PROGRAMMING UNDER GENERALIZED （p, r）-INVEXITY

Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.     

ROBUST H∞ CONTROL FOR UNCERTAIN NONLINEAR SYSTEMS

This paper studies the robust H∞ disturbance attenuation with internal stability for uncertain nonlinear control systems. By adding one power integrator technique, this paper designs a explicit smooth robust dynamic feedback law while rejecting the disturbance to any specified degree of accuracy. Further, the example and simulation results show the effectiveness of the proposed schemes.     

OPTIMAL BIRTH CONTROL FOR AN AGE-DEPENDENT COMPETITION SYSTEM OF N SPECIES

In this paper, we investigate optimal policies for an age-dependent n-dimensional competition system, which is controlled by fertility. By using Dubovitskii-Milyutin＇s general theory, the maximum principles are obtained for the problems with free terminal states, infinite horizon, and target sets, respectively.     

RELIABILITY OF LINEAR （n,f, k） SYSTEMS WITH WEIGHTED COMPONENTS

The (n, f, k): F(G) system consists of n components and the system fails (works) if and only if there are at least f failed (working) components or at least k consecutive failed (working) components. These system models can be used in electronic equipment, automatic payment systems in banks, and furnace systems. In this paper we introduce and study the (n, f, k):F and (n, f, k): G systems consisting of weighted components. Recursive equations are presented for reliability evaluation of these new models. We also provide some conditions on the weights to represent weighted-(n, f, k) systems as usual (n, f, k) systems.     

Randomized policy of a poisson input queue with <Emphasis Type="Italic">J</Emphasis> vacations

This paper studies the operating characteristics of an M/G/1 queuing system with a randomized control policy and at most J vacations.After all the customers are served in the queue exhaustively, the server immediately takes at most J vacations repeatedly until at least N customers are waiting for service in the queue upon returning from a vacation.If the number of arrivals does not reach N by the end of the J~(th) vacation,the server remains idle in the system until the number of arrivals in the queue re...     

Construction of one-Lee weight and two-Lee weight codes over F<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> + <Emphasis Type="Italic">v</Emphasis>F<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over F _p + vF _p (v ² = v) with type \({p^{2{k_1}}}{p^{{k_2}}}{p^{{k_3}}}\) based on two different distance-preserving Gray maps from ((F _p + vF _p ) ⁿ , Lee weight) to (F _p ²ⁿ , Hamming weight), where p is a prime. Moreover, the authors prove that the obtained two-Lee weight codes are projective only when p = 2.     

A new <Emphasis Type="Italic">ɛ</Emphasis>-generalized projection method of strongly sub-feasible directions for inequality constrained optimization

In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the ɛ-generalized projection technique, a new algorithm starting with an arbitrary initial iteration point for the discussed problems is presented. At each iteration, the search direction is generated by a new ɛ-generalized projection explicit formula, and the step length is yielded by a new Armijo line search. Under some necessary assumptions, not only the algorithm possesses global and strong convergence, but also the iterative points always get into the feasible set after finite iterations. Finally, some preliminary numerical results are reported.     

Properties of storage functions and applications to nonlinear stochastic <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control

This paper discusses the properties of the storage functions for a class of nonlinear stochastic systems. Some necessary and sufficient conditions for a function to be a storage function are derived. As applications, the finite and infinite horizon nonlinear stochastic H _∞ controls for systems with state, control, and external disturbance dependent noise are investigated, which generalize the previous results.     

ON CHARACTERIZATIONS OF D-η-PROPERLY PREQUASI-INVEX FUNCTION

Recently, various concepts of D-η-properly prequasi-invex functions were introduced and characterizations of D-η-properly prequasi-invex functions were presented under a certain set of conditions. In this paper, we show that the same results can be obtained under weaker assumptions.     

Weighted <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-estimates of solutions for damped wave equations with variable coefficients

The authors establish weighted L²-estimates of solutions for the damped wave equations with variable coefficients u _tt ? divA(x)?u+au _t = 0 in ? ⁿ under the assumption a(x) ≥ a₀[1+ρ(x)]^?l, where a₀ > 0, l < 1, ρ(x) is the distance function of the metric g = A^?1(x) on ? ⁿ . The authors show that these weighted L²-estimates are closely related to the geometrical properties of the metric g = A^?1(x).     

Testing <Emphasis Type="Italic">k</Emphasis>-edge-connectivity of digraphs

This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or ɛ-far from k-edge-connectivity. This is the first testing algorithm for k-edgeconnectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ɛ-far from k-edge-connectivity if at least ɛdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ɛ and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and rejects all digraphs that is ɛ-far from k-edge-connectivity with probability at least 2/3. It runs in $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) (c > 1 is a constant) time when input digraphs are restricted to be (k-1)-edge connected and runs in $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) (c > 1 is a constant) time for general digraphs.