双掺(Tm3+,Tb3+)LiYF4激光器1.5 μm波长激光阈值分析

由速率方程推出了双掺（Tm^3 ,Tb^3 ）离子准四能级系统的激光阈值解析式，讨论了Tm^3 和Tb^3 离子之间的相互作用。分析了1.5μm波长附近的激光阈值和Tm^3 、Tb^3 离子的掺杂原子数分数及晶体长度的关系。结果表明，对于对应Tm^3 离子^3H4→^3F4跃迁的约1.5μm波长的激光，激活离子Tm^3 的掺杂原子数分数过大时，交叉弛豫作用将使系统阈值迅速增加。Tb^3 离子的加入，一方面能抽空激光下能级，起到降低阈值的作用；另一方面亦减少了激光上能级的寿命，使阈值升高。故Tb^3 离子有最佳掺杂原子数分数。对于Tm原子数分数为y=0.01的Tm:LiYF4晶体，Tb^3 离子的最佳掺杂原子数分数为0.002左右，同时表明，激光阈值与晶体长度有关。最佳晶体长度与Tm^3 、Tb^3 离子的掺杂原子数分数以及晶体的衍射损耗和吸收损耗有关。     

一阶最优性条件研究

本对由Botsko的关于多变量函数取极值的一阶导数检验条件定理^[1]进行了分析研究，给出了更实用而简捷的差别条件。最后，举出若干例子予以说明。     

一类机器人系统的最优控制

本文通过把结构阻尼系数当作控制变量来讨论一类弹性机器人系统的最优控制问题 ,并利用Banach空间几何性质证明了最优控制元的存在唯一性     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

OPTIMAL INVESTMENT IN THE PROTECTION OF A VULNERABLE BIOLOGICAL RESOURCE

It is assumed that the probability of destruction of a biological asset by natural hazards can be reduced through investment in protection. Specifically a model, in which the hazard rate depends on both the age of the asset and the accumulated invested protection capital, is assumed. The protection capital depreciates through time and its effectiveness in reducing the hazard rate is subject to diminishing returns. It is shown how the investment schedule to maximize the expected net present value of the asset can be determined using the methods of deterministic optimal control, with the survival probability regarded as a state variable. The optimal investment pattern involves “bang-bang-singular” control. A numerical scheme for determining jointly the optimal investment policy and the optimal harvest (or replacement) age is outlined and a numerical example involving forest fire protection is given.     

An applied cell mapping method for optimal control problems

From the application point of view, a series of modifications are proposed for the cell mapping method discussed in Ref. 1 for the optimal control analysis of dynamical systems. The cell order around the target set is rearranged. A set of common discriminate principles is used for the selection of the optimal one among competing control strategies of the same cost. Inequality constraints of the system are taken into account. The number of elements in the set of allowable time intervals is not prescribed, but left open. These modifications seem to make the cell mapping method more efficient for analyzing feedback systems and for obtaining their global optimal control information. The algorithms presented in this paper could broaden the application of the cell mapping approach of Ref. 1 to a wider class of engineering problems.     

Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.