全文获取类型
收费全文 | 3343篇 |
免费 | 1212篇 |
国内免费 | 483篇 |
专业分类
化学 | 718篇 |
晶体学 | 7篇 |
力学 | 226篇 |
综合类 | 263篇 |
数学 | 1496篇 |
物理学 | 2328篇 |
出版年
2024年 | 39篇 |
2023年 | 170篇 |
2022年 | 157篇 |
2021年 | 180篇 |
2020年 | 123篇 |
2019年 | 140篇 |
2018年 | 68篇 |
2017年 | 162篇 |
2016年 | 175篇 |
2015年 | 229篇 |
2014年 | 397篇 |
2013年 | 250篇 |
2012年 | 232篇 |
2011年 | 264篇 |
2010年 | 258篇 |
2009年 | 249篇 |
2008年 | 279篇 |
2007年 | 211篇 |
2006年 | 210篇 |
2005年 | 179篇 |
2004年 | 163篇 |
2003年 | 142篇 |
2002年 | 119篇 |
2001年 | 101篇 |
2000年 | 82篇 |
1999年 | 73篇 |
1998年 | 53篇 |
1997年 | 62篇 |
1996年 | 59篇 |
1995年 | 49篇 |
1994年 | 43篇 |
1993年 | 22篇 |
1992年 | 22篇 |
1991年 | 20篇 |
1990年 | 17篇 |
1989年 | 22篇 |
1988年 | 13篇 |
1987年 | 3篇 |
1986年 | 1篇 |
排序方式: 共有5038条查询结果,搜索用时 15 毫秒
51.
双环网络是计算机互连网络和通讯系统的一类重要拓扑结构.1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族.2003年,徐俊明等人给出一个4紧优双环网络的无限族.本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法. 相似文献
52.
Topological Properties of Urban Public Traffic Networks in Chinese Top-Ten Biggest Cities 总被引:2,自引:0,他引:2 下载免费PDF全文
We investigate the topological characteristics of complex networks as exemplified by the urban public traffic network (UPTN) in Chinese top-ten biggest cities. It is found that the UPTNs have small world behaviour, by the examination of their topological parameters. The quantitative analysis of the transport efficiency of the UPTNs reveals their higher local efficiency El and lower global efficiency Eg, which coincide well with the status quo of those Chinese cities still at their developing stage. Furthermore, the topological properties of efficiency in the UPTNs are also examined, and the findings indicate that, on the one hand, the UPTNs show robustness to random attacks and frangibility to malicious attacks on a global scale; on the other hand, the interrelation between UPTN efficiency and network motifs deserves our attention. The motifs which interrelate the UPTN efficiency are always triangular-formed patterns, e.g. motifs ID 238, ID 174 and ID 102, etc. 相似文献
53.
We propose an irreversible binary coagulation model with a constant-reaction-number kernel, in which, among all the possible binary coagulation reactions, only p reactions are permitted to take place at every time. By means of the generalized rate equation we investigate the kinetic behaviour of the system with the reaction rate kernel K(i;j) = (ij)^w (0 ≤w〈1/2), at which an i-mer and a j-mer coagulate together to form a large one. It is found that for such a system there always exists a gelation transition at a finte time to, which is in contrast to the ordinary binary coagulation with the same rate kernel. Moreover, the pre-gelation behaviour of the cluster size distribution near the gelation point falls in a scaling regime and the typical cluster size grows as (to - t)-1/(1-2w). On the other hand, our model can also provide some predictions for the evolution of the cluster distribution in multicomponent complex networks. 相似文献
54.
55.
In this paper, we study the existence, uniqueness, and the global exponential stability of the periodic solution and equilibrium of hybrid bidirectional associative memory neural networks with discrete delays. By ingeniously importing real parameters di > 0 (i = 1,2, …, n) which can be adjusted, making use of the Lyapunov functional method and some analysis techniques, some new sufficient conditions are established. Our results generalize and improve the related results in [9]. These conditions can be used both to design globally exponentially stable and periodical oscillatory hybrid bidirectional associative neural networks with discrete delays, and to enlarge the area of designing neural networks. Our work has important significance in related theory and its application. 相似文献
56.
本在无向网络中,建立了带有边集限制的最均匀支撑树问题的网络模型.中首先解决最均匀支撑树问题,并给出求无向网络中最均匀支撑树的多项式时间算法;然后,给出了求无向网络中带有边集限制的最小树多项式时间算法;最后,在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题. 相似文献
57.
58.
李林 《Annals of Differential Equations》2004,20(2):118-124
This paper considers the scalar differential delay equation x(t) = -μx(t)-f(x(t-Τ(t)), t). By using the mapping method we obtain that the solutionswill be ultimately in some interval. 相似文献
59.
60.