首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   492202篇
  免费   6375篇
  国内免费   1843篇
化学   267278篇
晶体学   7227篇
力学   20540篇
综合类   9篇
数学   59352篇
物理学   146014篇
  2020年   3454篇
  2019年   3678篇
  2018年   4130篇
  2017年   3969篇
  2016年   7092篇
  2015年   5318篇
  2014年   7590篇
  2013年   22674篇
  2012年   16729篇
  2011年   20874篇
  2010年   13271篇
  2009年   13194篇
  2008年   18868篇
  2007年   19168篇
  2006年   18202篇
  2005年   16740篇
  2004年   14998篇
  2003年   13308篇
  2002年   13039篇
  2001年   14632篇
  2000年   11242篇
  1999年   8988篇
  1998年   7377篇
  1997年   7217篇
  1996年   7067篇
  1995年   6523篇
  1994年   6188篇
  1993年   6061篇
  1992年   6708篇
  1991年   6645篇
  1990年   6238篇
  1989年   6073篇
  1988年   6298篇
  1987年   5971篇
  1986年   5762篇
  1985年   8173篇
  1984年   8370篇
  1983年   6848篇
  1982年   7469篇
  1981年   7364篇
  1980年   7115篇
  1979年   7199篇
  1978年   7439篇
  1977年   7285篇
  1976年   7355篇
  1975年   6944篇
  1974年   6909篇
  1973年   7254篇
  1972年   4375篇
  1971年   3296篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
971.
We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.  相似文献   
972.
973.
Partially supported by NSF Grant DMS-9004123 and ARO through MSI Cornell (DAAG 29-85-C-0018)  相似文献   
974.
Zboril  R.  Mashlan  M.  Machala  L.  Walla  J.  Barcova  K.  Martinec  P. 《Hyperfine Interactions》2004,156(1-4):403-410
Hyperfine Interactions - The natural garnets from almandine (Fe3Al2Si3O12)–pyrope (Mg3Al2Si3O12) series with the iron to magnesium atomic ratio ranging from 0.2 to 1 were characterised and...  相似文献   
975.
Design theory crosses the boundary between mathematics and statistics, and includes a wide range of disparate types of design. In this paper we present a classification scheme which aims to include as many important types as possible, based on a balance among concept, representation and use.  相似文献   
976.
A system of linear homogeneous algebraic equations for the coupling constant ratios of vector mesons to hadrons is derived by imposing the assumed asymptotic behavior upon the VMD pole parameterization of an hadron electromagnetic form factor. A similar system of equations with a simpler structure of the coefficients, taken as even powers of the vector-meson masses, is derived by means of integral superconvergent sum rules for the imaginary part of the considered form factor using its appropriate -function approximation. Although both systems have been derived starting from different properties of the electromagnetic form factor and they each have their own appearances, it is shown explicitly that they are fully equivalent. Received: 20 March 2002 / Revised version: 3 December 2002 / Published online: 7 March 2003  相似文献   
977.
978.
For any two points p and q in the Euclidean plane, define LUNpq = { v | vR2, dpv < dpq and dqv < dpq}, where duv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUNpq(V) = V ∩ LUNpq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,qV, (p,q) is an edge of RNG(V) if and only if LUNpq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,qV, (p,q) is an edge of kRNG(V) if and only if | LUNpq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn2) time. Let Ec = {epq| pV and qV}. Then Gc = (V,Ec) is a complete graph. For any subset F of Ec, define the maximum distance of F as maxepqFdpq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph Gc whose maximum distance is the minimum among all Hamiltonian cycles in graph Gc. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.  相似文献   
979.
The time resolved dynamics of diffusionless cube → ring isomerization of the Na4Cl4 cluster was interrogated by constant energy molecular dynamics simulations, utilizing the first passage time method. The nonreactive isomerization induced by nonselective vibrational excitation is well accounted for in terms of the statistical RRK theory, opening avenues for experimental exploration of time-resolved cluster isomerization dynamics.  相似文献   
980.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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