全文获取类型
收费全文 | 272篇 |
免费 | 3篇 |
出版年
2021年 | 3篇 |
2019年 | 3篇 |
2017年 | 4篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 3篇 |
2013年 | 72篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 1篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 6篇 |
1974年 | 6篇 |
1973年 | 6篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 2篇 |
1948年 | 3篇 |
排序方式: 共有275条查询结果,搜索用时 31 毫秒
1.
2.
The Quality Measurement Plan (QMP) and the Universal Sampling Plan (USP) are the data analysis and sampling plans for the AT&T Technologies quality audit. This article describes QMP/USP, an acceptance sampling plan based on QMP and USP principles. QMPIUSP is a complete acceptance sampling system. It combines the elements of classical rectification inspection plans with those of MIL-STD-IOSD. There is no switching between plans, no tables of numbers to look through, and no discontinue state. QMP/USP is a computerized, self-contained system that features:
- Acceptance decisions based on the QMP Bayes empirical Bayes analysis of current and past sampling result
- Sample size selection based on USP, i.e., lot size, AQL, a cost ratio, the QMP analysis, and a budget constraint
- Guaranteed AOQ
- A complete statistical analysis of the quality process.
3.
4.
5.
6.
7.
This paper calls attention to an experimental design which enhances the efficiency of the technique described by B. F. Houston and R. A. Huffman [3]. This alternative design is a modification of the simplex lattice design developed by Scheffé [6] for the mixture problem. While not possessing the optimal statistical properties of the central composite design proposed in [3], such as minimum bias and minimum variance, this modified design is optimum with respect to the number of design points employed; hence, it is the minimum cost design. Further, the design proposed in this note is excellent for use in multiple-block experimentation, which is very often required with constrained systems. 相似文献
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.
We first present a survey on the theory of semi-infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi-infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n-space with maximization of a linear function in non-negative variables of a generalized finite sequence space subject to a finite system of linear equations. We then present a new generalization of the Kuhn-Tucker saddle-point equivalence theorem for arbitrary convex functions in n-space where differentiability is no longer assumed. 相似文献
10.
Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction. 相似文献