全文获取类型
收费全文 | 345篇 |
免费 | 13篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 6篇 |
2013年 | 56篇 |
2012年 | 3篇 |
2011年 | 3篇 |
2010年 | 7篇 |
2009年 | 3篇 |
2007年 | 7篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2002年 | 9篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 10篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有359条查询结果,搜索用时 15 毫秒
71.
本文讲述了由PC机控制的多用途超精机床(MPUMT)的设计及光学镜平滑表面的加工。已研制出的机床可用于磨削、切削、研磨或抛光塑性状态下的硬脆材料。作为建立新的加工系统的关键部分,采用了大型磁致伸缩调节器(GMA),在没有放大器元件的情况下,它具有大功率的输出和大于压电陶瓷调节器几倍的纳米级的位移。切削DOC的深度和控制塑性状态过程的微塑性区域能够被调节器设置为具有高于1nm的精度,并能用金刚石磨削砂轮研磨。在当前研究中所用到的镜为多晶体、非晶体,也有加固玻璃。磨削实验的结果表明,已研制出来的超精机床能够实现对塑性状态下的玻璃和陶瓷材料的加工。材料特性参数和微裂纹之间的关系已被检测到,适用于大多数被研究玻璃的脆性到塑性磨削方式的转换已经确定。运用AFM、SEM和ZYGO对磨削表面进行了分析,例如BK7和TRC5(新材料;加固玻璃)的磨削表面分别具Ra=0.15nm和Ra=0.32nm的表面粗糙度。 相似文献
72.
73.
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. 相似文献
74.
Michael H. Rothkopf 《海军后勤学研究》1975,22(4):829-830
A recent article in this journal by Mehta, Chandrasekaran, and Emmons [1] described a dynamic programming algorithm for assigning jobs to two identical parallel processors in a way that minimizes the average delay of these jobs. Their problem has a constraint on the sequence of the jobs such that any group of jobs assigned to a processor must be processed in the order of the sequence. This note has two purposes. First, we wish to point out a relationship between this work and some prior work [2]. Second, we wish to point out that Mehta, Chandrasekaran, and Emmons formulation, slightly generalized, can be used to find the optimum assignment of jobs to two machines in a more general class of problems than they considered including a subclass in which the jobs are not constrained to be processed in a given sequence. 相似文献
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.
77.
James H. Patterson 《海军后勤学研究》1976,23(1):95-123
Individual characteristics of multiple-constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution. 相似文献
78.
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. 相似文献
79.
An inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set-up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail. 相似文献
80.
N. Bhashyam 《海军后勤学研究》1970,17(1):121-129
This paper examines the effect of limitation, regarding weapons that are likely to fail during the period of deployment, on the final outcome in a stochastic duel model. Inter-firing times as well as inter-failure times have been assumed to be exponentially distributed. 相似文献