具有模糊系数约束的多目标线性规划

研究了一类具有模糊系数约束的多目标线性规划问题.根据各目标函数的梯度方向来量化目标之间的冲突程度,以此提出了一种确定目标权重的新方法,然后基于惩罚函数运用梯度上升算法求问题的有效解.最后给出了一个数值例子.     

一种具有遗忘特性的在线学习算法框架

基于凸优化中的对偶理论,提出了一种具有遗忘特性的在线学习算法框架。其中,Hinge函数的Fenchel对偶变换是将基本学习问题由批量学习转化为在线学习的关键。新的算法过程是通过以不同方式提升含有约束变量的对偶问题实现的:(1)梯度提升;(2)贪婪提升。回顾了以往的相关研究工作,并指出了与之的区别与联系。人造数据集和真实数据集上的实验结果证实了算法框架的有效性。算法可以很好地处理数据流中的分类面漂移问题,为设计和分析新的在线学习算法提供了一个新的思路。     

Detection of a Markovian target with optimization of the search efforts under generalized linear constraints

This paper deals with search for a target following a Markovian movement or a conditionally deterministic motion. The problem is to allocate the search efforts, when search resources renew with generalized linear constraints. The model obtained is extended to resource mixing management. New optimality equations of de Guenin's style are obtained. Practically, the problem is solved by using an algorithm derived from the FAB method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 117–142, 2002; DOI 10.1002/nav.10009     

Optimum sequential search with discrete locations and random acceptance errors

Much work has been done in search theory; however, very little effort has occurred where an object's presence at a location can be accepted when no object is present there. The case analyzed is of this type. The number of locations is finite, a single object is stationary at one location, and only one location is observed each step of the search. The object's location has a known prior probability distribution. Also known are the conditional probability of acceptance given the object's absence (small) and the conditional probability of rejection given the object's presence (not too large); these Probabilities remain fixed for all searching and locations. The class of sequential search policies which terminate the search at the first acceptance is assumed. A single two-part optimization criterion is considered. The search sequence is found which (i) minimizes the probability of obtaining n rejections in the first n steps for all n, and (ii) maximizes the probability that the first acceptance occurs within the first n steps and occurs at the object's location for all n. The optimum sequential search policy specifies that the next location observed is one with the largest posterior probability of the object's presence (evaluated after each step from Bayes Rule) and that the object is at the first location where acceptance occurs. Placement at the first acceptance seems appropriate when the conditional probability of acceptance given the object's absence is sufficiently small. Search always terminates (with probability one). Optimum truncated sequential policies are also considered. Methods are given for evaluating some pertinent properties and for investigating the possibility that no object occurs at any location.     

基于权值的NURBS曲线形状修改

针对基于控制顶点的NURBS曲线形状修改的不足,讨论了如何通过修改控制顶点的权值进行NURBS曲线的形状修改问题。NURBS曲线可以看作是高一维空间非有理B样条曲线的中心投影,该B样条的控制顶点为原NURBS曲线的带权控制顶点,并且这样的B样条曲线有无数多条。根据这个性质,以实例的方式通过特定自由参数确定B样条曲线,实现了基于权值的NURBS曲线形状修改。该方法不仅能够较好地确定新的带权控制顶点,还解决了修改后曲线在给定点的切矢问题,具有更好的灵活性。     

一种基于视觉的目标舷角实时测量方法

舰船的舷角是鱼雷攻击时的重要参数,同时也是海航避碰中避碰线路确定的计算依据。在基于视觉的识别中,获取目标舰船的舷角即可确定其相对拍摄视角,从而大大缩小在全方位视野特征库中的搜索范围,提高识别速度。然而现有的舷角测量方法均是采用连续跟踪解算实现的,无法实时测量。为解决实时测量的问题,首先推导了基于视觉的目标舰船舷角测量原理,然后针对摄像机倾斜的情况提出基于水天线校正的改进方法,最后通过实验验证,结果表明方法简单易操作、实时性好。     

The SSA-BP-based potential threat prediction for aerial target considering commander emotion

The target's threat prediction is an essential procedure for the situation analysis in an aerial defense system. However, the traditional threat prediction methods mostly ignore the effect of commander's emotion. They only predict a target's present threat from the target's features itself, which leads to their poor ability in a complex situation. To aerial targets, this paper proposes a method for its potential threat prediction considering commander emotion (PTP-CE) that uses the Bi-directional LSTM (BiLSTM) network and the backpropagation neural network (BP) optimized by the sparrow search algorithm (SSA). Furthermore, we use the BiLSTM to predict the target's future state from real-time series data, and then adopt the SSA-BP to combine the target's state with the commander's emotion to establish a threat prediction model. Therefore, the target's potential threat level can be obtained by this threat prediction model from the predicted future state and the recognized emotion. The experimental results show that the PTP-CE is efficient for aerial target's state prediction and threat prediction, regardless of commander's emotional effect.     

Joint pricing,assortment, and inventory decisions for a retailer's product line

Consider a set of product variants that are differentiated by some secondary attributes such as flavor, color, or size. The retailer's problem is to jointly determine the set of variants to include in her product line (“assortment”), together with their prices and inventory levels, so as to maximize her expected profit. We model the consumer choice process using a multinomial logit choice model and consider a newsvendor type inventory setting. We derive the structure of the optimal assortment for some important special cases, including the case of horizontally differentiated items, and propose a dominance relationship for the general case that simplifies the search for an optimal assortment. We also discuss structural properties of the optimal prices. Finally, motivated by our analytical results, we propose a heuristic solution procedure, which is shown to be quite effective through a numerical study. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

