首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   15230篇
  免费   387篇
  国内免费   286篇
化学   1863篇
晶体学   74篇
力学   144篇
综合类   40篇
数学   12632篇
物理学   1150篇
  2023年   51篇
  2022年   103篇
  2021年   102篇
  2020年   69篇
  2019年   359篇
  2018年   397篇
  2017年   217篇
  2016年   157篇
  2015年   218篇
  2014年   459篇
  2013年   916篇
  2012年   555篇
  2011年   951篇
  2010年   781篇
  2009年   1007篇
  2008年   1080篇
  2007年   1069篇
  2006年   835篇
  2005年   598篇
  2004年   462篇
  2003年   391篇
  2002年   324篇
  2001年   294篇
  2000年   299篇
  1999年   392篇
  1998年   312篇
  1997年   256篇
  1996年   271篇
  1995年   290篇
  1994年   299篇
  1993年   256篇
  1992年   217篇
  1991年   160篇
  1990年   209篇
  1989年   216篇
  1988年   133篇
  1987年   144篇
  1986年   145篇
  1985年   150篇
  1984年   130篇
  1983年   64篇
  1982年   96篇
  1981年   81篇
  1980年   84篇
  1979年   55篇
  1978年   70篇
  1977年   68篇
  1976年   45篇
  1975年   19篇
  1973年   20篇
排序方式: 共有10000条查询结果,搜索用时 109 毫秒
1.
The growth-fragmentation equation describes a system of growing and dividing particles, and arises in models of cell division, protein polymerisation and even telecommunications protocols. Several important questions about the equation concern the asymptotic behaviour of solutions at large times: at what rate do they converge to zero or infinity, and what does the asymptotic profile of the solutions look like? Does the rescaled solution converge to its asymptotic profile at an exponential speed? These questions have traditionally been studied using analytic techniques such as entropy methods or splitting of operators. In this work, we present a probabilistic approach: we use a Feynman–Kac formula to relate the solution of the growth-fragmentation equation to the semigroup of a Markov process, and characterise the rate of decay or growth in terms of this process. We then identify the Malthus exponent and the asymptotic profile in terms of a related Markov process, and give a spectral interpretation in terms of the growth-fragmentation operator and its dual.  相似文献   
2.
3.
We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.  相似文献   
4.
5.
6.
Summary. The analytic treatment of problems related to the asymptotic behaviour of random dynamical systems generated by stochastic differential equations suffers from the presence of non-adapted random invariant measures. Semimartingale theory becomes accessible if the underlying Wiener filtration is enlarged by the information carried by the orthogonal projectors on the Oseledets spaces of the (linearized) system. We study the corresponding problem of preservation of the semimartingale property and the validity of a priori inequalities between the norms of stochastic integrals in the enlarged filtration and norms of their quadratic variations in case the random element F enlarging the filtration is real valued and possesses an absolutely continuous law. Applying the tools of Malliavin’s calculus, we give smoothness conditions on F under which the semimartingale property is preserved and a priori martingale inequalities are valid. Received: 12 April 1995 / In revised form: 7 March 1996  相似文献   
7.
Summary. In the light of the functional analysis theory we establish the optimality of the double exponential formula. The argument consists of the following three ingredients: (1) introduction of a number of spaces of functions analytic in a strip region about the real axis, each space being characterized by the decay rate of their elements (functions) in the neighborhood of the infinity; (2) proof of the (near-) optimality of the trapezoidal formula in each space introduced in (1) by showing the (near-) equality between an upper estimate for the error norm of the trapezoidal formula and a lower estimate for the minimum error norm of quadratures; (3) nonexistence theorem for the spaces, the characterizing decay rate of which is more rapid than the double exponential. Received September 15, 1995 / Accepted December 14, 1995  相似文献   
8.
9.
Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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