全文获取类型
收费全文 | 911篇 |
免费 | 28篇 |
出版年
2020年 | 8篇 |
2019年 | 18篇 |
2017年 | 24篇 |
2016年 | 17篇 |
2015年 | 22篇 |
2014年 | 21篇 |
2013年 | 171篇 |
2011年 | 8篇 |
2010年 | 10篇 |
2009年 | 15篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 13篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 20篇 |
1997年 | 15篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 27篇 |
1993年 | 22篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 20篇 |
1987年 | 22篇 |
1986年 | 18篇 |
1985年 | 18篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 16篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 15篇 |
1976年 | 12篇 |
1975年 | 13篇 |
1974年 | 15篇 |
1973年 | 12篇 |
1972年 | 17篇 |
1971年 | 10篇 |
1970年 | 11篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 9篇 |
排序方式: 共有939条查询结果,搜索用时 15 毫秒
241.
Christopher C. Locksley Marjan Male ic MSc Tim Ripley 《Defense & Security Analysis》1993,9(3):357-361
Winning the Next War: Innovation and the Modern Military. By Stephen Peter Rosen. Cornell Studies in Security Affairs, Cornell University Press, New York (1991), ISBN 0-8014-2566-5. Price £40.00
Post-Military Society. By Martin Shaw. Polity Press, Cambridge (1991), ISBN 0-7456-01987 (hardback) £35.00,0-7456-01995 (paperback) £11.95
Big Boys' Rules—The Secret War Against the IRA. By Mark Urban. Faber and Faber, London (1992), ISBN 0-571-16112-X, £14.99 相似文献
Post-Military Society. By Martin Shaw. Polity Press, Cambridge (1991), ISBN 0-7456-01987 (hardback) £35.00,0-7456-01995 (paperback) £11.95
Big Boys' Rules—The Secret War Against the IRA. By Mark Urban. Faber and Faber, London (1992), ISBN 0-571-16112-X, £14.99 相似文献
242.
Results of Geoffrion for efficient and properly efficient solutions of multiobjective programming problems are extended to multiobjective fractional programming problems. Duality relationships are given for these problems where the functions are generalized convex or invex. 相似文献
243.
本文根据附面层理论,对高速气流中的液滴,因气流和液滴表面相互作用而产生的气动剥离现象进行了分析,建立了气液两相附面层耦合问题的理论分析模型,得到了发生气动剥离时的最小气流速度的计算公式,为液体燃料在高速气流申雾化机理研究提供参考。 相似文献
244.
We consider optimal test plans involving life distributions with failure‐free life, i.e., where there is an unknown threshold parameter below which no failure will occur. These distributions do not satisfy the regularity conditions and thus the usual approach of using the Fisher information matrix to obtain an optimal accelerated life testing (ALT) plan cannot be applied. In this paper, we assume that lifetime follows a two‐parameter exponential distribution and the stress‐life relationship is given by the inverse power law model. Near‐optimal test plans for constant‐stress ALT under both failure‐censoring and time‐censoring are obtained. We first obtain unbiased estimates for the parameters and give the approximate variance of these estimates for both failure‐censored and time‐censored data. Using these results, the variance for the approximate unbiased estimate of a percentile at a design stress is computed and then minimized to produce the near‐optimal plan. Finally, a numerical example is presented together with simulation results to study the accuracy of the approximate variance given by the proposed plan and show that it outperforms the equal‐allocation plan. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 169–186, 1999 相似文献
245.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
246.
Consider a simulation experiment consisting of v independent vector replications across k systems, where in any given replication one system is selected as the best performer (i.e., it wins). Each system has an unknown constant probability of winning in any replication and the numbers of wins for the individual systems follow a multinomial distribution. The classical multinomial selection procedure of Bechhofer, Elmaghraby, and Morse (Procedure BEM) prescribes a minimum number of replications, denoted as v*, so that the probability of correctly selecting the true best system (PCS) meets or exceeds a prespecified probability. Assuming that larger is better, Procedure BEM selects as best the system having the largest value of the performance measure in more replications than any other system. We use these same v* replications across k systems to form (v*)k pseudoreplications that contain one observation from each system, and develop Procedure AVC (All Vector Comparisons) to achieve a higher PCS than with Procedure BEM. For specific small-sample cases and via a large-sample approximation we show that the PCS with Procedure AVC exceeds the PCS with Procedure BEM. We also show that with Procedure AVC we achieve a given PCS with a smaller v than the v* required with Procedure BEM. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 459–482, 1998 相似文献
247.
This paper considers the maintenance of aircraft engine components where economies exist for joint replacement because (a) the aircraft must be pulled from service for maintenance and (b) repair of some components requires removal and disassembly of the engine. It is well known that the joint replacement problem is difficult to solve exactly, because the optimal solution does not have a simple structured form. Therefore, we formulate three easy-to-implement heuristics and test their performance against a lower bound for various numerical examples. One of our heuristics, the base interval approach, in which replacement cycles for all components are restricted to be multiples of a specified interval, is shown to be robustly accurate. Moreover, this heuristic is consistent with maintenance policies used by commercial airlines in which periodic maintenance checks are made at regular intervals. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 435–458, 1998 相似文献
248.
J. S. Dagpunar 《海军后勤学研究》1998,45(4):391-405
We consider a general repair process where the virtual age Vi after the ith repair is given by Vi = ϕ(Vi−1 + Xi), ϕ(·) is a specified repair functional, and Xi is the time between the (i − 1)th and ith repair. Some monotonicity and dominance properties are derived, and an equilibrium process is considered. A computational method for evaluating the expected number/density of repairs is described together with an approximation method for obtaining some parameters of the equilibrium process. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 391–405, 1998 相似文献
249.
This article investigates inference for pmax, the largest cell probability in multinomial trials for the case of a small to moderate number of trials. Emphasis focuses on point and interval estimation. Both frequentist and Bayesian approaches are developed. The results of extensive simulation investigation are included as well as the analysis of a set of crime data for the city of New Orleans taken from the National Crime Survey. 相似文献
250.
This article shows how to determine the stationary distribution of the virtual wait in M/G/1 queues with either one-at-a-time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately preceding service time or of whether the server finds the system empty after returning from vacation. In this way, it is possible to model situations such as long service times followed by short vacations, and vice versa. For the second type of dependence, the vacation time assigned to an arrival to follow its service is a function of the level of virtual wait reached. By this device, we can model situations in which vacations may be shortened whenever virtual delays have gotten excessive. The method of analysis employs level-crossing theory, and examples are given for various cases of service and vacation-time distributions. A closing discussion relates the new model class to standard M/G/1 queues where the service time is a sum of variables having complex dependencies. © 1992 John Wiley & Sons, Inc. 相似文献