全文获取类型
收费全文 | 509篇 |
免费 | 98篇 |
国内免费 | 24篇 |
专业分类
631篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 14篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 16篇 |
2015年 | 28篇 |
2014年 | 23篇 |
2013年 | 73篇 |
2012年 | 24篇 |
2011年 | 23篇 |
2010年 | 43篇 |
2009年 | 32篇 |
2008年 | 44篇 |
2007年 | 34篇 |
2006年 | 30篇 |
2005年 | 30篇 |
2004年 | 24篇 |
2003年 | 17篇 |
2002年 | 25篇 |
2001年 | 22篇 |
2000年 | 13篇 |
1999年 | 20篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1973年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有631条查询结果,搜索用时 0 毫秒
281.
液体管道的水击波速受流体压力、温度、分子结构、含气量及管线几何尺寸、管材等因素的影响,准确地确定管线的水击波速是一个相当困难的问题,通过实验测量水击波速是一个常用方法。管线水击波速的常用测量方法有波前法和周期法。综合运用波前法和周期法,设计了实验测量野战管线的水击波速,并将实验结果与笔者先前提出的水击波速计算公式的计算结果作了对比,验证了公式的有效性。 相似文献
282.
静态电磁场数值分析方法比较 总被引:1,自引:0,他引:1
从有限差分法、有限元法、边界元法和模拟电荷法这四种典型数值分析方法出发,简要介绍了静电场数值分析的原理。比较了各种算法与其适用范围的差异,并对其进展进行分析。最后,总结了目前静电电磁场数值分析方法研究中需要解决的问题。 相似文献
283.
提出一种光电二级稳定粗、精控制通道融合新方案,并与现有粗、精控制通道相互独立二级稳定方案相比较。仿真结果表明,粗、精控制融合方案无论在成本、体积、性能和精度上,都优于现有二级稳定方案。新方案的可行性已通过原理样机得到验证。 相似文献
284.
季明 《军队政工理论研究》2005,6(2):12-14
遵义会议是实事求是思想路线的胜利。从毛泽东提出“实事求是” ,到邓小平强调“解放思想、实事求是” ,江泽民强调“解放思想、实事求是、与时俱进” ,再到胡锦涛强调“求真务实” ,清晰地反映了党的历代领导集体在革命、建设和改革实践中 ,对思想路线的不断丰富和发展 ,展示了我们党不懈追求真理的科学态度 ,也标志着党对马克思主义思想路线的认识达到了一个新的高度。新世纪新阶段要自觉坚持和贯彻好党的思想路线 ,就必须有新的思路、新的举措。 相似文献
285.
An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
286.
287.
We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual‐variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K ‐shortest paths finding algorithm that may be efficient in many real cases. An application in hazardous materials transportation is discussed, and the solution methods are illustrated by numerical examples. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
288.
289.
290.
In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献