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.     

成分和厚度的依赖

通过调整Mn的成分，系统地研究了Ni81Fe19/Ni100-xMnx双层膜的磁学性质，特别是交换偏置场(Hex)的变化.当Ni100-xMnx中Mn的原子百分比在534%到600%之间时，对于150nm的Ni81Fe19，得到了最大的交换偏置场175kA/m，同时由于Mn对Ni81Fe19层的扩散所造成的磁矩的降低小于20%；高角x射线衍射证明Ni100-xMnx的晶格常数随着Mn成分的改变而变化，Mn含量越多，其晶格常数越大；制备态Ni100-xMnx膜晶格常数与θ相NiMn膜晶格常数的接近程度与NiMn膜θ相形成的容易程度相对应.也研究了交换偏置场随着Ni１００-xMnx厚度的变化，第一次得到了当Ni100-xMnx中Mn的原子百分比为706%时，Ni81Fe19(150nm)/Ni100-xMnx(90nm)双层膜在经过240℃，5h退火后，可以有80kA/m的交换偏置场，此时铁磁层磁矩的大小几乎不变. 关键词： Ni81Fe19/Ni100-xMnx 交换偏置场     

多结超导环在外磁场中的行为

分析和计算了双结超导环在无偏置电流时的磁通、环流、自由能与外磁场的关系.发现双结环与单结环在磁场中的行为有所不同.当两个结的Ic相等时，双结环在1＜β=2πLIcΦ0＜2时，若无偏置电流，总磁通Φ、环流I与外磁通Φe的关系仍然是非回滞的曲线.仅当β≥2时，曲线才出现回滞.另外双结环有两支解，并且每支解的周期为2Φ0. 关键词： 双结环 双支解 2Φ0周期 回滞     

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     

一种有机电致发光共聚物的制备和性能

采用Suzuki方法合成了9，9-二辛基芴与萘并硒二唑的两种无规共聚物并研究了其紫外光谱、光致发光和电致发光性能。两种聚合物的电致发光波长为650～666nm，均为发饱和红光的LED材料，其电致发光外量子效率最高达到了1．05％。随着共聚物中萘并硒二唑含量的增加，共聚物的光致发光和电致发光的发射波长均有少量红移。证明了根据共轭高聚物链内能量转移原理，在聚芴链中引入不同含量的窄带隙杂环单元可实现对聚芴发光颜色的调节。     

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.