全文获取类型
收费全文 | 5590篇 |
免费 | 424篇 |
国内免费 | 334篇 |
专业分类
化学 | 214篇 |
晶体学 | 2篇 |
力学 | 38篇 |
综合类 | 141篇 |
数学 | 5681篇 |
物理学 | 272篇 |
出版年
2024年 | 15篇 |
2023年 | 100篇 |
2022年 | 147篇 |
2021年 | 131篇 |
2020年 | 200篇 |
2019年 | 229篇 |
2018年 | 217篇 |
2017年 | 202篇 |
2016年 | 135篇 |
2015年 | 98篇 |
2014年 | 204篇 |
2013年 | 477篇 |
2012年 | 211篇 |
2011年 | 327篇 |
2010年 | 325篇 |
2009年 | 493篇 |
2008年 | 413篇 |
2007年 | 320篇 |
2006年 | 334篇 |
2005年 | 222篇 |
2004年 | 215篇 |
2003年 | 177篇 |
2002年 | 177篇 |
2001年 | 158篇 |
2000年 | 148篇 |
1999年 | 140篇 |
1998年 | 118篇 |
1997年 | 80篇 |
1996年 | 54篇 |
1995年 | 54篇 |
1994年 | 43篇 |
1993年 | 28篇 |
1992年 | 27篇 |
1991年 | 17篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 13篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6348条查询结果,搜索用时 109 毫秒
991.
This article designs an efficient two‐class pattern classifier utilizing asynchronous cellular automata (ACAs). The two‐state three‐neighborhood one‐dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern classification. To design the classifier, (1) we first identify a set of ACAs that always converge to fixed points from any seeds, (2) each ACA should have at least two but not huge number of fixed point attractors, and (3) the convergence time of these ACAs are not to be exponential. To address the second issue, we propose a graph, coined as fixed point graph of an ACA that facilitates in counting the fixed points. We further perform an experimental study to estimate the convergence time of ACAs, and find there are some convergent ACAs which demand exponential convergence time. Finally, we identify there are 73 (out of 256) ACAs which can be effective candidates as pattern classifier. We use each of the candidate ACAs on some standard datasets, and observe the effectiveness of each ACAs as pattern classifier. It is observed that the proposed classifier is very competitive and performs reliably better than many standard existing classifier algorithms. © 2016 Wiley Periodicals, Inc. Complexity 21: 370–386, 2016 相似文献
992.
图的交叉数是图的一个重要参数,研究图的交叉数问题是拓扑图论中的前沿难题.确定图的交叉数是NP-难问题,因为其难度,能够确定交叉数的图类很少.通过圆盘画法途径,确定了一个特殊6点图与n个孤立点nK_1,路P_n及圈C_n的联图的交叉数分别是cr(Q+nK_1)=Z(6,n)+2[n/2],cr(Q+P_n)=Z(6,n)+2[n/2]+1及cr(Q+C_n)=Z(6,n)+2[n/2]+3. 相似文献
993.
主要讨论了群环Z_nG的基于理想△(G)的零因子图Γ_(△(G))(Z_nG)的性质,分别给出了Γ_(△(G))(Z_nG)的围长,平面性和直径的详细刻画.同时,给出了交换环R基于其理想I的零因子图Γ_I(R)与商环R/I的零因子图Γ(R/I)的直径的关系的一个刻画. 相似文献
994.
995.
Rundan Xing 《Linear and Multilinear Algebra》2016,64(9):1887-1898
996.
997.
998.
Iain Moffatt 《Journal of Graph Theory》2016,81(4):329-341
In this article we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus, the ribbon graph minor relation is incompatible with the graph minor relation. We discuss excluded minor characterizations of minor closed families of ribbon graphs. Our main result is an excluded minor characterization of the family of ribbon graphs that represent knot and link diagrams. 相似文献
999.
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin [7] holds for all but finitely many graphs. We also use our method to prove special cases of a conjecture of Kahn [13]. In addition, we show that our method is particularly useful for computing the number of independent sets of small sizes in general regular graphs and Moore graphs, and we argue that it can be used in many other cases when dealing with graphs that have numerous structural restrictions. 相似文献
1000.
There are numerous results bounding the circumference of certain 3‐connected graphs. There is no good bound on the size of the largest bond (cocircuit) of a 3‐connected graph, however. Oporowski, Oxley, and Thomas (J Combin Theory Ser B 57 (1993), 2, 239–257) proved the following result in 1993. For every positive integer k, there is an integer such that every 3‐connected graph with at least n vertices contains a ‐ or ‐minor. This result implies that the size of the largest bond in a 3‐connected graph grows with the order of the graph. Oporowski et al. obtained a huge function iteratively. In this article, we first improve the above authors' result and provide a significantly smaller and simpler function . We then use the result to obtain a lower bound for the largest bond of a 3‐connected graph by showing that any 3‐connected graph on n vertices has a bond of size at least . In addition, we show the following: Let G be a 3‐connected planar or cubic graph on n vertices. Then for any , G has a ‐minor with , and thus a bond of size at least . 相似文献