首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   166篇
  免费   0篇
化学   32篇
晶体学   1篇
力学   1篇
数学   13篇
物理学   119篇
  2024年   2篇
  2023年   1篇
  2022年   2篇
  2021年   3篇
  2016年   1篇
  2015年   1篇
  2013年   4篇
  2012年   6篇
  2011年   7篇
  2010年   5篇
  2009年   7篇
  2008年   4篇
  2007年   3篇
  2006年   5篇
  2005年   6篇
  2004年   2篇
  2003年   5篇
  2002年   4篇
  2000年   1篇
  1998年   2篇
  1996年   4篇
  1995年   3篇
  1994年   6篇
  1993年   10篇
  1992年   10篇
  1991年   3篇
  1990年   4篇
  1989年   6篇
  1988年   2篇
  1987年   7篇
  1986年   1篇
  1985年   3篇
  1984年   9篇
  1983年   7篇
  1982年   4篇
  1980年   1篇
  1979年   2篇
  1978年   3篇
  1977年   1篇
  1976年   1篇
  1975年   1篇
  1973年   3篇
  1971年   2篇
  1963年   1篇
  1934年   1篇
排序方式: 共有166条查询结果,搜索用时 0 毫秒
41.
Path-based distance functions are defined on n-dimensional generalizations of the face-centered cubic and body-centered cubic grids. The distance functions use both weights and neighborhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. For the three-dimensional case, we introduce four different error functions which are used to find the optimal weights and neighborhood sequences that can be used to define the distance functions with low rotational dependency.  相似文献   
42.
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.  相似文献   
43.
The electron-phonon coupling (EPC) strength for each phonon mode in superconducting Pb films is measured by inelastic helium atom scattering (IHAS). This surprising ability of IHAS relies on two facts: (a) In ultrathin metal films, the EPC range exceeds the film thickness, thus enabling IHAS to detect most film phonons, even 1 nm below the surface; (b) IHAS scattering amplitudes from single phonons are shown, by first-principle arguments, to be proportional to the respective EPC strengths. Thus IHAS is the first experiment providing mode-selected EPC strengths (mode-lambda spectroscopy).  相似文献   
44.
45.
We consider finite-range asymmetric exclusion processes on with non-zero drift. The diffusivity D(t) is expected to be of . We prove that D(t) ≥ Ct 1/3 in the weak (Tauberian) sense that as . The proof employs the resolvent method to make a direct comparison with the totally asymmetric simple exclusion process, for which the result is a consequence of the scaling limit for the two-point function recently obtained by Ferrari and Spohn. In the nearest neighbor case, we show further that tD(t) is monotone, and hence we can conclude that D(t) ≥ Ct 1/3(log t)−7/3 in the usual sense. Supported by the Natural Sciences and Engineering Research Council of Canada. Partially supported by the Hungarian Scientific Research Fund grants T37685 and K60708.  相似文献   
46.
47.
48.
49.
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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