全文获取类型
收费全文 | 2281篇 |
免费 | 46篇 |
国内免费 | 87篇 |
专业分类
电工技术 | 21篇 |
综合类 | 34篇 |
化学工业 | 65篇 |
金属工艺 | 21篇 |
机械仪表 | 202篇 |
建筑科学 | 27篇 |
矿业工程 | 5篇 |
能源动力 | 12篇 |
轻工业 | 3篇 |
水利工程 | 3篇 |
石油天然气 | 8篇 |
武器工业 | 8篇 |
无线电 | 188篇 |
一般工业技术 | 114篇 |
冶金工业 | 170篇 |
原子能技术 | 1篇 |
自动化技术 | 1532篇 |
出版年
2024年 | 4篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 19篇 |
2020年 | 18篇 |
2019年 | 25篇 |
2018年 | 23篇 |
2017年 | 50篇 |
2016年 | 47篇 |
2015年 | 96篇 |
2014年 | 117篇 |
2013年 | 186篇 |
2012年 | 158篇 |
2011年 | 182篇 |
2010年 | 111篇 |
2009年 | 178篇 |
2008年 | 196篇 |
2007年 | 175篇 |
2006年 | 164篇 |
2005年 | 122篇 |
2004年 | 98篇 |
2003年 | 94篇 |
2002年 | 73篇 |
2001年 | 27篇 |
2000年 | 30篇 |
1999年 | 30篇 |
1998年 | 32篇 |
1997年 | 28篇 |
1996年 | 18篇 |
1995年 | 13篇 |
1994年 | 10篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 9篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有2414条查询结果,搜索用时 15 毫秒
51.
52.
53.
54.
In this paper, we re-analyse the rate monotonic scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all the task sets that (are schedulable and) fully utilise the processor. We argue that full utilisation is not very appropriate for this purpose. We re-establish Liu and Layland's classic schedulability theorem by finding the greatest lower bound of utilisation factors over all the unschedulable task sets instead. The merits of our approach include: Firstly, the fact that the bound is both sound and tight for schedulability follows directly from definition; Secondly, our proof is simpler technically. 相似文献
55.
Symeon E. Christodoulou Georgios Ellinas Anastasia Michaelidou-Kamenou 《Canadian Metallurgical Quarterly》2010,136(5):518-527
The minimum moment method for resource leveling is revisited and restated as an entropy-maximization problem. The minimum moment method assumes that the moment of the daily resource demands about the horizontal axis of a project’s resource histogram is a good measure of the resource utilization and that the optimal resource allocation exists when the total moment is at a minimum, thus when the resource histogram is of rectangular shape. The entropy-maximization method proposed in this paper makes use of the general theory of entropy and two of its principal properties (subadditivity and maximality) to revisit the minimum moment method for resource leveling. The entropy-maximization method presented allows for activity stretching and provides resource allocation solutions that show improvement over previous approaches. A case study is also presented that validates the results. 相似文献
56.
57.
Jui Teng Wang 《AEUE-International Journal of Electronics and Communications》2010,64(11):1090-1093
The time slotted system with rate regulation, which adapts the transmission rate to the interference for each time slot, is proposed to enhance the throughput while meeting the SINR requirement for cochannel interference limited wireless ad hoc networks. We show that the throughput of the rate regulated TDMA system is larger than that of the rate regulated TDMA/CDMA system. Furthermore, we also propose a scheduling algorithm to maximize the total throughput of the rate regulated TDMA system. 相似文献
58.
Yin-Hsuan LeeChuei-Tin Chang David Shan-Hill WongShi-Shang Jang 《Chemical Engineering Research and Design》2011,89(3):291-300
Semiconductor manufacturing is a highly automated and capital-intensive industrial process. The operating cost of a wafer processing plant is in general closely related to the design and management of its process flows. Traditionally, the task of production scheduling is performed manually on the basis of past experiences. There are thus real incentives to develop a systematic approach to construct a mathematical programming model in order to reduce the chance of human errors and to ensure operational efficiency in implementing the resulting schedules. To this end, the Petri nets are adopted in this work to accurately model the semiconductor manufacturing activities. The token movements in a Petri net are represented with the well-established scheduling model for batch chemical processes, and the optimal schedule of the given semiconductor process can then be determined accordingly. The feasibility and effectiveness of this scheduling strategy is demonstrated in the present paper with three examples, i.e., the final test process, the re-entrant flow process, and the photolithography-etching process. 相似文献
59.
A rapid presence/absence test for Campylobacter in chicken faeces is being evaluated to support the scheduling of highly contaminated broiler flocks as a measure to reduce public health risks [Nauta, M. J., & Havelaar, A. H. (2008). Risk-based standards for Campylobacter in the broiler meat chain. Food Control, 19, 372–381]. Although the presence/absence test is still under development, an example data set of test results is analysed to illustrate the benefit of the detection probability concept. The detection probability of Campylobacter increases with the logarithm of the Campylobacter concentration in faeces according to an S-shaped curve which stretches about 2–3 log units. The detection probability is 50% at a Campylobacter concentration of 7.4 × 106 cfu/g. The uncertainty in the detection probability is 32% at the most for a 90% confidence interval. This type of information allows for realistic calculations on the Campylobacter status of different food processing paths after splitting. Usable quantitative estimates on detection probability await a data set of test results from a test that is ready for use or has similar properties. 相似文献
60.
In a recent paper by Wang and Liu (A heuristic for two-stage hybrid flow shop with dedicated machines. Computers & Operations Research 2013;40:438–50), two elimination rules are proposed for the hybrid flow shop with dedicated machines. This note shows that one of them is not valid and that the other is dominated by an other elimination rule. 相似文献