Randomized control of T-policy for an M/G/1 system

We study an M/G/1 queueing system with a server that can be switched on and off. The server can take a vacation time T after the system becomes empty. In this paper, we investigate a randomized policy to control a server with which, when the system is empty, the server can be switched off with probability p and take a vacation or left on with probability (1 − p) and continue to serve the arriving customers. For this system, we consider the operating cost and the holding cost where the operating cost consists of the system running and switching costs (start up and shut down costs). We describe the structure and characteristics of this policy and solve a constrained problem to minimize the average operating cost per unit time under the constraint for the holding cost per unit time.     

The interdeparture time distribution for each class in the ∑Mi/Gi/1 queue with set-up times and repeated server vacations

This paper studies the interdeparture time distribution of one class of customers who arrive at a single server queue where customers of several classes are served and where the server takes a vacation whenever the system becomes empty or is empty when the server returns from a vacation. Furthermore, the first customer in the busy period is allowed to have an exceptional service time (set-up time), depending on the class to which this customer belongs. Batches of customers of each class arrive according to independent Poisson processes and compete with each other on a FIFO basis. All customers who belong to the same class are served according to a common generally distributed service time. Service times, batch sizes and the arrival process are all assumed to be mutually independent. Successive vacation times of the server form independent and identically distributed sequences with a general distribution.For this queueing model we obtain the Laplace transform of the interdeparture time distribution for each class of customers whose batch size is geometrically distributed. No explicit assumptions of the batch size distributions of the other classes of customers are necessary to obtain the results.The paper ends by showing how the mathematical results can be used to evaluate a protocol that controls access to a shared medium of an ATM passive optical network. The numerical results presented in the last section of this paper show that the bundle spacing principle that is used by the permit distribution algorithm of this protocol introduces high delays and in many cases also more variable interdeparture times for the ATM cells of individual connections. An alternative algorithm is proposed that does not cope with these performance short comings and at the same time conserves the good properties of the protocol.     

M/G/c/K blocking probability models and system performance

An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.     

Optimal M/G/1 server location on a tree network with continuous link demands

This paper represents two major extensions of Hakimi's one-median problem specialized on a tree network T:(i) queueing delay is explicitly included in the objective function, and (ii) probabilistic demands for service can originate continuously along a link as well as discretely at a node. Calls for service occur as a time-homogeneous Poisson process. A single mobile server resides at a facility located on T. The server, when available, is dispatched immediately to any demand that occurs. When a customer finds the server busy with previous demand, it is entered into a first-come first-served queue. One desires to locate a facility on T so as to minimize the average response time, which is the sum of mean queueing delay and mean travel time. Convexity properties of the average response time and related functions allow us to develop an efficient two-stage algorithm for finding the optimal location. We also analytically trace the trajectory of the optimal location when the Poisson arrival rate is varied. A numerical example is constructed to demonstrate the algorithm as well as the trajectory results.     

Sn1-xFexOy: a new material with high carbon monoxide sensitivity

The preparation method and the sensing properties (sensitivity and selectivity to interfering gases) towards carbon monoxide of the new ternary compound Sn_1-xFe_xO_y deposited in the form of thin films, are presented in this paper. The metal of the VIIIB group is introduced with concentrations in the range 0<x<25 at %. Thin films are sputtered using the RGTO (rhotaxial growth and thermal oxidation) technique. This technique consists of metal deposition onto a substrate maintained at a temperature higher than the metal melting point and metal oxidation by means of an annealing cycle in pure oxygen. Particular emphasis is given to the relations between some preparation parameters of the material, namely the atomic percentage ofiron or the annealing cycle, and to the sensor sensitivity towards CO and other interfering gases like C₂H₅OH, H₂ and NO_x diluted in dry air. A sensitivity S=(G_gas-G_air)/G_air=3.5 towards 10 ppm of CO has been measured: the kinetic characteristics of the sensors are also presented, together with the working mechanism.     

Discrete-time system modelling in Lp with orthonormal basis functions

In this paper, model sets for linear time-invariant systems spanned by fixed pole orthonormal bases are investigated. The obtained model sets are shown to be complete in L_p(T) (1<p<∞), the Lebesque spaces of functions on the unit circle T, and in C(T), the space of periodic continuous functions on T. The L_p norm error bounds for estimating systems in L_p(T) by the partial sums of the Fourier series formed by the orthonormal functions are computed for the case 1<p<∞. Some inequalities on the mean growth of the Fourier series are also derived. These results have application in estimation and model reduction.     

