全文获取类型
收费全文 | 577篇 |
免费 | 40篇 |
国内免费 | 21篇 |
专业分类
化学 | 43篇 |
力学 | 9篇 |
综合类 | 10篇 |
数学 | 555篇 |
物理学 | 21篇 |
出版年
2024年 | 3篇 |
2023年 | 3篇 |
2022年 | 14篇 |
2021年 | 5篇 |
2020年 | 20篇 |
2019年 | 17篇 |
2018年 | 16篇 |
2017年 | 13篇 |
2016年 | 16篇 |
2015年 | 7篇 |
2014年 | 20篇 |
2013年 | 36篇 |
2012年 | 18篇 |
2011年 | 30篇 |
2010年 | 25篇 |
2009年 | 36篇 |
2008年 | 43篇 |
2007年 | 32篇 |
2006年 | 49篇 |
2005年 | 22篇 |
2004年 | 21篇 |
2003年 | 17篇 |
2002年 | 19篇 |
2001年 | 27篇 |
2000年 | 19篇 |
1999年 | 28篇 |
1998年 | 26篇 |
1997年 | 13篇 |
1996年 | 10篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有638条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
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]. 相似文献
3.
Anthony B. Evans 《Designs, Codes and Cryptography》2006,40(1):121-130
In 1779 Euler proved that for every even n there exists a latin square of order n that has no orthogonal mate, and in 1944 Mann proved that for every n of the form 4k + 1, k ≥ 1, there exists a latin square of order n that has no orthogonal mate. Except for the two smallest cases, n = 3 and n = 7, it is not known whether a latin square of order n = 4k + 3 with no orthogonal mate exists or not. We complete the determination of all n for which there exists a mate-less latin square of order n by proving that, with the exception of n = 3, for all n = 4k + 3 there exists a latin square of order n with no orthogonal mate. We will also show how the methods used in this paper can be applied more generally by deriving several
earlier non-orthogonality results. 相似文献
4.
In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (aij), for all i and j it holds that aij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007 相似文献
5.
本文解决了超立方体的Laplace矩阵的谱问题.n维超立方体Q。的Laplace矩阵L(Q)的谱specL(Qn)。[0 2 4…2n Cn^0 Cn^1 Cn^2 … Cn^n],.其中2t(t=0,1,2,…,n)为L(Qn)的n+1个不同的特征值,二项式系数Cn为特征值2t的重数. 相似文献
6.
We prove that for every fixed k and ? ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 ?. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, that is, have the property that for every k, any k‐edge coloring of a sufficiently large Qn contains a monochromatic copy of H. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 196–208, 2006 相似文献
7.
Bram van Asch Henk Hollmann Henk van Tilborg 《Journal of Combinatorial Theory, Series A》2006,113(8):1594-1613
When Jack van Lint was appointed as full professor at the Eindhoven University of Technology at the age of 26 he combined a PhD in number theory with a very open scientific mind. It took a sabbatical visit to Bell Laboratories in 1966 to make him understand that a new and fascinating field of applied mathematics was emerging: discrete mathematics. It fascinated and inspired him for the rest of his life. When he passed away on September 28, 2004, he left behind a legacy of 18 books and 177 articles, covering many aspects of coding theory, combinatorics, and finite geometry.van Lint was also a strong international advocate of the role that discrete mathematics ought to play in modern applied mathematics curricula. Quite a few departments sought his advice. Years later, four different universities showed their appreciation by awarding him an honorary degree.This overview is an homage to van Lint's academic achievements and can serve as an introduction to his work for younger generations. 相似文献
8.
9.
In this paper, some new uniform frames with block size four and index one or three are obtained. The known existence results for (4,1)‐frames and (4,3)‐frames are both improved to the extent that only a finite number of possible exceptions remain. © 2003 Wiley Periodicals, Inc. 相似文献
10.
This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families. 相似文献