面向应用的分布式多机联合计算的系统设计问题

随着计算机应用向分布和异构发展，如何建立一个具有良好性能价格比的分布式多机联合计算系统是当前计算机应用开发者遇到的重要课题。文中结合分布式仿真应用实例，对多计算机联合计算的系统划分、数据通讯机制和高性能并行计算问题进行了论述。     

单机攻击多目标逻辑的遗传优化求解

攻击逻辑的优化决策对于机载多目标攻击武器系统具有重要意义。本文建立了单机多目标攻击逻辑的解算模型 ,提出了解算要求 ,给出了采用遗传算法求解多目标攻击逻辑的应用方案。在此基础上 ,采用该方案进行大量的试探性仿真研究 ,对仿真结果进行了分析 ,并选择了合适的遗传算法参数。文章最后阐述了用遗传算法求解多目标攻击逻辑问题的发展前景     

多传感器融合系统航迹号管理方法

多目标杂波环境下 ,多传感器探测形成的航迹之间呈现错综复杂的关系 ,多传感器系统融合中心航迹管理成了迫切需要解决的问题。在原有单航迹号分配方法的基础上 ,提出多航迹号分配方法 ,并扩展到立体图航迹号管理方法。尤其是航迹号立体图的引入 ,为航迹管理提供了一个新的思路。     

嵌入式微处理器的多层次可配置仿真工具

为了适应嵌入式定制微处理器的开发的需要 ,克服现有微处理器仿真工具的某些不足 ,文中介绍了微处理器的仿真验证工具———VCPU的设计和实现方法。同其它微处理器仿真工具相比 ,该工具具有多层次 ,可配置 ,功能全面的特点。利用该工具 ,设计者可在设计早期进行系统集成验证 ,缩短设计周期并减少设计错误。该工具已经在嵌入式微处理器开发过程中得到成功应用     

Duality in constrained multi‐facility location models

We consider the ??_p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??_pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010     

基于CSCW的机关业务协同办公系统协作多用户界面研究

简要阐述了研究CSCW系统协作多用户界面的必要性,介绍了协作多用户界面的基本概念,分析并评价了几种传统的协作多用户界面体系结构,最后以某机关业务协同办公系统的协作多用户界面的设计为例,提出了一种协同混合式体系结构及具体的实现。     

基于SHARC流水集束型多处理器板研制

结合某重点工程课题 ,设计和实现了基于 SHARC流水集束型多处理器板即研制出了具有 5个 SHARC的高速并行数字信号处理机。板上处理器数量可实现重配置以获得高的性价比。当板上前端 4个 SHARC用于 FFT时 ,研究和分析了板上前端 4个 SHARC用于 FFT时的三种不同缓冲数据模式下 FFT节点处理性能     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

Dynamic evacuation routes for personnel on a naval ship

We propose a dynamic escape route system for emergency evacuation of a naval ship. The system employs signals that adapt to the causative contingency and the crew's physical distribution about the ship. A mixed‐integer nonlinear programming model, with underlying network structure, optimizes the evacuation process. The network's nodes represent compartments, closures (e.g., doors and hatches) and intersections, while arcs represent various types of passageways. The objective function integrates two potentially conflicting factors: average evacuation time and the watertight and airtight integrity of the ship after evacuation. A heuristic solves the model approximately using a sequence of mixed‐integer linear approximating problems. Using data for a Spanish frigate, with standard static routes specified by the ship's designers, computational tests show that the dynamic system can reduce average evacuation times, nearly 23%, and can improve a combined measure of ship integrity by up to 50%. In addition, plausible design changes to the frigate yield further, substantial improvements. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

多体结构连接部件的有限单元模型

针对多体结构中连接部位带来的运动不连续问题 ,提出了将连接部件不作节点处理而作单元看待的设想。从力学基本原理出发推导了单元的刚度矩阵与阻尼矩阵 ,并由拉格朗日方程推导了这种单元的平衡方程