Simultaneous perturbation methods for adaptive labor staffing in service systems

We consider the problem of optimizing the workforce of a service system. Adapting the staffing levels in such systems is non-trivial due to large variations in workload and the large number of system parameters do not allow for a brute force search. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. Our aim is to find the optimum staffing levels from a discrete high-dimensional parameter set, that minimizes the long run average of the single-stage cost function, while adhering to the constraints relating to queue stability and service-level agreement (SLA) compliance. The single-stage cost function balances the conflicting objectives of utilizing workers better and attaining the target SLAs. We formulate this problem as a constrained parameterized Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA)-based algorithms for solving the above problem. The algorithms include both first-order as well as second-order methods and incorporate SPSA-based gradient/Hessian estimates for primal descent, while performing dual ascent for the Lagrange multipliers. Both algorithms are online and update the staffing levels in an incremental fashion. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by our algorithms onto the discrete set. The smoothness is necessary to ensure that the underlying transition dynamics of the constrained Markov cost process is itself smooth (as a function of the continuous-valued parameter): a critical requirement to prove the convergence of both algorithms. We validate our algorithms via performance simulations based on data from five real-life service systems. For the sake of comparison, we also implement a scatter search based algorithm using state-of-the-art optimization tool-kit OptQuest. From the experiments, we observe that both our algorithms converge empirically and consistently outperform OptQuest in most of the settings considered. This finding coupled with the computational advantage of our algorithms make them amenable for adaptive labor staffing in real-life service systems.

A probabilistic constrained nonlinear optimization framework to optimize RED parameters

The random early detection (RED) technique has seen a lot of research over the years. However, the functional relationship between RED performance and its parameters viz,, queue weight (omega(q)), marking probability (max(p)), minimum threshold (min(th)) and maximum threshold (max(th)) is not analytically availa ble. In this paper, we formulate a probabilistic constrained optimization problem by assuming a nonlinear relationship between the RED average queue length and its parameters. This problem involves all the RED parameters as the variables of the optimization problem. We use the barrier and the penalty function approaches for its Solution. However (as above), the exact functional relationship between the barrier and penalty objective functions and the optimization variable is not known, but noisy samples of these are available for different parameter values. Thus, for obtaining the gradient and Hessian of the objective, we use certain recently developed simultaneous perturbation stochastic approximation (SPSA) based estimates of these. We propose two four-timescale stochastic approximation algorithms based oil certain modified second-order SPSA updates for finding the optimum RED parameters. We present the results of detailed simulation experiments conducted over different network topologies and network/traffic conditions/settings, comparing the performance of Our algorithms with variants of RED and a few other well known adaptive queue management (AQM) techniques discussed in the literature.

Simultaneous Electrodeposition of MnO2 and Mn(OH)(2) for Supercapacitor Studies

Among the various Mn compounds, both MnO2 and Mn(OH)2 are electrochemically active in supercapacitor studies. MnO2 and Mn(OH)2 are simultaneously deposited, through a one-pot method, on the anode and cathode, respectively, of a galvanostatic electrolysis cell consisting of aqueous Mn(NO3)2 electrolyte. MnO2 and Mn(OH)2 coated stainless steel (SS) electrodes are found to exhibit a capacitive behavior with a high specific capacitance. MnO2/SS and Mn(OH)2/SS electrodes are used as the negative and positive electrodes, respectively, in assembling nonsymmetrical capacitors and testing. The results indicate that both Mn-based electrodes prepared simultaneously in a single electrolysis possess interesting electrochemical properties for supercapacitor application.

A Note on the Genericity of Simultaneous Stabilizability and Pole Assignability

n this paper we study the genericity of simultaneous stabilizability, simultaneous strong stabilizability, and simultaneous pole assignability, in linear multivariable systems. The main results of the paper had been previously established by Ghosh and Byrnes using state-space methods. In contrast, the proofs in the present paper are based on input-output arguments, and are much simpler to follow, especially in the case of simultaneous and simultaneous strong stabilizability. Moreover, the input-output methods used here suggest computationally reliable algorithms for solving these two types of problems. In addition to the main results, we also prove some lemmas on generic greatest common divisors which are of independent interest.

Simultaneous display of spectrum and image in a single plane, and the realization of a lensless coherent optical processor

A novel method, designated the holographic spectrum reconstruction (HSR) method, is proposed for achieving simultaneous display of the spectrum and image of an object in a single plane. A study of the scaling behaviour of both the spectrum and the image has been carried out and based on this study, it is demonstrated that a lensless coherent optical processor can be realized.

