全文获取类型
收费全文 | 2798篇 |
免费 | 1014篇 |
国内免费 | 384篇 |
专业分类
化学 | 629篇 |
晶体学 | 6篇 |
力学 | 173篇 |
综合类 | 244篇 |
数学 | 1227篇 |
物理学 | 1917篇 |
出版年
2024年 | 36篇 |
2023年 | 129篇 |
2022年 | 132篇 |
2021年 | 146篇 |
2020年 | 94篇 |
2019年 | 117篇 |
2018年 | 57篇 |
2017年 | 137篇 |
2016年 | 154篇 |
2015年 | 201篇 |
2014年 | 338篇 |
2013年 | 222篇 |
2012年 | 206篇 |
2011年 | 224篇 |
2010年 | 215篇 |
2009年 | 217篇 |
2008年 | 223篇 |
2007年 | 173篇 |
2006年 | 173篇 |
2005年 | 140篇 |
2004年 | 116篇 |
2003年 | 114篇 |
2002年 | 98篇 |
2001年 | 90篇 |
2000年 | 60篇 |
1999年 | 63篇 |
1998年 | 45篇 |
1997年 | 50篇 |
1996年 | 51篇 |
1995年 | 39篇 |
1994年 | 40篇 |
1993年 | 18篇 |
1992年 | 17篇 |
1991年 | 14篇 |
1990年 | 15篇 |
1989年 | 21篇 |
1988年 | 11篇 |
排序方式: 共有4196条查询结果,搜索用时 15 毫秒
31.
网络中一类最短支撑树的计算方法 总被引:2,自引:1,他引:1
翟晓燕 《数学的实践与认识》1997,(3)
本文在无向赋权图求最短路的Dijkstra算法的基础上,提出了在有向网络图中寻找具有一个枢纽点且与其它各点均有定向联系的最短支撑树的算法,同时还给出了应用该算法的一个计算实例。 相似文献
32.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
33.
We investigate a spatial Prisoner's Dilemma game with nonlinear attractive effect on regular small-world networks. The players located on the sites of networks can either cooperate with their neighbours or defect. In every generation, each player updates its strategy by firstly choosing one of the neighbours with a probability proportional to .A^α denoting the attractiveness of the neighbour, where .4 is the collected payoff and ^α (-〉0) is a free parameter characterizing the extent of nonlinear effect. Then each player adopts its strategy with a probability dependent on their payoff difference. Using Monte Carlo simulations, we investigate the density pc of cooperators in the stationary state for various values of α and the rewiring probability q of the network. It is shown that the introduction of such attractive effect remarkably promotes the emergence and persistence of cooperation over a wide range of the temptation to defect for the same network structures. We also point out that long-range connections either enhance or inhibit the cooperation, which depends on the value of α and the payoff parameter b. 相似文献
34.
35.
在研究排队网络的文献中,G-网络(即推广的排队网络)最近受到了国际学者广泛的关注,它的研究在一定程度上丰富了排队网络的内容.正因为有很多学者投入到此项研究中,新的结果是层出不穷的.本文简短地介绍G-网络近年来的发展. 相似文献
36.
《武汉大学学报(理学版)》2006,52(1):F0002
武汉大学期刊社成立于2000年10月,下设办公室、5个编辑部以及出版发行部、网络信息部共8个部门,编辑出版6种中文核心期刊学报、2种英文学报及2种科技杂志。 相似文献
37.
Excitation Properties of the Biological Neurons with Side-Inhibition Mechanism in Small-World Networks 总被引:3,自引:0,他引:3
下载免费PDF全文
![点击此处可从《中国物理快报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We have studied the excitation properties of biophysical Hodgkin-Huxley neurons with the side-inhibition mechanism in small-world networks. The result shows that the excitation properties in the networks are preferably consistent with the characteristic properties of a brain neural system under external constant stimuli, such as fatigue effect, extreme excitation principle, and the brain neural excitation response induced by different in- tensity of noise and coupling. The results of the study might shed some light on the study of the brain nerve electrophysiology and epistemological science. 相似文献
38.
双环网络是计算机互连网络和通讯系统的一类重要拓扑结构.1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族.2003年,徐俊明等人给出一个4紧优双环网络的无限族.本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法. 相似文献
39.
Topological Properties of Urban Public Traffic Networks in Chinese Top-Ten Biggest Cities 总被引:2,自引:0,他引:2
下载免费PDF全文
![点击此处可从《中国物理快报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
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. 相似文献
40.
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. 相似文献