全文获取类型
收费全文 | 3362篇 |
免费 | 88篇 |
国内免费 | 3篇 |
出版年
2021年 | 39篇 |
2019年 | 88篇 |
2018年 | 51篇 |
2017年 | 81篇 |
2016年 | 79篇 |
2015年 | 64篇 |
2014年 | 64篇 |
2013年 | 704篇 |
2010年 | 42篇 |
2009年 | 39篇 |
2008年 | 48篇 |
2007年 | 52篇 |
2006年 | 39篇 |
2005年 | 43篇 |
2004年 | 57篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 46篇 |
1997年 | 50篇 |
1996年 | 62篇 |
1995年 | 41篇 |
1994年 | 60篇 |
1993年 | 64篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 71篇 |
1985年 | 64篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 33篇 |
排序方式: 共有3453条查询结果,搜索用时 15 毫秒
231.
Finite-capacity queues arise naturally in many practical situations, notably in communications and manufacturing engineering. In this article, the matrix formalism of probability distributions of phase type is used to develop fast algorithms to compute various steady-state distributions for the finite-capacity PH/PH/1 queue. This algorithm is an important ingredient in solving nontraditional but significant design problems. Some of these are described as illustrative examples. 相似文献
232.
A survey of the research done on preventive maintenance is presented. The scope of the present survey is on the research published after the 1976 paper by Pierskalla and Voelker [98]. This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration. A classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models. 相似文献
233.
针对脑电信号随机性强、动态变化迅速等特点,提出了一种简化深度学习模型研究癫痫脑电识别问题。提出的模型以一维卷积神经网络为基础,在结构方面简化了卷积层、池化层等以提高模型效率,在整体框架方面应用了Keras框架,在训练优化算法方面采用RMSProp算法作为模型优化算法,通过预定义的目标函数来进行损失估计,模型设计上加入了批标准化层和全局均值池化层。基于所提模型,从三个方面研究了癫痫脑电识别问题,即:利用经验模态分解,分别选取前三阶、前五阶、前七阶、前八阶的本征模态函数分量,在简化模型上进行对比分析;利用提出模型所具备的深度学习特点,直接识别原始脑电信号而无须特征提取环节;增加了三种不同方法分别提取7类特征,对相同的脑电数据进行对比分析。性能分析结果表明:对于五类不同的脑电信号,前三阶的本征模态函数分量的识别率达到92.1%,比其他几种处理方式识别率高;前八阶的本征模态分量识别率不及原始信号,表明人工数据处理时会给数据带来噪声; 所提出的简化深度学习模型能高效处理癫痫脑电识别问题,具备较高效率和较好性能。 相似文献
234.
Craig C. Sherbrooke 《海军后勤学研究》1992,39(1):29-40
We develop approximations to estimate the expected backorders in a multiechelon system in which lateral supply actions between bases are allowed when a backorder occurs. These approximations are easy to compute, and the average absolute error over a wide range of parameter values is less than 4% when items are depot repairable, even when bases are dissimilar. With lateral supply, backorder reductions of 30-50% are not uncommon, and a 72% reduction was observed in two cases. Lateral supply becomes more important with low demand rates. A similar approach was unsuccessful for base-repairable items. However, lateral supply has a beneficial effect only when the lateral supply time is very short, 1/4 or less of the average base repair time. Even in such cases lateral supply is unlikely to be important in an actual application, because base management can expedite repair of critical items. 相似文献
235.
This article introduces a new conceptual and methodological framework for the use of decision makers and their interactions with the computer in bicriterion decision making. The new method, called the multirun interactive method, attempts to estimate the prior of the decision maker on his uncertain preference nature using the minimum cross-entropy principle. A computational study is performed with four hypothesized prior distributions under various interaction conditions. Other important aspects related to the method, such as implementation of the method, decision making under certainty, decision making with multiple decision makers, and bicriterion integer programming, are also discussed. 相似文献
236.
We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous. 相似文献
237.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans. 相似文献
238.
We study a class of replacement models for systems subject to deterioration. The objective is to determine an optimal replacement policy that minimizes the average operating costs of the system. We use a parametric analysis to establish sufficient conditions for the optimality of control limit policies. This work generalizes several existing results for optimal replacement models in the literature. © 1992 John Wiley & Sons, Inc. 相似文献
239.
James F. Campbell 《海军后勤学研究》1992,39(5):635-649
This article analyzes the location-allocation problem for distribution from a single fixed origin via transshipment terminals to a continuous uniformly distributed demand. Distribution through terminals concentrates flows on the origin-to-terminal links and transportation economies of scale encourage the use of larger vehicles. Analytical expressions are derived for the optimal terminal locations, the optimal allocation of destinations to terminals, and the optimal transportation cost. Continuous analytic models assume either an allocation, by partitioning the service region into sectors, or terminal locations. This is unlikely to produce an optimal distribution system. The optimal cost is compared to the cost for suboptimal location-allocation combinations. Results indicate that the location decision is not too important if destinations are allocated optimally and that allocation to the nearest terminal may be poor, even with optimal locations. © 1992 John Wiley & Sons, Inc. 相似文献
240.
John W. Chinneck 《海军后勤学研究》1992,39(4):531-543
Nonviable network models have edges which are forced to zero flow simply by the pattern of interconnection of the nodes. The original nonviability diagnosis algorithm [4] is extended here to cover all classes of network models, including pure, generalized, pure processing, nonconserving processing, and generalized processing. The extended algorithm relies on the conversion of all network forms to a pure processing form. Efficiency improvements to the original algorithm are also presented. 相似文献