全文获取类型
收费全文 | 69篇 |
免费 | 0篇 |
出版年
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条查询结果,搜索用时 625 毫秒
61.
Thomas R. Mockaitis Max G. Manwaring Daniel W. Fitz‐Simons Richard Holmes 《Small Wars & Insurgencies》2013,24(2):254-260
Norman Cigar, Genocide in Bosnia: The Policy of “Ethnic Cleansing”. College Station, Texas: Texas A&M University Press, 1995. Pp.xiv + 247; app., map, notes, cartoon. Maria Jose Moyano, Argentina's Lost Patrol: Armed Struggle, 1969–1979. New Haven: Connecticut Yale University Press, 1995. Pp.xiii + 226, biblio., abbreviations, 10 figures, 1 map, tables, index; $25/£16.95. ISBN 0–300–01622–6. Donald E. Schulz and Deborah Sundloff Schulz, The United States, Honduras, and the Crisis in Central America, Westview Thematic Studies in Latin America, Boulder, Co: Westview, 1994. Pp.368, map, figure, select biblio., abbreviations, index. $52.50/£37.50; (cloth) $17.95/£11.95 (paper). ISBN 0–8133–1324–4 and 1323–6. Joseph H. Alexander and Merrill L. Bartlett, Sea Soldiers in the Cold War: Amphibious Warfare 1945–1991. Annapolis, Maryland: Naval Institute Press, 1995. Pp.iii + 178, 1 map, 29 illus, biblio, index. $32.95. ISBN Gary P. Cox, The Halt in the Mud: French Strategic Planning from Waterloo to Sedan. Westview Press, 1994. Pp.258, maps, notes, biblio, index. £33.50. ISBN 0–133–1536–0. 相似文献
62.
63.
Daniel Bultmann 《Small Wars & Insurgencies》2014,25(2):457-478
This article investigates power practices in the Cambodian insurgency after 1979 as being part of a social field. There are various types of power practice being exercised by commanders aiming at making soldiers disciplined inside the insurgency. The hypothesis explaining these variations being proposed here is that the type of power being exercised depends on the habitus of the respective commander. Power practices are shaped by the incorporated classificatory discourse of commanders on good soldierhood and leadership. Thereby, armed groups can be analyzed as a social field in which practices are always relational and part of symbolic struggles between different commanders. 相似文献
64.
Daniel P. Heyman 《海军后勤学研究》1977,24(3):385-405
We consider a single-item inventory system in which the stock level can increase due to items being returned as well as decrease when demands occur. Returned items can be repaired and then used to satisfy future demand, or they can be disposed of. We identify those inventory levels where disposal is the best policy. It is shown that this problem is equivalent to a problem of controlling a single-server queue. When the return and demand processes are both Poisson, we find the optimal policy exactly. When the demand and return processes are more general, we use diffusion approximations to obtain an approximate model, which is then solved. The approximate model requires only mean and variance data. Besides the optimal policy, the output of the models includes such characteristics as the operating costs, the purchase rate for new items, the disposal rate for returned items and the average inventory level. Several numerical examples are given. An interesting by-product of our investigation is an approximation for the steady-state behavior of the bulk GI/G/1 queue with a queue limit. 相似文献
65.
In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
66.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998 相似文献
67.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph (MCG) problem is to find a connected subgraph with R vertices that maximizes the sum of the weights. The MCG problem is strongly NP-complete, and we study a special case of it: the constrained MCG (CMCG) problem, which is the MCG problem with a constraint of having a predetermined vertex included in the solution. We first show that the Steiner tree problem is a special case of the CMCG problem. Then we present three optimization algorithms for the CMCG problem. The first two algorithms deal with special graphs (tree and layered graphs) and employ different dynamic programming techniques, solving the CMCG problem in polynomial times. The third one deals with a general graph and uses a variant of the Balas additive method with an imbedded connectivity test and a pruning method. We also present a heuristic algorithm for the CMCG problem with a general graph and its bound analysis. We combine the two algorithms, heuristic and optimization, and present a practical solution method to the CMCG problem. Computational results are reported and future research issues are discussed. © 1996 John Wiley & Sons, Inc. 相似文献
68.
69.
Daniel Alejandro Restrepo 《Journal of Military Ethics》2020,19(1):40-55
ABSTRACT Though it is legally permissible to kill combatants in war, unless they are rendered hors de combat, the existence of “Naked Soldiers” raises an important moral question: should combatants kill vulnerable enemy combatants or show mercy towards them? Most philosophers who address this question argue that it is morally permissible to kill the Naked Soldier given the extended notion of self-defense during war. They ground their arguments in a form of collectivism. In this article, I use Larry May’s argument. He offers an approach that extends the principle of discrimination that would apply also to combatants. Instead of assuming all combatants are de facto dangerous, this approach would allow for nuance in targeting the enemy and showing mercy when enemy combatants clearly pose no danger, in other words, when they are Naked Soldiers. I defend this view against two criticisms: Noam Zohar’s view of armies as complex collectives and Stephen Deakin’s view that a policy that spares Naked Soldiers would be open to abuse. I argue that it is not only morally suspect to kill Naked Soldiers, but also it is within the spirit of both international laws governing war and the just war tradition to offer mercy whenever possible. 相似文献