全文获取类型
收费全文 | 437篇 |
免费 | 5篇 |
出版年
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 4篇 |
2013年 | 135篇 |
2010年 | 5篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 9篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 5篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有442条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
6.
7.
John R. McNamara 《海军后勤学研究》1986,33(3):501-512
A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed of the product of the slack variables, each raised to an undetermined negative exponent or surrogate multiplier. It is assumed that the original problem is canonical. The exponents in the constraint on the product of the slack variables must be estimated so that the associated solution to the augmented problem, obtained immediately, also solves the original problem. An iterative search procedure for finding the required exponents, thus solving the original problem, is described. The search procedure has proven quite efficient, often requiring only two or three iterations per degree of difficulty of the original problem. At each iteration the well-known procedure for solving a geometric programming problem with a zero degree of difficulty is used and so computations are simple. The solution generated at each iteration is optimal for a problem which differs from the original problem only in the values of some of the constraint coefficients, so intermediate solutions provide useful information. 相似文献
8.
9.
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. 相似文献
10.
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. 相似文献