Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems

In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015     

The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options

This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015     

序降应力加速寿命试验(下)——优化设计篇

如何设计试验方案使试验评估结果更准确、试验代价更小,是序降应力加速寿命试验应用中面临的一个重要问题。以试验评估精度和试验代价共同需求为背景,建立一类新的基于加权系数的优化目标函数。为解决仿真优化设计过程中的计算量问题,在深入分析目标函数性质基础上,提出一种新的优化设计法——正交搜索法。与优化设计过程的全局搜索法不同,该方法能够逐次缩小目标函数值,快速逼近最优试验方案。最后通过仿真算例验证了新方法的正确性和高效性。     

一种钢管焊接结构焊接节点损伤识别的新方法

采用端部半刚性连接梁单元模型进行模拟焊接节点的损伤,并基于应变模态理论,提出了一种焊接节点损伤识别两步法。第一步,先整体测量结构的位移模态并推导出应变模态,然后采用改进后的目标函数,通过信赖域优化算法对损伤节点位置进行准确判定;第二步,采用提出的杆端应变模态变化比指标,实现焊接节点损伤程度的精确识别。经工程实例的数值仿真及试验分析,验证了该方法的有效性及优越性,为解决这类大型焊接结构焊接节点的损伤识别问题提供了新思路。     

空舰导弹航路规划攻击角度与发射距离选择仿真分析

如何使用空舰导弹突击具有区域防空能力水面战斗舰艇是对海突击战斗的重点、难点问题之一,从分析使用空舰导弹突击水面舰艇战斗过程入手,归纳了导弹航路规划中需要考虑的各种关键要素,并对各要素进行简要的分析,根据分析建立舰空导弹拦截过程的数学模型,并使用matlab编制仿真程序进行计算,根据计算结果对航路规划问题中空舰导弹进入方向与发射距离之间的关系进行探讨。     

利用字节模式二维特征的ROP链智能检测方法

面向返回编程(return oriented programming, ROP)攻击是网络攻击者突破操作系统安全防护、实现漏洞攻击的一种主要手段,ROP链是ROP攻击的重要组成部分。为检测网络流量中的ROP链,提出了一种能自动提取ROP链特征、具有良好泛化性能的智能检测方法。该方法采用顺序抽取的方式将被测流量分成多个序列,利用滑动窗口和数值量化将输入的一维流量数据转换为二维特征向量,基于卷积神经网络模型实现对ROP链的检测。不同于已有的静态检测方法,该方法不依赖程序内存地址的上下文信息,实现简单、部署方便,且具有优异的检测性能。实验结果表明,模型最高准确率为99.4%,漏报率为0.6%,误报率为0.4%,时间开销在0.1 s以内,对真实ROP攻击流量的漏报率为0.2%。     

Radar pulse interleaving for multi‐target tracking

In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

程序设计语言发展过程中应注意的问题

针对目前程序设计语言发展过程中出现的语言种类过杂、语言数量过多、语言结构过于复杂、语言间重复性大以及语言功能求全问题进行讨论,从语言功能分离、符号与内容分离及语言统一的角度初步提出了解决问题的途径,同时对程序设计语言的汉化问题做了简要讨论。     

基于进化规划的自适应高斯神经网络

自适应高斯神经网络能够对目标信号的功率谱有效识别特征进行自动提取和分类,但此网络使用BP算法,其误差能量函数是一个不规则的超曲面,容易陷入局部极小值.因此,提出了一种使用进化规则来设计和训练自适应高斯神经网络的新方法.该方法能够自动地确定网络的最优结构和联结权值,同时避免网络的局部优化.实验结果表明,将该方法用于被动声纳目标的分类识别,能够有效地克服局部最小问题,具有更好的识别率.     

模糊多目标群决策的装备采办问题研究

对模糊多目标群决策的装备采办问题,根据模糊数学理论和多目标决策理论方法,综合现有各种方法的优点,给出了无约束条件下模糊多目标群决策的装备采办问题的一般解法,并通过实例说明了该方法的有效性及通用性。