全文获取类型
收费全文 | 99998篇 |
免费 | 10495篇 |
国内免费 | 8145篇 |
专业分类
化学 | 38017篇 |
晶体学 | 1365篇 |
力学 | 15040篇 |
综合类 | 1596篇 |
数学 | 34608篇 |
物理学 | 28012篇 |
出版年
2024年 | 160篇 |
2023年 | 843篇 |
2022年 | 1411篇 |
2021年 | 2681篇 |
2020年 | 2442篇 |
2019年 | 2353篇 |
2018年 | 2139篇 |
2017年 | 2702篇 |
2016年 | 3140篇 |
2015年 | 2848篇 |
2014年 | 4276篇 |
2013年 | 6680篇 |
2012年 | 5102篇 |
2011年 | 5838篇 |
2010年 | 5126篇 |
2009年 | 6004篇 |
2008年 | 6191篇 |
2007年 | 6411篇 |
2006年 | 5507篇 |
2005年 | 4603篇 |
2004年 | 4055篇 |
2003年 | 3967篇 |
2002年 | 6159篇 |
2001年 | 3416篇 |
2000年 | 2775篇 |
1999年 | 2431篇 |
1998年 | 2323篇 |
1997年 | 1840篇 |
1996年 | 1763篇 |
1995年 | 1502篇 |
1994年 | 1361篇 |
1993年 | 1239篇 |
1992年 | 1175篇 |
1991年 | 872篇 |
1990年 | 689篇 |
1989年 | 524篇 |
1988年 | 517篇 |
1987年 | 428篇 |
1986年 | 388篇 |
1985年 | 519篇 |
1984年 | 417篇 |
1983年 | 232篇 |
1982年 | 438篇 |
1981年 | 571篇 |
1980年 | 496篇 |
1979年 | 538篇 |
1978年 | 437篇 |
1977年 | 333篇 |
1976年 | 284篇 |
1973年 | 163篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
71.
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. 相似文献
72.
We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP
n
. For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish
a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP
n
and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of
the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by
congruence classes or if distances π/2 are allowed. Finally we do the same
kind of investigation also for the complex hyperbolic space ℂH
n
. Most of the results are completely analogous, however, there are also some interesting differences.
Received: 15 January 1996 相似文献
73.
Summary. We generalise and apply a refinement indicator of the type originally designed by Mackenzie, Süli and Warnecke in [15] and
[16] for linear Friedrichs systems to the Euler equations of inviscid, compressible fluid flow. The Euler equations are symmetrized
by means of entropy variables and locally linearized about a constant state to obtain a symmetric hyperbolic system to which
an a posteriori error analysis of the type introduced in [15] can be applied. We discuss the details of the implementation of the refinement
indicator into the DLR--Code which is based on a finite volume method of box type on an unstructured grid and present numerical results.
Received May 15, 1995 / Revised version received April 17, 1996 相似文献
74.
I. L. Eremenko M. A. Golubnichaya S. E. Nefedov A. A. Sidorov D. A. Nesterenko N. P. Konovalova L. M. Volkova L. T. Eremenko 《Russian Chemical Bulletin》1997,46(9):1595-1598
Thetrans-[Pt(NC5H4C(O)NHC2H4ONO2)2Cl2] complex (2) was prepared by the reaction of nicorandyl (N-nitroethoxynicotinamide), which is widely used in cardiology, with K2PtCl4 in water. The structure of2 was established by X-ray structural analysis. It was found that complex2 exhibits high antitumor activity, in particular, antimetastatic activity, unlike the analogous CuII complex with bromine atoms.
Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 9, pp. 1672–1675, September, 1997. 相似文献
75.
Rafael López 《Annals of Global Analysis and Geometry》1997,15(3):201-210
In this paper we study constant mean curvature compact surfaces with two Jordan curves in parallel planes as boundary and we investigate the point at which the surface inherits the symmetries of its boundary. 相似文献
76.
许明浩 《武汉大学学报(理学版)》1996,(1)
讨论如下Hilbert空间中的半线性随机发展方程的Cauchy问题 dy(t)=[Ay(t) f(t,y(t))]dt G(t,y(t))dw(t) y(O)=V_u的适度解的存在唯一性,在更一般的条件下,得到了该问题的适度解的存在唯一性。 相似文献
77.
本文给出了混合型多项式Hammerstein积分方程正解的迭代求法,并将所得结果应用到二阶非线性常微分方程的边值问题 相似文献
78.
本文是文[1-7]的继续,研究变权综合问题,从确定变权的经验公式入手引出了变权原理,给出了变权的公理化定义,讨论了与之有关的均衡函数及其梯度向量。 相似文献
79.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
80.
J.V.P. de OliveiraA.V. Cardona M.T. VilhenaR.C. Barros 《Journal of Quantitative Spectroscopy & Radiative Transfer》2002,73(1):55-62
We describe a semi-analytical numerical method for coherent isotropic scattering time-dependent radiative transfer problems in slab geometry. This numerical method is based on a combination of two classes of numerical methods: the spectral methods and the Laplace transform (LTSN) methods applied to the radiative transfer equation in the discrete ordinates (SN) formulation. The basic idea is to use the essence of the spectral methods and expand the intensity of radiation in a truncated series of Laguerre polynomials in the time variable and then solve recursively the resulting set of “time-independent” SN problems by using the LTSN method. We show some numerical experiments for a typical model problem. 相似文献