保凸均匀三次B样条插值曲线

均匀三次Ｂ样条曲线虽然具有保凸性,但曲线不通过任何控制顶点,我们在相邻两个控制点之间插入两个新的控制顶点后,所产生的新的均匀三次Ｂ样条曲线不但插值原来所有控制顶点,而且还保凸。本文描述的曲线可以作局部修改,给出了两个数值例子。     

平面上任给五个点确定椭圆的作图

本文所研究探讨的是:在平面上任给五个点(任三个点不在同一直线上),当构成的两个射影线束中对应直线对互不平行时所确定椭圆的作图方法。     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

飞越北极航行时间模型的研究

对飞越北极,缩短航线,节省航行时间问题进行了研究。采用了多种算法,对其有效性、适用性和复杂性进行分析讨论。假设"在旋转椭球体中,以通过球心和该椭球体上任意两点所构成的平面截此椭球体所得轨迹弧长作为曲面上两点间最短距离的近似值",在此基础上,通过运用数学软件计算得出结论:从北京出发,飞越北极抵达底特律的飞行时间可节省4.079 6h,从而使问题得到了进一步的验证。     

点数任意时的快速插值算法

本文建立了运算量级为O(nlog_2m) 的多项式快速除法(其中,m,n分别为除式与被除式的多项式次数),把点数n+1为2的幂次的多项式快速插值推广到n+1为任意数情形,提出了运算量级为O (n log_2~2n) 的快速插值算法。     

韩日签订《军事情报保护协定》的影响分析

在美国大力推动下,韩日政府于2016年11月签署《军事情报保护协定》。本文对韩日签署《军事情报保护协定》的背景和过程进行了梳理,指出了韩日政府关于该协定所存在的主要分歧,分析了该协定签署对东北亚乃至亚太地缘政治安全形势产生的深远影响。     

Deterrence under nuclear asymmetry: THAAD and the prospects for missile defense on the Korean peninsula

The 2016 decision to deploy Terminal High Altitude Area Defense (THAAD) to South Korea has generated multitude of intensely politicized issues and has proved highly controversial. This has made it challenging to alleviate, let alone clarify, points of analytical and policy tensions. We instead disaggregate and revisit two fundamental questions. One is whether THAAD could really defend South Korea from North Korean missiles. We challenge the conventional “qualified optimism” by giving analytical primacy to three countermeasures available to defeat THAAD–use of decoys, tumbling and spiral motion, and outnumbering. These countermeasures are relatively inexpensive to create but exceedingly difficult to offset. Second, we assess the optimal way to ensure South Korean national security against North Korean missiles. By examining the balance of capability and issues of credibility/commitment, we show that the U.S. extended deterrence by punishment remains plentiful and sufficiently credible even without enhancing the current defense capability.     

Terrorism,Radicalisation and Moral Panics: Media and Academic Analysis and Reporting of 2016 and 2017 ‘Terrorism’

Radicalism or radicalisation has become a serious political and academic theme in recent years and any incident involving Muslims now almost automatically acquires the cachet, as events in 2016 and 2017 have shown. However, despite vast sums and resources expended on the subject no one can define what they mean by ‘it’. This should make us pause and question what precisely it is that causes so much alarm and is it worth the resources, time and effort employed to respond to it?     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

A versatile scheme for ranking the extreme points of an assignment polytope

A cutting plane scheme embedded in an implicit enumeration framework is proposed for ranking the extreme points of linear assignment problems. This method is capable of ranking any desired number of extreme points at each possible objective function value. The technique overcomes storage difficulties by being able to perform the ranking at any particular objective function value independently of other objective values. Computational experience on some test problems is provided.     

一种改进的事件驱动系统框架

在给出事件驱动系统安全漏洞的基础上,指出了产生漏洞的根本原因是:系统忽视了输入系统的事件序列之间存在的相关性;系统无条件信任任何事件源产生的事件.针对这两个原因,相应提出了事件序列形式安全分析模型及基于事件源的可信度评估模型,依据这两个模型,构建了一种改进的事件驱动系统框架.     

