一种基于扩展控制流图的DA交互结构表示方法

程序控制流图不能表示DA交互发生点处实际执行的SQL语句，因而不能清晰地表示出程序数据库的交互过程。针对该问题提出了用有限状态自动机表示DMLSQL语句，根据自动机的运行过程确定交互语句使用或定义的数据对象，并利用此信息生成表示交互语句的结点，以扩展CFG。实验表明，经过扩展后的ECFG能够直观地表示DA程序中与数据库的交互结构。     

一种基于导航点的航天器相对运动轨迹生成策略

针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.     

分段相关累加算法提取直扩信号伪码周期

针对低信噪比直接序列扩频(DS/SS)信号伪码周期难以检测的问题,特别是加信码的直扩信号,提出了一种新的分段相关模值累加检测方法和相应的快速算法。计算机仿真表明,在信号带宽内信噪比为-12 dB时,能够快速有效地检测直扩信号的伪码周期。     

A guarantee rate optimization model for wastewater treatment system design under uncertainty

We consider a design problem for wastewater treatment systems that considers uncertainty in pollutant concentration levels at water sources. The goal is to optimize the selection of treatment technologies and pipeline connections, so that treated wastewater can achieve specified effluents discharge limits as well as possible. We propose a new two-stage model to optimize a set of guarantee levels, that is, the maximum concentration level of source pollutants for which treated wastewater can be compliant with discharge limits. In the first stage, treatment technologies and pipeline connections are selected. In the second stage, when pollutant concentration levels are revealed, wastewater distribution and mixing are determined. A key attractiveness of the proposed guarantee rate optimization model is that it can be simplified into a single-stage mixed-integer linear program. In our numerical experiments based on real-world pollutants data, the guarantee rate model demonstrates its advantages in terms of computational efficiency, scalability and solution quality, compared with the standard probability maximization model. Finally, the methodology proposed in this paper can also be applied to other two-stage problems under uncertainty with similar uncertainty characteristics.     

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

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

美军采办项目的采办策略分析

采办策略是美军针对具体采办项目强制规定的覆盖整个项目寿命周期的纲领性文件,对于保障在资源限制条件下达成项目采办目标具有重要的意义。本文首先分析了采办策略的概念,随后研究了采办策略的主要内容、与采办管理周期的匹配要求,最后提出了对我军装备采办改革的启示。     

Quarrelsome committees in US defense acquisition: the KC-X case

When the US Air Force set out to acquire a new aerial tanker (the KC-X), two highly suitable alternatives were offered. What could have been a short and simple source selection turned into a prolonged embarrassment. The original selection of 100 leased KC-767s was made in May 2003. But the KC-46 is expected to be operational in 2017 – more than a decade later. Our primary purpose here is to narrate and explain key events in the KC-X program. We search for useful paradigms, based in part on the US Government being better viewed as a quarrelsome committee than a monopsonist. In addition, we consider what this case might tell us about the US defense acquisition system.     

Governmental Re-organization in Counterinsurgency Context: Foreign Policy Program Transfer and Operation Switchback in South Vietnam

Foreign policy program transfer, the shifting of implementation responsibility for a foreign policy program from one organization to another, is a ubiquitous, yet under-studied, counterinsurgency phenomenon. This article conceptually develops program transfer as an important object of study; analyzes, using archival sources, an empirical case of program transfer, Operation Switchback, drawn from US counterinsurgency practice in South Vietnam; and formulates two preliminary theoretical claims related to program transfer: (1) transferred programs will tend to be altered in accordance with the characteristics of the gaining organization, and (2) program transfer may act as a signal or early-warning indicator of foreign policy change.     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

基于累积前景理论的时间矩阵多属性综合评判模型

针对动态多属性方案排序优选决策问题,提出了一种基于累积前景理论的时间矩阵序列动态多属性综合评判系统模型。依据累积前景理论,将时间矩阵序列动态多属性决策转化为关于属性期望的益损时间矩阵序列动态决策,综合考虑各属性权重、各时间点的权重,计算各方案的最终综合前景值,并依据其大小对方案进行综合评判排序。最后给出了一个决策实例。