首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   978篇
  免费   42篇
  国内免费   30篇
化学   7篇
晶体学   3篇
力学   6篇
综合类   18篇
数学   822篇
物理学   194篇
  2024年   1篇
  2023年   33篇
  2022年   52篇
  2021年   51篇
  2020年   46篇
  2019年   26篇
  2018年   19篇
  2017年   24篇
  2016年   31篇
  2015年   18篇
  2014年   35篇
  2013年   39篇
  2012年   14篇
  2011年   32篇
  2010年   22篇
  2009年   64篇
  2008年   75篇
  2007年   54篇
  2006年   61篇
  2005年   26篇
  2004年   29篇
  2003年   36篇
  2002年   53篇
  2001年   41篇
  2000年   33篇
  1999年   53篇
  1998年   29篇
  1997年   24篇
  1996年   15篇
  1995年   3篇
  1994年   1篇
  1993年   1篇
  1992年   3篇
  1991年   1篇
  1984年   1篇
  1983年   1篇
  1982年   1篇
  1979年   1篇
  1977年   1篇
排序方式: 共有1050条查询结果,搜索用时 15 毫秒
31.
32.
Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three nonzeros. Recently, the authors of [37] constructed a class of cyclic codes with arbitrary number of nonzeros, and computed the weight distribution for several cases. In this paper, we determine the weight distribution for a new family of such codes. This is achieved by introducing certain new methods, such as the theory of Jacobi sums over finite fields and subtle treatment of some complicated combinatorial identities.  相似文献   
33.
34.
35.
In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m + uFp^m, where p is an odd prime. On the basis of the works of Dinh (in J.Algebra 324,940-950,2010), we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m + uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.  相似文献   
36.
利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造(n,m,t)弹性函数,其非线性度为2^n-1-2^n-l/2-1+2^l/2.nlmax(n-l,m,t),在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的.  相似文献   
37.
设X*是字母表X上的自由幺半群,以X*为顶点集构造一个语言图Γ(X*),引入语言图Γ(X*)的模截集的概念,给出了极大前缀码的一些性质,给出了极大前缀码的部分幂的一些性质,并推广了相关文献的结果。  相似文献   
38.
High-spin states in 163Lu have been investigated using the Euroball spectrometer array. The previously known superdeformed band has been extended at low and high energies, and its connection to the normal-deformed states has been established. From its decay the mixing amplitude and interaction strength between superdeformed and normal states are derived. In addition, a new band with a similar dynamic moment of inertia has been found. The experimental results are compared to cranking calculations which suggest that the superdeformed bands in this mass region correspond to shapes with a pronounced triaxiality (γ≈±20°).  相似文献   
39.
The photon energy differential shape of the second order matrix element for the two-photon (2E1) decay of the 1s2s1S0 level in He-like gold has been measured. The results are in agreement with a recent fully relativistic calculation. The corresponding 2E1 matrix element deviates from those in lighter He-like systems due to the strong central field in a heavy two-electron ion.  相似文献   
40.
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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