首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4300篇
  免费   223篇
  国内免费   99篇
化学   2750篇
晶体学   59篇
力学   207篇
综合类   6篇
数学   836篇
物理学   764篇
  2023年   56篇
  2022年   54篇
  2021年   139篇
  2020年   170篇
  2019年   140篇
  2018年   133篇
  2017年   99篇
  2016年   177篇
  2015年   140篇
  2014年   169篇
  2013年   346篇
  2012年   278篇
  2011年   329篇
  2010年   208篇
  2009年   191篇
  2008年   273篇
  2007年   248篇
  2006年   221篇
  2005年   210篇
  2004年   172篇
  2003年   152篇
  2002年   142篇
  2001年   73篇
  2000年   44篇
  1999年   50篇
  1998年   37篇
  1997年   38篇
  1996年   30篇
  1995年   29篇
  1994年   23篇
  1993年   24篇
  1992年   14篇
  1991年   14篇
  1990年   8篇
  1989年   13篇
  1988年   11篇
  1987年   7篇
  1986年   17篇
  1985年   11篇
  1984年   13篇
  1983年   19篇
  1982年   15篇
  1981年   13篇
  1980年   8篇
  1979年   12篇
  1977年   4篇
  1976年   9篇
  1975年   10篇
  1974年   4篇
  1973年   5篇
排序方式: 共有4622条查询结果,搜索用时 466 毫秒
21.
We prove some basic properties of Donaldson’s flow of surfaces in a hyperkähler 4-manifold. When the initial submanifold is symplectic with respect to one Kähler form and Lagrangian with respect to another, we show that certain kinds of singularities cannot form, and we prove a convergence result under a condition related to one considered by M.-T. Wang for the mean curvature flow.  相似文献   
22.
We continue the investigation of locally testable codes, i.e., error‐correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable proofs, we introduce the notion of robust local testability of codes. We relate this notion to a product of codes introduced by Tanner and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low‐degree multivariate polynomials (which are a special case of tensor codes). Combining these two results gives us a generic construction of codes of inverse polynomial rate that are testable with poly‐logarithmically many queries. We note that these locally testable tensor codes can be obtained from any linear error correcting code with good distance. Previous results on local testability, albeit much stronger quantitatively, rely heavily on algebraic properties of the underlying codes. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006  相似文献   
23.
We study the problem of sampling contingency tables (nonnegative integer matrices with specified row and column sums) uniformly at random. We give an algorithm which runs in polynomial time provided that the row sums ri and the column sums cj satisfy ri = Ω(n3/2m log m), and cj = Ω(m3/2n log n). This algorithm is based on a reduction to continuous sampling from a convex set. The same approach was taken by Dyer, Kannan, and Mount in previous work. However, the algorithm we present is simpler and has weaker requirements on the row and column sums. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 135–146, 2002  相似文献   
24.
A new concept of orthogonality in real normed linear spaces is introduced. Typical properties of orthogonality (homogeneity, symmetry, additivity, ...) and relations between this orthogonality and other known orthogonalities (Birkhoff, Boussouis, Unitary-Boussouis and Diminnie) are studied. In particular, some characterizations of inner product spaces are obtained.  相似文献   
25.
The nonlocal initial problem for nonlinear nonautonomous evolution equati-ons in a Banach space is considered. It is assumed that the nonlinearities havethe local Lipschitz properties. The existence and uniqueness of mild solutionsare proved. Applications to integro-differential equations are discussed.The main tool in the paper is the normalizing mapping (the generalizednorm).  相似文献   
26.
 We show that a.s. all of the connected components of the Wired Spanning Forest are recurrent, proving a conjecture of Benjamini, Lyons, Peres and Schramm. Our analysis relies on a simple martingale involving the effective conductance between the endpoints of an edge in a uniform spanning tree. We believe that this martingale is of independent interest and will find further applications in the study of uniform spanning trees and forests. Received: 20 April 2001 / Revised version: 23 July 2002 / Published online: 14 November  相似文献   
27.
The synthesis of 1,2,3,4-dihydropyrimidinone/thione derivatives was achieved in good to excellent yields using calcium(II) nitrate as catalyst to promote the Biginelli three-component condensation reaction from a diversity of aromatic aldehydes, β-keto compounds and urea or thiourea. The reaction was carried out under solvent-free conditions.  相似文献   
28.
This paper describes the enantioselective hydrogenation of vinylthioethers. We show that thioether derivatives of maleic esters can be hydrogenated with full conversion and up to 60% ee, and that α-thioether cinnamic acids can be hydrogenated in 51% ee with modest conversion.  相似文献   
29.
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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