全文获取类型
收费全文 | 2254篇 |
免费 | 179篇 |
国内免费 | 178篇 |
专业分类
化学 | 83篇 |
晶体学 | 2篇 |
力学 | 114篇 |
综合类 | 45篇 |
数学 | 1618篇 |
物理学 | 149篇 |
无线电 | 600篇 |
出版年
2024年 | 2篇 |
2023年 | 21篇 |
2022年 | 34篇 |
2021年 | 27篇 |
2020年 | 55篇 |
2019年 | 51篇 |
2018年 | 55篇 |
2017年 | 70篇 |
2016年 | 55篇 |
2015年 | 48篇 |
2014年 | 97篇 |
2013年 | 204篇 |
2012年 | 96篇 |
2011年 | 101篇 |
2010年 | 88篇 |
2009年 | 111篇 |
2008年 | 154篇 |
2007年 | 144篇 |
2006年 | 163篇 |
2005年 | 112篇 |
2004年 | 128篇 |
2003年 | 128篇 |
2002年 | 117篇 |
2001年 | 80篇 |
2000年 | 99篇 |
1999年 | 65篇 |
1998年 | 58篇 |
1997年 | 53篇 |
1996年 | 45篇 |
1995年 | 19篇 |
1994年 | 24篇 |
1993年 | 19篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 10篇 |
1988年 | 3篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1975年 | 2篇 |
排序方式: 共有2611条查询结果,搜索用时 15 毫秒
141.
142.
To estimate geometrically regular images in the white noise model and obtain an adaptive near asymptotic minimaxity result, we consider a model selection based bandlet estimator. This bandlet estimator combines the best basis selection behavior of the model selection and the approximation properties of the bandlet dictionary. We derive its near asymptotic minimaxity for geometrically regular images as an example of model selection with general dictionary of orthogonal bases. This paper is thus also a self-contained tutorial on model selection with orthogonal bases dictionary. 相似文献
143.
本文给出了基本的弱正则*-半群的一个结构定理.作为这一结构定理的特 殊情形,基本的正则*-半群的一个新的结构被给出. 相似文献
144.
基于Delphi的屏幕录像实现 总被引:1,自引:0,他引:1
邹瑛 《信息安全与通信保密》2011,9(7):48-50
这里详述了屏幕录像的基本原理和屏幕录像方式:当前活动窗体录像、全屏录像和自由指定区域录像的位图获取方式;对MPEG4编码基本原理及视频流结构进行了分析,基于Delphi面向对象编程思想设计了一个MPEG4编码器,可完成I帧与P帧模式的图像编码;按一定的帧率将获取的屏幕位图数据经MPEG4编码器压缩后得到MPEG4视频流,写入到录像文件,经测试,录制效果良好,可清晰流畅播放。 相似文献
145.
146.
In order to solve the problem that the load of big data stream computing platform fluctuates drastically while the cluster was suffering from the performance bottleneck due to the shortage of computing resources,the load prediction based elastic resource scheduling strategy in Flink (LPERS-Flink) was proposed.Firstly,the load prediction model was set up as the foundation to propose the load prediction algorithm and predict the variation tendency of the processing load.Secondly,the resource judgment model was set up to identify the performance bottleneck and resource redundancy of the cluster while the resource scheduling algorithm was proposed to draw up the resource rescheduling plan.Finally,the online load migration algorithm was proposed to execute the resource rescheduling plan and migrate processing load among nodes efficiently.The experimental results show that the strategy provides better performance promotion in the application with drastically fluctuating processing load.The scale and resource configuration of the cluster responded to the variation of processing load in time and the communication overhead of the load migration was reduced effectively. 相似文献
147.
V. V. Pupyshev 《Theoretical and Mathematical Physics》2008,156(1):1058-1074
We study the two-and three-dimensional Faddeev equations for a three-particle system with central or S-wave pair interactions.
The regular solutions of such equations are represented as infinite series in integer powers of the distance between two particles
and the sought functions of the other three-particle coordinates. Constructing such functions reduces to solving algebraic
recurrence relations. We derive the boundary conditions at the pair impact point for the regular solutions of the Faddeev
equations.
__________
Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 156, No. 1, pp. 112–130, July, 2008. 相似文献
148.
1.IntroductionInreliabilitytheory,inordertocalculatethefailurefrequencyofarepairablesystem,Shily]firstintroducedandstudiedthetransitionfrequencybetweentwodisjointstatesetsforafiniteMarkovchainandavectorMarkovprocesswithfinitediscretestatespaceandobtainedageneralformulaoftransitionfrequency.Then,ontheconditionthatthegeneratormatrixofMarkovchainisuniformlybounded,Shi[8'9]againprovedthetransitionfrequencyformulaandobtainedthreeotherusefulformulas.Obviously,thepoint(orcalledcounting)processofsta… 相似文献
149.
150.
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r‐regular uniquely hamiltonian graphs when r > 22. This improves upon earlier results of Thomassen. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 233–244, 2007 相似文献