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.     

稀疏过程在破产问题中的应用

本讨论一类人寿保险的风险过程，其中保单到达服从齐次Poisson过程。而描述退保及索赔发生的计数过程分别为这一过程的q-稀疏与p-稀疏．对此模型给出其破产概率的具体上界，并与其它一类风险模型进行比较．     

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.     

Crystallographic report: Bis(isonicotinonitrile)cadmium diselencyanate, [Cd(SeCN)2(pyCN)2] (pyCN = isonicotinonitrile)

The title compound, [Cd(SeCN)₂(pyCN)₂]_∞, adopts an extended one‐dimensional chain structure in which the neighboring cadmium atoms are bridged by two selenocyanate ions. The central cadmium atom has a distorted octahedral geometry defined by two isonicotinonitrile and four selenocyanate ions in a 4N2Se fashion. Copyright © 2003 John Wiley & Sons, Ltd.     

大口径光束波前采样器(孔栅)的研制

应用平面波角谱理论，分析了采样器对光波场采样和分光的基本原理以及对空间采样频率的选择规则，描述了实际研制的大口径采样器的结构设计，并通过数值方法和高能激光大气传输实验研究了高能激光经采样器前／后的远场光斑分布关系。结果表明：利用光束波前采样器能高保真地实现对高能激光束的分光。     

Crystallographic report: Diiodo[tris(2‐pyridyl)amine]mercury(II), [(C5H4N)3N]HgI2

In mononuclear HgI₂[(C₅H₄N)₃N], mercury is tetrahedrally coordinated by two nitrogen atoms of a tris(2‐pyridyl)amine ligand and two iodides. The coordination moieties are connected by weak intermolecular Hg(II)···I interactions to give a one‐dimensional structure. Copyright © 2003 John Wiley & Sons, Ltd.     

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.