全文获取类型
收费全文 | 6908篇 |
免费 | 339篇 |
国内免费 | 32篇 |
专业分类
化学 | 5274篇 |
晶体学 | 25篇 |
力学 | 147篇 |
数学 | 661篇 |
物理学 | 1172篇 |
出版年
2023年 | 66篇 |
2022年 | 98篇 |
2021年 | 114篇 |
2020年 | 142篇 |
2019年 | 162篇 |
2018年 | 133篇 |
2017年 | 114篇 |
2016年 | 255篇 |
2015年 | 193篇 |
2014年 | 206篇 |
2013年 | 347篇 |
2012年 | 552篇 |
2011年 | 641篇 |
2010年 | 300篇 |
2009年 | 220篇 |
2008年 | 467篇 |
2007年 | 481篇 |
2006年 | 474篇 |
2005年 | 449篇 |
2004年 | 315篇 |
2003年 | 292篇 |
2002年 | 236篇 |
2001年 | 83篇 |
2000年 | 64篇 |
1999年 | 41篇 |
1998年 | 36篇 |
1997年 | 48篇 |
1996年 | 67篇 |
1995年 | 57篇 |
1994年 | 35篇 |
1993年 | 56篇 |
1992年 | 46篇 |
1991年 | 30篇 |
1990年 | 19篇 |
1989年 | 20篇 |
1988年 | 15篇 |
1987年 | 21篇 |
1986年 | 22篇 |
1985年 | 31篇 |
1984年 | 24篇 |
1983年 | 15篇 |
1982年 | 28篇 |
1981年 | 27篇 |
1979年 | 20篇 |
1978年 | 14篇 |
1977年 | 20篇 |
1976年 | 13篇 |
1975年 | 17篇 |
1974年 | 12篇 |
1972年 | 13篇 |
排序方式: 共有7279条查询结果,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
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. 相似文献
7.
William J. Letts Bambi L. Bailey Kathryn Scantlebury 《School science and mathematics》1997,97(4):192-199
With recent national calls for the reform of science education have come standards that delineate not only science content but also assessment, pedagogy, and teachers’ professional development. If teachers must teach science differently, then teacher preparation must change. This study asked 31 inservice secondary science teachers to complete a survey about topics for inclusion in a secondary science methods course. Respondents ranked a list of prespecified topics and had an opportunity to suggest other topics for inclusion in the course. Results showed that the majority of prespecified potential topics were judged important enough by these teachers to warrant inclusion in a methods course, though no individual added topic appeared on more than two surveys. Results demonstrate that these teachers believe teaching many of the traditional topics in science methods courses is still needed. In addition, they advocated the inclusion of several topics that either represent recent technological and theoretical advances, or longstanding ideas that have recently received considerable attention. 相似文献
8.
9.
The identification of incomplete signal re-setting of optically stimulated luminescence signals in sedimentary quartz is a vitally important step in the continued improvement of optical dating. It is shown that narrow spectrum (blue-green) laboratory partial bleaching of aliquots of natural sedimentary quartz has a significant effect on equivalent dose (measured using a single aliquot procedure) calculated as a function of measurement time (De(t)). The blue-green stimulation spectrum mimics that found underwater and the results suggest that incomplete re-setting of waterlain sediments may be possible using the De(t) method. 相似文献
10.
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. 相似文献