全文获取类型
收费全文 | 6630篇 |
免费 | 347篇 |
国内免费 | 34篇 |
专业分类
化学 | 5158篇 |
晶体学 | 32篇 |
力学 | 136篇 |
数学 | 714篇 |
物理学 | 971篇 |
出版年
2023年 | 62篇 |
2022年 | 47篇 |
2021年 | 118篇 |
2020年 | 144篇 |
2019年 | 162篇 |
2018年 | 133篇 |
2017年 | 110篇 |
2016年 | 262篇 |
2015年 | 201篇 |
2014年 | 205篇 |
2013年 | 337篇 |
2012年 | 554篇 |
2011年 | 653篇 |
2010年 | 298篇 |
2009年 | 224篇 |
2008年 | 483篇 |
2007年 | 478篇 |
2006年 | 483篇 |
2005年 | 448篇 |
2004年 | 323篇 |
2003年 | 281篇 |
2002年 | 232篇 |
2001年 | 74篇 |
2000年 | 45篇 |
1999年 | 35篇 |
1998年 | 37篇 |
1997年 | 42篇 |
1996年 | 32篇 |
1995年 | 28篇 |
1994年 | 25篇 |
1993年 | 36篇 |
1992年 | 30篇 |
1991年 | 24篇 |
1990年 | 18篇 |
1989年 | 15篇 |
1988年 | 20篇 |
1987年 | 19篇 |
1986年 | 14篇 |
1985年 | 26篇 |
1984年 | 24篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 16篇 |
1979年 | 24篇 |
1978年 | 20篇 |
1977年 | 16篇 |
1976年 | 15篇 |
1975年 | 11篇 |
1974年 | 17篇 |
1973年 | 16篇 |
排序方式: 共有7011条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
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. 相似文献
6.
7.
Curtis T. Mcmullen 《Acta Mathematica》2003,191(2):191-223
8.
Curtis T. McMullen 《Journal of the American Mathematical Society》2003,16(4):857-885
This paper exhibits an infinite collection of algebraic curves isometrically embedded in the moduli space of Riemann surfaces of genus two. These Teichmüller curves lie on Hilbert modular surfaces parameterizing Abelian varieties with real multiplication. Explicit examples, constructed from L-shaped polygons, give billiard tables with optimal dynamical properties.
9.
Matthew H Ervin 《Microscopy and microanalysis》2003,9(1):18-28
The environmental cell device discussed in this paper provides a modest low-vacuum scanning electron microscopy (SEM) capability to a standard SEM without requiring additional pumping. This environmental cell confines a volume of low vacuum in contact with the sample surface using a container that has an aperture for admitting the primary electron beam. The aperture is large enough to permit a limited field of view of the sample, and small enough to limit the outflow of gas into the SEM chamber to that which can be accommodated by the standard SEM pumping system. This environmental cell also functions as a gaseous detector device. 相似文献
10.
Matthew Foreman Stevo Todorcevic 《Transactions of the American Mathematical Society》2005,357(5):1693-1715
This paper establishes a refinement of the classical Löwenheim-Skolem theorem. The main result shows that any first order structure has a countable elementary substructure with strong second order properties. Several consequences for Singular Cardinals Combinatorics are deduced from this.