全文获取类型
收费全文 | 3307篇 |
免费 | 250篇 |
国内免费 | 204篇 |
专业分类
化学 | 107篇 |
力学 | 67篇 |
综合类 | 39篇 |
数学 | 766篇 |
物理学 | 475篇 |
综合类 | 2307篇 |
出版年
2024年 | 6篇 |
2023年 | 35篇 |
2022年 | 58篇 |
2021年 | 67篇 |
2020年 | 89篇 |
2019年 | 67篇 |
2018年 | 59篇 |
2017年 | 81篇 |
2016年 | 75篇 |
2015年 | 94篇 |
2014年 | 153篇 |
2013年 | 182篇 |
2012年 | 134篇 |
2011年 | 169篇 |
2010年 | 127篇 |
2009年 | 181篇 |
2008年 | 202篇 |
2007年 | 252篇 |
2006年 | 251篇 |
2005年 | 253篇 |
2004年 | 234篇 |
2003年 | 156篇 |
2002年 | 137篇 |
2001年 | 117篇 |
2000年 | 94篇 |
1999年 | 93篇 |
1998年 | 69篇 |
1997年 | 71篇 |
1996年 | 35篇 |
1995年 | 52篇 |
1994年 | 35篇 |
1993年 | 22篇 |
1992年 | 24篇 |
1991年 | 28篇 |
1990年 | 13篇 |
1989年 | 12篇 |
1988年 | 14篇 |
1987年 | 10篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1971年 | 2篇 |
1969年 | 1篇 |
1955年 | 2篇 |
排序方式: 共有3761条查询结果,搜索用时 31 毫秒
211.
212.
Iwan M. Duursma 《Transactions of the American Mathematical Society》1999,351(9):3609-3639
The in general hard problem of computing weight distributions of linear codes is considered for the special class of algebraic-geometric codes, defined by Goppa in the early eighties. Known results restrict to codes from elliptic curves. We obtain results for curves of higher genus by expressing the weight distributions in terms of -series. The results include general properties of weight distributions, a method to describe and compute weight distributions, and worked out examples for curves of genus two and three.
213.
A Uniquely Decodable (UD) Code is a code such that any vector of the ambient space has a unique closest codeword. In this paper we begin a study of the structure of UD codes and identify perfect subcodes. In particular we determine all linear UD codes of covering radius 2. 相似文献
214.
An ordered list of binary words of length n is called a distance-preserving m, n-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n-codes is presented, based on the standard Gray code and on some simple tools from linear algebra. 相似文献
215.
稼轩词中“西北”语词释说 总被引:1,自引:0,他引:1
崔海正 《上饶师范学院学报》2004,24(1):5-7
方位词“西北”在稼轩词中已成为一个具有特殊意义的代码或符号,它与神话传说、华夏情结、汉唐气象、帝都观念等文化传承相关,并由此从一个侧面窥见到稼轩南归后的情感轨迹及其诗、词差异。 相似文献
216.
Zhi-Hui Geng Pu-Kun Liu 《International Journal of Infrared and Millimeter Waves》2004,25(7):1133-1142
The beam-wave interaction in a Ka-band, two-cavity fundamental gyroklystron amplifier is studied by using a self-consistent nonlinear simulation code. The electron efficiency for this gyroklystron amplifier is calculated, and the effect of various parameters, such as beam voltage, beam current, electron guiding center radius, velocity pitch ratio and drift tube length on the electron efficiency is discussed in detail. 相似文献
217.
Xin?YangEmail author Mali?Gong Lei?Huang Ping?Yan Haitao?Zhang 《Optical and Quantum Electronics》2004,36(12):1079-1088
In this paper, the authors investigate the performance of recently presented run-length limited (4, 18) code for high density optical storage systems. The construction of the code is described simply. The code has code rate R = 1/3 and density ratio (DR) = 1.67. The bit error rate (BER) performance for decision feedback equalizer (DFE) and partial response maximum likelihood (PRML) detector are simulated, considering signal-to-noise ratio (SNR) and optical channel jitter. The result shows that the performance of the code is acceptable. The encoder and decoder of the code are implemented by complex programmable logic device (CPLD) chip and the hardware resources required for encoder and decoder arelow. 相似文献
218.
计算机在处理蒙文信息过程中的一些问题的探讨 总被引:1,自引:1,他引:0
讨论了用计算机处理蒙文信息过程中遇到的一些问题,并提出了解决这些问题的可行性方案。 相似文献
219.
Generalized Steiner systems GS(2, 4, v, g) were first introduced by Etzion and were used to construct optimal constant weight codes over an alphabet of size g + 1 with minimum Hamming distance 5, in which each codeword has length v and weight 4. Etzion conjectured that the necessary conditions v 1 (mod 3) and v ; 7 are also sufficient for the existence of a GS(2,4,v,2). Except for the example of a GS(2,4,10,2) and some recursive constructions given by Etzion, nothing else is known about this conjecture. In this paper, Weil's theorem on character sum estimates is used to show that the conjecture is true for any prime power v 7 (mod 12) except v = 7, for which there does not exist a GS(2,4,7,2). 相似文献
220.
Todd D. Vance 《Designs, Codes and Cryptography》2000,19(1):27-43
The weight distribution of GRM (generalized Reed-Muller) codes is unknown in general. This article describes and applies some new techniques to the codes over F3. Specifically, we decompose GRM codewords into words from smaller codes and use this decomposition, along with a projective geometry technique, to relate weights occurring in one code with weights occurring in simpler codes. In doing so, we discover a new gap in the weight distribution of many codes. In particular, we show there is no word of weight 3m–2 in GRM3(4,m) for m>6, and for even-order codes over the ternary field, we show that under certain conditions, there is no word of weight d+, where d is the minimum distance and is the largest integer dividing all weights occurring in the code. 相似文献