全文获取类型
收费全文 | 19812篇 |
免费 | 3756篇 |
国内免费 | 2847篇 |
专业分类
电工技术 | 4338篇 |
技术理论 | 2篇 |
综合类 | 1981篇 |
化学工业 | 426篇 |
金属工艺 | 152篇 |
机械仪表 | 1051篇 |
建筑科学 | 536篇 |
矿业工程 | 320篇 |
能源动力 | 596篇 |
轻工业 | 171篇 |
水利工程 | 492篇 |
石油天然气 | 185篇 |
武器工业 | 323篇 |
无线电 | 4104篇 |
一般工业技术 | 791篇 |
冶金工业 | 149篇 |
原子能技术 | 66篇 |
自动化技术 | 10732篇 |
出版年
2024年 | 136篇 |
2023年 | 492篇 |
2022年 | 885篇 |
2021年 | 1028篇 |
2020年 | 1136篇 |
2019年 | 903篇 |
2018年 | 855篇 |
2017年 | 1052篇 |
2016年 | 1147篇 |
2015年 | 1399篇 |
2014年 | 2056篇 |
2013年 | 1687篇 |
2012年 | 1939篇 |
2011年 | 1556篇 |
2010年 | 1088篇 |
2009年 | 1022篇 |
2008年 | 1035篇 |
2007年 | 1144篇 |
2006年 | 903篇 |
2005年 | 917篇 |
2004年 | 803篇 |
2003年 | 630篇 |
2002年 | 538篇 |
2001年 | 434篇 |
2000年 | 340篇 |
1999年 | 274篇 |
1998年 | 208篇 |
1997年 | 155篇 |
1996年 | 142篇 |
1995年 | 130篇 |
1994年 | 102篇 |
1993年 | 64篇 |
1992年 | 48篇 |
1991年 | 34篇 |
1990年 | 21篇 |
1989年 | 15篇 |
1988年 | 18篇 |
1987年 | 9篇 |
1986年 | 11篇 |
1985年 | 10篇 |
1984年 | 8篇 |
1983年 | 9篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1964年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
21.
改进型UDP组播的性能分析及其在实时电源控制系统中的应用 总被引:1,自引:0,他引:1
文章通过采用带连接的UDP、I/O复用技术、关闭UDP校验和功能、负载均衡等技术对普通的UDP组播技术进行改进,使之在每个控制周期(1ms)内满足了分布式实时控制系统的实时性和可靠性要求。在将改进型的UDP组播技术应用于实际控制系统之前,文中构建了一个模拟局域网进行测试,对比结果表明改进后的组播技术无论在数据包延迟、丢包率等方面较改进前的UDP组播性能有较大幅度的提高。 相似文献
22.
基于mobile agent的分布式网络自管理模型 总被引:2,自引:1,他引:1
为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题,提出了一种网络自管理模型,从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理;提出了管理定位服务这一关键技术,在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务;采用可伸缩的分布式体系结构,适应了大规模网络的规模可变性等特点;基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。 相似文献
23.
针对炼油企业供水系统存在问题,阐述了炼油厂分散型水源井智能化集中监控的技术方案.对监控系统的硬件结构、程序设计、功能、技术特点和可靠性设计进行了较详细的介绍. 相似文献
24.
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. 相似文献
25.
简要论述了集散控制系统的发展 ,根据火力发电厂的现场环境及实际情况 ,提出了火力发电厂集散控制系统的设计原则 ,并展望了集散控制系统的发展 相似文献
26.
27.
28.
29.
30.
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). 相似文献