全文获取类型
收费全文 | 31607篇 |
免费 | 1214篇 |
国内免费 | 1532篇 |
专业分类
化学 | 10612篇 |
晶体学 | 216篇 |
力学 | 451篇 |
综合类 | 71篇 |
数学 | 18715篇 |
物理学 | 4288篇 |
出版年
2023年 | 372篇 |
2022年 | 258篇 |
2021年 | 315篇 |
2020年 | 481篇 |
2019年 | 753篇 |
2018年 | 699篇 |
2017年 | 513篇 |
2016年 | 547篇 |
2015年 | 661篇 |
2014年 | 992篇 |
2013年 | 2193篇 |
2012年 | 1177篇 |
2011年 | 2272篇 |
2010年 | 1767篇 |
2009年 | 2152篇 |
2008年 | 2466篇 |
2007年 | 2267篇 |
2006年 | 1742篇 |
2005年 | 1252篇 |
2004年 | 1130篇 |
2003年 | 1010篇 |
2002年 | 1250篇 |
2001年 | 725篇 |
2000年 | 668篇 |
1999年 | 741篇 |
1998年 | 589篇 |
1997年 | 487篇 |
1996年 | 538篇 |
1995年 | 574篇 |
1994年 | 525篇 |
1993年 | 384篇 |
1992年 | 342篇 |
1991年 | 262篇 |
1990年 | 220篇 |
1989年 | 221篇 |
1988年 | 157篇 |
1987年 | 155篇 |
1986年 | 155篇 |
1985年 | 207篇 |
1984年 | 163篇 |
1983年 | 94篇 |
1982年 | 150篇 |
1981年 | 144篇 |
1980年 | 107篇 |
1979年 | 85篇 |
1978年 | 93篇 |
1977年 | 76篇 |
1976年 | 71篇 |
1975年 | 28篇 |
1974年 | 30篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
971.
We show that the maximum number of edges boundingm faces in an arrangement ofn line segments in the plane isO(m
2/3
n
2/3+n(n)+nlogm). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is (m
2/3
n
2/3+n(n)). In addition, we show that the number of edges bounding anym faces in an arrangement ofn line segments with a total oft intersecting pairs isO(m
2/3
t
1/3+n(t/n)+nmin{logm,logt/n}), almost matching the lower bound of (m
2/3
t
1/3+n(t/n)) demonstrated in this paper.Work on this paper by the first and fourth authors has been partially supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grants DCR-83-20085 and CCR-89-01484. Work by the first author has also been supported by an AT&T Bell Laboratories Ph.D. scholarship at New York University and by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center (NSF-STC88-09648). Work by the second author has been supported by NSF under Grants CCR-87-14565 and CCR-89-21421. Work by the fourth author has additionally been supported by grants from the U.S.-Israeli Binational Science Foundation, the NCRD (the Israeli National Council for Research and Development) and the Fund for Basic Research in Electronics, Computers and Communication, administered by the Israeli National Academy of Sciences. 相似文献
972.
Harald Luschgy 《Probability Theory and Related Fields》1992,93(1):39-66
Summary Let
(Q) be the statistical experiment based on the observation of an unknown function in the presence of an additive noise process with distributionQ. The (possible) loss of information whenQ is replaced by some other noise distributionP is measured by the deficiency of
(P) relative to
(Q). This deficiency and its relation to the variational distance ofP andQ are studied mainly for Gaussian noise processes. Gaussian diffusion processes and special set-indexed processes are treated in detail.Research supported by a Heisenberg grant of the Deutsche Forschungsgemeinschaft 相似文献
973.
P. Révész 《Probability Theory and Related Fields》1992,93(1):21-37
Summary We say that the discD()R
2, of radius , located around the origin isp-covered in timeT by a Wiener processW(·) if for anyzD() there exists a 0tT such thatW(t) is a point of the disc of radiusp, located aroundz. The supremum of those 's (0) is studied for which,D() isp-covered inT. 相似文献
974.
For each positive integerk, we consider the setA
k
of all ordered pairs [a, b] such that in everyk-graph withn vertices andm edges some set of at mostam+bn vertices meets all the edges. We show that eachA
k
withk2 has infinitely many extreme points and conjecture that, for every positive , it has only finitely many extreme points [a, b] witha. With the extreme points ordered by the first coordinate, we identify the last two extreme points of everyA
k
, identify the last three extreme points ofA
3, and describeA
2 completely. A by-product of our arguments is a new algorithmic proof of Turán's theorem. 相似文献
975.
Jeff Kahn 《Combinatorica》1992,12(4):417-423
Letn(k) be the least size of an intersecting family ofk-sets with cover numberk, and let
k
denote any projective plane of orderk–1.Theorem There is a constant A such that ifH is a random set ofm Aklogk lines from
k
then Pr(H<)0(k).Corollary
If there exists a
k
thenn(k)=O(klogk). These statements were conjectured by P. Erds and L. Lovász in 1973.Supported in part by NSF-DMS87-83558 and AFOSR grants 89-0066, 89-0512 and 90-0008 相似文献
976.
Toeplitz and Hankel type operators on the upper half-plane 总被引:3,自引:0,他引:3
An orthogonal decomposition of admissible wavelets is constructed via the Laguerre polynomials, it turns to give a complete decomposition of the space of square integrable functions on the upper half-plane with the measurey
dxdy. The first subspace is just the weighted Bergman (or Dzhrbashyan) space. Three types of Ha-plitz operators are defined, they are the generalization of classical Toeplitz, small and big Hankel operators respectively. Their boundedness, compactness and Schatten-von Neumann properties are studied.Research was supported by the National Natural Science Foundation of China. 相似文献
977.
V. I. Levenshtein 《Acta Appl Math》1992,29(1-2):1-82
Finite and infinite metric spaces % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] that are polynomial with respect to a monotone substitution of variable t(d) are considered. A finite subset (code) W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] is characterized by the minimal distance d(W) between its distinct elements, by the number l(W) of distances between its distinct elements and by the maximal strength (W) of the design generated by the code W. A code W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] is called a maximum one if it has the greatest cardinality among subsets of % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] with minimal distance at least d(W), and diametrical if the diameter of W is equal to the diameter of the whole space % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\]. Delsarte codes are codes W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] with (W)2l(W)–1 or (W)=2l(W)–2>0 and W is a diametrical code. It is shown that all parameters of Delsarte codes W) % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] are uniquely determined by their cardinality |W| or minimal distance d(W) and that the minimal polynomials of the Delsarte codes W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] are expansible with positive coefficients in an orthogonal system of polynomials {Q
i(t)} corresponding to % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\]. The main results of the present paper consist in a proof of maximality of all Delsarte codes provided that the system {Q
i)} satisfies some condition and of a new proof confirming in this case the validity of all the results on the upper bounds for the maximum cardinality of codes W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \]% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] with a given minimal distance, announced by the author in 1978. Moreover, it appeared that this condition is satisfied for all infinite polynomial metric spaces as well as for distance-regular graphs, decomposable in a sense defined below. It is also proved that with one exception all classical distance-regular graphs are decomposable. In addition for decomposable distance-regular graphs an improvement of the absolute Delsarte bound for diametrical codes is obtained. For the Hamming and Johnson spaces, Euclidean sphere, real and complex projective spaces, tables containing parameters of known Delsarte codes are presented. Moreover, for each of the above-mentioned infinite spaces infinite sequences (of maximum) Delsarte codes not belonging to tight designs are indicated. 相似文献
978.
The approximation order provided by a directed set {S
h
}
h>0 of spaces, each spanned by thehZ
d
-translates of one function, is analyzed. The nearoptimal approximants of [R2] from eachs
h
to the exponential functions are used to establish upper bounds on the approximation order. These approximants are also used on the Fourier transform domain to yield approximations for other smooth functions, and thereby provide lower bounds on the approximation order. As a special case, the classical Strang-Fix conditions are extended to bounded summable generating functions.The second part of the paper consists of a detailed account of various applications of these general results to spline and radial function theory. Emphasis is given to the case when the scale {s
h
} is obtained froms
1 by means other than dilation. This includes the derivation of spectral approximation orders associated with smooth positive definite generating functions. 相似文献
979.
Bent Fuglede 《Potential Analysis》1992,1(4):355-371
The first property is a refinement of earlier results of Ch. de la Vallée Poussin, M. Brelot, and A. F. Grishin. Let w=u–v with u, v superharmonic on a suitable harmonic space (for example an open subset of R
n
), and let [w]=[u]–[v] denote the associated Riesz charge. If w0, and if E denotes the set of those points of at which the lim inf of w in thefine topology is 0, then the restriction of [w] to E is 0. Another property states that, if e denotes a polar subset of such that the fine lim inf of |w| at each point of e is finite, then the restriction of [w] to e is 0. 相似文献
980.
Vadim A. Kaimanovich 《Potential Analysis》1992,1(1):61-82
We define the notion of p-capacity for a reversible Markov operator on a general measure space and prove that uniform estimates for the ratio of capacity and measure are equivalent to certain imbedding theorems for the Orlicz and Dirichlet norms. As a corollary we get results on connections between embedding theorems and isoperimetric properties for general Markov operators and, particularly, a generalization of the Kesten theorem on the spectral radius of random walks on amenable groups for the case of arbitrary graphs with non-finitely supported transition probabilities. 相似文献