全文获取类型
收费全文 | 84105篇 |
免费 | 9537篇 |
国内免费 | 5360篇 |
专业分类
电工技术 | 6716篇 |
技术理论 | 5篇 |
综合类 | 6651篇 |
化学工业 | 12183篇 |
金属工艺 | 4972篇 |
机械仪表 | 5762篇 |
建筑科学 | 7132篇 |
矿业工程 | 2897篇 |
能源动力 | 2477篇 |
轻工业 | 5898篇 |
水利工程 | 1985篇 |
石油天然气 | 4198篇 |
武器工业 | 997篇 |
无线电 | 10667篇 |
一般工业技术 | 8911篇 |
冶金工业 | 3299篇 |
原子能技术 | 1142篇 |
自动化技术 | 13110篇 |
出版年
2024年 | 462篇 |
2023年 | 1606篇 |
2022年 | 3203篇 |
2021年 | 4497篇 |
2020年 | 3338篇 |
2019年 | 2572篇 |
2018年 | 2915篇 |
2017年 | 3247篇 |
2016年 | 2845篇 |
2015年 | 4202篇 |
2014年 | 5260篇 |
2013年 | 6032篇 |
2012年 | 7119篇 |
2011年 | 7359篇 |
2010年 | 6508篇 |
2009年 | 6060篇 |
2008年 | 5770篇 |
2007年 | 5133篇 |
2006年 | 4504篇 |
2005年 | 3680篇 |
2004年 | 2415篇 |
2003年 | 1672篇 |
2002年 | 1512篇 |
2001年 | 1150篇 |
2000年 | 1053篇 |
1999年 | 1018篇 |
1998年 | 700篇 |
1997年 | 638篇 |
1996年 | 549篇 |
1995年 | 445篇 |
1994年 | 369篇 |
1993年 | 268篇 |
1992年 | 202篇 |
1991年 | 166篇 |
1990年 | 140篇 |
1989年 | 78篇 |
1988年 | 81篇 |
1987年 | 49篇 |
1986年 | 41篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 11篇 |
1982年 | 17篇 |
1981年 | 14篇 |
1980年 | 25篇 |
1979年 | 20篇 |
1978年 | 2篇 |
1976年 | 2篇 |
1959年 | 14篇 |
1951年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
Lei Zhou Yu-Dong Yao Heffes H. Ruifeng Zhang 《Wireless Communications, IEEE Transactions on》2006,5(4):779-788
A reduced-rate retransmission (RRR) scheme is proposed for improving the throughput performance of spread-spectrum packet radio networks. The scheme takes advantages of the available multi-rate scalable source coding techniques. It assumes that several versions of a data packet with different sizes (number of information bits) are available. The transmission of a packet starts from its full-size version. If the full-size version is not correctly received, its half-size version is used in the retransmission. If further retransmissions are needed, the quarter-size version and so on are used. The shrunk packets are transmitted either in a minislot if the processing gain is kept the same, or occupying a slot duration by increasing the processing gain proportionally. In both cases, the effective signal to interference ratio for a packet is increased. As a result, the system throughput is improved. Theoretical and numerical results are provided in this paper which illustrate the throughput improvement. Another advantage of the proposed RRR scheme is that the packet-size reduction provides finer granules for link adaptation. Therefore, it is especially suitable for multimedia applications for which codes of variable rate for the source data are available and which can tolerate gracefully degraded quality of service. The performance of the proposed scheme in fading channels is also addressed. 相似文献
82.
In this paper, we study the problem of designing globally stable, scalable congestion control algorithms for the Internet. Prior work has primarily used linear stability as the criterion for such a design. Global stability has been studied only for single node, single source problems. Here, we obtain conditions for a general topology network accessed by sources with heterogeneous delays. We obtain a sufficient condition for global stability in terms of the increase/decrease parameters of the congestion control algorithm and the price functions used at the links. 相似文献
83.
在陷阱电荷限制电流传导理论的基础上,提出了双层有机电致发光器件的数值模型,研究了结构为"阳极/空穴输运层(HTL)/发光层(EML)/阴极"的器件中电流密度和量子效率随有机层的特征陷阱能量、陷阱密度和载流子迁移率的依赖关系. 研究发现,对于给定的HTL和EML的特征陷阱能量、陷阱密度和载流子迁移率,存在一个最优的HTL和EML之间的厚度比率,在此最优厚度比下,器件的电流密度和量子效率达到最大.通过有机层厚度的优化,器件的电流密度和量子效率可提高多达两个数量级.另外,还研究了最优厚度比随有机层特征陷阱能量、总陷阱密度和载流子迁移率之间的定量关系. 相似文献
84.
85.
86.
In this paper, the software cold-test simulation method to obtain RF dispersion, interaction impedance by MAFIA software is discussed considering effect of the conducting barrel in the millimeter-wave TWT. The dispersion simulation result is obtained more consistent with experiment data than the method that ignoring effect of the conducting barrel. By changing the structure parameter, high frequency characteristic will be affected. The change relationship of high frequency characteristic with structure parameter is obtained. The different calculation methods of the interaction impedance are discussed. These results are received and are consistent with experiment data. 相似文献
87.
88.
Mining constrained gradients in large databases 总被引:1,自引:0,他引:1
Dong G. Han J. Lam J.W.M. Pei J. Wangm K Zou W. 《Knowledge and Data Engineering, IEEE Transactions on》2004,16(8):922-938
Many data analysis tasks can be viewed as search or mining in a multidimensional space (MDS). In such MDSs, dimensions capture potentially important factors for given applications, and cells represent combinations of values for the factors. To systematically analyze data in MDS, an interesting notion, called "cubegrade" was recently introduced by Imielinski et al. [2002], which focuses on the notable changes in measures in MDS by comparing a cell (which we refer to as probe cell) with its gradient cells, namely, its ancestors, descendants, and siblings. We call such queries gradient analysis queries (GQs). Since an MDS can contain billions of cells, it is important to answer GQs efficiently. We focus on developing efficient methods for mining GQs constrained by certain (weakly) antimonotone constraints. Instead of conducting an independent gradient-cell search once per probe cell, which is inefficient due to much repeated work, we propose an efficient algorithm, LiveSet-Driven. This algorithm finds all good gradient-probe cell pairs in one search pass. It utilizes measure-value analysis and dimension-match analysis in a set-oriented manner, to achieve bidirectional pruning between the sets of hopeful probe cells and of hopeful gradient cells. Moreover, it adopts a hypertree structure and an H-cubing method to compress data and to maximize sharing of computation. Our performance study shows that this algorithm is efficient and scalable. In addition to data cubes, we extend our study to another important scenario: mining constrained gradients in transactional databases where each item is associated with some measures such as price. Such transactional databases can be viewed as sparse MDSs where items represent dimensions, although they have significantly different characteristics than data cubes. We outline efficient mining methods for this problem. 相似文献
89.
90.