首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   811篇
  免费   19篇
化学   562篇
晶体学   2篇
力学   10篇
数学   114篇
物理学   142篇
  2022年   16篇
  2021年   15篇
  2020年   17篇
  2019年   13篇
  2018年   14篇
  2017年   22篇
  2016年   32篇
  2015年   18篇
  2014年   26篇
  2013年   50篇
  2012年   36篇
  2011年   48篇
  2010年   19篇
  2009年   27篇
  2008年   39篇
  2007年   37篇
  2006年   37篇
  2005年   25篇
  2004年   23篇
  2003年   24篇
  2002年   23篇
  2001年   27篇
  2000年   14篇
  1999年   14篇
  1998年   13篇
  1997年   10篇
  1996年   7篇
  1995年   6篇
  1994年   7篇
  1993年   11篇
  1992年   18篇
  1991年   8篇
  1990年   12篇
  1989年   5篇
  1988年   6篇
  1987年   9篇
  1986年   8篇
  1985年   7篇
  1984年   5篇
  1982年   5篇
  1981年   5篇
  1980年   8篇
  1979年   5篇
  1978年   6篇
  1977年   7篇
  1976年   6篇
  1974年   3篇
  1973年   10篇
  1967年   6篇
  1966年   4篇
排序方式: 共有830条查询结果,搜索用时 78 毫秒
1.
Journal of Structural Chemistry - The structures of Ni(II), Cu(II), and Zn(II) complexes with anions of 2,5-pyrrolyl-disubstituted nitronyl nitroxide (L1) and iminonitroxide (L2) diradicals (HL1 is...  相似文献   
2.
3.
Russian Chemical Bulletin - The study is concerned with structural rearrangements in the crystals of heterospin complexes Cu(hfac)2 with nitroxide radicals LR (hfac is hexafluoroacetylacetonate, LR...  相似文献   
4.
5.
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.  相似文献   
6.
Russian Chemical Bulletin -  相似文献   
7.
Two isomers with empirical formula C6H6F9O9Tb are synthesized and their structures are studied. Isomerism was found to arise due to different positions of a proton. Crystals of two isomers are isostructural and form continuous series of solid solutions with C6H6F9O9Eu.  相似文献   
8.
9.
An anomaly is found in the vicinity of Tmax 560$ K on electric resistance versus temperature curves for yttrium hightemperature superconductors of the 123 phase. Xray phase analysis suggests a structural phase transition in the vicinity of Tmax due to oxygen redistribution in the mobile sublattice of this compound. Investigation of samples with Y partially replaced by Ca has shown that the structural phase transition does not depend on carrier concentration in the conduction band.  相似文献   
10.
The corresponding σ complexes of the Meisenheimer type, viz., anions of the potassium salts of 6H-5-nitro-6-acetonylpyrimidines, were obtained and isolated in the reaction of 5-nitro-, 5-nitro-4-methoxy-, 5-nitro-2-methoxy-, and 5-nitro-2,4-dimethoxypyrimidines with acetone in the presence of potassium hydroxide. The structures of the complexes were proved by means of the PMR, IR, and UV spectra. It is shown that the acetone anion in all cases adds to the methoxy-unsubstituted position of the pyrimidine ring, whereas nucleophilic attack takes place at the C4 atom when the 2 and 4 positions are free. See [1] for communication 1. Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 2, pp. 239–242, February, 1980.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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