基于SDP松弛的干扰资源优化分配技术研究

提出一种基于semidefinite programming(简称SDP)松弛的干扰资源优化分配算法。在问题优化过程中首先对模型中非凸的约束条件进行松弛,变为凸约束,将原来的数学模型转化成SDP求解形式,利用内点算法对松弛后的模型求解。该算法利用解析的手段使得干扰资源优化分配问题中的NP难问题在多项式时间内得以解决,并且有较高的可靠性。仿真结果验证了算法的有效性。     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

核磁共振研究溶胀AB-交联聚合物中的分子运动

测定了溶胀的PPU/PSAB 交联聚合物中链段和侧基的13CT1和NOE ,用VJGM模型和三等价位跃迁内旋转、扩散内旋转以及等价、不等价两位置跃迁内旋转模型分析了其中的主链链段运动和侧基内旋转运动 ,求出了主链和侧基的运动相关时间、扩散系数和活化能等参数 .结果表明PS含量对PPU运动的影响极小 ,PS主链运动活化能与PPU含量存在线性关系 .丙烯酸与苯乙烯共聚对PPU的运动几乎无影响     

改进的拉格朗日松弛数据关联算法

在多传感器多目标跟踪领域中,当传感器为被动式的,传统的多维分配算法利用拉格朗日松弛算法求解.拉格朗日乘子更新一般用次梯度方法,但每次迭代都要进行多次极小化运算来求对偶解,导致实时性差.针对这个问题,提出了一种改进的基于拉格朗日松弛的数据关联算法,通过代理修正次梯度方法更新拉格朗日乘子,并在允许时间内获得近似解.仿真实验...     

顾及地磁影响的GNSS电离层层析不等像素间距算法

突破传统全球导航卫星系统(Global Navigation Satellite System, GNSS)层析反演研究忽略地球磁场对电离层变化活动的影响,同时顾及不同电离层高度电子密度变化较大的影响,提出在地磁坐标系下建立电离层高度方向上不等像素间距的GNSS层析反演方法。在此基础上,通过建立新的电离层层析迭代松弛因子,提高GNSS电离层电子密度层析反演结果精度。利用IRI—2007电离层模型、GNSS实测数据与电离层测高仪数据,从模拟验证和实测数据对比两方面,反演统计了不同层析算法估算的峰值电离层电子密度误差、电子密度剖面结果平均绝对百分比误差及均方根误差,验证了顾及地磁影响的GNSS电离层层析不等像素间距算法的有效性。     

Interdiction models for delaying adversarial attacks against critical information technology infrastructure

Information technology (IT) infrastructure relies on a globalized supply chain that is vulnerable to numerous risks from adversarial attacks. It is important to protect IT infrastructure from these dynamic, persistent risks by delaying adversarial exploits. In this paper, we propose max‐min interdiction models for critical infrastructure protection that prioritizes cost‐effective security mitigations to maximally delay adversarial attacks. We consider attacks originating from multiple adversaries, each of which aims to find a “critical path” through the attack surface to complete the corresponding attack as soon as possible. Decision‐makers can deploy mitigations to delay attack exploits, however, mitigation effectiveness is sometimes uncertain. We propose a stochastic model variant to address this uncertainty by incorporating random delay times. The proposed models can be reformulated as a nested max‐max problem using dualization. We propose a Lagrangian heuristic approach that decomposes the max‐max problem into a number of smaller subproblems, and updates upper and lower bounds to the original problem via subgradient optimization. We evaluate the perfect information solution value as an alternative method for updating the upper bound. Computational results demonstrate that the Lagrangian heuristic identifies near‐optimal solutions efficiently, which outperforms a general purpose mixed‐integer programming solver on medium and large instances.     

自紧管的蠕变——应力松驰

本文讨论自紧管在稳定化处理时,由于残余应力作用,材料发生蠕变而引起的应力松驰现象.根据材料的蠕变性能,利用数值方法计算了稳定化处理时蠕变引起的残余应力松驰量。本文认为,在本实验条件下,稳定化处理过程中蠕变引起的应力松驰量可忽略。     

高速核在高温热平衡等离子体中的非平衡弛豫过程对热核反应率参数的影响

高速核入射到高温热平衡等离子体背景中,由于入射核动能远大于背景等离体中带电粒子之平均动能,入射核在与背景等离子体达到热平衡之前,会存在一段逐渐损失能量的非平衡弛豫过程。本文以高速氘核入射到高温氘化锂等离子体为例,在计及氘核的这种非平衡弛豫过程时,给出了一种计算热核反应D(t,n)~4He之反应率参数的方法。氘核在弛豫过程中的能量损失考虑了氘核与各种带电粒子的库仑散射过程,其能量损失率采用快速带电粒子的慢化理论来计算;氘与背景等离子体中的原子核发生的核反应过程,考虑了非平衡状态下束靶机制的D(t,n)~4He反应和热平衡状态下的D(t.n)~4He反应。在暂未考虑核散射的情况下,计算结果表明,当等离子体温度在7.5KeV～20KeV范围内变化时,氘核的非平衡弛豫过程对热平衡状态下D(t,n)~4He反应率参数的修正因子大致在1.0062～1.0943范围内变动,且温度越高,修正因子越小。计算还表明,当温度一定时,修正因子随等离子体中粒子的数密度变化不明显。     

多目标数据关联的多维Lagrangian松驰法

将多目标跟踪中的数据关联问题提成为一个离散最优化问题 ,并采用 L agrangian松驰算法来克服该问题面临的计算困难 ,这是目前多祯多目标测量数据关联研究发展的重要方向。首先将多祯多目标数据关联问题建立为一个带约束的多维分配问题 ;并在维数大于 2时 ,采用 L agrangian松驰算法来松驰约束条件 ,使问题降维为计算上可接受的二维分配问题。