全文获取类型
收费全文 | 3661篇 |
免费 | 407篇 |
国内免费 | 194篇 |
专业分类
化学 | 916篇 |
晶体学 | 2篇 |
力学 | 100篇 |
综合类 | 29篇 |
数学 | 875篇 |
物理学 | 528篇 |
无线电 | 1812篇 |
出版年
2024年 | 9篇 |
2023年 | 50篇 |
2022年 | 80篇 |
2021年 | 95篇 |
2020年 | 110篇 |
2019年 | 85篇 |
2018年 | 74篇 |
2017年 | 132篇 |
2016年 | 133篇 |
2015年 | 139篇 |
2014年 | 202篇 |
2013年 | 340篇 |
2012年 | 255篇 |
2011年 | 255篇 |
2010年 | 203篇 |
2009年 | 186篇 |
2008年 | 171篇 |
2007年 | 239篇 |
2006年 | 200篇 |
2005年 | 163篇 |
2004年 | 172篇 |
2003年 | 145篇 |
2002年 | 107篇 |
2001年 | 105篇 |
2000年 | 87篇 |
1999年 | 94篇 |
1998年 | 67篇 |
1997年 | 60篇 |
1996年 | 50篇 |
1995年 | 54篇 |
1994年 | 36篇 |
1993年 | 28篇 |
1992年 | 17篇 |
1991年 | 22篇 |
1990年 | 3篇 |
1989年 | 11篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 15篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有4262条查询结果,搜索用时 15 毫秒
21.
8bit嵌入式单片机系统A/D变换的两个关键指标是有效分辨率和信噪比(SNR)。通过对过采样(Over sample)和求均值(Average)理论的分析,得出“对噪声源的特性为白噪声的信号,每增加一位分辨率可以通过用4倍的过采样频率进行采样来达到。而分辨率每增加一位将使SNR增加6dB”的结论。进而采用8bit徽处理器内嵌12bit ADC成功实现了16bit ADC的精度,即小数点后两位(25.99℃)的温度测量,和小数点后四位(2.4299 V)的直流电压测量. 相似文献
22.
自适应RBF神经网络在CDMA移动通信上行链路功率控制中的应用研究 总被引:1,自引:0,他引:1
提出了一种自适应RBF神经网络功率控制方案。详细研究了该网络在DS-CDMA通信中,进行上行链路闭环功率控制(基于信扰比(SIR))的应用理论,给出了该网络参数的计算方法。最后用计算机仿真法模拟出该控制器的运行性能。结果表明基于SIR的自适应RBF神经网络功率控制器能自适应地调整移动台的发射功率,使基站接收信号的信扰比始终非常接近于一个常数,且有比定步长功率控制更小的SIR跟踪误差,从而可以降低接收信号的中断概率、提高信道容量。 相似文献
23.
In this article, a kind of auxiliary design BSA* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007 相似文献
24.
利用倍频器,将重复频率与连续信号t(t)的频率相同的方波进行若干次倍频后,对连续信号进行抽样,从而获得离散的抽样信号fs(t),再利用有源低通滤波器使其复原成连续信号f(t)。避免了一般抽样器不便于观测的缺点。 相似文献
25.
Chen-liang Li Jin-ping Zeng 《应用数学学报(英文版)》2007,23(1):79-90
We consider several synchronous and asynchronous multisplitting iteration schemes for solving aclass of nonlinear complementarity problems with the system matrix being an H-matrix.We establish theconvergence theorems for the schemes.The numerical experiments show that the schemes are efficient forsolving the class of nonlinear complementarity problems. 相似文献
26.
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.
相似文献
27.
F. Sibel Salman Jayant R. Kalagnanam Sesh Murthy Andrew Davenport 《Journal of Heuristics》2002,8(2):215-239
For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms. 相似文献
28.
The aim of this article is to derive stable generalized sampling in a shift-invariant space by using some special dual frames in L2(0,1). These sampling formulas involve samples of filtered versions of the functions in the shift-invariant space. The involved samples are expressed as the frame coefficients of an appropriate function in L2(0,1) with respect to some particular frame in L2(0,1). Since any shift-invariant space with stable generator is the image of L2(0,1) by means of a bounded invertible operator, our generalized sampling is derived from some dual frame expansions in L2(0,1). 相似文献
29.
Aliasing effects are investigated for spherical random fields sampled on a finite grid. Using the spherical harmonics expansion, it is shown that for a band-limited spherical random field its trend and spectrum can be uniquely reconstructed from the sampled field if the sampling points are judiciously designed. Analytical expressions are also obtained for aliasing errors in the trend and the spectrum when the field is not band-limited. 相似文献
30.