Efficient implementation of Johnson''s rule for the n/2/F/Fmax scheduling problem

Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.     

Gas-sensing property and mechanism of CaxLa1−xFeO3 ceramics

LaFEO₃ and Ca_xLa_1−xFeO₃ ceramic powders have been prepared by the coprecipitation method from La(NO₃)₃, Fe(NO₃)₃ and Ca(NO₃)₂ aqueous solutions. The orthorhombic perovskite phases of LaFeO₃ and Ca_xLa_1−xFeO₃ are characterized by X-ray diffraction patterns. The sensors fabricated with those powders have high sensitivity to alcohol. Partial substitution of La³⁺ in LaFeO₃ with Ca²⁺ can enhance the sensitivity of the materials to reducing gases. The resistance of an LaFeO₃ sensor in air, vacuum and alcohol-containing air has been measured. Complex impedance spectroscopy has been used to try and analyse the gas-sensing mechanism. According to the experimental results, it can be deduced that the surface adsorptive and lattice oxygen govern the sensing properties of LaFeO₃ and Ca_xLa_1−xFeO₃ ceramics.     

Periodic discrete-time one-channel GI/G/1 retrial queuing system with FCFS service discipline

A discrete-time one-channel queuing system with general inter-arrival, service, and orbit times periodically dependent on the number of arrival is considered. The service discipline is assumed to be FCFS. The sufficient condition for the ergodicity of an embedded Markov chain is derived.     

Finding a Region with the Minimum Total L1 Distance from Prescribed Terminals

Given k terminals and n axis-parallel rectangular obstacles on the plane, our algorithm finds a plane region R ^* such that, for any point p in R ^* , the total length of the k shortest rectilinear paths connecting p and the k terminals without passing through any obstacle is minimum. The algorithm is output-sensitive, and takes O((K+n) log n) time and O(K+n) space if k is a fixed constant, where K is the total number of polygonal vertices of the found region R ^* .     

Manufacture and characterization of sol–gel V1−x−yWxSiyO2 films for uncooled thermal detectors

V_1−x−yW_xSi_yO₂ films for uncooled thermal detectors were coated on sodium-free glass slides with sol–gel process, followed by the calcination under a reducing atmosphere (Ar/H₂ 5%). The V_1−x−yW_xSi_yO₂ films as prepared inherit various phase transition temperatures ranging from 20 to 70 °C depending on the dopant concentrations and the fabrication conditions. Compared to the hysteresis loop of plain VO₂ films, a rather steep loop was obtained with the addition of tungsten components, while a relaxed hysteresis loop with the tight bandwidth was contributed by Si dopants. Furthermore, the films with switching temperature close to room temperature were fabricated to one-element bolometers to characterize their figures of merit. Results showed that the V_0.905W_0.02Si_0.075O₂ film presented a satisfactory responsivity of 2600 V/W and detectivity of 9 × 10⁶ cm  Hz^1/2/W with chopper frequencies ranging from 30 to 60 Hz at room temperature. It was proposed that with appropriate amount of silicon and tungsten dopants mixed in the VO₂, the film would characterize both a relaxed hysteresis loop and a fair TCR value, which effectively reduced the magnitude of noise equivalent power without compromising its performance in detectivity and responsivity.     

Security of Wang et al.''s group-oriented (t,n) threshold signature schemes with traceable signers

This paper describes a new forgery attack on the group-oriented (t,n) threshold signature schemes proposed by Wang et al. Our attack is more fundamental than Tseng–Jan's attack in the sense that it cannot be recognized or blocked at the designated clerk level of the signature schemes.     

Optimal (N,T)-policy for M/G/1 system with cost structures

In this paper, the optimal (N,T)-policy for M/G/1 system with cost structure is studied. The system operates only intermittently. It is shut down when no customers are present. A fixed set-up cost of K>0 is incurred each time the system is reopened. Also, a holding cost of h>0 per unit time is incurred for each customer present. The (N,T)-policy studied for this system is as follows: the system reactivates as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T (see A.S. Alfa, I. Frigui, Eur. J. Oper. Res. 88 (1996) 599-613; Y.N. Doganata, in: E. Arikan (Ed.), Communication, Control, and Signal Processing, 1990, pp. 1663–1669). Later on, as a comparison, the start of the timer count is relaxed as follows: the system reactivates as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. For both cases, the explicit optimal policy (N^*,T^*) for minimizing the long-run average cost per unit time are obtained. As extreme cases, we include the simple optimal policies for N-and T-polices. Several counter-intuitive results are obtained about the optimal T-policies for both types of models.     

