全文获取类型
收费全文 | 5803篇 |
免费 | 338篇 |
国内免费 | 607篇 |
专业分类
化学 | 1605篇 |
晶体学 | 14篇 |
力学 | 141篇 |
综合类 | 59篇 |
数学 | 4318篇 |
物理学 | 611篇 |
出版年
2024年 | 5篇 |
2023年 | 64篇 |
2022年 | 103篇 |
2021年 | 105篇 |
2020年 | 145篇 |
2019年 | 160篇 |
2018年 | 162篇 |
2017年 | 154篇 |
2016年 | 113篇 |
2015年 | 124篇 |
2014年 | 206篇 |
2013年 | 743篇 |
2012年 | 173篇 |
2011年 | 223篇 |
2010年 | 176篇 |
2009年 | 291篇 |
2008年 | 345篇 |
2007年 | 380篇 |
2006年 | 333篇 |
2005年 | 341篇 |
2004年 | 294篇 |
2003年 | 286篇 |
2002年 | 276篇 |
2001年 | 214篇 |
2000年 | 208篇 |
1999年 | 190篇 |
1998年 | 184篇 |
1997年 | 170篇 |
1996年 | 115篇 |
1995年 | 72篇 |
1994年 | 54篇 |
1993年 | 58篇 |
1992年 | 46篇 |
1991年 | 21篇 |
1990年 | 16篇 |
1989年 | 24篇 |
1988年 | 22篇 |
1987年 | 12篇 |
1986年 | 15篇 |
1985年 | 27篇 |
1984年 | 19篇 |
1983年 | 8篇 |
1982年 | 14篇 |
1981年 | 13篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1973年 | 2篇 |
排序方式: 共有6748条查询结果,搜索用时 15 毫秒
1.
《Indagationes Mathematicae》2021,32(6):1229-1239
2.
3.
《Indagationes Mathematicae》2022,33(1):218-237
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic , and with coefficients in a field of odd characteristic ): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols. 相似文献
4.
An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order with index , denoted by , is a pair , where is an ‐set and is a set of oriented tetrahedra (blocks) such that every cyclic triple on is contained in exactly members of . A is pure if there do not exist two blocks with the same vertex set. When , the spectrum of a pure TQS has been completely determined by Ji. In this paper, we show that there exists a pure if and only if and . A corollary is that a simple also exists if and only if and . 相似文献
5.
We study spectral properties of discrete Schrödinger operators with potentials obtained via dimerization of a class of aperiodic sequences. It is shown that both the nature of the autocorrelation measure of a regular sequence and the presence of generic (full probability) singular continuous spectrum in the hull of primitive and palindromic (four block substitution) potentials are robust under dimerization. Generic results also hold for circle potentials. We illustrate these results with numerical studies of the quantum mean square displacement as a function of time. The numerical techniques provide a very fast algorithm for the time evolution of wave packets. 相似文献
6.
张志让 《数学年刊A辑(中文版)》2006,(2)
如果群 G 的所有真商群都是 FO-群,但是群 G 本身不是 FO-群,则称 G 为外 FO-群,本文将给出外 FO-群完全的结构描述. 相似文献
7.
A FUNDAMENTAL SOLUTION FOR THE LAPLACE OPERATOR ON THE QUATERNIONIC HEISENBERG GROUP 总被引:2,自引:0,他引:2
朱理 《数学物理学报(B辑英文版)》2002,22(3)
In this paper, the author studies the Laplace operator on the quaternionic Heisenberg group, construct a fundamental solution for it and use this solution to prove the Lp-boundedness and the weak (1-1) boundedness of certain singular convolution operators on the quaternionic Heisenberg group. 相似文献
8.
9.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
10.
Miklós Csörgő 《Periodica Mathematica Hungarica》2005,50(1-2):1-27
Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks. 相似文献