全文获取类型
收费全文 | 49篇 |
免费 | 0篇 |
专业分类
化学 | 34篇 |
数学 | 5篇 |
物理学 | 10篇 |
出版年
2014年 | 1篇 |
2013年 | 3篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2008年 | 1篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2003年 | 2篇 |
2002年 | 1篇 |
2000年 | 1篇 |
1997年 | 1篇 |
1994年 | 1篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1977年 | 1篇 |
1938年 | 1篇 |
1937年 | 2篇 |
1936年 | 1篇 |
1934年 | 3篇 |
1933年 | 1篇 |
1932年 | 2篇 |
1931年 | 1篇 |
1930年 | 1篇 |
1929年 | 4篇 |
1918年 | 1篇 |
1889年 | 1篇 |
排序方式: 共有49条查询结果,搜索用时 15 毫秒
11.
The crystal structure of YCoO3has been determined from Rietveld analysis of the powder neutron diffraction data at 17, 100, and 300 K. At each temperature, the structure is a distorted perovskite with orthorhombic symmetry, space groupPbnm(Z=4). The lattice parameters, at 300 K, are 5.1388(5)× 5.4191(5)×7.3658(7) Å. Structural analysis indicates that the formal valence of cobalt in YCoO3is +3. Analysis of the Co–O distances and the absence of magnetic structure indicates that the majority of the Co3+ions in YCoO3are in the low-spin (i.e.t62ge0g) state. The data also show that perhaps 10% of the Co3+ions at 300 K (but insignificant fractions at 100 and 17 K) are in the high-spin state. 相似文献
12.
A Bayesian tutorial for data assimilation 总被引:1,自引:0,他引:1
Data assimilation is the process by which observational data are fused with scientific information. The Bayesian paradigm provides a coherent probabilistic approach for combining information, and thus is an appropriate framework for data assimilation. Viewing data assimilation as a problem in Bayesian statistics is not new. However, the field of Bayesian statistics is rapidly evolving and new approaches for model construction and sampling have been utilized recently in a wide variety of disciplines to combine information. This article includes a brief introduction to Bayesian methods. Paying particular attention to data assimilation, we review linkages to optimal interpolation, kriging, Kalman filtering, smoothing, and variational analysis. Discussion is provided concerning Monte Carlo methods for implementing Bayesian analysis, including importance sampling, particle filtering, ensemble Kalman filtering, and Markov chain Monte Carlo sampling. Finally, hierarchical Bayesian modeling is reviewed. We indicate how this approach can be used to incorporate significant physically based prior information into statistical models, thereby accounting for uncertainty. The approach is illustrated in a simplified advection–diffusion model. 相似文献
13.
[reaction: see text] The reductive coupling of substituted alpha-iodomethyloxazoles and thiazoles with aliphatic aldehydes under Barbier conditions provides an effective method for the direct incorporation of intact heterocyclic systems. 相似文献
14.
A. Köster R. Sterckx T. Masling Fr. Ihlow E. Berliner H. Kühl R. Broquet Ch. Hoffman R. Schweitzer und G. Dalby 《Fresenius' Journal of Analytical Chemistry》1937,110(5-6):219-221
Ohne Zusammenfassung 相似文献
15.
M. Kefeli E. Berliner J. Kassler und F. Gerke 《Fresenius' Journal of Analytical Chemistry》1934,99(1-2):76-77
Ohne Zusammenfassung 相似文献
16.
A. Berliner W. H. Westphal J. Errera Fr. L?we P. W. Danckwortt J. Plotnikow W. Block F. Plato K. Jellinek P. Debye E. Schr?dinger E. Lange F. -V. v. Hahn und F. Kuntze 《Fresenius' Journal of Analytical Chemistry》1929,76(7-8):281-284
Ohne Zusammenfassung 相似文献
17.
H. Berliner 《Mathematische Annalen》1918,79(1-2):13-39
Ohne Zusammenfassung 相似文献
18.
P. Chatelain C. Berliner J. -M. Ruysschaert und J. Jaffe 《Colloid and polymer science》1977,255(10):1026
Ohne Zusammenfassung 相似文献
19.
20.
Adam Berliner Ulrike Bostelmann Richard A. Brualdi Louis Deaett 《Graphs and Combinatorics》2006,22(2):173-183
Let G=(V,E) be a graph with n vertices and e edges. The sum choice number of G is the smallest integer p such that there exist list sizes (f(v):v ∈ V) whose sum is p for which G has a proper coloring no matter which color lists of size f(v) are assigned to the vertices v. The sum choice number is bounded above by n+e. If the sum choice number of G equals n+e, then G is sum choice greedy. Complete graphs Kn are sum choice greedy as are trees. Based on a simple, but powerful, lemma we show that a graph each of whose blocks is sum
choice greedy is also sum choice greedy. We also determine the sum choice number of K2,n, and we show that every tree on n vertices can be obtained from Kn by consecutively deleting single edges where all intermediate graphs are sc-greedy. 相似文献