全文获取类型
收费全文 | 1474篇 |
免费 | 359篇 |
国内免费 | 120篇 |
出版年
2024年 | 4篇 |
2023年 | 6篇 |
2022年 | 22篇 |
2021年 | 29篇 |
2020年 | 24篇 |
2019年 | 23篇 |
2018年 | 25篇 |
2017年 | 64篇 |
2016年 | 85篇 |
2015年 | 62篇 |
2014年 | 99篇 |
2013年 | 147篇 |
2012年 | 99篇 |
2011年 | 114篇 |
2010年 | 114篇 |
2009年 | 128篇 |
2008年 | 95篇 |
2007年 | 115篇 |
2006年 | 120篇 |
2005年 | 96篇 |
2004年 | 87篇 |
2003年 | 57篇 |
2002年 | 45篇 |
2001年 | 39篇 |
2000年 | 53篇 |
1999年 | 29篇 |
1998年 | 23篇 |
1997年 | 25篇 |
1996年 | 25篇 |
1995年 | 16篇 |
1994年 | 16篇 |
1993年 | 15篇 |
1992年 | 19篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 5篇 |
1988年 | 3篇 |
排序方式: 共有1953条查询结果,搜索用时 171 毫秒
101.
为了提高含硼推进剂固体火箭冲压发动机内硼颗粒的燃烧效率,采用颗粒轨道模型进行了补燃室两相流的数值模拟,其中硼颗粒的点火和燃烧模型采用的是King模型,建立了发动机补燃室内简单反应流模型,在该模型下研究了进气道的位置对非壅塞固体火箭冲压发动机燃烧效率的影响,并在此基础上进行直连式试验研究.结果表明,后进气道角度为60°时的燃烧效率比90°时高. 相似文献
102.
In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
103.
以冲压增程弹为应用背景进行了进气道设计.结合增程弹的特点,讨论了轴对称进气道中心锥参数、喉道参数、外罩参数的选择.特别对进气道唇口处参数、扩张段角度设计方法进行了分析.设计了单锥混压式、单锥外压式以及双锥混压式三种进气道,并进行了数值模拟.分析了进气道主要设计参数对其性能的影响.数值结果表明,就增程弹的性能要求而言,双锥混压式进气道的性能较高. 相似文献
104.
随着软硬件系统规模和功能的不断扩充,状态空间爆炸问题严重影响了模型检验的进一步发展与应用,成为验证大规模系统的瓶颈.在显式模型检验工具Murphi的基础上,针对其可达状态空间组织存在的问题进行改进,提出了基于整型指针与Fibonacci散列的可达状态空间组织方法,实现了一个高效的显式模型检验原型系统,在确保验证正确的同时有效缩短了验证时间,并能在系统规范不可满足的情况下给出反例,有助于系统设计人员快速定位错误.理论分析和实验结果表明了本方法的有效性. 相似文献
105.
An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA. 相似文献
106.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
107.
在信号流图的基础上,提出多回路分析的方法,并用于研究反区时速度矢量不稳定及其稳定控制的机理。建立了纵向动力学的信号流图,并证明了一个回路的收敛性定理。在此基础上,通过理论分析得出了速度矢量不稳定在不同层面上的原因,也得出了速度和轨迹的发散度表达式等,并表明阻力-速度曲线、轨迹角-速度曲线、极曲线、阻力系数曲线等存在相互对应的反区和正区,并且阻力-速度曲线和轨迹角-速度曲线在斜率上成比例。研究得出进场动力补偿系统下速度矢量的稳定临界条件、收敛度、稳定机理等,理论分析和仿真比较了速度恒定进场动力补偿系统和迎角恒定进场动力补偿系统在控制性能上的差异。 相似文献
108.
近年来,随着智能移动终端和互联网技术的结合,上网变得十分便利。网民数量激增的同时,网络谣言层出不穷,给社会安全与稳定造成不良影响。文章从心理学角度深入分析助推网络谣言的原因,并基于心理规律提出网络谣言的管控措施。 相似文献
109.
A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
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 相似文献
110.
Considering a supply chain with a supplier subject to yield uncertainty selling to a retailer facing stochastic demand, we find that commonly studied classical coordination contracts fail to coordinate both the supplier's production and the retailer's procurement decisions and achieve efficient performance. First, we study the vendor managed inventory (VMI) partnership. We find that a consignment VMI partnership coupled with a production cost subsidy achieves perfect coordination and a win‐win outcome; it is simple to implement and arbitrarily allocates total channel profit. The production cost subsidy optimally chosen through Nash bargaining analysis depends on the bargaining power of the supplier and the retailer. Further, motivated by the practice that sometimes the retailer and the supplier can arrange a “late order,” we also analyze the behavior of an advance‐purchase discount (APD) contract. We find that an APD with a revenue sharing contract can efficiently coordinate the supply chain as well as achieve flexible profit allocation. Finally, we explore which coordination contract works better for the supplier vs. the retailer. It is interesting to observe that Nash bargaining solutions for the two coordination contracts are equivalent. We further provide recommendations on the applications of these contracts. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 305–319, 2016 相似文献