全文获取类型
收费全文 | 7638篇 |
免费 | 378篇 |
国内免费 | 35篇 |
专业分类
化学 | 5795篇 |
晶体学 | 51篇 |
力学 | 179篇 |
数学 | 848篇 |
物理学 | 1178篇 |
出版年
2023年 | 64篇 |
2022年 | 46篇 |
2021年 | 122篇 |
2020年 | 157篇 |
2019年 | 166篇 |
2018年 | 134篇 |
2017年 | 115篇 |
2016年 | 276篇 |
2015年 | 224篇 |
2014年 | 217篇 |
2013年 | 380篇 |
2012年 | 592篇 |
2011年 | 688篇 |
2010年 | 304篇 |
2009年 | 240篇 |
2008年 | 503篇 |
2007年 | 522篇 |
2006年 | 530篇 |
2005年 | 492篇 |
2004年 | 355篇 |
2003年 | 330篇 |
2002年 | 281篇 |
2001年 | 108篇 |
2000年 | 81篇 |
1999年 | 59篇 |
1998年 | 53篇 |
1997年 | 51篇 |
1996年 | 60篇 |
1995年 | 43篇 |
1994年 | 43篇 |
1993年 | 50篇 |
1992年 | 47篇 |
1991年 | 54篇 |
1990年 | 30篇 |
1989年 | 25篇 |
1988年 | 23篇 |
1987年 | 20篇 |
1986年 | 27篇 |
1985年 | 44篇 |
1984年 | 45篇 |
1983年 | 27篇 |
1982年 | 38篇 |
1981年 | 42篇 |
1980年 | 23篇 |
1979年 | 36篇 |
1978年 | 24篇 |
1977年 | 34篇 |
1976年 | 20篇 |
1975年 | 26篇 |
1974年 | 21篇 |
排序方式: 共有8051条查询结果,搜索用时 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.
M. B. Wright 《The Journal of the Operational Research Society》1989,40(2):187-192
This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method. 相似文献
7.
A. Grittner J. Szilasi C. R. Alder Wright und C. Thompson 《Fresenius' Journal of Analytical Chemistry》1886,25(1):594-595
Ohne Zusammenfassung 相似文献
8.
N. Wright und W. C. Lee 《Fresenius' Journal of Analytical Chemistry》1940,120(1-2):39-40
Ohne Zusammenfassung 相似文献
9.
10.
Water suppression by diffusive attenuation was used to measure Brix in intact cellular tissue of apple and strawberry. Given
the signal-to-noise ratio, the correlation for apple was established without repeated acquisition, so this protocol should
also be useful for rapid, on-line measurements at low spectrometer frequencies. Water suppression by theT
1-Null method fails with cellular tissue because of the considerable variation in the longitudinal relaxation times of vacuolar
and cytoplasmic water. 相似文献