全文获取类型
收费全文 | 678篇 |
免费 | 14篇 |
出版年
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 17篇 |
2018年 | 9篇 |
2017年 | 14篇 |
2016年 | 18篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 125篇 |
2012年 | 22篇 |
2011年 | 34篇 |
2010年 | 23篇 |
2009年 | 17篇 |
2008年 | 31篇 |
2007年 | 18篇 |
2006年 | 17篇 |
2005年 | 9篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 6篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1995年 | 7篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 16篇 |
1988年 | 7篇 |
1987年 | 13篇 |
1986年 | 11篇 |
1985年 | 9篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 13篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 9篇 |
1973年 | 5篇 |
1972年 | 16篇 |
1971年 | 5篇 |
1970年 | 6篇 |
1969年 | 10篇 |
1968年 | 9篇 |
排序方式: 共有692条查询结果,搜索用时 390 毫秒
31.
32.
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. 相似文献
33.
间歇采样转发干扰以及改进的重复转发间歇采样干扰是对线性调频雷达的有效干扰样式,但其形成的假目标幅度较小,能量损失较大。针对这些不足,提出了一种间歇采样累加干扰,该方法通过将数字储频后离散采样信号的幅值进行累加,在获得干扰幅度的同时实现信号的最大相干性。通过理论分析可知,信号脉内周期性变化会对干扰信号产生影响,因此又通过对累加信号幅度较低部分进行幅度倍乘和对间歇采样信号取绝对值后累加,得到2种改进方案:倍乘调整间歇采样累加干扰和绝对值间歇采样累加干扰。最后通过仿真实验,证明了间歇采样累加干扰是对线性调频雷达的一种有效干扰,能够产生较好的欺骗和覆盖干扰效果,并且假目标幅度较大,工程实现简单,节省功率。 相似文献
34.
A learning tabu search for a truck allocation problem with linear and nonlinear cost components 下载免费PDF全文
The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015 相似文献
35.
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 相似文献
36.
37.
38.
39.
计算了一类二次Hamilton微分系统的一阶Mel’nikov函数,通过此方法对该系统在三次多项式扰动下分岔的极限环个数进行了估计。 相似文献
40.