全文获取类型
收费全文 | 2619篇 |
免费 | 181篇 |
国内免费 | 329篇 |
专业分类
化学 | 108篇 |
晶体学 | 1篇 |
力学 | 61篇 |
综合类 | 71篇 |
数学 | 2475篇 |
物理学 | 413篇 |
出版年
2024年 | 7篇 |
2023年 | 42篇 |
2022年 | 46篇 |
2021年 | 61篇 |
2020年 | 59篇 |
2019年 | 66篇 |
2018年 | 85篇 |
2017年 | 81篇 |
2016年 | 57篇 |
2015年 | 62篇 |
2014年 | 101篇 |
2013年 | 464篇 |
2012年 | 93篇 |
2011年 | 124篇 |
2010年 | 118篇 |
2009年 | 156篇 |
2008年 | 155篇 |
2007年 | 128篇 |
2006年 | 163篇 |
2005年 | 126篇 |
2004年 | 105篇 |
2003年 | 125篇 |
2002年 | 126篇 |
2001年 | 93篇 |
2000年 | 94篇 |
1999年 | 74篇 |
1998年 | 76篇 |
1997年 | 79篇 |
1996年 | 46篇 |
1995年 | 34篇 |
1994年 | 17篇 |
1993年 | 11篇 |
1992年 | 2篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有3129条查询结果,搜索用时 15 毫秒
11.
12.
In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation. 相似文献
13.
S. Juneja 《Queueing Systems》2007,57(2-3):115-127
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems
in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient
algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such
tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable
bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric
sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key
idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation
then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance
sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates
it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for
the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.
相似文献
14.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.
15.
切变模量和转动惯量实验的改进 总被引:2,自引:1,他引:1
设计了一种基于垂直轴定理的新型吊钩,对切变模量和转动惯量实验进行了改进,使之成为既可测定金属丝切变模量和环、柱等刚体的转动惯量,又可验证反映转动惯量重要性质的平行轴定理及垂直轴定理的多功能实验仪. 相似文献
16.
It is well known that S 12 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S 12 for provably weaker function classes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
17.
J. Freudenberger 《Discrete Applied Mathematics》2006,154(2):294-304
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent. 相似文献
18.
本文讨论临界可压缩模类和结合环的弱Jacobson根.首先,我们证明了非平凡的临界可压缩模类是素模的特殊类.其次,我们引入结合环的弱Jacobson根.弱Jaonbson根是特殊根.最后,我们给出有关弱本原环,半弱本原环和弱Jacobson根环的某些性质. 相似文献
19.
D是C^n空间中具有逐块C(1)边界的有界域,该文建立了D上一个具有离散局部全纯核的(0,q)形式的Koppelman积分公式及其相应的方程解的积分表示和它的内闭一致估计式。 相似文献
20.
Jonas Sderberg 《Journal of Algebra》2004,280(2):610-623
In order to use dualization to study Hilbert functions of artinian level algebras we extend the notion of level sequences and cancellable sequences, introduced by Geramita and Lorenzini, to include Hilbert functions of certain artinian modules. As in the case of algebras a level sequence is cancellable, but now by dualization its reverse is also cancellable which gives a new condition on level sequences. We also give a characterization of the cancellable sequences involving Macaulay representations. 相似文献