全文获取类型
收费全文 | 2981篇 |
免费 | 456篇 |
国内免费 | 134篇 |
专业分类
化学 | 188篇 |
晶体学 | 2篇 |
力学 | 373篇 |
综合类 | 18篇 |
数学 | 189篇 |
物理学 | 858篇 |
无线电 | 1943篇 |
出版年
2024年 | 5篇 |
2023年 | 21篇 |
2022年 | 52篇 |
2021年 | 84篇 |
2020年 | 82篇 |
2019年 | 57篇 |
2018年 | 56篇 |
2017年 | 80篇 |
2016年 | 109篇 |
2015年 | 105篇 |
2014年 | 165篇 |
2013年 | 173篇 |
2012年 | 167篇 |
2011年 | 197篇 |
2010年 | 167篇 |
2009年 | 170篇 |
2008年 | 193篇 |
2007年 | 224篇 |
2006年 | 194篇 |
2005年 | 174篇 |
2004年 | 166篇 |
2003年 | 151篇 |
2002年 | 124篇 |
2001年 | 102篇 |
2000年 | 87篇 |
1999年 | 69篇 |
1998年 | 79篇 |
1997年 | 58篇 |
1996年 | 58篇 |
1995年 | 44篇 |
1994年 | 32篇 |
1993年 | 28篇 |
1992年 | 24篇 |
1991年 | 18篇 |
1990年 | 16篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1976年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有3571条查询结果,搜索用时 12 毫秒
61.
针对JPEG2000图像压缩标准所具有的渐进传输、一次编码多次解码等特性,提出了一种基于图像特征的鲁棒性图像认证算法.该算法在JPEG2000编码过程中,先根据图像不变特征,生成认证水印,再根据实际的鲁棒性认证需求,在量化后的小波系数中确定每个子带的认证水印嵌入位平面,最后基于小波系数位平面的特征嵌入认证水印.算法不仅能适应JPEG2000各种灵活的编码方式,还能定位图像篡改的位置.实验结果验证了图像认证算法对可允许图像操作的鲁棒性以及对图像篡改的敏感性. 相似文献
62.
基于幅度统计多分辨率分析的SAR图像灰度压缩 总被引:3,自引:0,他引:3
基于幅度统计多分辨率分析的原理,针对SAR图像特殊的显示要求,提出了一种新的灰度压缩方法,解决了常规灰度级压缩方法不能很好保持原始图像数据直方图分布的问题,实验结果表明该方法能有效保证灰度压缩前后图像数据直方图分布形状的一致性,较好地保持原始图像的视觉特征。 相似文献
63.
I. J. Gnip S. I. Vaitkus V. I. Kersulis S. A. Veyelis 《Mechanics of Composite Materials》2007,43(5):433-444
The results obtained in an experimental investigation of deformability of expanded polystyrene (EPS) under short-term compression
are presented. The density of EPS varied from 13 to 28 kg/m3. The method of design of experiments was used to determine the elastic modulus and the ultimate strain (corresponding to
the end of quasi-linear deformability) under compression stresses operating perpendicularly and parallel to the faces of EPS
products. A graphical interpretation of the models is also presented. Based on the experimental data obtained, it was concluded
that the expanded polystyrene was homogeneous in mutually perpendicular planes with respect to its deformability in compression.
__________
Translated from Mekhanika Kompozitnykh Materialov, Vol. 43, No. 5, pp. 639–656, September–October, 2007. 相似文献
64.
Dominic Brenner Andreas Dellnitz Wilhelm Rödder 《The Journal of mathematical sociology》2017,41(2):84-103
To detect and study cohesive subgroups of actors is a main objective in social network analysis. What are the respective relations inside such groups and what separates them from the outside. Entropy-based analysis of network structures is an up-and-coming approach. It turns out to be a powerful instrument to detect certain forms of cohesive subgroups and to compress them to superactors without loss of information about their embeddedness in the net: Compressing strongly connected subgroups leaves the whole net’s and the (super-)actors’ information theoretical indices unchanged; i.e., such compression is information-invariant. The actual article relates on the reduction of networks with hundreds of actors. All entropy-based calculations are realized in an expert system shell. 相似文献
65.
66.
在完备的度量空间中,讨论了一类新型的非线性压缩映射ρ(Tx,Ty)≤a(ρ(x,y))ρ(x,Tx)+b(ρ(x,y))ρ(y,Ty)+c(ρ(x,y))ρ(x,y)通过构造迭代序列,指出该映射的不动点的存在性和唯一性,并给出相应的误差估计式,拓展和改进了有关文献的范围. 相似文献
67.
68.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献
69.
Near Best Tree Approximation 总被引:2,自引:0,他引:2
Baraniuk R.G. DeVore R.A. Kyriazis G. Yu X.M. 《Advances in Computational Mathematics》2002,16(4):357-373
Tree approximation is a form of nonlinear wavelet approximation that appears naturally in applications such as image compression and entropy encoding. The distinction between tree approximation and the more familiar n-term wavelet approximation is that the wavelets appearing in the approximant are required to align themselves in a certain connected tree structure. This makes their positions easy to encode. Previous work [4,6] has established upper bounds for the error of tree approximation for certain (Besov) classes of functions. This paper, in contrast, studies tree approximation of individual functions with the aim of characterizing those functions with a prescribed approximation error. We accomplish this in the case that the approximation error is measured in L
2, or in the case p2, in the Besov spaces B
p
0(L
p
), which are close to (but not the same as) L
p
. Our characterization of functions with a prescribed approximation order in these cases is given in terms of a certain maximal function applied to the wavelet coefficients. 相似文献
70.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献