全文获取类型
收费全文 | 19327篇 |
免费 | 2667篇 |
国内免费 | 543篇 |
专业分类
化学 | 753篇 |
晶体学 | 14篇 |
力学 | 1032篇 |
综合类 | 324篇 |
数学 | 5486篇 |
物理学 | 2806篇 |
无线电 | 12122篇 |
出版年
2024年 | 73篇 |
2023年 | 253篇 |
2022年 | 441篇 |
2021年 | 519篇 |
2020年 | 517篇 |
2019年 | 445篇 |
2018年 | 460篇 |
2017年 | 657篇 |
2016年 | 871篇 |
2015年 | 884篇 |
2014年 | 1422篇 |
2013年 | 1331篇 |
2012年 | 1363篇 |
2011年 | 1489篇 |
2010年 | 1032篇 |
2009年 | 1174篇 |
2008年 | 1305篇 |
2007年 | 1357篇 |
2006年 | 1140篇 |
2005年 | 947篇 |
2004年 | 798篇 |
2003年 | 696篇 |
2002年 | 601篇 |
2001年 | 465篇 |
2000年 | 419篇 |
1999年 | 310篇 |
1998年 | 294篇 |
1997年 | 243篇 |
1996年 | 216篇 |
1995年 | 149篇 |
1994年 | 103篇 |
1993年 | 113篇 |
1992年 | 98篇 |
1991年 | 43篇 |
1990年 | 55篇 |
1989年 | 34篇 |
1988年 | 39篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 10篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
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. 相似文献
32.
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. 相似文献
33.
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. 相似文献
34.
35.
基于DOCSIS标准的增强型基线保密性接口(BPI+)采用56bit DES加密分组数据,采用二密钥三重DES加密通信量加密密钥。这种多重加密技术的应用为HFC网络的数据传输提供了相当于或更好于专线级的网络安全与加密性能。 相似文献
36.
本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法,该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法,能够较快的收敛到最佳的功率点。同时,易于用硬件和软件实现。 相似文献
37.
L. Aggoun 《Mathematical and Computer Modelling》2002,36(11-13)
In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model. 相似文献
38.
基于局部多项式逼近的变参数梯度估计算法 总被引:1,自引:0,他引:1
本文分析了梯度辨识算法跟踪时变系统的缺点,提出了一种新的基于局部多项式逼近的变参数梯度估计算法。本算法具有良好跟踪性能特别适用于时变系统跟踪且其对噪声的敏感程度与一般梯度估计方法相当。仿真结果验证了其良好性能。 相似文献
39.
R. S. Martynov Yu. M. Nechepurenko 《Computational Mathematics and Mathematical Physics》2006,46(7):1155-1167
For a discrete linear stochastic dynamical system, computation of the response matrix to the external action from a subspace using given observational data is examined. An algorithm is proposed and substantiated that makes it possible to improve the numerical accuracy and to reduce the amount of observational data compared to the general case where an arbitrary external action is allowed. As an illustration, a discrete system arising in the analysis of a linear stochastic dynamical continuous-time system is considered more thoroughly. Some numerical results are presented. 相似文献
40.
A. A. Abramov S. V. Kurochkin 《Computational Mathematics and Mathematical Physics》2006,46(6):949-954
A new method for calculating the radial spheroidal functions of the first kind is proposed for the arguments that are greater than unity in modulus. A well-known representation of these functions is refined and used for this purpose. The constructs and the software implementation proposed in the paper provide an efficient tool for the calculation of the functions with a desired accuracy in a wide range of parameters. 相似文献