Study on the possibilities of controlling the laser output beam properties by an intracavity deformable mirror

The possibilities of controlling the laser beam properties by a deformable mirror introduced into the laser optical cavity were studied theoretically and experimentally. The experiments were performed under conditions of an industrial high power transverse flow cw CO₂ laser operating with a stable resonator of a folded configuration. A deformable bimorph mirror of a surface profile controlled by the voltage applied to the mirror electrodes is implemented to the laser system as a back cavity mirror or as a one of the inner folding mirrors. The near-and far-field characteristics of the laser beam versus the resonator configuration controlled by the changes of the focal length of the deformable mirror are discussed in the paper. The analysis reveals that the resonator with an inner deformable mirror is much more sensitive to the mirror curvature variations than the resonator in which the deformable mirror is used as a back cavity mirror. The presented results show that dynamic and controllable changes in the resonator properties result in the controlled modification and optimisation of the laser output power and spatial parameters of the laser radiation.     

Integration and propagation of a multi-criteria decision making model in constraint programming

In this paper we propose a general integration scheme for a Multi-Criteria Decision Making model of the Multi-Attribute Utility Theory in Constraint Programming. We introduce the Choquet integral as a general aggregation function for multi-criteria optimization problems and define the Choquet global constraint that propagates this function during the Branch-and-Bound search. Finally the benefits of the propagation of the Choquet constraint are evaluated on the examination timetabling problem.     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .     

On a Modified Subgradient Algorithm for Dual Problems via Sharp Augmented Lagrangian*

We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and an optimal control problem. *Partially Supported by 2003 UniSA ITEE Small Research Grant Ero2. Supported by CAPES, Brazil, Grant No. 0664-02/2, during her visit to the School of Mathematics and Statistics, UniSA.     

Review and complements on mixed-hybrid finite element methods for fluid flows

Mixed and hybrid finite element methods for the resolution of a wide range of linear and nonlinear boundary value problems (linear elasticity, Stokes problem, Navier–Stokes equations, Boussinesq equations, etc.) have known a great development in the last few years. These methods allow simultaneous computation of the original variable and its gradient, both of them being equally accurate. Moreover, they have local conservation properties (conservation of the mass and the momentum) as in the finite volume methods.The purpose of this paper is to give a review on some mixed finite elements developed recently for the resolution of Stokes and Navier–Stokes equations, and the linear elasticity problem. Further developments for a quasi-Newtonian flow obeying the power law are presented.     

Orderings of uniquely colorable hypergraphs

For a mixed hypergraph H=(X,C,D), where C and D are set systems over the vertex set X, a coloring is a partition of X into ‘color classes’ such that every C∈C meets some class in more than one vertex, and every D∈D has a nonempty intersection with at least two classes. A vertex-orderx₁,x₂,…,x_n on X (n=|X|) is uniquely colorable if the subhypergraph induced by {x_j:1?j?i} has precisely one coloring, for each i (1?i?n). We prove that it is NP-complete to decide whether a mixed hypergraph admits a uniquely colorable vertex-order, even if the input is restricted to have just one coloring. On the other hand, via a characterization theorem it can be decided in linear time whether a given color-sequence belongs to a mixed hypergraph in which the uniquely colorable vertex-order is unique.     

正态分布下任意秩有限总体中的Minimax预测

对于任意秩有限总体,在二次损失下,有关文献已给出了线性可预测变量在齐次线性预测类中的唯一线性Minimax预测．本文在正态假设下,证明了这个线性Minimax预测也是线性可预测变量在一切预测类中的唯一Minimax预测．     

Kuhn-Tucker条件与线性规划的对偶性

证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.     

A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

等效可变孔径远场法测量单模光纤模场半径

本文提出等效远场的可变孔径方法,由测量光纤远场累积分布求得模场半径。并且利用Petermann关于模场半径的新定义,推出了一种对非高斯模场分布也适用的求模场半径的方法。实验表明,这种测量方法简便可靠,在不同的制备端面下,重复测量的标准误差小于0.04μm。