全文获取类型
收费全文 | 69篇 |
免费 | 0篇 |
专业分类
69篇 |
出版年
2020年 | 1篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 2篇 |
2016年 | 1篇 |
2014年 | 1篇 |
2013年 | 23篇 |
2012年 | 2篇 |
2011年 | 2篇 |
2010年 | 1篇 |
2009年 | 2篇 |
2008年 | 1篇 |
2007年 | 1篇 |
2005年 | 1篇 |
2004年 | 3篇 |
2002年 | 1篇 |
2001年 | 2篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 2篇 |
排序方式: 共有69条查询结果,搜索用时 0 毫秒
31.
32.
In this article, we examine a model of terrorism that focuses on the tradeoffs facing a terrorist organization that has two qualitatively different attack modes at its disposal. The terrorist organization's objective is to successfully attack at least one target. Success for the target government is defined as defending all targets from any and all attacks. In this context, we examine how terrorist entities strategically utilize an efficient but discrete attack technology — e.g., suicide attacks — when a more conventional mode of attack is available, and the optimal anti‐terrorism measures.© 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
33.
34.
Daniel Bultmann 《Civil Wars》2018,20(1):24-44
The article discusses the experiences of a group of military strongmen during the post-conflict transformation of two Cambodian insurgent movements into a society of peace after a decades-long civil war. It explains the reasons why some of these strongmen were able to transfer their high status within the insurgency into senior positions in the incumbent government, while others became impoverished and sometimes even preferred to relapse into further conflict. Even though all of these strongmen shared a very similar life course and fought until the end of the conflict, their post-conflict fates have been very different. Central to the explanation of their behaviour during the transition is their habitus, the set of resources at their disposal and the nature of their vertical and horizontal social networks. 相似文献
35.
Whereas much of the previous research in complex systems has focused on emergent properties resulting from self‐organization of the individual agents that make up the system, this article studies one vital role of central organization. In particular, four factors are conjectured to be key in determining the optimal amount of central control. To validate this hypothesis, these factors are represented as controllable parameters in a mathematical model. For different combinations of parameter values, the optimal amount of central control is found, either analytically or by computer simulation. The model is shown to provide results that match well with the level of control found across a broad spectrum of specific complex systems. This model also provides general guidelines as to how combinations of these factors affect the desirable level of control and specific guidelines for selecting and evaluating leaders. These results indicate that all of these factors, though not exhaustive, should be considered carefully when attempting to determine the amount of control that is best for a system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
36.
We address the capacitated lot‐sizing and scheduling problem with setup times, setup carry‐over, back‐orders, and parallel machines as it appears in a semiconductor assembly facility. The problem can be formulated as an extension of the capacitated lot‐sizing problem with linked lot‐sizes (CLSPL). We present a mixed integer (MIP) formulation of the problem and a new solution procedure. The solution procedure is based on a novel “aggregate model,” which uses integer instead of binary variables. The model is embedded in a period‐by‐period heuristic and is solved to optimality or near‐optimality in each iteration using standard procedures (CPLEX). A subsequent scheduling routine loads and sequences the products on the parallel machines. Six variants of the heuristic are presented and tested in an extensive computational study. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
37.
Daniel G. Shimshak 《海军后勤学研究》1979,26(3):499-509
The determination of steady-state characteristics in systems of tandem queues has been left to computer simulation because of the lack of exact solutions in all but the simplest newtorks. In this paper, several methods developed for approximating the average waiting time in single-server queues are extended to systems of queues in series. Three methods, due to Fraker, Page, and Marchal, are compared along with results gathered through GPSS simulation. Various queueing networks with Erlangian service distributions are investigated. 相似文献
38.
Daniel Byman 《战略研究杂志》2013,36(5):767-811
This essay contends that allies are vital for counterterrorism, but what we ask of them and their institutional form is quite different from what was asked of traditional alliance partners during the Cold War and its immediate aftermath. Despite these differences, some of the alliance dilemmas that plagued the United States in the past are likely to remain, though they will have different manifestations relevant to the war on terrorism. This essay concludes by arguing that, for purposes of the war on terrorism, the list of key allies has shifted and offers recommendations for improving US alliances. 相似文献
39.
A descent algorithm simultaneously capable of solving linear programming, piecewise linear convex minimization, and the linear complementarity problem is developed. Conditions are given under which a solution can be found in a finite number of iterations using the geometry of the problem. A computer algorithm is developed and test problems are solved by both this method and Lemke's algorithm. Current results indicate a decrease in the number of cells visited but an increase in the total number of pivots needed to solve the problem. 相似文献
40.