提高三维激光扫描系统图像质量技术的研究

对其中三维激光扫描图像处理的关键技术———二值化、细化以及离散数据点云的滤波进行了研究,提出了一种先加权中值滤波,然后再小波分析滤波的新的降噪方法,并通过遗传算法对权重值进行了优化。在通常情况下,由于小波分析计算工作量大,所以提出了一种相对简单的算法,实现了在单台PC机上的运算。     

Optimization of Mass Transfer Processes in the Zone of the Air Electrode of a Fuel Cell with a Solid Polymer Electrolyte

A two-dimensional mathematical model for the transport of reactants in a fuel cell with a solid polymer electrolyte is developed. The model is used for analyzing spatial distributions of the concentration of reactants and current density over the cell. The effect of the catalytic-layer activity, reactant speed, bipolar-plate geometry, thickness and porosity of current collector and/or gas-diffusion sublayer, and the reaction mixture composition on the fuel cell efficiency is estimated theoretically and experimentally.     

On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

Conjugacy relationship between M-convex and L-convex functions in continuous variables

By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan     

A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.     

Pseudo-Differential Operators in Algebras of Generalized Functions and Global Hypoellipticity

The aim of this work is to develop a global calculus for pseudo-differential operators acting on suitable algebras of generalized functions. In particular, a condition of global hypoellipticity of the symbols gives a result of regularity for the corresponding pseudo-differential equations. This calculus and this frame are proposed as tools for the study in Colombeau algebras of partial differential equations globally defined on R ⁿ .     

Boundary position feedback control of Kirchhoff's non‐linear strings

This paper is concerned with global stabilization of an undamped non‐linear string in the case where any velocity feedback is not available. The linearized system has an infinite number of poles and zeros on the imaginary axis. In the case where any velocity feedback is not available, a parallel compensator is effective. The stabilizer is constructed for the augmented system which consists of the controlled system and a parallel compensator. It is proved that the string can be stabilized by linear boundary control. Copyright © 2003 John Wiley & Sons, Ltd.     

The long‐time behaviour of the thermoconvective flow in a porous medium

For the Boussinesq approximation of the equations of coupled heat and fluid flow in a porous medium we show that the corresponding system of partial differential equations possesses a global attractor. We give lower and upper bounds of the Hausdorff dimension of the attractor depending on a physical parameter of the system, namely the Rayleigh number of the flow. Numerical experiments confirm the theoretical findings and raise new questions on the structure of the solutions of the system. Copyright © 2004 John Wiley & Sons, Ltd.