首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   199822篇
  免费   2381篇
  国内免费   653篇
化学   111372篇
晶体学   3327篇
力学   7947篇
综合类   4篇
数学   19382篇
物理学   60824篇
  2016年   2448篇
  2015年   1850篇
  2014年   2587篇
  2013年   8157篇
  2012年   5626篇
  2011年   7026篇
  2010年   4693篇
  2009年   4630篇
  2008年   6325篇
  2007年   6504篇
  2006年   6235篇
  2005年   5722篇
  2004年   5171篇
  2003年   4594篇
  2002年   4470篇
  2001年   5841篇
  2000年   4445篇
  1999年   3561篇
  1998年   2781篇
  1997年   2822篇
  1996年   2792篇
  1995年   2555篇
  1994年   2427篇
  1993年   2320篇
  1992年   2823篇
  1991年   2693篇
  1990年   2630篇
  1989年   2665篇
  1988年   2599篇
  1987年   2603篇
  1986年   2421篇
  1985年   3300篇
  1984年   3304篇
  1983年   2734篇
  1982年   2935篇
  1981年   2859篇
  1980年   2772篇
  1979年   2908篇
  1978年   3148篇
  1977年   2965篇
  1976年   2897篇
  1975年   2761篇
  1974年   2707篇
  1973年   2719篇
  1972年   1761篇
  1971年   1472篇
  1968年   1934篇
  1967年   2132篇
  1966年   1922篇
  1965年   1499篇
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
211.
We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

  相似文献   

212.
Mo2Ni3Si/NiSi metal silicide composite coatings with a fine microstructure consisting of Mo2Ni3Si primary dendrites and the interdendritic Mo2Ni3Si/NiSi eutectics were fabricated on austenitic stainless steel AISI 321 by laser cladding process. Small amplitude reciprocating sliding wear resistance of the coatings is evaluated as functions of normal load and slip amplitude and the wear mechanisms were discussed based on worn surface morphology observations. Results showed that the Mo2Ni3Si/NiSi coatings have excellent small amplitude reciprocating sliding wear resistance.  相似文献   
213.
Analytical and Bioanalytical Chemistry -  相似文献   
214.
215.
216.
217.
Photoluminescence (PL) linewidth broadening of CdxZn1 − xSe/ZnSe triple quantum wells, grown on GaAs substrates by molecular beam epitaxy (MBE), has been investigated. Various quantum well (QW) samples have been prepared with different QW thickness and composition (Cd-composition). Measured and calculated PL linewidth are compared. Both composition and thickness fluctuations are considered for the calculation with the parameters such as the volume of exciton, nominal thickness and composition of QWs. Surface roughness measured by atomic force microscopy (AFM) is used to estimate the interface roughness. Results show that when Cd-composition increases additional linewidth broadening due to Zn/Cd interdiffusion is enhanced.  相似文献   
218.
219.
220.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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