全文获取类型
收费全文 | 6578篇 |
免费 | 466篇 |
国内免费 | 15篇 |
专业分类
化学 | 5293篇 |
晶体学 | 38篇 |
力学 | 75篇 |
数学 | 717篇 |
物理学 | 936篇 |
出版年
2023年 | 59篇 |
2022年 | 81篇 |
2021年 | 111篇 |
2020年 | 212篇 |
2019年 | 196篇 |
2018年 | 86篇 |
2017年 | 101篇 |
2016年 | 273篇 |
2015年 | 257篇 |
2014年 | 319篇 |
2013年 | 352篇 |
2012年 | 487篇 |
2011年 | 542篇 |
2010年 | 311篇 |
2009年 | 247篇 |
2008年 | 412篇 |
2007年 | 386篇 |
2006年 | 358篇 |
2005年 | 289篇 |
2004年 | 273篇 |
2003年 | 221篇 |
2002年 | 216篇 |
2001年 | 135篇 |
2000年 | 95篇 |
1999年 | 78篇 |
1998年 | 74篇 |
1997年 | 84篇 |
1996年 | 76篇 |
1995年 | 79篇 |
1994年 | 92篇 |
1993年 | 62篇 |
1992年 | 54篇 |
1991年 | 48篇 |
1990年 | 36篇 |
1989年 | 52篇 |
1988年 | 34篇 |
1987年 | 26篇 |
1986年 | 23篇 |
1985年 | 14篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 17篇 |
1980年 | 19篇 |
1979年 | 14篇 |
1978年 | 21篇 |
1977年 | 16篇 |
1976年 | 10篇 |
1968年 | 7篇 |
1966年 | 8篇 |
排序方式: 共有7059条查询结果,搜索用时 937 毫秒
11.
12.
13.
The contributions to the coefficient functions of the quark and the mixed quark-gluon condensate to mesonic correlators are calculated for the first time to all orders in the quark masses, and to lowest order in the strong coupling constant. Existing results on the coefficient functions of the unit operator and the gluon condensate are reviewed. The proper factorization of short- and long-distance contributions in the operator product expansion is discussed in detail. It is found that to accomplish this task rigorously the operator product expansion has to be performed in terms ofnon-normal-ordered condensates. The resulting coefficient functions are improved with the help of the renormalization group. The scale invariant combination of dimension 5 operators, including mixing with the mass operator, which is needed for the renormalization group improvement, is calculated in the leading order.Supported by the German Bundesministerium für Forschung und Technologie, under the contract 06 TM 761 相似文献
14.
We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity. 相似文献
15.
Matthias Kriesell 《Graphs and Combinatorics》2002,18(1):133-146
Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set.
Received: April 14, 2000 Final version received: May 8, 2001 相似文献
16.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum,
the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without
the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in
the square. Our results differ from previous ones because we require that the entries in the square all be different from
each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from
set systems to rational linear forms.
Dedicated to the memory of Claudia Zaslavsky, 1917–2006
Received August 10, 2005 相似文献
17.
18.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
19.