首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2892篇
  免费   264篇
  国内免费   120篇
电工技术   67篇
综合类   402篇
化学工业   20篇
金属工艺   14篇
机械仪表   40篇
建筑科学   180篇
矿业工程   7篇
能源动力   33篇
轻工业   10篇
水利工程   5篇
石油天然气   6篇
武器工业   11篇
无线电   1429篇
一般工业技术   157篇
冶金工业   63篇
原子能技术   148篇
自动化技术   684篇
  2024年   6篇
  2023年   19篇
  2022年   23篇
  2021年   28篇
  2020年   41篇
  2019年   48篇
  2018年   46篇
  2017年   70篇
  2016年   80篇
  2015年   102篇
  2014年   134篇
  2013年   272篇
  2012年   178篇
  2011年   198篇
  2010年   161篇
  2009年   169篇
  2008年   225篇
  2007年   241篇
  2006年   201篇
  2005年   187篇
  2004年   139篇
  2003年   136篇
  2002年   85篇
  2001年   77篇
  2000年   59篇
  1999年   63篇
  1998年   37篇
  1997年   48篇
  1996年   38篇
  1995年   14篇
  1994年   31篇
  1993年   17篇
  1992年   18篇
  1991年   17篇
  1990年   17篇
  1989年   16篇
  1988年   5篇
  1987年   2篇
  1985年   8篇
  1984年   3篇
  1983年   5篇
  1982年   4篇
  1981年   2篇
  1980年   1篇
  1978年   1篇
  1966年   2篇
  1965年   1篇
  1961年   1篇
排序方式: 共有3276条查询结果,搜索用时 15 毫秒
21.
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  相似文献   
22.
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.  相似文献   
23.
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.  相似文献   
24.
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.  相似文献   
25.
1 IntroductionHowtosuppresstheinterferenceintheCDMAsystems,includingtheSelfInterference(SI) ,Mul tipleAccessInterference(MAI)andtheAdjacentCellInterference(ACI) ,isthekeypointinimprov ingthesystemperformanceandcapacity .Insteadofthecomplicatedspecializedsignalprocessingtech niquesusedbefore[1~ 4] ,spreadingsequenceswithgoodcorrelationpropertiescanimprovethesystemperformanceradically[5] .InRef.[6~ 9],theconceptofZeroCorrelationZone (ZCZ) ,whichisequivalenttothegeneralizedothogonal…  相似文献   
26.
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.  相似文献   
27.
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.  相似文献   
28.
29.
We use the special geometry of singular points of algebraic differential equations on the affine plane over finite fields to study the main features and parameters of error correcting codes giving by evaluating functions at sets of singular points. In particular, one gets new methods to construct codes with designed minimum distance. This work was partially supported by MCyT BFM2001-2251.  相似文献   
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号