全文获取类型
收费全文 | 303篇 |
免费 | 14篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 8篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 59篇 |
2012年 | 5篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有318条查询结果,搜索用时 15 毫秒
291.
Military Standard 105D has been almost universally adopted by government and private consumers for the lot-by-lot sampling inspection of product which may be inspected on a dichotomoun basis The plan specifies, for each lot size, a random sample size and set of acceptance numbers (maximum allowable number of defectives in each sample). The acceptance numbers are based upon the binomial distribution and depend upon the quality required by the purchaser. Where several consecutive lots are submitted, a shift to less severe (“reduced”) inspection or more severe (“tightened”) inspection is specified when the ongoing quality is very high or low. Further experience permits a return to normal sampling from either of these states This paper examines the long range costs of such a sampling scheme. The three inspection types are considered as three distinct Markov chains, with periodic transitions from chain to chain. The expected sample size and the expected proportion of rejected product are determined as a function of the two parameters under control of the manufacturer, lot size and product quality. Some numerical examples are given which illustrate how to compute the overall cost of sampling inspection. Suggestions are made concerning the choice of parameters to minimize this cost. 相似文献
292.
293.
An empirical Bayes estimator is given for the scale parameter in the two-parameter Weibull distribution. The scale parameter is assumed to vary randomly throughout a sequence of experiments according to a common, but unknown, prior distribution. The shape parameter is assumed to be known, however, it may be different in each experiment. The estimator is obtained by means of a continuous approximation to the unknown prior density function. Results from Monte Carlo simulation are reported which show that the estimator has smaller mean-squared errors than the usual maximum-likelihood estimator. 相似文献
294.
Claude G. Henin 《海军后勤学研究》1973,20(3):395-403
In the present paper, we solve the following problem: Determine the optimum redundancy level to maximize the expected profit of a system bringing constant returns over a time period T; i. e., maximize the expression \documentclass{article}\pagestyle{empty}\begin{document}$ P\int_0^T {Rdt - C} $\end{document}, where P is the return of the system per unit of time, R the reliability of this system, C its cost, and T the period for which the system is supposed to work We present theoretical results so as to permit the application of a branch and bound algorithm to solve the problem. We also define the notion of consistency, thereby determining the distinction of two cases and the simplification of the algorithm for one of them. 相似文献
295.
James G. Taylor 《海军后勤学研究》1976,23(2):345-352
A “local” condition of winning (in the sense that the force ratio is changing to the advantage of one of the combatants) is shown to apply to all deterministic Lanchester-type models with two force-level variables. This condition involves the comparison of only the force ratio and the instantaneous force-change ratio. For no replacements and withdrawals, a combatant is winning “instantaneously” when the force ratio exceeds the differential casualty-exchange ratio. General outcome-prediction relations are developed from this “local” condition and applied to a nonlinear model for Helmbold-type combat between two homogeneous forces with superimposed effects of supporting fires not subject to attrition. Conditions under which the effects of the supporting fires “cancel out” are given. 相似文献
296.
Research and development activities in a business firm or government laboratory are portrayed as a multi-stage information generation and conversion process. A “basic research” phase generates opportunities, in the form of findings in a set of scientific disciplines, which are available for subsequent exploitation. It is assumed that increments to information in a subject area are stochastic, proportional to the amount of knowledge which already exists in the area, and have values which are randomly distributed. An “exploratory development” phase is viewed as a process of selecting a subset of alternative research opportunities, improving each opportunity in the direction of its applications, estimating the value of the improved opportunity and using these estimates to choose the exploratory development results to be implemented in engineering development. The “engineering development” phase makes the value of exploratory results realizable without changing value or risk. Engineering development costs are assumed to increase as value increases. If exploratory development is not successful, additional costs in engineering development must be incurred to bring the design up to a minimum desirable level. The model is intended as a step toward formulating and analyzing problems in management planning and control of the several interrelated stages of the research and development process. 相似文献
297.
The stochastic duel is extended to include the possibility of a near-miss on each round fired, which causes the opponent to displace. During displacement, the displacing contestant cannot return the fire but is still a target for his opponent. An alternative interpretation of this model is to consider the displacement time as the time a contestant's fire is suppressed by his opponent's fire and that he does not move, but merely ceases fire temporarily. All times are exponentially distributed. 相似文献
298.
In this paper we address a bin-packing problem which possesses a variety of modifications of the classic theme. Among these are bin-dependent chip weights, bin costs, and bin-dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch-and-bound framework in order to solve the problem after which substantial computational experience is provided. 相似文献
299.
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. 相似文献
300.
In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive. 相似文献