首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   80380篇
  免费   448篇
  国内免费   382篇
化学   26167篇
晶体学   802篇
力学   6737篇
数学   32157篇
物理学   15347篇
  2022年   108篇
  2021年   150篇
  2020年   92篇
  2019年   101篇
  2018年   10503篇
  2017年   10297篇
  2016年   6148篇
  2015年   927篇
  2014年   377篇
  2013年   466篇
  2012年   3940篇
  2011年   10684篇
  2010年   5720篇
  2009年   6113篇
  2008年   6701篇
  2007年   8899篇
  2006年   358篇
  2005年   1423篇
  2004年   1614篇
  2003年   2042篇
  2002年   1086篇
  2001年   275篇
  2000年   310篇
  1999年   168篇
  1998年   207篇
  1997年   167篇
  1996年   215篇
  1995年   124篇
  1994年   86篇
  1993年   103篇
  1992年   60篇
  1991年   72篇
  1990年   52篇
  1989年   61篇
  1988年   63篇
  1987年   63篇
  1986年   63篇
  1985年   60篇
  1984年   46篇
  1983年   39篇
  1982年   44篇
  1981年   48篇
  1980年   57篇
  1979年   51篇
  1978年   40篇
  1914年   46篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
241.
Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.  相似文献   
242.
243.
§ 1 IntroductionLetRn×mdenotetherealn×mmatrixspace ,Rn×mr itssubsetwhoseelementshaverankr ,ORn×nthesetofalln×northogonalmatrices,SRn×n(SRn×n≥ ,SRn×n>)thesetofalln×nrealsymmetric (symmetricpositivesemidefinite ,positivedefinite)matrices.ThenotationA>0 (≥ 0 ,<0 ,≤ 0 )m…  相似文献   
244.
245.
Let(X,‖·‖ ) be a Banach space.Let K be a nonempty closed,convex subset of Xand T∶K→K.Assume that T is Lipschitzian,i.e.there exists L>0 such that‖ T(x) -T(y)‖≤ L‖ x -y‖for all x,y∈K.Withoutloss of generality,assume that L≥ 1 .Assume also that T is strictly pseudocontractive.According to[1 ] this may be statedas:there exists k∈ (0 ,1 ) such that‖ x -y‖≤‖ x -y + r[(I -T -k I) x -(I -T -k I) y]‖for all r>0 and all x,y∈ K.Throughout,let N denote the set of positive in…  相似文献   
246.
The periodic precipitation pattern formation in gelatinous media is interpreted as a moving boundary problem. The time law, spacing law and width law are revisited on the basis of the new scenario. The explicit dependence of the geometric structure on the initial concentrations of the reactants is derived. Matalon—Packter law, which relates the spacing coefficient with the initial concentrations is reformulated removing many ambiguities and impractical parameters. Experimental results are discussed to establish the significance of moving boundary concept in the diffusion controlled pattern forming systems  相似文献   
247.
The rate-dependent effects in metallic ferromagnetic materials with magnetization processes attributed to domain-walls motion were studied. The experimental method for eddy-current relaxation time determination was proposed. Some discrepancies between the data and theoretical predictions were observed and discussed. The origin of these discrepancies is accounted for by the decrease of viscous-type relaxation process as the rate of change of averaged magnetization is approaching zero.  相似文献   
248.
249.
The Nambu-bracket quantization of the hydrogen atom is worked out as an illustration of the general method. The dynamics of topological open branes is controlled classically by Nambu brackets. Such branes then may be quantized through the consistent quantization of the underlying Nambu brackets: properly defined, the quantum Nambu-brackets comprise an associative structure, although the naive derivation property is mooted through operator entwinement. For superintegrable systems, such as the hydrogen atom, the results coincide with those furnished by Hamiltonian quantization - but the method is not limited to Hamiltonian systems.  相似文献   
250.
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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