首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6692篇
  免费   160篇
  国内免费   11篇
化学   4827篇
晶体学   19篇
力学   115篇
数学   975篇
物理学   927篇
  2021年   51篇
  2019年   49篇
  2016年   122篇
  2015年   94篇
  2014年   122篇
  2013年   266篇
  2012年   221篇
  2011年   245篇
  2010年   166篇
  2009年   142篇
  2008年   208篇
  2007年   230篇
  2006年   236篇
  2005年   240篇
  2004年   209篇
  2003年   182篇
  2002年   161篇
  2001年   124篇
  2000年   88篇
  1999年   82篇
  1998年   103篇
  1997年   99篇
  1996年   122篇
  1995年   107篇
  1994年   116篇
  1993年   119篇
  1992年   116篇
  1991年   87篇
  1990年   106篇
  1989年   107篇
  1988年   99篇
  1987年   111篇
  1986年   129篇
  1985年   154篇
  1984年   115篇
  1983年   99篇
  1982年   102篇
  1981年   91篇
  1980年   116篇
  1979年   68篇
  1978年   102篇
  1977年   95篇
  1976年   79篇
  1975年   56篇
  1974年   74篇
  1973年   64篇
  1972年   61篇
  1970年   59篇
  1965年   56篇
  1964年   66篇
排序方式: 共有6863条查询结果,搜索用时 15 毫秒
21.
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.  相似文献   
22.
23.
Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
24.
25.
26.
27.
Why have molecules only been seen but not heard? For over a century chemists have probed reactions with various spectroscopic methods to learn about structures, dynamics, and reactivities of their molecules. What they have not done is to listen to their molecules react. Although the photoacoustic phenomenon has been known since 1880, it is only in the last twenty years that technology has developed to the point where sound waves produced by reacting molecules can be time resolved and the information contained within the waves deciphered. The information content within the photoacoustic wave is indeed rich, for one can learn about the dynamics and the magnitude of enthalpy changes associated with the reaction as well as the changes in molecular volume. This review article chronicles the development of time-resolved photoacoustic calorimetry and its application to a variety of reactions encountered in organic and organometallic chemistry and biochemistry.  相似文献   
28.
In this contribution, the stereochemistry of propylene insertion/propagation reactions with a variety of C 1 symmetric metallocene catalysts, containing bridged cyclopentadienyl-fluorenyl ligand for the preparation of highly stereoregular polypropylene is presented. The impact of the distal substitutent’s size and composition and changes that the catalytic sites undergo upon such substitution is elaborated. A comprehensive mechanism is proposed to explain the resulting catalytic changes that bring about the irreversible C s/C 1 site transformation and tactic behavior inversion. Furthermore the cyclopentadienyl’s combined distal/proximal and fluorenyl’s frontal substituent effects on molecular weight, regio-, and stereoregularity of the final polymers are discussed. Finally, stereoselectivities of C 2 and C 1 symmetric catalyst systems are compared. It is shown that current high performance C 1 symmetric catalyst systems with central site chirality can be isotactic selective as well or even better in certain aspects than the C 2 symmetric bridged bisindenyl-based metallocene catalysts. The text was submitted by the authors in English.  相似文献   
29.
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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