SpaceWire网络热点通信模式的缓存资源分配算法

基于SpaceWire网络在热点通信模式下的工作特点,研究缓存资源的分配算法。给出均匀通信模式和热点通信模式的释义;推导网络路由节点的满负荷概率和平均延时的解析方法,计算网络中的关键通信节点;再给出SpaceWire网络缓存资源分配算法。利用Opnet网络仿真平台建立SpaceWire通信模型,仿真了不同通信模式中采用缓存优化策略前后的关键性能指标。研究结果表明:在热点通信模式状态下,该缓存资源分配算法在保证总资源一定的前提下,网络系统的平均延时降低,优化了SpaceWire网络性能。     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

空空导弹随机最优导引规律的研究

通过建立导弹目标攻击简化数学模型 ,提出一种随机最优导引规律 ;运用卡尔曼滤波理论 ,引进了机动目标加速度和量测系统的不确定性。通过数字仿真 ,分别和传统比例导引规律、扩展比例导引规律相比较 ,表明了该规律的最优性     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

多操纵面战斗机飞行控制系统设计

现代多操纵面战斗机飞行控制系统多采用非线性控制方法进行设计,其中逆系统方法具有物理概念清晰、参数对应明确、无不确定性算法、容易结合传统经验等优点,易于工程实现.将该方法应用于多操纵面战斗机的基本控制律设计,使用多层简化设计,改进了多操纵面的控制分配策略,并针对某型多操纵面战斗机六自由度模型进行数字仿真,效果良好.     

真比例导引律的解析解研究

描述比例导引律的模型都是非线性微分方程组,不易求解,常规求解方法是线性化.对真比例导引律进行了详细推导,并和纯比例导引律进行了比较和分析,通过坐标变换和引入相对运动的单位角动量,获得了解析的捕获域和截获时间.研究结果表明,真比例导引律的捕获域受到导航比的限制,纯比例导引律的捕获域在一定条件下不受导航比限制.     

不确定情况下协同空战目标分配方法

现代空战环境下出现的大量不确定信息, 现在常用的协同目标分配模型都没有考虑到这种情况.针对这种情况,将随机规划引入到协同空战目标分配研究中,在一般期望值模型的基础上,建立了多机空战协同目标分配期望值模型,并利用随机模拟、神经网络和遗传算法结合而成的混合智能算法来求解该期望值模型.2∶4协同空战仿真结果表明该模型的有效性.     

异步雷达组网协同跟踪动态传感器分配算法

针对异步雷达组网下的协同跟踪问题提出了一种基于异步顺序融合的动态传感器分配算法。该算法对异步雷达的量测值按采样时刻顺序滤波,根据滤波协方差和目标期望协方差的接近程度动态选择下一时刻跟踪的最优传感器集合。仿真分析表明该算法和基于伪量测的异步雷达组网协同跟踪传感器分配算法相比具有较少的计算量和较高的目标跟踪精度。     

Terminal allocation problem in a transshipment hub considering bunker consumption

This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1～0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016     

便携式红外寻的防空导弹超前修正导引规律研究与仿真

针对便携式红外寻的防空导弹瞄准点与理想命中点不重合的矛盾,提出导弹超前修正导引规律的末端修正方法,导出其数学模型和控制系统实现方法。仿真表明,简化后的导弹超前修正导引规律能够达到理想的前向偏移目的,且具有目标自适应导引（TAG）的特性。超前修正导引规律是对经典比例导引规律的修正和提升,更好地满足了便携式红外寻的防空导弹的性能指标和命中精度要求。