全文获取类型
收费全文 | 407篇 |
免费 | 4篇 |
出版年
2019年 | 13篇 |
2018年 | 12篇 |
2017年 | 15篇 |
2016年 | 12篇 |
2015年 | 3篇 |
2014年 | 8篇 |
2013年 | 140篇 |
2012年 | 3篇 |
2010年 | 7篇 |
2009年 | 3篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 11篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 7篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 7篇 |
1977年 | 2篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 5篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 4篇 |
1967年 | 4篇 |
排序方式: 共有411条查询结果,搜索用时 15 毫秒
381.
John Gooch 《Defense & Security Analysis》1987,3(4):377-378
Some Principles of Maritime Strategy. Julian S. Corbett. Longmans, London, 1911 相似文献
382.
It is proposed to describe multiple air-to-air combat having a moderate number of participants with the aid of a stochastic process based on end-game duels. A simple model describing the dominant features of air combat leads to a continuous time discrete-state Markov process. Solution of the forward Kolmogorov equations enables one to investigate the influence of initial force levels and performance parameters on the outcome probabilities of the multiple engagement. As is illustrated, such results may be useful in the decision-making process for aircraft and weapon system development planning. Some comparisons are made with Lanchester models as well as with a semi-Markov model. 相似文献
383.
In peacetime, base stock levels of spares are determined on the assumption of normal resupply from the depot. In the event of war, however, a unit must be prepared to operate from stock on hand for a period of time without being resupplied from the depot. This paper describes a mathematical model for determining such war reserve spares (WRS) requirements. Specifically, the model solves the following kind of optimization problem: find the least-cost WRS kits that will keep the probability of a stockout after K cannibalizations less than or equal to some target objective α. The user of the model specifies the number of allowable cannibalizations, and the level of protection that the kit is supposed to provide. One interesting feature of this model is that in the probability computation it takes into account the possiblility of utilizing normal base operating assets. Results of a sensitivity analysis indicate that if peacetime levels were explicitly taken into account when designing a WRS kit, a cost saving of nearly 40 percent could be effected without degrading base supply performance in wartime. 相似文献
384.
In recent years, some attention has been devoted to the application of techniques of control theory to inventory management. In particular, H. Vassian (1955) developed a model for a periodic review inventory system utilizing techniques of discrete variable servomechanisms to analyze the system in a cost-free structure. The resulting model is inherently deterministic, however, and emphasizes the control of inventory fluctuation about a safety level by selecting an appropriate order policy. Such an order policy is defined only up to an arbitrary method of forecasting customer demands. The present paper is a continuation of the model developed by Vassian in which exponential smoothing is used as a specific forecasting technique. Full recognition of the probabilistic nature of demand is taken into account and the requirement of minimizing expected inventory level is imposed. In addition, explicit formulas for the variance in inventory are derived as functions of the smoothing constant and the tradeoff between small variance and rapid system response is noted. Finally, in an attempt to remove the bias inherent in exponential smoothing, a modification of that technique is defined and discussed as an alternate forecasting method. 相似文献
385.
The loading problem involves the optimal allocation of n objects, each having a specified weight and value, to m boxes, each of specified capacity. While special cases of these problems can be solved with relative ease, the general problem having variable item weights and box sizes can become very difficult to solve. This paper presents a heuristic procedure for solving large loading problems of the more general type. The procedure uses a surrogate procedure for reducing the original problem to a simpler knapsack problem, the solution of which is then employed in searching for feasible solutions to the original problem. The procedure is easy to apply, and is capable of identifying optimal solutions if they are found. 相似文献
386.
Henrick John Malik 《海军后勤学研究》1976,23(2):339-343
In this paper the exact distribution of a linear function and the ratio of two independent linear functions of independent generalized gamma variables is given. 相似文献
387.
John W. Wingate 《海军后勤学研究》1974,21(2):299-306
In this paper, the existence of a saddle point for two-person zero-sum infinite games of a special type is proved. The games have continuous bilinear payoff functions and strategy sets which are convex, noncompact subsets of an infinite-dimensional vector space. The closures of the strategy sets are, however, compact. The payoff functions satisfy conditions which allow the use of dominance arguments to show that points in the closure of a strategy set are dominated by or are strategically equivalent to points in the strategy set itself. Combining the dominance arguments with a well-known existence theorem produces the main result of the paper. The class of games treated is an extension of a class studied by J. D. Matheson, who obtained explicit solutions for the saddle points by using necessary conditions. 相似文献
388.
389.
An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented. 相似文献
390.
John W. Mamer 《海军后勤学研究》1982,29(2):345-356
This article examines the short run total costs and long run average costs of products under warranty. Formulae for both consumer cost under warranty and producer profit are derived. The results in the case of the pro rata warranty correct a mistake appearing in Blischke and Scheuer [5]. We also show that expected average cost to both the producer and the consumer of a product under warranty depends on both the mean of the product lifetime distribution and on its failure rate. 相似文献