一种嵌入式系统中软硬件故障的划分方法

软硬件故障是嵌入式系统可靠性的关键问题之一,如何划分软硬件故障对于整个系统的可靠性研究来说是至关重要的,也是最基本的一步.给出了软硬件故障的基本定义,并与单纯的软件故障和单纯的硬件故障进行了对比,总结了软硬件故障的基本特点.在此基础上,归纳了几条软硬件故障的划分原则,提出了一种软硬件故障的划分流程,并通过形式化方法对某装备的具体软硬件故障进行了划分,为进一步的研究提供了有力的依据.     

基于图分割的机械系统概念模块划分

为更好地实现机械系统的模块化设计,在基于功能-行为-概念结构(function-behavior-conceptualstructure,FBCS)的产品概念设计过程中引入面向产品概念要素的图分割聚类算法,建立了一种面向FBCS的产品概念模块划分方法。以堆垛机推拉机构为例,分析了根据产品的总体目标特征,进行产品功能、行为、概念结构求解与功能分解迭代的产品概念设计分解方法。为描述概念产品,提出黑箱法和IDEF0功能描述方法相结合的概念产品建模方法,以建立产品子功能-概念结构模型。在此基础上,建立了产品概念要素(功能、行为、概念结构、接口)的相关关系分析方法,并引入图分割聚类算法进行产品概念要素聚合,以实现产品概念模块的划分。推拉机构的概念模块划分证明该方法是可行和有效的。     

基于空间分解与混合包围盒的碰撞检测算法

针对如何提高碰撞检测效率的问题,提出一种基于空间分解法和混合包围盒的碰撞检测算法。首先利用均匀剖分法确定相邻对象,然后只对相邻对象构建混合层次包围盒树,最后引入任务树的概念加速包围盒树的遍历过程。在包围盒碰撞检测中,提出了一种顶层采用AABB,其他层采用OBB的混合层次包围盒结构。实验结果表明,该算法有效提高了碰撞检测的效率和实时性。     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

网络雷阵及其被动定位原理

对网络水雷阵的概念进行了讨论 ,明确了几项系统关键技术 .提出了一种网络传感器纯方位目标定位算法 .该算法构思巧妙 ,用途广泛 .     

A stochastic gradual cover location problem

Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A note on efficient sequences with respect to total flow time and number of tardy jobs

For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016     

移动通信网络位置群体节点的挖掘方法

对移动通信网络的位置群体节点进行了优化定位和挖掘,优化移动通信网络的覆盖度和可靠度,传统的位置群体节点挖掘算法采用信息度增益控制挖掘算法,算法不能自主感知节点信息数据的变化,无法实现数据信息的实时传递和决策。提出基于位置群体节点信息融合和滤波控制的移动通信网络位置群体节点的挖掘方法。构建移动通信网络节点的分布模型和信道模型,采用多径信道均衡设计实现位置群体节点信息融合,采用自适应滤波控制方法实现对通信节点挖掘的干扰抑制。仿真结果表明,采用该方法进行通信节点挖掘,信标定位准确,信号的覆盖度较合理,实现了信道空间的合理高效利用,实现了信道均衡和干扰抑制,有效降低了通信的误比特率。     

基于粒子群优化算法的空中目标定位

受干扰条件下,雷达难以对空中目标准确定位。针对这一问题,提出了当多基雷达接收站在空间随机分布时,利用粒子群优化算法解决根据到达时间差对空中目标定位中遇到的非线性最优化问题。所建算法首先初始化一个随机粒子群,然后根据适应度值更新粒子速度和位置,通过迭代搜索最佳坐标。仿真结果表明,在参数设定合理的情况下,该算法性能稳定,能找到逼近全局最优点的解。     

基于最小最大决策的三站时差定位布阵优化

提出了一种基于最小最大决策的三站时差定位布阵优化方法,以提高系统对目标区域的整体定位精度。应用基于最小最大决策的最优化理论,建立布阵优化问题的数学模型。该模型以三站坐标为决策变量,以目标区域的最大水平定位误差最小为目标函数,然后运用基于最小最大决策的最优化算法,求解模型的最优解,并将此最优解作为三站时差定位系统的最优布阵。仿真结果与理论计算一致,验证了这种布阵优化结果的最优性。     

神经网络中引入数值积分寻优法

本文提出了一种新的寻优方法———数值积分寻优法 ,将此方法应用于神经网络的学习算法中 ,构造了两个神经网络 ,它们与BP网络有相同功能 ,且不出现BP网络的局部极小问题 ,收敛速度比BP网快     

A facility reliability problem: Formulation,properties, and algorithm

Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于网络雷达的目标定位跟踪

网络雷达实现了有源与无源探测一体化及雷达情报与电子对抗情报一体化,具有良好的目标定位跟踪性能。首先分析了网络雷达工作在有源无源一体模式的目标定位原理及定位的CRLB,并通过仿真说明了网络雷达的定位优势。然后根据网络雷达的特点,提出了一种基于目标状态和属性联合最近邻的数据关联算法,该算法合理地利用了目标的电子属性信息(如载频、重频、脉宽和脉内特征等)。对小角度交叉运动目标进行了跟踪仿真试验,该算法得到了很好的关联跟踪效果。     

目标定位和跟踪的神经网络最小二乘估计

首先概述了单目标定位和跟踪的现有研究结论和新问题,接着叙述了神经网络最小二乘估计方法,最后给出了它对第１类和第２类火控系统应用的数学模型     

基于仿真实验的弹道导弹阵地优选

合理部署弹道导弹位置对于提高作战效能具有至关重要的作用。基于解析计算的优化方法难以反映环境因素、武器装备的技术和动力特性等不确定性因素对部署位置的影响,求得的结果存在置信度低的问题。故将解析法与仿真实验相结合,以体系对抗条件下弹道导弹作战效能评估的数学模型为基础,建立了由各种作战实体和行动的模型聚合而成的弹道导弹攻防对抗仿真模型,然后通过仿真实验找出最优部署位置,最后给出了应用示例。实验表明该方法具有速度快、效率高、结果清晰直观的特点,可为指挥员提供科学、快速的决策支持。     

基于物元贝叶斯网的舰船损伤定位

在分析了物元理论和贝叶斯网理论的基础上,提出了结合主观概率信息和客观状态信息的物元贝叶斯网模型,并给出了物元贝叶斯网在损伤定位中的推理算法.舰船损伤定位的案例分析表明,该方法可以更加全面地融合战损装备的状态信息,使损伤定位结果更为准确.     

防空多传感器网络的拓扑优化模型

防空多传感器网络是防空网络化作战体系结构的重要组成部分。针对防空多传感器网络的网络结构模型,研究了已知网络中单元节点的位置和数量,如何最优确定网络中继器的位置、数量及其与单元节点的连接关系,即网络拓扑优化设计问题。最后给出了防空多传感器网络拓扑优化设计的数学模型及其求解方法。     

Optimal sensor placement for underwater threat detection

The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

关于m×n型流程优化的探讨

网络图的优化,是根据一定的约束条件对网络图进行调整和改进,以达到科学安排工作,合理分配人力、物力、财力等资源,从而提高工作效率的目的。流程优化就是通过改变工作顺序,解决组织计划中出现的窝工现象。m×n型流程优化,是解决有m个单位依次进行n项活动时,如何安排各单位的顺序最优的问题。通过案例的耗时分析,提出了确定单位顺序的方法,希望对解决相似问题提供一定的参考。     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998