全文获取类型
收费全文 | 689篇 |
免费 | 172篇 |
国内免费 | 84篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 5篇 |
2020年 | 6篇 |
2019年 | 11篇 |
2018年 | 2篇 |
2017年 | 40篇 |
2016年 | 46篇 |
2015年 | 33篇 |
2014年 | 52篇 |
2013年 | 61篇 |
2012年 | 63篇 |
2011年 | 49篇 |
2010年 | 46篇 |
2009年 | 64篇 |
2008年 | 50篇 |
2007年 | 56篇 |
2006年 | 62篇 |
2005年 | 55篇 |
2004年 | 49篇 |
2003年 | 38篇 |
2002年 | 21篇 |
2001年 | 22篇 |
2000年 | 18篇 |
1999年 | 17篇 |
1998年 | 16篇 |
1997年 | 12篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1988年 | 1篇 |
排序方式: 共有945条查询结果,搜索用时 15 毫秒
71.
模糊综合评判在军队指挥效能评估中的应用 总被引:6,自引:0,他引:6
分析现行军队指挥效能评估中方法的不足,在现有评估方法的基础上,提出一种更优的隶属度函数来建立模糊评判矩阵中的元素值,并论证确定该隶属度函数的合理性,同时给出用该隶属度函数确定的模糊评判矩阵的一个实例。用提出的模糊综合评判方法来评估的军队指挥效能评估指标体系,在一定程度上提高了对军队指挥系统效能评估的合理性。 相似文献
72.
模糊信息的信息量及其计算 总被引:2,自引:0,他引:2
定义了有关信息的基本概念 ,给出了一种关于位置的模糊信息即闭区间 [a ,b]上模糊数的信息量计算公式 ,讨论了模糊数信息量的性质 ,最后介绍了在模糊层次分析的比较判断矩阵构造中的算例 相似文献
73.
基于案例推理和模糊诊断的兵器故障诊断专家系统 总被引:5,自引:0,他引:5
讨论了基于案例的推理和模糊诊断矩阵在兵器故障中的应用 ,建立了兵器故障诊断WDDS -E系统模型和模糊诊断矩阵模型。详细说明了系统的工作原理和设计过程 ,并给出了应用实例 相似文献
74.
75.
实际中普遍存在的有显著渐近失效行为的系统 ,难以用经典故障树加以分析 ,于是 ,以“模糊事件的普通概率”这一理论为基础 ,建立了Profust故障树模型 ,并进行了部分定量分析 ,该模型的最大特点是综合运用了可以得到的关于系统运行的可能性信息和概率信息 相似文献
76.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
77.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
78.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
79.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
80.