求解整数规划问题的一个搜索方法

本文整数规划问题给出一种搜索方法,它类似于求解连续变量优化问题的迭代方法,从一个好的初始可行解出发,寻找一个搜索方向,沿着这个方向求出改进的可行解,然后又开始下一次迭代。此方法简单易行,可以求出问题的最优解或近似最优解,对于整数线性规划问题和整数非线性规划问题的求解都适用,并且容易推广到求解大规校整数线性规划问题。文中附有计算例子,说明方法是有效的。     

基于四面体六棱长的三站测时差立体定位方法

针对在三站测时差立体定位中辐射源位置不能唯一确定的情形,提出一种简单易懂、计算方便、可操作性强的解析解方法,以解决求解双曲面方程组的繁琐问题。首先利用三站相互之间的距离、由量测时差值换算得到的两个距离差值,以及辐射源至主站的距离(设为变量r)总共6个参数,立足于已知6条边长判断能否构成四面体的理论,求得r的取值范围;然后在r的值域范围内任意给定某个具体值,加上已知三站的地理位置,通过解三元一次方程组的形式获得目标在三站所在平面内垂直投影的坐标(设为变量X_h),并计算出目标至垂直投影的距离(设为变量h);最后由X_h和h给出目标在地心地固直角坐标系下的坐标。     

基于STK的机载布撒器弹道仿真

机载布撒器是快速、远程、精确打击的新一代空对地攻击武器,对其弹道的研究有着重要意义。建立了机载布撒器飞行弹道仿真模型,运用能量法消除了风对布撒器的部分干扰,通过MATLAB得出布撒器弹道数据及二维弹道,利用STK软件强大的弹道仿真能力,建立布撒器仿真星历文件及姿态文件,设置地面站并运用YPR旋转方法转换坐标系,添加了布撒器仿真模型,以布撒器为中心视角展示并完成了三维弹道仿真,为后续对布撒器改装提供了一定参考依据。     

Heuristics for the location of inspection stations on a network

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

载人飞船上升段轨道的Newton迭代设计法

本文对载人飞船上升段轨道的一种工程设计方法进行了探讨。该方法的特点是根据上升段飞行的特征,运用飞行力学原理选定其控制规律的数学模型,然后根据上升段轨道的中间约束条件和终端约束条件,利用Newton迭代法确定模型中的各待定参数。本文给出了该设计方法的流程图,并通过模拟计算论证了该设计方法的可行性。     

基于改进的投影法的目标标识定位算法研究

军事对抗中,需要准确识别目标标识,以车辆识别中车牌精确定位为例进行研究。通过结合利用跳变法和投影法,提出一种基于改进的投影法的车牌定位。由进行车牌水平定位的跳变法和进行车牌垂直定位的投影法两个步骤组成。其中,像素在车牌水平方向的区域内会产生明显跳变,先通过跳变法确定车牌的水平区域。由于车牌一般位于图像的下半部分,所以从图像的1/2高度到4/5高度,1/3宽度到4/5宽度处扫描,减少背景区干扰。然后在车牌的水平区域再进行垂直投影,得到车牌的准确位置。实验结果证明,该方法不仅可以有效提高定位速度,还能够由于减少背景区的干扰而提高定位准确度。     

美军现役装备改造后维修保障的做法和启示

现役装备改造是我军装备发展的重要途径.加强对现役装备改造后的维修保障问题研究,是解决目前我军装备改造后战斗力生成的迫切需要.通过深入研究了美军装备改造后维修保障基本做法,对我军当前存在的主要问题进行了探讨,并从中得出对我军加强装备改造后维修保障建设与发展的启示,为提高我军装备维修保障能力做了有益的探索.     

基于多种群遗传算法的远程作战体系加油路径优化

为解决加油机在远程作战体系中的高效使用与经济性问题,推导了远程作战体系中加油机和歼击机的油耗方程模型,建立以耗油量最少为目标的空中加油路径优化模型。该模型基于一定的作战任务构想,利用多种群遗传算法进行了求解,从求解结果来看,该算法可以快速搜索到能够在所有满足作战任务要求的任务路径中寻找到最小消耗的位置坐标,以获得最大的作战效能,从而达到优化远程作战体系中的作战和训练中加油机使用问题。     

基于Linux文件检索方法的改进研究

随着磁盘容量的急剧增大,文件系统的性能以及文件系统的效率会急剧下降,这是因为文件列表过于庞大,传统的文件系统在检索文件时采用的线性搜索方式带来的检索效率低下导致。对Linux虚拟文件系统进行深入剖析,阐述了VFS打开以及新建文件的机制,指出其存在的缺陷及问题。在Linux文件系统的基础上,参考暴雪游戏公司解决hash冲突的blizzard算法,提出一种通过在磁盘上建立文件目录项的哈希表来提高文件查找效率的方法。     

基于飞蛾信息素寻偶机制的无人机集群协同搜索

为了提高无人机集群协同搜索移动目标的效率,提出一种基于飞蛾信息素寻偶机制的无人机集群协同搜索方法。根据飞蛾基于信息素选择飞行方向的寻偶行为,建立信息素图风向模型和飞蛾信息素寻偶模型。考虑无人机机间避撞约束,提出从飞蛾信息素寻偶机制到无人机集群分布式协同搜索的映射,并给出具体实现流程。仿真实验结果表明了所提方法在解决单个移动目标的协同搜索问题时的有效性和稳定性;外场飞行试验表明了所提方法在实际应用中的可行性。