基于优先权的分布式网络设备智能轮询策略研究

针对大型网络其地域分布广,监测对象较多,监测周期过长,实时性较差且管理流量负载较大等问题,提出一种分布式网络设备智能轮询策略。在域内,针对轮询周期调整问题,通过构造体现管理者意志的评判矩阵和求解反映数据特征的DFT(离散傅立叶变换)确定轮询优先级和轮询周期取值范围,提出了基于变化率的轮询周期调整算法;在域间,通过触发和查询实现对特殊事件的采集。最后进行了仿真,表明该策略能够在减轻网络负载的同时,准确刻画网络的状态。     

Military Off the Shelf Procurements: A Norwegian Case Study

Buying off the shelf procurements (OTS) has become an important part of the national acquisition strategy in several countries, and this paper seeks to bring empirical evidence on OTS as the preferred acquisition strategy by use of data from 2015 to 2022 investment portfolio of the Norwegian Armed Forces. We develop definitions for three categories of procurement – OTS, modified OTS and development projects – as well as a method to classify projects into these categories. Our first finding is that the characteristics of OTS projects correspond to modified OTS and development projects. Our second finding indicates that OTS projects perform better when it comes to the completion of projects according to the initial schedule, compared to development projects.     

Optimal control policies for an inventory system with commitment lead time

We consider a firm which faces a Poisson customer demand and uses a base‐stock policy to replenish its inventories from an outside supplier with a fixed lead time. The firm can use a preorder strategy which allows the customers to place their orders before their actual need. The time from a customer's order until the date a product is actually needed is called commitment lead time. The firm pays a commitment cost which is strictly increasing and convex in the length of the commitment lead time. For such a system, we prove the optimality of bang‐bang and all‐or‐nothing policies for the commitment lead time and the base‐stock policy, respectively. We study the case where the commitment cost is linear in the length of the commitment lead time in detail. We show that there exists a unit commitment cost threshold which dictates the optimality of either a buy‐to‐order (BTO) or a buy‐to‐stock strategy. The unit commitment cost threshold is increasing in the unit holding and backordering costs and decreasing in the mean lead time demand. We determine the conditions on the unit commitment cost for profitability of the BTO strategy and study the case with a compound Poisson customer demand.     

Slow failure: Understanding America’s quagmire in Afghanistan

ABSTRACT

The United States government has no organised way of thinking about war termination other than seeking decisive military victory. This implicit assumption is inducing three major errors. First, the United States tends to select military-centric strategies that have low probabilities of success. Second, the United States is slow to modify losing or ineffective strategies due to cognitive obstacles, internal frictions, and patron-client challenges with the host nation government. Finally, as the U.S. government tires of the war and elects to withdraw, bargaining asymmetries prevent successful transitions (building the host nation to win on its own) or negotiations.     

社会资本对维系西部受援高校发展的策略空间探析

“对口支援”西部高校工作开展以来,西部高校在支援高校的大力支持和援助下,学科建设、师资培养和管理水平均取得了显著的进步。这归因于支援高校为西部高校构建了广阔的社会网络,获得了所需的社会资本,得到了所需的学术资源。本文力求不仅要重视“对口支援”西部高校的直接社会援助,而且要高度重视“对口支援”西部高校所建立的社会网络和所获得社会资本。在“对口支援“西部高校政策框架下,充分发挥社会资本对西部高校发展的增值效应,进一步提升维系西部高校发展的策略空间。     

基于DXC的军事传送网恢复策略研究

可靠性对于军事传送网而言显得尤为重要。数字交叉连接(DXC)设备提供了一个灵活的冗余和保护以满足用户的需求,有利于最小化服务中断时间。文中首先介绍了DXC设备及其应用;其次,讨论了基于DXC设备的恢复应该考虑的问题;最后,结合军事传送网的特点,提出了恢复策略,并对此进行了讨论。     

离散变结构系统的组合控制策略研究

对离散变结构控制系统的趋近律方法进行研究,提出了4种组合控制策略,它们可以明显改善系统的动态性能,并给出应用例子加以验证．     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001     

导弹集成测试策略研究

以美国军方在武器系统研发、生产和维护过程中推行的设计—制造—维护纵向集成测试策略为参考,针对我国导弹武器系统的测试和诊断技术的应用和发展现状,论述了适合我国导弹测试系统开发的集成测试策略。     

A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.