Investigations of low- and high-spin states of <Superscript>132</Superscript>La

The fusion evaporation reaction ¹²²Sn(¹⁴N, 4n)¹³²La was used to populate the high-spin states of ¹³²La at the beam energy of 60 MeV. A new band consisting of mostly E2 transitions has been discovered. This band has the interesting links to the ground state 2^- and the isomeric state 6^-. A new transition of energy 351 keV connecting the low-spin states of the positive-parity band based on the πh _11/2 ⊗ νh _11/2 particle configuration, has been found. This has played a very important role in resolving the existing ambiguities and inconsistencies in the spin assignment of the band head. Received: 12 August 2002 / Accepted: 18 March 2003 / Published online: 7 May 2003     

光电对抗在现代防空作战中的应用与展望

在综述光电对抗内涵的基础上，论述光电对抗在现代战争作战平台中的具体应用，并着重从电子战的角度论述了光电对抗在现代防空作战中的最新应用。最后指出光电对抗技术在未来电子战中的作用和发展方向。     

A test problem for molecular dynamics integrators

We derive a test problem for evaluating the ability of time-steppingmethods to preserve the statistical properties of systems inmolecular dynamics. We consider a family of deterministic systemsconsisting of a finite number of particles interacting on acompact interval. The particles are given random initial conditionsand interact through instantaneous energy- and momentum-conservingcollisions. As the number of particles, the particle density,and the mean particle speed go to infinity, the trajectory ofa tracer particle is shown to converge to a stationary Gaussianstochastic process. We approximate this system by one describedby a system of ordinary differential equations and provide numericalevidence that it converges to the same stochastic process. Wesimulate the latter system with a variety of numerical integrators,including the symplectic Euler method, a fourth-order Runge-Kuttamethod, and an energyconserving step-and-project method. Weassess the methods' ability to recapture the system's limitingstatistics and observe that symplectic Euler performs significantlybetter than the others for comparable computational expense.     

线性均衡约束最优化的一个广义投影强次可行方向法

本文讨论带线性均衡约束最优化问题,首先利用摄动技术和一个互补函数将问题等价转化为一般约束最优化问题,然后结合广义投影技术和强次可行方向法思想,建立了问题的一个新算法.算法在迭代过程中保证搜索方向不为零,从而使得每次迭代只需计算一次广义投影.在适当的条件下,证明了算法的全局收敛性,并对算法进行了初步的数值试验.     

Structure and Structural Nonrigidity of Tetrachlorodibenzo-p-Dioxin Radical Cations

Ab initio calculations showed that the tetrachlorodibenzo-para-dioxin radical cations (TCDD RCs) with a planar structure have two steady states with asymmetric dioxin cycles. The activation barriers between these states are up to 2 kcal/mole, so that the RCs may be regarded as being structurally nonrigid within the dioxin cycle. The 2,3,7,8-TCDD RC is more stable than the 1,4,6,9-TCDD RC, the energy difference being 5.2 kcal/mole. The adiabatic ionization potential of 2,3,7,8-TCDD (7.54 eV) is 0.1 eV smaller than the corresponding potential of 1,4,6,9-TCDD. These factors account for the increased hemoproteide affinity and hence increased biological activity of 2,3,7,8-TCDD.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

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

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

Computations of two passing‐by high‐speed trains by a relaxation overset‐grid algorithm

This paper presents a relaxation algorithm, which is based on the overset grid technology, an unsteady three‐dimensional Navier–Stokes flow solver, and an inner‐ and outer‐relaxation method, for simulation of the unsteady flows of moving high‐speed trains. The flow solutions on the overlapped grids can be accurately updated by introducing a grid tracking technique and the inner‐ and outer‐relaxation method. To evaluate the capability and solution accuracy of the present algorithm, the computational static pressure distribution of a single stationary TGV high‐speed train inside a long tunnel is investigated numerically, and is compared with the experimental data from low‐speed wind tunnel test. Further, the unsteady flows of two TGV high‐speed trains passing by each other inside a long tunnel and at the tunnel entrance are simulated. A series of time histories of pressure distributions and aerodynamic loads acting on the train and tunnel surfaces are depicted for detailed discussions. Copyright © 2004 John Wiley & Sons, Ltd.     

Robust handling of non‐linear constraints for GA optimization of aerodynamic shapes

A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd.