全文获取类型
收费全文 | 3360篇 |
免费 | 396篇 |
国内免费 | 317篇 |
专业分类
电工技术 | 78篇 |
综合类 | 449篇 |
化学工业 | 20篇 |
金属工艺 | 14篇 |
机械仪表 | 43篇 |
建筑科学 | 183篇 |
矿业工程 | 8篇 |
能源动力 | 33篇 |
轻工业 | 13篇 |
水利工程 | 6篇 |
石油天然气 | 7篇 |
武器工业 | 12篇 |
无线电 | 1515篇 |
一般工业技术 | 166篇 |
冶金工业 | 64篇 |
原子能技术 | 148篇 |
自动化技术 | 1314篇 |
出版年
2024年 | 6篇 |
2023年 | 43篇 |
2022年 | 52篇 |
2021年 | 55篇 |
2020年 | 72篇 |
2019年 | 72篇 |
2018年 | 68篇 |
2017年 | 87篇 |
2016年 | 108篇 |
2015年 | 114篇 |
2014年 | 174篇 |
2013年 | 335篇 |
2012年 | 225篇 |
2011年 | 247篇 |
2010年 | 212篇 |
2009年 | 222篇 |
2008年 | 296篇 |
2007年 | 304篇 |
2006年 | 251篇 |
2005年 | 219篇 |
2004年 | 153篇 |
2003年 | 153篇 |
2002年 | 93篇 |
2001年 | 78篇 |
2000年 | 68篇 |
1999年 | 66篇 |
1998年 | 40篇 |
1997年 | 50篇 |
1996年 | 32篇 |
1995年 | 17篇 |
1994年 | 33篇 |
1993年 | 20篇 |
1992年 | 17篇 |
1991年 | 16篇 |
1990年 | 19篇 |
1989年 | 16篇 |
1988年 | 5篇 |
1987年 | 3篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1966年 | 2篇 |
1965年 | 1篇 |
1961年 | 1篇 |
排序方式: 共有4073条查询结果,搜索用时 876 毫秒
21.
直接序列扩展频谱中伪码优选研究 总被引:1,自引:0,他引:1
本文从最优化理论和工程实际出发,全面分析和完善了直接序列扩展频谱中伪码的数学模型,在此基础上,建立了一种较准确的伪码优选数学模型,并探讨了合适的搜索算法。 相似文献
22.
Tomik Yaghoobian Ian F. Blake 《Applicable Algebra in Engineering, Communication and Computing》1994,5(1):23-43
The subject of decoding Reed-Solomon codes is considered. By reformulating the Berlekamp and Welch key equation and introducing new versions of this key equation, two new decoding algorithms for Reed-Solomon codes will be presented. The two new decoding algorithms are significant for three reasons. Firstly the new equations and algorithms represent a novel approach to the extensively researched problem of decoding Reed-Solomon codes. Secondly the algorithms have algorithmic and implementation complexity comparable to existing decoding algorithms, and as such present a viable solution for decoding Reed-Solomon codes. Thirdly the new ideas presented suggest a direction for future research. The first algorithm uses the extended Euclidean algorithm and is very efficient for a systolic VLSI implementation. The second decoding algorithm presented is similar in nature to the original decoding algorithm of Peterson except that the syndromes do not need to be computed and the remainders are used directly. It has a regular structure and will be efficient for implementation only for correcting a small number of errors. A systolic design for computing the Lagrange interpolation of a polynomial, which is needed for the first decoding algorithm, is also presented.This research was supported by a grant from the Canadian Institute for Telecommunications Research under the NCE program of the Government of Canada 相似文献
23.
He Ping 《电子科学学刊(英文版)》1994,11(4):296-302
The minimum squared Euclidean distance(MSED) of binary multi-h phase codes is presented. The signal segregation degree(SSD) has been put forward to determine MSED of multi-h phase codes. In order to maximize MSED, SSD should be as large as possible. The necessary and sufficient conditions of maximizing
SSD are derived. Finally, SSD and the exact formulae for MSED of binary 2-h phase codes are also presented. 相似文献
24.
Long-Wen Chang Shui-kung Chuag Shang-shung Yu 《Multidimensional Systems and Signal Processing》1994,5(3):319-330
The compression of Chinese characters is very important for Chinese office automation and desktop publishing. In this paper, various methods are used to compress 13,051 Chinese characters losslessly by coding their skeleton points. The skeleton points are composed of isolated points and curves. To trace every point in a curve once and consecutively is a NP problem. Therefore, we use contour path following and revisiting algorithms to trace skeleton curves with chain codes. The remaining isolated skeleton points are encoded by an Elias code. Our coding method has a better compression rate than that of conventional skeleton coding. 相似文献
25.
Paul Camion Bernard Courteau Philippe Delsarte 《Applicable Algebra in Engineering, Communication and Computing》1992,2(3):147-162
The concept of the combinatorial matrix of an unrestricted code and the notion of anr-partition design admitted by a code are introduced and discussed in detail. The theory includes a characterization of completely regular codes, and a combinatorial interpretation of the fact that the distinct rows of the distance distribution matrix of a code are linearly independent. In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined system of linear equations; this is an efficient technique provided the number of classes in the partition is relatively small. 相似文献
26.
1 IntroductionHowtosuppresstheinterferenceintheCDMAsystems,includingtheSelfInterference(SI) ,Mul tipleAccessInterference(MAI)andtheAdjacentCellInterference(ACI) ,isthekeypointinimprov ingthesystemperformanceandcapacity .Insteadofthecomplicatedspecializedsignalprocessingtech niquesusedbefore[1~ 4] ,spreadingsequenceswithgoodcorrelationpropertiescanimprovethesystemperformanceradically[5] .InRef.[6~ 9],theconceptofZeroCorrelationZone (ZCZ) ,whichisequivalenttothegeneralizedothogonal… 相似文献
27.
The bit error rate (BER) performance of a turbo‐coded code‐division multiple‐access (CDMA) system operating in a satellite channel is analysed and simulated. The system performance is compared for various constituent decoders, including maximum a posteriori probability (MAP) and Max‐Log‐MAP algorithms, and the soft‐output Viterbi algorithm. The simulation results indicate that the Max‐Log‐MAP algorithm is the most promising among these three algorithms in overall terms of performance and complexity. It is also shown that, for fixed code rate, the BER performance is improved substantially by increasing the number of iterations in the turbo decoder, or by increasing the interleaver length in the turbo encoder. The results in this paper are of interest in CDMA‐based satellite communications applications. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
28.
Tom Verhoeff 《Distributed Computing》1988,3(1):1-8
The problem of delay-insensitive data communication is described. The notion of delay-insensitive code is defined, giving precise conditions under which delay-insensitive data communication is feasible. Examples of these codes are presented and analyzed. It appears that delay-insensitive codes are equivalent with antichains in partially ordered sets and with all unidirectional error-detecting codes.
Tom Verhoeff received the B.S. and M.S. degrees in mathematics from Eindhoven University of Technology, The Netherlands, in 1985. He is currently an Assistant Professor at the Department of Mathematics and Computing Science of the same university. His main research interests are parallel computations, especially formalisms for their specification and design, and their implementation as delay-insensitive VLSI circuits. 相似文献
29.
30.