全文获取类型
收费全文 | 3039篇 |
免费 | 174篇 |
国内免费 | 118篇 |
专业分类
化学 | 107篇 |
晶体学 | 1篇 |
力学 | 32篇 |
综合类 | 30篇 |
数学 | 3027篇 |
物理学 | 134篇 |
出版年
2024年 | 13篇 |
2023年 | 58篇 |
2022年 | 83篇 |
2021年 | 50篇 |
2020年 | 116篇 |
2019年 | 109篇 |
2018年 | 104篇 |
2017年 | 97篇 |
2016年 | 61篇 |
2015年 | 59篇 |
2014年 | 93篇 |
2013年 | 312篇 |
2012年 | 92篇 |
2011年 | 151篇 |
2010年 | 151篇 |
2009年 | 289篇 |
2008年 | 222篇 |
2007年 | 195篇 |
2006年 | 183篇 |
2005年 | 115篇 |
2004年 | 105篇 |
2003年 | 95篇 |
2002年 | 91篇 |
2001年 | 72篇 |
2000年 | 69篇 |
1999年 | 64篇 |
1998年 | 57篇 |
1997年 | 40篇 |
1996年 | 36篇 |
1995年 | 15篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 13篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3331条查询结果,搜索用时 33 毫秒
31.
Monique Laurent 《Mathematical Programming》2007,109(2-3):239-261
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras.
The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located
between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with
O(n
7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n
3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s
bound with the same computational complexity.
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203. 相似文献
32.
In this paper the classical theorem of Zareckii about regular relations is generalized and an intrinsic characterization of regularity is obtained. Based on the generalized Zareckii theorem and the intrinsic characterization of regularity, the authors give a characterization of monotone normality of ordered spaces. A new proof of the Urysohn-Nachbin lemma is presented which is quite different from the classical one. 相似文献
33.
Prot Pakoński Gregor Tanner Karol Życzkowski 《Journal of statistical physics》2003,111(5-6):1331-1352
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family L
n
(G). We give necessary and sufficient conditions for a line-graph to be quantisable and demonstrate that the spectra of associated quantum propagators follow the predictions of random matrices under very general conditions. Line-graphs may therefore serve as models to study the semiclassical limit (of large matrix size) of a quantum dynamics on graphs with fixed classical behaviour. 相似文献
34.
Eric Gifford Mark Johnson Chun-che Tsai 《Journal of computer-aided molecular design》1991,5(4):303-322
Summary The metabolic pathways of medazepam, oxazepam, and diazepam were modeled using graph-theoretic transforms which are incorporable into computer-assisted metabolic analysis programs. The information, represented in the form of a graph-theoretic transform kit, which was obtained from these pathways was then used to predict the metabolites of other benzodiazepine compounds. The transform kits gave statistically significant predictions with respect to a statistical method for evaluating the performance of the transform kits. 相似文献
35.
Jaroslav Neetil 《Journal of Graph Theory》2002,39(2):108-110
A graph G is called rigid if the identical mapping V(G)→V(G) is the only homomorphism G→G. In this note we give a simple construction of a rigid oriented graph on every set. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 108–110, 2002 相似文献
36.
王军秀 《纯粹数学与应用数学》2007,23(3):406-408
利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论. 相似文献
37.
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and variance of the exponentials of graph eigenvalues cluster around a line segment that we call a filar. Zooming-in reveals that this cluster splits into smaller segments (filars) labeled by the number of triangles in graphs. Further zooming-in shows that the smaller filars split into subfilars labeled by the number of quadrangles in graphs, etc. We call this fractal structure, discovered in a numerical experiment, a multifilar structure. We also provide a mathematical explanation of this phenomenon based on the Ihara-Selberg trace formula, and compute the coordinates and slopes of all filars in terms of Bessel functions of the first kind. 相似文献
38.
P.A. Kuzmin 《Journal of Mathematical Analysis and Applications》2007,330(1):744-750
This note is devoted to construction of the domain of the regular representation of Diff+(S1). We consider a subgroup of diffeomorphism group such that the Malliavin-Shavgulidze measure is quasi-invariant with respect to the left action of the subgroup. The measure appears to be quasi-invariant with respect to the left action of diffeomorphisms with discontinuous second derivative. We derive an expression for quasi-invariance density and obtain an additional PSL(2,R) symmetry breaking term. 相似文献
39.
40.
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. 相似文献