空气深度预冷组合循环发动机吸气式模态建模及性能分析

针对空气深度预冷组合循环发动机——协同吸气式火箭发动机(Synergistic Air-Breathing Rocket Engine,SABRE),采用部件法对其进行建模,匹配计算得到吸气式模态下飞行走廊内其性能参数变化规律,并研究其高度速度特性。计算模型可信度较高,推力误差小于6%,能够较为准确地模拟SABRE吸气式模态的性能参数。结果表明:SABRE兼具火箭发动机大推力和航空发动机高比冲的特点,吸气式模态下比冲介于21 300~27 380 m/s,随着高度速度的增大,其推力比冲先增大后减小;SABRE利用预冷器将入口空气温度降低,可使其空域速域拓宽至25 km、5Ma,满足高超声速飞行的动力需求;发动机速度下限由压气机最大流量决定,速度上限则由氦气回路减压器工作限制条件决定。     

计及技术风险的复杂系统多分辨率风险评估方法

针对技术风险难以直接度量、模型参数设定主观性较强等问题,利用技术成熟度的规范化方法评估系统组成的技术实现条件和难度;通过矩阵化的系统描述及关联关系推理,建立各分系统技术成熟度与系统过程模型动态参数之间的量化关系;采用系统过程建模仿真的间接方法,计算进度或费用超出可承受范围的不确定性,用以评估复杂系统研制的技术风险。通过多分辨率建模方法提高系统分析粒度,使该方法具有随系统演化过程对技术风险评估保持更新和分析粒度提升的能力。     

随机-非概率模型下的船体结构屈服强度可靠性分析

针对在役舰船船体载荷、材料属性的随机特性和实船勘验得出的腐蚀损伤下船体抗力区间特性,提出一种基于随机概率理论和区间非概率理论的随机-非概率可靠性分析模型,分别从区间变量随机化和随机变量区间化两个角度给出该模型的可靠性指标求解方法。基于该模型对某舰船船体结构屈服强度进行可靠性分析,结果表明:该模型既体现了结构变量的客观不确定性又减弱了评估结果的盲目保守性,对于既含有随机变量又含有区间变量的在役舰船的可靠性评估具有很强的适用性。     

The evaluation of a possible future Sino-Japanese armed conflict through the application of the ACEI-model

There is relatively little formal modeling of the economic effects of armed conflicts even though they have substantial economic effects. We set forth a new model, namely the armed conflict economic impact model – ACEI-Model. The model looks at the economic effects of war in three different stages: (i) pre-conflict stage; (ii) armed conflict stage; and (iii) post-conflict stage. The model is based on economic desgrowth (-δ) and other new conceptual indicators. We evaluate an imaginary armed conflict between China and Japan by applying the ACEI-Model.     

Reliability bounds for the NBUE distributions

In this paper, we study upper and lower bounds on the reliability in new better than used in expectation (NBUE) life distribution class with fixed first two moments. By a constructive proof, we determine the upper bounds on the reliability analytically in different regions and show that these bounds are sharp. For the lower bounds, similar results are obtained except in one region. For that region, a conjecture is given for further study. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 781–797, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10035     

Markovian models of three‐on‐one combat involving a hidden defender

In this paper, Markovian models of three‐on‐one stochastic firefights between ground‐based weapon systems are developed. These models address a common scenario of interest to the military, but one which has been much neglected in analytic combat models, that of combat between a hidden defender and an exposed attacking force. Each combatant must detect an opponent before commencing their firing cycle, a task which is considerably more difficult for the attacker. In the models developed here, the defender detects the exposed attacking group after an exponentially distributed time interval, while each attacker has a fixed probability of detecting the defender via the flash signature produced after each shot fired by him. The utility of the approach is demonstrated by investigating what impact the introduction of a coordinated gun‐laying system for the attacking force might have, a system made possible by battlefield digitization. The method used here allows models to be developed incrementally. This and other advantages of the Markovian approach are discussed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 627–646, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10041     

Rare‐event component importance for the consecutive‐k system

Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001     

一种面向个性化服务的无需反例集的用户建模方法

随着WWW信息的快速增长 ,查找用户感兴趣的信息变得越来越耗时耗力。个性化服务能为不同的用户提供有针对性的服务 ,日益受到研究者的重视。用户建模是实现个性化服务的关键技术。传统的需要正、反例集作为训练例集的用户建模方法容易干扰用户的正常浏览 ,或者由于推断失误而引入噪声。基于遗传算法和k近邻方法提出了一种无需反例集的用户建模方法 ,该方法被应用于个性化信息过滤中。实验结果表明 ,基于无需反例集的用户建模方法的信息过滤算法可以达到 73 91%的过滤率和 94 4 4 %的过滤精度。无需反例集的用户建模方法是一种可行、高效的用户建模方法     

稳态随机过程激励下基于首次超越破坏的结构优化设计

把结构系统动力可靠性分析与最优化设计结合起来 ,以结构系统的最小质量为目标函数 ,给出了考虑在平稳随机过程激励下多自由度线性系统总的可靠性的结构优化设计方法。运用谱分析理论 ,推导了结构系统在平稳随机过程激励下响应的统计特征 ,同时结合首次超越破坏的Possion模型计算结构系统的可靠性 ,最终采用广义乘子法得到结构系统设计变量的最优值。计算结果表明该方法是可行的     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.