全文获取类型
收费全文 | 428386篇 |
免费 | 6044篇 |
国内免费 | 1670篇 |
专业分类
化学 | 233352篇 |
晶体学 | 6078篇 |
力学 | 18411篇 |
综合类 | 14篇 |
数学 | 50521篇 |
物理学 | 127724篇 |
出版年
2020年 | 2833篇 |
2019年 | 2812篇 |
2018年 | 2827篇 |
2017年 | 2755篇 |
2016年 | 5598篇 |
2015年 | 4661篇 |
2014年 | 6234篇 |
2013年 | 19471篇 |
2012年 | 15010篇 |
2011年 | 18753篇 |
2010年 | 11680篇 |
2009年 | 11762篇 |
2008年 | 17230篇 |
2007年 | 17565篇 |
2006年 | 16932篇 |
2005年 | 15469篇 |
2004年 | 13911篇 |
2003年 | 12240篇 |
2002年 | 11993篇 |
2001年 | 13669篇 |
2000年 | 10558篇 |
1999年 | 8281篇 |
1998年 | 6599篇 |
1997年 | 6449篇 |
1996年 | 6469篇 |
1995年 | 5904篇 |
1994年 | 5536篇 |
1993年 | 5282篇 |
1992年 | 5909篇 |
1991年 | 5772篇 |
1990年 | 5315篇 |
1989年 | 5173篇 |
1988年 | 5460篇 |
1987年 | 5072篇 |
1986年 | 4902篇 |
1985年 | 7154篇 |
1984年 | 7180篇 |
1983年 | 5844篇 |
1982年 | 6308篇 |
1981年 | 6251篇 |
1980年 | 6032篇 |
1979年 | 6107篇 |
1978年 | 6159篇 |
1977年 | 6107篇 |
1976年 | 6010篇 |
1975年 | 5891篇 |
1974年 | 5685篇 |
1973年 | 5913篇 |
1972年 | 3458篇 |
1971年 | 2470篇 |
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
181.
182.
NaY zeolite samples loaded with sodium metal by vapor phase deposition have been investigated using129Xe NMR spectroscopy. At low sodium concentration, the129Xe NMR spectrum showed three resonance lines which clearly indicate the existence of distinct domains in the zeolite sample. Such an observation suggests that the diffusion of the xenon atoms into each domain only occurs with respect to the NMR time scale (2.9 ms). As the sodium concentration increases, observation of a single broad line indicate a macroscopic homogenization of the system. The shift of this line is explained in part due to a paramagnetic interaction between the xenon atoms and the unpaired electrons of particles containing an odd number of sodium atoms. The linewidth is due to the distribution of the local magnetic fields partially averaged by the rapid motion of the xenon atoms and to the statistical distribution of the sodium particles in the supercage cavities. The paramagnetic interaction vanishes with the oxidation of the sample leading to a narrowing and a shift of the line to higher magnetic fields. 相似文献
183.
Peter J. Grabner 《Random Structures and Algorithms》1993,4(1):99-110
We investigate the following process: N people select b losers by flipping coins. The 0-party continues until there are less than b losers; then the 1-party has to find the other losers by the same process. The average time for this process is about long2 N, but this result requires rather advanced methods. Furthermore, the average size of a binary tree associated to this process and the average number of coin flippings are computed. The method used in this article can be used to give asympotical solutions of a special type of bivariate recurrences. © 1993 John Wiley & Sons, Inc. 相似文献
184.
We study spectral properties of discrete Schrödinger operators with potentials obtained via dimerization of a class of aperiodic sequences. It is shown that both the nature of the autocorrelation measure of a regular sequence and the presence of generic (full probability) singular continuous spectrum in the hull of primitive and palindromic (four block substitution) potentials are robust under dimerization. Generic results also hold for circle potentials. We illustrate these results with numerical studies of the quantum mean square displacement as a function of time. The numerical techniques provide a very fast algorithm for the time evolution of wave packets. 相似文献
185.
In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively. 相似文献
186.
C. W. LEUNG Department of Mathematics The Chinese Universityof Hong Kong Shatin. N. T. Hong Kong China. 《数学年刊B辑(英文版)》1997,(1)
ASTRASSENLAWOFTHEITERATEDLOGARITHMFORPROCESSESWITHINDEPENDENTINCREMENTWangJiagangAbstractLetX={X(t),t0}beaproceswithindep... 相似文献
187.
188.
Matthew J. Katz 《Computational Geometry》1997,8(6):299-316
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).
We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm. 相似文献
189.
190.