首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6054篇
  免费   156篇
  国内免费   52篇
化学   102篇
晶体学   2篇
力学   44篇
综合类   9篇
数学   5053篇
物理学   297篇
无线电   755篇
  2023年   7篇
  2022年   12篇
  2021年   7篇
  2020年   11篇
  2019年   48篇
  2018年   46篇
  2017年   28篇
  2016年   37篇
  2015年   36篇
  2014年   70篇
  2013年   215篇
  2012年   191篇
  2011年   194篇
  2010年   192篇
  2009年   884篇
  2008年   789篇
  2007年   622篇
  2006年   330篇
  2005年   307篇
  2004年   276篇
  2003年   308篇
  2002年   397篇
  2001年   366篇
  2000年   110篇
  1999年   46篇
  1998年   38篇
  1997年   35篇
  1996年   53篇
  1995年   61篇
  1994年   57篇
  1993年   58篇
  1992年   48篇
  1991年   41篇
  1990年   55篇
  1989年   43篇
  1988年   34篇
  1987年   40篇
  1986年   29篇
  1985年   61篇
  1984年   23篇
  1983年   3篇
  1982年   13篇
  1981年   7篇
  1980年   10篇
  1979年   5篇
  1978年   7篇
  1977年   7篇
  1976年   5篇
排序方式: 共有6262条查询结果,搜索用时 15 毫秒
201.
For X,Y,>0, let and define I 8(X,Y,) to be the cardinality of the set. In this paper it is shown that, for >0, Y 2/X 3=O(), =O(Y 3/X 3) and X=O (Y 2), one has I 8(X,Y,)=O(X 2 Y 2+X min (X {3/2} Y 3, X {11/2} Y {–1})+X min ({1/3} X 2 Y 3, X {14/3} Y {1/3})), with the implicit constant depending only on . There is a brief report on an application of this that leads, by way of the Bombieri-Iwaniec method for exponential sums, to some improvement of results on the mean squared modulus of a Dirichlet L-function along a short interval of its critical line.  相似文献   
202.
Construction of Pseudorandom Binary Sequences Using Additive Characters   总被引:6,自引:0,他引:6  
In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of small order are small, but the price paid for the fast computation is that the correlations of large order can be large.  相似文献   
203.
Continuous wavelets are often studied in the general framework of representation theory of square-integrable representations, or by using convolution relations and Fourier transforms. We consider the well-known problem whether these continuous wavelets can be discretized to yield wavelet frames. In this paper we use Calderón-Zygmund singular integral operators and atomic decompositions on spaces of homogeneous type, endowed with families of general translations and dilations, to attack this problem, and obtain strong convergence results for wavelets expansions in a variety of classical functional spaces and smooth molecule spaces. This approach is powerful enough to yield, in a uniform way, for example, frames of smooth wavelets for matrix dilations in n, for an affine extension of the Heisenberg group, and on many commutative hypergroups.  相似文献   
204.
As is well-known, there exists a Weil pairing for elliptic curves which is a perfect bilinear form from the m-torsion of the elliptic curve E to the m-th roots of unity. In this paper we will show how Andersons paper [1] gives rise to an analogue of this pairing for Drinfeld modules.The author was supported by NWO Grant 613.007.040. The author would like to thank G. Böckle and S. J. Edixhoven for their comments.  相似文献   
205.
We point out that the formalism of the trace map and reduction modulo p can be used to give a short proof for the fact first proved by Ogg that is not a Weierstrass point on X0(pM) where p is a prime not dividing M and the genus of X0(M) is zero.  相似文献   
206.
Projective metrics were first introduced by A. Cayley and F. Klein who constructed analytical models over the field of complex numbers. The aim of this paper is to give for the first time a purely synthetic definition of all projective spaces with Cayley-Klein metrics and to develop the synthetic foundation of projective-metric geometry to a level of generality including metrics over arbitrary fields of characteristic 2.  相似文献   
207.
We consider the poset SO(n) of all words over an n-element alphabet ordered by the subword relation. It is known that SO(2) falls into the class of Macaulay posets, i. e. there is a theorem of Kruskal–Katona type for SO(2). As the corresponding linear ordering of the elements of SO(2) the vip-order can be chosen.Daykin introduced the V-order which generalizes the vip-order to the n2 case. He conjectured that the V-order gives a Kruskal–Katona type theorem for SO(n).We show that this conjecture fails for all n3 by explicitly giving a counterexample. Based on this, we prove that for no n3 the subword order SO(n) is a Macaulay poset.  相似文献   
208.
Let B(H) denote the algebra of operators on a complex separable Hilbert space H, and let A $\in$ B(H) have the polar decomposition A = U|A|. The Aluthge transform is defined to be the operator . We say that A $\in$ B(H) is p-hyponormal, . Let . Given p-hyponormal , such that AB is compact, this note considers the relationship between denotes an enumeration in decreasing order repeated according to multiplicity of the eigenvalues of the compact operator T (respectively, singular values of the compact operator T). It is proved that is bounded above by and below by for all j = 1, 2, . . . and that if also is normal, then there exists a unitary U1 such that for all j = 1, 2, . . ..  相似文献   
209.
We consider here a class of nonlinear Dirichlet problems, in a bounded domain , of the form
investigating the problem of uniqueness of solutions. The functions (s) and satisfy rather general assumptions of locally Lipschitz continuity (with possibly exponential growth) and the datum f is in L1(). Uniqueness of solutions is proved both for coercive a(x, s) and for the case of a(x, s) degenerating for s large.  相似文献   
210.
The purpose of this paper is first to show that -semidistributive lattices can be characterized by a simplicial elimination scheme in the same sense as upper locally distributive lattices or antimatroids. Secondly, we show that this elimination scheme leads to an interval collapsing algorithm and a constructing algorithm for semidistributive lattices.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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