全文获取类型
收费全文 | 671篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 15篇 |
2019年 | 16篇 |
2018年 | 7篇 |
2017年 | 11篇 |
2016年 | 8篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 111篇 |
2009年 | 8篇 |
2008年 | 14篇 |
2006年 | 10篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 11篇 |
2000年 | 7篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 22篇 |
1987年 | 13篇 |
1986年 | 21篇 |
1985年 | 15篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 14篇 |
1979年 | 15篇 |
1978年 | 13篇 |
1977年 | 11篇 |
1976年 | 7篇 |
1975年 | 14篇 |
1974年 | 11篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 6篇 |
1966年 | 8篇 |
排序方式: 共有690条查询结果,搜索用时 0 毫秒
171.
A. S. Goldman 《海军后勤学研究》1969,16(1):111-120
Although industry is expected to design hardware to fit into a general support system and to be capable of arguing life-cycle system costs, adequate information has not been available on the support system in terms of policies and operating decision rules. Policies and operating decisions by users dominate engineering design decisions in determining life-cycle support costs. The relative effect of each of these decision areas on support costs has yet to be resolved empirically. Without an understanding of the sensitivity of support costs to alternative designs, capability is limited in design improvement and support of end items. Life-cycle costing of analysis under cost-effectiveness and the maintainability of integrated logistics support is open to question. 相似文献
172.
173.
Satya D. Dubey 《海军后勤学研究》1966,13(2):113-128
Test functions, based on various types of censored and noncensored data, for testing several hypotheses about the location, the scale, and the shape parameters of the Weibull distributions are proposed. The exact sampling distributions of these test statistics are derived and their properties in special cases are discussed. A numerical example is considered to illustrate the application of the test functions. The results of this paper possess good possibility of wide application in view of the fact that hosts of real data arising from diverse fields of human endeavor are adequately described by the Weibull distribution. 相似文献
174.
175.
176.
A sequential decision problem is considered in which N particles have to cross a given field. Two alternative crossing paths are available. An unknown number of absorption points J1 and J2 are planted at each of the crossing paths. The bivariate prior distribution of (J1,J2) is given. If a particle passes close to an absorption point it may survive with probability s, 0 < s < 1. If a particle is absorbed, both the particle and the absorption point are ruined. There is no replacement of ruined absorption points. All absorption points act independently. The particles crciss the field in a consecutive order, and a crossing path can be chosen for each particle. The objective is to maximize the expected number of survivors. The Bayes sequential procedure is characterized. The csmditions under which the Bayes strategy is determined by the maximal posterior survival probabilities are specified. 相似文献
177.
Darrell D. Perry 《海军后勤学研究》1985,32(1):17-19
MIL-STD-414 has been in existence in its original form since 1957. Obviously, there are some things that are right about 414. But there are some changes to the standard that are long overdue. This article presents some pros and cons of 414 and a recommendation that it be replaced by a MIL-STD-414A. Two concerns regarding ANSI/ASQC Z1.9 are discussed. 相似文献
178.
George S. Fishman 《海军后勤学研究》1985,32(2):249-261
This article describes a new procedure for estimating parameters of a stochastic activity network of N arcs. The parameters include the probability that path m is the longest path, the probability that path m is the shortest path, the probability that arc i is on the longest path, and the probability that arc i is on the shortest path. The proposed procedure uses quasirandom points together with information on a cutset ? of the network to produce an upper bound of O[(log K)N?|?|+1/K] on the absolute error of approximation, where K denotes the number of replications. This is a deterministic bound and is more favorable than the convergence rate of 1/K1/2 that one obtains from the standard error for K independent replications using random sampling. It is also shown how series reduction can improve the convergence rate by reducing the exponent on log K. The technique is illustrated using a Monte Carlo sampling experiment for a network of 16 relevant arcs with a cutset of ? = 7 arcs. The illustration shows the superior performance of using quasirandom points with a cutset (plan A) and the even better performance of using quasirandom points with the cutset together with series reduction (plan B) with regard to mean square error. However, it also shows that computation time considerations favor plan A when K is small and plan B when K is large. 相似文献
179.
A heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small- to moderate-sized randomly generated generalized set-packing models. Solutions are compared to those obtained using an existing well-regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low-density models in which the number of variables is large relative to the number of constraints. 相似文献
180.