全文获取类型
收费全文 | 582篇 |
免费 | 14篇 |
出版年
2021年 | 11篇 |
2019年 | 24篇 |
2018年 | 12篇 |
2017年 | 16篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 14篇 |
2013年 | 137篇 |
2009年 | 6篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 5篇 |
2000年 | 9篇 |
1998年 | 11篇 |
1997年 | 16篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 11篇 |
1993年 | 4篇 |
1992年 | 7篇 |
1991年 | 13篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 9篇 |
1987年 | 16篇 |
1986年 | 10篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 7篇 |
1970年 | 8篇 |
1969年 | 7篇 |
1968年 | 6篇 |
1967年 | 8篇 |
排序方式: 共有596条查询结果,搜索用时 15 毫秒
561.
Tuncel M. Yegulalp 《海军后勤学研究》1975,22(4):697-712
This paper introduces a special control chart procedure for exponentially distributed product life. Statistical control of product life in manufacturing requires continuing life tests of manufactured product so as to detect changes in product life and take appropriate corrective action. These life testing experiments may become exceedingly time consuming and thus can be both impractical because of serious time delays in implementing corrective action on the process when indicated, and quite uneconomical. It is desirable to inquire into the character of life testing by means of a control chart procedure based on the real time to first failure within given samples. Measuring the real minimum life provides a considerable reduction in duration of the testing procedure and in the number of specimens destroyed, yielding a considerable economy over the Shewhart's X control chart. 相似文献
562.
This paper considers the search for an evader concealed in one of an arbitrary number of regions, each of which is characterized by its detection probability. We shall be concerned here with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move; his aim is to maximize the expected time to detection, while the searcher attempts to minimize it. The situation where two regions are involved has been studied previously and reported on recently. This paper represents a continuation of this analysis. It is normally true that as the number of regions increases, optimal strategies for both searcher and evader are progressively more difficult to determine precisely. However it will be shown that, generally, satisfactory approximations to each are almost as easily derived as in the two region problem, and that the accuracy of such approximations is essentially independent of the number of regions. This means that so far as the evader is concerned, characteristics of the two-region problem may be used to assess the accuracy of such approximate strategies for problems of more than two regions. 相似文献
563.
We consider the multiple-attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W . Comparisons are made with another criterion already presented, the comparative hyper-volume criterion, and two small examples are presented. 相似文献
564.
565.
Detailed combat simulations can produce effectiveness tables which measure the effectiveness of each weapon class on one side of an engagement, battle, or campaign to each weapon class on the other. Effectiveness tables may also be constructed in other ways This paper assumes that effectiveness tables are given and shows how to construct from them a system of weapon weights each of which is a weighted average of the effects of a given weapon against each of the enemy's weapons. These weights utilize the Perron- Frobenius theory of eigenvectors of nonnegative matrices. Methods of calculation are discussed and some interpretations are given for both the irreducible and reducible cases. 相似文献
566.
The transportation model with supplies (Si) and demands (Di) treated as bounded variables developed by Charnes and Klingman is extended to the case where the Si and Di are independently and uniformly distributed random variables. Chance constraints which require that demand at the jth destination will be satisfied with probability at least βi and that stockout at the ith origin will occur with probability less than αi are imposed. Conversion of the chance constraints to their linear equivalents results in a transportation problem with one more row and column than the original with some of the new arcs capacitated. The chance-constrained formulation is extended to the transshipment problem. 相似文献
567.
A. M. Geoffrion 《海军后勤学研究》1977,24(2):201-212
A complete logistical planning model of a firm or public system should include activities having to do with the procurement of supplies. Not infrequently, however, procurement aspects are difficult to model because of their relatively complex and evanescent nature. This raises the issue of how to build an overall logistics model in spite of such difficulties. This paper offers some suggestions toward this end which enable the procurement side of a model to be simplified via commodity aggregation in a “controlled” way, that is, in such a manner that the modeler can know and control in advance of solving his model how much loss of accuracy will be incurred for the solutions to the (aggregated) overall model. 相似文献
568.
K. M. Mjelde 《海军后勤学研究》1977,24(4):639-650
The paper describes an approach to the evaluation of the effectiveness of a minefield in terms of the number of mines that are detonated by a convoy of sweepers and ships and the corresponding number of vessels that are immobilized. The positions of the mines and the tracks of the vessels are assumed to be known, which means that the evaluation measures are dependent on a large number of disjoint events, each event being the immobilization of particular vessels by particular mines. This may render combinatorial methods computationally infeasible, but by introducing approximations in the assumptions, the difficulty can be overcome, specifically by modelling the arrival of each individual vessel in the neighborhood of a mine by an inhomogeneous Poisson stream for which the arrival rate is nonzero only over a short time interval. The plausibility of the approach is supported by results of a critical-event simulation model. 相似文献
569.
This paper investigates the problem of choosing between two simple hypothesis, H0 and H1, in terms of independent, identically distributed random variables, when observations can be taken in groups. At any stage in the decision process it must be decided whether to stop and take action now or to continue, in which case the size of the next group of observations must be decided upon. The problem is to find an optimal procedure incorporating a stopping, group size (batch) and terminal action rule. It is proven, in general, that the optimal stopping and terminal action rule is of the sequential probability ratio type (SPRT). Fixed stopping rules of the SPRT type are studied and an iterative procedure of the policy improvement type, both with and without a value determination step, is developed. It is shown, for the general situation, that both the average risk and scheduling rule converge to the optima. Also, six suboptimal scheduling rules are considered with respect to the average risks they achieve. Numerical results are presented to illustrate the effectiveness of the procedures. 相似文献
570.
Gary M. Roodman 《海军后勤学研究》1974,21(4):595-607
This paper develops a method for doing postoptimality analysis on the mixed integer programming problem. The proposed procedures form a natural adjunct to enumerative I.P. algorithms that are linear programming based, and they are designed, in effect, to capitalize on insights generated as the problem is initially solved to do subsequent analysis upon it. In particular, limited ranging analysis is possible on selected parameters, as is the efficient resolving of the problem following parameter changes. 相似文献