基于粒子群优化的观测站部署算法

针对红外观测站部署问题,在研究观测站位置对定位精度影响的基础上,提出了基于粒子群优化的观测站部署算法。首先对ECEF坐标系下的CRLB矩阵进行推导;然后将观测站优化部署问题抽象为非线性规划模型,并将红外传感器联合定位的CRLB作为目标函数;最后采用粒子群优化算法求解该模型,避免了传统的非线性规划算法需要求解目标函数梯度的难题。结果表明,本文的部署算法具有一定的理论依据和工程意义;可以为实际红外观测站的静态部署和动态部署提供参考。     

数字电位器在P T100温度仿真中的应用

伴随高速可编程逻辑器件的广泛应用,实时快速可靠地对系统状态信号进行处理,实现对复杂机电系统运行状态的实时监控成为用户追求的目标。基于数字电位器由于可调精度高,控制方便,性能稳定等优点,给出了一种基于CPLD可编程器件,通过数字电位器实现在半实物仿真系统中对PT100热电阻的阻值变化进行等效模拟的工程应用。利用本研究内容,通过上位机界面对系统温度参数进行人工设定,即可轻易实现对PT100热电阻在不同温度下阻值的真实模拟,检验实际系统温度监测装置软硬件的可靠性,确保系统安全运行。     

A three‐stage procurement optimization problem under uncertainty

This article examines a problem faced by a firm procuring a material input or good from a set of suppliers. The cost to procure the material from any given supplier is concave in the amount ordered from the supplier, up to a supplier‐specific capacity limit. This NP‐hard problem is further complicated by the observation that capacities are often uncertain in practice, due for instance to production shortages at the suppliers, or competition from other firms. We accommodate this uncertainty in a worst‐case (robust) fashion by modeling an adversarial entity (which we call the “follower”) with a limited procurement budget. The follower reduces supplier capacity to maximize the minimum cost required for our firm to procure its required goods. To guard against uncertainty, the firm can “protect” any supplier at a cost (e.g., by signing a contract with the supplier that guarantees supply availability, or investing in machine upgrades that guarantee the supplier's ability to produce goods at a desired level), ensuring that the anticipated capacity of that supplier will indeed be available. The problem we consider is thus a three‐stage game in which the firm first chooses which suppliers' capacities to protect, the follower acts next to reduce capacity from unprotected suppliers, and the firm then satisfies its demand using the remaining capacity. We formulate a three‐stage mixed‐integer program that is well‐suited to decomposition techniques and develop an effective cutting‐plane algorithm for its solution. The corresponding algorithmic approach solves a sequence of scaled and relaxed problem instances, which enables solving problems having much larger data values when compared to standard techniques. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

装备保障抽组力量物资装载模型

对装备保障抽组力量的物资装载问题进行了数学描述,建立了以实现全部物资尽量分散装载为目标,以同类物资集中装载、车辆承载物资总体积不超过车辆有效容积、车辆承载物资总重量不超过车辆标记载重量、物资必须装载且不被重复装载等为主要约束的数学模型,并进行了求解.最后通过实例解算验证了模型的有效性.     

液化石油气火灾的预防及扑救

在分析液化石油气的组成成份及其理化性质的基础上,针对液化石油气的火灾危险性及火灾特点,提出了防火防爆及火灾扑救措施.     

普通物理实验CAI的制作设想

普通物理学实验是公共必修课,随着电子技术迅速发展,多媒体已被广泛的运用,使人机交互能力大大提高,它正作为一种重要的教学媒体迅速应用于教学过程中,对促进教学现代化起着十分重要的作用.因此,制作CAI课件使学生由被动学习变主动学习,并能加深学生对实验内容的理解,对实验现象的观察和规范学生的实验操作技能,从而达到有效提高教学质量和教学效率的目的.     

A mathematical programming approach for improving the robustness of least sum of absolute deviations regression

This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Dynamic order acceptance and capacity planning on a single bottleneck resource

We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

某巡航导弹靶标RCS的仿真分析

某型巡航导弹靶标主要用于对拦截该弹的反导防御系统进行性能评估,而其在雷达照射下的RCS值是进行评估的一项重要指标,为研究其RCS值对反导防御系统中的雷达探测能力的影响,采用基于高频局部性原理的物理光学法(PO)和等效电磁流法(EEMC) 的综合来计算测量导弹的RCS值,并在改变雷达照射波入射方位角的情况下对该型导弹RCS的相应改变情况进行仿真分析,得出了该型号导弹的RCS图,为评估反导防御系统地基雷达的性能提供了参考依据.     

基于遗传算法的自航水雷航路规划

自航水雷在执行任务时需要装载根据战场环境预先规划好的最优路径,路径的优劣直接决定了自航水雷的作战效率.采用遗传算法进行自航水雷航路优化,算法利用极坐标描述威胁位置和航路点,将航路编码由二维缩减至一维,降低了搜索空间,提高了优化效率.对算法进行了相应的仿真,仿真结果表明,编码方式提高了优化效率,得到的航路有效地规避了威胁.