首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1484篇
  免费   75篇
  国内免费   5篇
化学   1043篇
晶体学   9篇
力学   41篇
数学   277篇
物理学   194篇
  2021年   22篇
  2020年   38篇
  2019年   25篇
  2018年   26篇
  2017年   9篇
  2016年   36篇
  2015年   30篇
  2014年   46篇
  2013年   74篇
  2012年   76篇
  2011年   83篇
  2010年   45篇
  2009年   34篇
  2008年   73篇
  2007年   68篇
  2006年   51篇
  2005年   60篇
  2004年   40篇
  2003年   40篇
  2002年   23篇
  2001年   18篇
  2000年   13篇
  1999年   9篇
  1998年   11篇
  1997年   11篇
  1996年   21篇
  1993年   10篇
  1992年   17篇
  1991年   10篇
  1989年   14篇
  1988年   9篇
  1985年   8篇
  1984年   16篇
  1983年   15篇
  1981年   15篇
  1980年   9篇
  1978年   12篇
  1976年   18篇
  1943年   8篇
  1934年   7篇
  1931年   8篇
  1929年   10篇
  1926年   7篇
  1924年   7篇
  1923年   7篇
  1911年   7篇
  1909年   8篇
  1907年   7篇
  1891年   7篇
  1890年   7篇
排序方式: 共有1564条查询结果,搜索用时 46 毫秒
1.
2.
Several Pd-catalyzed reactions were explored to further functionalize the bromo-substituted 4-amino-1,2,4,5-tetrahydro-2-benzazepin-3-one scaffold (Aba). We report in this paper suitable reaction conditions for Suzuki, Buchwald-Hartwig, and Heck reactions. The substitution pattern of the starting aminobenzazepinone turned out to be crucial for the success of these transition metal-catalyzed reactions, which often required modifications of standard literature procedures. The Pd-catalyzed methods provide access to novel substitution patterns of the Aba scaffold.  相似文献   
3.
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let AV. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.  相似文献   
4.
5.
6.
7.
Least-Squares Fitting of Algebraic Spline Surfaces   总被引:11,自引:0,他引:11  
We present an algorithm for fitting implicitly defined algebraic spline surfaces to given scattered data. By simultaneously approximating points and associated normal vectors, we obtain a method which is computationally simple, as the result is obtained by solving a system of linear equations. In addition, the result is geometrically invariant, as no artificial normalization is introduced. The potential applications of the algorithm include the reconstruction of free-form surfaces in reverse engineering. The paper also addresses the generation of exact error bounds, directly from the coefficients of the implicit representation.  相似文献   
8.
9.
10.
We report the synthesis of modified Cram‐type cavitands bearing one or two fluorescent labels for single‐molecule spectroscopic studies of vase? kite conformational switching (Scheme 3). Syntheses were performed by stepwise bridging of the four couples of neighboring H‐bonded OH groups of resorcin[4]arene bowls (Schemes 2 and 3). The new substitution patterns enable the construction of a large variety of future functional architectures. 1H‐NMR Investigations showed that the new partially and differentially bridged cavitands feature temperature‐ and pH‐triggered vase? kite conformational isomerism similar to symmetrical cavitands with four identical quinoxaline bridges (Table). It was discovered that vase? kite switching of cavitands is strongly solvent‐dependent.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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