全文获取类型
收费全文 | 2707篇 |
免费 | 99篇 |
国内免费 | 246篇 |
专业分类
化学 | 54篇 |
力学 | 63篇 |
综合类 | 26篇 |
数学 | 2637篇 |
物理学 | 272篇 |
出版年
2024年 | 4篇 |
2023年 | 37篇 |
2022年 | 36篇 |
2021年 | 37篇 |
2020年 | 88篇 |
2019年 | 77篇 |
2018年 | 69篇 |
2017年 | 70篇 |
2016年 | 82篇 |
2015年 | 54篇 |
2014年 | 104篇 |
2013年 | 259篇 |
2012年 | 68篇 |
2011年 | 150篇 |
2010年 | 128篇 |
2009年 | 175篇 |
2008年 | 193篇 |
2007年 | 179篇 |
2006年 | 146篇 |
2005年 | 136篇 |
2004年 | 99篇 |
2003年 | 130篇 |
2002年 | 109篇 |
2001年 | 91篇 |
2000年 | 97篇 |
1999年 | 90篇 |
1998年 | 74篇 |
1997年 | 76篇 |
1996年 | 51篇 |
1995年 | 26篇 |
1994年 | 17篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 13篇 |
1988年 | 4篇 |
1987年 | 11篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1936年 | 2篇 |
排序方式: 共有3052条查询结果,搜索用时 15 毫秒
31.
Elie Leopold 《Numerical Algorithms》2007,44(4):347-366
In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of
all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials
are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given
a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations
are given. 相似文献
32.
Vince Grolmusz 《Designs, Codes and Cryptography》2006,38(3):363-372
We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible
applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear)
codes with prescribed dot-products with the help of multi-linear polynomials. 相似文献
33.
Application of graph-theoretic methods to new perimeter polynomials for connected clusters on a lattice yields extra data on the total number of clusters and for the coefficients in the series expansion for the mean size of clusters at low densities. The lattices studied are the square, the square with next nearest neighbors, the triangular, and the simple cubic. 相似文献
34.
Pankaj Mathur 《分析论及其应用》2006,22(2):105-113
In this paper, we study the explicit representation and convergence of (0, 1;0)-interpolation on infisite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values areprescribed at two set of points namely the zeros of Hn(x) and H′n (x) and the first derivatives at the zerosof H′n(x). 相似文献
35.
We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006 相似文献
36.
The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids (σ+-automata). This question is partially answered here with the proposal of a sufficient condition for the irreversibility of σ+-automata. 相似文献
37.
Our object of study is the asymptotic behavior of the sequence of polynomials orthogonal with respect to the discrete Sobolev
inner product <formula> \langle f, g \rangle = ∈t_{E} f(ξ) \overline{g(ξ)} ρ(ξ) |d ξ|+ f(Z) A g(Z)^H, </formula> where E is a rectifiable Jordan curve or arc in the complex plane
f(Z) = (f(z_1), \ldots, f^{(l_1)}(z_1) , \ldots , f(z_m) , \ldots ,f^{(l_m)}(z_m)),
A is an M \times M Hermitian matrix, M l
1
+ ⋅s + l
m
+ m , |d ξ| denotes the arc length measure, ρ is a nonnegative function on E , and z
i
∈Ω,
i=1,2,\ldots,m , where Ω is the exterior region to E .
July 23, 1999. Dates revised: September 11, 2000 and February 16, 2001. Date accepted: February 26, 2001. 相似文献
38.
1引言 2006年3月 高等学校计算数学学报 设f(x)为卜1,1}上的连续函数,则以第二类Chebyshev多项式认(x)(Un(eoso)= 烈共坐)的全部零点{ 乙工工1口 式为 其中 k x无=Cos了一下丁7r 了L十1 犷_,为插值结点组的了的Gr如wald插值多项 G。(,,x)=艺了(x、)‘孟(x), n. 11 一一 k 相似文献
39.
Josef Obermaier 《Journal of Approximation Theory》2003,125(2):303-312
Let
be compact with #S=∞ and let C(S) be the set of all real continuous functions on S. We ask for an algebraic polynomial sequence (Pn)n=0∞ with deg Pn=n such that every fC(S) has a unique representation f=∑i=0∞ αiPi and call such a basis Faber basis. In the special case of
, 0<q<1, we prove the existence of such a basis. A special orthonormal Faber basis is given by the so-called little q-Legendre polynomials. Moreover, these polynomials state an example with A(Sq)≠U(Sq)=C(Sq), where A(Sq) is the so-called Wiener algebra and U(Sq) is the set of all fC(Sq) which are uniquely represented by its Fourier series. 相似文献
40.
In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise
(standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees
of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances
of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain
how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty
term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known
or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising
and of compression. 相似文献