全文获取类型
收费全文 | 5875篇 |
免费 | 726篇 |
国内免费 | 329篇 |
专业分类
化学 | 497篇 |
晶体学 | 6篇 |
力学 | 559篇 |
综合类 | 154篇 |
数学 | 3625篇 |
物理学 | 2089篇 |
出版年
2024年 | 18篇 |
2023年 | 43篇 |
2022年 | 90篇 |
2021年 | 131篇 |
2020年 | 176篇 |
2019年 | 161篇 |
2018年 | 135篇 |
2017年 | 172篇 |
2016年 | 185篇 |
2015年 | 147篇 |
2014年 | 214篇 |
2013年 | 411篇 |
2012年 | 246篇 |
2011年 | 267篇 |
2010年 | 221篇 |
2009年 | 269篇 |
2008年 | 333篇 |
2007年 | 340篇 |
2006年 | 317篇 |
2005年 | 257篇 |
2004年 | 243篇 |
2003年 | 267篇 |
2002年 | 276篇 |
2001年 | 244篇 |
2000年 | 253篇 |
1999年 | 195篇 |
1998年 | 176篇 |
1997年 | 128篇 |
1996年 | 118篇 |
1995年 | 76篇 |
1994年 | 93篇 |
1993年 | 68篇 |
1992年 | 73篇 |
1991年 | 77篇 |
1990年 | 59篇 |
1989年 | 50篇 |
1988年 | 55篇 |
1987年 | 44篇 |
1986年 | 28篇 |
1985年 | 37篇 |
1984年 | 57篇 |
1983年 | 25篇 |
1982年 | 25篇 |
1981年 | 30篇 |
1980年 | 14篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 13篇 |
1976年 | 14篇 |
1973年 | 6篇 |
排序方式: 共有6930条查询结果,搜索用时 31 毫秒
991.
992.
993.
994.
Maurício Collares Yoshiharu Kohayakawa Robert Morris Guilherme O. Mota 《Random Structures and Algorithms》2020,56(4):1016-1030
We count orientations of avoiding certain classes of oriented graphs. In particular, we study , the number of orientations of the binomial random graph in which every copy of is transitive, and , the number of orientations of containing no strongly connected copy of . We give the correct order of growth of and up to polylogarithmic factors; for orientations with no cyclic triangle, this significantly improves a result of Allen, Kohayakawa, Mota, and Parente. We also discuss the problem for a single forbidden oriented graph, and state a number of open problems and conjectures. 相似文献
995.
We study a model of random graph where vertices are n i.i.d. uniform random points on the unit sphere Sd in , and a pair of vertices is connected if the Euclidean distance between them is at least 2??. We are interested in the chromatic number of this graph as n tends to infinity. It is not too hard to see that if ?>0 is small and fixed, then the chromatic number is d+2 with high probability. We show that this holds even if ?→0 slowly enough. We quantify the rate at which ? can tend to zero and still have the same chromatic number. The proof depends on combining topological methods (namely the Lyusternik–Schnirelman–Borsuk theorem) with geometric probability arguments. The rate we obtain is best possible, up to a constant factor—if ?→0 faster than this, we show that the graph is (d+1)‐colorable with high probability.25 相似文献
996.
We consider the random‐cluster model (RCM) on with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enough p (depending on the dimension) and any q>1, the FK‐dynamics exhibits the cutoff phenomenon at with a window size , where λ∞ is the large n limit of the spectral gap of the process. Our proof extends the information percolation framework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharp mixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates. 相似文献
997.
Neng-Yi Wang Guosheng Yin 《Stochastics An International Journal of Probability and Stochastic Processes》2020,92(2):265-274
ABSTRACTThis paper establishes explicit estimates of convergence rates for the blocked Gibbs sampler with random scan under the Dobrushin conditions. The estimates of convergence in the Wasserstein metric are obtained by taking purely analytic approaches. 相似文献
998.
《Physics letters. A》2019,383(17):2028-2032
We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible. 相似文献
999.
Mihyun Kang Michael Moßhammer Philipp Sprüssel 《Random Structures and Algorithms》2020,56(4):1117-1170
Let be the orientable surface of genus and denote by the class of all graphs on vertex set with edges embeddable on . We prove that the component structure of a graph chosen uniformly at random from features two phase transitions. The first phase transition mirrors the classical phase transition in the Erd?s‐Rényi random graph chosen uniformly at random from all graphs with vertex set and edges. It takes place at , when the giant component emerges. The second phase transition occurs at , when the giant component covers almost all vertices of the graph. This kind of phenomenon is strikingly different from and has only been observed for graphs on surfaces. 相似文献
1000.
BackgroundIdentification of potential drug-target interaction pairs is very important for pharmaceutical innovation and drug discovery. Numerous machine learning-based and network-based algorithms have been developed for predicting drug-target interactions. However, large-scale pharmacological, genomic and chemical datum emerged recently provide new opportunity for further heightening the accuracy of drug-target interactions prediction.ResultsIn this work, based on the assumption that similar drugs tend to interact with similar proteins and vice versa, we developed a novel computational method (namely MKLC-BiRW) to predict new drug-target interactions. MKLC-BiRW integrates diverse drug-related and target-related heterogeneous information source by using the multiple kernel learning and clustering methods to generate the drug and target similarity matrices, in which the low similarity elements are set to zero to build the drug and target similarity correction networks. By incorporating these drug and target similarity correction networks with known drug-target interaction bipartite graph, MKLC-BiRW constructs the heterogeneous network on which Bi-random walk algorithm is adopted to infer the potential drug-target interactions.ConclusionsCompared with other existing state-of-the-art methods, MKLC-BiRW achieves the best performance in terms of AUC and AUPR. MKLC-BiRW can effectively predict the potential drug-target interactions. 相似文献