Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Partial equilibrium in risk‐based production decisions

Characteristically, a small subset of operational problems admit risk neutrality when contingent claims methodology were used in their analysis. That is, for the majority of manufacturing and production problems, operating cash flows are not directly linked to prices of traded assets. However, to the extent that correlations can be estimated, the methodology's applicability to a broader set of operational problems is supported. Our article addresses this issue with the objective of extending the use of contingent claims techniques to a larger set of operational problems. In broad terms, this objective entails a partial equilibrium approach to the problem of valuing uncertain cash flows. To this end, we assume risk aversion and cast our approach within Merton's intertemporal capital asset pricing model. In this context, we formulate a “generic” production valuation model that is framed as an exercise in stochastic optimal control. The model is versatile in its characterization and can easily be adapted to accommodate a wide‐ranging set of risk‐based operational problems where the underlying sources of uncertainty are not traded. To obtain results, the model is recast as a stochastic dynamic program to be solved numerically. The article addresses a number of fundamental issues in the analysis risk based decision problems in operations. First, in the approach provided, decisions are analyzed under a properly defined risk structure. Second, the process of analysis leads to suitably adjusted probability distributions through which, appropriately discounted expectations are derived. Third, through consolidating existing concepts into a standard and adaptable framework, we extend the applicability of contingent claims methodology to a broader set of operational problems. The approach is advantageous as it obviates the need for exogenously specifying utility functions or discount rates.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于风险控制的装备供应链网络设计模型

针对风险管理中的装备供应链正向（供应）网络设计问题，在对装备供应链风险和成本进行量化分析的基础上，综合考虑风险和成本2方面因素，建立了基于风险控制的装备供应链网络设计优化模型。并设计了遗传算法对模型进行求解，给出在指定风险水平下最优设计方案与总成本。最后通过实例分析和计算，结果表明，该优化模型合理、有效、可行。     

基于模糊-组合神经网络的信息系统安全风险评估

针对信息系统的安全风险评估问题,提出了一种将模糊理论与神经网络进行"浅层次"结合的评估方法。通过对信息系统所涉及的风险因素分别从资产影响、威胁频度、脆弱性严重程度三方面进行分析,建立了信息系统的安全风险层次化结构,并构造了各因素所对应评判集的隶属度矩阵;综合运用模糊推理算法与神经网络仿真技术,对信息系统的安全风险进行评估,进而判定信息系统安全风险等级。最后,通过实例分析说明了算法的应用,并借助误差分析检测了模型的有效性。     

基于攻击树的网络安全事件发生概率评估

为了提高网络安全风险概率预测的准确性,采用攻击树模型作为网络安全事件的描述模型,改进了攻击结点的定义,提出了网络安全事件发生概率的推算方法和攻击路径的分析方法,利用贝叶斯网络方法量化攻击树模型中原子事件结点的发生概率。实例表明该方法科学、客观、有效,为制订安全防护策略提供有力支持。     

State Capacity,Inequality and Inter-Group Violence in Sub-Saharan Africa: 1989–2011

Most studies on internal armed conflict focus on the dyadic interaction between the state and a rebel group, leaving less attention to inter-group fighting. Addressing this gap in the literature, this study argues that the interplay between economic and political inequality and weak state capacity increases the risk of non-state conflict. An empirical analysis of 178 non-state conflicts in Sub-Saharan Africa between 1989 and 2011 provides support for the theorized conditional effect, but only for the role of economic inequality. The effect of political exclusion in the context of a weak state is not confirmed, suggesting that such conditions may be more prone to violence of another kind (i.e., mobilization against the state). Overall, these findings highlight the importance of a functioning state for maintaining peaceful inter-group relations, while they also lend support to earlier research that reports divergent effects of economic and political inequalities on civil conflict risk.     

基于小波神经网络的货运量预测

选取我国1979—2011年国民生产总值、能源生产总值、进出口贸易额、社会消费品零售总额和固定资产投资总额5项指标作为货运总量的主要影响因素,以货运总量为输出,建立了基于Morlet小波函数的小波神经网络预测模型。该模型能够揭示货运量与相关变量之间的非线性映射关系,经实例分析得到了较满意的结果,并通过与实际货运量和BP神经网络预测结果的对比,证明了小波神经网络在货运量预测方面应用的可行性。     

Optimization of steerable sensor network for threat detection

A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst‐case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于遗传BP神经网络的装备研制风险分析方法

简要介绍了GA和BP算法,利用遗传算法全局性搜索的特点,改变BP算法依赖梯度信息的指导来调整网络权值的方法,寻找最为合适的网络连接权和网络结构,提出了遗传算法优化BP神经网络的思路及其数学模型.最后,结合对某型航空装备的风险源的分析,利用此优化模型进行了验证.结果表明了该方法的可行性,为装备研制风险分析提供了一种新思路.     

复杂系统脆弱性综合分析方法

为全面识别复杂系统中的脆弱点,科学评价其脆弱性,针对纯拓扑脆弱性分析方法的不足,在考虑非拓扑因素条件下,提出一种结合复杂网络技术和效能评估技术的复杂系统脆弱性综合分析方法,从拓扑结构和非拓扑因素两方面全面分析复杂系统的脆弱性。以复杂网络的中心性指标为基础,通过广义指标法进行拓扑脆弱性分析;借鉴概率风险评价理论,从易攻性和易坏性两个方面对非拓扑脆弱性进行评价;通过对两者结果的综合得到总的脆弱性分析结果。示例结果表明:拓扑和非拓扑分析的结果有交集但又有所区别,两者密切相关且互为补充,并能共同筛选出复杂系统中的关键环节。较之纯粹的拓扑结构分析,综合分析得到的结果更为全面。     

