首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   286篇
  免费   6篇
  2021年   4篇
  2019年   9篇
  2018年   5篇
  2017年   5篇
  2016年   2篇
  2015年   4篇
  2014年   4篇
  2013年   51篇
  2010年   4篇
  2009年   4篇
  2008年   6篇
  2007年   3篇
  2006年   2篇
  2005年   4篇
  2004年   5篇
  2003年   4篇
  2002年   3篇
  2001年   4篇
  2000年   5篇
  1998年   7篇
  1997年   4篇
  1996年   10篇
  1995年   4篇
  1994年   2篇
  1993年   4篇
  1992年   5篇
  1990年   3篇
  1989年   5篇
  1988年   6篇
  1986年   7篇
  1985年   6篇
  1984年   6篇
  1983年   2篇
  1982年   4篇
  1981年   5篇
  1980年   11篇
  1979年   4篇
  1978年   7篇
  1977年   4篇
  1976年   5篇
  1975年   6篇
  1974年   4篇
  1973年   2篇
  1972年   3篇
  1971年   8篇
  1970年   4篇
  1969年   4篇
  1968年   5篇
  1967年   4篇
  1966年   6篇
排序方式: 共有292条查询结果,搜索用时 546 毫秒
61.
This paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines. Based on the combinatorial analysis of the problem, several simple algorithms are developed for solving special structure flowshop scheduling problems where the process times are not completely random, but bear a well-defined relationship to one another. The proposed algorithms are both simple and computationally efficient and can optimally solve large-sized problems even with manual computational devices.  相似文献   
62.
This paper considers the problem of finding optimal solutions to a class of separable constrained extremal problems involving nonlinear functionals. The results are proved for rather general situations, but they may be easily stated for the case of search for a stationary object whose a priori location distribution is given by a density function on R, a subset of Euclidean n-space. The functional to be optimized in this case is the probability of detection and the constraint is on the amount of effort to be used Suppose that a search of the above type is conducted in such a manner as to produce the maximum increase in probability of detection for each increment of effort added to the search. Then under very weak assumptions, it is proven that this search will produce an optimal allocation of the total effort involved. Under some additional assumptions, it is shown that any amount of search effort may be allocated in an optimal fashion.  相似文献   
63.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations.  相似文献   
64.
Strategy, Politics and Defense Budgets. By Warner R. Schilling, Paul Y. Hammond and Glenn H. Snyder. Columbia University Press, New York (1962)  相似文献   
65.
Let , where A (t)/t is nondecreasing in t, {P(k)1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models.  相似文献   
66.
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.  相似文献   
67.
The reliability of a serial production line is optimized with respect to the location of a single buffer. The problem was earlier defined and solved by Soyster and Toof for the special case of an even number of machines all having equal probability of failure. In this paper we generalize the results for any number of machines and remove the restriction of identical machine reliabilities. In addition, an analysis of multibuffer systems is presented with a closed form solution for the reliability when both the number of buffers and their capacity is limited. For the general multibuffer system we present an approach for determining system reliability.  相似文献   
68.
If we look at the literature of reliability and life testing we do not see much on the use of the powerful methods of time series analysis. In this paper we show how the methods of multivariate time series analysis can be used in a novel way to investigate the interrelationships between a series of operating (running) times and a series of maintenance (down) times of a complex system. Specifically, we apply the techniques of cross spectral analysis to help us obtain a Box-Jenkins type transfer function model for the running times and the down times of a nuclear reactor. A knowledge of the interrelationships between the running times and the down times is useful for an evaluation of maintenance policies, for replacement policy decisions, and for evaluating the availability and the readiness of complex systems.  相似文献   
69.
Data on 23 lots of various aircraft programs were gathered. Total engineering man-hours, and information on performance, weight, area, avionics systems, data, and schedule were subjected to least squares analysis. An equation is presented which indicates a relationship between total engineering manhours and a set of seven predictor variables. While the equation derived could only be used with confidence by the manufacturer whose data was analyzed, this article should be looked upon as demonstrating a method of data analysis which others may also find useful, not only for predicting engineering manhours in major aircraft programs, but also in other situations where there is an abundance of possible predictor variables, and the problem is to sort out a meaningful subset of these variables. In order to demonstrate the viability of the formula obtained, comparisons were made with various bid programs.  相似文献   
70.
Suppose x1, x2, … are independently distributed random variables with Pr (xi = 1) = Pr(xi = ?1) = 1/2, and let sn =

  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号