An algorithm to locate perinatal facilities in the municipality of Rio de Janeiro

In order to reduce infant mortality in the municipality of Rio de Janeiro it is desired to encourage all mothers-to-be to attend the appropriate health care facilities. A 3-level hierarchical prenatal–neonatal health care system is described together with a basic model for optimising accessibility to facilities. A genetic algorithm to solve the basic model is developed and some numerical experience reported. Extensions to the basic model and planned future research are briefly indicated.     

Inversion of adjunction for non-degenerate hypersurfaces

 We prove a precise inversion of adjunction formula for the log variety (ℂ ^{d +1},X), where X is a non-degenerate hypersurface. As a corollary, the minimal log discrepancies of non-degenerate normal hypersurface singularities are bounded by dimension. Received: 17 September 2002 / Revised version: 22 November 2002 Published online: 14 February 2003 Current address: DPMMS, CMS, University of Cambridge, Wilberforce Road, Cambridge CB3 0WB, England. e-mail: f.ambro@dpmms.cam.ac.uk Mathematics Subject Classification (2000): Primary 14B05; Secondary 14M25, 52B20     

WEIGHTED APPROXIMATION ON SZASZ—TYPE OPERATORS

In this paper, we use weighted modules ω(?)(f,t)w to study the pointwise approximation on Szasz-type operators, and obtain the direct and converse theorem, as well as characterizations of the pointwise approximation of Jacobi-weighted Szasz-type operators.     

Structural hierarchy of rock masses and the mechanisms of its formation

The formation mechanisms for the structural hierarchy in geological media are discussed. It is shown that the formation of such a hierarchy is caused by certain external and internal circumstances. The first ones consist in the fact that, because of external actions, the Earth’s poles continuously execute the translational and rotational motions responsible for a regular structure of rock fracture and for the appearance of the scale factor √2. The second ones consist in the fact that, under the action of many random factors and because of external actions, during the formation of geological media there appear dissipative structures and, hence, some self-similar fractal structures are formed.     

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.     

Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.     

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.