全文获取类型
收费全文 | 385篇 |
免费 | 7篇 |
出版年
2021年 | 7篇 |
2019年 | 11篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 7篇 |
2015年 | 2篇 |
2014年 | 8篇 |
2013年 | 55篇 |
2012年 | 3篇 |
2009年 | 4篇 |
2007年 | 12篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 14篇 |
1987年 | 7篇 |
1986年 | 14篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 10篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 9篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有392条查询结果,搜索用时 31 毫秒
261.
Hemiter's entropy model for brand purchase behavior has been generalized for Renyi's measure of entropy which is a more general concept than Shannon's measure of entropy used by Herniter and which includes Shannon's measure as a limiting case. The generalized model considered here is more flexible than Herniter's model since it can give different marketing statistics for different products and it can give these statistics even when only some of the brands are considered. 相似文献
262.
From an original motivation in quantitative inventory modeling, we develop methods for testing the hypothesis that the service times of an M/G/1 queue are exponentially distributed, given a sequence of observations of customer line and/or system waits. The approaches are mostly extensions of the well-known exponential goodness-of-fit test popularized by Gnedenko, which results from the observation that the sum of a random exponential sample is Erlang distributed and thus that the quotient of two independent exponential sample means is F distributed. 相似文献
263.
Consider a system consisting of n separately maintained independent components where the components alternate between intervals in which they are “up” and in which they are “down”. When the ith component goes up [down] then, independent of the past, it remains up [down] for a random length of time, having distribution Fi[Gi], and then goes down [up]. We say that component i is failed at time t if it has been “down” at all time points s ?[t-A.t]: otherwise it is said to be working. Thus, a component is failed if it is down and has been down for the previous A time units. Assuming that all components initially start “up,” let T denote the first time they are all failed, at which point we say the system is failed. We obtain the moment-generating function of T when n = l, for general F and G, thus generalizing previous results which assumed that at least one of these distributions be exponential. In addition, we present a condition under which T is an NBU (new better than used) random variable. Finally we assume that all the up and down distributions Fi and Gi i = l,….n, are exponential, and we obtain an exact expression for E(T) for general n; in addition we obtain bounds for all higher moments of T by showing that T is NBU. 相似文献
264.
Gabriel R. Bitran 《海军后勤学研究》1979,26(4):689-693
In this paper we present the results of a limited number of experiments with linear fractional problems. Six solution procedures were tested and the results are expressed in the number of simplex-like pivots required to solve a sample of twenty problems randomly generated. 相似文献
265.
John Pimlott R. Durward RMAS Camberley Christopher Clapham 《Defense & Security Analysis》1994,10(2):233-237
Small Wars Manual. United States Marine Corps 1940, with introduction by Ronald Schaffer, Sunflower University Press, Manhattan, Kansas, (1990), ISBN: 0-89745-112-0.
Military Mindlessness: an Informal Compendium. Edited by Raymond Horricks. Transaction Publishers, New Brunswick and London, (1993), ISBN: 1-56000-105-4. Price $26.95
Sipri Yearbook 1993: World Armaments and Disarmament, Oxford University Press, Oxford, (1993) ISBN 0-19-829166-3 - Price £50.00
Nigeria: The Politics of Adjustment and Democracy. By Julius O. Ihonvbere. Transaction Publishers, London & New Brunswick (1994), ISBN 1-56000-093-7, Price £34.95 相似文献
Military Mindlessness: an Informal Compendium. Edited by Raymond Horricks. Transaction Publishers, New Brunswick and London, (1993), ISBN: 1-56000-105-4. Price $26.95
Sipri Yearbook 1993: World Armaments and Disarmament, Oxford University Press, Oxford, (1993) ISBN 0-19-829166-3 - Price £50.00
Nigeria: The Politics of Adjustment and Democracy. By Julius O. Ihonvbere. Transaction Publishers, London & New Brunswick (1994), ISBN 1-56000-093-7, Price £34.95 相似文献
266.
Donald R. Wridman 《海军后勤学研究》1967,14(4):559-568
A “circulating system” is a finite collection of objects, each of which is oscillaling between two states. The prototype system is that of ships on patrcl,each subject to a quasi-regular “duty-service” cycle. There are various restrictions on the time spent in either state by an object and on the number of objects in a state at any one time. Schedules are sought in which the total number in one state is as large and as constant as possible. The maximal average number in one state is calculated, and a necessary and sufficient condition is given for a schedule to achieve it. Procedures are developed for constructing a schedule which achieves the maximal average in the most constant manner. 相似文献
267.
268.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
269.
270.
Satellite constellation design for forest fire monitoring via a stochastic programing approach
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios. 相似文献