全文获取类型
收费全文 | 214篇 |
免费 | 12篇 |
出版年
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 9篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 3篇 |
2013年 | 41篇 |
2011年 | 5篇 |
2009年 | 2篇 |
2008年 | 3篇 |
2007年 | 5篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 3篇 |
1999年 | 9篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 4篇 |
1975年 | 1篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 2篇 |
1971年 | 5篇 |
1970年 | 2篇 |
1969年 | 2篇 |
1968年 | 4篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有226条查询结果,搜索用时 15 毫秒
161.
T. U. Zahle 《海军后勤学研究》1971,18(2):283-293
To find the hit probability for a series of correlated shots is, with conventional methods, a very tedious job even for the simplest statistical distributions. Experimental data, however, commonly show the shots lying chain-like on smooth curves about the target. For this case this paper introduces a new method of finding the hit probability without the use of correlation coefficients. The method is based on a transformation, where the target is transformed into a point and each bullet into an area the size of the target. 相似文献
162.
This paper presents a method for modeling cyclic inputs to a congested system in a discrete event digital simulation. Specifically, we express the mean of the interarrival time conditional on the last arrival as a linear combination of harmonic components whose coefficients can be determined by stepwise regression. We also assume that the conditional interarrival time normalized by its corresponding mean follows a distribution that is independent of time. The result can, in turn, be used to generate the desired input for a simulation, An example based on a set of actual data is used to illustrate the process of parameter estimation for the model. 相似文献
163.
In multi-commodity inventory systems with variable setup costs, the mixed ordering policy assumes that commodities may be ordered either individually, or may be arbitrarily grouped for joint ordering. Thus, for a two-commodity system, commodity one or commodity two or commodities one and two may be ordered incurring respectively fixed order costs of K, K1, or K2, where max (K1, K2) ≤ K ≤ K1 + K2, This paper considers a two-commodity periodic review system. The stationary characteristics of the system are analyzed, and, for a special case, explicit solutions are obtained for the distribution of the stock levels at the beginning of the periods. In a numerical example, optimal policy variables are computed, and the mixed ordering policy is compared with individual and joint ordering policies. 相似文献
164.
A nonparametric selection procedure ??bs was proposed by Bechhofer and Sobel (1958) and studied by Dudewicz (1971) in comparison with other procedures under normal and uniform alternatives. He found ??BS always required larger sample sizes, sometimes substantially so. For 2-point populations we find more extreme results. We also find that ??BS may be substantially better than reasonable competitors designed specifically for 2-point populations. Finally, a new nonparametric selection procedure (conjectured to be better than ??BS) is proposed. 相似文献
165.
166.
We consider the problem of temporal expansion of the capacity of, say, a plant or road given estimates of its desired usage (demand). The basic problem is: given a sequence of predicted demands for N time periods, determine the optimal investment decision in each period to minimize a linear investment cost and a strictly convex cost of capacity. The relationship between capacity and the investment decisions is assumed to be linear, but time varying. Constraints on both the individual decisions and on the sum of the decisions are considered. An algorithm for solving this problem is derived. 相似文献
167.
168.
169.
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. 相似文献
170.
Edward A Silver 《海军后勤学研究》1979,26(1):141-151
We consider a group (or family) of items having deterministic, but time-varying, demand patterns. The group is defined by a setup-cost structure that makes coordination attractive (a major setup cost for each group replenishment regardless of how many of the items are involved). The problem is to determine the timing and sizes of the replenishments of all of the items so as to satisfy the demand out to a given horizon in a cost-minimizing fashion. A dynamic programming formulation is illustrated for the case of a two-item family. It is demonstrated that the dynamic programming approach is computationally reasonable, in an operational sense, only for small family sizes. For large families heuristic solution methods appear necessary. 相似文献