全文获取类型
收费全文 | 18652篇 |
免费 | 3159篇 |
国内免费 | 2145篇 |
专业分类
电工技术 | 4218篇 |
综合类 | 2091篇 |
化学工业 | 344篇 |
金属工艺 | 272篇 |
机械仪表 | 1014篇 |
建筑科学 | 1199篇 |
矿业工程 | 329篇 |
能源动力 | 553篇 |
轻工业 | 260篇 |
水利工程 | 454篇 |
石油天然气 | 184篇 |
武器工业 | 163篇 |
无线电 | 2801篇 |
一般工业技术 | 741篇 |
冶金工业 | 298篇 |
原子能技术 | 84篇 |
自动化技术 | 8951篇 |
出版年
2024年 | 119篇 |
2023年 | 337篇 |
2022年 | 561篇 |
2021年 | 655篇 |
2020年 | 751篇 |
2019年 | 654篇 |
2018年 | 569篇 |
2017年 | 758篇 |
2016年 | 817篇 |
2015年 | 901篇 |
2014年 | 1315篇 |
2013年 | 1212篇 |
2012年 | 1464篇 |
2011年 | 1427篇 |
2010年 | 1160篇 |
2009年 | 1184篇 |
2008年 | 1277篇 |
2007年 | 1452篇 |
2006年 | 1134篇 |
2005年 | 1153篇 |
2004年 | 986篇 |
2003年 | 815篇 |
2002年 | 665篇 |
2001年 | 550篇 |
2000年 | 419篇 |
1999年 | 340篇 |
1998年 | 249篇 |
1997年 | 198篇 |
1996年 | 164篇 |
1995年 | 161篇 |
1994年 | 135篇 |
1993年 | 77篇 |
1992年 | 62篇 |
1991年 | 52篇 |
1990年 | 31篇 |
1989年 | 17篇 |
1988年 | 19篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 16篇 |
1984年 | 7篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 12篇 |
1979年 | 13篇 |
1978年 | 8篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
11.
基于mobile agent的分布式网络自管理模型 总被引:2,自引:1,他引:1
为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题,提出了一种网络自管理模型,从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理;提出了管理定位服务这一关键技术,在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务;采用可伸缩的分布式体系结构,适应了大规模网络的规模可变性等特点;基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。 相似文献
12.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
13.
简要论述了集散控制系统的发展 ,根据火力发电厂的现场环境及实际情况 ,提出了火力发电厂集散控制系统的设计原则 ,并展望了集散控制系统的发展 相似文献
14.
15.
基于粗糙集信息观的决策表属性约简方法 总被引:2,自引:0,他引:2
粗糙集理论是近年来发展起来的一种有效的处理不精确、不确定、含糊信息的数学理论方法,它被广泛应用于相容和不相容决策表的属性约简和核属性计算。利用反例指出目前基于粗糙集信息观[2、6]的决策表属性约简和核属性计算方法的局限性。对决策表的性质作了深入的研究,研究发现文献[2、6]方法的不足原因是:它们没有考虑U/ind(C)中等价类的相客性。给出了基于U/ind(C)中等价类相客性的属性约简定义和核属性定义,并给出了一种新的基于粗糙集信息观的决策表属性约简和核属性计算方法。讨论了该方法同文献[2、6]方法的区别。最后用相同实例验证了该方法的有效性。 相似文献
16.
论文从映射的角度,将哈希函数分为三类:严格哈希函数、计算哈希函数和实用哈希函数。在此基础上,根据二元域上二次方程x2 x c=0的部分不可解的性质,构造了一种计算哈希函数,它满足单向性和一一对应性,同时具有运算速度快的优点。 相似文献
17.
18.
19.
20.
Javier Ramírez Antonio García Uwe Meyer-Bäse Fred Taylor Antonio Lloris 《The Journal of VLSI Signal Processing》2003,33(1-2):171-190
Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength). 相似文献