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.     

Well-dispersed gold nanowire suspension for assembly application

A method for fabricating well-dispersed nanowire suspension has been demonstrated in the paper. Thin gold nanowires were prepared by template synthesis, and then functionalized with sulphonate group-terminated thiols before suspended in different solvents. The degree of aggregation of the obtained suspension was evaluated with transmission electron microscopy (TEM) and UV-vis spectroscopy. It was found that the degree of aggregation was predominated by the solvents, and the best degree of dispersion was obtained when isopropyl alcohol (IPA) was used as the solvent. The gold nanowires from the suspension can be selectively assembled onto chemically patterned substrates. This well-dispersed nanowire suspension is potentially useful for fabricating novel nanodevices.     

OSCILLATION RESULTS FOR A SECOND ORDER NEUTRAL DELAY DIFFERENTIAL EQUATIONS

Some new oscillation criteria are established for a second order neutral delay differential equations. These results improve oscillation results of Y.V. Rogo-vchenko for the retarded delay differential equations. The relevance of our theorems is illustrated with two carefully selected examples.     

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.     

二维椭圆型方程反问题中优化算法的比较

近年来，决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用．本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法．由误差平方和最小原则，这个反问题可化为一个变分问题，并进一步离散化为一个最优化问题，其目标函数依赖于要决定的方程系数．本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现，并与拟牛顿法作为对比．为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵．同时还考察了线搜索方法的不同对优化算法的影响．数值实验的结果表明，非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效．     

Least‐squares meshfree method for incompressible Navier–Stokes problems

A least‐squares meshfree method based on the first‐order velocity–pressure–vorticity formulation for two‐dimensional incompressible Navier–Stokes problem is presented. The convective term is linearized by successive substitution or Newton's method. The discretization of all governing equations is implemented by the least‐squares method. Equal‐order moving least‐squares approximation is employed with Gauss quadrature in the background cells. The boundary conditions are enforced by the penalty method. The matrix‐free element‐by‐element Jacobi preconditioned conjugate method is applied to solve the discretized linear systems. Cavity flow for steady Navier–Stokes problem and the flow over a square obstacle for time‐dependent Navier–Stokes problem are investigated for the presented least‐squares meshfree method. The effects of inaccurate integration on the accuracy of the solution are investigated. Copyright © 2004 John Wiley & Sons, Ltd.