首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   730篇
  免费   37篇
  国内免费   2篇
化学   572篇
晶体学   1篇
力学   17篇
数学   98篇
物理学   81篇
  2022年   5篇
  2021年   6篇
  2020年   12篇
  2019年   15篇
  2018年   8篇
  2017年   4篇
  2016年   14篇
  2015年   18篇
  2014年   24篇
  2013年   31篇
  2012年   13篇
  2011年   39篇
  2010年   20篇
  2009年   32篇
  2008年   30篇
  2007年   44篇
  2006年   30篇
  2005年   31篇
  2004年   31篇
  2003年   31篇
  2002年   39篇
  2001年   5篇
  2000年   9篇
  1999年   8篇
  1998年   11篇
  1997年   8篇
  1996年   12篇
  1995年   7篇
  1994年   8篇
  1993年   12篇
  1991年   8篇
  1990年   6篇
  1987年   8篇
  1986年   5篇
  1985年   6篇
  1984年   7篇
  1983年   7篇
  1982年   5篇
  1981年   10篇
  1980年   10篇
  1979年   6篇
  1978年   9篇
  1975年   7篇
  1974年   5篇
  1973年   5篇
  1929年   5篇
  1919年   4篇
  1918年   5篇
  1887年   5篇
  1885年   5篇
排序方式: 共有769条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
6.
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  相似文献   
7.
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.  相似文献   
8.
9.
10.
The magnetic levitation technique has been used to test for fractional electric charge in sea water, using steel balls coated with sea water residue by evaporation. The objective was to reach concentration levels below 1 g?1 which might result from cosmic ray interactions. Four stages of increasing sensitivity are reported: (1) residue from direct evaporation of unprocessed sea water, (2) residue from sea water samples enriched by ion exchangen, (3) residue reduced by high temperature evaporation, and (4) hypothetical enrichment by dilution and separation of soluble residue. Stages 1–3 are based on the generally accepted preferential retention of fractional charge during evaporation, but stage 4 limits are subject to uncertainties in the enrichment process. No evidence for fractional charge was found in a total of about 130 samples tested in these four stages. Samples containing positive and negative ions were tested separately, and concentration limits are reported for each of the stages. Levels in the region 0.01–0.1g?1 were reached in stage 3, and 0.001 g?1 in stage 4.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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