全文获取类型
收费全文 | 653篇 |
免费 | 56篇 |
国内免费 | 46篇 |
专业分类
化学 | 55篇 |
力学 | 28篇 |
综合类 | 16篇 |
数学 | 533篇 |
物理学 | 123篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 7篇 |
2021年 | 14篇 |
2020年 | 13篇 |
2019年 | 23篇 |
2018年 | 24篇 |
2017年 | 17篇 |
2016年 | 15篇 |
2015年 | 12篇 |
2014年 | 23篇 |
2013年 | 51篇 |
2012年 | 25篇 |
2011年 | 34篇 |
2010年 | 25篇 |
2009年 | 41篇 |
2008年 | 44篇 |
2007年 | 43篇 |
2006年 | 37篇 |
2005年 | 37篇 |
2004年 | 27篇 |
2003年 | 28篇 |
2002年 | 27篇 |
2001年 | 23篇 |
2000年 | 17篇 |
1999年 | 22篇 |
1998年 | 21篇 |
1997年 | 14篇 |
1996年 | 17篇 |
1995年 | 10篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 4篇 |
排序方式: 共有755条查询结果,搜索用时 15 毫秒
661.
Buenker RJ Whitten JL Izgorodina EI Liebermann HP Kokh DB 《Journal of computational chemistry》2002,23(10):943-949
Localized molecular orbitals (LMOs) derived from exchange maximization with respect to all atom-centered basis functions in the basis set are shown to generate a good starting electronic field for self-consistent field calculations on extended systems such as metal clusters, for which well-defined chemical bonds are not present. Examples studied are a cluster of 20 Ni atoms and the Pt(97)CO, Ag(43)/H(3)CNON, Ag(91)/H(2)CO, and vinylidene/Ni metal cluster plus adsorbate systems. It is also shown that improved starting vectors can be obtained by remixing a subset of the LMOs with the largest exchange eigenvalues through diagonalization of the Fock matrix computed with a null electronic field. Employing only a subset of the exchange-maximized LMOs in the first iterations, and then gradually expanding the space in which the diagonalizations are carried out in succeeding cycles, is shown to be an effective means of guiding the SCF procedure to the converged full-basis solution. 相似文献
662.
Let be the molecular graph of the linear [n] phenylene with n hexagons and n − 1 squares, and let be the graph obtained by attaching four-membered rings to the terminal hexagons of . In this article, the normalized Laplacian spectrum of consisting of the eigenvalues of two symmetric tridiagonal matrices of order 3n is determined. An explicit closed-form formula of the multiplicative degree-Kirchhoff index (respectively the number of spanning trees) of is derived. Similarly, explicit closed-form formulas of the multiplicative degree-Kirchhoff index and the number of spanning trees of are obtained. It is interesting to see that the multiplicative degree-Kirchhoff index of (respectively ) is approximately to one half of its Gutman index. 相似文献
663.
Richard Swanson Russell Walker 《Proceedings of the American Mathematical Society》1996,124(10):3247-3255
We construct a diffeomorphism of the 3-torus whose rotation set is not closed. We prove that the rotation set of a homeomorphism of the -torus contains the extreme points of its closed convex hull. Finally, we show that each pseudo-rotation set is closed for torus homeomorphisms.
664.
Michael Falk 《Annals of the Institute of Statistical Mathematics》1997,49(4):615-644
A popular robust measure of dispersion of a random variable (rv) X is the median absolute deviation from the median med(|X - med(X)|), MAD for short, which is based on the median med(X) of X. By choosing Y = X, the MAD turns out to be a special case of the comedian med((X - med(X))(Y - med(Y))), which is a robust measure of covariance between rvs X and Y. We investigate the comedian in detail, in particular in the normal case, and establish strong consistency and asymptotic normality of empirical counterparts. This leads to a robust competitor of the coefficient of correlation as an asymptotic level--statistic for testing independence of X and Y. An example shows the weird fact that knowledge of the population med(X) does not necessarily pay (in the sense of asymptotic relative efficiency) when estimating the MAD. 相似文献
665.
Carol Bezuidenhout Geoffrey Grimmett Armin Löffler 《Journal of statistical physics》1998,92(1-2):1-34
Consider a random set
of points in the box [n, –n)
d
, generated either by a Poisson process with density p or by a site percolation process with parameter p. We analyze the empirical distribution function F
n of the lengths of edges in a minimal (Euclidean) spanning tree
on
. We express the limit of F
n, as n , in terms of the free energies of a family of percolation processes derived from
by declaring two points to be adjacent whenever they are closer than a prescribed distance. By exploring the singularities of such free energies, we show that the large-n limits of the moments of F
n are infinitely differentiable functions of p except possibly at values belonging to a certain infinite sequence (p
c(k): k 1) of critical percolation probabilities. It is believed that, in two dimensions, these limiting moments are twice differentiable at these singular values, but not thrice differentiable. This analysis provides a rigorous framework for the numerical experimentation of Dussert, Rasigni, Rasigni, Palmari, and Llebaria, who have proposed novel Monte Carlo methods for estimating the numerical values of critical percolation probabilities. 相似文献
666.
Recently, two main events have spurred a rapid increase in cyanobacteria chemical, toxicological, and ecological research. The first deals with the interest in isolating compounds from these organisms as source of active products with potential therapeutic applications. The second pertains the crucial problem of harmful cyanobacterial blooms in the aquatic environments. In this context, 594 secondary metabolites belonging to more than 30 genera of cyanobacteria were retrieved from literature. In order to perform their typology, they were first associated with 87 different molecular archetypes and two orphan classes. These 89 groups of molecular structures were then confronted to minimum spanning tree analysis. Attempts were made to graphically derive chemotaxonomical relationships. The interest of QSAR models for estimating the potential pharmacological interest of the cyanobacterial secondary metabolites was also discussed. 相似文献
667.
有向网络中具有一个枢纽点的最小支撑树的计算方法 总被引:1,自引:0,他引:1
对有向网络中具有一个枢纽点的支撑树的问题和性质进行了研究,给出了在有向网络图中寻找以某一定点为枢纽点的最小支撑树的计算方法,并对算法的复杂性进行了讨论,最后将该算法应用于实际算例的计算. 相似文献
668.
左光纪 《数学的实践与认识》2008,38(12):107-112
推广了计算图的支撑树个数的递归公式,解释了组合计数原理的用法.用组合技巧和常系数线性递归序列的解法,对n步梯、n-棱柱、Mobius n-棱柱及有关图,找到了计算它们的支撑树的个数的若干公式. 相似文献
669.
Jesper Lykke Jacobsen Jesús Salas Alan D. Sokal 《Journal of statistical physics》2005,119(5-6):1153-1281
We study the q-state Potts model with nearest-neighbor coupling v=eβJ−1 in the limit q,v → 0 with the ratio w = v/q held fixed. Combinatorially, this limit gives rise to the generating polynomial of spanning forests; physically, it provides information about the Potts-model phase diagram in the neighborhood of (q,v) = (0,0). We have studied this model on the square and triangular lattices, using a transfer-matrix approach at both real and complex values of w. For both lattices, we have computed the symbolic transfer matrices for cylindrical strips of widths 2≤ L ≤ 10, as well as the limiting curves B of partition-function zeros in the complex w-plane. For real w, we find two distinct phases separated by a transition point w=w0, where w0 =−1/4 (resp. w0=−0.1753 ± 0.0002) for the square (resp. triangular) lattice. For w>w0 we find a non-critical disordered phase that is compatible with the predicted asymptotic freedom as w → +∞. For w0 our results are compatible with a massless Berker–Kadanoff phase with central charge c=−2 and leading thermal scaling dimension xT,1 = 2 (marginally irrelevant operator). At w=w0 we find a “first-order critical point”: the first derivative of the free energy is discontinuous at w0, while the correlation length diverges as w↓ w0 (and is infinite at w=w0). The critical ehavior at w=w0 seems to be the same for both lattices and it differs from that of the Berker–Kadanoff phase: our results suggest that the central charge is c=−1, the leading thermal scaling dimension is xT,1=0, and the critical exponents are ν=1/d=1/2 and α=1. 相似文献
670.
Martha Salazar-Neumann 《Operations Research Letters》2007,35(1):17-22
We consider the robust minimum spanning tree problem where edges costs are on a compact and convex subset of Rn. We give the location of the robust deviation scenarios for a tree and characterizations of strictly strong edges and non-weak edges leading to recognition algorithms. 相似文献