培养高素质复合型军事人才的战略思考

军队建设和未来战争呼唤高素质复合型的军事人才.抓紧培养和造就一大批高素质复合型军事人才,是我军建设的战略选择和根本大计,也是我军院校的神圣职责和光荣使命.而要培养高素质复合型军事人才,必须首先更新教育思想观念,并以先进的教育思想观念为指导,确立科学的人才目标模型,优化教学总体设计;必须在加强课程教学上下功夫,把教学内容作为深化改革的核心和关键,同时抓好与其相适应的各项配套改革,确保整个教学改革协调一致的发展;必须不断创新军事人才培养模式,全面提高办学水平,从机制和实力2方面来保证培养目标的实现.     

Generalized orienteering problem with resource dependent rewards

We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

高功率水介质开关加载脉冲电压波头的数值分析

文中对02号实验装置——高功率脉冲水介质开关上加载的脉冲电压的波头作了数值分析,理论上讨论了各参数对水开关工作性能的影响,得出了C_M/C对水击穿特性影响很大的重要结论,从而给高功率亚微秒水开关的设计提供了理论依据。本装置的大量实验数据验证了计算的正确性。     

Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

Optimizing the US Navy's combat logistics force

We study how changes to the composition and employment of the US Navy combat logistic force (CLF) influence our ability to supply our navy worldwide. The CLF consists of about 30 special transport ships that carry ship and aircraft fuel, ordnance, dry stores, and food, and deliver these to client combatant ships underway, making it possible for our naval forces to operate at sea for extended periods. We have modeled CLF operations to evaluate a number of transforming initiatives that simplify its operation while supporting an even larger number of client ships for a greater variety of missions. Our input is an employment schedule for navy battle groups of ships operating worldwide, extending over a planning horizon of 90–180 days. We show how we use optimization to advise how to sustain these ships. We have used this model to evaluate new CLF ship designs, advise what number of ships in a new ship class would be needed, test concepts for forward at‐sea logistics bases in lieu of conventional ports, demonstrate the effects of changes to operating policy, and generally try to show whether and how the CLF can support planned naval operations. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Fulfillment by Amazon versus fulfillment by seller: An interpretable risk-adjusted fulfillment model

With dual-channel choices, E-retailers fulfill their demands by either the inventory stored in third-party distribution centers, or by in-house inventory. In this article, using data from a wedding gown E-retailer in China, we analyze the differences between two fulfillment choices—fulfillment by Amazon (FBA) and fulfillment by seller (FBS). In particular, we want to understand the impact of FBA that will bring to sales and profit, compared to FBS, and how the impact is related to product features such as sizes and colors. We develop a risk-adjusted fulfillment model to address this problem, where the E-retailer's risk attitude to FBA is incorporated. We denote the profit gaps between FBA and FBS as the rewards for this E-retailer fulfilling products using FBA, our goal is to maximize the E-retailer's total rewards using predictive analytics. We adopt the generalized linear model to predict the expected rewards, while controlling for the variability of the reward distribution. We apply our model on a set of real data, and develop an explicit decision rule that can be easily implemented in practice. The numerical experiments show that our interpretable decision rule can improve the E-retailer's total rewards by more than 35%.     

Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015     

The ballot or the bomb belt: the roots of female suicide terrorism before and after 9/11

ABSTRACT

In recent years, an upward trend in terrorist attacks has mirrored an increase in suicide attacks. According to our preliminary analysis, the events of September 11^th marked a sea change in the number of terrorist attacks. While a rich literature has evaluated why terrorists participate in suicide attacks, none have considered the uptick in volume after 9/11, and fewer yet have considered how female fighters may be contributing to this. We evaluate how both structural and female-specific factors affect the likelihood of female fighter suicide attacks. Recent literature discovered a trend in terrorist groups using females as suicide bombers due to cultural norms that permit them to get closer to targets. We test our theory using data from the Chicago Project on Security and Threats Suicide Attack Database (CPOST-SAD) and various datasets from the Quality of Government (QOG) compendium for the 1986–2016 time period. We construct a series of models that consider both female-specific and structural factors that could explain variation in the number of female suicide attacks. Our results indicate that our models encompass relatively stable patterns. Female political empowerment, female educational attainment, and female employment rates are significant and positive in our post-9/11 models, indicating that they may increase female suicide attacks. Democracy is a relevant structural factor and generally yields a positive effect on female suicide attacks across both time periods and multiple models. Ethnic fractionalization is significant in both time periods but yields a negative effect before 9/11 and a positive effect in the later period.     

面向图计算应用的处理器访存通路优化设计与实现

针对图计算应用的访存特点,提出并实现一种支持高并发、乱序和异步访存的高并发访存模块(High Concurrency and high Performance Fetcher, HCPF)。通过软-硬件协同的设计方法,HCPF可同时处理192条共8种类型的内存访问请求,且访存粒度可由用户定义,满足图计算应用对海量低延迟细粒度数据访问的需求。同时,HCPF扩展了基于内存语义的跨计算节点定制互连技术,支持远程内存的细粒度直接访问,为后续实现分布式图计算框架提供技术基础。结合上述两个核心研究内容,基于流水线RISC-V处理器核,设计并实现了可支持HCPF的RISC-V片上系统(System-on-Chip,SoC)架构,搭建基于FPGA的原型验证平台,并使用自研测试程序对HCPF进行初步性能评测。实验结果表明,HCPF相比原有访存通路,最高可将基于数组和随机地址的两种随机内存访问性能分别提升至3.5倍和2.7倍。远程内存直接访问4 Byte数据的延时仅为1.63μs。     

Optimal shift scheduling: A branch‐and‐price approach

We present a branch‐and‐price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 185–200, 2000     

A PANEL DATA ANALYSIS OF THE NEXUS BETWEEN DEFENCE SPENDING AND GROWTH IN THE EUROPEAN UNION: A REPLY

Hatzinikolaou raises a number of issues related mainly to the econometrics of our paper. These issues are categorized according to the three stages of econometric analysis: specification, estimation, and diagnostic checking. We categorize our reply to his comments accordingly.     

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.     

Optimal staffing in nonstationary service centers with constraints

This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017     

使用多Agent模型求解N－难题的新方法

借鉴多Ａｇｅｎｔ模型思想给出了求解Ｎ－难题的新方法。将Ｎ－难题分成多个Ａｇｅｎｔ,赋予每个Ａｇｅｎｔ以算法,利用Ａｇｅｎｔ之间的协作和交互有效地进行问题求解。该方法将前人的指数时空复杂度降为多项式时空复杂度,实际实现结果表明了该方法可行、高效。     

境外反恐行动的理论研究与实践探索

境外反恐行动在国际上已有大量先例，对于一个境外目标面临恐怖威胁或遭受恐怖袭击的国家，是不容回避的现实问题。通过对境外反恐行动产生的根源、各国境外反恐的对策、采取的方式及其制约因素的综合分析，能够得出有益的启示。反恐怖斗争的严峻现实和发展趋势，要求我们探索境外反恐对策，切实保护国家利益和人民生命财产安全，同时为国际反恐斗争作出应有的贡献。     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012