全文获取类型
收费全文 | 23041篇 |
免费 | 3220篇 |
国内免费 | 739篇 |
专业分类
化学 | 998篇 |
晶体学 | 18篇 |
力学 | 1614篇 |
综合类 | 407篇 |
数学 | 7029篇 |
物理学 | 3669篇 |
无线电 | 13265篇 |
出版年
2024年 | 84篇 |
2023年 | 286篇 |
2022年 | 526篇 |
2021年 | 601篇 |
2020年 | 630篇 |
2019年 | 542篇 |
2018年 | 562篇 |
2017年 | 790篇 |
2016年 | 1027篇 |
2015年 | 1023篇 |
2014年 | 1630篇 |
2013年 | 1583篇 |
2012年 | 1581篇 |
2011年 | 1744篇 |
2010年 | 1241篇 |
2009年 | 1384篇 |
2008年 | 1536篇 |
2007年 | 1583篇 |
2006年 | 1373篇 |
2005年 | 1187篇 |
2004年 | 991篇 |
2003年 | 852篇 |
2002年 | 744篇 |
2001年 | 558篇 |
2000年 | 527篇 |
1999年 | 382篇 |
1998年 | 370篇 |
1997年 | 299篇 |
1996年 | 273篇 |
1995年 | 201篇 |
1994年 | 149篇 |
1993年 | 139篇 |
1992年 | 119篇 |
1991年 | 60篇 |
1990年 | 70篇 |
1989年 | 48篇 |
1988年 | 49篇 |
1987年 | 33篇 |
1986年 | 41篇 |
1985年 | 42篇 |
1984年 | 40篇 |
1983年 | 11篇 |
1982年 | 28篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 10篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1959年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
研究了基于EDGE系统接收机中信道估计的实现方案,并对算法的各项性能做出评估。首先论述了算法的采用及其理论依据。接着,说明了信道预估计的原理及方法。最后,针对MAT-LAB及 DSP上的仿真结果,比较了各项系数对于系统性能改善所具有的影响和作用,对系统特性作了较为详细的分析总结。 相似文献
32.
In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively. 相似文献
33.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
34.
本文是文[1-7]的继续,研究变权综合问题,从确定变权的经验公式入手引出了变权原理,给出了变权的公理化定义,讨论了与之有关的均衡函数及其梯度向量。 相似文献
35.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
36.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
37.
The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50×50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes. 相似文献
38.
四气门发动机可变涡流稀薄燃烧特性研究 总被引:1,自引:0,他引:1
本文研究了可变涡流对四气门发动机稀薄燃烧特性的影响情况。在稀薄燃烧情况下,发动机负荷大小对CO和HC排放的影响不大,对NOx排放的影响主要表现在对13~17空燃比范围内NOx排放的影响,负荷越大,NOx排放越大;对空燃比小于13或大于17以后的NOx排放影响较小。阀片位置对发动机排放特性的影响较小,对发动机的燃油经济性存在一定影响,这是因为不同阀片位置的进气涡流比不同所致,同时也表明较强的涡流运动对燃油经济性更有利。涡流运动在不同转速条件下对发动机燃油经济性的影响情况不同,它更有利于改善低速条件下的燃油经济性。 相似文献
39.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
40.
R. J. Vanderbei 《Mathematical Programming》1989,43(1-3):31-44
The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual. 相似文献