A subdomain boundary element method for high‐Reynolds laminar flow using stream function‐vorticity formulation

The paper presents a new formulation of the integral boundary element method (BEM) using subdomain technique. A continuous approximation of the function and the function derivative in the direction normal to the boundary element (further ‘normal flux’) is introduced for solving the general form of a parabolic diffusion‐convective equation. Double nodes for normal flux approximation are used. The gradient continuity is required at the interior subdomain corners where compatibility and equilibrium interface conditions are prescribed. The obtained system matrix with more equations than unknowns is solved using the fast iterative linear least squares based solver. The robustness and stability of the developed formulation is shown on the cases of a backward‐facing step flow and a square‐driven cavity flow up to the Reynolds number value 50 000. Copyright © 2004 John Wiley & Sons, Ltd.     

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

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

用格林函数法计算量子点中的应变分布

自组装量子点材料作为一种新型的光电材料无论在理论和实际应用都成为当今物理学界的研 究热点.由GaAs包围的InAs小岛，由于较大的晶格失配（≈-0.067），应变效应在量子点 的 形成过程中起主导作用.大部分计算量子点结构应变分布的方法都是基于数值解法，需要大 量的计算工作.给出用格林函数法推导各种常见形状量子点应变分布的解析表达式详细过程，讨论了弹性各向异性和形状各向异性对量子点应变分布的影响程度.结果表明对于不 同形状量子点结构中主要部分的应变分布都是相似的，流体静压变部分的特征值随量子点形状的变化不 关键词： 自组装量子点 格林函数 应变分布     

能动反射镜低频像差补偿能力分析

 采用Algor软件包并利用有限元法对37单元能动反射镜低频误差补偿能力进行了分析计算，确定了镜面厚度8mm，驱动器间距46mm，极头直径12mm等能动反射镜制造的关键参数。通过计算机仿真分析证明，基于这些参数所设计的能动反射镜可以对低频误差进行有效校正，校正精度的均方根值小于等于λ／８，从而可以为能动反射镜的制造提供理论依据。     

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     

Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...     

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.