首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   555篇
  免费   16篇
  国内免费   4篇
化学   388篇
晶体学   3篇
力学   17篇
数学   81篇
物理学   86篇
  2023年   6篇
  2022年   6篇
  2021年   8篇
  2020年   7篇
  2019年   11篇
  2018年   9篇
  2017年   5篇
  2016年   6篇
  2015年   9篇
  2014年   11篇
  2013年   30篇
  2012年   32篇
  2011年   36篇
  2010年   22篇
  2009年   20篇
  2008年   33篇
  2007年   29篇
  2006年   36篇
  2005年   17篇
  2004年   21篇
  2003年   10篇
  2002年   17篇
  2001年   11篇
  2000年   6篇
  1999年   6篇
  1998年   6篇
  1997年   7篇
  1996年   11篇
  1995年   8篇
  1994年   6篇
  1993年   11篇
  1992年   12篇
  1991年   3篇
  1990年   7篇
  1989年   3篇
  1988年   6篇
  1987年   4篇
  1985年   7篇
  1984年   14篇
  1983年   5篇
  1982年   8篇
  1980年   4篇
  1979年   6篇
  1978年   4篇
  1977年   5篇
  1976年   5篇
  1975年   4篇
  1973年   3篇
  1971年   3篇
  1913年   2篇
排序方式: 共有575条查询结果,搜索用时 46 毫秒
571.
Reactions of [PdCl2(COD)] with 1 equiv. of the iminophosphorane-phosphine ligands Ph2PCH2P{=NP(=O)(OR)2}Ph2 (R=Et, Ph) lead to the novel Pd(II) derivatives cis-[PdCl2(kappa2-(P,N)-Ph2PCH2P{=NP(=O)(OR)2}Ph2)] (R=Et, Ph). Pd-N bond cleavage readily takes place upon treatment of these species with a variety of two-electron donor ligands. By this way, complexes cis-[PdCl2(kappa1-(P)-Ph2PCH2P{=NP(=O)(OR)2}Ph2)(L)] (R=Et, L=CNtBu, CN-2,6-C6H3Me2, py, P(OMe)3, P(OEt)3; R=Ph, L=CNtBu, CN-2,6-C6H3Me2, py, P(OMe)3, P(OEt)3) have been synthesized in high yields. The addition of two equivalents of ligands to dichloromethane solutions of [PdCl2(COD)] results in the formation of complexes trans-[PdCl2(kappa1-(P)-Ph2PCH2P{=NP(=O)(OR)2}Ph2)2] (R=Et, Ph), which can be converted into the dicationic species [Pd(Ph2PCH2P{=NP(=O)(OR)2}Ph2)2][SbF6]2 (R=Et, Ph) by treatment with AgSbF6. Complex also reacts with CNtBu to afford trans-[Pd(kappa1(P)-Ph2PCH2P{=NP(=O)(OPh)2}Ph2)2(CNtBu)2][SbF6]2. The structures of and have been determined by single-crystal X-ray diffraction methods. In addition, the ability of these Pd(II) complexes to promote the catalytic cycloisomerization of (Z)-3-methylpent-2-en-4-yn-1-ol into 2,3-dimethylfuran has also been studied.  相似文献   
572.
CuCl or pre‐generated CuCF3 reacts with CF3SiMe3/KF in DMF in air to give [Cu(CF3)4]? quantitatively. [PPN]+, [Me4N]+, [Bu4N]+, [PhCH2NEt3]+, and [Ph4P]+ salts of [Cu(CF3)4]? were prepared and isolated spectroscopically and analytically pure in 82–99 % yield. X‐ray structures of the [PPN]+, [Me4N]+, [Bu4N]+, and [Ph4P]+ salts were determined. A new synthetic strategy with [Cu(CF3)4]? was demonstrated, involving the removal of one CF3? from the Cu atom in the presence of an incoming ligand. A novel CuIII complex [(bpy)Cu(CF3)3] was thus prepared and fully characterized, including by single‐crystal X‐ray diffraction. The bpy complex is highly fluxional in solution, the barrier to degenerate isomerization being only 2.3 kcal mol?1. An NPA study reveals a huge difference in the charge on the Cu atom in [Cu(CR3)4]? for R=F (+0.19) and R=H (+0.46), suggesting a higher electron density on Cu in the fluorinated complex.  相似文献   
573.
Bent-core smectic liquid crystal (LC) phases (B phases) have been widely studied since their unusual polar and chiral properties were discovered in the 1990s. Relatively few studies have examined the mechanisms by which the orientation of the B phase may be controlled to produce the type of macroscopic domain that is essential for organic semiconductor, optical device and patterning applications. This review is intended to cover recent progress towards controlling the B phases upon layering, including anisotropic treatment methods and topographical confinement methods. Finally, this review closes with a discussion of B smectic phases that have been fabricated for use in certain applications.  相似文献   
574.
We say that a graph F strongly arrows a pair of graphs (G,H) and write ◂→▸Find(G,H) if any coloring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F. The induced Ramsey number, ◂...▸IR(G,H), is defined as ◂lim▸min◂{}▸{|V(F)|:◂→▸Find(G,H)}. We consider the connection between the induced Ramsey number for a pair of two connected graphs ◂...▸IR(G,H) and the induced Ramsey number for multiple copies of these graphs IR◂()▸(sG,tH), where xG denotes the pairwise vertex-disjoint union of x copies of G. It is easy to see that if ◂→▸Find(G,H), then ◂⋅▸(s+t1)Find◂()▸(sG,tH). This implies that ◂...▸IR◂≤▸◂()▸(sG,tH)(s+t1)IR(G,H). For several specific graphs, such as a path on three vertices vs a complete multipartite graph, a matching vs a complete graph, or a matching vs another matching, it is known that the above inequality is tight. On the other hand, the inequality is also strict for some graphs. However, even in the simplest case when H is an edge and t=2, it is not known for what G and for what s the above inequality is tight. We show that it is tight if G is connected and s is at least as large as the order of G. In addition, we make further progress in determining induced Ramsey numbers for multiple copies of graphs, such as paths and triangles.  相似文献   
575.
We construct a CAT(0) group containing a finitely presented subgroup with infinitely many conjugacy classes of finite-order elements. Unlike previous examples (which were based on right-angled Artin groups) our ambient CAT(0) group does not contain any rank 3 free abelian subgroups. We also construct examples of groups of type F n inside mapping class groups, Aut(), and Out() which have infinitely many conjugacy classes of finite-order elements.   相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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