全文获取类型
收费全文 | 558篇 |
免费 | 42篇 |
国内免费 | 4篇 |
专业分类
604篇 |
出版年
2021年 | 13篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2017年 | 14篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 61篇 |
2012年 | 23篇 |
2011年 | 30篇 |
2010年 | 34篇 |
2009年 | 24篇 |
2008年 | 34篇 |
2007年 | 15篇 |
2006年 | 19篇 |
2005年 | 10篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 7篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 14篇 |
1988年 | 4篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 7篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1972年 | 12篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有604条查询结果,搜索用时 0 毫秒
441.
A.Y. Garnaev 《海军后勤学研究》1997,44(4):353-364
The following zero-sum game is considered. Red chooses in integer interval [1, n] two integer intervals consisting of k and m points where k + m < n, and Blue chooses an integer point in [1, n]. The payoff to Red equals 1 if the point chosen by Blue is at least in one of the intervals chosen by Red, and 0 otherwise. This work complements the results obtained by Ruckle, Baston and Bostock, and Lee. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 353–364, 1997 相似文献
442.
This paper presents an efficient algorithm for scheduling a single-category work force on 4-day or 3-day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch on 4-day work weeks and no more than 4 days in a work stretch on 3-day work weeks. Such conditions often prevail in 7-day-a-week organizations such as hospitals, manufacturing plants, and retail stores. We determine the minimum number of workers required to satisfy the scheduling constraints under any pattern of daily requirements. Then we present the algorithm for assigning days off for each worker, thereby determining the work schedules. We show that the algorithm, by construction, will necessarily satisfy the scheduling constraints. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 839–853, 1998 相似文献
443.
针对超音速隐身飞机难以探测的问题,仿真分析了F-22飞机在不同运动特征下的动态RCS,并对其频率响应和极化响应特性做进一步的研究。首先设定飞行航迹,并考虑实际中随机抖动的影响,获取时变的雷达视线姿态角;其次应用物理光学并结合等效电磁流的方法,计算分析了飞机以不同的速度沿不同航迹飞行时的动态RCS。对于使飞机动态RCS变化最明显的运动特征,仿真计算了其在不同频段、不同极化下的动态RCS。仿真结果表明:在不同航迹下,飞机速度对其动态RCS的影响程度不同,且当飞机沿小航路捷径低速或者高速飞行时,其RCS值减小最为明显,利用极化响应和频率响应特性可以有效地削弱这一影响。研究成果对于超音速隐身飞机目标的预警探测具有重要意义。 相似文献
444.
Hazard rate processes are discussed in the context of doubly stochastic Poisson processes. We derive an explicit expression for the reliability function corresponding to an increasing hazard rate processes with independent increments. Also, bounds are obtained for the reliability function of a system with a general hazard rate process. 相似文献
445.
In this article, we consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For this problem, we develop and test suitable branch-and-bound algorithms and study the effect of problem parameters on solution difficulty. Some generalizations of this problem are also mentioned as possible extensions. 相似文献
446.
447.
448.
The discrete evasion game with three-move lag, formulated over 30 years ago, was one of the earliest games with time-lag complications. This game remains unsolved even though it is well known that the game has a value. In this article we obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known. 相似文献
449.
Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associated levels of two scheduling criteria, schedule makespan (Cmax) and maximum job tardiness (Tmax). We present constructive procedures that quantify the trade-off between Cmax and Tmax. The significance of this trade-off is that the optimal solution for any preference function involving only Cmax and Tmax must be contained among the set of efficient schedules that comprise the trade-off curve. For the special case of two-machine flow shops, we present an algorithm that identifies the exact set of efficient schedules. Heruistic procedures for approximating the efficient set are also provided for problems involving many jobs or larger flow shops. Computational results are reported for the procedures which indicate that both the number of efficient schedules and the error incurred by heuristically approximating the efficient set are quite small. 相似文献
450.
多弯头管道磁致伸缩导波无损检测技术 总被引:2,自引:0,他引:2
为了研究超声导波在弯管中的传播特性及检测可行性,使用磁致伸缩导波仪器及传感器对多弯头管道进行了检测实验,并对弯管中导波的传播速度、模态转换、能量衰减等现象进行了探讨。结果表明:当弯管弯曲程度较小时,弯管中导波传播速度与直管中近似;弯管中导波存在明显的模态转换现象;弯管中导波能量随着时间近似呈指数形式衰减,且衰减规律与激励频率存在密切联系。该研究结果可以为复杂结构弯曲管道的导波检测提供参考。 相似文献