全文获取类型
收费全文 | 8131篇 |
免费 | 910篇 |
国内免费 | 493篇 |
专业分类
化学 | 542篇 |
晶体学 | 27篇 |
力学 | 2323篇 |
综合类 | 158篇 |
数学 | 3691篇 |
物理学 | 2793篇 |
出版年
2024年 | 11篇 |
2023年 | 67篇 |
2022年 | 117篇 |
2021年 | 147篇 |
2020年 | 254篇 |
2019年 | 214篇 |
2018年 | 162篇 |
2017年 | 262篇 |
2016年 | 264篇 |
2015年 | 205篇 |
2014年 | 343篇 |
2013年 | 514篇 |
2012年 | 354篇 |
2011年 | 425篇 |
2010年 | 312篇 |
2009年 | 372篇 |
2008年 | 436篇 |
2007年 | 472篇 |
2006年 | 449篇 |
2005年 | 395篇 |
2004年 | 386篇 |
2003年 | 400篇 |
2002年 | 361篇 |
2001年 | 333篇 |
2000年 | 316篇 |
1999年 | 265篇 |
1998年 | 252篇 |
1997年 | 163篇 |
1996年 | 158篇 |
1995年 | 107篇 |
1994年 | 135篇 |
1993年 | 103篇 |
1992年 | 97篇 |
1991年 | 109篇 |
1990年 | 80篇 |
1989年 | 70篇 |
1988年 | 65篇 |
1987年 | 42篇 |
1986年 | 29篇 |
1985年 | 38篇 |
1984年 | 52篇 |
1983年 | 25篇 |
1982年 | 27篇 |
1981年 | 31篇 |
1980年 | 16篇 |
1979年 | 22篇 |
1978年 | 15篇 |
1977年 | 13篇 |
1976年 | 11篇 |
1957年 | 9篇 |
排序方式: 共有9534条查询结果,搜索用时 109 毫秒
1.
三氧化二铋(Bi2O3)是氧离子导电体,为了获得它的原子热振动各向同性温度因子,对该粉末晶体进行X射线衍射实验,建立了晶体结构模型,利用Rietveld 精修方法的RIETAN-2000 程序对所得实验结果进行了晶体结构精修,通过最大熵方法(MEM)解析得到了粉末晶体的等高电子密度分布三维(3D) 和二维(2D)可视化图谱。结果表明,各原子Bi(1)、Bi(2)、O(1)、O(2)和O(3)的原子热振动各向同性温度因子分别为0.004 938 nm2、0.004 174 nm2、0.007 344 nm2、0.007 462 nm2、和0.007 857 nm2,等高电子密度分布的可视化,进一步验证了晶体结构模型和原子位置的准确性,这些参数对研究晶体材料的热性质具有一定参考意义。 相似文献
2.
基于有限元法对单面柱局域共振声子晶体进行带隙特性分析,研究了结构参数对该类型声子晶体的影响。结果表明:随着散射体高度的增加,单面柱声子晶体的第一完全带隙的起始频率逐渐降低,带宽逐渐增大;随着基板厚度的增大,单面柱声子晶体的起始频率逐渐升高,截止频率先增大后减小。并且在经典单面柱声子晶体的基础上,组合了两种新型的三组元单面柱声子晶体结构:嵌入式单面柱声子晶体(以下简称结构Ⅰ)和粘接式单面柱声子晶体(以下简称结构Ⅱ)。通过对其带隙特性的分析得出:这两种新结构与经典的单面柱声子晶体相比,都具有更低频的带隙,这对于低频减振降噪是非常有利的。本文的结果将对实际的工程应用提供一定的理论指导。 相似文献
3.
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. 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
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 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
This work deals with a study of the dynamic and buckling analysis of polymer hybrid composite(PHC) beam. The beam has variable thickness and is reinforced by carbon nanotubes(CNTs) and nanoclay(NC) simultaneously. The governing equations are derived based on the first shear deformation theory(FSDT). A three-phase HalpinTsai approach is used to predict the mechanical properties of the PHC. We focus our attention on the effect of the simultaneous addition of NC and CNT on the vibration and buckling analysis of the PHC beam with variable thickness. Also a comparison study is done on the sensation of three impressive parameters including CNT, NC weight fractions, and the shape factor of fillers on the mechanical properties of PHC beams,as well as fundamental frequencies of free vibrations and critical buckling load. The results show that the increase of shape factor value, NC, and CNT weight fractions leads to considerable reinforcement in mechanical properties as well as increase of the dimensionless fundamental frequency and buckling load. The variation of CNT weight fraction on elastic modulus is more sensitive rather than shear modulus but the effect of NC weight fraction on elastic and shear moduli is fairly the same. The shape factor values more than the medium level do not affect the mechanical properties. 相似文献
10.
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. 相似文献