全文获取类型
收费全文 | 5563篇 |
免费 | 736篇 |
国内免费 | 303篇 |
专业分类
化学 | 353篇 |
晶体学 | 7篇 |
力学 | 559篇 |
综合类 | 140篇 |
数学 | 3595篇 |
物理学 | 1948篇 |
出版年
2024年 | 5篇 |
2023年 | 42篇 |
2022年 | 43篇 |
2021年 | 97篇 |
2020年 | 169篇 |
2019年 | 150篇 |
2018年 | 120篇 |
2017年 | 154篇 |
2016年 | 172篇 |
2015年 | 131篇 |
2014年 | 221篇 |
2013年 | 394篇 |
2012年 | 254篇 |
2011年 | 261篇 |
2010年 | 229篇 |
2009年 | 265篇 |
2008年 | 338篇 |
2007年 | 335篇 |
2006年 | 315篇 |
2005年 | 259篇 |
2004年 | 232篇 |
2003年 | 266篇 |
2002年 | 268篇 |
2001年 | 236篇 |
2000年 | 243篇 |
1999年 | 182篇 |
1998年 | 166篇 |
1997年 | 118篇 |
1996年 | 105篇 |
1995年 | 70篇 |
1994年 | 90篇 |
1993年 | 67篇 |
1992年 | 65篇 |
1991年 | 72篇 |
1990年 | 55篇 |
1989年 | 45篇 |
1988年 | 50篇 |
1987年 | 38篇 |
1986年 | 27篇 |
1985年 | 36篇 |
1984年 | 51篇 |
1983年 | 25篇 |
1982年 | 20篇 |
1981年 | 28篇 |
1980年 | 14篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 11篇 |
1976年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有6602条查询结果,搜索用时 15 毫秒
1.
Mossel and Ross raised the question of when a random coloring of a graph can be reconstructed from local information, namely, the colorings (with multiplicity) of balls of given radius. In this article, we are concerned with random 2-colorings of the vertices of the -dimensional hypercube, or equivalently random Boolean functions. In the worst case, balls of diameter are required to reconstruct. However, the situation for random colorings is dramatically different: we show that almost every 2-coloring can be reconstructed from the multiset of colorings of balls of radius 2. Furthermore, we show that for , almost every -coloring can be reconstructed from the multiset of colorings of 1-balls. 相似文献
2.
This paper presents a new sensitivity analysis method for coupled acoustic–structural systems subjected to non-stationary random excitations. The integral of the response power spectrum density (PSD) of the coupled system is taken as the objective function. The thickness of each structural element is used as a design variable. A time-domain algorithm integrating the pseudo excitation method (PEM), direct differentiation method (DDM) and high precision direct (HPD) integration method is proposed for the sensitivity analysis of the objective function with respect to design variables. Firstly, the PEM is adopted to transform the sensitivity analysis under non-stationary random excitations into the sensitivity analysis under pseudo transient excitations. Then, the sensitivity analysis equation of the coupled system under pseudo transient excitations is derived based on the DDM. Moreover, the HPD integration method is used to efficiently solve the sensitivity analysis equation under pseudo transient excitations in a reduced-order modal space. Numerical examples are presented to demonstrate the validity of the proposed method. 相似文献
3.
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. 相似文献
4.
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 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
9.
Renny Mathew Karolina A. Uchman Lydia Gkoura Chris J. Pickard Maria Baias 《Magnetic resonance in chemistry : MRC》2020,58(11):1018-1025
A combined experimental and computational approach was used to distinguish between different polymorphs of the pharmaceutical drug aspirin. This method involves the use of ab initio random structure searching (AIRSS), a density functional theory (DFT)-based crystal structure prediction method for the high-accuracy prediction of polymorphic structures, with DFT calculations of nuclear magnetic resonance (NMR) parameters and solid-state NMR experiments at natural abundance. AIRSS was used to predict the crystal structures of form-I and form-II of aspirin. The root-mean-square deviation between experimental and calculated 1H chemical shifts was used to identify form-I as the polymorph present in the experimental sample, the selection being successful despite the large similarities between the molecular environments in the crystals of the two polymorphs. 相似文献
10.
Hitting probabilities and the Hausdorff dimension of the inverse images of a class of anisotropic random fields 下载免费PDF全文
Let X = {X(t):t ∈ R~N} be an anisotropic random field with values in R~d.Under certain conditions on X,we establish upper and lower bounds on the hitting probabilities of X in terms of respectively Hausdorff measure and Bessel-Riesz capacity.We also obtain the Hausdorff dimension of its inverse image,and the Hausdorff and packing dimensions of its level sets.These results are applicable to non-linear solutions of stochastic heat equations driven by a white in time and spatially homogeneous Gaussian noise and anisotropic Guassian random fields. 相似文献