全文获取类型
收费全文 | 25406篇 |
免费 | 3219篇 |
国内免费 | 2528篇 |
专业分类
电工技术 | 4001篇 |
技术理论 | 9篇 |
综合类 | 2534篇 |
化学工业 | 662篇 |
金属工艺 | 388篇 |
机械仪表 | 2461篇 |
建筑科学 | 1139篇 |
矿业工程 | 729篇 |
能源动力 | 370篇 |
轻工业 | 370篇 |
水利工程 | 442篇 |
石油天然气 | 306篇 |
武器工业 | 239篇 |
无线电 | 3516篇 |
一般工业技术 | 1968篇 |
冶金工业 | 453篇 |
原子能技术 | 23篇 |
自动化技术 | 11543篇 |
出版年
2024年 | 184篇 |
2023年 | 506篇 |
2022年 | 954篇 |
2021年 | 1144篇 |
2020年 | 1189篇 |
2019年 | 750篇 |
2018年 | 719篇 |
2017年 | 874篇 |
2016年 | 954篇 |
2015年 | 1073篇 |
2014年 | 1881篇 |
2013年 | 2040篇 |
2012年 | 2141篇 |
2011年 | 1941篇 |
2010年 | 1483篇 |
2009年 | 1504篇 |
2008年 | 1599篇 |
2007年 | 1795篇 |
2006年 | 1445篇 |
2005年 | 1351篇 |
2004年 | 1098篇 |
2003年 | 905篇 |
2002年 | 751篇 |
2001年 | 654篇 |
2000年 | 485篇 |
1999年 | 400篇 |
1998年 | 274篇 |
1997年 | 228篇 |
1996年 | 155篇 |
1995年 | 151篇 |
1994年 | 125篇 |
1993年 | 99篇 |
1992年 | 70篇 |
1991年 | 59篇 |
1990年 | 39篇 |
1989年 | 28篇 |
1988年 | 13篇 |
1987年 | 10篇 |
1986年 | 17篇 |
1985年 | 14篇 |
1984年 | 14篇 |
1983年 | 6篇 |
1981年 | 5篇 |
1980年 | 9篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1966年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
81.
82.
Lower automation level in industrial rare-earth extraction processes results in high production cost, inconsistent product quality and great consumption of resources in China. An integrated automation system for extraction process of rare earth is proposed to realize optimal product indices, such as product purity, recycle rate and output. The optimal control strategy for output component, structure and function of the two-gradcd integrated automation system composed of the process management grade and the process control grade were discussed. This system is successfully applied to a HAB yttrium extraction production process and was found to provide optimal control, optimal operation, ontimal management and remarkable benefits. 相似文献
83.
The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm 总被引:1,自引:0,他引:1
1 IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1~ 2 ] ,andtheotherisforthequalityofservice[3~6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo… 相似文献
84.
85.
86.
Claudio Arbib Fabrizio Marinelli 《International Journal of Flexible Manufacturing Systems》2003,15(4):333-354
A cook has to prepare n cakes using an oven with two racks. According to the recipe, the i-th cake has to be baked for exactly a
i minutes. Cakes to be cooked are taken from a table and carried to the oven, and once cooked are carried back to the table by means of a trolley that can carry two cakes at a time. What is the minimum number q
* of round trips required of the cook? This problem has application to the operation scheduling of transportation systems and to material cutting. A different problem arises according to whether the cook accepts or not to stay near the oven for awhile with the trolley. If the trolley cannot be idle at the oven, an optimum schedule with no oven idle-time always exists: consequently, the trolley schedule is trivial, and the problem is transformed into a set packing. For this case, we propose and test a heuristic method which generates all of the promising columns of the set packing, and solves the resulting problem by branch-and-bound. Instead, if the trolley can be idle at the oven for a limited amount of time, a problem arises to find an optimal schedule of the trolley: in this case we show how to use a scaling technique in order to obtain a very good feasible solution by the method above. 相似文献
87.
88.
We have designed a family of parallel data flow analysis algorithms for execution on distributed-memory MIMD machines, based on general-purpose, hybrid algorithms for data flow analysis [Marlowe and Ryder 1990]. We exploit a natural partitioning of the hybrid algorithms and explore a static mapping, dynamic scheduling strategy. Alternative mapping-scheduling choices and refinements of the flow graph condensation used are discussed. Our parallel hybrid algorithm family is illustrated on Reaching Definitions, although parallel algorithms also exist for many interprocedural (e.g., Aliasing) and intraprocedural (e.g., Available Expressions) problems [Marlowe 1989]. We have implemented the parallel hybrid algorithm for Reaching Definitions on an Intel iPSC/2. Our empirical results suggest the practicality of parallel hybrid algorithms.An earlier version of this paper was presented at Supercomputing '90.The research reported here was supported, in part, by the New Jersey Commission on Science and Technology and the CAIP Center's Industrial Members, by Siemens Research Corporation and by National Science Foundation grant CCR-8920078. 相似文献
89.
90.