全文获取类型
收费全文 | 4120篇 |
免费 | 329篇 |
国内免费 | 20篇 |
专业分类
4469篇 |
出版年
2021年 | 82篇 |
2019年 | 91篇 |
2018年 | 53篇 |
2017年 | 85篇 |
2016年 | 82篇 |
2015年 | 87篇 |
2014年 | 97篇 |
2013年 | 719篇 |
2012年 | 42篇 |
2011年 | 37篇 |
2010年 | 79篇 |
2009年 | 98篇 |
2008年 | 86篇 |
2007年 | 108篇 |
2006年 | 62篇 |
2005年 | 71篇 |
2004年 | 58篇 |
2003年 | 42篇 |
2002年 | 59篇 |
2000年 | 50篇 |
1999年 | 151篇 |
1998年 | 130篇 |
1997年 | 114篇 |
1996年 | 113篇 |
1995年 | 89篇 |
1994年 | 103篇 |
1993年 | 97篇 |
1992年 | 95篇 |
1991年 | 111篇 |
1990年 | 82篇 |
1989年 | 80篇 |
1988年 | 81篇 |
1987年 | 80篇 |
1986年 | 76篇 |
1985年 | 73篇 |
1983年 | 53篇 |
1982年 | 46篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 50篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
排序方式: 共有4469条查询结果,搜索用时 15 毫秒
141.
The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability. 相似文献
142.
143.
在高速柴油发动机喷油系统性能检测中,一般以燃油压力信号作为喷油系统性能检测参量。通过对油压波形进行分析来判断喷油系统的工作状况,阐述了采用载荷识别技术识别油压信号的频谱特性,进而得到其时域波形的理论与方法,并在模拟试验中获得了识别结果。 相似文献
144.
145.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
146.
147.
Roger C. Schroeder 《海军后勤学研究》1974,21(3):375-388
Most inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results. 相似文献
148.
Stephen A. Book 《海军后勤学研究》1974,21(3):549-556
An asymptotic representation for large deviation probabilities of the Winsorized mean of a sequence of independent, identically distributed exponential random variables is derived. The Winsorized mean, a linear combination of exponential order statistics, is first transformed into a weighted sum of exponential random variables, and then a large deviation theorem for weighted sums can be applied. The representation obtained is then compared with results already known for the mean and the median, the two extreme cases of the Winsorized mean. 相似文献
149.
This paper presents a model for choosing a minimum-cost mix of strategic defenses to assure that specified production capacities for several economic sectors survive after a nuclear attack. The defender selects a mix of strategic defenses for each of several geographic regions. The attacker chooses an allocation of attacking weapons to geographic regions, within specified weapon inventories. The attack is optimized against any economic sector. This formulation allows the defense planner the capability to assess the results of the optimal defense structure for a “worst case” attack. The model is a mathematical program with nonlinear programming problems in the constraints; an example of its application is given and is solved using recently developed optimization techniques. 相似文献
150.
A. Victor Cabot 《海军后勤学研究》1974,21(2):265-274
A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates the question of finiteness of Tui's method to the so-called generalized lattice point problem of mathematical programming and gives a sufficient condition for terminating Tui's method. The paper then presents several branch-and-bound algorithms for solving concave minimization problems with linear constraints with the Tui cut as the basis for the algorithm. Finally, some computational experience is reported for the fixed-charge transportation problem. 相似文献