首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   253篇
  免费   3篇
  2021年   3篇
  2019年   3篇
  2018年   2篇
  2017年   7篇
  2016年   3篇
  2015年   4篇
  2014年   2篇
  2013年   62篇
  2011年   2篇
  2010年   2篇
  2008年   3篇
  2007年   3篇
  2006年   3篇
  2005年   4篇
  2004年   2篇
  2003年   3篇
  2002年   2篇
  2000年   2篇
  1999年   3篇
  1996年   4篇
  1995年   6篇
  1994年   5篇
  1993年   4篇
  1992年   3篇
  1991年   4篇
  1990年   2篇
  1989年   5篇
  1988年   7篇
  1987年   5篇
  1986年   7篇
  1985年   5篇
  1984年   2篇
  1983年   3篇
  1982年   8篇
  1980年   5篇
  1979年   3篇
  1978年   3篇
  1977年   4篇
  1976年   2篇
  1975年   5篇
  1974年   5篇
  1973年   6篇
  1972年   5篇
  1971年   8篇
  1970年   3篇
  1969年   5篇
  1968年   5篇
  1967年   2篇
  1966年   2篇
  1948年   3篇
排序方式: 共有256条查询结果,搜索用时 15 毫秒
181.
182.
Comments that Donald Trump made while campaigning to be U.S. president have raised concerns that his administration will pull back from U.S. alliance commitments and encourage countries such as Japan and South Korea to acquire nuclear arms. The new article by Frühling and O’Neil outlines an institutional framework that can be helpful in assessing the risks that Trump administration policies will lead to nuclear proliferation. An institutional perspective shows that important elements of U.S. security assurances will continue to function, and this reduces the chances that President Trump’s actions or statements will trigger proliferation by U.S. allies. The greatest risk to global non-proliferation efforts posed by a Trump administration in fact lies elsewhere, in the possibility that President Trump will seek to abrogate the Iran nuclear deal.  相似文献   
183.
184.
Some properties of the geometric process are studied along with those of a related process which we propose to call the α‐series process. It is shown that the expected number of counts at an arbitrary time does not exist for the decreasing geometric process. The decreasing version of the α‐series process does have a finite expected number of counts, under certain conditions. This process also has the same advantages of tractability as the geometric process; it exhibits some properties which may make it a useful complement to the increasing geometric process. In addition, it may be fit to observed data as easily as the geometric process. Applications in reliability and stochastic scheduling are considered in order to demonstrate the versatility of the alternative model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
185.
Liquid-filled compartment structure consists of a bulk steel plate with matrix blind holes which are filled with liquid and a steel front plate to seal up the liquid with rings and bolts.The liquid-filled compart-ment structure can resist the shaped charge warhead effectively.This paper presents experimental and theoretical investigations of the penetration ability of the residual shaped charge jet emerging from the liquid-filled compartment structure after the penetration process at different impact angles.On the basis of shock wave propagation theory,the influence of the liquid-filled compartment structure on jet sta-bility is analysed.The interferences of the liquid backflow caused by a reflected shock wave and a back plate on jet stability under different impact angles are also examined.In addition,the range of the disturbed velocity segments of the jet at different impact angles and the penetration ability of the re-sidual jet are obtained.A theoretical model is validated against the experimental penetration depths.  相似文献   
186.
This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model—shown to be NP-hard—is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP-hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch-and-bound algorithm is finally worked out, and some computational results are presented. © 1996 John Wiley & Sons, Inc.  相似文献   
187.
The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins-index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc.  相似文献   
188.
For the loss system with time-varying intensities and a finite number of identical servers we derive formulas for the expected number of refused customers in a given time interval and for the expected number of servers busy at a given time instant. © 1994 John Wiley & Sons, Inc.  相似文献   
189.
With repeated firing, fatigue cracks are produced in a gun barrel, and the barrel is no longer useful when a crack reaches a critical size. The initial crack size and the critical crack size, as well as the number of firings producing the critical crack size, may be considered as random variables. Assuming a proportional damage model for crack growth, a method for estimating the critical crack size distribution is presented. From these results, an estimate of the barrel life, or the residual barrel life once a crack of a given size is measured, can be obtained.  相似文献   
190.
A model which allows the prediction of long-term average report rates against an array of radio emitters by a scanning sensor is presented. The model is based on Markov renewal theory.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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