全文获取类型
收费全文 | 3357篇 |
免费 | 82篇 |
国内免费 | 1篇 |
出版年
2021年 | 37篇 |
2019年 | 89篇 |
2018年 | 52篇 |
2017年 | 82篇 |
2016年 | 80篇 |
2015年 | 64篇 |
2014年 | 67篇 |
2013年 | 710篇 |
2010年 | 36篇 |
2009年 | 37篇 |
2008年 | 48篇 |
2007年 | 53篇 |
2006年 | 37篇 |
2005年 | 44篇 |
2004年 | 56篇 |
2003年 | 43篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 47篇 |
1997年 | 50篇 |
1996年 | 62篇 |
1995年 | 41篇 |
1994年 | 59篇 |
1993年 | 63篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 73篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 71篇 |
1985年 | 64篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 34篇 |
排序方式: 共有3440条查询结果,搜索用时 15 毫秒
781.
782.
In military situations of sharply increasing combat activity the Marine Corps is faced with training problems in its expanding aviator corps. Additional training aircraft are required, and procurement decisions must be made. In view of the significant costs involved in procurement and operation of new high performance aircraft, it is very desirable to buy and operate an efficient mix of aircraft necessary for training the pilots to make the Marine Aircraft Wings essentially 100-percent tactically qualified. The mathematical model presented here enables computation of a least-cost mix of training aircraft which satisfies certain specified training requirements. The basic element allowing tradeoffs is the commonality of training available in the F4, RF4, A6, and EA6 types of aircraft. Both airframe oriented and mission oriented training are necessary, but the airframe oriented training can be conducted in either of the aircraft possessing the commonality. Training requirements over a five year period are considered, and the mix of training aircraft has the minimum five year procurement and operating cost. 相似文献
783.
Salah E. Elmaghraby 《海军后勤学研究》1968,15(1):23-32
Given n jobs and a single facility, and the fact that a subset of jobs are “related” to each other in such a manner that regardless of which job is completed first, its utility is hampered until all other jobs in the same subset are also completed, it is desired to determine the sequence which minimizes the cost of tardiness. The special case of pairwise relationship among all jobs is easily solved. An algorithm for the general case is given through a dynamic programming formulation. 相似文献
784.
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. 相似文献
785.
Suppose x1, x2, … are independently distributed random variables with Pr (xi = 1) = Pr(xi = ?1) = 1/2, and let sn =
786.
Roger C. Vergin 《海军后勤学研究》1968,15(4):523-534
Most maintenance and replacement models for industrial equipment have been developed for independent single-component machines. Most equipment, however, consists of multiple components. Also, when the maintenance crew services several machines, the maintenance policy for each machine is not independent of the states of the other machines. In this paper, two dynamic programming replacement models are presented. The first is used to determine the optimal replacement policy for multi-component equipment. The second is used to determine the optimal replacement policy for a multi-machine system which uses one replacement crew to service several machines. In addition, an approach is suggested for developing an efficient replacement policy for a multi-component, multi-machine system. 相似文献
787.
788.
789.
790.
In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p2. This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p2. Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity. 相似文献