93W合金有关力学参量的综合选评

 对93W合金材料进行了超声测量实验，并结合原有的超声测量结果进行了分析比较，提出了可以直接用冲击波速度关系式的三个系数c₀ 、λ和λ′来对钨合金的有关力学参量，如G₀、K₀、G₀′、K₀′等进行综合选评的方法。得到了一组对93W合金较为合理的力学参量推荐值。     

红外热像仪参数的双黑体测量装置

对红外热像仪参数双黑体测量装置的工作原理进行了介绍。装置采用双黑体及反射型靶标为温差辐射源，可实现黑体温度温差准直辐射的定期校准和红外热像仪参数测量量值的溯源，也可实现红外热像仪参数的可控性，以及对它进行稳定的、可复现的精确测量。推导出利用红外热像仪参数双黑体测量装置测量信号传递函数SiTF数学模型，分析了红外热像仪参数测量装置的客观因素——仪器常数，针对仪器常数对SiTF测量的影响进行了试验。试验结果表明，仪器常数对红外热像仪SiTF参数测量精度影响较大，并同时影响时域与空域NETD及3D噪声的准确测量。     

Oxidation process of SiGe on SOI substrates

The oxidation of SiGe film epitaxial grown on top of SOI wafers has been studied. These SiGe/SOI samples were oxidized at 700, 900, 1100 °C. Germanium atoms were rejected from SiGe film to SOI layer. A new Si_1−xGe_x (x is minimal) layer formed at SiGe/Si interface. As the germanium atoms diffused, the new Si_1−xGe_x (x is minimal) layer moved to Si/SiO₂ interface. Propagation of threading dislocation in SiGe film to SOI substrate was hindered by the new SiGe/Si interface. Strain in SOI substrate transferred from SiGe film was released through dislocation nucleation and propagation inner. The relaxation of SiGe film could be described as: strain relaxed through strain equalization and transfer process between SiGe film and SOI substrates. Raman spectroscopy was used to characterize the strain of SiGe film. Microstructure of SiGe/SOI was observed by transmission electron microscope (TEM).     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.     

用自适应脉冲微扰引导混沌系统到周期解

用自适应脉冲微扰方法控制的系统的某个系统变量作为驱动,设计了一种自适应控制器方法对两个或多个响应混沌系统进行脉冲微扰,引导这些系统从混沌运动到低周期运动,实现同时控制多个混沌系统到不同的周期态. 当选择相同的自适应控制器输入变量实施脉冲微扰时,还可控制两个或多个混沌系统达到不同的周期态同步. 通过对R?ssler混沌系统的仿真研究证实了方法的有效性. 关键词： 混沌控制 系统参量 自适应控制器 脉冲微扰 周期态同步     

Localization effects and measure source terms in numerical schemes for balance laws

This paper investigates the behavior of numerical schemes for nonlinear conservation laws with source terms. We concentrate on two significant examples: relaxation approximations and genuinely nonhomogeneous scalar laws. The main tool in our analysis is the extensive use of weak limits and nonconservative products which allow us to describe accurately the operations achieved in practice when using Riemann-based numerical schemes. Some illustrative and relevant computational results are provided.

     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.     

An admissible minimax estimator of a bounded scale-parameter in a subclass of the exponential family under scale-invariant squared-error loss

A subclass of the scale-parameter exponential family is considered and for the rth power of the scale parameter, which is lower bounded, an admissible minimax estimator under scale-invariant squared-error loss is presented. Also, an admissible minimax estimator of a lower-bounded parameter in the family of transformed chi-square distributions is given. These estimators are the pointwise limits of a sequence of Bayes estimators. Some examples are given.     

Changes in the kurtosis parameter of super-Gaussian beams passing through a spherically aberrated lens

Based on the Collins formula and irradiance moments definition, the propagation of the kurtosis parameter of super-Gaussian beams through a spherically aberrated lens is studied. Detailed numerical results are given. It is shown that, as compared with aberration-free super-Gaussian beams, the profile of spherically aberrated super-Gaussian beams can be leptokurtic, mesokurtic or platykurtic, depending on the aberration and propagation distance. The results for the spherically aberrated Gaussian beams can be dealt with as a special case treated in this paper. Finally, the advantage of our method is pointed out.     

Regularization of Discrete Ill-Posed Problems

The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is proved under the assumption of the suitable relation between the discretization level and the data error. As an example the method of truncated singular value decomposition with regularization is considered. This revised version was published online in July 2006 with corrections to the Cover Date.