全文获取类型
收费全文 | 7411篇 |
免费 | 741篇 |
国内免费 | 502篇 |
专业分类
化学 | 734篇 |
晶体学 | 11篇 |
力学 | 310篇 |
综合类 | 189篇 |
数学 | 6295篇 |
物理学 | 1115篇 |
出版年
2024年 | 15篇 |
2023年 | 126篇 |
2022年 | 177篇 |
2021年 | 191篇 |
2020年 | 252篇 |
2019年 | 291篇 |
2018年 | 276篇 |
2017年 | 292篇 |
2016年 | 224篇 |
2015年 | 163篇 |
2014年 | 295篇 |
2013年 | 607篇 |
2012年 | 353篇 |
2011年 | 417篇 |
2010年 | 395篇 |
2009年 | 589篇 |
2008年 | 541篇 |
2007年 | 412篇 |
2006年 | 456篇 |
2005年 | 323篇 |
2004年 | 294篇 |
2003年 | 270篇 |
2002年 | 253篇 |
2001年 | 233篇 |
2000年 | 199篇 |
1999年 | 182篇 |
1998年 | 161篇 |
1997年 | 123篇 |
1996年 | 73篇 |
1995年 | 82篇 |
1994年 | 71篇 |
1993年 | 50篇 |
1992年 | 43篇 |
1991年 | 28篇 |
1990年 | 23篇 |
1989年 | 25篇 |
1988年 | 26篇 |
1987年 | 19篇 |
1986年 | 11篇 |
1985年 | 20篇 |
1984年 | 17篇 |
1983年 | 5篇 |
1982年 | 15篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1979年 | 3篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 5篇 |
1974年 | 3篇 |
排序方式: 共有8654条查询结果,搜索用时 15 毫秒
41.
42.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献
43.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the
Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead
and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献
44.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
45.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
46.
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). 相似文献
47.
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. 相似文献
48.
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. 相似文献
49.
50.