Analysis of GI<Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>(<Emphasis Type="Italic">n</Emphasis>)//<Emphasis Type="Italic">N</Emphasis> systems with stochastic customer acceptance policy

We investigate GI ^X /M(n)//N systems with stochastic customer acceptance policy, function of the customer batch size and the number of customers in the system at its arrival. We address the time-dependent and long-run analysis of the number of customers in the system at prearrivals and postarrivals of batches and seen by customers at their arrival to the system, as well as customer blocking probabilities. These results are then used to derive the continuous-time long-run distribution of the number of customers in the system. Our analysis combines Markov chain embedding with uniformization and uses stochastic ordering as a way to bound the errors of the computed performance measures.      

The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/∞ queue in a random environment

We consider the M/M/∞ queueing system with arrival and service rate depending on the state of an auxiliary semi-Markov process (which can be viewed as an external environment) and find the mean number of customers in the system in steady state. In a particular case when the external environment can be only in two states we find the distribution of the number of customers in the system.      

Busy period analysis for <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">PH</Emphasis>/1 queues with workload dependent balking

We consider an M/PH/1 queue with workload-dependent balking. An arriving customer joins the queue and stays until served if and only if the system workload is no more than a fixed level at the time of his arrival. We begin by considering a fluid model where the buffer content changes at a rate determined by an external stochastic process with finite state space. We derive systems of first-order linear differential equations for the mean and LST (Laplace-Stieltjes Transform) of the busy period in this model and solve them explicitly. We obtain the mean and LST of the busy period in the M/PH/1 queue with workload-dependent balking as a special limiting case of this fluid model. We illustrate the results with numerical examples.      

Approximations for the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">GI</Emphasis> type call center

In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.      

Iterative approximation of <Emphasis Type="Italic">k</Emphasis>-limited polling systems

The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, service and setup distributions. The interest for this model is fueled by an application in the field of logistics. Knowledge of the queue length distributions is needed to operate the system properly. The multi-queue polling system is decomposed into single-queue vacation systems with k-limited service and state-dependent vacations, for which the vacation distributions are computed in an iterative approximate manner. These vacation models are analyzed via matrix-analytic techniques. The accuracy of the approximation scheme is verified by means of an extensive simulation study. The developed approximation turns out to be accurate, robust and computationally efficient. This research is supported by the Technology Foundation STW, applied science division of NWO and the technology programme of the Dutch Ministry of Economic Affairs.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.     

Cc （X） Spaces with X Locally Compact

In this paper, we show, among other results, that if X is a [separable] locally compact space X [satisfying the first countability axiom] then the space Cc （X） has countable tightness [if and only if it has bounding tightness] if and only if it is Frechet-Urysohn, if and only if Cc （X） contains a dense （LM） subspace and if and only if X is a-compact.     

The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/∞ system revisited: finiteness,summability, long range dependence,and reverse engineering

We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated. We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied to various examples, including ones with infinite queues and non-summable workloads. AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10     

Nonparametric inference for sequential <Emphasis Type="Italic">k</Emphasis>-out-of-<Emphasis Type="Italic">n</Emphasis> systems

The k-out-of-n model is commonly used in reliability theory. In this model the failure of any component of the system does not influence the components still at work. Sequential k-out-of-n systems have been introduced as an extension of k-out-of-n systems where the failure of some component of the system may influence the remaining ones. We consider nonparametric estimation of the cumulative hazard function, the reliability function and the quantile function of sequential k-out-of-n systems. Furthermore, nonparametric hypothesis testing for sequential k-out-of-n-systems is examined. We make use of counting processes to show strong consistency and weak convergence of the estimators and to derive the asymptotic distribution of the test statistics.     

Composite Integers n for Which φ（n）｜n- 1

In this note, we show that the number of composite integers n ≤ x such that φ（n）｜n - 1 is at most O（x^1/2（loglog x）^1/2）, thus improving earlier results by Pomerance and by Shan.     

<Emphasis Type="Italic">∂</Emphasis>-operations and <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">V</Emphasis></Subscript>-fields

