Stochastic optimization for adaptive labor staffing in service systems

Service systems are labor intensive. Further, the workload tends to vary greatly with time. Adapting the staffing levels to the workloads in such systems is nontrivial due to a large number of parameters and operational variations, but crucial for business objectives such as minimal labor inventory. One of the central challenges is to optimize the staffing while maintaining system steady-state and compliance to aggregate SLA constraints. We formulate this problem as a parametrized constrained Markov process and propose a novel stochastic optimization algorithm for solving it. Our algorithm is a multi-timescale stochastic approximation scheme that incorporates a SPSA based algorithm for ‘primal descent' and couples it with a ‘dual ascent' scheme for the Lagrange multipliers. We validate this optimization scheme on five real-life service systems and compare it with a state-of-the-art optimization tool-kit OptQuest. Being two orders of magnitude faster than OptQuest, our scheme is particularly suitable for adaptive labor staffing. Also, we observe that it guarantees convergence and finds better solutions than OptQuest in many cases.

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.

Fault-tolerant Video on Demand in RSerPool Architecture

With the advent of Internet, video over IP is gaining popularity. In such an environment, scalability and fault tolerance will be the key issues. Existing video on demand (VoD) service systems are usually neither scalable nor tolerant to server faults and hence fail to comply to multi-user, failure-prone networks such as the Internet. Current research areas concerning VoD often focus on increasing the throughput and reliability of single server, but rarely addresses the smooth provision of service during server as well as network failures. Reliable Server Pooling (RSerPool), being capable of providing high availability by using multiple redundant servers as single source point, can be a solution to overcome the above failures. During a possible server failure, the continuity of service is retained by another server. In order to achieve transparent failover, efficient state sharing is an important requirement. In this paper, we present an elegant, simple, efficient and scalable approach which has been developed to facilitate the transfer of state by the client itself, using extended cookie mechanism, which ensures that there is no noticeable change in disruption or the video quality.

Carbon potential measurements on some actinide carbides

