全文获取类型
收费全文 | 8623篇 |
免费 | 1162篇 |
国内免费 | 825篇 |
专业分类
化学 | 4051篇 |
晶体学 | 35篇 |
力学 | 1764篇 |
综合类 | 91篇 |
数学 | 1373篇 |
物理学 | 3296篇 |
出版年
2024年 | 14篇 |
2023年 | 55篇 |
2022年 | 166篇 |
2021年 | 247篇 |
2020年 | 276篇 |
2019年 | 257篇 |
2018年 | 279篇 |
2017年 | 307篇 |
2016年 | 317篇 |
2015年 | 328篇 |
2014年 | 434篇 |
2013年 | 816篇 |
2012年 | 472篇 |
2011年 | 522篇 |
2010年 | 419篇 |
2009年 | 471篇 |
2008年 | 439篇 |
2007年 | 485篇 |
2006年 | 467篇 |
2005年 | 450篇 |
2004年 | 390篇 |
2003年 | 399篇 |
2002年 | 315篇 |
2001年 | 283篇 |
2000年 | 271篇 |
1999年 | 222篇 |
1998年 | 250篇 |
1997年 | 192篇 |
1996年 | 163篇 |
1995年 | 132篇 |
1994年 | 109篇 |
1993年 | 103篇 |
1992年 | 89篇 |
1991年 | 83篇 |
1990年 | 79篇 |
1989年 | 43篇 |
1988年 | 38篇 |
1987年 | 30篇 |
1986年 | 31篇 |
1985年 | 32篇 |
1984年 | 22篇 |
1983年 | 11篇 |
1982年 | 27篇 |
1981年 | 16篇 |
1980年 | 13篇 |
1979年 | 10篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1972年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
841.
We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of .
Received 24 March 2000. 相似文献
842.
843.
Jorge Almeida 《Transactions of the American Mathematical Society》2002,354(1):387-411
This work gives a new approach to the construction of implicit operations. By considering ``higher-dimensional' spaces of implicit operations and implicit operators between them, the projection of idempotents back to one-dimensional spaces produces implicit operations with interesting properties. Besides providing a wealth of examples of implicit operations which can be obtained by these means, it is shown how they can be used to deduce from results of Ribes and Zalesski, Margolis, Sapir and Weil, and Steinberg that the pseudovariety of -groups is tame. More generally, for a recursively enumerable extension closed pseudovariety of groups , if it can be decided whether a finitely generated subgroup of the free group with the pro- topology is dense, then is tame.
844.
Patrick Dehornoy 《Algebra Universalis》2002,48(2):223-248
We solve the word problem of the identity x(yz) = (xy)(yz) by investigating a certain group describing the geometry of that identity. We also construct a concrete realization of the
one-generated free algebra relative to the above identity.
Received March 23, 2001; accepted in final form July 6, 2002. 相似文献
845.
We calculate the test rank of a finite rank free metabelian Lie algebra over an arbitrary field and characterize the test sets for these algebras. We prove that each automorphism that is the identity modulo the derived subalgebra and that acts as the identity on some test set is an inner automorphism. 相似文献
846.
Near Best Tree Approximation 总被引:2,自引:0,他引:2
Baraniuk R.G. DeVore R.A. Kyriazis G. Yu X.M. 《Advances in Computational Mathematics》2002,16(4):357-373
Tree approximation is a form of nonlinear wavelet approximation that appears naturally in applications such as image compression and entropy encoding. The distinction between tree approximation and the more familiar n-term wavelet approximation is that the wavelets appearing in the approximant are required to align themselves in a certain connected tree structure. This makes their positions easy to encode. Previous work [4,6] has established upper bounds for the error of tree approximation for certain (Besov) classes of functions. This paper, in contrast, studies tree approximation of individual functions with the aim of characterizing those functions with a prescribed approximation error. We accomplish this in the case that the approximation error is measured in L
2, or in the case p2, in the Besov spaces B
p
0(L
p
), which are close to (but not the same as) L
p
. Our characterization of functions with a prescribed approximation order in these cases is given in terms of a certain maximal function applied to the wavelet coefficients. 相似文献
847.
We characterize the best model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct best model geometries in an appropriate sense – these are the maximally symmetric trees. The first theorem gives several equivalent conditions on a bounded valence, cocompact tree T without valence 1 vertices saying that T is maximally symmetric. The second theorem gives general constructions for maximally symmetric trees, showing for instance that every virtually free group has a maximally symmetric tree for a model geometry. 相似文献
848.
849.
It is proved that the center of an automorphism group Aut(FVL2) of a free vector lattice FVL2 on a set of two free generators is isomorphic to a multiplicative group of positive reals. It is shown that the free vector lattice FVL2 has an isomorphic representation by continuous piecewise linear functions of the real line; as a consequence, the ideal lattice and the root system for rectifying ideals in FVL2 are amply described. Similar results are obtained for a free vector lattice FVL2
Q
2 generated by two elements over a field of rational numbers. 相似文献
850.
N. S. Bakhvalov A. V. Knyazev R. R. Parashkevov 《Numerical Linear Algebra with Applications》2002,9(2):115-139
We prove extension theorems in the norms described by Stokes and Lamé operators for the three‐dimensional case with periodic boundary conditions. For the Lamé equations, we show that the extension theorem holds for nearly incompressible media, but may fail in the opposite limit, i.e. for case of absolutely compressible media. We study carefully the latter case and associate it with the Cosserat problem. Extension theorems serve as an important tool in many applications, e.g. in domain decomposition and fictitious domain methods, and in analysis of finite element methods. We consider an application of established extension theorems to an efficient iterative solution technique for the isotropic linear elasticity equations for nearly incompressible media and for the Stokes equations with highly discontinuous coefficients. The iterative method involves a special choice for an initial guess and a preconditioner based on solving a constant coefficient problem. Such preconditioner allows the use of well‐known fast algorithms for preconditioning. Under some natural assumptions on smoothness and topological properties of subdomains with small coefficients, we prove convergence of the simplest Richardson method uniform in the jump of coefficients. For the Lamé equations, the convergence is also uniform in the incompressible limit. Our preliminary numerical results for two‐dimensional diffusion problems show fast convergence uniform in the jump and in the mesh size parameter. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献