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.     

电致发光色纯性增强的硅基有机微腔

报道了硅基有机微腔的电致发光（EL）.该微腔由上半透明金属膜、中心有源多层膜和多孔硅分布Bragg反射镜（PS DBR）组成.半透明金属膜由Ag（２０nm）构成，充当发光器件的负电极和微腔的上反射镜.有源多层膜由Al (1 nm) / LiF(05 nm) /Alq3/Alq3:DCJTB/NPB/CuPc/ITO/SiO2组成，其中的Al/LiF为电子注入层，ITO为正电极，SiO2为使正、负电极电隔离的介质层.该PS DBR是采用设备简单、成本低廉且非常省时的电化学腐蚀法用单晶Si来制备的；该PS 关键词： 电化学腐蚀 电致发光 窄峰发射 硅基有机微腔     

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

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

Au(111)上烷烃硫醇SAMs表面应力的理论研究

应用已建立的关于金属表面吸附层中表面应力的统计热力学理论 ,计算了Au(111)上烷烃硫醇SAMs的表面应力及其与烷烃硫醇链长、吸附覆盖度的定量关系 .计算结果与实验相符 ,较好地解释了Berger等人的实验结果 ,特别是解决了在表面应力符号性质上理论与实验的矛盾 .在表面吸附层应力的多种物理起源中 ,通过底物的分子间作用力有着决定性的贡献 ,揭示了分子的吸附能间接地起着重要作用 .这与阴离子化学吸附体系Cl-/Au(111)的有关研究结果相同 .     

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     

Automorphisms with only infinite orbits on non-algebraic elements

 This paper generalizes results of F. K?rner from [4] where she established the existence of maximal automorphisms (i.e. automorphisms moving all non-algebraic elements). An ω-maximal automorphism is an automorphism whose powers are maximal automorphisms. We prove that any structure has an elementary extension with an ω-maximal automorphism. We also show the existence of ω-maximal automorphisms in all countable arithmetically saturated structures. Further we describe the pairs of tuples (ˉa,ˉb) for which there is an ω-maximal automorphism mapping ˉa to ˉb. Received: 12 December 2001 / Published online: 10 October 2002 Supported by the ``Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture' Mathematics Subject Classification (2000): Primary: 03C50; Secondary: 03C57 Key words or phrases: Automorphism – Recursively saturated structure     

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.