首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9504篇
  免费   381篇
  国内免费   76篇
化学   6663篇
晶体学   53篇
力学   244篇
数学   1770篇
物理学   1231篇
  2023年   61篇
  2022年   88篇
  2021年   274篇
  2020年   186篇
  2019年   211篇
  2018年   180篇
  2017年   159篇
  2016年   349篇
  2015年   284篇
  2014年   345篇
  2013年   559篇
  2012年   667篇
  2011年   774篇
  2010年   475篇
  2009年   455篇
  2008年   604篇
  2007年   598篇
  2006年   556篇
  2005年   537篇
  2004年   434篇
  2003年   302篇
  2002年   301篇
  2001年   134篇
  2000年   101篇
  1999年   99篇
  1998年   76篇
  1997年   85篇
  1996年   117篇
  1995年   83篇
  1994年   70篇
  1993年   66篇
  1992年   68篇
  1991年   70篇
  1990年   40篇
  1989年   50篇
  1988年   36篇
  1987年   38篇
  1986年   47篇
  1985年   58篇
  1984年   52篇
  1983年   35篇
  1982年   53篇
  1981年   27篇
  1980年   24篇
  1979年   19篇
  1978年   17篇
  1977年   11篇
  1976年   11篇
  1975年   10篇
  1974年   10篇
排序方式: 共有9961条查询结果,搜索用时 171 毫秒
51.
A mean-field model of nonlinearly coupled oscillators with randomly distributed frequencies and subject to independent external white noises is analyzed in the thermodynamic limit. When the frequency distribution isbimodal, new results include subcritical spontaneous stationary synchronization of the oscillators, supercritical time-periodic synchronization, bistability, and hysteretic phenomena. Bifurcating synchronized states are asymptotically constructed near bifurcation values of the coupling strength, and theirnonlinear stability properties ascertained.  相似文献   
52.
53.
54.
55.
Logic programming languages, such asProlog, allow a declarative specification of Constraint Satisfaction Problems (CSPs), freeing the user from specifying more or less complex control directives. However, the price to pay for such flexibility is a loss of efficiency, which makes Logic Programming inadequate to solve CSPs of even moderate size and complexity. To extend the range of applicability of logic programming, several improvements have been proposed. The use of heuristics is one such improvement. Although this usually forces the user to specify some form of control (thus abandoning the pure declarative nature of a logic program), these specifications can be made declarative by making use of some appropriate meta-predicates. Another extension to logic programming that improves its efficiency, is the active use of constraints, as done in the various formulations of constraint logic programming languages. In particular, the use of finite domains is quite adequate to implement look-ahead schemes to efficiently solve several types of CSPs. In this paper, we discuss the complementary nature of heuristics and look-ahead schemes and present a constraint logic programming framework that integrates both these techniques. Results obtained with a time-tabling problem executed on a prototype that implements such a framework are presented, and show that significant efficiency improvements can be achieved when compared with the separate use of the two techniques.  相似文献   
56.
We present two methods for solving the cosmological equations of the scalar-tetradic theory B [19] when a Friedmann-Robertson-Walker (FRW) geometry is assumed. Among the many solutions found there are several physically meaningful ones including inflationary universe solutions.  相似文献   
57.
58.
I obtain exact solutions for the quantum-mechanical harmonic oscillator with a perturbation potential which belongs to a class of polynomial functions of 1/r. I show that some of the eigenfunctions enable the calculation of expectation values in closed form and are therefore suitable trial functions for the application of the variational method to related nonsolvable problems.  相似文献   
59.
Let Au(BG) be the Banach algebra of all complex valued functions defined on the closed unit ball BG of a complex Banach space G which are uniformly continuous on BG and holomorphic in the interior of BG, endowed with the sup norm. A characterization of the boundaries for Au(BG) is given in case G belongs to a class of Banach spaces that includes the pre-dual of a Lorentz sequence space studied by Gowers in Israel J. Math. 69 (1990) 129-151. The non-existence of the Shilov boundary for Au(BG) is also proved.  相似文献   
60.
We prove some sharp Hardy-type inequalities related to the Dirac operator by elementary, direct methods. Some of these inequalities have been obtained previously using spectral information about the Dirac-Coulomb operator. Our results are stated under optimal conditions on the asymptotics of the potentials near zero and near infinity.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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