首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   100266篇
  免费   3381篇
  国内免费   2958篇
化学   39930篇
晶体学   1124篇
力学   7864篇
综合类   198篇
数学   34252篇
物理学   23237篇
  2023年   350篇
  2022年   666篇
  2021年   707篇
  2020年   759篇
  2019年   756篇
  2018年   10953篇
  2017年   10819篇
  2016年   6931篇
  2015年   1830篇
  2014年   1463篇
  2013年   1901篇
  2012年   5728篇
  2011年   12508篇
  2010年   7020篇
  2009年   7462篇
  2008年   8085篇
  2007年   10127篇
  2006年   1564篇
  2005年   2447篇
  2004年   2468篇
  2003年   2705篇
  2002年   1713篇
  2001年   848篇
  2000年   777篇
  1999年   534篇
  1998年   508篇
  1997年   401篇
  1996年   457篇
  1995年   324篇
  1994年   288篇
  1993年   275篇
  1992年   226篇
  1991年   207篇
  1990年   186篇
  1989年   156篇
  1988年   161篇
  1987年   124篇
  1986年   134篇
  1985年   153篇
  1984年   122篇
  1983年   108篇
  1982年   94篇
  1981年   88篇
  1980年   96篇
  1979年   82篇
  1978年   67篇
  1977年   55篇
  1976年   53篇
  1974年   59篇
  1973年   69篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
We show that in each dimension n = 4k, k≥ 2, there exist infinite sequences of closed simply connected Riemannian n-manifolds with nonnegative sectional curvature and mutually distinct oriented cobordism type. W. Tuschmann’s research was supported in part by a DFG Heisenberg Fellowship.  相似文献   
142.
In this article, a kind of auxiliary design BSA* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007  相似文献   
143.
We prove that assuming enough roots of unity in the base field, a central simple algebra of exponent 2 which is split by a dihedral group, is also split by certain abelian groups.  相似文献   
144.
The multivariate model, where not only parameters of the mean value of the observation matrix, but also some other parameters occur in constraints, is considered in the paper. Some basic inference is presented under the condition that the covariance matrix is either unknown, or partially unknown, or known. Supported by the grant of the Council of Czech Republic MSM 6 198 959 214.  相似文献   
145.
We show that open 3-manifolds that have a locally finite decomposition along 2-spheres are characterized by the existence of a Riemannian metric with respect to which the second homotopy group of the manifold is generated by small elements. Received: November 2005 Revision: February 2006 Accepted: May 2006  相似文献   
146.
In this paper, we investigate symplectic manifolds endowed with a Morse–Bott function with only two critical submanifolds, one of which is Lagrangian while the other one is symplectic.  相似文献   
147.
For a general K3 surface S of genus g, with 2 ≤ g ≤ 10, we prove that the intermediate Jacobians of the family of prime Fano threefolds of genus g containing S as a hyperplane section, form generically an algebraic completely integrable Hamiltonian system. The first author is partially supported by grant MI1503/2005 of the Bulgarian Foundation for Scientific Research.  相似文献   
148.
In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.  相似文献   
149.
We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3. Both authors are supported by the NSF grants DMS-0308985 and DMS-0456185. Yaroslav Vorobets is supported by a Clay Research Scholarship.  相似文献   
150.
This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the motor cycle industry. Practical constraints mean that the problem differs somewhat from those tackled elsewhere in the literature. In particular, the layouts need to conform to a given structure. This is achieved by using a local search algorithm with an appropriate starting solution and a series of neighbourhoods designed to preserve the layout structure. Empirical evidence based on real data shows that the quality of the resulting solutions closely matches that of cutting patterns currently produced by human experts. Computation times average around 20–30?s per order as compared to several hours for an equivalent manual solution.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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