全文获取类型
收费全文 | 606篇 |
免费 | 18篇 |
出版年
2020年 | 5篇 |
2019年 | 9篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 8篇 |
2013年 | 122篇 |
2011年 | 6篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 15篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 14篇 |
1987年 | 13篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 12篇 |
1974年 | 11篇 |
1973年 | 11篇 |
1972年 | 13篇 |
1971年 | 13篇 |
1970年 | 6篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 6篇 |
1948年 | 5篇 |
排序方式: 共有624条查询结果,搜索用时 0 毫秒
441.
An extended logistic system is a well-defined configuration of equipment, modules, inventories, and repair and replacement facilities modeling a complex, repairable system with on-going repair. The design of such systems has been based largely on the static tools of inventory theory and reliability theory, i.e., on steady-state distributions and on associated means and variances. Such static tools suppress the scale of real lime and ignore system persistence time in up-states and persistence time in down-states. A reasonably simple dynamic methodology is presented, focusing on system failure time as a more meaningful objective function for system-design tradeoff studies. In the presence of good reliability, it is shown that different candidates for system failure time effectively merge to yield an unambiguous, single system failure time. Examples illustrating the importance of dynamic information for system design are given. 相似文献
442.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed. 相似文献
443.
Robert W. Rosenthal 《海军后勤学研究》1980,27(2):231-232
An example of a network with flow costs depending on congestion is presented for which no system of tolls and subsidies exists which can ensure that all equilibria in the game of route selection are Pareto optimal. 相似文献
444.
Randolph F. C. Shen 《海军后勤学研究》1980,27(2):335-344
In 1973 the Defense Department made plans to close many Navy bases in the United States. Hardest hit was Rhode Island which would suffer a loss of 45.61% of the total cutback of 42,812 jobs. This paper describes two models which were built to forecast the severity of the economic impact in Rhode Island: one used the reduced form equation approach, and the other the simultaneous equations system approach. Tests on multicollinearity, specification, and serial correlation were conducted. An ex post evaluation of these two models' performance in forecasting then concludes the paper. 相似文献
445.
446.
William C. Guenther 《海军后勤学研究》1972,19(2):309-333
A review of univariate tolerance intervals is presented from an application-oriented point of view. Both β-content and β-expectation intervals are defined and considered. Standard problems are discussed for the distribution-free case and with various distributional assumptions (normal, gamma, Poisson) which occur most frequently in practice. The determination of sample size is emphasized. A number of examples are used to illustrate the types of problems which permit solutions with the excellent tables now available. 相似文献
447.
C. B. Millham 《海军后勤学研究》1972,19(4):709-714
This work is concerned primarily with presenting techniques for constructing bimatrix games with predetermined equilibrium points. Some partial results on Nash-solvability are also given. 相似文献
448.
Calvin W. Sweat 《海军后勤学研究》1972,19(2):355-367
An attacker, being one of two types, initiates an attack at some time in the interval [-T, 0]. The a priori probabilities of each type are known. As time elapses the defender encounters false targets which occur according to a known Poisson process and which can be properly classified with known probability. The detection and classification probabilities for each type attacker are given. If the defender responds with a weapon at the time of attack, he survives with a probability which depends on the number of weapons in his possession and on attacker type. If he does not respond, his survival probability is smaller. These probabilities are known, as well as the current number of weapons in the defender's possession. They decrease as the number of weapons decreases. The payoff is the defender's survival probability. An iterative system of first-order differential equations is derived whose unique solution V1(t),V2(t),…,Vk(t) is shown to be the value of the game at time t, when the defender has 1, 2,…, k,… weapons, respectively. The optimal strategies are determined. Limiting results are obtained as t→-∞, while the ratio of the number of weapons to the expected number of false targets remaining is held constant. 相似文献
449.
In recent years many large government and commercial organizations have developed large-scale management information systems. During the early phases of any system development, questions are likely to be raised concerning the criteria of completeness and accuracy of the data. How to respond to these questions is difficult, and represents the general subject of this paper. In particular, this paper describes the application of statistical techniques, namely, various kinds of multivariate data analysis, to the problem of assessing the quality of a large-scale data collection system in the U. S. Navy. Results of using these techniques are described and indicate their usefulness as auditing procedures. While the discussion is placed in a particular context, the procedures should be of value for other large-scale information systems. 相似文献
450.
Richard C. Grinold 《海军后勤学研究》1972,19(1):123-136
Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0. 相似文献