全文获取类型
收费全文 | 1352篇 |
免费 | 30篇 |
出版年
2021年 | 18篇 |
2019年 | 39篇 |
2018年 | 22篇 |
2017年 | 35篇 |
2016年 | 30篇 |
2015年 | 32篇 |
2014年 | 25篇 |
2013年 | 266篇 |
2010年 | 15篇 |
2009年 | 17篇 |
2007年 | 17篇 |
2006年 | 17篇 |
2005年 | 22篇 |
2004年 | 25篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2000年 | 18篇 |
1999年 | 14篇 |
1998年 | 21篇 |
1997年 | 28篇 |
1996年 | 26篇 |
1995年 | 11篇 |
1994年 | 29篇 |
1993年 | 20篇 |
1992年 | 18篇 |
1991年 | 30篇 |
1990年 | 18篇 |
1989年 | 30篇 |
1988年 | 24篇 |
1987年 | 28篇 |
1986年 | 31篇 |
1985年 | 26篇 |
1984年 | 19篇 |
1983年 | 20篇 |
1982年 | 18篇 |
1981年 | 18篇 |
1980年 | 20篇 |
1979年 | 22篇 |
1978年 | 21篇 |
1977年 | 17篇 |
1976年 | 21篇 |
1975年 | 15篇 |
1974年 | 23篇 |
1973年 | 23篇 |
1972年 | 21篇 |
1971年 | 22篇 |
1970年 | 16篇 |
1969年 | 16篇 |
1968年 | 14篇 |
1967年 | 14篇 |
排序方式: 共有1382条查询结果,搜索用时 15 毫秒
981.
Charles H. Reilly Clark A. Mount-Campbell Fernando Mata Eric K. Walton Eric A. Aebker Curt A. Levis 《海军后勤学研究》1991,38(6):779-797
We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two-phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k-permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized. 相似文献
982.
983.
Hemiter's entropy model for brand purchase behavior has been generalized for Renyi's measure of entropy which is a more general concept than Shannon's measure of entropy used by Herniter and which includes Shannon's measure as a limiting case. The generalized model considered here is more flexible than Herniter's model since it can give different marketing statistics for different products and it can give these statistics even when only some of the brands are considered. 相似文献
984.
G. A. Heuer 《海军后勤学研究》1984,31(2):229-249
A two-parameter class of games on 1,∞)2 is studied. The games may be regarded as analogs of Silverman games, having continuous payoff function in place of a step function of y/x. This change is motivated by a desire to move toward a model for competitive situations where the penalty for overspending increases with the amount of overspending. There are some similarities to games with bell-shaped kernel. For most of the region considered in the plane of the two parameters there are solutions of finite type, which are obtained explicitly. There are, however, pockets in this plane where no optimal strategies have been found and possibly where none of finite type exist. 相似文献
985.
Sheldon M. Ross 《海军后勤学研究》1984,31(2):297-300
We consider a multicomponent system in which the failure rate of a given component at any time depends on the set of working components at that time. Sufficient conditions are presented under which such a system has a life distribution of specified type. The Laplace transform of the time until all components are down is derived. When repair is allowed, conditions under which the resulting process is time reversible are presented. 相似文献
986.
To location Li we are to allocate a “generator” and ni “machines” for i = 1, …,k, where n1 … n1 ≧ … ≧ nk. Although the generators and machines function independently of one another, a machine is operable only if it and the generator at its location are functioning. The problem we consider is that of finding the arrangement or allocation optimizing the number of operable machines. We show that if the objective is to maximize the expected number of operable machines at some future time, then it is best to allocate the best generator and the n1 best machines to location L1, the second-best generator and the n2-next-best machines to location L2, etc. However, this arrangement is not always stochastically optimal. For the case of two generators we give a necessary and sufficient condition that this arrangement is stochastically best, and illustrate the result with several examples. 相似文献
987.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed. 相似文献
988.
A computationally simple method for obtaining confidence bounds for highly reliable coherent systems, based on component tests which experience few or no failures, is given. Binomial and Type I censored exponential failure data are considered. Here unknown component unreliabilities are ordered by weighting factors, which are firstly presumed known then sensitivity of the confidence bounds to these assumed weights is examined and shown to be low. 相似文献
989.
The loading problem we consinder is to assign a set of discrete objects, each having a weight, to a set of boxes, each of which has a capacity limit, in such a way that every object is assigned to a box and the number of boxes used is minimized. A characterization of the assignments is offered and used to develop a set of rules for generating nonredundant assignments. The rules are incorporated into an implicit enumeration algorithm. The algorithm is tested against a very good heuristic. Computational experience shows that the algorithm is highly efficient, solving problems of up to 3600 0-1 variables in a CPU second. 相似文献
990.
A cutting plane method, based on a geometric inequality, is described as a means of solving geometric programs. While the method is applied to the primal geometric program, it is shown to retain the geometric programming duality relationships. Several methods of generating the cutting planes are discussed and illustrated on some example problems. 相似文献