首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4138篇
  免费   124篇
  国内免费   4篇
数理化   4266篇
  2021年   35篇
  2020年   52篇
  2019年   45篇
  2018年   28篇
  2016年   92篇
  2015年   82篇
  2014年   88篇
  2013年   127篇
  2012年   173篇
  2011年   196篇
  2010年   117篇
  2009年   111篇
  2008年   173篇
  2007年   149篇
  2006年   158篇
  2005年   127篇
  2004年   139篇
  2003年   93篇
  2002年   120篇
  2001年   89篇
  2000年   80篇
  1999年   68篇
  1998年   74篇
  1997年   55篇
  1996年   63篇
  1995年   79篇
  1994年   59篇
  1993年   62篇
  1992年   66篇
  1991年   64篇
  1990年   41篇
  1989年   56篇
  1988年   53篇
  1987年   49篇
  1986年   51篇
  1985年   70篇
  1984年   47篇
  1983年   53篇
  1982年   40篇
  1981年   34篇
  1980年   43篇
  1979年   37篇
  1978年   32篇
  1977年   51篇
  1976年   30篇
  1975年   26篇
  1974年   20篇
  1973年   23篇
  1971年   21篇
  1934年   27篇
排序方式: 共有4266条查询结果,搜索用时 343 毫秒
1.
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.  相似文献   
2.
We report on the first examples of isolated silanol–silanolate anions, obtained by utilizing weakly coordinating phosphazenium counterions. The silanolate anions were synthesized from the recently published phosphazenium hydroxide hydrate salt with siloxanes. The silanol–silanolate anions are postulated intermediates in the hydroxide‐mediated polymerization of aryl and alkyl siloxanes. The silanolate anions are strong nucleophiles because of the weakly coordinating character of the phosphazenium cation, which is perceptible in their activity in polysiloxane depolymerization.  相似文献   
3.
4.
Phase Relations and Sodium Ion Conductivity within the Quasi-binary System Na2SiF6/Na2AIF6 . The phase diagram of the Na2SiF6/Na3AlF6 system has been determined by means of x-ray powder diffraction, thermal analysis and conductivity measurements in the sub-solidus region. Na3AlF6 accomodates up to 73 mol.-% Na2SiF6 maintaining the crystal structure type. The sodium ion conductivity increases by about five orders of magnitude upon doping Na3AlF6 with Na2SiF6.  相似文献   
5.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.  相似文献   
6.
7.
Ohne ZusammenfassungFortsetzung des Artikels in Bd. XXI, pag. 51.  相似文献   
8.
Ohne ZusammenfassungDiese Untersuchung ist vor mehr als Jahresfrist infolge Eintrittes in die chemische Praxis abgebrochen worden. Äussere Verhältnisse machen die Vollendung der begonnenen Versuche auch weiterhin unmöglich und sehe ich mich desshalb veranlasst, meine Beobachtungen zu veröffentlichen.  相似文献   
9.
10.
Using spatially modulated illumination (SMI) light microscopy it is possible to measure the sizes of fluorescent structures that have an extension far below the conventional optical resolution limit (“subresolution size”). Presently, the sizes are determined as the object extension along the optical axis of the SMI microscope. For this, however, “a priori” assumptions on the fluorochrome distribution (“shape”) within the examined fluorescent structure have to be made. Usually it is assumed that the fluorochrome follows a Gauss-distribution or a spherical distribution. In this report we overcome the necessity to make an assumption on the shape of the fluorochrome distribution. We introduce two new experimentally obtained parameters which allow the determination of a shape measure to describe the spatial distribution of the fluorescent dye. This becomes possible by independent measurements with different excitation wavelengths. As an example, we present shape parameter measurements on individual fluorescent microspheres with a nominal geometrical diameter (“size”) of 190 nm. In the case investigated, the experimental shape correlated well with a homogeneous fluorochrome distribution (“spherical shape”) but not with a variety of other “shapes”.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号