全文获取类型
收费全文 | 486篇 |
免费 | 6篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2017年 | 10篇 |
2016年 | 11篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 63篇 |
2012年 | 22篇 |
2011年 | 26篇 |
2010年 | 22篇 |
2009年 | 15篇 |
2008年 | 28篇 |
2007年 | 13篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2002年 | 4篇 |
2001年 | 4篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1989年 | 14篇 |
1988年 | 4篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 7篇 |
1984年 | 2篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1975年 | 10篇 |
1974年 | 3篇 |
1973年 | 2篇 |
1972年 | 13篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 10篇 |
1968年 | 8篇 |
1967年 | 2篇 |
1966年 | 3篇 |
排序方式: 共有492条查询结果,搜索用时 187 毫秒
31.
Timothy C. Barkdoll Donald P. Gaver Kevin D. Glazebrook Patricia A. Jacobs Sergio Posadas 《海军后勤学研究》2002,49(8):723-742
Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046 相似文献
32.
James L. Cook 《Journal of Military Ethics》2016,15(4):321-324
33.
A linear-programming-based method for determining whether or not n demand points are on a hemisphere
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc. 相似文献
34.
35.
Assessing the effects of changes in weapons systems or battle tactics is difficult because of the variations in battles and the resulting instability of measures of combat effectiveness. Even under the relatively stable conditions of designed combat exercises, traditional measures may fail to reflect important battle events and dynamics. This variation in results makes the design, conduct, and evaluation of combat experiments, combat simulations, and combat training exercises a challenging endeavor, indeed. We develop and examine a combat measure of effectiveness, based on Lanchester models, which we call the battle trace. The battle trace is a measure of ongoing battle results, measured as a function of time into the battle. We describe how such measures might contribute to assessing effects of changing certain battle parameters. We suggest applications of these ideas to developing combat simulations and to enhancing combat training exercises. 相似文献
36.
37.
Victoria L. Zhang 《海军后勤学研究》1996,43(5):691-708
This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc. 相似文献
38.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc. 相似文献
39.
We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc. 相似文献
40.
Consider the problem of estimating the reliability of a series system of (possibly) repairable subsystems when test data and historical information are available at the component, subsystem, and system levels. Such a problem is well suited to a Bayesian approach. Martz, Waller, and Fickas [Technometrics, 30 , 143–154 (1988)] presented a Bayesian procedure that accommodates pass/fail (binomial) data at any level. However, other types of test data are often available, including (a) lifetimes of nonrepayable components, and (b) repair histories for repairable subsystems. In this article we describe a new Bayesian procedure that accommodates pass/fail, life, and repair data at any level. We assume a Weibull model for the life data, a censored Weibull model for the pass/fail data, and a power-law process model for the repair data. Consequently, the test data at each level can be represented by a two-parameter likelihood function of a certain form, and historical information can be expressed using a conjugate family of prior distributions. We discuss computational issues, and use the procedure to analyze the reliability of a vehicle system. © 1994 John Wiley & Sons, Inc. 相似文献