全文获取类型
收费全文 | 329篇 |
免费 | 92篇 |
国内免费 | 32篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 7篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 15篇 |
2016年 | 19篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 21篇 |
2012年 | 31篇 |
2011年 | 37篇 |
2010年 | 19篇 |
2009年 | 36篇 |
2008年 | 28篇 |
2007年 | 24篇 |
2006年 | 22篇 |
2005年 | 15篇 |
2004年 | 22篇 |
2003年 | 19篇 |
2002年 | 20篇 |
2001年 | 9篇 |
2000年 | 7篇 |
1999年 | 9篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 1篇 |
排序方式: 共有453条查询结果,搜索用时 15 毫秒
321.
传统的判断矩阵调整方法计算得到的权重不能最大限度地保留原始判断矩阵的信息。为此,提出一种基于权重的判断矩阵调整方法。该方法根据权重的性质,构造完全一致矩阵,利用AdaGrad最速下降法对矩阵进行拟合,使该矩阵相对于原始判断矩阵的总改变量最小,以其对应的权重作为矩阵的计算结果。数值计算结果表明,该方法相比于其他方法,权重对原始判断信息的保留度更高,且不需要反复进行矩阵一致性检验。 相似文献
323.
加快嵌入式Linux系统启动速度的方法及应用 总被引:1,自引:0,他引:1
嵌入式系统面向应用,提高系统在配置较低的嵌入式设备上的启动速度对嵌入式Linux的推广应用具有重要的意义。针对嵌入式Linux系统,分析了从开机直到启动完成的整个启动过程;以i386平台为例,提出了各个启动阶段中加快启动速度的解决方法;并结合一个具体的应用实例,对构建快速启动的嵌入式Linux系统进行了应用测试,结果达到了预期目的,对类似嵌入式系统的研究也有借鉴作用。 相似文献
324.
Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure. 相似文献
325.
We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares. 相似文献
326.
This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019 相似文献
327.
328.
作为混合动力汽车增程系统的一种新型动力源,球形发动机有着功率密度高,结构紧凑等优点。在介绍球形发动机工作原理及基本结构的基础之上,研究了发动机气缸容积变化规律,分析发动机燃烧过程,建立了发动机热力学理论模型。利用FLUENT开展了仿真研究,验证了模型的正确性,进而对于发动机燃油喷射过程进行了分析。结果表明:计算得到的气缸内部温度与压力曲线与仿真得到的结果基本一致,验证了理论模型的正确性。在燃油喷射的过程中,可能会出现涡团状的燃油喷射轨迹,使得局部富油发生,燃烧性能变差。 相似文献
329.
Sunkyo Kim 《海军后勤学研究》2016,63(7):549-561
A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n2 for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016 相似文献
330.