全文获取类型
收费全文 | 738篇 |
免费 | 11篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 11篇 |
2017年 | 13篇 |
2016年 | 16篇 |
2015年 | 10篇 |
2014年 | 13篇 |
2013年 | 108篇 |
2012年 | 25篇 |
2011年 | 27篇 |
2010年 | 22篇 |
2009年 | 18篇 |
2008年 | 28篇 |
2007年 | 24篇 |
2006年 | 16篇 |
2005年 | 6篇 |
2004年 | 6篇 |
2003年 | 8篇 |
2002年 | 9篇 |
1998年 | 13篇 |
1997年 | 11篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 15篇 |
1987年 | 6篇 |
1986年 | 22篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 13篇 |
1981年 | 13篇 |
1980年 | 13篇 |
1979年 | 16篇 |
1978年 | 10篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 11篇 |
1974年 | 10篇 |
1973年 | 6篇 |
1972年 | 15篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 13篇 |
1968年 | 8篇 |
1967年 | 6篇 |
排序方式: 共有749条查询结果,搜索用时 109 毫秒
51.
An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given. 相似文献
52.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
53.
54.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
55.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
56.
57.
58.
Nathaniel L. Moir 《Small Wars & Insurgencies》2017,28(6):909-946
This article assesses Bernard Fall’s concept of Vietnamese Revolutionary Warfare in Indochina between 1953 and 1958. It also investigates differences in the conceptualization of Revolutionary Warfare between Fall and proponents of French military doctrine known as la guerre révolutionnaire. The last component of the article considers limits of Fall’s influence on counterinsurgency doctrine. 相似文献
59.
间歇采样转发干扰以及改进的重复转发间歇采样干扰是对线性调频雷达的有效干扰样式,但其形成的假目标幅度较小,能量损失较大。针对这些不足,提出了一种间歇采样累加干扰,该方法通过将数字储频后离散采样信号的幅值进行累加,在获得干扰幅度的同时实现信号的最大相干性。通过理论分析可知,信号脉内周期性变化会对干扰信号产生影响,因此又通过对累加信号幅度较低部分进行幅度倍乘和对间歇采样信号取绝对值后累加,得到2种改进方案:倍乘调整间歇采样累加干扰和绝对值间歇采样累加干扰。最后通过仿真实验,证明了间歇采样累加干扰是对线性调频雷达的一种有效干扰,能够产生较好的欺骗和覆盖干扰效果,并且假目标幅度较大,工程实现简单,节省功率。 相似文献
60.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献