全文获取类型
收费全文 | 2005篇 |
免费 | 37篇 |
国内免费 | 107篇 |
专业分类
化学 | 89篇 |
晶体学 | 2篇 |
力学 | 23篇 |
综合类 | 17篇 |
数学 | 1947篇 |
物理学 | 71篇 |
出版年
2023年 | 35篇 |
2022年 | 32篇 |
2021年 | 29篇 |
2020年 | 41篇 |
2019年 | 77篇 |
2018年 | 44篇 |
2017年 | 35篇 |
2016年 | 23篇 |
2015年 | 33篇 |
2014年 | 56篇 |
2013年 | 157篇 |
2012年 | 65篇 |
2011年 | 125篇 |
2010年 | 113篇 |
2009年 | 186篇 |
2008年 | 168篇 |
2007年 | 118篇 |
2006年 | 111篇 |
2005年 | 58篇 |
2004年 | 61篇 |
2003年 | 63篇 |
2002年 | 55篇 |
2001年 | 62篇 |
2000年 | 53篇 |
1999年 | 36篇 |
1998年 | 42篇 |
1997年 | 38篇 |
1996年 | 33篇 |
1995年 | 26篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 17篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 3篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 14篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1974年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有2149条查询结果,搜索用时 15 毫秒
51.
For every , we present a set of points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of . This is the first subquadratic upper bound on the cardinality of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs. 相似文献
52.
Let G=(V,E) be a graph.A set S■V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S.The restrained domination number of G,denoted γr(G),is the smallest cardinality of a restrained dominating set of G.In this paper,we show that if G is a graph of order n≥4,then γr(G)γr(G)≤2n.We also characterize the graphs achieving the upper bound. 相似文献
54.
With the rapid development of DNA microarray technology and next-generation technology, a large number of genomic data were generated. So how to extract more differentially expressed genes from genomic data has become a matter of urgency. Because Low-Rank Representation (LRR) has the high performance in studying low-dimensional subspace structures, it has attracted a chunk of attention in recent years. However, it does not take into consideration the intrinsic geometric structures in data.In this paper, a new method named Laplacian regularized Low-Rank Representation (LLRR) has been proposed and applied on genomic data, which introduces graph regularization into LRR. By taking full advantages of the graph regularization, LLRR method can capture the intrinsic non-linear geometric information among the data. The LLRR method can decomposes the observation matrix of genomic data into a low rank matrix and a sparse matrix through solving an optimization problem. Because the significant genes can be considered as sparse signals, the differentially expressed genes are viewed as the sparse perturbation signals. Therefore, the differentially expressed genes can be selected according to the sparse matrix. Finally, we use the GO tool to analyze the selected genes and compare the P-values with other methods.The results on the simulation data and two real genomic data illustrate that this method outperforms some other methods: in differentially expressed gene selection. 相似文献
55.
56.
Consistency of regularized spectral clustering 总被引:1,自引:0,他引:1
Clustering is a widely used technique in machine learning, however, relatively little research in consistency of clustering algorithms has been done so far. In this paper we investigate the consistency of the regularized spectral clustering algorithm, which has been proposed recently. It provides a natural out-of-sample extension for spectral clustering. The presence of the regularization term makes our situation different from that in previous work. Our approach is mainly an elaborate analysis of a functional named the clustering objective. Moreover, we establish a convergence rate. The rate depends on the approximation property and the capacity of the reproducing kernel Hilbert space measured by covering numbers. Some new methods are exploited for the analysis since the underlying setting is much more complicated than usual. Some new methods are exploited for the analysis since the underlying setting is much more complicated than usual. 相似文献
57.
58.
We examine factorizations of complete graphs K2n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K2n. 相似文献
59.
In this note, we investigate some properties of local Kneser graphs defined in [János Körner, Concetta Pilotto, Gábor Simonyi, Local chromatic number and sperner capacity, J. Combin. Theory Ser. B 95 (1) (2005) 101-117]. In this regard, as a generalization of the Erdös-Ko-Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next, we provide an upper bound for their chromatic number. 相似文献
60.
《Discrete Mathematics》2022,345(1):112659
In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular F-saturated graphs. One of the essential questions is given F, for which n does a regular n-vertex F-saturated graph exist. They proved that for all sufficiently large n, there is a regular -saturated graph with n vertices. We extend this result to both and and prove some partial results for larger complete graphs. Using a variation of sum-free sets from additive combinatorics, we prove that for all , there is a regular -saturated with n vertices for infinitely many n. Studying the sum-free sets that give rise to -saturated graphs is an interesting problem on its own and we state an open problem in this direction. 相似文献