全文获取类型
收费全文 | 296篇 |
免费 | 4篇 |
出版年
2021年 | 5篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 3篇 |
2013年 | 77篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 5篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 6篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 1篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1974年 | 5篇 |
1973年 | 8篇 |
1972年 | 6篇 |
1971年 | 8篇 |
1970年 | 5篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1967年 | 2篇 |
1966年 | 2篇 |
1948年 | 3篇 |
排序方式: 共有300条查询结果,搜索用时 31 毫秒
101.
102.
103.
Brendan Simms Bruce Hoffman Daniel W. Fitz‐Simons Robert H. Dorff Jennifer Morrison Taw Gabriel Marcella 《Small Wars & Insurgencies》2013,24(1):127-139
Frank Zimmer, Bismarcks Kampf gegen Kaiser Franz Joseph Konigsgratz und seine Folgen. Graz, Vienna, Cologne: Styria Verlag 1996. Pp.203,49 illus., 1 map. OS 350/DM 49. ISBN 3–222–12377–2. Saul Zadka, Blood in Zion: How the Jewish Guerrillas drove the British out of Palestine. London and Washington: Brassey's, 1995. Pp.227, chron., illus., index. £19.95. ISBN 1–85753–136–1. Theodore L. Gatchel, At the Water's Edge: Defending against the Modern Amphibious Assault. Annapolis, MD: Naval Institute Press, 1996. Pp.xvi+217, notes, biblio, index. $36.95. ISBN 1–55750–308–7. Max G. Manwaring and William J. Olson (eds.) Managing Contemporary Conflict: Pillars of Success. Boulder, CO: Westview Press, 1996. Pp.269, no index. $65 (cloth); $25 (paper). ISBN 0–8133–8969 and 9978–5 Chris Seiple, The US Military/NGO Relationship in Humanitarian Interventions, Carlisle Barracks, PA: The Richard L. Millett and Michael Gold‐Biss (eds.) Beyond Praetorianism: The Latin American Military in Transition. University of Miami: North/South Center Press; Boulder, CO: Lynne Rienner, 1996. Pp.xv +317, index. $24.95. ISBN 1–5745–000–9. Rudolph C. Barnes Jr, Military Legitimacy: Might and Right in the New Millennium. London and Portland, OR: Frank Cass, 1996. Pp.199, select biblio., index. £27.50/$39.50, ISBN 0–714–4624–5. 相似文献
104.
105.
106.
Thijs W. Brocades Zaalberg 《Small Wars & Insurgencies》2013,24(4):399-420
History teaches that counterinsurgency and counterterrorism campaigns have never been won through purely military action. Defeating an opponent who avoids open battle, but who uses force to reach his goals, including terrorist action, requires a combination of police, administrative, economic and military measures. As a counterinsurgency campaign should pursue a comprehensive political objective, it requires high levels of civil–military cooperation. However, current NATO doctrine for Civil–Military Cooperation (CIMIC) as it emerged from the 1990s is founded in conventional war-fighting and outdated peacekeeping doctrine. CIMIC's focus is on supporting military objectives rather than enabling the military to make a coherent contribution to political objectives. This makes CIMIC unfit for the Alliance's main operational challenges that have expanded from peace operations on the Balkans to countering insurgent terrorism in Afghanistan. When developing CIMIC, the Alliance obviously neglected the historical lessons from counterinsurgency campaigns. 相似文献
107.
Chemical warfare agents (CWA) are stockpiled in large quantities across the globe. Agents stored in inaccessible facilities need to be destroyed rapidly without dispersing the compounds to surrounding areas. Metal-based energetic formulations are used in such prompt defeat applications to rapidly decompose the CWA by generating a high temperature environment. An alternate, and possibly a more effective decomposition pathway could be provided by chemicidal action of aerosolized condensed combustion products, which typically consist of metal oxides. Toxic fumes that escape the high tem-perature blast zone can be neutralized by smoke generated during combustion, depending on the par-ticle size, surface characteristics, chemical properties, and concentration of this smoke. This review considers relevant experimental and modeling studies quantifying decomposition of CWA comprising organophosphorus compounds and their surrogates on the surface of various metal oxides. Dimethyl methylphosphonate (DMMP), a sarine surrogate, was used most commonly for such experiments. Many reported efforts focused on the mechanisms of adsorption of DMMP to various metal oxides and initial reaction steps cleaving various bonds from the chemisorbed molecules. For selected oxides, these ex-periments were supported by quantum-mechanical calculations. In other studies, the capacity of oxide surfaces to adsorb and decompose DMMP was quantified. In most cases, porous catalysts were used although limited experimental data are available for aerosolized nonporous oxide particles. The reported experimental data applicable to scenarios involving prompt decomposition of CWA are summarized. It is noted that information is lacking describing respective heterogeneous reaction kinetics. Preliminary estimates of aerosolized smoke particle concentrations required to destroy CWA are made considering gas phase diffusion rates and reported values of the oxide capacity to decompose CWA or their surrogates. 相似文献
108.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
109.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
110.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献