全文获取类型
收费全文 | 6381篇 |
免费 | 625篇 |
国内免费 | 111篇 |
专业分类
化学 | 190篇 |
力学 | 97篇 |
综合类 | 52篇 |
数学 | 810篇 |
物理学 | 848篇 |
无线电 | 5120篇 |
出版年
2024年 | 12篇 |
2023年 | 51篇 |
2022年 | 96篇 |
2021年 | 101篇 |
2020年 | 144篇 |
2019年 | 94篇 |
2018年 | 123篇 |
2017年 | 174篇 |
2016年 | 194篇 |
2015年 | 272篇 |
2014年 | 427篇 |
2013年 | 450篇 |
2012年 | 485篇 |
2011年 | 499篇 |
2010年 | 335篇 |
2009年 | 341篇 |
2008年 | 400篇 |
2007年 | 449篇 |
2006年 | 442篇 |
2005年 | 355篇 |
2004年 | 308篇 |
2003年 | 279篇 |
2002年 | 200篇 |
2001年 | 190篇 |
2000年 | 121篇 |
1999年 | 137篇 |
1998年 | 99篇 |
1997年 | 80篇 |
1996年 | 58篇 |
1995年 | 52篇 |
1994年 | 37篇 |
1993年 | 30篇 |
1992年 | 20篇 |
1991年 | 18篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 2篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有7117条查询结果,搜索用时 843 毫秒
61.
62.
一种PN码自适应捕获门限的改进算法 总被引:1,自引:0,他引:1
文献[1]提出了一种用于直扩系统的PN码自适应门限算法。但该文献也指出,此算法对门限总数十分敏感。当门限总数设置不当时,系统的平均捕获时间将显著增加。这限制了该算法在实际中的应用。本文就此提出了改进,给出了算法及电路框图。仿真结果表明,与原方案相比,改进算法改善了对门限总数的敏感性,降低了PN码平均捕获时间。 相似文献
63.
基于自相关的激光编码解算 总被引:1,自引:0,他引:1
分析了半自主激光制导武器的激光编码规律,提出了运用自相关技术对激光编码进行解算。通过仿真试验验证,运用该技术可准确预测、精确同步复制敌方激光编码,并形成有效的激光诱饵,达到全程自适应干扰的目的。 相似文献
64.
Five non-isomorphic quasi-symmetric 2-(49, 9, 6) designs are known. They arise from extremal self-dual [50, 25, 10] codes with a certain weight enumerator. Four of them have an automorphism of order 3 fixing two points. In this paper, it is shown that there are exactly 48 inequivalent extremal self-dual [50, 25, 10] code with this weight enumerator and an automorphism of order 3 fixing two points. 44 new quasi-symmetric 2-(49, 9, 6) designs with an automorphism of order 3 are constructed from these codes. 相似文献
65.
Java语言及其虚拟机技术探讨 总被引:1,自引:0,他引:1
随着Internet的迅猛发展,Internet编程语言Java愈来愈成为计算机行业的焦点。本文在简述了Java的主要特点后,重点对Java最关键的技术──虚拟机进行了深入的探讨。 相似文献
66.
一类三元线性分组码的译码 总被引:1,自引:0,他引:1
Pless[1]证明了三元(12,6,6)Golay码具有一种双层结构,并据此给出了该码的快速硬判决译码算法。本文推广了Golay码的Pless结构,给出了由三元(n,k,d)线性分组码构造的三元(3,n+k,≥min(n,2d,6))线性分组码,其中包括(12,6,6)Golay码和(18,9,6)码,并以三元(18,9,6)码为例给出了这类码的最大似然软判决译码算法。 相似文献
67.
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. 相似文献
68.
一种可靠多播认证方案及其C语言实现 总被引:1,自引:0,他引:1
贺堃 《信息安全与通信保密》2007,(6):226-227
传统的认证技术对于多播认证并不适用,因为多播认证有它自身的特殊要求。论文介绍了两种针对多播认证特点的解决方案,并结合两种方案的特点阐述了一种改进的适合可靠多播的认证方案,最后给出了C语言的实现。 相似文献
69.
Gordon J.R. Povey 《Wireless Personal Communications》1998,8(2):151-164
A hybrid correlator architecture is described which combines the serial structure of an active correlator with the parallel structure of a matched filter correlator. The mean PN code acquisition time performance of this hybrid serial-parallel correlator structure is analysed. Results are shown which compare the acquisition performance of the serial, parallel, and serial-parallel structures. The results are for a PN code length of 64 code chips and assumes a Gaussian channel with the receiver detection threshold set to obtain a constant false alarm rate. An enhancement to the serial-parallel acquisition algorithm is also described which can increase the acquisition time performance by about 15% for typical operating conditions. Overall the results demonstrate that the hybrid correlator can provide rapid code acquisition with a limited receiver complexity. 相似文献
70.
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. 相似文献