首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   582373篇
  免费   7006篇
  国内免费   1595篇
化学   308242篇
晶体学   8681篇
力学   27007篇
综合类   22篇
数学   69682篇
物理学   177340篇
  2021年   5108篇
  2020年   5531篇
  2019年   6217篇
  2018年   8283篇
  2017年   8189篇
  2016年   12145篇
  2015年   7388篇
  2014年   11599篇
  2013年   26543篇
  2012年   20601篇
  2011年   24987篇
  2010年   18093篇
  2009年   18043篇
  2008年   23213篇
  2007年   23025篇
  2006年   21100篇
  2005年   18848篇
  2004年   17483篇
  2003年   15512篇
  2002年   15450篇
  2001年   17119篇
  2000年   12971篇
  1999年   10159篇
  1998年   8405篇
  1997年   8263篇
  1996年   7959篇
  1995年   7158篇
  1994年   7118篇
  1993年   6886篇
  1992年   7707篇
  1991年   7831篇
  1990年   7465篇
  1989年   7334篇
  1988年   7294篇
  1987年   7153篇
  1986年   6792篇
  1985年   8769篇
  1984年   9016篇
  1983年   7258篇
  1982年   7336篇
  1981年   7276篇
  1980年   6733篇
  1979年   7384篇
  1978年   7529篇
  1977年   7574篇
  1976年   7491篇
  1975年   6922篇
  1974年   6816篇
  1973年   6946篇
  1972年   5013篇
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
991.
Ohanian  M.  Caraballo  R.  Dalchiele  E. A.  Quagliata  E. 《Hyperfine Interactions》2003,148(1-4):193-198
Hyperfine Interactions - Corrosion products formed on low alloy steel under two marine environments are characterised. Both environments are classified as C4 according to the ISO 9223 Standard. The...  相似文献   
992.
为阐述放射性9C束流应用于治癌的物理基础, 运用一个球形生物组织等效正比计数器测量了9C束流不同贯穿深度上的线能谱, 得到了沿束流贯穿深度上的剂量平均线能分布. 将实验测量得到的线能谱转换成为不同传能线密度在吸收剂量中所占份额的分布, 得到了该9C束流在不同贯穿深度上的剂量平均传能线密度分布. 将生物组织等效正比计数器测量得到的与先前通过平行板正比计数器测量得到的该9C束流的剂量平均传能线密度分布进行比较, 发现: 在束流入射通道上, 两者测量数据符合很好, 而在束流Bragg峰附近9C离子的沉积区域, 由组织等效正比计数器测量得到的剂量平均传能线密度值大于由平行板正比计数器测量得到的值.  相似文献   
993.
In this article the main theorem establishes the necessity and sufficiency of the Poincaré-Hopf inequalities in order for the Morse inequalities to hold. The convex hull of the collection of all Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data determines a Morse polytope defined on the nonnegative orthant. Using results from network flow theory, a scheme is provided for constructing all possible Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data. Geometrical properties of this polytope are described.

  相似文献   

994.
We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of times, the k-level has subquadratic (O(n2-1/2s) complexity. This answers one of the main open problems from the author’s previous paper [DCG 29, 375-393 (2003)], which provided a weaker upper bound for a restricted class of curves only (graphs of degree-s polynomials). When combined with existing tools (cutting curves, sampling, etc.), the new idea generates a slew of improved k-level results for most of the curve families studied earlier, including a near-O(n3/2 bound for parabolas.  相似文献   
995.
Let K be ? or an imaginary quadratic number field, and q ∈ K an integer with ¦q¦ > 1. We give a quantitative version of Σn≥1 an/(qn ? 1) ? K for non-zero periodic sequences (an) in K of period length ≤ 2. As a corollary, we get a quantitative version of the linear independence over K of 1, the q-harmonic series, and a q-analogue of log 2. A similar result on 1, the q-harmonic series, and a q-analogue of ζ(2) is also proved. Mathematics Subject Classification (2000): 11J72, 11J82  相似文献   
996.
997.
Methods for obtaining alkylindoles, excluding the Fischer synthesis and direct alkylation, developed during the last 15 years are correlated.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 9, pp. 1155–1172, September, 1987.  相似文献   
998.
The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents anO(n 2) time sequential algorithm and anO(n 2/p+logn) time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, wherep andn represent respectively the number of processors and the number of vertices of the circular-arc graph.  相似文献   
999.

The influence of the substrate temperature T sub (20–360°C) and the oxygen pressure P(O2) (5 × 10−3−0.13 Pa) in an evaporation chamber on the structure and phase composition of films prepared through laser sputtering of a vanadium target is investigated by electron diffraction and in situ transmission electron microscopy (with the use of the bend extinction contour technique for determining the bending of the crystal lattice). It is demonstrated that the oxygen content in the films increases with an increase in the oxygen pressure P(O2) at a fixed substrate temperature T sub and decreases with an increase in the substrate temperature T sub at a fixed oxygen pressure P(O2). The conditions responsible for the formation and composition of the crystalline (VO0.9) and amorphous (V2O3) phases in the films are determined. It is established that the phase composition of the film depends on the angle of condensation of the vapor-plasma flow. The crystallization of the V2O3 amorphous phase is accompanied by an increase in the density by 9.2%. It is revealed that the V2O3 spherulites growing in the amorphous film have a bent crystal lattice. The bending of the crystal lattice can be as large as ∼42 deg/μm.

  相似文献   
1000.
Furocoumarins modified by amino acids were prepared by condensation of the N-hydroxysuccinimide ester of 3-(2,3,5-trimethyl-7-oxofuro[3,2-g]chromen-6-yl)propanoic acid with amino acids.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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