全文获取类型
收费全文 | 637篇 |
免费 | 14篇 |
专业分类
651篇 |
出版年
2021年 | 8篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 10篇 |
2016年 | 14篇 |
2015年 | 8篇 |
2014年 | 6篇 |
2013年 | 110篇 |
2009年 | 10篇 |
2008年 | 5篇 |
2007年 | 14篇 |
2005年 | 10篇 |
2004年 | 10篇 |
2003年 | 11篇 |
2002年 | 8篇 |
2000年 | 6篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1996年 | 16篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 13篇 |
1992年 | 12篇 |
1991年 | 21篇 |
1990年 | 11篇 |
1989年 | 22篇 |
1988年 | 17篇 |
1987年 | 14篇 |
1986年 | 21篇 |
1985年 | 18篇 |
1984年 | 7篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 8篇 |
1975年 | 5篇 |
1974年 | 13篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 11篇 |
1970年 | 12篇 |
1969年 | 9篇 |
1968年 | 5篇 |
1967年 | 10篇 |
1948年 | 5篇 |
排序方式: 共有651条查询结果,搜索用时 7 毫秒
41.
The provision of Military Assistance to the Civil Powers (MACP) encapsulates the traditional approach towards countering terrorism on the British mainland, which emphasises minimum force, proportionality, police primacy and the rule of law, with the military retained as a supporting instrument, being employed only as a measure of last resort. Recent terrorist incidents in major urban centres do, however, question the effectiveness of these established methods. This analysis initially codifies the conceptual issues that underscore the tensions between civil policing and military anti-terrorist approaches in the UK, and proceeds to evaluate and compare a number of operations that indicate the nature of the challenges facing the MACP apparatus. In particular, potential shortcomings in the MACP provisions are identified in the form of threat perception and deployment and enforcement gaps. The assessment finds that there are facets of MACP that are of enduring relevance in the current era, yet a continuing need persists to reconcile police and military imperatives toward serious civil disorder contingencies and conditions of emergency. 相似文献
42.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
43.
44.
45.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
46.
47.
48.
Dileep R. Sule 《海军后勤学研究》1982,29(3):517-519
The paper extends the machine flow-shop scheduling problem by separating processing time into setup, processing and removal times. 相似文献
49.
50.