全文获取类型
收费全文 | 723篇 |
免费 | 231篇 |
国内免费 | 33篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 5篇 |
2021年 | 17篇 |
2020年 | 10篇 |
2019年 | 27篇 |
2018年 | 11篇 |
2017年 | 39篇 |
2016年 | 44篇 |
2015年 | 29篇 |
2014年 | 46篇 |
2013年 | 98篇 |
2012年 | 41篇 |
2011年 | 70篇 |
2010年 | 47篇 |
2009年 | 54篇 |
2008年 | 38篇 |
2007年 | 70篇 |
2006年 | 49篇 |
2005年 | 46篇 |
2004年 | 43篇 |
2003年 | 24篇 |
2002年 | 31篇 |
2001年 | 26篇 |
2000年 | 30篇 |
1999年 | 25篇 |
1998年 | 13篇 |
1997年 | 12篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有987条查询结果,搜索用时 15 毫秒
841.
Motivated by applications to service systems, we develop simple engineering approximation formulas for the steady‐state performance of heavily loaded G/GI/n+GI multiserver queues, which can have non‐Poisson and nonrenewal arrivals and non‐exponential service‐time and patience‐time distributions. The formulas are based on recently established Gaussian many‐server heavy‐traffic limits in the efficiency‐driven (ED) regime, where the traffic intensity is fixed at ρ > 1, but the approximations also apply to systems in the quality‐and‐ED regime, where ρ > 1 but ρ is close to 1. Good performance across a wide range of parameters is obtained by making heuristic refinements, the main one being truncation of the queue length and waiting time approximations to nonnegative values. Simulation experiments show that the proposed approximations are effective for large‐scale queuing systems for a significant range of the traffic intensity ρ and the abandonment rate θ, roughly for ρ > 1.02 and θ > 2.0. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 187–217, 2016 相似文献
842.
On allocating one active redundancy to coherent systems with dependent and heterogeneous components' lifetimes
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This article studies coherent systems of heterogenous and statistically dependent components' lifetimes. We present a sufficient and necessary condition for a stochastically longer system lifetime resulted by allocating a single active redundancy. For exchangeable components' lifetimes, allocating the redundancy to the component with more minimal path sets is proved to produce a more reliable system, and for systems with stochastic arrangement increasing components' lifetimes and symmetric structure with respect to two components, allocating the redundancy to the weaker one brings forth a larger reliability. Several numerical examples are presented to illustrate the theoretical results as well. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 335–345, 2016 相似文献
843.
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 相似文献
844.
We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016 相似文献
845.
为精确估计对流层散射双向时间比对系统中对流层斜延迟,分析了估计卫星信号对流层斜延迟的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。 相似文献
846.
圆柱体构件中非轴对称人造缺陷偏心圆孔的超声探伤一直是无损检测的难点。基于脉冲反射原理设计超声实验平台,根据检测回波信号判定偏心圆孔缺陷所呈现的特征。在实验研究基础上,针对声场在圆柱体工件内部的传播情况,根据惠更斯原理以圆柱体为发射声源,基于k-wave仿真工具箱建立仿真平台,并利用声学传感器接收声波信号,设计的仿真平台能够实现360°同时刻采集工件的发射信号,同时利用传播过程中声压强弱的变化构建声场模型。根据采集的信号采用逆时反演重构模型,直观可视化地重构了内部缺陷的位置形状信息。 相似文献
847.
848.
849.
850.