全文获取类型
收费全文 | 669篇 |
免费 | 304篇 |
国内免费 | 28篇 |
出版年
2024年 | 6篇 |
2023年 | 14篇 |
2022年 | 12篇 |
2021年 | 11篇 |
2020年 | 11篇 |
2019年 | 17篇 |
2018年 | 20篇 |
2017年 | 32篇 |
2016年 | 56篇 |
2015年 | 52篇 |
2014年 | 67篇 |
2013年 | 82篇 |
2012年 | 59篇 |
2011年 | 59篇 |
2010年 | 44篇 |
2009年 | 48篇 |
2008年 | 32篇 |
2007年 | 40篇 |
2006年 | 36篇 |
2005年 | 54篇 |
2004年 | 41篇 |
2003年 | 28篇 |
2002年 | 31篇 |
2001年 | 33篇 |
2000年 | 25篇 |
1999年 | 15篇 |
1998年 | 24篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有1001条查询结果,搜索用时 31 毫秒
141.
介绍了控制系统的故障诊断和容错控制的基本概念和任务 ,评述了故障诊断和容错控制技术所用的各种方法 ,并对故障诊断和容错控制技术在核动力装置控制系统中应用的可行性进行了探讨 . 相似文献
142.
对惯导系统上的陀螺仪在无故障和故障下输出的信号进行分析 ,计算出信号的特征量———均值、标准差、协方差 ,并用现代谱分析技术中参数模型功率谱分析的方法 ,建立信号的AR模型、绘出AR模型的功率谱图 ,对陀螺仪输出信号的变化进行了比较和分析 ,从而找出一种作为判断陀螺仪性能故障的依据 相似文献
143.
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 相似文献
144.
复杂热动力装置计算机监控系统设计 总被引:1,自引:0,他引:1
给出了一般复杂热动力装置计算机监控系统的结构方案 ,讨论了系统硬件结构及配置 ,分析了系统软件结构及特点 ,阐述了复杂系统状态参数采集处理的方法以及串行数据通信的实现 ,展望了系统的应用前景和发展趋势 相似文献
145.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
146.
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 相似文献
147.
针对局部线性嵌入方法对于噪声的敏感性,从分析噪声对数据集局部特性的影响入手,提出了稳健局部线性嵌入方法。通过与局部线性嵌入方法的理论分析和实例对比,表明稳健局部线性嵌入方法不仅对噪声影响不敏感,而且对邻域的选择有较好的适应性,可更好地挖掘数据集的本征特性,具有更强的数据可视化能力。 相似文献
148.
为了得到高电压的输出,从爆炸磁通量压缩发生器的工作原理入手,在单端起爆装置的基础上,设计了一种两端起爆的螺旋形爆磁发生器,并给出了实验结果和分析。 相似文献
149.
150.
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 相似文献