全文获取类型
收费全文 | 377篇 |
免费 | 9篇 |
出版年
2021年 | 7篇 |
2020年 | 4篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 7篇 |
2015年 | 5篇 |
2014年 | 4篇 |
2013年 | 57篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2005年 | 3篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 11篇 |
1990年 | 5篇 |
1989年 | 14篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 6篇 |
1984年 | 9篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 6篇 |
1972年 | 4篇 |
1971年 | 8篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 6篇 |
排序方式: 共有386条查询结果,搜索用时 15 毫秒
31.
The present article discusses the properties of the mean residual life function in a renewal process. We examine the relationship this function has with the failure rate function and the conventional mean, variance and coefficient of variation of residual life. We also discuss some monotonicity properties of the mean residual life function. A partial order based on the renewal mean residual function is introduced along with its interrelationship with some existing stochastic orders. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
32.
Dmitrii Usanov G.A. Guido Legemaate Peter M. van de Ven Rob D. van der Mei 《海军后勤学研究》2019,66(2):105-122
The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance. 相似文献
33.
Colin D. Robinson 《Defense & Security Analysis》2019,35(2):211-221
To engage properly with the Somali National Army, to understand it in the hope of improving stability and the lives of over 12 million Somalis, good basic information on its composition and characteristics is necessary. Authoritative accounts on the subject have been scarce for over 25 years. This account seeks to detail the army’s dispositions across southern Somalia, and, more importantly, the brigades’ clan compositions and linkages. Clan ties supersede loyalties to the central government. The army as it stands is a collection of former militias which suffer from ill-discipline and commit crime along with greater atrocities. Estimates of numbers are unreliable, but there might be 13,000 or more fighters in six brigades in the Mogadishu area and five beyond. 相似文献
34.
35.
This article is concerned with the scaling variant of Karmarkar's algorithm for linear programming problems. Several researchers have presented convergence analyses for this algorithm under various nondegeneracy types of assumptions, or under assumptions regarding the nature of the sequence of iterates generated by the algorithm. By employing a slight perturbation of the algorithm, which is computationally imperceptible, we are able to prove without using any special assumptions that the algorithm converges finitely to an ε-optimal solution for any chosen ε > 0, from which it can be (polynomically) rounded to an optimum, for ε > 0 small enough. The logarithmic barrier function is used as a construct for this analysis. A rounding scheme which produces an optimal extreme point solution is also suggested. Besides the non-negatively constrained case, we also present a convergence analysis for the case of bounded variables. An application in statistics to the L1 estimation problem and related computational results are presented. 相似文献
36.
The flow-shop scheduling problem with sequence-dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two-machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the method. 相似文献
37.
Marvin D. Troutt 《海军后勤学研究》1987,34(4):593-603
Multivariable elimination algorithms, which may be regarded as generalizations of various one-dimensional search procedures, have not found wide application. A probable reason may be the generally very irregularly shaped regions of uncertainty that evolve iteratively in the procedures. Hence hope for practical salvage of this class of algorithms seems to lie in controlling the shape of the successively smaller regions of uncertainty. In this article an extension of Bolzano search to rectangles which preserves rectangular iterates is given. Since the result is essentially geometrical in nature, a geometric proof of this procedure is given. Hopefully the proof procedure will be of independent interest. A numerical illustration of the procedure is given for a game problem, such problems lending themselves to this method. 相似文献
38.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
39.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
40.
In 2013, the staff of the U.S. Nuclear Regulatory Commission estimated the reduction of the off-site economic losses from a fire in a drained U.S. spent fuel pool if fuel that had cooled for more than five years were transferred to dry cask storage—an option it called “expedited transfer.” In this article, it is shown that the savings would be much higher than the NRC estimated. Savings increase to about $2 trillion if: losses beyond 50 miles are included; the land-contamination threshold for long-term population relocation is changed to that used for the Chernobyl and Fukushima accidents and recommended by the U.S. Environmental Protection Agency; and, based on the experience of Japan, decontamination of land areas to levels acceptable for population return is assumed to take at least four years. If expedited transfer were implemented, the off-site economic losses would be reduced by about 98%. 相似文献