建筑外装修及外保温系统的消防安全问题及对策

建筑外部装修及外保温系统的消防安全问题日益突出,结合实际中的建筑外部装修及外保温系统现状,分析了建筑外部装修及外保温系统对消防安全的影响,分析发现建筑外部装修及外保温系统的消防安全隐患大,需要给予足够的重视,并根据实际确定了相应的对策。     

基于随机森林的重要性测度指标体系

重要性测度分析可以找出重要特征变量,从而降低输入空间的维数,节约运算成本。基于随机森林重要性测度的分析原理,探寻随机森林的重要性测度指标与基于方差的全局灵敏度指标之间的联系,得到求解方差灵敏度主指标S_i及其总指标S_i~T的新途径。建立基于随机森林的单变量、组变量重要性测度指标,并明确具体的求解过程,完善基于随机森林的重要性测度指标体系。通过算例验证了所提基于随机森林的重要性测度指标体系的有效性及其与方差灵敏度指标之间关系的正确性。     

Approximating nondominated sets in continuous multiobjective optimization problems

Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

石油化工静电火灾原因及其防治对策

分析了石油化工生产中静电的危害,根据静电产生的原因、引起火灾爆炸的条件分析静电导致火灾或爆炸事故的原因,并提出消除静电和预防静电火灾的对策。     

Maximizing the ratio of two convex functions over a convex set

The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

GPS载体姿态测量中的整周模糊度的快速求解

全球定位系统 (GPS)的良好性能和便宜的价格为其在姿态测量领域的应用开辟了广阔的前景 ,GPS载体姿态测量技术也成为 GPS应用中的热门研究方向。以利用 GPS载波相位测量来确定载体姿态为背景 ,介绍了 GPS载波相位差分技术的基本原理 ,并针对其中的关键技术问题——载波相位整周模糊度的快速解算 ,叙述和建立了整周模糊度快速解算的具体方法。详细地介绍了载体姿态测量系统中基线的构置方案和求解载体姿态的基本算法 ,即利用基线长确定整周模糊度的初始解集 ,然后利用约束条件来剔除解集中的假解。     

相对论带电粒子与电磁波包之间的相互作用

研究了相对论带电粒子与电磁波包之间的相互作用,给出了带电粒子运动方程的严格解,得出了粒子的位置、速度和能量的显示表达式。本文结果对基础等离子体物理、自由电子激光、高功率微波和粒子加速器等领域具有一定的参考意义。     

一类军事技术创新模型的定性分析

应用非线性动力系统的定性理论方法,研究了一类军事技术创新非线性动力系统模型的无闭轨性、奇点的李雅朴诺夫稳定性及全局稳定性,并对结论进行了分析解释.     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

星际探测太阳帆行星和太阳借力轨道全局优化

以太阳帆在20年内飞行至距离太阳200 AU以远进行星际探测为目标,研究太阳帆通过行星借力和太阳借力的轨道全局优化问题。建立太阳帆时间最优转移轨道数学模型,分析行星借力和太阳借力的约束条件,并用这些约束条件构造目标函数,从而将轨道优化的四点边值问题转化为求解无约束条件下的多变量优化问题。通过选取合理的约束权重,采用遗传算法获得大范围的粗略解,代入到序列二次规划算法中获得高精度解。仿真结果表明,虽然太阳帆通过太阳借力已获得相当大的加速度,但加上木星借力仍然可以节省相当多的飞行时间。提出的轨道优化思路,可以为太阳系逃逸任务轨道初步设计提供参考。