全文获取类型
收费全文 | 62702篇 |
免费 | 1344篇 |
国内免费 | 535篇 |
专业分类
化学 | 34565篇 |
晶体学 | 527篇 |
力学 | 2028篇 |
综合类 | 13篇 |
数学 | 14751篇 |
物理学 | 12697篇 |
出版年
2022年 | 330篇 |
2021年 | 450篇 |
2020年 | 626篇 |
2019年 | 608篇 |
2018年 | 1587篇 |
2017年 | 1808篇 |
2016年 | 1631篇 |
2015年 | 1355篇 |
2014年 | 1444篇 |
2013年 | 2314篇 |
2012年 | 5203篇 |
2011年 | 4695篇 |
2010年 | 3088篇 |
2009年 | 2673篇 |
2008年 | 2787篇 |
2007年 | 2658篇 |
2006年 | 2672篇 |
2005年 | 6265篇 |
2004年 | 5488篇 |
2003年 | 3620篇 |
2002年 | 1795篇 |
2001年 | 763篇 |
2000年 | 554篇 |
1999年 | 573篇 |
1998年 | 502篇 |
1997年 | 483篇 |
1996年 | 489篇 |
1995年 | 353篇 |
1994年 | 409篇 |
1993年 | 355篇 |
1992年 | 471篇 |
1991年 | 430篇 |
1990年 | 377篇 |
1989年 | 316篇 |
1988年 | 308篇 |
1987年 | 277篇 |
1986年 | 221篇 |
1985年 | 412篇 |
1984年 | 359篇 |
1983年 | 306篇 |
1982年 | 360篇 |
1981年 | 295篇 |
1980年 | 300篇 |
1979年 | 269篇 |
1978年 | 251篇 |
1977年 | 235篇 |
1976年 | 287篇 |
1975年 | 223篇 |
1974年 | 200篇 |
1973年 | 170篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Mark E. Filipkowski Edwin E. Hach III Michael Offenbacker 《Journal of magnetism and magnetic materials》2006
We show, via a straightforward calculation, that it is feasible to detect nuclear spin echoes in a ferromagnetic thin film by electrical means. The detection scheme is based on the deflection of the electronic magnetization when the nuclear magnetization reforms during an echo. This deflection is observed as a time-dependent magnetoresistive signal. 相似文献
102.
Piotr Ko?cielniak 《Topology and its Applications》2007,154(9):1951-1955
Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1). 相似文献
103.
Michael McLendon 《Topology and its Applications》2007,154(18):3140-3144
For a surface F, the Kauffman bracket skein module of F×[0,1], denoted K(F), admits a natural multiplication which makes it an algebra. When specialized at a complex number t, nonzero and not a root of unity, we have Kt(F), a vector space over C. In this paper, we will use the product-to-sum formula of Frohman and Gelca to show that the vector space Kt(T2) has five distinct traces. One trace, the Yang-Mills measure, is obtained by picking off the coefficient of the empty skein. The other four traces on Kt(T2) correspond to the four singular points of the moduli space of flat SU(2)-connections on the torus. 相似文献
104.
Michael Holcomb 《Topology and its Applications》2007,154(1):124-143
One can form a polygonal linkage by identifying initial and terminal points of two free linkages. Likewise, one can form a multipolygonal linkage by identifying initial and terminal points of three free linkages. The geometric and topological properties of moduli spaces of multipolygonal linkages in the plane are studied. These spaces are compact algebraic varieties. Some conditions under which these spaces are smooth manifolds, cross products or disjoint unions of moduli spaces of polygonal linkages, or connected, are determined. Dimensions in smooth manifold cases and some Euler characteristics are computed. A classification of generic multiquadrilateral linkages is also made. 相似文献
105.
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation. 相似文献
106.
We give counterexamples to the following conjecture of Auslander: given a finitely generated module M over an Artin algebra Λ, there exists a positive integer nM such that for all finitely generated Λ-modules N, if ExtΛi(M,N)=0 for all i?0, then ExtΛi(M,N)=0 for all i?nM. Some of our examples moreover yield homologically defined classes of commutative local rings strictly between the class of local complete intersections and the class of local Gorenstein rings. 相似文献
107.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem. 相似文献
108.
It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of
a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system.
We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix
associated to a chord diagram, and another in terms of counting paths of intersecting chords.
Electronic supplementary material to this article is available at and is accessible to authorized users.
* S. G. was partially supported by an NSF and by an Israel-US BSF grant.
† M. L. was partly supported by GAUK 158 grant and by the Project LN00A056 of the Czech Ministry of Education. 相似文献
109.
We study a class of shape optimization problems for semi-linear elliptic equations with Dirichlet boundary conditions in smooth
domains in ℝ2. A part of the boundary of the domain is variable as the graph of a smooth function. The problem is equivalently reformulated
on a fixed domain. Continuity of the solution to the state equation with respect to domain variations is shown. This is used
to obtain differentiability in the general case, and moreover a useful formula for the gradient of the cost functional in
the case where the principal part of the differential operator is the Laplacian.
Online publication 23 January 2004. 相似文献
110.
An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficient-exponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.