On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

尘埃粒子的时空结构及其性质

讨论了尘埃粒子解的时空结构及其性质，导出了尘埃粒子的内空间的离散结构.证明了尘埃粒子内部的物质球是一个无坐标的平直球，因而具有最小的体积和整体的关联性.导出了在尘埃粒子的内外时空中的径向测地线并说明其连续性.阐述了由这个解所揭示的物质、引力与时空之间的内在联系. 关键词： 尘埃粒子 离散时空 测地线     

具有消息恢复的数字签名方案的一个注记

对具有消息恢复的数字签名方案提出了两种攻击方法.此外,对原方案进行了改进,通过对改进方案的安全性分析得出结论:改进方案比原方案更安全,并且消息恢复过程只需要计算一次大数模幂乘和两次单向函数.     

森林发展系统的一个非线性半离散模型

本文建立了森林发展系统的一类非线性林龄面积结构的半离散模型 ,并讨论了半离散系统解的存在唯一性 ,给出了线性半离散系统稳定的一些充分条件     

On two theorems for flat,affine group schemes over a discrete valuation ring

We include short and elementary proofs of two theorems that characterize reductive group schemes over a discrete valuation ring, in a slightly more general context.     

Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.     

Rotation of a Fine Particle with Circularly Polarized Anti-Parallel Collinear Laser Beams

We have succeeded in the operation of rotating a fine particle which was held without mechanical contact by circularly polarized laser beams with opposite propagation directions. A polystyrene latex particle 11.9 μm in diameter deformed in a disk-like shape was dispersed in water, and was trapped using the anti-parallel collinear laser beams which were set up so that they had the circular polarization rotating in the same direction. It was observed that the trapped particle rotated in the same direction as the rotation of the circular polarization of light. Inversion of the rotational direction of the circular polarization of light reversed the direction of the rotation of the particle. Although the rotational speed of a particle varied significantly from particle to particle, it was found to be proportional to the laser beam intensity. A typical value for the rotational speed per beam intensity was 2.1 Hz/W.     

关于“信息熵”分析及其应用的研究

本文用Ｓｈａｎｎｏｎ熵函数的观点及最大离散熵原理，探讨了对随机试验项目的优选问题：即压缩某种“不确定性”试验项目的实施与探索．并通过应用实例的计算，获得了满意的聚类效果．这种方法对于信息资料的数据处理及压缩“不确定性“验项目具有普遍意义．