Counterinsurgency Challenge in Post-2001 Afghanistan

Although the Taliban insurgency was internally divided and unable to coordinate its activities in 2014–2015, the Afghan security forces were not able to contain it and steadily lost ground throughout 2015. Until 2015, there had been little effort to develop an indigenous Afghan counterinsurgency strategy, but a sense of urgency emerged after a string of Taliban victories. At the beginning of 2016, it was still not clear if and when the National Unity Government would be able to produce a counterinsurgency strategy and, in any case, the need for a coherent counterinsurgency approach became questionable as the Taliban appeared to be transitioning towards conventional warfare.     

On allocating one active redundancy to coherent systems with dependent and heterogeneous components' lifetimes

This article studies coherent systems of heterogenous and statistically dependent components' lifetimes. We present a sufficient and necessary condition for a stochastically longer system lifetime resulted by allocating a single active redundancy. For exchangeable components' lifetimes, allocating the redundancy to the component with more minimal path sets is proved to produce a more reliable system, and for systems with stochastic arrangement increasing components' lifetimes and symmetric structure with respect to two components, allocating the redundancy to the weaker one brings forth a larger reliability. Several numerical examples are presented to illustrate the theoretical results as well. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 335–345, 2016     

基于菱形模板的摄像机标定方法

在传统的基于平面模板的摄像机标定算法和基于3个非线性点在特定运动下的标定算法的基础上,提出了一种基于菱形模板的摄像机标定算法,本算法只需要知道菱形的一个夹角就能标定出摄像机的内参数矩阵。弥补了传统算法在标定时需要知道特征点世界坐标的不足,减少了制定模板世界坐标带来的误差;同时本算法不需要菱形特征点做任何运动,避免了旋转特征点带来的人为误差。该算法的标定精度仅取决于特征点检测的精度,实验结果验证了该文算法的有效性。     

Value management of diagnostic equipment with cancelation,no‐show,and emergency patients

Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Simulation of nonhomogeneous poisson processes by thinning

A simple and relatively efficient method for simulating one-dimensional and two-dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates.     

A mixed optimization technique for the generalized machine replacement problem

A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via control theory, dynamic programming, or practical engineering considerations. (A control theory formulation is used in the paper as an illustration.) These subproblem solutions are then incorporated into a Wagner-Whitin formulation for solution of the full problem. The technique is particularly useful for problems with such asymmetries as an existing initial machine or uneven technological change. A simple numerical example is solved in the Appendix.     

Lot sizing with learning and forgetting in setups: Analytical results and insights

This article considers the dynamic lot sizing problem when there is learning and forgetting in setups. Learning in setups takes place with repetition when additional setups are made and forgetting takes place when there is a break between two successive setups. We allow the amount forgotten over a break to depend both on the length of the break and the amount of learning at the beginning of the break. The learning and forgetting functions we use are realistic. We present several analytical results and use these in developing computationally efficient algorithms for solving the problem. Some decision/forecast horizon results are also developed, and finally we present managerial insights based on our computational results. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 93–108, 2016     

A strategic model for state compliance verification

The theory of directed graphs and noncooperative games is applied to the problem of verification of State compliance to international treaties on arms control, disarmament and nonproliferation of weapons of mass destruction. Hypothetical treaty violations are formulated in terms of illegal acquisition paths for the accumulation of clandestine weapons, weapons‐grade materials or some other military capability. The paths constitute the illegal strategies of a sovereign State in a two‐person inspection game played against a multi‐ or international Inspectorate charged with compliance verification. The effectiveness of existing or postulated verification measures is quantified in terms of the Inspectorate's expected utility at Nash equilibrium. A prototype software implementation of the methodology and a case study are presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 260–271, 2016