Dangerous work: Terrorism against U.S. diplomats

The goal of diplomats is to represent their countries’ interests through diplomacy, not arms. Because they are not military personnel, they may be perceived as at lower risk of being the target of terrorists. However, recent events have called this perception into question. Despite this danger, there has been little research on terrorist attacks against diplomats. Drawing on the terrorism studies literature, this article argues that diplomats are targeted more than non-diplomatic targets in countries where certain U.S. foreign policies are implemented. An empirical analysis of 471 attacks against U.S. diplomats from 1970 to 2011 reveals that while U.S. alliances and foreign aid increase the likelihood of attacks against diplomats, U.S. military intervention and civil war, on the other hand, increase the risk of terrorism against non-diplomatic targets. This finding is relevant because it shows terrorist attacks against diplomats result from certain types of foreign policy.     

航空集群机载网络Failure-Oblivious路由策略

航空集群机载网络作为集群成员间信息交互的纽带,其路由策略性能优劣直接影响信息传输实时性与可靠性,从而制约网络化集群作战效能发挥.考虑到航空集群机载网络具有诸多不确定性,为应对路由失效以及尽可能避免路由更新,从路由选择算法的角度,在软件定义网络架构下提出Failure-Oblivious路由策略.与传统路由策略不同的是,...     

Sensor radiation interception risk control in target tracking

This paper is mainly on the problem of radiation interception risk control in sensor network for target tracking. Firstly, the sensor radiation interception risk is defined as the product of the interception probability and the cost caused by the interception. Secondly, the radiation interception probability model and cost model are established, based on which the calculation method of interception risk can be obtained. Thirdly, a sensor scheduling model of radiation risk control is established, taking the minimum interception risk as the objective function. Then the Hungarian algorithm is proposed to obtain sensor scheduling scheme. Finally, simulation experiments are mad to prove the effectiveness of the methods proposed in this paper, which shows that compared with the sensor radiation interception probability control method, the interception risk control method can keep the sensor scheduling scheme in low risk as well as protect sensors of importance in the sensor network.     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Heuristics for the location of inspection stations on a network

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000     

边境安全风险评估矩阵模型构建研究

提出边境安全风险和边境安全风险评估的概念。围绕边境安全风险状态和边境安全风险类型两个维度构建边境安全风险评估的矩阵模型。其中,边境安全风险状态维度包括边境安全风险源活跃度、边境安全风险源聚集度、边境安全风险供应链成熟度、边境安全风险源异常度;边境安全风险类型包括外生型边境安全风险、内生型边境安全风险、网络型边境安全风险、跨境型边境安全风险。并论述了边境安全风险评估矩阵模型的应用。     

基于小波神经网络的承制单位信用风险评价

根据武器装备采购中对承制单位信用风险评价特点和实际情况,确定承制单位信用风险评价指标体系,根据小波神经网络原理,构建了承制单位信用风险评价模型,并以实例进行分析。小波神经网络能够简便快捷对信用风险进行评价,并能排除主观因素的干扰,在信用风险评价中具有较好应用前景。     

近十年国内女性休闲研究现况分析

本研究采用内容分析法对从2002年起至2011年中国期刊网、博士论文、硕士论文网有关女性休闲主题131篇研究论文进行数量、主题、研究对象、研究方法等运用情形分析。期望有助于休闲相关学者对本领域的现况、特性及发展趋势有完整了解。研究结果显示:十年间论文数量整体呈现快速增长趋势,但高质量核心期刊论文比例少,其中50%核心论文以休闲体育为题发表在体育类核心期刊;论文内容也侧重休闲体育,缺少涵盖休闲体育在内的休闲行为整体研究;研究主题以休闲态度与行为实证研究为主,多采用定量的问卷调查,缺少定性的访谈、观察等研究相结合的综合性研究。建议借鉴其他学科资讯,增加研究主题多样性,从多方法、多角度提升研究水平,还应补充文献资料整合研究及外文资料成果。     

校园网安全研究

网络技术不断发展,传输和处理的信息越来越多,试图获取或破坏网络信息的人也越来越多,给网络信息增加了许多安全隐患,校园网更是成了攻击网络和保卫网络的红蓝对抗演练战场,人为的网络入侵和攻击行为使得网络安全面临新的挑战,如何保证校园网安全,成为高校的一项很重要的任务。     

Network structure of insurgent groups and the success of DDR processes in Colombia

We argue that organizational structure of insurgent organizations influences the prospects for success in a disarmament, demobilization, and reintegration process (DDR). In essence, we argue that more cohesive, tighter networks have higher levels of supervision and control on its military units and increase the probability of successful DDR processes. In order to evaluate our hypotheses, we use the theory of networks to map and characterize the network structure of the United Self-Defense Forces of Colombia (AUC) and the Revolutionary Armed Forces of Colombia (FARC). Our results suggest that armed military units grouped in smaller and more isolated components on the network remilitarize with higher probability with respect to other units on the network. Also, we find that military units with high degree of centrality on the network play an important role for the risk of conflict recurrence and success in a DDR process.