Competitive Statehood in Libya: Governing Differently a Specific Setting or Deconstructing its Weak Sovereign State with a Fateful Drift Toward Chaos?

Abstract

Libya in 2011 witnessed a real process of political change, though different from all the policy-oriented jargon equating transition with a teleological transition to democracy. Due to the resilience of the Qadhafi regime in power and with the essential role of NATO intervention, the process was eased out by a eight-month civil war. Governance in post-Qadhafi Libya was not done through the rebuilding of centralized authorities. But it took the specific form of the emergence of multiple non-state actors embedded in local dynamics and then connected with weakened central authorities that had access to the huge Libyan resources. That raised complex questions about the quality of this mode of governance, especially at a time of pressing problems for Libya and its neighbors, whether direct ones (Tunisia, Egypt, Mali) or farther countries across the Mediterranean sea: terrorism with the expansion of Da’esh into the country and flows of refugees crossing Libya’s uncontrolled borders and flowing into Italy and then Europe by thousands.     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

Steady-state analysis of load balancing with Coxian-2 distributed service times

This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b ? 1, and can have at most one job in service and b ? 1 jobs in the buffer. The service time of a job follows the Coxian-2 distribution. We focus on steady-state performance of load balancing policies in the heavy traffic regime such that the normalized load of system is λ = 1 ? N^?α for 0 < α < 0.5. We identify a set of policies that achieve asymptotic zero waiting. The set of policies include several classical policies such as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) and power-of-d-choices (Po d) with d = O(N^α log N). The proof of the main result is based on Stein's method and state space collapse. A key technical contribution of this paper is the iterative state space collapse approach that leads to a simple generator approximation when applying Stein's method.     

高校辅导员的职业形象与工作状态——基于知乎平台文本数据的质性研究

随着我国高等教育学生培养模式的演变与大学生心理健康教育重要性的突显,高校辅导员除思想政治教育和价值引领的主要职责外,更多承担起了大量的学生日常事务管理,其工作越来越呈现出了琐碎性、重复性、职业上升通道狭窄、导生关系紧张的明显特点。本研究基于知乎平台的文本数据,采用扎根理论的分析思路,对高校辅导员的职业形象及其工作状态进行刻画。研究发现：（1）在辅导员制度良性运行的情况下,辅导员与学生之间呈现出主体关系的平等性与沟通交流的友好性,但是一旦辅导员制度的运行走向异化,师生关系趋向紧张;（2）辅导员处于高校学生管理的第一线,尽管诸多问题的根源并非辅导员本身的工作失职,学生也容易将对制度规则、管理模式的不满泛化地转移至辅导员的身上,双方缺乏理解;（3）辅导员职责早已超越了行政事务性工作的范畴,作为院校与学生的中介点,辅导员身处于多元诉求与多重利益的交合处。平衡与协调多元主体之间的不同诉求成为辅导员工作的重点与难点。对此,要更加关注高校辅导员群体,从建立科学的多方参与工作评价机制与打造专业化、职业化的发展体系两方面对现有辅导员制度加以完善,将院校行政系统评价与学生群体评价相结合,同时加强辅导员的专...     

加强海军航空军械器材信息化建设的对策研究

面对现代空战时域、空域广阔,发生时机不确定性强,航空军械装备战损消耗大的局面,为达到海军航空军械器材保障"快速反应"和"精确保障"目的,必须进一步加强海军航空军械器材信息化建设的研究。首先从总体上规划了海军航空军械器材信息管理系统功能;然后研究了信息化管理的主要技术;最后,提出推行海军航空军械器材"全资可视化"管理,为海军航空军械器材信息化保障提供了一种建设思路和技术指导。     

目标毁伤效果评估技术研究进展

目标毁伤效果评估作为目标保障的一项重要内容,对精确打击作战情报保障起到了核心作用,是现代精确打击体系的一个重要环节和关键步骤。文章从评估方法、评估模型和评估系统三个方面入手,梳理了国内外目标毁伤效果评估技术的最新研究进展,并对目前各类评估方法、模型及系统的优缺点分别进行了评述。最后,指出了该领域今后的研究方向。     

海军装备体系技术构成探析

在剖析海军装备体系与体系技术概念的基础上,分析了海军装备体系技术的特点与作用,提出了海军装备体系技术的基本构成,为海军装备体系技术的应用研究提供理论指导。     

基于马氏过程的电子对抗装备伺服驱动器可用度分析

针对电子对抗装备天线伺服系统驱动器可用度评估问题,考虑其具有优先使用权冷贮备冗余设计的特点,运用马尔可夫过程分析的方法,研究修理工人数不同情况下伺服驱动器稳态可用度和瞬时可用度,建立相应的数学模型,最后进行实例验证,绘出不同维修策略下系统瞬时可用度随时间变化的曲线.     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014