全文获取类型
收费全文 | 34045篇 |
免费 | 2454篇 |
国内免费 | 2474篇 |
专业分类
化学 | 4181篇 |
晶体学 | 59篇 |
力学 | 2283篇 |
综合类 | 286篇 |
数学 | 10840篇 |
物理学 | 4513篇 |
综合类 | 16811篇 |
出版年
2024年 | 72篇 |
2023年 | 291篇 |
2022年 | 469篇 |
2021年 | 531篇 |
2020年 | 692篇 |
2019年 | 657篇 |
2018年 | 642篇 |
2017年 | 786篇 |
2016年 | 802篇 |
2015年 | 872篇 |
2014年 | 1415篇 |
2013年 | 2038篇 |
2012年 | 1688篇 |
2011年 | 1861篇 |
2010年 | 1620篇 |
2009年 | 2039篇 |
2008年 | 2081篇 |
2007年 | 2449篇 |
2006年 | 2156篇 |
2005年 | 1919篇 |
2004年 | 1641篇 |
2003年 | 1550篇 |
2002年 | 1479篇 |
2001年 | 1166篇 |
2000年 | 1076篇 |
1999年 | 988篇 |
1998年 | 883篇 |
1997年 | 721篇 |
1996年 | 672篇 |
1995年 | 552篇 |
1994年 | 505篇 |
1993年 | 429篇 |
1992年 | 397篇 |
1991年 | 358篇 |
1990年 | 260篇 |
1989年 | 250篇 |
1988年 | 183篇 |
1987年 | 182篇 |
1986年 | 112篇 |
1985年 | 92篇 |
1984年 | 70篇 |
1983年 | 36篇 |
1982年 | 58篇 |
1981年 | 63篇 |
1980年 | 33篇 |
1979年 | 40篇 |
1978年 | 35篇 |
1977年 | 11篇 |
1976年 | 14篇 |
1973年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 796 毫秒
111.
Liang-gen Hu 《应用数学学报(英文版)》2007,23(2):281-288
In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic. 相似文献
112.
In this note, we study convergence rates in the law of large numbers for independent and identically distributed random variables under sublinear expectations. We obtain a strong L^p-convergence version and a strongly quasi sure convergence version of the law of large numbers. 相似文献
113.
Onofrio Mario Di Vincenzo Plamen Koshlukov Roberto La Scala 《Advances in Applied Mathematics》2006,37(4):541
In this paper we describe completely the involutions of the first kind of the algebra UTn(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UTn(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT2(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT3(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UTn(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities. 相似文献
114.
Chen Hao 《中国科学A辑(英文版)》2006,49(5):715-720
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p
m) (any positive integer m) with the period 3n (n and p
m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura
algorithm, we can determine the linear complexity of any sequence over GF(p
m) with the period 3n (n and p
m
− 1 are coprime) more efficiently. 相似文献
115.
吴继龙 《芜湖职业技术学院学报》2002,4(4):16-17
小型建筑施工企业建立科学合理的机械设备维修保养制度,是保证工程质量和提高企业经济效益的重要环节。 相似文献
116.
Matthias Kriesell 《Graphs and Combinatorics》2002,18(1):133-146
Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set.
Received: April 14, 2000 Final version received: May 8, 2001 相似文献
117.
We present integral-type Darboux transformation for the mKdV hierarchy and for the mKdV hierarchy withself-consistent sources. In contrast with the normal Darboux transformation, the integral-type Darboux transformationscan offer non-auto-Backlund transformation between two (2n 1)-th mKdV equations with self-consistent sources withdifferent degrees. This kind of Darboux transformation enables us to construct the N-soliton solution for the mKdVhierarchy with self-consistent sources. We also propose the formulas for the m times repeated integral-type Darbouxtransformations for both mKdV hierarchy and mKdV hierarchy with self-consistent sources. 相似文献
118.
This paper proposes the Rice condition numbers for invariant subspace, singular sub-spaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators. 相似文献
119.
External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some
earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of
EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference
sets is set up. 相似文献
120.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献