全文获取类型
收费全文 | 127419篇 |
免费 | 9819篇 |
国内免费 | 15508篇 |
专业分类
化学 | 80308篇 |
晶体学 | 2025篇 |
力学 | 11387篇 |
综合类 | 1361篇 |
数学 | 26869篇 |
物理学 | 30796篇 |
出版年
2024年 | 169篇 |
2023年 | 1020篇 |
2022年 | 2235篇 |
2021年 | 2627篇 |
2020年 | 3256篇 |
2019年 | 3082篇 |
2018年 | 2790篇 |
2017年 | 4005篇 |
2016年 | 4327篇 |
2015年 | 3512篇 |
2014年 | 5193篇 |
2013年 | 9263篇 |
2012年 | 8510篇 |
2011年 | 7593篇 |
2010年 | 6433篇 |
2009年 | 8236篇 |
2008年 | 8335篇 |
2007年 | 8548篇 |
2006年 | 7755篇 |
2005年 | 6729篇 |
2004年 | 6121篇 |
2003年 | 5192篇 |
2002年 | 6289篇 |
2001年 | 4002篇 |
2000年 | 3699篇 |
1999年 | 3447篇 |
1998年 | 3055篇 |
1997年 | 2460篇 |
1996年 | 2077篇 |
1995年 | 1915篇 |
1994年 | 1722篇 |
1993年 | 1421篇 |
1992年 | 1375篇 |
1991年 | 963篇 |
1990年 | 791篇 |
1989年 | 717篇 |
1988年 | 545篇 |
1987年 | 417篇 |
1986年 | 357篇 |
1985年 | 338篇 |
1984年 | 341篇 |
1983年 | 187篇 |
1982年 | 279篇 |
1981年 | 221篇 |
1980年 | 217篇 |
1979年 | 223篇 |
1978年 | 199篇 |
1977年 | 158篇 |
1976年 | 120篇 |
1973年 | 72篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
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 相似文献
72.
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.
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. 相似文献
75.
76.
Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are
presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods
are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods.
Received December 19, 1994 / Revised version received January 18, 1996 相似文献
77.
Addition of functionalized zinc-copper reagents to the title complexes proceeds in a highly diastereoselective fashion to afford dienol complexes. The relative configurations of adducts 3d were determined by single X-ray diffraction analysis. 相似文献
78.
The characterization of the clusters formed on alkaline hydrolysis of [PdCl4]2– was performed using17O,23Na,35Cl,133Cs NMR and UV spectroscopy. The chemical composition of the clusters was found to be [Pd(OH)2]
n
·nNaCl. No mononuclear oxo- or hydroxocomplexes were detected. The spatial structure of the clusters is stabilized by alkali metal cations.Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 4, pp. 675–679, April, 1993. 相似文献
79.
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. 相似文献
80.
In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived. 相似文献