全文获取类型
收费全文 | 505936篇 |
免费 | 9144篇 |
国内免费 | 3644篇 |
专业分类
化学 | 277277篇 |
晶体学 | 7357篇 |
力学 | 21634篇 |
综合类 | 73篇 |
数学 | 60965篇 |
物理学 | 151418篇 |
出版年
2021年 | 3516篇 |
2020年 | 4055篇 |
2019年 | 4227篇 |
2018年 | 4634篇 |
2017年 | 4425篇 |
2016年 | 7880篇 |
2015年 | 6007篇 |
2014年 | 8455篇 |
2013年 | 23741篇 |
2012年 | 18080篇 |
2011年 | 22198篇 |
2010年 | 14160篇 |
2009年 | 14040篇 |
2008年 | 19826篇 |
2007年 | 20033篇 |
2006年 | 18958篇 |
2005年 | 17410篇 |
2004年 | 15453篇 |
2003年 | 13691篇 |
2002年 | 13408篇 |
2001年 | 14911篇 |
2000年 | 11501篇 |
1999年 | 9289篇 |
1998年 | 7618篇 |
1997年 | 7448篇 |
1996年 | 7317篇 |
1995年 | 6766篇 |
1994年 | 6362篇 |
1993年 | 6193篇 |
1992年 | 6849篇 |
1991年 | 6787篇 |
1990年 | 6358篇 |
1989年 | 6172篇 |
1988年 | 6382篇 |
1987年 | 6034篇 |
1986年 | 5812篇 |
1985年 | 8212篇 |
1984年 | 8396篇 |
1983年 | 6871篇 |
1982年 | 7481篇 |
1981年 | 7380篇 |
1980年 | 7124篇 |
1979年 | 7198篇 |
1978年 | 7441篇 |
1977年 | 7285篇 |
1976年 | 7354篇 |
1975年 | 6944篇 |
1974年 | 6908篇 |
1973年 | 7253篇 |
1972年 | 4375篇 |
排序方式: 共有10000条查询结果,搜索用时 156 毫秒
231.
Brian R. Hunt 《Proceedings of the American Mathematical Society》1998,126(3):791-800
The Weierstrass nowhere differentiable function, and functions constructed from similar infinite series, have been studied often as examples of functions whose graph is a fractal. Though there is a simple formula for the Hausdorff dimension of the graph which is widely accepted, it has not been rigorously proved to hold. We prove that if arbitrary phases are included in each term of the summation for the Weierstrass function, the Hausdorff dimension of the graph of the function has the conjectured value for almost every sequence of phases. The argument extends to a much wider class of Weierstrass-like functions.
232.
We have recently demonstrated that polarization transfer using an adiabatic passage through the Hartmann-Hahn condition (APHH-CP) by a variation of the radio-frequency amplitude can substantially improve the transfer efficiency over Hartmann-Hahn cross polarization. Here we show that APHH-CP can be combined with fast magic angle sample spinning (MAS). The heteronuclear dipolar order, established in the course of the transfer, can indeed be created and preserved. 相似文献
233.
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. 相似文献
234.
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. 相似文献
235.
236.
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. 相似文献
237.
238.
239.
240.