基于黑板模型的分布式协同任务决策方法研究

基于黑板模型的分布式指挥控制网络为未来复杂环境下海战中多平台间的高效协同提供了新思路,通过构建应用于多航母群联合海战的分布式协同网络,对多航母群联合海战下的系统负载进行了研究,建立了一种多平台任务决策的数学模型,采用嵌套遗传算法进行了仿真求解,得到了理想的任务决策方案。最后对由于目标函数中内部负载权重系数不同取值所引起的不同任务决策结果进行了比较,验证了将基于黑板模型的分布式协同网络应用于多航母海战协同决策的科学性,为分布式海战协同决策网络的后续研究工作奠定了基础。     

基于IAFSA的四自由度翼伞分段归航设计

为实现翼伞系统的精确空投,需要对其归航轨迹作合理规划。根据翼伞系统自身的运动特性及操纵特性,采用分段归航策略。在四自由度翼伞模型下,利用各轨迹段的几何关系,建立表征轨迹优劣程度的目标函数。基于改进的人工鱼群算法,对目标函数进行参数寻优,进而得到轨迹的设计参数。仿真结果表明,所提出的改进方法能加快算法的收敛速度,所规划的轨迹满足了精确落点和逆风着陆的要求。     

时序电路测试中敏化路径选择研究

时序电路测试产生过程中,在进行敏化路径选择时会遇到失败问题.本文针对迭代组合阵列模型测试中产生的这些问题进行了有益的探讨,并提出了改进的时序电路测试产生算法,使之更加完善.     

一个快速的临界跟踪策略 VLSI故障模拟新方法

运用九故障信息标记（X,D,M,R,E,Q,T,P,U）,提出了加速扇出重汇聚引线临界性计算的一种故障模拟新方法,理论分析表明该方法是有效的。     

一类马尔可夫人才系统中的工龄和职龄

用马尔可夫模型研究人才系统中工龄和职龄问题的一般方法都要按职务等级、工龄或职龄来划分系统状态。本文在只以职务等级划分系统状态的一类无降级且逐级晋升的齐次马尔可夫人才系统中讨论了工龄和职龄问题,得到直观描述工龄和职龄的计算结果,并通过一实例说明了本方法的应用价值。     

一种性能驱动的时序规划方法

在超级计算机体系结构设计阶段 ,有必要进行时序规划 ,以尽早判断设计方案和性能指标的物理可实现性。提出一种性能驱动的时序规划方法 ,采用适于组件性能描述的时序性能模型 ,并按照线网权重分配路径延时余量 ,算法具有效率高、延时分配合理的优点     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

一种基于程序域边界分析的测试方法

边界附近的点对程序故障更加敏感.针对这一特征,提出了一种基于程序域边界分析的测试方法.从被测程序本身出发,进行定义域确定及子域划分,分析定义域边界和子域边界,并跟据其边界测试点产生测试用例,以检测域边界附近的处理.实验表明对定义域边界及其子域边界进行测试,可有效地提高故障覆盖率.     

Capacitated selection problem

Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999     

时变道路网最短路径算法的研究

道路或区域通行限制在日常交通和部队兵力机动过程中普遍存在。通行限制情况下的最短路径问题属于时变道路网最短路径研究的范畴,对时变道路网最短路径算法及算法效率的研究有着广泛而现实的意义。重点讨论了道路网的模型描述、时变道路网拓扑结构的构建技术,最短路径算法的高效实现等内容,并给出了该算法的应用实例。试验结果显示,该算法有效可行。