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.     

Using Bandwidth-Space Partitioning to Improve Cell Coverage and Near-Far Unfair Access Problem in a Noise-Limited CDMA Cellular Network

This paper concerns CDMA cellular networks equipped with conventional matched filter receivers. For this type of cellular networks, two problems exist. One is the inverse relationship between the coverage and capacity, and the other one is the near-far unfair access problem. To resolve these two problems, a bandwidth-space partitioning technique is adopted. Several admission control schemes based on the bandwidth-space partitioning technique are proposed, and their performances are evaluated based on the simulation.Shih-Tsung Yang received his B.S. (1989) and M.S. (1991) degrees in electrical engineering from the National Taiwan University, and Ph.D. (1999) degree in electrical and computer engineering from University of Maryland, College Park.From 1999 to 2000, he was with SBC Technology Resourtces, Inc. where he was involved in the network architecture design for the ATM based networks. From November 2000 to May 2003, he was with Transilica/Microtune where he was involved in the design of Baseband and RF for the wireless communications. Since May 2003, Dr. Yang is now with Genesys Logic, Inc. where he is responsible for the baseband design of the WLAN and Ethernet.Dr. Yang’s research interests are in the area of Digital Communications, Communication networks and signal processing. E-mail: thomas.yang@genesyslogic.com.twAnthony Ephremides received his B.S. degree from the National Technical University of Athens (1967), and M.S. (1969) and Ph.D. (1971) degrees from Princeton University, all in Electrical Engineering. He has been at the University of Maryland since 1971, and currently holds a joint appointment as Professor in the Electrical Engineering Department and in the Institute of Systems Research (ISR) of which he is a founding member. He is co-founder of the NASA Center for Commercial Development of Space on Hybrid and Satellite Communications Networks established in 1991 at Maryland as an off-shoot of the ISR. He served as Co-Director of that Center from 1991 to 1994.He was a Visiting Professor in 1978 at the National Technical University in Athenas, Greece, and in 1979 at the EECS Department of the University of California, Berkeley, and at INRIA, France. During 1985-1986 he was on leave at MIT and ETH in Zurich, Switzerland. He was the General Chairman of the 1986 IEEE Conference on Decision and Control in Athens, Greece and of the 1991 IEEE International Symposium on Information Theory in Budapest, Hungary. He also organized two workshops on Information theory in 1984 (Hot Springs, VA) and in 1999 (Metsovo, Greece). He was the Technical Program Co-Chair of the IEEE INFOCOM in New York City in 1999 and of the IEEE International Symposium on Information theory in Sorrento, Italy in 2000. He has also been the Director of the Fairchild Scholars and Doctoral Fellows Program, an academic and research partnership program in Satellite Communications between Fairchild Industries and the University of Maryland. He won the IEEE Donald E. Fink Prize Paper Award (1992) and he was the first recipient of the Sigmobile Award of the ACM (Association of Computer Machinery) for contributions to wireless communications in 1997. He has been the President of the Information Theory Society of the IEEE (1987) and has served on its Board of Governors almost continuously from 1981 until the present. He was elected to the Board of Directors of the IEEE in 1989 and 1990. Dr. Ephremides has authored or co-authored over 100 technical journal papers and 300 technical conference presentations. He has also contributed chapters to several books and edited numerous special issues of scientific journals. He has also won awards from the Maryland Office of Technology Liaison for the commercialization of products and ideas stemming from his research. He has served on the Editorial Boards of the IEEE Transactions on Automatic Control, IEEE Transactions on Information theory, the Journal of Wireless Networks, and the International Journal of Satellite Communications.He has been the Dissertation Supervisor of over twenty Ph.D. students who now hold prominent positions in academia, industry, and research labs. He is the founder and President of Pontos, Inc., a Maryland company that provides technical consulting services, since 1980.Dr. Ephremides’ interests are in the areas of communication theory, communication systems and networks, queueing systems, signal processing, and satellite communications. His research has been continuously supported since 1971 by NSF, NASA, ONR, ARL, NRL, NSA, and Industry. E-mail: tony@eng.umd.edu     

The influence of Na<Superscript>+</Superscript> on the anilinepropylsilica xerogel synthesis by using the fluoride nucleophilic catalyst

Anilinepropylsilica xerogel was obtained by using an appropriate organosilane and tetraethyl orthosilicate as precursor reagents. The gelation was carried out using HF and NaF as catalysts. The presence of Na⁺ (when NaF was used) resulted in a decrease in the final organic content of the materials. This effect was interpreted as an inhibition of the organosilane polycondensation possibly due to the Na⁺ interaction with the SiO^- groups of the hydrolyzed organosilane. The presence of Na⁺ also results in morphological changes in the xerogels.     

Local Minimizers of the Ginzburg-Landau Energy with Magnetic Field in Three Dimensions

We establish the existence of locally minimizing vortex solutions to the full Ginzburg-Landau energy in three dimensional simply-connected domains with or without the presence of an applied magnetic field. The approach is based upon the theory of weak Jacobians and applies to nonconvex sample geometries for which there exists a configuration of locally shortest line segments with endpoints on the boundary.Research partially supported by NSERC grant number 261955     

Continuously coupled parametric generators and their quantum statistics

In this paper the quantum-statistical properties of light beams propagating in a directional nonlinear coupler are investigated. This device is composed of a pair of linearly coupled nonlinear waveguides operating by means of degenerate parametric downconversion. The possibility of generation of nonclassical states of light in single and compound modes, using the short-length approximation, is discussed. Influence of linear and nonlinear mismatches for generation of nonclassical light is taken into account. This work was supported by Project LN00A015, Research Project No. CEZ: J14/98 and the COST project OC P11.003 of the Czech Ministry of Education.     

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 the bounded version of Hilbert's tenth problem

 The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The theory I ⁵ E ₁ is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I ⁵ E ₁ cannot prove the MRDP theorem. On the other hand it is shown that I ¹ E ₁ proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I ⁰ E ₁ proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate, ≤₂, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions are definable in 𝒟 then 𝒟=N P. Received: 13 July 2001 / Revised version: 9 April 2002 / Published online: 19 December 2002 Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity