全文获取类型
收费全文 | 177篇 |
免费 | 68篇 |
国内免费 | 5篇 |
出版年
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 11篇 |
2018年 | 10篇 |
2017年 | 17篇 |
2016年 | 18篇 |
2015年 | 12篇 |
2014年 | 12篇 |
2013年 | 20篇 |
2012年 | 13篇 |
2011年 | 14篇 |
2010年 | 8篇 |
2009年 | 13篇 |
2008年 | 13篇 |
2007年 | 3篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 5篇 |
1990年 | 1篇 |
1989年 | 4篇 |
排序方式: 共有250条查询结果,搜索用时 0 毫秒
101.
Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016 相似文献
102.
讨论的排队模型 ,放宽了GI/G/1系统中“服务时间独立同分布”的限制 ,只要求各服务时间相互独立 ,因而较GI/G/1排队模型能更合理地拟合实际问题 .在此较宽的条件下 ,利用补充变量的方法 ,求得了该排队系统队长的瞬时分布 相似文献
103.
The notion of signature has been widely applied for the reliability evaluation of technical systems that consist of binary components. Multi‐state system modeling is also widely used for representing real life engineering systems whose components can have different performance levels. In this article, the concept of survival signature is generalized to a certain class of unrepairable homogeneous multi‐state systems with multi‐state components. With such a generalization, a representation for the survival function of the time spent by a system in a specific state or above is obtained. The findings of the article are illustrated for multi‐state consecutive‐k‐out‐of‐n system which perform its task at three different performance levels. The generalization of the concept of survival signature to a multi‐state system with multiple types of components is also presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 593–599, 2017 相似文献
104.
Mihail Naydenov 《Defense & Security Analysis》2018,34(1):93-112
Russia has long been pursuing an intended and calculated policy of keeping enough influence in Bulgaria in order to have control over national decisions. Together with the economic, energy, political and information tools used by Russia in its hybrid war against Bulgaria and in its bid to achieve an enduring “state capture,” defence is also a distinct target of Russian subversion now. A list of noticeable subversive actions with tangible effects can be summarised, ranging from fuelling division and manipulating public opinion, preventing the strengthening of the NATO position in the Black Sea, sabotaging defence reform to various options of subverting the modernisation of the Bulgarian Armed Forces and seeking new ways to keep legacy Soviet military equipment in operation as long as possible. This issue must be urgently addressed both nationally and in NATO. 相似文献
105.
106.
Design reliability at the beginning of a product development program is typically low, and development costs can account for a large proportion of total product cost. We consider how to conduct development programs (series of tests and redesigns) for one‐shot systems (which are destroyed at first use or during testing). In rough terms, our aim is to both achieve high final design reliability and spend as little of a fixed budget as possible on development. We employ multiple‐state reliability models. Dynamic programming is used to identify a best test‐and‐redesign strategy and is shown to be presently computationally feasible for at least 5‐state models. Our analysis is flexible enough to allow for the accelerated stress testing needed in the case of ultra‐high reliability requirements, where testing otherwise provides little information on design reliability change. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
107.
为了解决部件阶段依赖性与共因失效给系统可靠性分析带来的复杂性,针对多阶段共因失效任务系统,结合GO法易于处理有时序、含共因失效系统可靠性分析的特点,首先,将前一阶段的输出信号作为后一阶段的输入信号,建模时首尾连接各阶段模型,建立整个任务系统的隐性GO模型;其次,在进行各信号流状态组合运算时,融入阶段代数处理部件的阶段依赖性;再次,用隐性共因失效分析,将共因失效对系统的影响在状态组合的定量分析中表达出来,得到所需系统可靠性指标;最后,与基于二元决策图的算法进行对比验证。结果表明:GO法可以简捷、准确地处理多阶段共因失效任务系统可靠性评估问题。 相似文献
108.
为了解决坦克驾驶训练中因操作状态难以保留、操作细节难以再现而无法实现对训练成果深入分析与客观评价的不足,以坦克驾驶训练数字化记录与评判系统总体设计为切入点,基于基础驾驶动作的分解与组合以及车辆状态信息获取设计了驾驶动作记录仪,实现了坦克驾驶训练过程中动作状态信息的采集与数字化存储,并应用矩阵变换理论,提出了一种基于关键性动作参数查找与判断的方法,对基础驾驶动作进行了过程识别与效果评判。分析表明:该系统的技术能对坦克驾驶动作状态进行数字化记录,而基于状态矩阵变换的方法能实现基本驾驶过程的识别与评判。 相似文献
109.
110.