全文获取类型
收费全文 | 532篇 |
免费 | 8篇 |
专业分类
540篇 |
出版年
2021年 | 6篇 |
2020年 | 6篇 |
2019年 | 15篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 102篇 |
2010年 | 6篇 |
2008年 | 10篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 7篇 |
1989年 | 11篇 |
1988年 | 14篇 |
1987年 | 12篇 |
1986年 | 14篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 14篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 9篇 |
1974年 | 9篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 14篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 6篇 |
1966年 | 8篇 |
排序方式: 共有540条查询结果,搜索用时 10 毫秒
1.
Hew Strachan Geoffrey Till G. D. Sheffield Gwyn Harries-Jenkins 《Defense & Security Analysis》1989,5(1):87-93
British Military History: a Supplement to Robin Higham's Guide to the Sources.. Edited by Gerald Jordan. Garland, New York (1988), xii + 586 pp., $75.00
Red Duster at War. By John Slader. William Kimber, London (1988), 352 pp., £15.50
Armed Services and Society. By Martin Edmonds. Leicester University Press, Leicester (1988), 226 pp., £25.00 相似文献
Red Duster at War. By John Slader. William Kimber, London (1988), 352 pp., £15.50
Armed Services and Society. By Martin Edmonds. Leicester University Press, Leicester (1988), 226 pp., £25.00 相似文献
2.
R. D. Wollmer 《海军后勤学研究》1970,17(2):207-216
This paper presents an algorithm for determining where to place intercepting units in order to maximize the probability of preventing an opposing force from proceeding from one particular node in an undirected network to another. The usual gaming assumptions are invoked; namely, the strategy for placing the units is known to the opponent and he will choose a path through the network which, based on this knowledge, maximizes his probability of successful traverse. As given quantities, the model requires a list of the arcs and nodes of the network, the number of intercepting units available to stop the opposing force, and the probabilities for stopping the opposition at the arcs and nodes as functions of the number of intercepting units placed there. From these quantities, the algorithm calculates the probabilities for placing the unit at the arcs and nodes when one intercepting unit is available, and the expected numbers of units to place at the arcs and nodes when multiple intercepting units are available. 相似文献
3.
Consider an auction in which increasing bids are made in sequence on an object whose value θ is known to each bidder. Suppose n bids are received, and the distribution of each bid is conditionally uniform. More specifically, suppose the first bid X1 is uniformly distributed on [0, θ], and the ith bid is uniformly distributed on [Xi?1, θ] for i = 2, …?, n. A scenario in which this auction model is appropriate is described. We assume that the value θ is un known to the statistician and must be esimated from the sample X1, X2, …?, Xn. The best linear unbiased estimate of θ is derived. The invariance of the estimation problem under scale transformations in noted, and the best invariant estimation problem under scale transformations is noted, and the best invariant estimate of θ under loss L(θ, a) = [(a/θ) ? 1]2 is derived. It is shown that this best invariant estimate has uniformly smaller mean-squared error than the best linear unbiased estimate, and the ratio of the mean-squared errors is estimated from simulation experiments. A Bayesian formulation of the estimation problem is also considered, and a class of Bayes estimates is explicitly derived. 相似文献
4.
A cutting plane scheme embedded in an implicit enumeration framework is proposed for ranking the extreme points of linear assignment problems. This method is capable of ranking any desired number of extreme points at each possible objective function value. The technique overcomes storage difficulties by being able to perform the ranking at any particular objective function value independently of other objective values. Computational experience on some test problems is provided. 相似文献
5.
In Turner and Holmes [8] a model for evasive vehicle movement along a fixed track is developed within the mathematical framework of a two-state semi-Markov process. They derive a number of analytical properties of the model. In this article we address problems concerning the estimation of parameters in the model and the construction of data-based prediction equations. 相似文献
6.
Adam D. Bramoweth James Luther Barbara H. Hanusa Jon D. Walker Charles W. Atwood Jr. Anne Germain 《Defence and Peace Economics》2018,29(1):78-90
AbstractInsomnia is prevalent among Veterans with post-traumatic stress disorder (PTSD), it exacerbates PTSD symptoms, and it contributes to impaired functioning and quality of life. To improve treatment outcomes, it is important to identify risk factors for insomnia and sedative-hypnotic use. Classification and regression trees and logistic regression models were used to identify variables associated with insomnia or sedative-hypnotic use. Key findings include low insomnia diagnosis rates (3.5–5.6%) and high rates of sedative-hypnotics (44.2–49.0%). Younger Veterans and those without a breathing-related sleep disorder (BRSD) were more likely to receive an insomnia diagnosis. Veterans with greater service connection and those with an alcohol/substance use disorder were more likely to be prescribed sedative-hypnotics. Interaction terms may have identified potential groups at risk of being under-diagnosed with insomnia (i.e. non-black Veterans with psychiatric co-morbidity, black Veterans without psychiatric co-morbidity) as well as groups at risk for sedative-hypnotic use (i.e. younger Veterans without BRSD). In sum, Veterans with PTSD have high rates of sedative-hypnotic use despite minimal evidence they are effective. This is counter to recommendations indicating behavioral interventions are the first-line treatment. Policy changes are needed to reduce use of sedative-hypnotics and increase access to behavioral insomnia interventions. 相似文献
7.
We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
8.
9.
10.
Models are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time-weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory systems. 相似文献