全文获取类型
收费全文 | 9053篇 |
免费 | 848篇 |
国内免费 | 526篇 |
专业分类
化学 | 497篇 |
晶体学 | 7篇 |
力学 | 612篇 |
综合类 | 202篇 |
数学 | 7034篇 |
物理学 | 2075篇 |
出版年
2024年 | 27篇 |
2023年 | 104篇 |
2022年 | 174篇 |
2021年 | 171篇 |
2020年 | 254篇 |
2019年 | 253篇 |
2018年 | 230篇 |
2017年 | 283篇 |
2016年 | 238篇 |
2015年 | 194篇 |
2014年 | 300篇 |
2013年 | 719篇 |
2012年 | 338篇 |
2011年 | 406篇 |
2010年 | 358篇 |
2009年 | 532篇 |
2008年 | 563篇 |
2007年 | 510篇 |
2006年 | 514篇 |
2005年 | 391篇 |
2004年 | 380篇 |
2003年 | 402篇 |
2002年 | 417篇 |
2001年 | 347篇 |
2000年 | 372篇 |
1999年 | 293篇 |
1998年 | 252篇 |
1997年 | 198篇 |
1996年 | 170篇 |
1995年 | 87篇 |
1994年 | 117篇 |
1993年 | 84篇 |
1992年 | 80篇 |
1991年 | 86篇 |
1990年 | 65篇 |
1989年 | 65篇 |
1988年 | 58篇 |
1987年 | 43篇 |
1986年 | 33篇 |
1985年 | 54篇 |
1984年 | 65篇 |
1983年 | 29篇 |
1982年 | 29篇 |
1981年 | 35篇 |
1980年 | 18篇 |
1979年 | 18篇 |
1978年 | 18篇 |
1977年 | 13篇 |
1976年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
A set of vertices is shattered in a hypergraph if any of its subsets is obtained as the intersection of an edge with the set. The VC dimension is the size of the largest shattered subset. Under the binomial model of k‐uniform random hypergraphs, the threshold function for the VC dimension to be larger than a given integer is obtained. The same is done for the testing dimension, which is the largest integer d such that all sets of cardinality d are shattered. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
92.
93.
张国胜 《数学的实践与认识》2006,36(7):356-367
设W(1n)W2(n)…W(nn)是严平稳随即序列{Xn,n 1}的前几个变量的顺序统计量,Nn Mn是两正整值r.v,n 1.在较弱一些的混合条件下,本文给出了W(NMn)n标准化后的极限分布,从而使一些提法更趋一般化,主要结果推进了Rao(1984)和张国胜(1993)的工作.由于混合条件的减弱,使得对m-相关和正态平稳过程的具体应用讨论更加充分. 相似文献
94.
Alistair Savage 《Algebras and Representation Theory》2006,9(2):161-199
For irreducible integrable highest weight modules of the finite and affine Lie algebras of type A and D, we define an isomorphism between the geometric realization of the crystal graphs in terms of irreducible components of Nakajima
quiver varieties and the combinatorial realizations in terms of Young tableaux and Young walls. For type An(1), we extend the Young wall construction to arbitrary level, describing a combinatorial realization of the crystals in terms
of new objects which we call Young pyramids.
Presented by P. Littleman
Mathematics Subject Classifications (2000) Primary 16G10, 17B37.
Alistair Savage: This research was supported in part by the Natural Sciences and Engineering Research Council (NSERC) of Canada
and was partially conducted by the author for the Clay Mathematics Institute. 相似文献
95.
??In this paper, by applying the moment inequality for asymptotically almost negatively associated (AANA, in short) random sequence and truncated method, the equivalent conditions of complete moment convergence of the maximum partial for weighted sums of AANA random variables are obtained without assumptions of identical distribution, which generalize and improve the corresponding ones of{15},{16} and {17}, respectively. 相似文献
96.
S. V. Dil’man 《Mathematical Notes》2006,79(5-6):625-631
In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained. 相似文献
97.
Bart De Bruyn 《Journal of Algebraic Combinatorics》2006,24(1):23-29
Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t2, t3 and t satisfy s ≥ 2, t2 ≥ 2 and t3 ≠ t2(t2+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open
for the near octagons corresponding with certain values of s, t2 and t3. In the present paper, we will also show the nonexistence of these remaining regular near octagons.
MSC2000 05B25, 05E30, 51E12
Postdoctoral Fellow of the Research Foundation - Flanders 相似文献
98.
99.
Mitre C. Dourado Fábio Protti Jayme L. Szwarcfiter 《Discrete Applied Mathematics》2007,155(18):2435-2443
Let p?1 and q?0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F′⊆F formed by p or less members has total intersection of cardinality at least q. A family of sets F is (p,q)-Helly when every (p,q)-intersecting subfamily F′⊆F has total intersection of cardinality at least q. A graph G is a (p,q)-clique-Helly graph when its family of (maximal) cliques is (p,q)-Helly. According to this terminology, the usual Helly property and the clique-Helly graphs correspond to the case p=2,q=1. In this work we present a characterization for (p,q)-clique-Helly graphs. For fixed p,q, this characterization leads to a polynomial-time recognition algorithm. When p or q is not fixed, it is shown that the recognition of (p,q)-clique-Helly graphs is NP-hard. 相似文献
100.
In this article,the Hausdorff dimension and exact Hausdorff measure function of any random sub-self-similar set are obtained under some reasonable conditions.Several examples are given at the end. 相似文献