全文获取类型
收费全文 | 6482篇 |
免费 | 761篇 |
国内免费 | 407篇 |
专业分类
化学 | 385篇 |
晶体学 | 6篇 |
力学 | 1453篇 |
综合类 | 181篇 |
数学 | 3570篇 |
物理学 | 2055篇 |
出版年
2024年 | 6篇 |
2023年 | 49篇 |
2022年 | 69篇 |
2021年 | 130篇 |
2020年 | 181篇 |
2019年 | 172篇 |
2018年 | 144篇 |
2017年 | 202篇 |
2016年 | 237篇 |
2015年 | 178篇 |
2014年 | 262篇 |
2013年 | 443篇 |
2012年 | 295篇 |
2011年 | 318篇 |
2010年 | 257篇 |
2009年 | 310篇 |
2008年 | 368篇 |
2007年 | 386篇 |
2006年 | 358篇 |
2005年 | 303篇 |
2004年 | 279篇 |
2003年 | 305篇 |
2002年 | 292篇 |
2001年 | 269篇 |
2000年 | 262篇 |
1999年 | 200篇 |
1998年 | 170篇 |
1997年 | 135篇 |
1996年 | 119篇 |
1995年 | 93篇 |
1994年 | 102篇 |
1993年 | 81篇 |
1992年 | 83篇 |
1991年 | 83篇 |
1990年 | 62篇 |
1989年 | 54篇 |
1988年 | 53篇 |
1987年 | 39篇 |
1986年 | 30篇 |
1985年 | 41篇 |
1984年 | 54篇 |
1983年 | 25篇 |
1982年 | 22篇 |
1981年 | 31篇 |
1980年 | 15篇 |
1979年 | 16篇 |
1978年 | 16篇 |
1977年 | 11篇 |
1976年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有7650条查询结果,搜索用时 18 毫秒
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.
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. 相似文献
8.
Murad B. Khorsheed Qasim M. Zainel Oday A. Hassen Saad M. Darwish 《Entropy (Basel, Switzerland)》2020,22(12)
This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate. 相似文献
9.
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. 相似文献
10.