首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3045篇
  免费   170篇
  国内免费   3篇
化学   2126篇
晶体学   14篇
力学   89篇
数学   311篇
物理学   678篇
  2023年   25篇
  2022年   20篇
  2021年   37篇
  2020年   46篇
  2019年   32篇
  2018年   23篇
  2017年   38篇
  2016年   80篇
  2015年   85篇
  2014年   85篇
  2013年   122篇
  2012年   137篇
  2011年   196篇
  2010年   89篇
  2009年   98篇
  2008年   158篇
  2007年   172篇
  2006年   136篇
  2005年   137篇
  2004年   108篇
  2003年   110篇
  2002年   113篇
  2001年   54篇
  2000年   47篇
  1999年   26篇
  1998年   29篇
  1997年   26篇
  1996年   32篇
  1995年   29篇
  1994年   31篇
  1993年   40篇
  1992年   27篇
  1991年   28篇
  1990年   27篇
  1989年   19篇
  1988年   18篇
  1987年   26篇
  1986年   21篇
  1985年   30篇
  1984年   25篇
  1983年   21篇
  1982年   28篇
  1981年   31篇
  1980年   28篇
  1979年   20篇
  1978年   31篇
  1977年   19篇
  1976年   23篇
  1974年   18篇
  1973年   20篇
排序方式: 共有3218条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
6.
7.
In this study a novel technique for 2D spray temperature measurement is presented. For this purpose the thermographic phosphor (TP) Mg4GeO5.5F:Mn was dispersed in n-dodecane and atomised using a conventional semi solid-cone nozzle. The thermographic phosphor was excited electronically by a frequency tripled Nd:YAG laser (355 nm). An ICCD-camera in combination with an image doubler detected the subsequently emitted phosphorescence at both peak emission wavelengths located at 633 nm and 659 nm, respectively. Utilising suitable calibration measurements, the local spray temperature was determined by evaluating the intensity ratio of both emission wavelengths. To the knowledge of the authors this is the first approach of spray temperature measurement exploiting the temperature dependent intensity ratio of thermographic phosphors. PACS 07.20.Dt; 32.50.+d  相似文献   
8.
9.
Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size nj. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that nj is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007  相似文献   
10.
This paper presents an analytic approach to the construction cost of fringe-balanced binary search trees. In [7], Mahmoud used a bottom-up approach and an urn model of Pólya. The present method is top-down and uses differential equations and Hwang's quasi-power theorem to derive the asymptotic normality of the number of rotations needed to construct such afringe balanced search tree. We also obtain the exact expectation and variance with this method. Although Pólya's urn model is no longer needed, we also present an elegant analysis of it based on an operator calculus as in [4].This research was supported by the Austrian Research Society (FWF) under the project number P12599-MAT.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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