全文获取类型
收费全文 | 2222篇 |
免费 | 63篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 46篇 |
综合类 | 1篇 |
化学工业 | 358篇 |
金属工艺 | 46篇 |
机械仪表 | 50篇 |
建筑科学 | 32篇 |
矿业工程 | 1篇 |
能源动力 | 72篇 |
轻工业 | 61篇 |
水利工程 | 3篇 |
无线电 | 530篇 |
一般工业技术 | 499篇 |
冶金工业 | 168篇 |
原子能技术 | 16篇 |
自动化技术 | 409篇 |
出版年
2023年 | 8篇 |
2022年 | 30篇 |
2021年 | 38篇 |
2020年 | 23篇 |
2019年 | 27篇 |
2018年 | 34篇 |
2017年 | 28篇 |
2016年 | 48篇 |
2015年 | 35篇 |
2014年 | 73篇 |
2013年 | 194篇 |
2012年 | 127篇 |
2011年 | 136篇 |
2010年 | 104篇 |
2009年 | 108篇 |
2008年 | 141篇 |
2007年 | 89篇 |
2006年 | 85篇 |
2005年 | 81篇 |
2004年 | 77篇 |
2003年 | 72篇 |
2002年 | 59篇 |
2001年 | 59篇 |
2000年 | 51篇 |
1999年 | 63篇 |
1998年 | 85篇 |
1997年 | 61篇 |
1996年 | 69篇 |
1995年 | 34篇 |
1994年 | 38篇 |
1993年 | 29篇 |
1992年 | 21篇 |
1991年 | 23篇 |
1990年 | 17篇 |
1989年 | 14篇 |
1988年 | 12篇 |
1987年 | 7篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 7篇 |
1982年 | 9篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1974年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有2292条查询结果,搜索用时 15 毫秒
1.
Scientometrics - In this study, scholarly communication systems provided by commercial services and open access systems are examined on the basis of the comprehensiveness and uniqueness of their... 相似文献
2.
Honour Index (HoI), a method to evaluate research performance within different research fields, was derived from the impact
factor (IF). It can be used to rate and compare different categories of journals. HoI was used in this study to determine
the scientific productivity of stem cell research in the Asian Four Dragons (Hong Kong, Singapore, South Korea and Taiwan)
from 1981 to 2001. The methodology applied in this study represents a synthesis of universal indicator studies and bibliometric
analyses of subfields at the micro-level. We discuss several comparisons, and conclude the developmental trend in stem cell
research for two decades.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
3.
Tzung-Pei Hong Shian-Shyong Tseng 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(6):857-867
Applies the technique of parallel processing to concept learning. A parallel version-space learning algorithm based upon the principle of divide-and-conquer is proposed. Its time complexity is analyzed to be O(k log2n) with n processors, where n is the number of given training instances and k is a coefficient depending on the application domains. For a bounded number of processors in real situations, a modified parallel learning algorithm is then proposed. Experimental results are then performed on a real learning problem, showing that our parallel learning algorithm works, and being quite consistent with the results of theoretical analysis. We conclude that when the number of training instances is large, it is worth learning in parallel because of its faster execution 相似文献
4.
5.
6.
Dynamic bandwidth allocation for multimedia traffic with rate guarantee and fair access in WCDMA systems 总被引:1,自引:0,他引:1
Packet scheduling in a WCDMA system poses a new challenge due to its nature of variable bit rates and location-dependent, time-varying channel conditions. In this work, three new downlink scheduling algorithms for a WCDMA base station are proposed to support multimedia transmissions. Using a credit management and a compensation mechanism, our algorithms provide rate guarantee and fair access to mobile terminals. In particular, we propose to allow a user to simultaneously use multiple OVSF codes in a time-sharing manner, which we call a multicode, shared model. Using multiple codes allows us to compensate those users suffering from bad communication quality or even errors. The proposed schemes can tolerate a multistate link condition (compared to the typically assumed two-state, or good-or-bad, link condition) by adjusting the number of OVSF codes and the spreading factor of each code. Simulation results show that the proposed schemes do achieve higher bandwidth utilization while keeping transmission delay low. 相似文献
7.
Harmonic broadcasting for video-on-demand service 总被引:5,自引:0,他引:5
Li-Shen Juhn Li-Ming Tseng 《Broadcasting, IEEE Transactions on》1997,43(3):268-271
Using conventional broadcasting, if we want to support a 120-minute popular movie every 10 minutes, we need 12 video channels. Assuming the set-top box at the client end can buffer portions of the playing video on a disk, pyramid broadcasting schemes can reduce the bandwidth requirements to 5.7 channels. We present a new scheme which only needs 3.2 channels. For a movie with length D minutes, if we want to reduce the viewer waiting time to D/N minutes, we only need to allocate H(N) video channels to broadcast the movie periodically, where H(N) is the harmonic number of N, H(N)=1+1/2+…+1/N. In order to support video-on-demand service for a popular movie, the new scheme greatly reduces the bandwidth requirements 相似文献
8.
9.
Chien-Hsun Tseng Lawson S. 《IEEE transactions on circuits and systems. I, Regular papers》2004,51(8):1648-1663
Recently, multidimensional wave digital filter (MDWDF) structures have been proposed for the modeling of plate vibration problems. In this paper, we discuss how initial and boundary conditions may be properly embedded into such an algorithm in terms of the state quantities that are an integral part of the algorithm. Due to the essential feature of fully-local interconnectivity in the MDWDF model, different types of boundary conditions can be easily satisfied in a very simple and efficient manner. Instead of remodifying the whole algorithm, usually required by finite elements based methods, boundary conditions in terms of state outputs are simply attached to the model. This feature is especially useful when dealing with the mixed-edges boundary conditions frequently encountered in practice. Graphical results obtained from implementing the MDWDF algorithm are given to further demonstrate the capacities of the method in efficiently handling a fourth-order Mindlin plate vibration system with various types of boundary conditions. 相似文献
10.
One way to broadcast a popular video is to use multiple channels, each broadcasting a portion of the video periodically. Among the many schemes falling in this category, this paper focuses on several representative schemes (such as FB, Pagoda, and RFS ), which all share a FSFC property by repeatedly broadcasting the first segment of the video on the first channel. We propose a general borrow-and-return model that can be immediately applied to any scheme owning the FSFC property to reduce the viewer's waiting time without increasing the number of channels required. Given a group of videos, the basic idea is to lend the free time slots of videos without viewers to those videos with viewers to speedup the latter's transmission. By so doing, some bandwidth may be vacated by the borrowing videos to benefit others' transmission. The effectiveness of this model is analyzed by applying it to the FB scheme. 相似文献