全文获取类型
收费全文 | 472篇 |
免费 | 109篇 |
国内免费 | 13篇 |
出版年
2024年 | 1篇 |
2022年 | 3篇 |
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 19篇 |
2018年 | 6篇 |
2017年 | 22篇 |
2016年 | 27篇 |
2015年 | 20篇 |
2014年 | 18篇 |
2013年 | 81篇 |
2012年 | 34篇 |
2011年 | 35篇 |
2010年 | 31篇 |
2009年 | 36篇 |
2008年 | 33篇 |
2007年 | 42篇 |
2006年 | 38篇 |
2005年 | 26篇 |
2004年 | 27篇 |
2003年 | 17篇 |
2002年 | 18篇 |
2001年 | 17篇 |
2000年 | 13篇 |
1999年 | 7篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 3篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有594条查询结果,搜索用时 31 毫秒
511.
512.
513.
狭长受限空间火灾临界可燃距离实验研究 总被引:1,自引:1,他引:0
油料洞库的安全一直是各级主管部门非常关心的问题。狭长受限空间是地下建筑及地下油料洞库的关键结构,针对狭长受限空间发生火灾能否持续燃烧问题,在公称直径分别为50mm、100mm、150mm和250mm的模拟狭长受限空间上,以柴油作为燃烧工质,置于尺寸、形状各异的3种油盘中,进行了系统实验研究与分析,证实了狭长受限空间临界可燃距离的存在,并在此基础上,提出了计算方法,得出一些有益的结论,对研究油料洞库消防新技术有一定的价值。 相似文献
514.
采用数值模拟技术研究了由3种不同截面形状的钨芯外包覆一层钢,形成的钢包覆层复合长杆弹在入射速度为1200m/s~1700m/s时对陶瓷/金属复合靶板的侵彻过程。结果表明:对于同一入射速度、相同弹体长度、同种材料的弹芯和包覆层以及靶板材料而言,等面积的六边形截面钨芯复合长杆弹的侵彻深度明显大于圆形及方形截面,方形及六边形截面与和它们等外接圆形成的圆形截面复合长杆弹侵彻深度没有明显差别,本研究认为这是与不同截面钨芯的外接圆直径直接相关。六边形截面长杆弹侵彻过程中的自锐化现象是其侵彻深度明显大于其它两种弹体的主要原因。 相似文献
515.
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 相似文献
516.
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 相似文献
517.
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. 相似文献
518.
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 相似文献
519.
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 相似文献
520.
Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001 相似文献