Uranium-Plutonium mixed carbide with a Pu/(U+Pu) ratio of 0.55 is to be used as the fuel in the Fast Breeder Test Reaotor - (PBTRj at Kalpakkam, India. carbur ization of the stainlese steel clad by this fuel is determined by its carbon potential. - i. Because the carbon potential of this fuel composition is not 1 available in the literature, it was meadured by the methanehydrogen gas equilibration technique. The sample was equilibrated with purified hydrogen and the equilibrium methane-tohydrogen ratio in the gas phase was measured with a flame ionization detector. The carbon potential of the ThC-ThCz as well as Mo-Mo2C system,whiah is an important binary in the aotinide-fission product-carbon systems, were also measured by this technique, in the temperature range 973 K to 1173 K. The data for ! the Mo-MozC system are in agreement with values reported in the literature. The results for the ThC-ThC2 system are different from estimated values with large unaertainty limits given in the literature. The data on (U,Pu) mixed carbide indicates possibility of stainlesss steel clad attack under isothermal equilibrium conditions.

On the optimality of exhaustive service policies in multiclass queueing systems with modulated arrivals and switchovers

Consider a single-server multiclass queueing system with K classes where the individual queues are fed by K-correlated interrupted Poisson streams generated in the states of a K-state stationary modulating Markov chain. The service times for all the classes are drawn independently from the same distribution. There is a setup time (and/or a setup cost) incurred whenever the server switches from one queue to another. It is required to minimize the sum of discounted inventory and setup costs over an infinite horizon. We provide sufficient conditions under which exhaustive service policies are optimal. We then present some simulation results for a two-class queueing system to show that exhaustive, threshold policies outperform non-exhaustive policies.

Hybrid systems through natural product leads: An approach towards new molecular entities

Hybrid systems are constructs of different molecular entities, natural or unnatural, to generate functional molecules in which the characteristics of various components are modulated, amplified or give rise to entirely new properties. These hybrids can be designed from carefully selected components either through domain intergration of key structural/functional features or via straightforward covalent linkages. Some of the recently reported hybrid systems based on steroid, carbohydrate, C-60-fullerene platforms, amongst others, mainly crafted with the object of enhancement of the therapeutical spectrum, will be discussed.

Bridged systems via radical cyclization reactions. Stereospecific synthesis of chiral tricyclo[6.2.1.0(1,5)]undecanes

The application of radical-mediated cyclizations and annulations in organic synthesis has grown in importance steadily over the years to reach the present status where they are now routinely used in the strategy-level planning.2 The presence of a quaternary carbon atom is frequently encountered in terpenoid natural products, and it often creates a synthetic challenge when two or more quaternary carbon atoms are present in a contiguous manner.3 Even though creation of a quaternary carbon atom by employing a tertiary radical is very facile, creation of a quaternary carbon atom (or a spiro carbon atom) via radical addition onto a fully substituted olefinic carbon atom is not that common but of synthetic importance. For example, the primary radical derived from the bromide 1 failed to cyclize to generate the two vicinal quaternary carbon atoms and resulted in only the reduced product 2.4 The tricyclic carbon framework tricyclo[6.2.1.01,5]undecane (3) is present in a number of sesquiterpenoids e.g. zizzanes, prelacinanes, etc.5

Reactivity of Cationic Terminal Borylene Complexes: Novel Mechanisms for Insertion and Metathesis Chemistry Involving Strongly Lewis Acidic Ligand Systems

The reactions of terminal borylene complexes of the type [CpFe(CO)(2)(BNR2)](+) (R = `Pr, Cy) with heteroallenes have been investigated by quantum-chemical methods, in an attempt to explain the experimentally observed product distributions. Reaction with dicyclohexylcarbodiimide (CyNCNCy) gives a bis-insertion product, in which 1 equiv of carbodiimide is assimilated into each of the Fe=B and B=N double bonds to form a spirocyclic boronium system. In contrast, isocyanates (R'NCO, R' = Ph, 2,6-wXy1, CY; XYl = C6H3Me2) react to give isonitrile complexes of the type [CpFe(CO)(2)(CNR')]+, via a net oxygen abstraction (or formal metathesis) process. Both carbodiimide and socyanate substrates are shown to prefer initial attack at the Fe=B bond rather than the B=N bond of the borylene complex. Further mechanistic studies reveal that the carbodiimide reaction ultimately leads to the bis-insertion compounds [CpFe(CO)(2)C(NCy)(2)B(NCY)(2)CNR2](+), rather than to the isonitrile system [CpFe(CO)(2)(CNCy)](+), on the basis of both thermodynamic (product stability) and kinetic considerations (barrier heights). The mechanism of the initial carbodiimide insertion process is unusual in that it involves coordination of the substrate at the (borylene) ligand followed by migration of the metal fragment, rather than a more conventional process: i.e., coordination of the unsaturated substrate at the metal followed by ligand migration. In the case of isocyanate substrates, metathesis products are competitive with those from the insertion pathway. Direct, single-step metathesis reactivity to give products containing a coordinated isonitrile ligand (i.e. [CpFe(CO)(2)(CNR')](+)) is facile if initial coordination of the isocyanate at boron occurs via the oxygen donor (which is kinetically favored); insertion chemistry is feasible when the isocyanate attacks initially via the nitrogen atom. However, even in the latter case, further reaction of the monoinsertion product so formed with excess isocyanate offers a number of facile (low energetic barrier) routes which also generate ['CpFe(CO)(2)(CNR')](+), rather than the bis-insertion product [CpFe(CO)(2)C(NR')(O)B(NR')(O)CNR2](+) (i.e., the direct analogue of the observed products in the carbodiimide reaction).

Comparative study of lead-acid batteries for photovoltaic stand-alone lighting systems

The lead-acid battery is often the weakest link in photovoltaic (PV) installations. Accordingly, various versions of lead-acid batteries, namely flooded, gelled, absorbent glass-mat and hybrid, have been assembled and performance tested for a PV stand-alone lighting system. The study suggests the hybrid VRLA batteries, which exhibit both the high power density of absorbent glass-mat design and the improved thermal properties of the gel design, to be appropriate for such an application. Among the VRLA-type batteries studied here water loss for the hybrid VRLA batteries is minimal and charge-acceptance during the service at high temperatures is better in relation to their AGM counterparts.

MAC design for heterogeneous application support in OFDM based wireless systems

With the increasing adoption of wireless technology, it is reasonable to expect an increase in file demand for supporting both real-time multimedia and high rate reliable data services. Next generation wireless systems employ Orthogonal Frequency Division Multiplexing (OFDM) physical layer owing, to the high data rate transmissions that are possible without increase in bandwidth. Towards improving file performance of these systems, we look at the design of resource allocation algorithms at medium-access layer, and their impact on higher layers. While TCP-based clastic traffic needs reliable transport, UDP-based real-time applications have stringent delay and rate requirements. The MAC algorithms while catering to the heterogeneous service needs of these higher layers, tradeoff between maximizing the system capacity and providing fairness among users. The novelly of this work is the proposal of various channel-aware resource allocation algorithms at the MAC layer. which call result in significant performance gains in an OFDM based wireless system.

A systematic design of high-rate full-diversity space-frequency codes for MIMO-OFDM systems

This paper presents a systematic construction of high-rate and full-diversity space-frequency block codes for MIMO-OFDM systems. While all prior constructions offer only a maximum rate of one complex symbol per channel use, our construction yields rate equal to the number of transmit antennas and simultaneously achieves full-diversity. The proposed construction works for arbitrary number of transmit antennas and arbitrary channel power delay profile. A key step in this construction is the generalization of the stacked matrix code design criteria given by Bolcskei et.al., (IEEE WCNC 2000). Explicit equivalence of our generalized code design criteria with the Hadamard-product based criteria of W. Su et.al., (lEEE Trans. Sig. Proc. Nov 2003) is established and new high-rate codes are constructed using our criteria.

Note on the locally product and almost locally product structures

This paper is concerned with a study of some of the properties of locally product and almost locally product structures on a differentiable manifold X n of class C k . Every locally product space has certain almost locally product structures which transform the local tangent space to X n at an arbitrary point P in a set fashion: this is studied in Theorem (2.2). Theorem (2.3) considers the nature of transformations that exist between two co-ordinate systems at a point whenever an almost locally product structure has the same local representation in each of these co-ordinate systems. A necessary and sufficient condition for X n to be a locally product manifold is obtained in terms of the pseudo-group of co-ordinate transformations on X n and the subpseudo-groups [cf., Theoren (2.1)]. Section 3 is entirely devoted to the study of integrable almost locally product structures.

A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.