全文获取类型
收费全文 | 3942篇 |
免费 | 315篇 |
国内免费 | 496篇 |
专业分类
化学 | 2545篇 |
晶体学 | 27篇 |
力学 | 186篇 |
综合类 | 52篇 |
数学 | 1561篇 |
物理学 | 382篇 |
出版年
2024年 | 4篇 |
2023年 | 81篇 |
2022年 | 96篇 |
2021年 | 152篇 |
2020年 | 182篇 |
2019年 | 161篇 |
2018年 | 105篇 |
2017年 | 150篇 |
2016年 | 165篇 |
2015年 | 102篇 |
2014年 | 170篇 |
2013年 | 280篇 |
2012年 | 150篇 |
2011年 | 177篇 |
2010年 | 154篇 |
2009年 | 210篇 |
2008年 | 210篇 |
2007年 | 237篇 |
2006年 | 240篇 |
2005年 | 197篇 |
2004年 | 197篇 |
2003年 | 222篇 |
2002年 | 168篇 |
2001年 | 145篇 |
2000年 | 119篇 |
1999年 | 127篇 |
1998年 | 89篇 |
1997年 | 100篇 |
1996年 | 76篇 |
1995年 | 70篇 |
1994年 | 46篇 |
1993年 | 32篇 |
1992年 | 30篇 |
1991年 | 25篇 |
1990年 | 22篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 5篇 |
1977年 | 1篇 |
1972年 | 3篇 |
1971年 | 1篇 |
排序方式: 共有4753条查询结果,搜索用时 203 毫秒
21.
Tsonka Stefanova Baicheva 《Designs, Codes and Cryptography》1998,13(3):223-227
The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer
and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated. 相似文献
22.
1 Introduction Moderndigitalcommunicationsystemsoftenrequireerror freetransmission .Errorcontrolcodingtechnologyhasbeenusedwidelyincommunicationsystem .Andithasbeenimprovingtheperformanceofcommunicationsystem greatly ,especiallyinwirelesscommunicationss… 相似文献
23.
Fusion-evaporation cross-sections for the α-induced reactions upon197Au,193Ir,191Ir,185Re,181Ta,121Sb and69Ga nuclei at bombarding energies near the Coulomb barrier have been measured by off-line observation of the γ-rays emitted
in the radioactive decay of the residual nuclei using stacked foil technique. The total fusion cross-section for the systems
have been compared with simple statistical model calculations using the code ALICE/91 as well as with the coupled channel
calculations that include the β2 and ν4 slatic deformations and dynamic couplings of the vibrational/rotational states of the target and the projet tile using the
code CCDEF. 相似文献
24.
Recently extremal double circulant self-dual codes have been classified for lengths n ≤ 62. In this paper, a complete classification
of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant
singly-even codes given have weight enumerators for which extremal codes were not previously known to exist. 相似文献
25.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
26.
关于体上分块矩阵的群逆 总被引:1,自引:0,他引:1
本文利用分块矩阵方法.研究了体上两个矩阵乘积的群逆的存在性及表示形式,给出了体上两个矩阵乘积群逆存在的充分必要条件和表示形式.并且在一定条件下.给出了体上分块矩阵的群逆存在性及表示形式. 相似文献
27.
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal
constant composition codes meeting the upper bound given by [13]. 相似文献
28.
Michael Giudici 《Designs, Codes and Cryptography》2006,39(2):163-172
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial
cosets of E in C.
Michael Giudici - The author holds an Australian Postdoctoral Fellowship. 相似文献
29.
John A. Ryan 《Discrete Applied Mathematics》2006,154(2):399-412
We consider irreducible Goppa codes over Fq of length qn defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes. 相似文献
30.
Luke Pebody 《Journal of Combinatorial Theory, Series A》2006,113(3):551-555
Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]n. 相似文献