全文获取类型
收费全文 | 291篇 |
免费 | 10篇 |
出版年
2021年 | 11篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 39篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 10篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 7篇 |
2003年 | 2篇 |
2002年 | 9篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 8篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 4篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 2篇 |
1970年 | 4篇 |
1969年 | 5篇 |
1968年 | 2篇 |
排序方式: 共有301条查询结果,搜索用时 15 毫秒
71.
72.
超精密铣削的三维微加工工艺 总被引:1,自引:0,他引:1
本研究旨在对用于获取有雕刻表面金属工件的超精密微加工工艺进行探讨。研究中使用的是车床型的超精密铣床,由分辨率为1nm的X和Z向运动工作台及分辨率为0.0001度的可定位的C轴组成。作为一种铣削工具,一种改进型的由一颗水晶钻构成的“仿球尖铣刀”被放置在X轴的高速气浮轴承之上。这样一来,X轴和C轴的协调运动就可产生三维铣削的效果。为提高表面粗糙度,通过模拟我们研究的刀具边沿和工件表面的接触情况,结果发现,刀具低速进给时切削比较有效。作为三维微加工工艺的一个例子,运用数字仪提供的扫描数据在一个直径为3mm的铜表面上制作一个传统的NOH面罩。经证明,超精密铣床有潜力加工出表面粗糙度为69nm(P—V值)的工件。 相似文献
73.
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. 相似文献
74.
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. 相似文献
75.
N. U. Prabhu 《海军后勤学研究》1974,21(3):411-418
Suppose that the state of a queueing system is described by a Markov process { Yt, t ≥ 0}, and the profit from operating it up to a time t is given by the function f(Yt). We operate the system up to a time T, where the random variable T is a stopping time for the process Yt. Optimal stochastic control is achieved by choosing the stopping time T that maximizes Ef(YT) over a given class of stopping times. In this paper a theory of stochastic control is developed for a single server queue with Poisson arrivals and general service times. 相似文献
76.
This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed. 相似文献
77.
78.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献
79.
Many optimization problems occur in both theory and practice when one has to optimize an objective function while an infinite number of constraints must be satisfied. The aim of this paper in to describe methods of handling such problems numerically in an effective manner. We also indicate a number of applications. 相似文献
80.
Richard N. Burns 《海军后勤学研究》1976,23(1):125-129
A result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented. Heck and Roberts [2] suggested that their paper would be extended in the same way Smith's algorithm was. A new algorithm is given that converges to a local optimum for both problems. 相似文献