全文获取类型
收费全文 | 1103篇 |
免费 | 42篇 |
国内免费 | 31篇 |
专业分类
化学 | 7篇 |
晶体学 | 3篇 |
力学 | 6篇 |
综合类 | 20篇 |
数学 | 941篇 |
物理学 | 199篇 |
出版年
2024年 | 1篇 |
2023年 | 33篇 |
2022年 | 55篇 |
2021年 | 51篇 |
2020年 | 51篇 |
2019年 | 28篇 |
2018年 | 26篇 |
2017年 | 26篇 |
2016年 | 32篇 |
2015年 | 20篇 |
2014年 | 35篇 |
2013年 | 50篇 |
2012年 | 19篇 |
2011年 | 46篇 |
2010年 | 28篇 |
2009年 | 79篇 |
2008年 | 85篇 |
2007年 | 57篇 |
2006年 | 68篇 |
2005年 | 32篇 |
2004年 | 32篇 |
2003年 | 36篇 |
2002年 | 61篇 |
2001年 | 46篇 |
2000年 | 34篇 |
1999年 | 54篇 |
1998年 | 31篇 |
1997年 | 26篇 |
1996年 | 16篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1176条查询结果,搜索用时 15 毫秒
1.
2.
3.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
4.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
Valentin Brimkov 《Discrete Applied Mathematics》2007,155(14):1812-1825
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3. 相似文献