An Overview of Scheduling Problems Arising in Satellite Communications

Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints.     

On the existence of <Emphasis Type="Bold">1, 3</Emphasis>P <Emphasis Type="Bold">o</Emphasis> resonances in H<Superscript>-</Superscript> between n = 2 and 3 H thresholds

We examine the influence of relativistic and QED effects on the existence of the ^1,3P ^o H^- resonances between n = 2 and 3 hydrogen thresholds, the relativistic and QED corrections and the coupling effects between the high singlet and triplet states are considered as first-order perturbations. We firstly obtain accurate non-relativistic resonant energies and widths of fifteen ¹P ^o resonances, and fifteen ³P ^o resonances. The fifteen ¹P ^o resonances are classified to be ₃ (2, 0) ^- _n ( 4 ? n ? 12) and ₃ (1, 1) ⁺ _n ( 3 ? n ? 8). The fifteen ³P ^o resonances are classified to be ₃ (2, 0) ⁺ _n ( 3 ? n ? 12) and ₃ (1, 1) ^- _n ( 4 ? n ? 8). We found there exist six Feshbach resonances for ₃ (2, 0) ^- _n (¹P ^o ) series, four Feshbach resonances for ₃ (1, 1) ⁺ _n (¹P ^o ) series, seven Feshbach resonances for ₃ (2, 0) ⁺ _n (³P ^o ) series, and three Feshbach resonances for ₃ (1, 1) ^- _n (¹P ^o ) series. Received 22 February 2002 Published online 24 September 2002     

Calorimeter energy calibration using the energy conservation law

A new calorimeter energy calibration method was developed for the proposed ILC detectors. The method uses the center-of-mass energy of the accelerator as the reference. It has been shown that using the energy conservation law it is possible to make ECAL and HCAL cross calibration to reach a good energy resolution for the simple calorimeter energy sum.      

A possibility of parallel and anti-parallel diffraction measurements on neutron diffractometer employing bent perfect crystal monochromator at the monochromatic focusing condition

In a conventional diffractometer having single monochromator, only one position, parallel position, is used for the diffraction experiment (i.e. detection) because the resolution property of the other one, anti-parallel position, is very poor. However, a bent perfect crystal (BPC) monochromator at monochromatic focusing condition can provide a quite flat and equal resolution property at both parallel and anti-parallel positions and thus one can have a chance to use both sides for the diffraction experiment. From the data of the FWHM and the Δd/d measured on three diffraction geometries (symmetric, asymmetric compression and asymmetric expansion), we can conclude that the simultaneous diffraction measurement in both parallel and anti-parallel positions can be achieved.     

On deformations of Hamiltonian actions

In this paper we generalize to coisotropic actions of compact Lie groups a theorem of Guillemin on deformations of Hamiltonian structures on compact symplectic manifolds. We show how one can reconstruct from the moment polytope the symplectic form on the manifold. Received: 21 March 2006     

Commutative idempotent residuated lattices

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Sudoku’s french ancestors

This column is a place for those bits of contagious mathematics that travel from person to person in the community, because they are so elegant, suprising, or appealing that one has an urge to pass them on. Contributions are most welcome.