全文获取类型
收费全文 | 6088篇 |
免费 | 325篇 |
国内免费 | 27篇 |
专业分类
化学 | 4840篇 |
晶体学 | 20篇 |
力学 | 119篇 |
数学 | 607篇 |
物理学 | 854篇 |
出版年
2023年 | 61篇 |
2022年 | 43篇 |
2021年 | 109篇 |
2020年 | 135篇 |
2019年 | 154篇 |
2018年 | 125篇 |
2017年 | 107篇 |
2016年 | 242篇 |
2015年 | 189篇 |
2014年 | 200篇 |
2013年 | 317篇 |
2012年 | 530篇 |
2011年 | 604篇 |
2010年 | 273篇 |
2009年 | 210篇 |
2008年 | 459篇 |
2007年 | 450篇 |
2006年 | 462篇 |
2005年 | 421篇 |
2004年 | 299篇 |
2003年 | 262篇 |
2002年 | 220篇 |
2001年 | 72篇 |
2000年 | 39篇 |
1999年 | 30篇 |
1998年 | 37篇 |
1997年 | 37篇 |
1996年 | 34篇 |
1995年 | 27篇 |
1994年 | 16篇 |
1993年 | 25篇 |
1992年 | 17篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 20篇 |
1984年 | 17篇 |
1983年 | 7篇 |
1982年 | 9篇 |
1981年 | 12篇 |
1980年 | 9篇 |
1979年 | 10篇 |
1977年 | 12篇 |
1976年 | 10篇 |
1975年 | 6篇 |
1973年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有6440条查询结果,搜索用时 140 毫秒
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.
This paper models a decision where a player must allocate limitedenergy over a contest of uncertain length. The motivating exampleis a squash match where one of the players is not as fit asthe other. Should a player's energy be concentrated in the earlygames of the match? Should it be spread evenly over all possiblegames? Or should it be conserved for the end of the match? Wemodel this as a decision problem where, in each game, the decision-makermust determine how much energy to expend. We assume that thereare only a small number of discrete energy choices for eachgame and that the more energy the decision-maker expends, themore likely he is to win that game. We solve for the optimaldecision with dynamic programming. With only two possible energychoices for each game, we show that it does not matter how energyis expended. In the case where there are three or more energychoices, we show how to take advantage of the structure of theproblem to determine the optimal sequence of decisions. As forpractical advice, the model suggests that when the decision-makerfalls behind in a match, he ought to switch to a more conservativeapproach by dividing his remaining energy evenly among all thepossible remaining games.
Received 14 May 2003. Revised 5 January 2004. 相似文献
7.
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. 相似文献
8.
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.
9.
Geometric (Clifford) algebra provides an efficient mathematical language for describing physical problems. We formulate general relativity in this language. The resulting formalism combines the efficiency of differential forms with the straightforwardness of coordinate methods. We focus our attention on orthonormal frames and the associated connection bivector, using them to find the Schwarzschild and Kerr solutions, along with a detailed exposition of the Petrov types for the Weyl tensor. 相似文献
10.
The XYZ model describes the interaction between nuclear probes and an electric field gradient that fluctuates among three orthogonal
directions. The model presents a means to calculate the perturbation function that represents spectra obtained using perturbed
angular correlation spectroscopy. Three analytic approximations of the perturbation function have been developed previously,
and they are evaluated in the present paper in the context of Cd jumping among In-lattice sites in In3La. 相似文献