全文获取类型
收费全文 | 3858篇 |
免费 | 447篇 |
国内免费 | 309篇 |
专业分类
电工技术 | 64篇 |
技术理论 | 1篇 |
综合类 | 327篇 |
化学工业 | 45篇 |
金属工艺 | 10篇 |
机械仪表 | 79篇 |
建筑科学 | 135篇 |
矿业工程 | 26篇 |
能源动力 | 15篇 |
轻工业 | 18篇 |
水利工程 | 35篇 |
石油天然气 | 26篇 |
武器工业 | 20篇 |
无线电 | 653篇 |
一般工业技术 | 218篇 |
冶金工业 | 120篇 |
原子能技术 | 5篇 |
自动化技术 | 2817篇 |
出版年
2024年 | 16篇 |
2023年 | 25篇 |
2022年 | 45篇 |
2021年 | 62篇 |
2020年 | 71篇 |
2019年 | 83篇 |
2018年 | 84篇 |
2017年 | 111篇 |
2016年 | 123篇 |
2015年 | 116篇 |
2014年 | 196篇 |
2013年 | 274篇 |
2012年 | 235篇 |
2011年 | 306篇 |
2010年 | 210篇 |
2009年 | 261篇 |
2008年 | 273篇 |
2007年 | 286篇 |
2006年 | 227篇 |
2005年 | 210篇 |
2004年 | 185篇 |
2003年 | 160篇 |
2002年 | 122篇 |
2001年 | 109篇 |
2000年 | 84篇 |
1999年 | 82篇 |
1998年 | 72篇 |
1997年 | 42篇 |
1996年 | 60篇 |
1995年 | 46篇 |
1994年 | 50篇 |
1993年 | 34篇 |
1992年 | 36篇 |
1991年 | 28篇 |
1990年 | 21篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 21篇 |
1984年 | 23篇 |
1983年 | 25篇 |
1982年 | 26篇 |
1981年 | 21篇 |
1980年 | 25篇 |
1979年 | 29篇 |
1978年 | 10篇 |
1977年 | 6篇 |
1976年 | 12篇 |
1964年 | 5篇 |
排序方式: 共有4614条查询结果,搜索用时 15 毫秒
151.
A novel adaptive steganography based on local complexity and human vision sensitivity 总被引:2,自引:0,他引:2
Der-Chyuan Lou Author Vitae Author Vitae Chung-Ming Wang Author Vitae Author Vitae Chwei-Shyong Tsai Author Vitae 《Journal of Systems and Software》2010,83(7):1236-1248
This paper presents a novel adaptive steganographic scheme that is capable of both preventing visual degradation and providing a large embedding capacity. The embedding capacity of each pixel is dynamically determined by the local complexity of the cover image, allowing us to maintain good visual quality as well as embedding a large amount of secret messages. We classify pixels into three levels based on the variance of the local complexity of the cover image. When determining which level of local complexity a pixel should belong to, we take human vision sensitivity into consideration. This ensures that the visual artifacts appeared in the stego image are imperceptible, and the difference between the original and stego image is indistinguishable by the human visual system. The pixel classification assures that the embedding capacity offered by a cover image is bounded by the embedding capacity imposed on three levels that are distinguished by two boundary thresholds values. This allows us to derive a combination ratio of the maximal embedding capacity encountered with at each level. Consequently, our scheme is capable of determining two threshold values according to the desired demand of the embedding capacity requested by the user. Experimental results demonstrated that our adaptive steganographic algorithm produces insignificant visual distortion due to the hidden message. It provides high embedding capacity superior to that offered by a number of existing schemes. Our algorithm can resist the RS steganalysis attack, and it is statistically invisible for the attack of histogram comparison. The proposed scheme is simple, efficient and feasible for adaptive steganographic applications. 相似文献
152.
Animated meshes are often represented by a sequence of static meshes with constant connectivity. Due to their frame-based representation they usually occupy a vast amount of bandwidth or disk space. We present a fast and efficient scalable predictive coding (SPC) scheme for frame-based representations of animated meshes. SPC decomposes animated meshes in spatial and temporal layers which are efficiently encoded in one pass through the animation. Coding is performed in a streamable and scalable fashion. Dependencies between neighbouring spatial and temporal layers are predictively exploited using the already encoded spatio-temporal neighbourhood. Prediction is performed in the space of rotation-invariant coordinates compensating local rigid motion. SPC supports spatial and temporal scalability, and it enables efficient compression as well as fast encoding and decoding. Parts of SPC were adopted in the MPEG-4 FAMC standard. However, SPC significantly outperforms the streaming mode of FAMC with coding gains of over 33%, while in comparison to the scalable FAMC, SPC achieves coding gains of up to 15%. SPC has the additional advantage over FAMC of achieving real-time encoding and decoding rates while having only low memory requirements. Compared to some other non-scalable state-of-the-art approaches, SPC shows superior compression performance with gains of over 16% in bit-rate. 相似文献
153.
边赋非负权无向简单图的一簇顶点两两不相交的子树称为它的一个d-子树划分(d为非负实数),如果这些子树的顶点集的并等于此图的顶点集,且每棵子树的直径不超过d.图的d-子树划分问题就是求它的一个含子树数最少的d-子树划分及其所含的子树数.d-子树划分问题在有线通信网络、道路交通网络、城市供水网络、电力传输网络等网络的运行管理、维护与测试中具有很强的应用背景.文中证明了对任意正实数d,边赋非负权二分平面图的d-子树划分问题是NP-完全问题;提出了求解边赋非负权树d-子树划分问题的一个线性时间算法,详细地讨论了算法的实现策略.所提出的算法具有简明易实现、耗费时间少等特点. 相似文献
154.
基于视觉权值的分块颜色直方图图像检索算法 总被引:4,自引:0,他引:4
为了进一步提高基于颜色直方图的图像检索系统工作效率, 本文以人眼视觉感知特性为基础, 结合局部图像相关性, 提出了一种基于视觉权值的分块颜色直方图图像检索新方法. 该方法首先对图像进行分块处理, 并计算出图像子块的颜色直方图; 然后结合反映局部区域变化的像素点颜色复杂度, 计算出图像子块的视觉权值; 最后利用视觉权值对子块颜色直方图进行加权处理, 并根据加权颜色直方图进行图像检索. 仿真实验结果表明, 本文算法能够准确和高效地查找出用户所需内容的彩色图像, 并且具有较好的查准率和查全率. 相似文献
155.
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n. 相似文献
156.
Luis M. Torres Ramiro Torres Ralf Borndörfer Marc E. Pfetsch 《International Transactions in Operational Research》2011,18(4):455-472
We discuss an optimization model for the line planning problem in public transport in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the computational complexity of this problem for tree network topologies as well as several categories of line operations that are important for the Quito Trolebús system. In practice, these instances can be solved quite well, and significant optimization potentials can be demonstrated. 相似文献
157.
近来一些学者用差别矩阵或差别矩阵的思想设计了基于正区域的属性约简算法.由于计算差别矩阵是一个既消耗时间又消耗空间的过程,故这些算法的效率并不好.为了降低这类属性约简算法的复杂度,文中利用基于区分对象对的属性约简的思想,在简化决策表的基础上,定义了一个函数,该函数能度量简化决策表中条件属性集产生的区分对象对的个数,并用该函数设计了一个启发函数,同时给出了计算该启发函数的快速算法,经分析其时间和空间复杂度均为O(|U/C|).最后用该启发函数设计了一个有效的基于正区域的属性约简算法,该算法的时间复杂度降为O(|C||U|),空间复杂度降为O(|U|).文中还用一个具体实例说明了新算法的有效性.经实验证明,新算法具有较高的效率. 相似文献
158.
最坏情况下#SAT问题上界的研究已成为一个热门的研究领域.#SAT问题的时间复杂性是根据问题实例的大小所组成的函数计算所得.#SAT问题实例的大小不仅依赖于变量的数量,还依赖于子句的数量.以子句数量为参数研究#SAT问题在最坏情况下的上界,不仅可以从另一个角度衡量算法的好坏,而且在某种程度上更能准确地反映出算法的性能.首先从子句数量的角度证明了之前提出的基于扩展规则的模型计数算法(CER算法)的上界O(2m),其中m是公式中子句的数量.为了提高#3-SAT问题的求解效率,采用了多种分裂规则,进一步给出了一种基于Davis-Putnam-Logemann-Loveland(DPLL)的#3-SAT算法MCDP.通过分析该算法得到了以子句数量为参数的#3-SAT问题在最坏情况下的上界O(1.8393m). 相似文献
159.
160.