全文获取类型
收费全文 | 202篇 |
免费 | 7篇 |
国内免费 | 1篇 |
出版年
2021年 | 2篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2014年 | 6篇 |
2013年 | 42篇 |
2012年 | 3篇 |
2011年 | 1篇 |
2010年 | 6篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2003年 | 1篇 |
2002年 | 7篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 6篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 1篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1949年 | 1篇 |
1948年 | 2篇 |
排序方式: 共有210条查询结果,搜索用时 134 毫秒
1.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
2.
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. 相似文献
3.
H. W. Kuhn 《海军后勤学研究》2005,52(1):7-21
This paper has been presented with the Best Paper Award. It will appear in print in Volume 52, No. 1, February 2005. 相似文献
4.
Matthew H. Wahlert 《Defense & Security Analysis》2012,28(3):247-259
The goal of this article is to challenge the assumption of rationality in the behavior of decision-making units involved in security, defense, intelligence and warfare and to consider the influence of “motivated bias” in such instances. A review of motivational literature within international politics and a discussion of literature applying “motivated biases” to warfare and strategic surprise will offer an alternative view of the primacy of rationality in such decisions. 相似文献
5.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
6.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
7.
Charles H. Heider 《海军后勤学研究》1973,20(4):699-724
The component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer-aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question- how close to optimal are the near optimal solutions- is examined. 相似文献
8.
A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H1: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study. 相似文献
9.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
10.
This article is concerned with choosing a mix of weapons, subject to constraints, when the targets to be attacked are known imprecisely. It is shown that the correct method for optimizing the mix of weapons involves a pair of nested optimization problems (two-stage optimization). Two methods for optimizing the expected utility of a mix are discussed. The first involves a simultaneous attack model, in which it is implicitly assumed that all weapons are used at once. The second involves a sequential attack model, in which targets appear in random order and are attacked one at a time. Particular attention is given to the question of the appropriate mix of general-purpose and special-purpose weapons. 相似文献