Φ200高超声速风洞调试和流场校测

介绍了新近建成的马赫数为2.5～7.0的Φ200mm 高超声速风洞(Φ200 Hypersonic Wind Tunnel,HWT-200)调试情况及空风洞流场校测结果.调试校测结果表明,风洞的总温、总压、运行时间等参数完全达到了设计要求,顺利实现了宽马赫数范围下的超声速/高超声速运行;本风洞有较大的实验段流场均匀区,各流场的马赫数均方根偏差全部达到GJB(1179-91)的合格指标,一部分达到了先进指标.风洞运行时间不少于20s,是一座参数范围较宽、运行成本较低、维护方便、可用于空气动力学教学试验和基础性科学研究的设备.     

交叉激波湍流边界层干扰问题数值模拟

基于BANS方程,采用有限体积法离散计算区域,对流项使用Harten TVD格式进行流场求解,湍流部分应用Menter SST两方程湍流模型,建立了隐式LU-SGS方法的三维CFD计算程序,数值模拟了来流马赫数4.96条件下的18°×18°对称双楔产生的交叉激波/湍流边界层干扰问题,计算了不同剖面沿展向压强分布以及流场的详细结构,并将计算结果与相关文献的实验与计算结果进行了比较.     

Replacing nonidentical vital components to extend system life

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

SpaceWire网络混合路由机制设计

针对星上系统总线多元性导致的星载网络接口和协议不能标准化的发展瓶颈,基于SpaceWire总线协议,通过将静态路由(时间触发)与动态路由(事件触发)机制结合,实现了控制数据和载荷数据共用网络。静态路由完全遵循SpaceWire-D协议,在保证确定性传输的同时,通过启发式调度算法首次实现了多时间窗并行调度,并提出利用最大公约数法设计时间窗,以提高网络吞吐量;动态路由通过对随机事件和载荷数据分配优先级,实现传输路径冲突时对紧急任务的优先处理。在OPENT中搭建网络系统仿真模型,对所提出的路由机制进行了仿真。实验结果表明,静态路由时段网络吞吐量较现有调度算法有明显提高,动态路由实现了紧急事件优先传输。     

二次流引射对保形非对称喷管性能的影响

发动机与飞机后体结构设计合理与否直接影响发动机的部件匹配和性能。利用三维雷诺平均N-S方程和k-ωSST湍流模型对飞翼布局无人机保形非对称喷管在典型飞行状态下开展了内外流流场特性的数值分析,获得了后体尾喷管推力性能和三维流动特征随二次流压力比的变化趋势。结果表明:发动机喷管落压比条件一定的前提下,通过合理优化二次流通道、增大二次流压力比,可以有效改善后体/喷管主流流场特性;当二次流与主流的流量比在0. 2%～1. 86%内时,后体尾喷管轴向推力系数的变化幅度大约为3%,在一定程度上能够减弱发动机主流的过膨胀程度,减小发动机推力损失,无人机后体尾喷管性能得到显著提高。     

面向多星观测调度的分层迭代算法

提出一种基于分治策略的多星观测分层调度框架,在该框架下,用蚁群优化算法把任务分配至各轨道圈次上,并利用自适应模拟退火算法求解各轨道圈次的调度问题。根据各轨道圈次调度结果的反馈情况,再调整任务分配方案,重复上述过程直到达到算法终止条件。为了提高算法的性能,在设计蚁群算法的启发式信息模型时,应充分考虑卫星调度问题的领域知识;在模拟退火算法中设计两个邻域结构,采用动态选择策略在优化过程中确定最佳邻域搜索结构。仿真实验表明,该方法有效地降低了问题求解的复杂度,尤其在求解大规模多星观测调度问题时表现出优异的性能。     

遥感数据处理任务调度的Petri网模型及求解算法

为了对多源遥感数据的处理任务进行有效的调度和管理,提高处理资源的利用率,根据遥感数据处理任务调度问题的特点,采用Petri网对该问题进行形式化描述,建立了遥感数据处理任务调度的数学模型,根据该问题的多目标特性,采用蚁群算法进行求解.给出仿真实例,将蚁群算法的求解结果与启发式算法和模拟退火算法的求解结果进行比较,验证算法...     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

科学工作流技术研究综述

科学工作流管理系统(Scientific Workflow Management Systems,SWfMS)为科学家提供一个管理大规模复杂科学计算的有效平台,通过管理复杂应用程序对海量科学数据进行管理、分析、仿真和可视化以帮助科学家进行科学发现.本文首先对科学工作流(Scientific Workflow,SWF)...