首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2077篇
  免费   48篇
  国内免费   7篇
化学   1058篇
晶体学   8篇
力学   105篇
数学   394篇
物理学   567篇
  2023年   9篇
  2022年   14篇
  2021年   39篇
  2020年   30篇
  2019年   44篇
  2018年   34篇
  2017年   35篇
  2016年   63篇
  2015年   39篇
  2014年   58篇
  2013年   114篇
  2012年   131篇
  2011年   130篇
  2010年   83篇
  2009年   71篇
  2008年   111篇
  2007年   90篇
  2006年   99篇
  2005年   92篇
  2004年   80篇
  2003年   63篇
  2002年   52篇
  2001年   38篇
  2000年   39篇
  1999年   26篇
  1998年   33篇
  1997年   24篇
  1996年   30篇
  1995年   29篇
  1994年   24篇
  1993年   24篇
  1992年   18篇
  1991年   18篇
  1990年   14篇
  1989年   16篇
  1988年   14篇
  1987年   13篇
  1986年   16篇
  1985年   23篇
  1984年   20篇
  1983年   11篇
  1982年   14篇
  1980年   10篇
  1979年   14篇
  1978年   16篇
  1977年   9篇
  1976年   13篇
  1975年   9篇
  1974年   9篇
  1973年   14篇
排序方式: 共有2132条查询结果,搜索用时 23 毫秒
1.
The density functional theory calculation of 1H and 13C NMR chemical shifts in a series of ten 10 classically known Strychnos alkaloids with a strychnine skeleton was performed at the PBE0/pcSseg-2//pcseg-2 level. It was found that calculated 1H and 13C NMR chemical shifts provided a markedly good correlation with experiment characterized by a mean absolute error of 0.08 ppm in the range of 7 ppm for protons and 1.67 ppm in the range of 150 ppm for carbons, so that a mean absolute percentage error was as small as ~1% in both cases.  相似文献   
2.
Multinomial permutations on a circle are considered in the framework of combinatorics. Different cases are presented and shown to agree with previously derived formula for the number of cyclic necklaces. Two applied examples are discussed with a view to illustrate the implications of derived formulas. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   
3.
We prove that the sequence of finite reflecting branching Brownian motion forests defined by Burdzy and Le Gall ([1]) converges in probability to the “super-Brownian motion with reflecting historical paths.” This solves an open problem posed in [1], where only tightness was proved for the sequence of approximations. Several results on path behavior were proved in [1] for all subsequential limits–they obviously hold for the unique limit found in the present paper.Mathematics Subject Classification (2000): Primary 60H15, Secondary 35R60Supported in part by NSF Grant DMS-0071486, Israel Science Foundation Grants 12/98 and 116/01 - 10.0, and the U.S.-Israel Binational Science Foundation (grant No. 2000065).  相似文献   
4.
Supported by the United States-Israel Binational Science Foundation grant 94-00302  相似文献   
5.
6.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2.  相似文献   
7.
8.
The known conditions due to G. Baxter, Ya. L. Geronimus, and B. L. Golinskii which guarantee the uniform boundedness and/or uniform asymptotic representation for orthonormal polynomials on the unit circle are under consideration. We show that these conditions are in general not necessary. We discuss the relation between the orthonormal polynomials on the unit circle, the best approximations, and absolutely convergent Fourier series.  相似文献   
9.
The recently published E865 data on charged decays and phases are reanalyzed to extract values of the two S-wave scattering lengths, of the subthreshold parameters and , of the low-energy constants and as well as of the main two-flavour order parameters: and in the limit taken at the physical value of the strange quark mass. Our analysis is exclusively based on direct experimental information on phases below 800 MeV and on the new solutions of the Roy equations by Ananthanarayan et al. The result is compared with the theoretical prediction relating 2a 0 0-5a 0 2 and the scalar radius of the pion, which was obtained in two-loop Chiral Perturbation Theory. A discrepancy at the 1- level is found and commented upon. Received: 11 December 2001 / Revised version: 28 March 2002 / Published online: 7 June 2002  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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