全文获取类型
收费全文 | 816篇 |
免费 | 304篇 |
国内免费 | 64篇 |
出版年
2024年 | 3篇 |
2023年 | 12篇 |
2022年 | 11篇 |
2021年 | 12篇 |
2020年 | 26篇 |
2019年 | 27篇 |
2018年 | 18篇 |
2017年 | 56篇 |
2016年 | 55篇 |
2015年 | 45篇 |
2014年 | 59篇 |
2013年 | 62篇 |
2012年 | 62篇 |
2011年 | 71篇 |
2010年 | 52篇 |
2009年 | 73篇 |
2008年 | 42篇 |
2007年 | 66篇 |
2006年 | 65篇 |
2005年 | 51篇 |
2004年 | 59篇 |
2003年 | 26篇 |
2002年 | 32篇 |
2001年 | 31篇 |
2000年 | 30篇 |
1999年 | 31篇 |
1998年 | 20篇 |
1997年 | 22篇 |
1996年 | 9篇 |
1995年 | 7篇 |
1994年 | 12篇 |
1993年 | 11篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有1184条查询结果,搜索用时 15 毫秒
961.
962.
963.
为高精度模拟高动态条件下GNSS信号的多普勒特性,本文提出一种任意阶DDS信号合成器的设计方法。设计了任意阶DDS信号合成器的结构;通过理论分析,推导了各级累加器相位初值的计算公式;给出了字长选择方法;经仿真与验证,该方法能精确模拟GNSS信号的多普勒特性。此外,本文提出的DDS设计方法不受阶数的限制,可普遍应用于各类信号模拟器的设计。 相似文献
964.
为精确估计对流层散射双向时间比对系统中对流层斜延迟,分析了估计卫星信号对流层斜延迟的Hopfield天顶延迟模型及CFA2.2映射函数模型并对其进行修正,从而适用于对流层散射斜延迟的精确估计。根据北纬35°~37°范围内的三个测站2010—2012三年的气象数据,验证Hopfield模型精度范围小于35 mm,并将三个测站按相互之间基线距离的不同分为三组比对站,利用2012年的气象数据,计算在不同入射角下一年的对流层散射斜延迟,并得出最大斜延迟对应的年积日和入射角。结果表明,三组比对站的最大单向散射斜延迟为21.82~35.45 m。在双向比对抵消90%的情况下,时间延迟为7.3 ns~11.7 ns;相互抵消95%时,时间延迟为3.6 ns~5.9 ns。 相似文献
965.
966.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
967.
Murat Güngör 《海军后勤学研究》2016,63(4):346-348
For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016 相似文献
968.
This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017 相似文献
969.
970.