Honeypot系统研究与比较

Honeypot系统是构建一个跟实际系统类似的网络陷阱,成为现有网络安全体系的重要补充手段。它可以诱惑攻击者将时间和资源都花费在攻击Honeypot上,从而保护真实工作系统免于攻击。它能监视和跟踪入侵者,收集入侵者的信息,以分析系统所面临的威胁,研究入侵者所用的入侵工具、策略和动机,在网络安全中起着主动防御的作用,是现有安全体系的重要补充。文章分析了构造Honeypot的分类及其优缺点,对Honeypot的实现软件进行比较,并指出了Honeypot系统存在的不足。     

攻击机首攻概率模型

攻击机在首次进入攻击时完成作战任务的概率(首攻概率)是评估空军武器进攻装备作战效能的基础。从无对抗情况下攻击机的作战过程入手,分析建立了攻击机机载空地武器可攻击区的数学模型,在此基础上建立了无对抗情况下攻击机的首攻概率模型,并对所建立的概率模型进行了有效性分析。     

Optimal motion planning in rapid‐fire combat situations with attacker uncertainty

This article provides a modeling framework for quantifying cost and optimizing motion plans in combat situations with rapid weapon fire, multiple agents, and attacker uncertainty characterized by uncertain parameters. Recent developments in numerical optimal control enable the efficient computation of numerical solutions for optimization problems with multiple agents, nonlinear dynamics, and a broad class of objectives. This facilitates the application of more realistic, equipment‐based combat models, which track both more realistic models, which track both agent motion and dynamic equipment capabilities. We present such a framework, along with a described algorithm for finding numerical solutions, and a numerical example.     

African nations as proxies in covert cyber operations

The growth of the African Internet, and services related to the Internet, has been rapid over the last decade. Following this market expansion, a variety of service providers have started to provide access. A fast-growing market puts pressure on the providers to deliver services first and only then seek to secure the networks. Over time, industrialised nations have become more able to detect and trace cyber attacks against their networks. These tracking features are constantly developing and the precision in determining the origin of an attack is increasing. A state-sponsored cyber attacker, such as intelligence agencies and electronic warfare units, will seek to avoid detection, especially when the attacks are politically sensitive intelligence-gathering and intrusion forays into foreign states' networks. One way for the attacker to create a path that links the attacks and the originating country is by actions through a proxy. The less technologically mature developing nations offer an opportunity for cyber aggression due to their lower level of security under the quick expansion of the Internet-based market. Developing countries could be used as proxies, without their knowledge and consent, through the unauthorised usage of these countries' information systems in an attempt to attack a third country by a state-sponsored offensive cyber operation. If the purpose of the cyber attack is to destabilise a targeted society and the attack succeeds, the used proxies are likely to face consequences in their relations with foreign countries, even if the proxy was unaware of the covert activity.     

The effect of prior assumptions on the expected cost of m/m/1 queueing systems with unknown arrival rate

In this study we deal with the determination of optimal service rate in an M/M/1 queue. The arrival rate is unknown and assumed to be a random variable with a known distribution function. Holding and operating costs are considered and service rate is determined to minimize total expected discounted costs for infinite horizon. The effects of the arrival rate's distribution properties on the characteristics of the system are examined.     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

A duel complicated by false targets and uncertainty as to opponent type

An attacker, being one of two types, initiates an attack at some time in the interval [-T, 0]. The a priori probabilities of each type are known. As time elapses the defender encounters false targets which occur according to a known Poisson process and which can be properly classified with known probability. The detection and classification probabilities for each type attacker are given. If the defender responds with a weapon at the time of attack, he survives with a probability which depends on the number of weapons in his possession and on attacker type. If he does not respond, his survival probability is smaller. These probabilities are known, as well as the current number of weapons in the defender's possession. They decrease as the number of weapons decreases. The payoff is the defender's survival probability. An iterative system of first-order differential equations is derived whose unique solution V₁(t),V₂(t),…,V_k(t) is shown to be the value of the game at time t, when the defender has 1, 2,…, k,… weapons, respectively. The optimal strategies are determined. Limiting results are obtained as t→-∞, while the ratio of the number of weapons to the expected number of false targets remaining is held constant.     

第三届广西学生军与昆仑关战役

昆仑关战役是抗战相持阶段桂南会战中最大的一次战役,中国军队以惨重代价取得胜利。在战役中,第三届广西学生军发动民众破坏日军补给,保障中国军队战地后勤,协调军民关系,为部队提供情报,进行战地宣传,配合其他武装力量袭击日军,对保证战役胜利起了很大的作用。     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

