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     

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.     

Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems

Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems for scalar-valued measures on rings of sets that are in general not σ-rings are presented. As a consequence, the rings of subsets of N with density zero and uniform density zero are shown to have the Nikodym property. In addition, vector measure generalizations of the Vitali–Hahn–Saks theorem are given.     

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.     

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.