全文获取类型
收费全文 | 14774篇 |
免费 | 1373篇 |
国内免费 | 1208篇 |
专业分类
化学 | 3822篇 |
晶体学 | 45篇 |
力学 | 938篇 |
综合类 | 296篇 |
数学 | 9728篇 |
物理学 | 2526篇 |
出版年
2024年 | 36篇 |
2023年 | 174篇 |
2022年 | 329篇 |
2021年 | 328篇 |
2020年 | 448篇 |
2019年 | 482篇 |
2018年 | 460篇 |
2017年 | 510篇 |
2016年 | 409篇 |
2015年 | 386篇 |
2014年 | 603篇 |
2013年 | 1117篇 |
2012年 | 593篇 |
2011年 | 779篇 |
2010年 | 724篇 |
2009年 | 981篇 |
2008年 | 995篇 |
2007年 | 895篇 |
2006年 | 859篇 |
2005年 | 704篇 |
2004年 | 572篇 |
2003年 | 583篇 |
2002年 | 639篇 |
2001年 | 479篇 |
2000年 | 437篇 |
1999年 | 406篇 |
1998年 | 413篇 |
1997年 | 301篇 |
1996年 | 260篇 |
1995年 | 227篇 |
1994年 | 182篇 |
1993年 | 157篇 |
1992年 | 130篇 |
1991年 | 104篇 |
1990年 | 73篇 |
1989年 | 63篇 |
1988年 | 66篇 |
1987年 | 55篇 |
1986年 | 49篇 |
1985年 | 56篇 |
1984年 | 47篇 |
1983年 | 24篇 |
1982年 | 48篇 |
1981年 | 47篇 |
1980年 | 27篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1973年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
The phase behavior of binary blends of poly(ether ether ketone) (PEEK), sulfonated PEEK, and sulfamidated PEEK with aromatic polyimides is reported. PEEK was determined to be immiscible with a poly(amide imide) (TORLON 4000T). Blends of sulfonated and sulfamidated PEEK with this poly(amide imide), however, are reported here to be miscible in all proportions. Blends of sulfonated PEEK and a poly(ether imide) (ULTEM 1000) are also reported to be miscible. Spectroscopic investigations of the intermolecular interactions suggest that formation of electron donoracceptor complexes between the sulfonated/sulfamidated phenylene rings of the PEEKs and the n-phenylene units of the polyimides are responsible for this miscibility. © 1993 John Wiley & Sons, Inc. 相似文献
72.
A. B. Vasil’eva A. A. Plotnikov 《Computational Mathematics and Mathematical Physics》2006,46(5):762-767
A singularly perturbed parabolic equation with a nonlinear right-hand side of a special form is examined. A numerical analytical study of such equations is performed. 相似文献
73.
For given a graph H, a graphic sequence π = (d
1, d
2,..., d
n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K
5 − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to
be potentially K
5-graphic, where K
r is a complete graph on r vertices and K
r-e is a graph obtained from K
r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence
π to be potentially K
6-graphic.
Project supported by National Natural Science Foundation of China (No. 10401010). 相似文献
74.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
75.
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. 相似文献
76.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献
77.
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. 相似文献
78.
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. 相似文献
79.
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]. 相似文献
80.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献