首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   30232篇
  免费   1193篇
  国内免费   1337篇
化学   9773篇
晶体学   211篇
力学   449篇
综合类   69篇
数学   18134篇
物理学   4126篇
  2024年   23篇
  2023年   373篇
  2022年   245篇
  2021年   308篇
  2020年   489篇
  2019年   771篇
  2018年   710篇
  2017年   524篇
  2016年   575篇
  2015年   638篇
  2014年   956篇
  2013年   1827篇
  2012年   1111篇
  2011年   2062篇
  2010年   1623篇
  2009年   2105篇
  2008年   2338篇
  2007年   2172篇
  2006年   1659篇
  2005年   1206篇
  2004年   1117篇
  2003年   1023篇
  2002年   1242篇
  2001年   672篇
  2000年   644篇
  1999年   712篇
  1998年   581篇
  1997年   459篇
  1996年   568篇
  1995年   523篇
  1994年   476篇
  1993年   380篇
  1992年   315篇
  1991年   240篇
  1990年   214篇
  1989年   230篇
  1988年   155篇
  1987年   161篇
  1986年   149篇
  1985年   195篇
  1984年   145篇
  1983年   103篇
  1982年   144篇
  1981年   137篇
  1980年   91篇
  1979年   69篇
  1978年   71篇
  1977年   70篇
  1976年   62篇
  1971年   22篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
条件愈苦,意志愈坚 --记王淦昌早年的科研活动   总被引:1,自引:0,他引:1  
姚立澄 《物理》2006,35(2):160-167
文章介绍了中国物理学家王淦昌早期的科研工作,特别是在抗日战争时期的科研成绩.王淦昌早期的科研贡献并不是在先进的实验仪器上,在条件优裕的实验室内完成的,而是在实验设备缺乏,科学文献不足等极端困难的环境中完成的.从王淦昌身上,可以看到那个时代中国优秀科学家脚踏实地、执志若金的奋斗精神.  相似文献   
132.
Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.  相似文献   
133.
A new scheme of small compact optical frequency standard based on thermal calcium beam with application of 423 nm shelving detection and sharp-angle velocity selection detection is proposed. Combining these presented techniques, we conclude that a small compact optical frequency standard based on thermal calcium beam will outperform the commercial caesium-beam microwave dock, like the 5071 Cs clock (from Hp to Agilent, now Symmetricom company), both in accuracy and stability.  相似文献   
134.
本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定.  相似文献   
135.
Five polymer bonded explosives (PBXs) with the base explosive ε-CL-20 (hexanitrohexaazaisowurtzi- tane), the most important high energy density compound (HEDC), and five polymer binders (Estane 5703, GAP, HTPB, PEG, and F2314) were constructed. Molecular dynamics (MD) method was employed to investigate their binding energies (Ebind), compatibility, safety, mechanical properties, and energetic properties. The information and rules were reported for choosing better binders and guiding formula- tion design of high energy density material (HEDM). According to the calculated binding energies, the ordering of compatibility and stability of the five PBXs was predicted as ε-CL-20/PEG > ε-CL-20/ Estane5703 ≈ε-CL-20/GAP > ε-CL-20/HTPB > ε-CL-20/F2314. By pair correlation function g(r) analyses, hydrogen bonds and vdw are found to be the main interactions between the two components. The elasticity and isotropy of PBXs based ε-CL-20 can be obviously improved more than pure ε-CL-20 crystal. It is not by changing the molecular structures of ε-CL-20 for each binder to affect the sensitivity. The safety and energetic properties of these PBXs are mainly influenced by the thermal capability (C°p) and density (ρ) of binders, respectively.  相似文献   
136.
FexPt100−x(30 nm) and [FexPt100−x(3 nm)/ZrO2]10 (x = 37, 48, 57, 63, 69) films with different ZrO2 content were prepared by RF magnetron sputtering technique, then were annealed at 550 °C for 30 min. This work investigates the effect of ZrO2 doping on the microstructural evolution, magnetic properties, grain size, as well as the ordering kinetics of FePt alloy films. The as-deposited films behaved a disordered state, and the ordered L10 structure was obtained by post-annealing. The magnetic properties of the films are changed from soft magnetism to hard magnetism after annealing. The variation of the largest coercivities of [FexPt100−x/ZrO2]10 films with the Fe atomic percentage, x and differing amounts of ZrO2 content reveals that as we increase the ZrO2 content we must correspondingly increase the amount of Fe. This phenomenon suggests that the Zr or O atoms of ZrO2 preferentially react with the Fe atoms of FePt alloy to form compounds. In addition, introducing the nonmagnetic ZrO2 can reduce the intergrain exchange interactions of the FePt/ZrO2 films, and the interactions are decreased as the ZrO2 content increases, the dipole interactions are observed in FePt/ZrO2 films as the ZrO2 content is more than 15%.  相似文献   
137.
Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).  相似文献   
138.
Let V={1,2,…,n}. A mapping p:VRr, where p1,…,pn are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in Rr, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in Rr is said to be dimensionally rigid iff there does not exist a framework G(q) in Rs for s?r+1, such that ∥qi-qj2=∥pi-pj2 for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p1,…,pn of the given r-configuration are in general position, is also investigated.  相似文献   
139.
The minimum span of L(2,1)-labelings of certain generalized Petersen graphs   总被引:1,自引:0,他引:1  
In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)-f(y)|? 2 if xand y are adjacent vertices and |f(x)-f(y)|?1 if xand y are at distance two. The goal is to determine the λ-number of G, which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from {0,1,…,k}. Recent work has focused on determining the λ-number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ-numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ-number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ-number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ-number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results.  相似文献   
140.
On the third largest Laplacian eigenvalue of a graph   总被引:1,自引:0,他引:1  
In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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