The hyperoperations, called theta-operations （δ）, are motivated from the usual property, which the derivative has on the derivation of a product of functions. Using any map on a set, one can define δ-operations. In this paper, we continue our study on the δ-operations on groupoids, rings, fields and vector spaces or on the corresponding hyperstructures. Using δ-operations one obtains, mainly, Hwstructures, which form the largest class of the hyperstructures. For representation theory of hyperstructures, by hypermatrices, one needs special Hv-rings or Hy-fields, so these hyperstructures can be used. Moreover, we study the relation of these δ-structures with other classes of hyperstructures, especially with the Hv-structures.     

<Emphasis Type="Italic">m</Emphasis> Components-admissible solutions of systems of higher-order partial differential equations on <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Using value distribution theory and techniques in several complex variables,we investigate the problem of existence of m components-admissible solutions of a class of systems of higher-order partial differential equations in several complex variables and estimate the number of admissible components of solutions.Some related results will also be obtained.     

Lacunary Strong (<Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">σ</Emphasis></Subscript><Emphasis Type="Italic">, p</Emphasis>)-Convergence

The definition of lacunary strongly convergence is extended to the definition of lacunary strong (A _σ , p)-convergence with respect to invariant mean when A is an infinite matrix and p = (p _i ) is a strictly positive sequence. We study some properties and inclusion relations.     

Integrable <Emphasis Type="Italic">sl</Emphasis>(<Emphasis Type="Italic">N</Emphasis>, ℂ) tops as Calogero-Moser systems

We show a relation between systems of integrable tops on the algebras sl(N, ℂ) and Calogero-Moser systems of N particles. We construct classical Lax operators corresponding to these systems. We show that these operators are related to certain new trigonometric and rational solutions of the Yang-Baxter equations for the algebras sl(N, ℂ) and give explicit formulas for N = 2, 3. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 158, No. 3, pp. 355–369, March, 2009.     

On the value distribution of <Emphasis Type="Italic">ƒ</Emphasis> + <Emphasis Type="Italic">a</Emphasis>(<Emphasis Type="Italic">ƒ</Emphasis>′)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Let ƒ be a transcendental meromorphic function, a a nonzero finite complex number, and n ⩾ 2 a positive integer. Then ƒ + a(ƒ′) ⁿ assumes every complex value infinitely often. This answers a question of Ye for n = 2. A related normality criterion is also given. This work was supported by the National Natural Science Foundation of China (Grant No. 10771076), the Natural Science Foundation of Guangdong Province, China (Grant No. 07006700) and by the German-Israeli Foundation for Scientific Research and Development (Grant No. G-809-234.6/2003)     

The flatness properties of <Emphasis Type="Italic">S</Emphasis>-poset <Emphasis Type="Italic">A</Emphasis>(<Emphasis Type="Italic">I</Emphasis>) and Rees factor <Emphasis Type="Italic">S</Emphasis>-posets

Let S be a pomonoid and I a proper right ideal of S. In a previous paper, using the amalgamated coproduct A(I) of two copies of _S S over I, we were able to solve one of the problems posed in S. Bulman-Fleming et al. (Commun. Algebra 34:1291–1317, 2006). In the present paper, we investigate further flatness properties of A(I). We also solve another problem stated in the paper cited above. Namely, we determine the condition under which Rees factor S-posets have property (P _w ). Research supported by nwnu-kjcxgc-03-18.     

The existence and uniqueness of solution and the convergence of a multi-step iterative algorithm for a system of variational inclusions with (<Emphasis Type="Italic">A</Emphasis>, <Emphasis Type="Italic">η</Emphasis>, <Emphasis Type="Italic">m</Emphasis>)-accretive operators

In this paper, we introduce and study a new system of variational inclusions with (A, η, m)-accretive operators which contains variational inequalities, variational inclusions, systems of variational inequalities and systems of variational inclusions in the literature as special cases. By using the resolvent technique for the (A, η, m)-accretive operators, we prove the existence and uniqueness of solution and the convergence of a new multi-step iterative algorithm for this system of variational inclusions in real q-uniformly smooth Banach spaces. The results in this paper unifies, extends and improves some known results in the literature.