全文获取类型
收费全文 | 630篇 |
免费 | 5篇 |
出版年
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 6篇 |
2017年 | 15篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 99篇 |
2012年 | 23篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 16篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2002年 | 9篇 |
2001年 | 5篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 4篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 14篇 |
1988年 | 6篇 |
1987年 | 15篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 11篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 9篇 |
1975年 | 9篇 |
1974年 | 6篇 |
1973年 | 5篇 |
1972年 | 14篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 12篇 |
1968年 | 8篇 |
排序方式: 共有635条查询结果,搜索用时 0 毫秒
141.
142.
The problem of computing reliability and availability and their associated confidence limits for multi-component systems has appeared often in the literature. This problem arises where some or all of the component reliabilities and availabilities are statistical estimates (random variables) from test and other data. The problem of computing confidence limits has generally been considered difficult and treated only on a case-by-case basis. This paper deals with Bayes confidence limits on reliability and availability for a more general class of systems than previously considered including, as special cases, series-parallel and standby systems applications. The posterior distributions obtained are exact in theory and their numerical evaluation is limited only by computing resources, data representation and round-off in calculations. This paper collects and generalizes previous results of the authors and others. The methods presented in this paper apply both to reliability and availability analysis. The conceptual development requires only that system reliability or availability be probabilities defined in terms acceptable for a particular application. The emphasis is on Bayes Analysis and the determination of the posterior distribution functions. Having these, the calculation of point estimates and confidence limits is routine. This paper includes several examples of estimating system reliability and confidence limits based on observed component test data. Also included is an example of the numerical procedure for computing Bayes confidence limits for the reliability of a system consisting of N failure independent components connected in series. Both an exact and a new approximate numerical procedure for computing point and interval estimates of reliability are presented. A comparison is made of the results obtained from the two procedures. It is shown that the approximation is entirely sufficient for most reliability engineering analysis. 相似文献
143.
A single component system is assumed to progress through a finite number of increasingly bad levels of deterioration. The system with level i (0 ≤ i ≤ n) starts in state 0 when new, and is definitely replaced upon reaching the worthless state n. It is assumed that the transition times are directly monitored and the admissible class of strategies allows substitution of a new component only at such transition times. The durations in various deterioration levels are dependent random variables with exponential marginal distributions and a particularly convenient joint distribution. Strategies are chosen to maximize the average rewards per unit time. For some reward functions (with the reward rate depending on the state and the duration in this state) the knowledge of previous state duration provides useful information about the rate of deterioration. 相似文献
144.
This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn-Tucker theories, which give only necessary or sufficient conditions for optimality, but not both. 相似文献
145.
146.
Suppose x1, x2, … are independently distributed random variables with Pr (xi = 1) = Pr(xi = ?1) = 1/2, and let sn =
147.
148.
149.
This paper considers a problem of locating new facilities in the plane with respect to existing facilities, the locations of which are known. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportional to the Euclidian distances among the new facilities, and costs directly proportional to the Euclidian distances between new and existing facilities. It is established that the total cost function has a minimum; necessary conditions for a mimumum are obtained; necessary and sufficient conditions are obtained for the function to be strictly convex (it is always convex); when the problem is “well structured,” it is established that for a minimum cost solution the locations of the new facilities will lie in the convex hull of the locations of the existing facilities. Also, a dual to the problem is obtained and interpreted; necessary and sufficient conditions for optimum solutions to the problem, and to its dual, are developed, as well as complementary slackness conditions. Many of the properties to be presented are motivated by, based on, and extend the results of Kuhn's study of the location problem known as the General Fermat Problem. 相似文献
150.
A discrete time Collection Model is formulated, involving the completion of a touring objective on a network with stochastic node states. Heuristic touring strategies are constructed, there being as yet inadequate analytic results for its optimal solution. Effectiveness of the heuristics is assessed by comparing expected tour times under the heuristics with expected tour times given perfect information. A branch and bound algorithm is presented for computing the perfect information tour times. 相似文献