全文获取类型
收费全文 | 453篇 |
免费 | 5篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 56篇 |
2012年 | 22篇 |
2011年 | 26篇 |
2010年 | 21篇 |
2009年 | 14篇 |
2008年 | 27篇 |
2007年 | 13篇 |
2006年 | 15篇 |
2005年 | 6篇 |
2004年 | 3篇 |
2002年 | 3篇 |
2001年 | 3篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 12篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有458条查询结果,搜索用时 0 毫秒
41.
42.
43.
44.
45.
影响图建模算法的改进 总被引:1,自引:0,他引:1
影响图建模方法是一种规范化的复杂系统建模方法,其实质是将表征复杂系统的参量及参量间的耦合关系进行分类,并以此为基础建立系统的数学模型.影响图建模算法就是将系统的参量及参量间的耦合关系进行分类的算法.目前使用的算法是James R.Burns于1979年提出的.该算法仅考虑了最小的反馈回路,而没有考虑影响图中存在的一般反馈回路,且一些操作造成了不必要的循环.在分析该算法的基础上,考虑了一般的反馈回路,并对原算法的操作步骤进行了优化重组. 相似文献
46.
Observations from inspection by a “test” method and a standard method are combined to provide estimators of population proportion, and of probabilities of misclassification for the test method. Results of Hochberg and Tenenbein [3] and of Albers and Veldman [1] are extended to the case where the standard method is not perfect, but its misclassification probabilities have known values. Both moment and maximum-likelihood estimators are considered and some asymptotic properties of the resulting estimators are compared. 相似文献
47.
Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. Competitors seek to visit, in a fixed amount of time, a subset of these locations on the way from the start point to the end point in order to maximize the total score. An effective center-of-gravity heuristic is presented that outperforms heuristics from the literature. 相似文献
48.
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. 相似文献
49.
间歇采样转发干扰以及改进的重复转发间歇采样干扰是对线性调频雷达的有效干扰样式,但其形成的假目标幅度较小,能量损失较大。针对这些不足,提出了一种间歇采样累加干扰,该方法通过将数字储频后离散采样信号的幅值进行累加,在获得干扰幅度的同时实现信号的最大相干性。通过理论分析可知,信号脉内周期性变化会对干扰信号产生影响,因此又通过对累加信号幅度较低部分进行幅度倍乘和对间歇采样信号取绝对值后累加,得到2种改进方案:倍乘调整间歇采样累加干扰和绝对值间歇采样累加干扰。最后通过仿真实验,证明了间歇采样累加干扰是对线性调频雷达的一种有效干扰,能够产生较好的欺骗和覆盖干扰效果,并且假目标幅度较大,工程实现简单,节省功率。 相似文献
50.
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 相似文献