全文获取类型
收费全文 | 7261篇 |
免费 | 894篇 |
国内免费 | 305篇 |
专业分类
化学 | 2237篇 |
晶体学 | 22篇 |
力学 | 465篇 |
综合类 | 143篇 |
数学 | 2624篇 |
物理学 | 2969篇 |
出版年
2024年 | 27篇 |
2023年 | 108篇 |
2022年 | 366篇 |
2021年 | 349篇 |
2020年 | 182篇 |
2019年 | 163篇 |
2018年 | 154篇 |
2017年 | 225篇 |
2016年 | 271篇 |
2015年 | 194篇 |
2014年 | 374篇 |
2013年 | 578篇 |
2012年 | 421篇 |
2011年 | 403篇 |
2010年 | 433篇 |
2009年 | 487篇 |
2008年 | 480篇 |
2007年 | 524篇 |
2006年 | 355篇 |
2005年 | 303篇 |
2004年 | 260篇 |
2003年 | 273篇 |
2002年 | 194篇 |
2001年 | 165篇 |
2000年 | 151篇 |
1999年 | 138篇 |
1998年 | 134篇 |
1997年 | 133篇 |
1996年 | 125篇 |
1995年 | 89篇 |
1994年 | 75篇 |
1993年 | 74篇 |
1992年 | 52篇 |
1991年 | 39篇 |
1990年 | 25篇 |
1989年 | 21篇 |
1988年 | 25篇 |
1987年 | 16篇 |
1986年 | 13篇 |
1985年 | 21篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有8460条查询结果,搜索用时 15 毫秒
991.
The duplication–divergence mechanism of network growth has been widely investigated, especially in gene and protein networks. Both the duplication and divergence have a key role in biological network evolution. However, the relative roles of these mechanisms in the influence of disassortative property in protein interaction networks remain to be clarified. It has been shown that duplication can indeed make protein networks evolve towards disassortative networks. To make the relationship between the disassortative property and the duplication–divergence mechanism more clear, we further discuss how the divergence mechanism influences the disassortative property. We tested four different divergence mechanisms, i.e., node deletion, edge deletion, edge addition, and edge rewiring to study their effects on disassortative property. Our study highlights the crucial roles of different divergence evolution mechanisms. 相似文献
992.
With the help of the recurrence relations derived from the self-similar structure, we obtain the closed-form solution for the average path length of a class of scale-free fractal hierarchical lattices (HLs) with a general parameter q, which are simultaneously scale-free, self-similar and disassortative. Our rigorous solution shows that the average path length of the HLs grows logarithmically as in the infinite limit of network size of Nt and that they are not small worlds but grow with a power-law relationship to the number of nodes. 相似文献
993.
We study how initial network structure affects the evolution of cooperation in a spatial prisoner’s dilemma game. The network structure is characterized by various statistical properties. Among those properties, we focus on the variance of the degree distribution, and inquire how it affects the evolution of cooperation by three methods of imitation. For every method, it was found that a scale-free network does not always promote the evolution of cooperation, and that there exists an appropriate value of the variance, at which cooperation is optimal. 相似文献
994.
In most previous studies of public goods game, individuals conventionally donate their contributions equally to the games they participate in. We develop an extended public goods game model, in which individuals distribute their contributions based on the groups’ qualities. Namely, the individuals are allowed to increase their investment to the superior groups at the expense of the nasty ones. The quality of a group is positively correlated with its cooperation level. In numerical simulations, synchronized stochastic strategy updating rule based on pairwise comparison for a fixed noise level is adopted. The results show that the high-quality group preference mechanism can greatly improve cooperation, compared with conventional models. Besides, the system with stronger preference toward high-quality groups performs better. Investigation of wealth distribution at equilibrium reveals that cooperators’ wealth appreciates with the increase of preference degree when cooperators take up the same fraction of the population. 相似文献
995.
In this paper, we study the cascading failure in Watts-Strogatz small-world networks. We find that this network model has a heterogeneous betweenness distribution, although its degree distribution is homogeneous. Further study shows that this small-world network is robust to random attack but fragile to intentional attack, in the cascading failure scenario. With comparison to standard random graph and scale-free networks, our result indicates that the robust yet fragile property in the cascading failure scenario is mainly related to heterogeneous betweenness, rather than the network degree distribution. Thus, it suggests that we have to be very careful when we use terms such as homogeneous network and heterogeneous network, unless the distribution we refer to is specified. 相似文献
996.
Yi-Kuei Lin 《Physica A》2010,389(6):1253-1258
This paper constructs a revised stochastic flow network to model a realistic computer network in which each arc has a lead time and a stochastic capacity. The minimum time to send a specified amount of data through the network is thus uncertain. Hence, this paper mainly proposes an approach for evaluating the system reliability that d units of data can be transmitted through k minimal paths simultaneously within the time threshold T. The idea of lower boundary points for (d,T), the minimal system states satisfying the demand d within the time threshold T, is proposed firstly. All system states meeting the time and demand requirements can be represented as the union of subsets generated from all lower boundary points for (d,T), and thus the system reliability is computed quickly. 相似文献
997.
We study synchronization transitions and pattern formation on small-world networks consisting of Morris-Lecar excitable neurons in dependence on the information transmission delay and the rewiring probability. In addition, networks formed via gap junctional connections and coupling via chemical synapses are considered separately. For gap-junctionally coupled networks we show that short delays can induce zigzag fronts of excitations, whereas long delays can further detriment synchronization due to a dynamic clustering anti-phase synchronization transition. For the synaptically coupled networks, on the other hand, we find that the clustering anti-phase synchronization can appear as a direct consequence of the prolongation of information transmission delay, without being accompanied by zigzag excitatory fronts. Irrespective of the coupling type, however, we show that an appropriate small-world topology can always restore synchronized activity if only the information transmission delays are short or moderate at most. Long information transmission delays always evoke anti-phase synchronization and clustering, in which case the fine-tuning of the network topology fails to restore the synchronization of neuronal activity. 相似文献
998.
We study the dynamics of the structure of a formal neural network wherein the strengths of the synapses are governed by spike-timing-dependent plasticity (STDP). For properly chosen input signals, there exists a steady state with a residual network. We compare the motif profile of such a network with that of a real neural network of C. elegans and identify robust qualitative similarities. In particular, our extensive numerical simulations show that this STDP-driven resulting network is robust under variations of the model parameters. 相似文献
999.
In the compromise model of continuous opinions proposed by Deffuant et al., the states of two agents in a network can start to converge if they are neighbors and if their opinions are sufficiently close to each other, below a given threshold of tolerance ?. In directed networks, if agent i is a neighbor of agent j,j need not be a neighbor of i. In Watts-Strogatz networks we performed simulations to find the averaged number of final opinions 〈F〉 and their distribution as a function of ? and of the network structural disorder. In directed networks 〈F〉 exhibits a rich structure, being larger than in undirected networks for higher values of ?, and smaller for lower values of ?. 相似文献
1000.
Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties. 相似文献