全文获取类型
收费全文 | 6947篇 |
免费 | 586篇 |
国内免费 | 629篇 |
专业分类
化学 | 809篇 |
晶体学 | 15篇 |
力学 | 1259篇 |
综合类 | 105篇 |
数学 | 4538篇 |
物理学 | 1436篇 |
出版年
2024年 | 15篇 |
2023年 | 92篇 |
2022年 | 171篇 |
2021年 | 143篇 |
2020年 | 225篇 |
2019年 | 214篇 |
2018年 | 189篇 |
2017年 | 229篇 |
2016年 | 226篇 |
2015年 | 179篇 |
2014年 | 282篇 |
2013年 | 516篇 |
2012年 | 330篇 |
2011年 | 448篇 |
2010年 | 370篇 |
2009年 | 530篇 |
2008年 | 484篇 |
2007年 | 455篇 |
2006年 | 407篇 |
2005年 | 366篇 |
2004年 | 279篇 |
2003年 | 277篇 |
2002年 | 237篇 |
2001年 | 192篇 |
2000年 | 201篇 |
1999年 | 174篇 |
1998年 | 192篇 |
1997年 | 154篇 |
1996年 | 112篇 |
1995年 | 62篇 |
1994年 | 58篇 |
1993年 | 48篇 |
1992年 | 55篇 |
1991年 | 36篇 |
1990年 | 26篇 |
1989年 | 22篇 |
1988年 | 24篇 |
1987年 | 19篇 |
1986年 | 18篇 |
1985年 | 13篇 |
1984年 | 19篇 |
1983年 | 7篇 |
1982年 | 10篇 |
1981年 | 12篇 |
1980年 | 9篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1972年 | 3篇 |
排序方式: 共有8162条查询结果,搜索用时 0 毫秒
51.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
52.
双环网络是计算机互连网络和通讯系统的一类重要拓扑结构.1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族.2003年,徐俊明等人给出一个4紧优双环网络的无限族.本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法. 相似文献
53.
S. S. Batsanov 《Russian Chemical Bulletin》1994,43(2):199-201
Experimental data are used to determine the atomic volumes and radii of the elements of subgroups IV–VIIA in the structures of metallic phases at high pressures. Metallic radii of nonmetals are compared with values based on Pauling and Goldschmidt calculations.Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 220–222, February, 1994. 相似文献
54.
本利用矩阵给出了几类数列的通项公式的求法,把数列通项公式的求法转化为矩阵幂的计算,思路简单、计算简便,并能判别其敛散性。 相似文献
55.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
56.
TorstenLinB 《计算数学(英文版)》2003,21(4):401-410
We consider a singularly perturbed semilinear convection-diffusion problem with a boundary layer of attractive turning-point type. It is shown that its solution can be decomposed into a regular solution component and a layer component. This decomposi-tion is used to analyse the convergence of an upwinded finite difference scheme on Shishkin meshes. 相似文献
57.
We study a model linear convection-diffusion-reaction problem where both the diffusion term and the convection term are multiplied by small parameters εd and εc, respectively. Depending on the size of the parameters the solution of the problem may exhibit exponential layers at both end points of the domain. Sharp bounds for the derivatives of the solution are derived using a barrier-function technique. These bounds are applied in the analysis of a simple upwind-difference scheme on Shishkin meshes. This method is established to be almost first-order convergent, independently of the parameters εd and εc. 相似文献
58.
The paper deals with a singularly perturbed reaction diffusionmodel problem. The focus is on reliable a posteriori error estimatorsfor the H1 seminorm that can be applied to anisotropic finiteelement meshes. A residual error estimator and a local problemerror estimator are proposed and rigorously analysed. They arelocally equivalent, and both bound the error reliably. Threemodifications of these estimators are introduced and discussed. Much attention is given to the performance of the error estimatorin numerical experiments. This helps to identify those estimatorsthat are suitable for practical applications. 相似文献
59.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
60.