全文获取类型
收费全文 | 3222篇 |
免费 | 585篇 |
国内免费 | 200篇 |
专业分类
化学 | 585篇 |
晶体学 | 2篇 |
力学 | 194篇 |
综合类 | 48篇 |
数学 | 1545篇 |
物理学 | 458篇 |
无线电 | 1175篇 |
出版年
2024年 | 15篇 |
2023年 | 52篇 |
2022年 | 86篇 |
2021年 | 90篇 |
2020年 | 120篇 |
2019年 | 113篇 |
2018年 | 140篇 |
2017年 | 166篇 |
2016年 | 167篇 |
2015年 | 171篇 |
2014年 | 222篇 |
2013年 | 286篇 |
2012年 | 217篇 |
2011年 | 200篇 |
2010年 | 158篇 |
2009年 | 182篇 |
2008年 | 198篇 |
2007年 | 188篇 |
2006年 | 174篇 |
2005年 | 179篇 |
2004年 | 123篇 |
2003年 | 114篇 |
2002年 | 99篇 |
2001年 | 83篇 |
2000年 | 87篇 |
1999年 | 60篇 |
1998年 | 74篇 |
1997年 | 49篇 |
1996年 | 38篇 |
1995年 | 27篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 5篇 |
1984年 | 10篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有4007条查询结果,搜索用时 0 毫秒
1.
Yasoub Eghbali Mahmoud Ferdosizade Naeiny 《International Journal of Communication Systems》2020,33(14)
In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals. 相似文献
2.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
3.
Ieva
Dauickait Amos S. Lawless Jennifer A. Scott Peter Jan van Leeuwen 《Numerical Linear Algebra with Applications》2020,27(5)
We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds. 相似文献
4.
一种基于Normal基椭圆曲线密码芯片的设计 总被引:3,自引:3,他引:0
文章设计了一款椭圆曲线密码芯片。实现了GF(2^233)域上normal基椭圆曲线数字签名和认证。并支持椭圆曲线参数的用户配置。在VLSI的实现上,提出了一种新的可支持GF(2^233)域和GF(p)域并行运算的normal基椭圆曲线VLSI架构。其架构解决了以往GF(p)CA算迟后于GF(2^233)域运算的问题,从而提高了整个芯片的运算吞吐率。基于SMIC 0.18μm最坏的工艺,综合后关键路径最大时延3.8ns,面积18mm^2;考虑布局布线的影响,芯片的典型的情况下,每秒可实现8000次签名或4500次认证。 相似文献
5.
径向基函数神经网络的再学习算法及其应用 总被引:3,自引:1,他引:2
谭建辉 《微电子学与计算机》2006,23(5):115-117,120
为了应用径向基函数神经网络逐步地识别待研究系统,文章针对径向基函数神经网络的再学习算法开展了深入的研究.应用严格的数学推理方法,将径向基函数神经网络的再学习问题转化为矩阵求逆的附加运算.详细给出了径向基函数神经网络再学习算法中增加新训练样本和增加新基函数的数学公式,同时对如何获取新的训练样本进行了研究. 相似文献
6.
G. Montero L. Gonzlez E. Flrez M. D. García A. Surez 《Numerical Linear Algebra with Applications》2002,9(3):239-247
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??∥AM?I∥ F and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
7.
Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast. 相似文献
8.
E.A. Soliman A.K. Abdelmageed M.A. El-Gamal 《AEUE-International Journal of Electronics and Communications》2002,56(3)
In this paper a new artificial neural network (ANN) based model for the calculation of the method of moments (MoM) matrix elements is presented. Training sets that characterize the matrix elements are first constructed. These sets are then utilized to effectively train two radial basis function (RBF) neural networks to accurately estimate all the elements of the MoM matrix for any mesh used. The potential of the proposed approach is demonstrated in the case of a narrow microstrip line. The current distribution on the microstrip line produced by the trained RBF networks agrees very well with the exact distribution. In addition, the proposed ANN model is much faster than the conventional MoM procedure. 相似文献
9.
最速下降规则不失为一可用规则 总被引:5,自引:4,他引:1
本从统计意义上平均迭代次数的观点出发,指出求解线性规划的最速下降规则是可取的,好用的。 相似文献
10.
Johan Helsing 《BIT Numerical Mathematics》2006,46(2):307-323
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come
from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating
distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar
to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that
of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with
up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners
of otherwise similar construction, and especially so when the preconditioners are very sparse.
AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30 相似文献