全文获取类型
收费全文 | 12774篇 |
免费 | 324篇 |
国内免费 | 282篇 |
专业分类
化学 | 1977篇 |
晶体学 | 79篇 |
力学 | 49篇 |
综合类 | 21篇 |
数学 | 10241篇 |
物理学 | 1013篇 |
出版年
2023年 | 46篇 |
2022年 | 66篇 |
2021年 | 71篇 |
2020年 | 97篇 |
2019年 | 288篇 |
2018年 | 297篇 |
2017年 | 177篇 |
2016年 | 156篇 |
2015年 | 180篇 |
2014年 | 346篇 |
2013年 | 700篇 |
2012年 | 382篇 |
2011年 | 718篇 |
2010年 | 641篇 |
2009年 | 791篇 |
2008年 | 888篇 |
2007年 | 968篇 |
2006年 | 783篇 |
2005年 | 560篇 |
2004年 | 471篇 |
2003年 | 415篇 |
2002年 | 327篇 |
2001年 | 264篇 |
2000年 | 268篇 |
1999年 | 331篇 |
1998年 | 329篇 |
1997年 | 255篇 |
1996年 | 272篇 |
1995年 | 324篇 |
1994年 | 268篇 |
1993年 | 263篇 |
1992年 | 224篇 |
1991年 | 117篇 |
1990年 | 126篇 |
1989年 | 137篇 |
1988年 | 89篇 |
1987年 | 66篇 |
1986年 | 65篇 |
1985年 | 87篇 |
1984年 | 88篇 |
1983年 | 59篇 |
1982年 | 78篇 |
1981年 | 50篇 |
1980年 | 48篇 |
1979年 | 56篇 |
1978年 | 50篇 |
1977年 | 25篇 |
1976年 | 24篇 |
1975年 | 16篇 |
1974年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 703 毫秒
131.
This paper is based on the M. Sc. thesis written by the third author under the supervision of the first two authors. It was submitted to the University of Baghdad in 1986. 相似文献
132.
Summary We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.This author was visiting Harwell and was funded by a grant from the Italian National Council of Research (CNR), Istituto di Elaborazione dell'Informazione-CNR, via S. Maria 46, I-56100 Pisa, ItalyThis author was visiting Harwell from Faculty of Mathematics and Computer Science of the University of Amsterdam 相似文献
133.
Vsevolod K. Malinovskii 《Acta Appl Math》1994,34(1-2):261-281
Edgeworth expansions for the distribution of a sequential least squares estimator in the random coefficient autoregressive (RCA) model are derived. The regenerative approach to second-order asymptotic analysis of Markov-type statistical models is developed. 相似文献
134.
Multiderivations of Coxeter arrangements 总被引:3,自引:0,他引:3
Hiroaki Terao 《Inventiones Mathematicae》2002,148(3):659-674
Let V be an ℓ-dimensional Euclidean space. Let G⊂O(V) be a finite irreducible orthogonal reflection group. Let ? be the corresponding Coxeter arrangement. Let S be the algebra of polynomial functions on V. For H∈? choose α
H
∈V
* such that H=ker(α
H
). For each nonnegative integer m, define the derivation module D
(m)
(?)={θ∈Der
S
|θ(α
H
)∈Sα
m
H
}. The module is known to be a free S-module of rank ℓ by K. Saito (1975) for m=1 and L. Solomon-H. Terao (1998) for m=2. The main result of this paper is that this is the case for all m. Moreover we explicitly construct a basis for D
(m)
(?). Their degrees are all equal to mh/2 (when m is even) or are equal to ((m−1)h/2)+m
i
(1≤i≤ℓ) (when m is odd). Here m
1≤···≤m
ℓ are the exponents of G and h=m
ℓ+1 is the Coxeter number. The construction heavily uses the primitive derivation D which plays a central role in the theory of flat generators by K. Saito (or equivalently the Frobenius manifold structure
for the orbit space of G). Some new results concerning the primitive derivation D are obtained in the course of proof of the main result.
Oblatum 27-XI-2001 & 4-XII-2001?Published online: 18 February 2002 相似文献
135.
François Métayer 《Archive for Mathematical Logic》1994,33(3):169-188
This work defines homology groups for proof-structures in multiplicative linear logic (see [Gir1], [Gir2], [Dan]). We will show that these groups characterize proof-nets among arbitrary proof-structures, thus obtaining a new correctness criterion and of course a new polynomial algorithm for testing correctness. This homology also bears information on sequentialization. An unexpected geometrical interpretation of the linear connectives is given in the last section. This paper exclusively focuses onabstract proof-structures, i.e. paired-graphs. The relation with actual proofs is investigated in [Gir1], [Gir2], [Dan], [Ret] and [Tro]. 相似文献
136.
Hiroshi Sugita 《Probability Theory and Related Fields》1994,100(1):117-130
Summary We show that each holomorphic Wiener function has a skeleton which is intrinsic from several viewpoints. In particular, we study the topological aspects of the skeletons by using the local Taylor expansion for holomorphic Wiener functions.Supported in part by the Grant-in-Aid for Science Research 03740120 Min. Education 相似文献
137.
Hideaki Ishikawa 《Archiv der Mathematik》2002,79(6):439-448
In this paper we introduce a certain sum by using Dirichlet characters. We investigate the Riesz mean of the sum using the
analytic properties of the MultipleL-function systematically.
Eine überarbeitete Fassung ging am 6. 8. 2001 ein 相似文献
138.
多目标分数变分问题的对偶性 总被引:1,自引:0,他引:1
本文利用参数逼近在函数广义(F,ρ)-凸的条件下,建立了一类多目标式变分问题关于有效解的对偶理论。 相似文献
139.
Given an integer n ≥ 2, let λ(n) := (log n)/(log γ(n)), where γ(n) = Π
p|n p, stand for the index of composition of n, with λ(1) = 1. We study the distribution function of (λ(n) – 1) log n as n runs through particular sets of integers, such as the shifted primes, the values of a given irreducible cubic polynomial
and the shifted powerful numbers.
Research supported in part by a grant from NSERC.
Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA.
Professor M.V. Subbarao passed away on February 15, 2006.
Received: 3 March 2006 Revised: 28 October 2006 相似文献
140.
Denis V. Osin 《Archiv der Mathematik》2007,88(5):403-412
The aim of this paper is to show that free Burnside groups of sufficiently large odd exponent are non-amenable in a certain
strong sense. More precisely their left regular representations are isolated from the trivial representation uniformly on
finite generating sets. It follows that free Burnside groups are of uniform exponential growth. This answers a question of
de la Harpe.
This work has been partially supported by the NSF grant DMS-0605093 and by the RFBR Grant # 05-01-00892.
Received: 25 April 2006 相似文献