全文获取类型
收费全文 | 163247篇 |
免费 | 19730篇 |
国内免费 | 13659篇 |
专业分类
电工技术 | 16030篇 |
技术理论 | 1篇 |
综合类 | 17239篇 |
化学工业 | 20964篇 |
金属工艺 | 11275篇 |
机械仪表 | 11497篇 |
建筑科学 | 12332篇 |
矿业工程 | 6167篇 |
能源动力 | 4559篇 |
轻工业 | 18060篇 |
水利工程 | 5963篇 |
石油天然气 | 5188篇 |
武器工业 | 2513篇 |
无线电 | 17127篇 |
一般工业技术 | 14413篇 |
冶金工业 | 5657篇 |
原子能技术 | 2600篇 |
自动化技术 | 25051篇 |
出版年
2024年 | 819篇 |
2023年 | 2535篇 |
2022年 | 6318篇 |
2021年 | 7970篇 |
2020年 | 5710篇 |
2019年 | 4094篇 |
2018年 | 4371篇 |
2017年 | 4855篇 |
2016年 | 4489篇 |
2015年 | 7014篇 |
2014年 | 9012篇 |
2013年 | 10472篇 |
2012年 | 13523篇 |
2011年 | 13904篇 |
2010年 | 13127篇 |
2009年 | 12873篇 |
2008年 | 13277篇 |
2007年 | 13180篇 |
2006年 | 11531篇 |
2005年 | 9280篇 |
2004年 | 6834篇 |
2003年 | 4724篇 |
2002年 | 4556篇 |
2001年 | 4055篇 |
2000年 | 3221篇 |
1999年 | 1416篇 |
1998年 | 617篇 |
1997年 | 470篇 |
1996年 | 386篇 |
1995年 | 324篇 |
1994年 | 255篇 |
1993年 | 217篇 |
1992年 | 196篇 |
1991年 | 143篇 |
1990年 | 151篇 |
1989年 | 141篇 |
1988年 | 100篇 |
1987年 | 67篇 |
1986年 | 80篇 |
1985年 | 28篇 |
1984年 | 39篇 |
1983年 | 28篇 |
1982年 | 21篇 |
1981年 | 24篇 |
1980年 | 52篇 |
1979年 | 39篇 |
1977年 | 3篇 |
1976年 | 8篇 |
1959年 | 29篇 |
1951年 | 49篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
72.
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. 相似文献
73.
针对目前地区电网电压无功控制的现状,提出了电网电压无功监控系统的设计方案。说明优化控制系统应该实现的功能,选用线性规划(LP)算法为核心程序,正常状态下以有功网损最小为目标函数。依据分离原理提出两层分级控制的系统结构,分析优化控制系统的工作流程及特点。 相似文献
74.
基于混合智能的多Agent个性化信息推荐 总被引:1,自引:0,他引:1
在基于Agent的个性化网页推荐中,目前主要有两种过滤方法:基于内容的过滤和基于多Agent合作的过滤。在分析了单独使用这两种方法存在的不足之后,提出了基于改进蚁群算法的聚类分析建立用户模型的算法,并给出了结合两种方法优点的用户模型主动学习算法,最后给出了个性化信息推荐模型及相关算法。 相似文献
75.
文章针对一维长序DFT计算问题,分析其计算结构以及算法的并行性,提出一种阵列协处理结构.并分析这种协处理机结构上DFT计算的组织及具体实施算法步骤和方法,并对这种协处理阵列结构上运行的DFT进行复杂性分析。这对计算DFT专用集成协处理结构芯片开发,提高专用嵌套系统性能非常实用。 相似文献
76.
77.
78.
79.
本文讨论了磁电雾化电晕放电低温等离子体技术的基本原理,以及它在静电除尘、烟气脱硫等环保生物工程等领域中的应用前景. 相似文献
80.