全文获取类型
收费全文 | 2311篇 |
免费 | 141篇 |
国内免费 | 98篇 |
专业分类
化学 | 93篇 |
晶体学 | 1篇 |
力学 | 8篇 |
综合类 | 15篇 |
数学 | 2159篇 |
物理学 | 66篇 |
无线电 | 208篇 |
出版年
2023年 | 53篇 |
2022年 | 58篇 |
2021年 | 44篇 |
2020年 | 93篇 |
2019年 | 91篇 |
2018年 | 66篇 |
2017年 | 66篇 |
2016年 | 43篇 |
2015年 | 51篇 |
2014年 | 99篇 |
2013年 | 194篇 |
2012年 | 100篇 |
2011年 | 179篇 |
2010年 | 147篇 |
2009年 | 241篇 |
2008年 | 197篇 |
2007年 | 115篇 |
2006年 | 136篇 |
2005年 | 68篇 |
2004年 | 68篇 |
2003年 | 62篇 |
2002年 | 55篇 |
2001年 | 41篇 |
2000年 | 40篇 |
1999年 | 34篇 |
1998年 | 34篇 |
1997年 | 24篇 |
1996年 | 20篇 |
1995年 | 19篇 |
1994年 | 13篇 |
1993年 | 10篇 |
1992年 | 11篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有2550条查询结果,搜索用时 27 毫秒
1.
We describe a unified approach for studying book, point-set, and simultaneous embeddability problems of upward planar digraphs. The approach is based on a linear time strategy to compute an upward planar drawing of an upward planar digraph such that all vertices are collinear. Besides having impact in relevant application domains of graph drawing and computational geometry, the presented results open new research directions in the area of upward planarity with constraints of the positions of the vertices. 相似文献
2.
3.
4.
5.
6.
7.
A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination. 相似文献
8.
Christian Bosse 《Discrete Mathematics》2019,342(12):111595
The Hadwiger number of a graph , denoted , is the largest integer such that contains as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph , , where denotes the chromatic number of . Let denote the independence number of . A graph is -free if it does not contain the graph as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that for all -free graphs with , where is any graph on four vertices with , , or is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs on five vertices with . In this note, we prove that for all -free graphs with , where denotes the wheel on six vertices. 相似文献
9.
10.