全文获取类型
收费全文 | 265篇 |
免费 | 9篇 |
出版年
2020年 | 4篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 4篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 9篇 |
2013年 | 89篇 |
2011年 | 8篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 7篇 |
2006年 | 4篇 |
2005年 | 5篇 |
2004年 | 2篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 3篇 |
1999年 | 5篇 |
1998年 | 1篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 1篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 4篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有274条查询结果,搜索用时 15 毫秒
31.
Those leading the war on terrorism have emphasized from the beginning that this war would be unlike other wars. Special Operations Forces (SOF) are military forces unlike other military forces. The implication is that SOF and the war on terrorism are thus made for each other. This contribution examines this assumption, the war on terrorism and SOF in greater detail. 相似文献
32.
By running life tests at higher stress levels than normal operating conditions, accelerated life testing (ALT) quickly yields information on the lifetime distribution of a test unit. The lifetime at the design stress is then estimated through extrapolation using a regression model. In constant‐stress testing, a unit is tested at a fixed stress level until failure or the termination time point of test, whereas step‐stress testing allows the experimenter to gradually increase the stress levels at some prefixed time points during the test. In this work, the optimal k‐level constant‐stress and step‐stress ALTs are compared for the exponential failure data under complete sampling and Type‐I censoring. The objective is to quantify the advantage of using the step‐stress testing relative to the constant‐stress one. Assuming a log‐linear life–stress relationship with the cumulative exposure model for the effect of changing stress in step‐stress testing, the optimal design points are determined under C/D/A‐optimality criteria. The efficiency of step‐stress testing to constant‐stress one is then discussed in terms of the ratio of optimal objective functions based on the information matrix. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013 相似文献
33.
David Martin Jones 《Small Wars & Insurgencies》2013,24(3):436-464
In recent years a number of commentators have posited that the British reputation for conducting small wars has suffered in the wake of setbacks in Iraq and Afghanistan. The argument here contests whether such a tradition can be truly said to have ever existed. A close examination of this supposed tradition reveals it to be a myth. In fact, rarely have the British armed forces claimed a facility for counter-insurgency or small war. Invariably, commentators outside the Army have ascribed the tradition to them. Most notably, commentators in the United States keen to discern practices of minimum force or rapid institutional learning generated the narrative of British COIN expertise. Ultimately, what this myth reveals is that, when deconstructed, it is political will, not an ingrained understanding of fighting insurgencies, that has determined Britain's success, or otherwise, in so-called small wars. 相似文献
34.
35.
36.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献
37.
In statistical analysis of stationary time series or in steady-state simulation output analysis, it is desired to find consistent estimates of the process variance parameter. Here, we consider variants of the area estimator of standardized time series, namely, the weighted area and the Cramér-von Mises area estimators, and provide their consistency, in the strong sense and mean-square sense. A sharp bound for the (asymptotic) variance of these estimators is obtained. We also present a central limit theorem for the weighted area estimator: this gives a rate of convergence of this estimator, as well as a confidence interval for the variance parameter. © 1995 John Wiley & Sons, Inc. 相似文献
38.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc. 相似文献
39.
David Simchi-Levi 《海军后勤学研究》1994,41(4):579-585
In this note we consider the familiar bin-packing problem and provide new worst-case results for a number of classical heuristics. We show that the first-fit and best-fit heuristics have an absolute performance ratio of no more than 1.75, and first-fit decreasing and best-fit decreasing heuristics have an absolute performance ratio of 1.5. The latter is the best possible absolute performance ratio for the bin-packing problem, unless P = NP. © 1994 John Wiley & Sons, Inc. 相似文献
40.
In this article we present a queueing-location problem where a location of a service station has to be determined. The two main results of this article are a convexity proof for general distances and a theorem that limits the area in the plane where the solution can lie. We also propose some solution procedures. 相似文献