全文获取类型
收费全文 | 638篇 |
免费 | 36篇 |
国内免费 | 2篇 |
专业分类
化学 | 531篇 |
晶体学 | 1篇 |
力学 | 13篇 |
数学 | 83篇 |
物理学 | 48篇 |
出版年
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 11篇 |
2019年 | 15篇 |
2018年 | 7篇 |
2017年 | 4篇 |
2016年 | 12篇 |
2015年 | 18篇 |
2014年 | 23篇 |
2013年 | 30篇 |
2012年 | 13篇 |
2011年 | 35篇 |
2010年 | 19篇 |
2009年 | 30篇 |
2008年 | 26篇 |
2007年 | 42篇 |
2006年 | 30篇 |
2005年 | 31篇 |
2004年 | 30篇 |
2003年 | 29篇 |
2002年 | 38篇 |
2001年 | 5篇 |
2000年 | 9篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 11篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1975年 | 4篇 |
1929年 | 5篇 |
1919年 | 4篇 |
1918年 | 5篇 |
1905年 | 3篇 |
1894年 | 3篇 |
1887年 | 5篇 |
1885年 | 5篇 |
排序方式: 共有676条查询结果,搜索用时 21 毫秒
1.
Ohne Zusammenfassung 相似文献
2.
Alois Smolka 《Monatshefte für Chemie / Chemical Monthly》1885,6(1):915-926
Ohne Zusammenfassung 相似文献
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 n ≥ j. 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 n − j 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.
We study the capillary forces arising from charged colloidal particles trapped at an oil-water interface. Since it is quadratic in the electric field, the electric stress acting on the interface cannot be written as the superposition of one-particle terms. Indeed, we find that the interfacial pressure is dominated by two-particle terms, which induce capillary forces involving one, two, three, or four particles. The dominant interaction is attractive and varies with the inverse cube of the particle distance. 相似文献