全文获取类型
收费全文 | 686篇 |
免费 | 127篇 |
国内免费 | 55篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 10篇 |
2021年 | 15篇 |
2020年 | 17篇 |
2019年 | 13篇 |
2018年 | 11篇 |
2017年 | 31篇 |
2016年 | 40篇 |
2015年 | 32篇 |
2014年 | 46篇 |
2013年 | 57篇 |
2012年 | 52篇 |
2011年 | 61篇 |
2010年 | 41篇 |
2009年 | 67篇 |
2008年 | 28篇 |
2007年 | 44篇 |
2006年 | 58篇 |
2005年 | 48篇 |
2004年 | 32篇 |
2003年 | 27篇 |
2002年 | 14篇 |
2001年 | 21篇 |
2000年 | 19篇 |
1999年 | 12篇 |
1998年 | 10篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有868条查询结果,搜索用时 296 毫秒
131.
In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory. 相似文献
132.
Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it. 相似文献
133.
为了得到横向效应增强型弹(Penetration with Enhanced Lateral Efficiency projectile, PELE)对金属薄靶垂直侵彻后的弹体轴向剩余速度,运用平面冲击波理论,对PELE的侵彻机理进行分析。参照平头弹体对靶板的侵彻模型,将PELE侵彻过程中的能量损失划分为以下几个部分:外壳体和内芯撞靶区域对应的环形塞块获得的能量、冲击波作用下弹体的内能增量以及剪切耗能等。然后根据能量守恒原理,得到PELE垂直侵彻金属薄靶后的PELE弹体轴向剩余速度的理论模型。为了验证该模型的合理性和准确性,设计相应的试验进行验证。结果表明,不同条件下得到的试验结果和理论模型得到的计算结果均吻合得较好。因此,得到的PELE垂直侵彻薄靶的轴向剩余速度理论模型可为工程应用提供指导和参考。 相似文献
134.
Kenton G. Fasana 《Defence Studies》2018,18(2):167-187
Cyberspace is an avenue of approach through which a military force can attain objectives of value. Through these cyber avenues of approach, military forces can engage, vet, organize, and direct human agents to accomplish specific activities. Although the objectives of these activities could differ from traditional military objectives, they still have military relevance. This particular manifestation of cyber conflict is neither a new domain of war nor something outside of warfare. Rather, it can be viewed as an emerging avenue of approach in the larger context of military operations, auguring benefits in the integration of cyber activities with operations. 相似文献
135.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
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. 相似文献
136.
137.
往返搜索是一种最常见的搜索样式,其搜索效能与搜索宽度、发现距离、搜索速度、突破速度等因素密切相关。在建立往返搜索行动模型的基础上,通过仿真实验得到耕耘数据,进而通过数据分析和处理得到往返搜索发现概率的经验公式。应用经验公式并结合声纳探测模型,对多搜索艇分段封锁搜索案例进行了优化研究。 相似文献
138.
139.
水雾作为一种优良的红外伪装措施,受到了越来越多的关注。水雾遮蔽性能的仿真研究也成为了关注的焦点,但是始终没有一种有效的仿真途径来探讨水雾释放点排布产生的影响。针对这一问题,基于高斯扩散理论与Mie散射理论,提出了一种空间划分的建模方案,解决了这一问题,并根据仿真结果,简单分析了相同条件下不同释放点排布方式对其红外辐射遮蔽性能的影响。所得结论对制定有效的红外对抗策略有一定的参考价值。 相似文献
140.