全文获取类型
收费全文 | 584篇 |
免费 | 232篇 |
国内免费 | 16篇 |
出版年
2024年 | 4篇 |
2023年 | 7篇 |
2022年 | 6篇 |
2021年 | 8篇 |
2020年 | 5篇 |
2019年 | 21篇 |
2018年 | 13篇 |
2017年 | 28篇 |
2016年 | 41篇 |
2015年 | 29篇 |
2014年 | 26篇 |
2013年 | 88篇 |
2012年 | 51篇 |
2011年 | 41篇 |
2010年 | 43篇 |
2009年 | 46篇 |
2008年 | 40篇 |
2007年 | 54篇 |
2006年 | 45篇 |
2005年 | 36篇 |
2004年 | 34篇 |
2003年 | 25篇 |
2002年 | 30篇 |
2001年 | 27篇 |
2000年 | 22篇 |
1999年 | 16篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 8篇 |
1989年 | 2篇 |
1988年 | 2篇 |
排序方式: 共有832条查询结果,搜索用时 15 毫秒
691.
将AUSMPW+格式应用到高超声速热化学非平衡流场的数值模拟中。为提高精度,采用了三阶MUSCL插值方法。与LU SGS方法结合,提高了单步计算效率和收敛性。采用热化学非平衡十一组元气体模型求解了非定常轴对称Navier Stokes方程组,得到了收敛结果。数值模拟结果与文献结果进行了对比,并在弹道靶中进行了钢质圆球的实验验证。计算结果与文献、实验的对比说明,AUSMPW+格式可以在热化学非平衡流的数值模拟中精确地捕捉到强弓形激波,得到准确的空气动力系数。 相似文献
692.
693.
Snke Hartmann 《海军后勤学研究》2002,49(5):433-448
This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029 相似文献
694.
结构不确定线性时滞系统的无记忆鲁棒镇定 总被引:2,自引:1,他引:1
针对状态和控制均存在时滞的一类结构不确定线性时滞系统 ,讨论了鲁棒镇定问题 ,当不确定性参数满足有界性条件时 ,提出了一种无记忆线性状态反馈控制律 ,可保证闭环系统具有二次稳定性 相似文献
695.
Thomas W. Lucas 《海军后勤学研究》2003,50(4):306-321
There are multiple damage functions in the literature to estimate the probability that a single weapon detonation destroys a point target. This paper addresses differences in the tails of four of the more popular damage functions. These four cover the asymptotic tail behaviors of all monotonically decreasing damage functions with well‐behaved hazard functions. The differences in estimates of probability of kill are quite dramatic for large aim‐point offsets. This is particularly important when balancing the number of threats that can be engaged with the chances of fratricide and collateral damage. In general, analysts substituting one damage function for another may badly estimate kill probabilities in offset‐aiming, which could result in poor doctrine. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 306–321, 2003. 相似文献
696.
In this paper a case study dealing with the maintenance problem of jib cranes is presented. A jib crane is viewed as a complex system whose performance is observed as a single realization over period of time. After pointing out limitations of existing stochastic models to analyze the observed realization a new family of bivariate stochastic processes is introduced. The data of jib crane is analyzed using new model and cross‐validated using part of the data set. It is noted that the new family of stochastic processes is useful to analyze bivariate data where one of the variables is finitely valued and the other is nonnegative and continuous. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 231–243, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10006 相似文献
697.
We consider the ??p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010 相似文献
698.
Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001 相似文献
699.
In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
700.
We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献