全文获取类型
收费全文 | 473篇 |
免费 | 7篇 |
国内免费 | 8篇 |
专业分类
化学 | 289篇 |
晶体学 | 2篇 |
力学 | 3篇 |
数学 | 116篇 |
物理学 | 78篇 |
出版年
2022年 | 8篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 3篇 |
2015年 | 7篇 |
2014年 | 5篇 |
2013年 | 8篇 |
2012年 | 15篇 |
2011年 | 25篇 |
2010年 | 7篇 |
2009年 | 6篇 |
2008年 | 18篇 |
2007年 | 15篇 |
2006年 | 24篇 |
2005年 | 18篇 |
2004年 | 21篇 |
2003年 | 21篇 |
2002年 | 14篇 |
2001年 | 15篇 |
2000年 | 16篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 10篇 |
1996年 | 16篇 |
1995年 | 15篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 10篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 15篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 3篇 |
1974年 | 6篇 |
1972年 | 3篇 |
1969年 | 3篇 |
1968年 | 4篇 |
1903年 | 5篇 |
排序方式: 共有488条查询结果,搜索用时 31 毫秒
131.
John E. Kobza Sheldon H. Jacobson Diane E. Vaughan 《Methodology and Computing in Applied Probability》2007,9(4):573-584
This paper surveys the coupon collector’s waiting time problem with random sample sizes and equally likely balls. Consider
an urn containing m red balls. For each draw, a random number of balls are removed from the urn. The group of removed balls is painted white
and returned to the urn. Several approaches to addressing this problem are discussed, including a Markov chain approach to
compute the distribution and expected value of the number of draws required for the urn to contain j white balls given that it currently contains i white balls. As a special case, E[N], the expected number of draws until all the balls are white given that all are currently red is also obtained.
相似文献
132.
Generalized hill climbing algorithms provide a framework for modeling several local search algorithms for hard discrete optimization problems. This paper introduces and analyzes generalized hill climbing algorithm performance measures that reflect how effectively an algorithm has performed to date in visiting a global optimum and how effectively an algorithm may pes]rform in the future in visiting such a solution. These measures are also used to obtain a necessary asymptotic convergence (in probability) condition to a global optimum, which is then used to show that a common formulation of threshold accepting does not converge. These measures assume particularly simple forms when applied to specific search strategies such as Monte Carlo search and threshold accepting. 相似文献
133.
134.
Black TC Huffman PR Jacobson DL Snow WM Schoen K Arif M Kaiser H Lamoreaux SK Werner SA 《Physical review letters》2003,90(19):192502
We have performed the first high precision measurement of the coherent neutron scattering length of deuterium in a pure sample using neutron interferometry. We find b(nd)=(6.665+/-0.004) fm in agreement with the world average of previous measurements using different techniques, b(nd)=(6.6730+/-0.0045) fm. We compare the new world average for the nd coherent scattering length b(nd)=(6.669+/-0.003) fm to calculations of the doublet and quartet scattering lengths from several modern nucleon-nucleon potential models with three-nucleon force (3NF) additions and show that almost all theories are in serious disagreement with experiment. This comparison is a more stringent test of the models than past comparisons with the less precisely determined doublet scattering length of (2)a(nd)=(0.65+/-0.04) fm. 相似文献
135.
Johansson A Sambandamurthy G Shahar D Jacobson N Tenne R 《Physical review letters》2005,95(11):116805
We present the results from an experimental study of the magnetotransport of superconducting wires of amorphous indium-oxide having widths in the range 40-120 nm. We find that, below the superconducting transition temperature, the wires exhibit clear, reproducible, oscillations in their resistance as a function of magnetic field. The oscillations are reminiscent of those that underlie the operation of a superconducting quantum interference device. 相似文献
136.
Nesset MJ Cai S Shokhireva TK Shokhirev NV Jacobson SE Jayaraj K Gold A Walker FA 《Inorganic chemistry》2000,39(3):532-540
The perchloratoiron(III) complexes of a series of 2,6-disubstituted tetraphenylporphyrin ligands, where the 2,6-phenyl substituents were -H, -F, -Cl, -Br, or -OMe, as well as two 2,4,6-phenyl-substituted complexes, where the substituents were -Me and -OMe, have been investigated as a function of temperature by 1H NMR spectroscopy. Curvature in the 1/T dependence was evident in most cases. Forced linear extrapolation of the temperature dependence observed over the range of the study yielded Curie plots that include negative slopes with very large positive 1/T intercepts (Cl approximately Br > Me > H) to negative slope with near zero intercept (tri-OMe) to positive slope with very large negative intercept (F, di-OMe). The NMR results were combined with EPR spectroscopic data and curve-fitting procedures based on an expanded Curie law to arrive at a consistent overview of the variety of temperature-dependence behaviors observed. This overview relies upon the premise that, in addition to the ground state observed by EPR spectroscopy, one (or more) thermally accessible excited state(s) are populated to varying degrees over the temperature range of the NMR measurements. If only one excited state is considered, the analysis is consistent with the ground state being a largely intermediate-spin state (S = 3/2) for the majority of the complexes but a largely high-spin state (S = 5/2) for ((2,6-F2)4TPP)FeOClO3 and ((2,6-(OMe)2)4TPP)FeOClO3. 相似文献
137.
138.
Michael S. Jacobson 《Discrete Mathematics》1980,29(2):201-203
If G1 and G2 are graphs and the Ramsey number r(G1, G2) = p, then the fewest number of G1 in G and G2 in ? (G complement) that occur in a graph G on p points is called the Ramsey multiplicity and denoted R(G1, G2). In [2, 3] the diagonal (i.e. G1 = G2) Ramsey multiplicities are derived for graphs on 3 and 4 points, with the exception of K4. In this note an upper bound is established for R(Ks, K1). Specifically, we show that R(K4, K4) ? 12. 相似文献
139.
Michael S. Jacobson 《Discrete Mathematics》1982,42(1):63-66
In 1929, Ramsey proved a theorem guaranteeing that if G1,G2,…,Gk are graphs, then there exists an integer r so that if the edges of Kr are colored in any fashion with k colors a monochromatic Gi in color i exists for some i. Harary and Prins suggested the problem of deciding the minimum number of monochromatic Gi in any such coloring. It is the purpose of this paper to establish this minimum number in the case when Gi are stars for each i. 相似文献
140.