全文获取类型
收费全文 | 9938篇 |
免费 | 953篇 |
国内免费 | 860篇 |
专业分类
化学 | 1534篇 |
晶体学 | 46篇 |
力学 | 1128篇 |
综合类 | 241篇 |
数学 | 5791篇 |
物理学 | 3011篇 |
出版年
2024年 | 20篇 |
2023年 | 121篇 |
2022年 | 255篇 |
2021年 | 237篇 |
2020年 | 291篇 |
2019年 | 271篇 |
2018年 | 274篇 |
2017年 | 350篇 |
2016年 | 371篇 |
2015年 | 260篇 |
2014年 | 470篇 |
2013年 | 718篇 |
2012年 | 446篇 |
2011年 | 575篇 |
2010年 | 503篇 |
2009年 | 696篇 |
2008年 | 681篇 |
2007年 | 663篇 |
2006年 | 617篇 |
2005年 | 556篇 |
2004年 | 422篇 |
2003年 | 392篇 |
2002年 | 358篇 |
2001年 | 280篇 |
2000年 | 291篇 |
1999年 | 264篇 |
1998年 | 274篇 |
1997年 | 197篇 |
1996年 | 158篇 |
1995年 | 96篇 |
1994年 | 101篇 |
1993年 | 75篇 |
1992年 | 64篇 |
1991年 | 67篇 |
1990年 | 48篇 |
1989年 | 36篇 |
1988年 | 43篇 |
1987年 | 28篇 |
1986年 | 33篇 |
1985年 | 28篇 |
1984年 | 23篇 |
1983年 | 7篇 |
1982年 | 20篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 4篇 |
1974年 | 3篇 |
1972年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
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 相似文献
52.
The implementation of a nonzero-order joint transform correlator using the double port Mach-Zehnder interferometric technique is proposed and demonstrated. This approach provides on-line processing for directly removing the zero-order components of a joint power spectrum in one step and performs the nonzero-order optical correlation. Experimental results are presented and discussed. 相似文献
53.
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. 相似文献
54.
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]. 相似文献
55.
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度. 相似文献
56.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
57.
J. J. EGOZCUE J. L. DIAZ-BARRERO V. PAWLOWSKY-GLAHN 《数学学报(英文版)》2006,22(4):1175-1182
The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison's ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space. 相似文献
58.
Let E
n:y
2=x
3−n
2
x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups
associated with E
n
to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E
n.
2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90 相似文献
59.
Pearson-χ~2距离的若干性质 总被引:18,自引:0,他引:18
李开灿 《数学的实践与认识》2003,33(1):49-53
本文对数理统计中常用的 Pearson- χ2距离的分析特性进行了讨论 ,得到了这一距离的一些解析性质 ,最后我们还给出了几个常用距离的关系 . 相似文献
60.
We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel. 相似文献