全文获取类型
收费全文 | 416篇 |
免费 | 10篇 |
出版年
2021年 | 4篇 |
2019年 | 13篇 |
2018年 | 13篇 |
2017年 | 7篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 9篇 |
2013年 | 76篇 |
2012年 | 3篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 6篇 |
2005年 | 3篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1986年 | 10篇 |
1985年 | 8篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 9篇 |
1973年 | 3篇 |
1972年 | 7篇 |
1971年 | 12篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 4篇 |
1966年 | 7篇 |
排序方式: 共有426条查询结果,搜索用时 13 毫秒
81.
Tolerance limits which control both tails of the normal distribution so that there is no more than a proportion β1 in one tail and no more than β2 in the other tail with probability γ may be computed for any size sample. They are computed from X? - k1S and X? - k2S, where X? and S are the usual sample mean and standard deviation and k1 and k2 are constants previously tabulated in Odeh and Owen [3]. The question addressed is, “Just how accurate are the coverages of these intervals (– Infin;, X? – k1S) and (X? + k2S, ∞) for various size samples?” The question is answered in terms of how widely the coverage of each tail interval differs from the corresponding required content with a given confidence γ′. 相似文献
82.
83.
A series of independent trials is considered in which one of k ≥ 2 mutually exclusive and exhaustive outcomes occurs at each trial. The series terminates when m outcomes of any one type have occurred. The limiting distribution (as m → ∞) of the number of trials performed until termination is found with particular attention to the situation where a Dirichlet distribution is assigned to the k vector of probabilities for each outcome. Applications to series of races involving k runners and to spares problems in reliability modeling are discussed. The problem of selecting a stopping rule so that the probability of the series terminating on outcome i is k?1 (i.e., a “fair” competition) is also studied. Two generalizations of the original asymptotic problem are addressed. 相似文献
84.
This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods. 相似文献
85.
Exact first and second order moments of order statistics from the truncated exponential distribution
Exact expressions for the first and second order moments of order statistics from the truncated exponential distribution, when the proportion 1–P of truncation is known in advance, are presented in this paper. Tables of expected values and variances-covariances are given for P = 0.5 (0.1) 0.9 and n = 1 (1) 10. 相似文献
86.
This paper is concerned with estimating p = P(X1 < Y …, Xn < Y) or q =P (X < Y1, …, X < Yn) where the X's and Y's are all independent random variables. Applications to estimation of the reliability p from stress-strength relationships are considered where a component is subject to several stresses X1, X2, …, XN whereas its strength, Y, is a single random variable. Similarly, the reliability q is of interest where a component is made of several parts all with their individual strengths Y1, Y2 …, YN and a single stress X is applied to the component. When the X's and Y's are independent and normal, maximum likelihood estimates of p and q have been obtained. For the case N = 2 and in some special cases, minimum variance unbiased estimates have been given. When the Y's are all exponential and the X is normal with known variance, but unknown mean (or uniform between 0 and θ, θ being unknown) the minimum variance unbiased estimate of q is established in this paper. 相似文献
87.
In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view. 相似文献
88.
Jatinder N. D. Gupta 《海军后勤学研究》1975,22(2):255-269
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. 相似文献
89.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献
90.