全文获取类型
收费全文 | 723篇 |
免费 | 231篇 |
国内免费 | 33篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 5篇 |
2021年 | 17篇 |
2020年 | 10篇 |
2019年 | 27篇 |
2018年 | 11篇 |
2017年 | 39篇 |
2016年 | 44篇 |
2015年 | 29篇 |
2014年 | 46篇 |
2013年 | 98篇 |
2012年 | 41篇 |
2011年 | 70篇 |
2010年 | 47篇 |
2009年 | 54篇 |
2008年 | 38篇 |
2007年 | 70篇 |
2006年 | 49篇 |
2005年 | 46篇 |
2004年 | 43篇 |
2003年 | 24篇 |
2002年 | 31篇 |
2001年 | 26篇 |
2000年 | 30篇 |
1999年 | 25篇 |
1998年 | 13篇 |
1997年 | 12篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有987条查询结果,搜索用时 15 毫秒
851.
852.
In this article, a model for a repairable consecutive‐k‐out‐of‐n: F system with Markov dependence is studied. A binary vector is used to represent the system state. The failure rate of a component in the system depends on the state of the preceding component. The failure risk of a system state is then introduced. On the basis of the failure risk, a priority repair rule is adopted. Then the transition density matrix can be determined, and the analysis of the system reliability can be conducted accordingly. One example each of a linear and a circular system is then studied in detail to explain the model and methodology developed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 18–39, 2000 相似文献
853.
For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S1 and S2 such that the sum of elements in S1 is equal to the sum of elements in S2. If additionally two elements (the kernels) r1, r2 ∈ S are given which must not be assigned to the same set Si, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000 相似文献
854.
So Young Sohn 《海军后勤学研究》2000,47(6):500-510
A univariate meta analysis is often used to summarize various study results on the same research hypothesis concerning an effect of interest. When several marketing studies produce sets of more than one effect, multivariate meta analysis can be conducted. Problems one might have with such a multivariate meta analysis are: (1) Several effects estimated in one model could be correlated to each other but their correlation is seldom published and (2) an estimated effect in one model could be correlated to the corresponding effect in the other model due to similar model specification or the data set partly shared, but their correlation is not known. Situations like (2) happen often in military recruiting studies. We employ a Monte‐Carlo simulation to evaluate how neglecting such potential correlation affects the result of a multivariate meta analysis in terms of Type I, Type II errors, and MSE. Simulation results indicate that such effect is not significant. What matters is rather the size of the variance component due to random error in multivariate effects. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 500–510, 2000. 相似文献
855.
Linxiong Li 《海军后勤学研究》2000,47(6):521-530
Suppose that some components are initially operated in a certain condition and then switched to operating in a different condition. Working hours of the components in condition 1 and condition 2 are respectively observed. Of interest is the lifetime distribution F of the component in the second condition only, i.e., the distribution without the prior exposure to the first condition. In this paper, we propose a method to transform the lifetime obtained in condition 1 to an equivalent lifetime in condition 2 and then use the transformed data to estimate F. Both parametric and nonparametric approaches each with complete and censored data are discussed. Numerical studies are presented to investigate the performance of the method. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 521–530, 2000 相似文献
856.
经典的数字信道化思想的实施都是建立在一组硬件滤波器构成的并行多路,虽然能实时处理,但随着处理数据带宽的增大和子信道频率分辨率的增加,设备开销将线性增长,整体可靠性也必然下降.基于信号的检测理论,在利用时频分析工具得到的时频图上进行信号检测,提出了检测去噪法.针对宽带数据背景噪声的特点,提出了噪声基底的3种估计算法:去大留小法、对数统计法和频移均值法,并线面结合对噪声基底进行平滑,实现了天电干扰的去除.通过实际接收到的某短波信号检验,证明了算法的有效性. 相似文献
857.
通过对有约束的Hartley域自适应算法、频域自适应算法及时域自适应算法用于自适应降噪系统的计算机仿真研究 ,认为在自适应通信降噪中采用基于Hartley变换的自适应算法较频域自适应算法及时域自适应算法性能更优、降噪效果更好 ,并在高速信号处理器TMS32 0C30上开发实现了该算法 .实验结果表明 ,将Hartley域自适应算法应用于通信降噪系统 ,方法实际可行 相似文献
858.
考虑摩擦时Diesel循环功率效率特性新析 总被引:3,自引:1,他引:2
对有摩擦时Diesel循环进行了有限时间热力学分析 .导出功率和压缩比、效率和压缩比的新关系式 ,进而得到功率效率关系 ,并进行了计算和讨论 ,给出一些有益的结论 相似文献
859.
In this paper we study strategies for better utilizing the network capacity of Internet Service Providers (ISPs) when they are faced with stochastic and dynamic arrivals and departures of customers attempting to log‐on or log‐off, respectively. We propose a method in which, depending on the number of modems available, and the arrival and departure rates of different classes of customers, a decision is made whether to accept or reject a log‐on request. The problem is formulated as a continuous time Markov Decision Process for which optimal policies can be readily derived using techniques such as value iteration. This decision maximizes the discounted value to ISPs while improving service levels for higher class customers. The methodology is similar to yield management techniques successfully used in airlines, hotels, etc. However, there are sufficient differences, such as no predefined time horizon or reservations, that make this model interesting to pursue and challenging. This work was completed in collaboration with one of the largest ISPs in Connecticut. The problem is topical, and approaches such as those proposed here are sought by users. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:348–362, 2001 相似文献
860.
James Flynn 《海军后勤学研究》2001,48(5):430-449
Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every Tj periods, one reviews the current stock level of item j and decides on deliveries for each of the next Tj periods, thus incurring an item‐by‐item fixed cost kj. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T1, T2, …, TN and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001 相似文献