首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   665篇
  免费   0篇
  665篇
  2021年   11篇
  2019年   22篇
  2018年   12篇
  2017年   14篇
  2016年   14篇
  2015年   12篇
  2014年   11篇
  2013年   130篇
  2009年   7篇
  2008年   9篇
  2007年   7篇
  2005年   9篇
  2004年   11篇
  2003年   8篇
  2002年   12篇
  2001年   6篇
  2000年   9篇
  1999年   7篇
  1998年   11篇
  1997年   19篇
  1996年   10篇
  1995年   8篇
  1994年   15篇
  1993年   6篇
  1992年   9篇
  1991年   17篇
  1990年   9篇
  1989年   9篇
  1988年   10篇
  1987年   21篇
  1986年   12篇
  1985年   11篇
  1984年   7篇
  1983年   11篇
  1982年   12篇
  1981年   8篇
  1980年   9篇
  1979年   11篇
  1978年   8篇
  1977年   9篇
  1976年   8篇
  1975年   9篇
  1974年   10篇
  1973年   14篇
  1972年   8篇
  1971年   7篇
  1970年   8篇
  1969年   9篇
  1968年   6篇
  1967年   7篇
排序方式: 共有665条查询结果,搜索用时 15 毫秒
481.
Bayesian models for multiattribute acceptance sampling have been developed under the assumption that sampling inspection is carried to completion. A Bayesian multiattribute model for stepwise sampling inspection is proposed, whereby sampling inspection is terminated as soon as the disposition of the inspection lot is determined. An iterative solution procedure is developed for obtaining optimal or near-optimal multiattribute acceptance sampling plans under stepwise sampling inspection. The effect of stepwise sampling inspection on the characteristics of an optimal sampling plan is investigated. It is shown that stepwise sampling inspection achieves a sampling plan with lower total expected cost than complete sampling inspection. In addition, it is shown that the sequence of attributes in a stepwise sampling inspection substantially affects the sampling plan and resultant expected cost. The proposed methodology is used to evaluate various heuristics which may be used to determine the sequence of attributes in a stepwise inspection procedure.  相似文献   
482.
This article discusses the behavior of three continuous sampling plans: continuous sampling plan 1 (CSP 1) and continuous sampling plan 2 (CSP 2) developed by Dodge [5] and Dodge and Torrey [7], and multilevel continuous sampling plan 2 (MLP 2) developed by Lieberman and Solomon [11], when the quality of successive units in a continuous production process follows a two-state time-homogeneous Markov chain. We first derive the average outgoing quality (AOQ) expressions of these plans. Exact procedures for determining the average outgoing quality limit (AOQL) can be obtained only for CSP 1. For CSP 2 and MLP 2 plans, iterative procedures have been used to obtain the AOQL contours. For these plans, it is assumed that the serial correlation coefficient between the two consecutive random variables of the Markov chain is known. In addition, estimation procedures for the coefficient are given. We show that if the serial correlation coefficient of the Markov chain is positive (negative), the AOQL is increased (decreased) as compared to the case when the successive units in the production process follows a Bernoulli pattern. Let r denote the number of production units examined in succession which are found to be of good quality and k denote the inverse of the sampling fraction employed when quality is good. Then if r and k are sufficiently small, it is observed from the graph that, for small departures of the serial correlation coefficient from zero, the AOQL values do not differ significantly for each of the three plans; whereas for sufficiently large values of r and k, the AOQL values differ significantly. Various aspects of these plans, such as their operating characteristics 2 (OC 2) and the serial correlation coefficient, are discussed.  相似文献   
483.
In this article, we construct and analyze an original database of overseas Chinese equity oil investments (EOI) in order to assess the relative importance of economic and geopolitical factors in determining the type of countries that are most likely to receive those investments. We find that China's national oil companies (NOCs) choose to make considerable investments in certain oil rich countries while ignoring others. We develop and examine ‘economic opportunity’ and ‘geopolitical relevance’ explanations of Chinese EOI. The economic explanation assumes that Chinese oil companies operate autonomously despite the fact that they are state owned, and that they seek international experience in countries offering less competition but more risk. The geopolitical explanation suggests that Chinese equity oil investments are developed and coordinated by the central government as part of a geopolitical strategy that is designed to bypass the so-called ‘Malacca Dilemma’ and deepen security ties with oil-rich states through the conduct of oil diplomacy. We argue that Chinese EOI tends to reflect both corporate interests and government priorities, and that it generates more liabilities rather than benefits for China.  相似文献   
484.
We consider a multicomponent system in which the failure rate of a given component at any time depends on the set of working components at that time. Sufficient conditions are presented under which such a system has a life distribution of specified type. The Laplace transform of the time until all components are down is derived. When repair is allowed, conditions under which the resulting process is time reversible are presented.  相似文献   
485.
An area to be defended consists of separated point targets. These targets are subject to an attack in which the offensive weapons are assumed to arrive simultaneously. The defense has area defenders, each of which is capable of intercepting any attacker. The defense has no impact-point prediction; that is, it has no knowledge of any attacker's destination prior to allocation of area interceptors. For a given attack, the defense wishes to allocate its interceptors to maximize the total expected survival value of the targets. For a given attack size, the offense seeks a strategy to minimize total expected surviving value against best defense. We determine an optimal defensive strategy directly and develop an algorithm to determine an optimal attack and the optimal value of the min-max problem. A dynamic programming technique is used to obtain integer solutions, and illustrative computational results are provided.  相似文献   
486.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F.  相似文献   
487.
The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set-packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.  相似文献   
488.
Suppose that we have enough computer time to make n observations of a stochastic process by means of simulation and would like to construct a confidence interval for the steady-state mean. We can make k independent runs of m observations each (n=k.m) or, alternatively, one run of n observations which we then divide into k batches of length m. These methods are known as replication and batch means, respectively. In this paper, using the probability of coverage and the half length of a confidence interval as criteria for comparison, we empirically show that batch means is superior to replication, but that neither method works well if n is too small. We also show that if m is chosen too small for replication, then the coverage may decrease dramatically as the total sample size n is increased.  相似文献   
489.
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.  相似文献   
490.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号