全文获取类型
收费全文 | 14190篇 |
免费 | 1587篇 |
国内免费 | 1479篇 |
专业分类
电工技术 | 590篇 |
综合类 | 1735篇 |
化学工业 | 1097篇 |
金属工艺 | 696篇 |
机械仪表 | 572篇 |
建筑科学 | 1811篇 |
矿业工程 | 193篇 |
能源动力 | 190篇 |
轻工业 | 201篇 |
水利工程 | 224篇 |
石油天然气 | 294篇 |
武器工业 | 157篇 |
无线电 | 3641篇 |
一般工业技术 | 1122篇 |
冶金工业 | 245篇 |
原子能技术 | 619篇 |
自动化技术 | 3869篇 |
出版年
2024年 | 73篇 |
2023年 | 163篇 |
2022年 | 299篇 |
2021年 | 402篇 |
2020年 | 398篇 |
2019年 | 329篇 |
2018年 | 351篇 |
2017年 | 476篇 |
2016年 | 499篇 |
2015年 | 579篇 |
2014年 | 840篇 |
2013年 | 998篇 |
2012年 | 1100篇 |
2011年 | 1139篇 |
2010年 | 856篇 |
2009年 | 916篇 |
2008年 | 886篇 |
2007年 | 1041篇 |
2006年 | 988篇 |
2005年 | 840篇 |
2004年 | 685篇 |
2003年 | 650篇 |
2002年 | 528篇 |
2001年 | 386篇 |
2000年 | 333篇 |
1999年 | 278篇 |
1998年 | 229篇 |
1997年 | 180篇 |
1996年 | 146篇 |
1995年 | 128篇 |
1994年 | 111篇 |
1993年 | 85篇 |
1992年 | 51篇 |
1991年 | 52篇 |
1990年 | 34篇 |
1989年 | 34篇 |
1988年 | 24篇 |
1987年 | 13篇 |
1986年 | 13篇 |
1985年 | 16篇 |
1984年 | 19篇 |
1983年 | 15篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 15篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1959年 | 9篇 |
1951年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
一种PN码自适应捕获门限的改进算法 总被引:1,自引:0,他引:1
文献[1]提出了一种用于直扩系统的PN码自适应门限算法。但该文献也指出,此算法对门限总数十分敏感。当门限总数设置不当时,系统的平均捕获时间将显著增加。这限制了该算法在实际中的应用。本文就此提出了改进,给出了算法及电路框图。仿真结果表明,与原方案相比,改进算法改善了对门限总数的敏感性,降低了PN码平均捕获时间。 相似文献
42.
Java语言及其虚拟机技术探讨 总被引:1,自引:0,他引:1
随着Internet的迅猛发展,Internet编程语言Java愈来愈成为计算机行业的焦点。本文在简述了Java的主要特点后,重点对Java最关键的技术──虚拟机进行了深入的探讨。 相似文献
43.
A technique for designing efficient checkers for conventional Berger code is proposed in this paper. The check bits are derived by partitioning the information bits into two blocks, and then using an addition array to sum the number of 1's in each block. The check bit generator circuit uses a specially designed 4-input 1's counter. Two other types of 1's counters having 2 and 3 inputs are also used to realize checkers for variable length information bits. Several variations of 2-bit adder circuits are used to add the number of 1's. The check bit generator circuit uses gates with fan-in of less than or equal to 4 to simplify implementation in CMOS. The technique achieves significant improvement in gate count as well as speed over existing approaches. 相似文献
44.
45.
The purpose of this study was to analyze the symbolization of colors as cultural codes, based on costume colors. In order to study the significance of colors in cultural changes, we carried out a quantitative analysis and interpreted it from the perspective of cultural semiotics. The range of this study was focused on Korean costume colors, over diverse diachronic stages of Korean culture. For this study 1535 color samples were collected, measured with a spectrophotometer, and analyzed quantitatively according their diachronic stages of origin. As a result, red, blue, and yellow were found to be the most frequently used colors during the Chosun Dynasty, a period based on Confucianism. These colors acted as cultural codes with cultural significance. During the Modern times pink, light blue, and black increased in frequency and represented the reception of western culture, the changing sex role of women in society, and utilitarianism. In these days, neutral colors and grayish tones of all colors are the most significant colors of high frequency. The use of such colors is closely related to industrialization, mechanization, functionalism, and the changes of women's sex roles in the societies. They are used as cultural codes, especially to emphasize a rational and masculine image rather than a feminine image. © 2006 Wiley Periodicals, Inc. Col Res Appl, 32, 71–79, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20290 相似文献
46.
A whole‐program MATLAB to C translation system is presented. The paper outlines the motivation for the problem, discusses the system's architecture, its features and limitations. The translator's operation is explained using an example input program. Details are given on how the system implements and specializes some of the language's built‐in primitives. Finally, the paper reports measurements evaluating the execution time and memory usage of the translated sources, and the compilation time required for the translations. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
47.
The efficiency characteristics of multicast key distribution schemes based on (v, b, r, λ)-designs are investigated. The stability
and connectivity of such designs are estimated. These estimates generalize and enhance the well-known estimates for the efficiency
characteristics of multicast key distribution schemes based on incomplete block designs.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 100–111, May–June 2007. 相似文献
48.
CAST的工作原理与设计计算 总被引:7,自引:0,他引:7
详细论述了循环式活性污泥法(CAST)的工作原理,对该工艺的设计计算作了探讨,提出了设计方法,并提供了有关计算公式和操作时间分配。 相似文献
49.
Edoardo Ballico Claudio Fontanari 《Applicable Algebra in Engineering, Communication and Computing》2006,17(2):135-139
Here we apply the so-called Horace method for zero-dimensional schemes to error-correcting codes on complete intersections. In particular, we obtain sharper estimates on the minimum distance. 相似文献
50.
A system-on-chip (SOC) usually consists of many memory cores with different sizes and functionality, and they typically represent a significant portion of the SOC and therefore dominate its yield. Diagnostics for yield enhancement of the memory cores thus is a very important issue. In this paper we present two data compression techniques that can be used to speed up the transmission of diagnostic data from the embedded RAM built-in self-test (BIST) circuit that has diagnostic support to the external tester. The proposed syndrome-accumulation approach compresses the faulty-cell address and March syndrome to about 28% of the original size on average under the March-17N diagnostic test algorithm. The key component of the compressor is a novel syndrome-accumulation circuit, which can be realized by a content-addressable memory. Experimental results show that the area overhead is about 0.9% for a 1Mb SRAM with 164 faults. A tree-based compression technique for word-oriented memories is also presented. By using a simplified Huffman coding scheme and partitioning each 256-bit Hamming syndrome into fixed-size symbols, the average compression ratio (size of original data to that of compressed data) is about 10, assuming 16-bit symbols. Also, the additional hardware to implement the tree-based compressor is very small. The proposed compression techniques effectively reduce the memory diagnosis time as well as the tester storage requirement. 相似文献