Adaptive server staffing in the presence of time-varying arrivals: a feed-forward control approach

We study the short-term staffing problem of systems that experience random, non-stationary demand. The typical method to accommodate changes in arrival rate is to use historical data to identify peak periods and associated forecasting for upcoming time windows. In this paper, we develop a method that instead detects change as it happens. Motivated by an automatic call distributor system in a call centre with time-varying arrivals, we propose a change detection algorithm based upon non-homogeneous Poisson processes. The proposed method is general and may be thought of as a feed-forward strategy, in which we detect a change in the arrival process, estimate the new magnitude of the arrival rate, and assign an appropriate number of servers to the tasks. The generalized likelihood ratio statistic is used and a recommendation for its decision limit is developed. Simulation results are used to evaluate the performance of the detector in the context of a telephone call centre.     

Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network

This paper considers a receiver set partitioning and sequencing problem in a wavelength division multiplexing single-hop lightwave network for multicasting traffic. The problem is analysed in the approach of uncapacitated single batch-processing machine scheduling. In the analysis, several solution properties are characterized with respect to a mean flow time measure, based upon which two heuristic algorithms are developed, along with a dynamic programming algorithm. Several numerical experiments show that the heuristic algorithms generate good schedules. The problem is extended to consider two measures simultaneously including the mean flow time and the number of transmissions, for which the proposed algorithms also perform well.     

Characterization of thermal diffusion in polymer solutions by thermal field-flow fractionation: Dependence on polymer and solvent parameters

The thermal diffusion coefficient D_T has been obtained for 17 polymer-solvent combinations, each of them spanning a range of polymer molecular weights, using thermal field-flow fractionation. The polymers examined include polystyrene, poly(alpha-methyl)styrene, polymethylmethacrylate, and polysioprene. The solvents include benzene, toluene, ethylbenzene, tetrahydrofuran, methylethylketone, ethylacetate, and cyclohexane. Although D_T was confirmed as essentially independent of polymer molecular weight, it was found to vary substantially with the chemical composition of polymer and solvent. The results were used to evaluate several thermal diffusion theories; the agreement with theory was generally found to be unsatisfactory. Attempts were then made to correlate the measured thermal diffusion coefficients with various physicochemical parameters of the polymers and solvent. A good correlation was found in which D_T increases with the thermal conductivity difference of the polymer and solvent and varies inversely with the activation energy of viscous flow of the solvent.     

Loading aircraft for military operations

In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

Reply to Nathan: How to reconstruct the causal argument

Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

A laser Doppler anemometry technique for Reynolds stresses measurement

A technique is described for the measurement of all components of mean velocity and Reynolds stresses, in a complex turbulent flow where achieving coincidence data acquisition is difficult. The method is based on data recorded using four orientations of the laser probe. It is shown that the measurement errors are not the same for all the components of the Reynolds tensor, but they are sufficiently small to give a good accuracy. An application to a turbomachinery flow is given to illustrate the method.