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.     

<Emphasis Type=Italic>Geom/G</Emphasis><Subscript>1</Subscript>, <Emphasis Type=Italic>G</Emphasis><Subscript>2</Subscript>/1/1 repairable Erlang loss system with catastrophe and second optional service

This paper studies a single server discrete-time Erlang loss system with Bernoulli arrival process and no waiting space. The server in the system is assumed to provide two different types of services, namely essential and optional services, to the customer. During the operation of the system, the arrival of the catastrophe will break the system down and simultaneously induce customer to leave the system immediately. Using a new type discrete supplementary variable technique, the authors obtain some performance characteristics of the queueing system, including the steady-state availability and failure frequency of the system, the steady-state probabilities for the server being idle, busy, breakdown and the loss probability of the system etc. Finally, by the numerical examples, the authors study the influence of the system parameters on several performance measures.     

The recursive solution of queue length for <Emphasis Type=Italic>Geo/G</Emphasis>/1 queue with <Emphasis Type=Italic>N</Emphasis>-policy

This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the recursive expressions of the queue-length distributions at epochs n~-,n~+,and n.Furthermore,the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs(n~-,n~+,n and departure epoch D_n).     

Efficient Asymmetrical Extended Designs Under Wrap-Around <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-Discrepancy

The purpose of the present article is to introduce a class of mixed two- and three-level extended designs obtained by adding some new runs to an existing mixed two-and three-level design. A formulation of wrap-around L₂-discrepancy for the extended designs is developed. As a benchmark of obtaining (nearly) uniform asymmetrical extended designs, a lower bound to the wrap-around L₂-discrepancy for our proposed designs is established. Thorough numerical results are displayed, which provide further corroboration to the derived theoretical results.     

Effective lower bounds of wrap-around <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-discrepancy on three-level combined designs

How to obtain an effective design is a major concern of scientific research. This topic always involves high-dimensional inputs with limited resources. The foldover is a quick and useful technique in construction of fractional designs, which typically releases aliased factors or interactions. This paper takes the wrap-around L₂-discrepancy as the optimality measure to assess the optimal three-level combined designs. New and efficient analytical expressions and lower bounds of the wraparound L₂-discrepancy for three-level combined designs are obtained. The new lower bound is useful and sharper than the existing lower bound. Using the new analytical expression and lower bound as the benchmarks, the authors may implement an effective algorithm for constructing optimal three-level combined designs.     

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.     

Reflection-in-and-on-Action in Participatory Action Research: Toward Assessment <Emphasis Type=Italic>for </Emphasis>Learning

This article is about the use of oral assessment for learning and was based on a reflection-in-and-on-action approach within a participatory action research framework. The purpose of this paper was to argue for the incorporation of oral assessment in tertiary science as a fair, reliable and valid approach to assessment. This study found that the interactive nature of the oral assessments led to improved learning of content for learners from their peers and assessors. Assessors too learnt about their students as individuals, their study habits and critiqued their teaching from the oral assessments. They also learned from their co-assessors. Valuable lessons were learned for collaborative team teaching and assessing for the benefit of assessors and learners alike. This study also found that action research afforded the assessors a new way of doing things empowering them to conduct research in their own classrooms, with their colleagues and their learners.     

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.     

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.     

Generalized <Emphasis Type=Italic>p</Emphasis>-values for testing regression coefficients in partially linear models

The one-sided and two-sided hypotheses about the parametric component in partially linear model are considered in this paper. Generalized p-values are proposed based on fiducial method for testing the two hypotheses at the presence of nonparametric nuisance parameter. Note that the nonparametric component can be approximated by a linear combination of some known functions, thus, the partially linear model can be approximated by a linear model. Thereby, generalized p-values for a linear model are studied first, and then the results are extended to the situation of partially linear model. Small sample frequency properties are analyzed theoretically. Meanwhile, simulations are conducted to assess the finite sample performance of the tests based on the proposed p-values.     

ON THE TRANSIENT DEPARTURE PROCESS OF M^x/G/1 QUEUEING SYSTEM WITH SINGLE SERVER VACATION

This paper studies the transient departure process of M^x/G/1 queueing system with single server vacation. We present a simple probability decomposition method to derive the expected number of departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.     

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).     

A class of constacyclic codes over ring <Emphasis Type="Italic">R</Emphasis> + <Emphasis Type="Italic">vR</Emphasis>

By constructing a Gray map, a class of constacyclic codes over ring R = R+vR is studied. Using cyclic codes and negacyclic codes of length p ^s over ring R, the structure of (1?2v)-constacyclic codes and dual codes of length p ^s over ring R are given, the Gray images of (1 ? 2v)-constacyclic codes in a particular case are also studied. It is shown that linear codes of length p ^s over ring R are (1?2v)-constacyclic codes if and only if their Gray images are distance-invariant cyclic codes of length 2p ^s over ring R.     

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.     

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.     

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.     

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.     

ELIMINATION IN WEYI ALGEBRA AND q-IDENTITIES

In this paper, the following are introduced briefly： the basic concept of q-proper-hypergeometric; an algorithmic proof theory for q-proper-hypergeometric identities; and elimination in the non- commutative Weyl algebra. We give an algorithm for proving the single-variable q-proper-hypergeometric identities that is based on Zeilberger＇s approach and the elimination in Weyl algebra. Finally, we test several examples that have been proven by D. Zeilberger and H. Will using the WZ-pair method and Gosper algorithm.     

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.