全文获取类型
收费全文 | 5125篇 |
免费 | 285篇 |
国内免费 | 442篇 |
专业分类
化学 | 352篇 |
晶体学 | 2篇 |
力学 | 252篇 |
综合类 | 95篇 |
数学 | 4326篇 |
物理学 | 825篇 |
出版年
2024年 | 6篇 |
2023年 | 78篇 |
2022年 | 83篇 |
2021年 | 100篇 |
2020年 | 142篇 |
2019年 | 136篇 |
2018年 | 144篇 |
2017年 | 134篇 |
2016年 | 133篇 |
2015年 | 96篇 |
2014年 | 234篇 |
2013年 | 547篇 |
2012年 | 204篇 |
2011年 | 278篇 |
2010年 | 263篇 |
2009年 | 343篇 |
2008年 | 356篇 |
2007年 | 337篇 |
2006年 | 294篇 |
2005年 | 291篇 |
2004年 | 215篇 |
2003年 | 198篇 |
2002年 | 198篇 |
2001年 | 136篇 |
2000年 | 137篇 |
1999年 | 137篇 |
1998年 | 114篇 |
1997年 | 83篇 |
1996年 | 78篇 |
1995年 | 64篇 |
1994年 | 55篇 |
1993年 | 40篇 |
1992年 | 25篇 |
1991年 | 16篇 |
1990年 | 18篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 17篇 |
1986年 | 24篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 12篇 |
1982年 | 11篇 |
1981年 | 9篇 |
1980年 | 3篇 |
1978年 | 4篇 |
1973年 | 2篇 |
1970年 | 2篇 |
1969年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有5852条查询结果,搜索用时 15 毫秒
991.
The energy of a graph is the sum of the absolute values of the eigenvalues of the graph. In a paper [G. Caporossi, D. Cvetkovi, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with external energy, J. Chem. Inf. Comput. Sci. 39 (1999) 984-996] Caporossi et al. conjectured that among all connected graphs G with n≥6 vertices and n−1≤m≤2(n−2) edges, the graphs with minimum energy are the star Sn with m−n+1 additional edges all connected to the same vertices for m≤n+⌊(n−7)/2⌋, and the bipartite graph with two vertices on one side, one of which is connected to all vertices on the other side, otherwise. The conjecture is proved to be true for m=n−1,2(n−2) in the same paper by Caporossi et al. themselves, and for m=n by Hou in [Y. Hou, Unicyclic graphs with minimal energy, J. Math. Chem. 29 (2001) 163-168]. In this paper, we give a complete solution for the second part of the conjecture on bipartite graphs. Moreover, we determine the graph with the second-minimal energy in all connected bipartite graphs with n vertices and edges. 相似文献
992.
Teena Carroll David Galvin Prasad Tetali 《Journal of Combinatorial Theory, Series A》2009,116(7):1219-1227
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size ℓ in a d-regular graph on N vertices. For bounded away from 0 and 1, the logarithm of the bound we obtain agrees in its leading term with the logarithm of the number of matchings of size ℓ in the graph consisting of disjoint copies of Kd,d. This provides asymptotic evidence for a conjecture of S. Friedland et al. We also obtain an analogous result for independent sets of a fixed size in regular graphs, giving asymptotic evidence for a conjecture of J. Kahn. Our bounds on the number of matchings and independent sets of a fixed size are derived from bounds on the partition function (or generating polynomial) for matchings and independent sets. 相似文献
993.
Anvesh Komuravelli 《Discrete Applied Mathematics》2009,157(16):3372-3385
An N-dimensional digital binary image (I) is a function I:ZN→{0,1}. I is connected if and only if its black pixels and white pixels are each (3N−1)-connected. I is only connected if and only if its black pixels are (3N−1)-connected. For a 3-D binary image, the respective connectivity models are and . A pair of (3N−1)-neighboring opposite-valued pixels is called interchangeable in a N-D binary image I, if reversing their values preserves the original connectedness. We call such an interchange to be a (3N−1)-local interchange. Under the above connectivity models, we show that given two binary images of n pixels/voxels each, we can transform one to the other using a sequence of (3N−1)-local interchanges. The specific results are as follows. Any two -connected 3-dimensional images I and J each having n black voxels are transformable using a sequence of O((c1+c2)n2) 26-local interchanges. Here, c1 and c2 are the total number of 8-connected components in all 2-dimensional layers of I and J respectively. We also show bounds on connectivity under a different interchange model as proposed in [A. Dumitrescu, J. Pach, Pushing squares around, Graphs and Combinatorics 22 (1) (2006) 37-50]. Next, we show that any two simply connected images under the , connectivity model and each having n black voxels are transformable using a sequence of O(n2) 26-local interchanges. We generalize this result to show that any two , -connected N-dimensional simply connected images each having n black pixels are transformable using a sequence of O(Nn2)(3N−1)-local interchanges, where N>1. 相似文献
994.
Beifang Chen 《Discrete Mathematics》2009,309(6):1708-1710
Using the decomposition theory of modular and integral flow polynomials, we answer a problem of Beck and Zaslavsky, by providing a general situation in which the integral flow polynomial is a multiple of the modular flow polynomial. 相似文献
995.
Quasi-interpolation is an important tool, used both in theory and in practice, for the approximation of smooth functions from univariate or multivariate spaces which contain , the d-variate polynomials of degree ≤m. In particular, the reproduction of Πm leads to an approximation order of m+1. Prominent examples include Lagrange and Bernstein type approximations by polynomials, the orthogonal projection onto Πm for some inner product, finite element methods of precision m, and multivariate spline approximations based on macroelements or the translates of a single spline.For such a quasi-interpolation operator L which reproduces and any r≥0, we give an explicit construction of a quasi-interpolant which reproduces Πm+r, together with an integral error formula which involves only the (m+r+1)th derivative of the function approximated. The operator is defined on functions with r additional orders of smoothness than those on which L is defined. This very general construction holds in all dimensions d. A number of representative examples are considered. 相似文献
996.
K.S. Charak 《Journal of Mathematical Analysis and Applications》2009,353(1):43-48
We prove two normality criteria for a family of meromorphic functions satisfying a certain differential condition and provide a counterexample to the converse of the Bloch principle. 相似文献
997.
We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over which the walk runs through (always from left to right) without ever returning. 相似文献
998.
In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotients of non-commutative
polynomial rings, so called skew polynomial rings of automorphism type. We propose a method to construct block codes of prescribed
rank and a method to construct block codes of prescribed distance. Since there is no unique factorization in skew polynomial
rings, there are much more ideals and therefore much more codes than in the commutative case. In particular we obtain a [40,
23, 10]4 code by imposing a distance and a [42,14,21]8 code by imposing a rank, which both improve by one the minimum distance of the previously best known linear codes of equal
length and dimension over those fields. There is a strong connection with linear difference operators and with linearized
polynomials (or q-polynomials) reviewed in the first section.
相似文献
999.
Consider an arbitrary transient random walk on ℤ
d
with d∈ℕ. Pick α∈[0,∞), and let L
n
(α) be the spatial sum of the αth power of the n-step local times of the walk. Hence, L
n
(0) is the range, L
n
(1)=n+1, and for integers α, L
n
(α) is the number of the α-fold self-intersections of the walk. We prove a strong law of large numbers for L
n
(α) as n→∞. Furthermore, we identify the asymptotic law of the local time in a random site uniformly distributed over the range. These
results complement and contrast analogous results for recurrent walks in two dimensions recently derived by Černy (Stoch.
Proc. Appl. 117:262–270, 2007). Although these assertions are certainly known to experts, we could find no proof in the literature in this generality.
相似文献
1000.
We introduce and study some local versions of o‐minimality, requiring that every definable set decomposes as the union of finitely many isolated points and intervals in a suitable neighbourhood of every point. Motivating examples are the expansions of the ordered reals by sine, cosine and other periodic functions (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献