全文获取类型
收费全文 | 173篇 |
免费 | 4篇 |
国内免费 | 8篇 |
专业分类
化学 | 79篇 |
力学 | 6篇 |
数学 | 70篇 |
物理学 | 30篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 6篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 4篇 |
2012年 | 8篇 |
2011年 | 11篇 |
2010年 | 4篇 |
2009年 | 1篇 |
2008年 | 14篇 |
2007年 | 13篇 |
2006年 | 7篇 |
2005年 | 8篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 8篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有185条查询结果,搜索用时 937 毫秒
61.
LetG be an infinite connected graph with vertex setV. Ascenery onG is a map ξ :V → 0, 1 (equivalently, an assignment of zeroes and ones to the vertices ofG). LetS n n≥0 be a simple random walk onG, starting at some distinguished vertex v0. Now let ξ and η be twoknown sceneries and assume that we observe one of the two sequences ξ(S n) n≥0 or {η(S n)} n≥0 but we do not know which of the two sequences is observed. Can we decide, with a zero probability of error, which of the two sequences is observed? We show that ifG = Z orG = Z2, then the answer is “yes” for each fixed ξ and “almost all” η. We also give some examples of graphsG for which almost all pairs (ξ, η) are not distinguishable, and discuss some variants of this problem. 相似文献
62.
Itai Benjamini 《Proceedings of the American Mathematical Society》2002,130(3):723-726
A simple competition model is presented. While in Euclidean spaces the weak will ``die out', in the presence of hyperbolicity, coexistence take place.
63.
Cluster model calculations have been performed for CHx, x = 0−3, chemisorbed on Ni(100) and Ni(111). The predicted chemisorption energies, at the present level of theory, based on bond-prepared clusters for Ni(100) are for carbon 150 kcal/mol, for CH 136 kcal/mol, for CH2 91 kcal/mol and for CH3 46 kcal/mol. The corresponding energies for Ni(111) are for CH 120 kcal/mol, for CH2 88 cal/mol and for CH3 49 kcal/mol. These chemisorption energies lead to similar stabilities for all CHx fragments on both Ni(100) and Ni(111). Large basis sets and multi-reference correlation treatments are found to be very important in particular for the multiply bonded species. The vibrational C-H stretching frequencies predicted for CHx on Ni(111) are for CH 3054 cm−1 (2980 cm−1), for CH2 3204 cm−1 and for CH3 2709 cm−1 (2680 cm−1), where the available experimental values are given in parent The predicted ionization spectra of adsorbed CHx are also in general agreement with experimental findings. 相似文献
64.
65.
Kazunori Odashima Akiko Itai Yoichi Iitaka Yoji Arata Kenji Koga 《Tetrahedron letters》1980,21(45):4347-4350
NMR studies (1H and 13C) demonstrating an inclusion complex formation in a particular geometry between a water-soluble paracyclophane, CP44, and hydrophobic substrates in acidic aqueous solution are described. 相似文献
66.
Formulation design of an oral, fast-disintegrating dosage form containing taste-masked particles of famotidine 总被引:1,自引:0,他引:1
Mizumoto T Tamura T Kawai H Kajiyama A Itai S 《Chemical & pharmaceutical bulletin》2008,56(7):946-950
A fast-disintegrating dosage form has been developed as a user-friendly formulation that disintegrates in the mouth immediately. Patients can take it without water like a liquid formulation. In this study famotidine taste-masking technology was applied to the new fast-disintegrating tablet in an attempt to produce a novel, taste-masked, fast-disintegrating tablet. Partial granulation was found to be an effective and practical way to address content uniformity, however, oral disintegration time tended to become longer as content uniformity improved. The disintegration time was improved considerably by controlling ambient humidity during the compression process (>50% RH). Furthermore, since the new fast-disintegrating technology made it possible to use low compression force, there was no change in the structure or dissolution rate of the taste-masked particles after compression. Therefore, this system can produce a taste-masked fast-disintegrating tablet with satisfactory attributes. 相似文献
67.
We construct a bi-Lipschitz bijection from the Boolean cube to the Hamming ball of equal volume. More precisely, we show that for all even n ∈ N there exists an explicit bijection ψ: {0, 1}n → {x ∈ {0, 1}n+1 : |x| > n/2} such that for every x ≠ y ∈ {0, 1}n, \(\frac{1}{5} \leqslant \frac{{dis\tan ce\left( {\psi \left( x \right),\psi \left( y \right)} \right)}}{{dis\tan ce\left( {x,y} \right)}} \leqslant 4,\) where distance(·, ·) denotes the Hamming distance. In particular, this implies that the Hamming ball is bi-Lipschitz transitive. 相似文献
68.
We study a singular perturbation type minimization problem with a mass constraint over a domain in ℝ
N
, involving a potential vanishing on two curves in the plane. We demonstrate how the behavior of the minimizers depends on
the geometry of the domain and, more precisely, on its isoperimetric profile. 相似文献
69.
Itai Benjamini Carlos Hoppen Eran Ofek Paweł Prałat Nick Wormald 《Journal of Graph Theory》2011,66(2):115-136
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance dG(u, v) is at least dC(u, v)?e(n). Let ω(n) be any function tending to infinity with n. We consider a random d‐regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n) = logd?1logd?1n+ ω(n) and |C| = 2logd?1n+ O(ω(n)). Along the way, we obtain results on near‐geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. Copyright © 2010 John Wiley & Sons, Ltd. J Graph Theory 66:115‐136, 2011 相似文献
70.
Simple random walk on the uniform infinite planar quadrangulation: subdiffusivity via pioneer points
We study the pioneer points of the simple random walk on the uniform infinite planar quadrangulation (UIPQ) using an adaptation of the peeling procedure of Angel (Geom Funct Anal 13:935–974, 2003) to the quadrangulation case. Our main result is that, up to polylogarithmic factors, n 3 pioneer points have been discovered before the walk exits the ball of radius n in the UIPQ. As a result we verify the KPZ relation Knizhnik et al. (Modern Phys Lett A 3:819–826, 1988) in the particular case of the pioneer exponent and prove that the walk is subdiffusive with exponent less than 1/3. Along the way, new geometric controls on the UIPQ are established. 相似文献