全文获取类型
收费全文 | 329篇 |
免费 | 200篇 |
国内免费 | 16篇 |
出版年
2024年 | 3篇 |
2023年 | 9篇 |
2022年 | 6篇 |
2021年 | 8篇 |
2020年 | 11篇 |
2019年 | 6篇 |
2018年 | 11篇 |
2017年 | 18篇 |
2016年 | 26篇 |
2015年 | 24篇 |
2014年 | 22篇 |
2013年 | 22篇 |
2012年 | 39篇 |
2011年 | 28篇 |
2010年 | 18篇 |
2009年 | 27篇 |
2008年 | 22篇 |
2007年 | 23篇 |
2006年 | 33篇 |
2005年 | 30篇 |
2004年 | 24篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2001年 | 17篇 |
2000年 | 22篇 |
1999年 | 16篇 |
1998年 | 12篇 |
1997年 | 3篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有545条查询结果,搜索用时 15 毫秒
41.
采用DSMC (DirectSimulationMonte -Carlo)方法模拟二维凹槽过渡流动 ,给出了在不同Knudsen数、不同展弦比、不同壁温条件下凹槽流的速度和温度分布 ,并对DSMC方法在模拟全速度域流场时存在的局限性进行了讨论。 相似文献
42.
气液两相管流流型识别理论研究进展 总被引:2,自引:0,他引:2
综述了气液两相流流型识别理论及方法的研究进展。首先探讨了流型划分问题,然后针对水平管路、垂直管路及摇摆管路介绍了两相流流型转换机理及转换的边界条件;对于流型的在线识别,介绍了基于波动理论、神经网络和图像处理的流型识别方法。最后提出了气液两相管流流型识别中亟待开展的理论研究方向。 相似文献
43.
采用数值方法研究了双三角翼上涡流运动随攻角的变化规律.计算取层流假设,研究了攻角在5°~30°,76°/40°后掠双三角翼绕流的流场结构随攻角的变化,并对双三角翼上涡破裂现象对流场结构及气动力性能的影响进行了分析.结果表明,双三角翼上的多涡结构存在强烈的相互影响,较大的攻角会导致涡破裂在翼面上发生,严重影响了双三角翼的气动力性能. 相似文献
44.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
45.
刘伟 《国防科技大学学报》2002,24(3):1-3
采用空间二阶精度的交替方向隐式分解的NND格式求解完全气体假定下的非定常薄层近似Navier Stokes方程 ,并采用抛物化的椭圆型方程生成复杂带翼外形的空间网格。最后给出带控制舵机动弹头在M∞ =7 3,α =2 0°下所计算的流场等值线、表面压强分布及表面极限流线 相似文献
46.
The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001 相似文献
47.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
48.
49.
采用空间二阶精度的交替方向隐式分解的NND格式求解完全气体假定下的非定常薄层近似Navier Stokes方程 ,并采用抛物化的椭圆型方程生成复杂带翼外形的空间网格。最后给出了类升力体外形在M∞ =8 0 ,α =2 0°下的流场计算结果。 相似文献
50.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献