全文获取类型
收费全文 | 3093篇 |
免费 | 230篇 |
国内免费 | 323篇 |
专业分类
化学 | 88篇 |
力学 | 138篇 |
综合类 | 89篇 |
数学 | 3003篇 |
物理学 | 328篇 |
出版年
2024年 | 4篇 |
2023年 | 52篇 |
2022年 | 64篇 |
2021年 | 65篇 |
2020年 | 96篇 |
2019年 | 87篇 |
2018年 | 99篇 |
2017年 | 93篇 |
2016年 | 98篇 |
2015年 | 52篇 |
2014年 | 123篇 |
2013年 | 281篇 |
2012年 | 107篇 |
2011年 | 159篇 |
2010年 | 146篇 |
2009年 | 182篇 |
2008年 | 182篇 |
2007年 | 206篇 |
2006年 | 203篇 |
2005年 | 181篇 |
2004年 | 139篇 |
2003年 | 129篇 |
2002年 | 146篇 |
2001年 | 108篇 |
2000年 | 105篇 |
1999年 | 104篇 |
1998年 | 84篇 |
1997年 | 60篇 |
1996年 | 54篇 |
1995年 | 44篇 |
1994年 | 39篇 |
1993年 | 21篇 |
1992年 | 17篇 |
1991年 | 10篇 |
1990年 | 13篇 |
1989年 | 5篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 17篇 |
1985年 | 16篇 |
1984年 | 6篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 5篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有3646条查询结果,搜索用时 15 毫秒
101.
Quasi-interpolation is an important tool, used both in theory and in practice, for the approximation of smooth functions from univariate or multivariate spaces which contain , the d-variate polynomials of degree ≤m. In particular, the reproduction of Πm leads to an approximation order of m+1. Prominent examples include Lagrange and Bernstein type approximations by polynomials, the orthogonal projection onto Πm for some inner product, finite element methods of precision m, and multivariate spline approximations based on macroelements or the translates of a single spline.For such a quasi-interpolation operator L which reproduces and any r≥0, we give an explicit construction of a quasi-interpolant which reproduces Πm+r, together with an integral error formula which involves only the (m+r+1)th derivative of the function approximated. The operator is defined on functions with r additional orders of smoothness than those on which L is defined. This very general construction holds in all dimensions d. A number of representative examples are considered. 相似文献
102.
In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotients of non-commutative
polynomial rings, so called skew polynomial rings of automorphism type. We propose a method to construct block codes of prescribed
rank and a method to construct block codes of prescribed distance. Since there is no unique factorization in skew polynomial
rings, there are much more ideals and therefore much more codes than in the commutative case. In particular we obtain a [40,
23, 10]4 code by imposing a distance and a [42,14,21]8 code by imposing a rank, which both improve by one the minimum distance of the previously best known linear codes of equal
length and dimension over those fields. There is a strong connection with linear difference operators and with linearized
polynomials (or q-polynomials) reviewed in the first section.
相似文献
103.
A. Pérez-González J. M. Vilar-Fernández W. González-Manteiga 《Annals of the Institute of Statistical Mathematics》2009,61(1):85-109
The main objective of this work is the nonparametric estimation of the regression function with correlated errors when observations
are missing in the response variable. Two nonparametric estimators of the regression function are proposed. The asymptotic
properties of these estimators are studied; expresions for the bias and the variance are obtained and the joint asymptotic
normality is established. A simulation study is also included. 相似文献
104.
105.
Cristian Lenart Frank Sottile 《Proceedings of the American Mathematical Society》2003,131(11):3319-3328
We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron and Sottile in terms of certain increasing labeled chains in Bruhat order of the symmetric group. These skew Schubert polynomials expand in the basis of Schubert polynomials with nonnegative integer coefficients that are precisely the structure constants of the cohomology of the complex flag variety with respect to its basis of Schubert classes. We rederive the construction of Bergeron and Sottile in a purely combinatorial way, relating it to the construction of Schubert polynomials in terms of rc-graphs.
106.
Yuan Yuan LIU Zhen Ting HOU 《数学学报(英文版)》2007,23(7):1289-1296
This paper investigates the explicit convergence rates to the stationary distribution π of the embedded M/G/1 queue; specifically, for suitable rate functions r(n) which may be polynomial with r(n) = n^l, l 〉 0 or geometric with r(n) = α^n, a 〉 1 and "moments" f ≥ 1, we find the conditions under which Σ∞n=0 r(n)||P^n(i,·) - π(·)||f ≤ M(i) for all i ∈ E. For the polynomial case, the explicit bounds on M(i) are given in terms of both "drift functions" and behavior of the first hitting time on the state O; and for the geometric case, the largest geometric convergence rate α* is obtained. 相似文献
107.
Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients 总被引:2,自引:0,他引:2
** Email: todor{at}math.ethz.ch*** Corresponding author. Email: schwab{at}math.ethz.ch A scalar, elliptic boundary-value problem in divergence formwith stochastic diffusion coefficient a(x, ) in a bounded domainD d is reformulated as a deterministic, infinite-dimensional,parametric problem by separation of deterministic (x D) andstochastic ( ) variables in a(x, ) via KarhúnenLoèveor Legendre expansions of the diffusion coefficient. Deterministic,approximate solvers are obtained by projection of this probleminto a product probability space of finite dimension M and sparsediscretizations of the resulting M-dimensional parametric problem.Both Galerkin and collocation approximations are considered.Under regularity assumptions on the fluctuation of a(x, ) inthe deterministic variable x, the convergence rate of the deterministicsolution algorithm is analysed in terms of the number N of deterministicproblems to be solved as both the chaos dimension M and themultiresolution level of the sparse discretization resp. thepolynomial degree of the chaos expansion increase simultaneously. 相似文献
108.
The E-characteristic polynomial of an even order supersymmetric tensor is a useful tool in determining the positive definiteness of an even degree multivariate form. In this paper, for an even order tensor, we first establish the formula of its E-characteristic polynomial by using the classical Macaulay formula of resultants, then give an upper bound for the degree of that E-characteristic polynomial. Examples illustrate that this bound is attainable in some low order and dimensional cases. 相似文献
109.
本文研究了具有中心环域的可积多项式系统,探讨此系统在用多项式进行微扰的情况下,其所对应的Abel积分的零点个数的计算方法,给出了一个较为实用的定理,并举出了若干个应用的例子. 相似文献
110.
Let mp be the minimum of the product under the conditions that and . In our previous paper [J. Kaneko, On an extremal problem of Selberg, J. Approx. Theory 142 (2006) 129–137], we showed that the following estimates hold. provided p255. In this note, we prove that the limit of as p→∞ exists and is expressed by the (unique) solution of some simultaneous transcendental equations. By using this expression we obtain numerically. 相似文献