首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   816篇
  免费   19篇
  2021年   18篇
  2019年   28篇
  2018年   12篇
  2017年   18篇
  2016年   17篇
  2015年   21篇
  2014年   16篇
  2013年   157篇
  2008年   9篇
  2007年   9篇
  2006年   9篇
  2005年   11篇
  2004年   9篇
  2003年   8篇
  2002年   11篇
  2001年   10篇
  2000年   9篇
  1999年   8篇
  1998年   16篇
  1997年   21篇
  1996年   12篇
  1995年   9篇
  1994年   16篇
  1993年   9篇
  1992年   11篇
  1991年   20篇
  1989年   14篇
  1988年   20篇
  1987年   19篇
  1986年   23篇
  1985年   15篇
  1984年   11篇
  1983年   12篇
  1982年   12篇
  1981年   11篇
  1980年   12篇
  1979年   21篇
  1978年   14篇
  1977年   15篇
  1976年   8篇
  1975年   15篇
  1974年   13篇
  1973年   15篇
  1972年   13篇
  1971年   9篇
  1970年   10篇
  1969年   11篇
  1968年   7篇
  1967年   7篇
  1966年   6篇
排序方式: 共有835条查询结果,搜索用时 15 毫秒
811.
This article discusses the impact of Complex Humanitarian Emergencies on the delivery of humanitarian aids. Complex emergencies were the results of long-term political and social disputes. Its impact brings about public health crises like epidemics, malnutrition, and even widespread desperation. In fact, there are four aspects of these crises which complicate public health programs: 1) emergencies are long and recurring; 2) access to the most vulnerable population is often restricted; 3) restructuring health systems in complex emergencies can be futile; and 4) complex emergencies often result in mass forced migration. What makes matters worse is the breakdown of health networks which collapse early in complex emergencies, leading to extensive losses of human health resources. Not only that, health facilities and transportation, infrastructure are often decimated in complex emergencies, and regional hospitals, district health posts, laboratories, and primary care outposts are similarly abandoned or destroyed. Moreover, because it is difficult to predict the course of these emergencies, ascertaining the optimal time to intervene and to invest in materials and facilities that could be lost to renewed fighting can be impossible. To solve this problem requires a coordinated effort. It should also focus on resources, early warning systems, preparedness measures, ongoing career training of relief workers, and prepositioning of relief supplies.  相似文献   
812.
Book Reviews     
Strategic Views from the Second Tien The Nuclear Weapons Policies of France, Britain and China. Edited by J.C. Hopkins and W Hu, New Brunswick and London, Transaction Publishers, (1995) ISBN 1-56000-7907. $ 21.95

Multinational Military Forces: Problems and Prospects. By Roger H. Palin. Adelphi Paper 294, 11SS/Oxford University Press (1995) ISBN 0-19-828025-4 ISSN 0567 932X

South Africa in the Global Economy. Edited by Greg Mills, et al. South African Institute of International Affairs, Johannesburg, (1995) ISBN 1-874890-58-7. R. 45.60

The Limits of Air Powen The American Bombing of North Vietnam. By Mark Clodfelter, The Free Press. New York (1989). ISBN 0-02-905990-9. $22.95.

Guy Gibson. By Richard Morris with Colin Dobinson. Viking. London (1994). ISBN 0-670-82878-5. £18.00.

Dambuster: A Life of Guy Gibson VC. By Susan Ottway. Leo Cooper, London (1994). ISBN 0-85052-427. £16-95.  相似文献   
813.
Military operations and maritime preponderance by Charles E. Callwell, Edinburgh: William Blackwood & Sons, 1905.  相似文献   
814.
This article considers the problem of allocating a fixed budget among alternative air-to-ground weapons. The weapon-budgeting problem is high-dimensional, involving all feasible combinations of aircraft, weapons, and targets. The decision maker's utility function is defined over kills of the various target types, but it is unrealistic to expect him to write down the mathematical formula for this function. The article suggests two procedures for reducing the dimension of the maximization problem and operating without exact knowledge of the utility function. The first procedure uses successive linear approximations to generate the set of “efficient” or undominated weapon allocations. The second procedure applies separability restrictions to the utility function, thereby reducing the overall maximization problem to a sequence of low-dimensional subproblems.  相似文献   
815.
Book reviews     
America's Secret Power: the CIA in a Democratic Society. By Loch K. Johnson. Oxford University Press, New York (1989), ISBN 0–19–505490–3, $24.95

The Bundeswehr and Western Security. Edited by Stephen F. Szabo. Houndmills, Basingstoke, and Macmillan, London (1990), ISBN 0–333–49880–1, £45.00

Symbolic Defense: the Cultural Significance of the Strategic Defense Initiative. By Edward Tabor Linenthal. University of Illinois Press, Chicago, IL (1989), ISBN 0–252–01619‐X, $19.95

Rethinking European Security. Edited by Furio Cerutti and Rodolfo Ragionieri. Crane Russak, New York (1990), £29.00

Alternative Conventional Defense Postures in the European Theater, Vol. 1: The Military Balance and Domestic Constraints. Edited by Hans Günter Brauch and Robert Kennedy, Crane Russak, New York (1990), £32.00

The Gulf War. Edited by Hanns Maull and Otto Pick. Pinter, London (1989), ISBN 0–86187–763–2, £36.00  相似文献   

816.
817.
We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models.  相似文献   
818.
In this paper, we consider the analysis of two M/G/1 queueing systems sharing the same finite waiting room. An exact analysis is given for several special cases, and then an algorithm is developed which approximates the system behavior for the general problem. Comparisons are made between the special cases and the algorithm.  相似文献   
819.
A new approach is presented for analyzing multiple-attribute decision problems in which the set of actions is finite and the utility function is additive. The problem can be resolved if the decision makers (or group of decision makers) specifies a set of nonnegative weights for the various attributes or criteria, but we here assume that the decision maker(s) cannot provide a numerical value for each such weight. Ordinal information about these weights is therefore obtained from the decision maker(s), and this information is translated into a set of linear constraints which restrict the values of the weights. These constraints are then used to construct a polytope W of feasible weight vectors, and the subsets Hi (polytopes) of W over which each action ai has the greatest utility are determined. With the Comparative Hypervolume Criterion we calculate for each action the ratio of the hypervolume of Hi to the hypervolume of W and suggest the choice of an action with the largest such ratio. Justification of this choice criterion is given, and a computational method for accurately approximating the hypervolume ratios is described. A simple example is provided to evaluate the efficiency of a computer code developed to implement the method.  相似文献   
820.
We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号