随机测定算法

本文研究计算机网的广播信道中测定算法结合使用随机预测树形算法的问题,并提出了一种高效算法。文章还应用随机过程理论推导了这种算法的有关分布和定理。业已证明,该算法是稳定的,并且有极高的吞吐率和良好的时延特性。仿真实验结果证实了理论上的结论。     

基于气动-弹道一体化模型的飞行器外形优化设计

为提升飞行器气动外形优化设计效果,研究了新型飞行器在大空域、宽速域范围的气动适应性问题,提出一种基于气动-弹道一体化模型的外形优化设计方法.通过考虑气动和弹道的耦合作用,综合利用类型函数/形状函数转换技术、气动工程估算方法和Radau伪谱法,建立飞行器气动-弹道一体化模型.基于该模型,通过明确优化目标和约束条件,给出基...     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

信息中心网络缓存节点位置选择算法

信息中心网络（Information-Centric Networking, ICN）“泛在缓存”的特性,引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题,分别从用户、服务提供商和网络运营商的角度出发,以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型,并将二者结合为帕累托模型;基于帕累托求解方法中数学规划法的思想,详细描述缓存节点位置选择算法。仿真结果表明：在流量性价比方面,所提缓存节点选择算法优于ICN的默认缓存机制;在网络费用开销方面,所提算法更适用于只有少数内容较为流行的网络中,而在所有内容都流行的情况下,ICN中默认的“遍地缓存”机制更为适宜。     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

海量感知数据高效传输技术

现有感知数据传输模型存在能量消耗大、网络生存周期短、适用范围窄、收敛性弱以及实际应用性差的问题,为了实现大面积感知数据高效传输,提出了基于数据关联度的模糊自适应融合算法,建立了自适应网络模型。感知节点发送的数据经汇聚节点、中继节点转发时,通过自适应网络模型,根据感知数据关联度,动态修正输入参数加权系数从而改变控制规则,再用优化的控制规则进行参数调整,融合后的数据再传送到上一级平台,实验表明了该算法能明显改善海量感知数据传输性能。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

一种适用于UHF频段军事卫星通信的高效传输方案

特高频(UHF)频段由于其良好的通信性能,正愈发广泛地应用于军事卫星通信,尤其是卫星移动通信,然而由于该频段信道所受干扰和固有衰落的限制,UHF在卫星通信中的应用并非一帆风顺。如何提高系统通信容量及在干扰环境下的信道可用率是目前UHF频段军事卫星通信发展所面临的主要挑战。文章在分析UHF频段卫星通信特点的基础上,简要介绍了具有良好性能的低密度校验码(LDPC)码和连续相位调制(CPM)方式,并结合UHF频段的卫星信道特点,提出了一种新的发展对策——LDPC+CPM+FH的串行级联通信方案,最后对方案进行了建模和计算机仿真。     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

混合不确定条件下的飞行器级间分离可靠性分析

为量化飞行器级间分离过程随机不确定性和认知不确定性的综合影响,结合概率和区间理论混合模型特点,提出了一种基于随机和区间理论混合模型的飞行器级间分离可靠性分析方法。面向高超声速飞行器分离任务需求,建立分离动力学仿真模型,针对级间分离结构的几何特点,设计了一种快速碰撞检测方法,进而构建了分离任务的可靠性分析混合模型。通 过将该模型转化为随机可靠性分析的无约束优化问题,考虑分离过程中复杂外力及力矩导致功能函数高度非线性的特点,利用高效全局优化和主动学习Kriging方法实现无约束优化问题高效求解。结合实例表明,该方法能够准确描述混合不确定性因素对飞行器分离过程的影响,给出了飞行器分离任务可靠性区间,可为飞行器分离方案的精细化设计提供决策支持。