On the Conversion of Hensel Codes to Farey Rationals

Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The first algorithm is based on the trial and error factorization of the weight of a Hensel code, inversion and range test. The second algorithm is deterministic and uses a pair of different p-adic systems for simultaneous computation; from the resulting weights of the two different Hensel codes of the same rational, two equivalence classes of rationals are generated using the respective primitive roots. The intersection of these two equivalence classes uniquely identifies the rational. Both the above algorithms are exponential (in time and/or space).

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters I. Algorithm

The simultaneous state and parameter estimation problem for a linear discrete-time system with unknown noise statistics is treated as a large-scale optimization problem. The a posterioriprobability density function is maximized directly with respect to the states and parameters subject to the constraint of the system dynamics. The resulting optimization problem is too large for any of the standard non-linear programming techniques and hence an hierarchical optimization approach is proposed. It turns out that the states can be computed at the first levelfor given noise and system parameters. These, in turn, are to be modified at the second level.The states are to be computed from a large system of linear equations and two solution methods are considered for solving these equations, limiting the horizon to a suitable length. The resulting algorithm is a filter-smoother, suitable for off-line as well as on-line state estimation for given noise and system parameters. The second level problem is split up into two, one for modifying the noise statistics and the other for modifying the system parameters. An adaptive relaxation technique is proposed for modifying the noise statistics and a modified Gauss-Newton technique is used to adjust the system parameters.

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters II. Numerical performance

A very general and numerically quite robust algorithm has been proposed by Sastry and Gauvrit (1980) for system identification. The present paper takes it up and examines its performance on a real test example. The example considered is the lateral dynamics of an aircraft. This is used as a vehicle for demonstrating the performance of various aspects of the algorithm in several possible modes.

On the Solution of Certain Simultaneous Pairs of Dual Integral Equations

Mit einer direkten Methode, bei der der Erdelyi-Kober- und der modifizierte Hankel-Operator Anwendung finden, werden gewisse Systeme aus zwei bzw. drei Paaren dualer Integralgleichungen mit Bessel-Kernen in geschlossener Form gelöst. Für bestimmte Funktionenklassen und Ordnungen der Bessel-Funktionen ist die Vorgehensweise angebrachter und geeigneter als die bereits existierenden Methoden.

Crossover frequencies in multicomponent plasma

A method for finding the roots of the equation D = O in a multicomponent plasma with positive and negative ion species is given. The use of dispersion diagrams (omega-k diagrams) for right- and left-circularly polarized waves is made to locate these roots in pass or stop bands. ©1973 American Institute of Physics.

The dynamic stability of degenerate systems under parametric excitation

The parametric resonance in a system having two modes of the same frequency is studied. The simultaneous occurence of the instabilities of the first and second kind is examined, by using a generalized perturbation procedure. The region of instability in the first approximation is obtained by using the Sturm's theorem for the roots of a polynomial equation.

Analytical method for solving a set of inhomogeneous infinite simultaneous equations

It is shown that a method based on the principle of analytic continuation can be used to solve a set of inhomogeneous infinite simultaneous equations encountered in the analysis of surface acoustic wave propagation along the periodically perturbed surface of a piezoelectric medium.

Analytical method for solving a set of infinite simultaneous equations

It is shown that a method based on the principle of analytic continuation can be used to solve a set of infinite simultaneous equations encountered in solving for the electric field of a periodic electrode structure.

De novo synthesis of acetylcholinesterase in roots of Pisum sativum

Pisum sativum seeds contain a conserved acetylcholinesterase (AChE) which is active during the early stages of germination. The enzyme activity soon disappears and reappears after 72 hr of germination. A protein devoid of catalytic ability, but exhibiting similar chromatographic and electrophoretic properties as the active AChE, could be detected after 24 hr of germination. The pattern of incorporation of labelled amino acids into AChE and the influence of cycloheximide revealed that the AChE found in the roots from 72 hr onwards was entirely new. During this period of growth, the AChE protein accounts for 4–10% of the total proteins in the root tissue.

Synthesis of Thioesters by Simultaneous Activation of Carboxylic Acids and Alcohols Using PPh3/NBS with Benzyltriethylammonium Tetrathiomolybdate as the Sulfur Transfer Reagent

A new and simple route for the synthesis of thioesters starting from carboxylic acids and alcohols is reported by using tetrathiomolybdate as the key sulfur transfer reagent. Triphenylphosphane and N-bromosuccinimide were used for the activation of the carboxylic acid and alcohol in the same pot followed by the transfer of sulfur from tetrathiomolybdate. Thioesters were obtained in good to moderate yields. Primary alcohols show excellent reactivity and gave good yields of the corresponding thioesters, whereas secondary alcohols gave moderate yields and tertiary alcohols were very less reactive and gave poor yields of the corresponding thioesters.