The MAP/PH/N multi-server queuing system with broadcasting service discipline and server heating

A multiserver queuing system with an infinite buffer is considered. The incoming customer is described by a Markovian input flow. The heating time of the servers and the time of the customer service have a phase type distribution. The heating of all the free servers starts at the customer’s arrival moment, and the customer receives the service by all these servers after the heating’s termination. The steady state distribution of the customers and their sojourn time in a system are found. The basic performance measures of the system are calculated. The results of the numerical experiments show the potential usability of the proposed service discipline in comparison with the classical one.     

Full-rank representation of generalized inverse AT,S and its application

In this paper, we introduce a full-rank representation of the generalized inverse of a given complex matrix A, which is based on an arbitrary full-rank decomposition of G, where G is a matrix such that R(G)=T and N(G)=S. Using this representation, we introduce the minor of the generalized inverse ; as a special case of the minor, a determinantal representation of the generalized inverse is obtained. As an application, we use an example to demonstrate that this representation is correct.     

Design and implementation of an adaptive predictive controller for combustor NOx emissions

This paper is concerned with the design and implementation of an adaptive predictive controller for oxides of nitrogen (NO_x) emissions from gas turbine combustors. Predictive control techniques with both fixed and adaptive parameters are introduced. An online parameter estimation algorithm is used to model the nonlinear characteristics of the combustor NO_x process. The predictive control strategies are implemented using the MATLAB/dSPACE, controller development environment. Their performance is evaluated on an atmospheric test rig fitted with a commercial combustor and also compared with a PID controller. ©     

Performance analysis of non-preemptive GE/G/1 priority queueing of LER system with bulk arrivals

M^X/G/1 non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the number of priorities is greater than 2, the analysis for priority processes is obviously very difficult to handle. Therefore, the earlier work on the subject was restricted mostly to two priority classes; and second, although analytically explicit results are available, they require sophisticated closed-form expressions of the mean queue length. One particular bulk size distribution – the GE distribution – is motivated by an ME (Maximum Entropy) formulation for the behavior of a G/G/1 queue. The choice of a GE distribution is motivated by the fact that measurements of actual inter-arrival traffic or service times may be generally limited and so only few parameters, such as mean and variance, can be computed reliably. Thus this paper we can obtain very simple and analytic closed-form expression for the mean queue length of a GE/G/1 priority queue and a significant increase in performance evaluation has been achieved. We present the four-class priority queues, performance analysis and simulation of the LER (Label Edge Router) system in the ATM-based MPLS (Multiprotocol Label Switching) network. We wish to obtain the boundary conditions of the mean queue lengths and the mean queueing delays for each priority class, since this metric is one of the most important in performance evaluation parameters for improving QoS and system performance of the LER system in ATM-based MPLS network. A significant numerical example is presented and discussed as well. In order to obtain optimizing the performance analysis for EF flow, AF 1 flow, AF 2 flow and BE flow, the optimum ratios of COV (Coefficient of Variation) can be found via many numerical experiments carried out by the authors for queueing network model with HOL (Head of Line) priority rules. However, the ratios of COV value constraints exist. Furthermore, we find that each service class gradually begins to deteriorate when SQVs (Squared Coefficient of Variations), , and traffic intensity is greater than 0.95. We also find the values of maximum allowed burst size for EF flow and AF 1 flow and perform necessary policing actions on EF flow and AF 1 flow at the boundary node of the network. Finally, the four-class GE/G/1 priority queues and performance analysis of the LER system are shown accurate and robust after the comparison between theoretical evaluates and computer simulation results.     

On exact computational analysis of distributions of numbers in systems for M/G/1/N + 1 and GI/M/1/N + 1 queues using roots

In this paper, we obtain the distribution of number in system and other measures of efficiency for the M/G/1/N + 1 queuing system in terms of the roots of the associated characteristic equation (CE). Results for the GI/M/1/N + 1 queuing system have also been obtained from those of M/G/1/N + 1. Numerical results in the form of tables and graphs have been presented for a variety of service-(interarrival-) time distributions, e.g. Erlang (E_k), generalized Erlang (GE_k) and hyperexponential (HE_k).