Perspectives for the development of key industrial capabilities for Canada’s defence sector

With the Canada First Defence Strategy, Canada has put forth a major opportunity to reconcile national security imperatives and industrial policy. The Jenkins Report (2013) set out to examine ways to use that procurement effort to foster key industrial capabilities (KICs) that would put the Canadian defence industry at an advantage both nationally and internationally. The Canadian defence industry should then develop highly focused capabilities with a view to moving up global value chains. As such, KICs that hold the best potential should be selected. They should be sustained through a range of strategies that are however contingent on the elimination of policy gaps. This leads to a balancing act between the need to control intellectual property assets versus accessing them in a world where national boundaries are eroded. Canada’s industry should target opportunities outside North America while continuing to focus on better integration with the North American industry.     

The continuous‐time single‐sourcing problem with capacity expansion opportunities

This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

对新型主战坦克火力系统的使用和发展要求

分析了我军现装备的主战坦克,并与国外主战坦克进行了比较,对我国新型主战坦克火力系统的使用提出了武器操作简便、工作环境舒适、炮弹燃料隔仓、高射机枪潜瞄、发射弹数记录自动、目标跟踪自动、弹着偏差测量自动、武器维修方便等要求,并从有效射程、炮弹威力、射击反应时间和全天候作战能力等方面对新型主战坦克火力系统的发展提出了需求。     

Pseudo-monotonic interval programming

A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rⁿ | a < Ax < b, a, b ε R^m} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program.     

A queueing system with vacations after N services

This article is devoted to the study of an M/G/1 queue with a particular vacation discipline. The server is due to take a vacation as soon as it has served exactly N customers since the end of the previous vacation. N may be either a constant or a random variable. If the system becomes empty before the server has served N customers, then it stays idle until the next customer arrival. Such a vacation discipline arises, for example, in production systems and in order picking in warehouses. We determine the joint transform of the length of a visit period and the number of customers in the system at the end of that period. We also derive the generating function of the number of customers at a random instant, and the Laplace–Stieltjes transform of the delay of a customer. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 646–658, 2015     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

Sequencing many jobs on a multi-purpose facility

Suppose a given set of jobs has to be processed on a multi-purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence-dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs. A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large-dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming approach.     

Britain's Great Security Mirage: The Royal Navy and the Franco-Russian Naval Threat, 1898–1906

This article focuses on the relationship between the threat perception analyses of the British Admiralty and the strategic orientation of the Royal Navy at the outset of the twentieth century. The current view is that this was an era when fear of France and Russia drove British naval policy. However, as this article will show, Britain's Naval Intelligence Department formed a low opinion of French and Russian naval capabilities at this time and this negative evaluation exerted considerable influence over decision making. The belief that, owing to multiple qualitative deficiencies, these powers could definitely be beaten in battle lessened the standing of the Franco-Russian naval challenge and freed the Admiralty to consider the danger posed by other possible enemies, most notably Germany.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Stochastic call center staffing with uncertain arrival,service and abandonment rates: A Bayesian perspective

In this article, we introduce staffing strategies for the Erlang‐A queuing system in call center operations with uncertain arrival, service, and abandonment rates. In doing so, we model the system rates using gamma distributions that create randomness in operating characteristics used in the optimization formulation. We divide the day into discrete time intervals where a simulation based stochastic programming method is used to determine staffing levels. More specifically, we develop a model to select the optimal number of agents required for a given time interval by minimizing an expected cost function, which consists of agent and abandonment (opportunity) costs, while considering the service quality requirements such as the delay probability. The objective function as well as the constraints in our formulation are random variables. The novelty of our approach is to introduce a solution method for the staffing of an operation where all three system rates (arrival, service, and abandonment) are random variables. We illustrate the use of the proposed model using both real and simulated call center data. In addition, we provide solution comparisons across different formulations, consider a dynamic extension, and discuss sensitivity implications of changing constraint upper bounds as well as prior hyper‐parameters. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 460–478, 2016     

基于排队论的空降兵部队安全着陆问题研究

针对空降兵部队安全着陆问题，首先建立空降排队模型，明确空降作战受到火力打击时为混合制排队论问题，对具体空降参数进行了分析与计算，得到了比较科学的结果，与实际基本相符，然后根据结果分析了各种参数对空降作战的影响，提出了空降作战提高安全着陆人数的对策，对空降作战人数的安排及火力的支援提供了较强的参考价值，为开展空降作战相关问题研究提供可借鉴的思路方法。