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

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

溶胶-凝胶法制备小颗粒(Y,Gd)BO_3∶Eu及其表征

用溶胶 凝胶方法制备了平均粒径为 1～ 2 μm的小颗粒、高发射效率的 (Y ,Gd)BO3 ∶Eu红色发射荧光体。用XRD、SEM、粒度分析和PL光谱对荧光体作了表征和研究。常规固相反应合成 (Y ,Gd)BO3 ∶Eu需在 1 2 0 0℃以上才能形成均一的固溶体。而溶胶 凝胶法制取稀土正硼酸盐 80 0℃灼烧已可形成均一的单相 (Y ,Gd)BO3 ∶Eu,在 1 1 0 0℃可得到发光亮度最高的荧光体。它的亮度是常规固相反应于 1 2 0 0℃制得的荧光体的 1 2 0 %。采用溶胶 凝胶法制取 (Y ,Gd)BO3 ∶Eu荧光体 ,可在相当宽的实验条件范围内得到小粒径、窄分布和高亮度的荧光体 ,且有良好的颗粒形貌。     

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     

Harnack inequality for some classes of Markov processes

In this paper we establish a Harnack inequality for nonnegative harmonic functions of some classes of Markov processes with jumps. Mathematics Subject Classification (2000): Primary 60J45, 60J75, Secondary 60J25.This work was completed while the authors were in the Research in Pairs program at the Mathematisches Forschungsinstitut Oberwolfach. We thank the Institute for the hospitality.The research of this author is supported in part by NSF Grant DMS-9803240.The research of this author is supported in part by MZT grant 0037107 of the Republic of Croatia.     

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.     

BMAP/G/1 queue with correlated arrivals of customers and disasters

We consider a single server queue with disasters where the arrivals of customers and disasters are correlated. When a disaster occurs, it removes all the customers in the system and there requires repair time for the system to be operated normally. The stationary queue length distribution at the embedded points and at an arbitrary time are 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.