全文获取类型
收费全文 | 690篇 |
免费 | 333篇 |
国内免费 | 60篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 7篇 |
2021年 | 23篇 |
2020年 | 23篇 |
2019年 | 14篇 |
2018年 | 39篇 |
2017年 | 61篇 |
2016年 | 52篇 |
2015年 | 32篇 |
2014年 | 61篇 |
2013年 | 62篇 |
2012年 | 66篇 |
2011年 | 58篇 |
2010年 | 40篇 |
2009年 | 77篇 |
2008年 | 57篇 |
2007年 | 50篇 |
2006年 | 50篇 |
2005年 | 52篇 |
2004年 | 34篇 |
2003年 | 33篇 |
2002年 | 34篇 |
2001年 | 28篇 |
2000年 | 17篇 |
1999年 | 18篇 |
1998年 | 16篇 |
1997年 | 10篇 |
1996年 | 8篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 11篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 17篇 |
1989年 | 2篇 |
排序方式: 共有1083条查询结果,搜索用时 15 毫秒
41.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
42.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
43.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
44.
针对伪码截获这一无线电侦察和导航战中的难题,从模式识别的角度研究存在自干扰码时的伪码截获问题。通过对干扰码的载波频率、相位等参数的估计和补偿,将自干扰码下的伪码截获问题转换为模式识别问题。结合伪码的周期性,采用二进制积累的方法大大降低了判决前所要求的信噪比,使得对扩频信号直接解调以截获伪码成为可能,改变了过去依靠大口径天线提高信噪比的方法。 相似文献
45.
针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。 相似文献
46.
反舰导弹机动与导引配合的弹道设计研究 总被引:2,自引:0,他引:2
传统反舰导弹的末端机动与导引是分别进行的,这使得突防效果的提升受限。为了达到提高突防概率和实现高精度导引的双重目的,需要在导弹的末段实现机动与导引协同配合的设计。利用弹目之间的几何关系,规划设计了根据弹目实时连线进行自适应蛇行机动的程序参考信号。整个设计可以看作比例导引法与蛇行机动的复合,利用的信号包括实测的雷达方位角信号、弹目距离与预先设计好的时间指令。 相似文献
47.
通过总结美军数据链建设的现状与发展趋势,重点分析了美军数据链一体化建设中采取的基于数据转发、基于并行接口和基于消息标准多链路操作发展策略,并探讨了美军一体化建设过程中面临的问题。最后,结合数据链建设的实际情况,在汲取美军教训的基础上,提出了数据链一体化建设过程中应重点解决的问题。 相似文献
48.
为了克服低信噪比条件下传统的自适应滤波算法抑制高斯噪声效果差的缺点,提出了基于最小均方(LMS)的时域相干累积新算法。计算机仿真结果表明,该算法具有良好的抑制高斯噪声的性能,对于低信噪比下信号的增强效果明显优于传统的自适应滤波算法。 相似文献
49.
大圆航线导航与控制律设计 总被引:1,自引:0,他引:1
随着无人机(UAV)应用范围的扩大,要求无人机能精确跟踪预定航线.预定的飞行任务可以有两种规划方式,一是近似在当地切平面上的直线或曲线;二是飞行距离较长时在地球表面的大圆航线.第二种规划相对复杂,研究较少,因此,介绍了某型无人机的动力学模型,提出了一种全新的大圆航线导航解算算法,设计了大圆导航控制律,此外,还分析了常值风及突风干扰对导航的影响.经计算机仿真验证和部分的实际飞行试验结果表明:与预定航线的距离偏差较小,航迹精度较高,新算法及设计较好地满足了实际大圆航线飞行要求. 相似文献
50.