全文获取类型
收费全文 | 128篇 |
免费 | 82篇 |
国内免费 | 4篇 |
出版年
2024年 | 4篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 10篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 15篇 |
2015年 | 3篇 |
2014年 | 12篇 |
2013年 | 7篇 |
2012年 | 13篇 |
2011年 | 15篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 9篇 |
2005年 | 13篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 14篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1992年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有214条查询结果,搜索用时 31 毫秒
21.
周云龙 《国防科技大学学报》2016,38(4)
采用五阶精度显式HWCNS格式求解雷诺平均NS方程,利用多块对接结构网格技术,对30P-30N多段翼型进行网格收敛性研究,在不考虑转捩的情况下采用SA一方程湍流模型研究HWCNS格式与二阶精度MUSCL格式对该翼型压力分布和典型站位速度型的影响,并与实验结果进行对比分析。采用HWCNS格式和SA一方程湍流模型模拟梯形翼高升力构型低速复杂流场,通过对总体气动特性和压力分布的分析,探讨五阶精度显式HWCNS格式在低速复杂外形流动中的应用能力。 相似文献
22.
23.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
24.
瞬态温度场有限元法求解的研究 总被引:3,自引:1,他引:2
介绍了瞬态热分析的定义和步进积分的特点;研究了两点时问差分格式的瞬态导热温度场有限元法数值解的稳定性和振荡现象;比较和分析了几种差分格式的特点,并应用算例对几种差分算法进行了验证;总结说明了几种差分算法在实际当中的应用。 相似文献
25.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
26.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
27.
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献
28.
在高精度数值风洞平台上,采用低速平板试验数据对基于高精度WCNS格式的γ-Reθ转捩模型进行了标定,并在二维低速问题中进行了应用。计算结果与试验的对比表明,基于高精度WCNS格式的γ-Reθ转捩模型可准确模拟自然转捩、旁路转捩及分离转捩的位置,并且具有较低的网格敏感性。同时也表明在中等雷诺数范围,层流区域长度和湍流区域有相同量级时,计算必须采用转捩模型才能准确模拟阻力系数。 相似文献
29.
为了构造在光滑区具有较高分辨率并且可以无振荡捕捉激波的高精度有限体积格式,同时降低格式在模板选择上遇到的困难,基于逐维重构方法,发展了结构网格下的高精度有限体积格式,并将这一格式推广到三维曲线坐标系下,从而可以适应相对复杂外形下的计算。为充分验证格式的有效性,选取一系列典型算例进行计算:在等熵涡输运和二维喷管流动中验证了格式的精度可以达到设计精度;在双马赫反射问题中格式也表现出良好的捕捉激波的能力。数值计算表明,上述格式在曲线网格上具有较高的数值精度和鲁棒的激波捕捉能力,适用于流体力学方程的计算。 相似文献
30.
带混合误差的Ishikawa迭代格式 总被引:1,自引:0,他引:1
将Ishikawa型迭代格式的收敛性问题推广到带混合误差的Ishikawa型迭代格式的情形 ,同时所用的证明方法和技巧有所改进 相似文献