1.25cm 体效应振荡器研制

文中讨论了一种1.25cm波段的波导型体效应振荡器。其主腔采用可调节的同轴减高波导座结构,使电路与二极管实现良好匹配。文中着重讨论了主腔各部尺寸对振荡器特性的影响。稳频腔采用高Q值的H_(011)模式圆柱腔,并采用线胀系数不同的金属材料进行温度补偿,提高了频率稳定度。利用WT55型体效应管,在23-25GH_2频带内,功率输出大于30mw,频率稳定度为5×10~(-5)。     

内置频率对Duffing振子微弱二进制相移键控信号盲检测影响

采用Duffing振子实现对微弱二进制相移键控（Binary Phase Shift Keying, BPSK）信号的盲检测时,Duffing系统输出的周期态和混沌态转换之间存在过渡带。针对这一问题,推导出过渡带时长和Duffing系统内置频率之间的关系表达式;指出内置频率越高,过渡带时间越短;仿真实验给出时间频率响应曲线。内置频率的提高,会降低系统检测微弱信号的灵敏度。针对这一问题,推导出周期态下Duffing系统输出幅度作为因变量、内置频率作为自变量的表达式;仿真实验给出幅频响应曲线。针对微弱BPSK信号盲检测,建立变尺度方法和检测阵列相结合的基于S变换提取Duffing系统输出幅度包络的微弱BPSK信号盲检测模型,仿真实验验证了模型方法的有效性。     

顾及地磁影响的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.     

基于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的运动几乎无影响     

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

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