全文获取类型
收费全文 | 24262篇 |
免费 | 3762篇 |
国内免费 | 3182篇 |
专业分类
电工技术 | 4433篇 |
综合类 | 2087篇 |
化学工业 | 1807篇 |
金属工艺 | 300篇 |
机械仪表 | 1252篇 |
建筑科学 | 613篇 |
矿业工程 | 367篇 |
能源动力 | 695篇 |
轻工业 | 1519篇 |
水利工程 | 348篇 |
石油天然气 | 339篇 |
武器工业 | 436篇 |
无线电 | 6984篇 |
一般工业技术 | 1677篇 |
冶金工业 | 427篇 |
原子能技术 | 102篇 |
自动化技术 | 7820篇 |
出版年
2024年 | 157篇 |
2023年 | 452篇 |
2022年 | 758篇 |
2021年 | 904篇 |
2020年 | 1009篇 |
2019年 | 868篇 |
2018年 | 842篇 |
2017年 | 1065篇 |
2016年 | 1120篇 |
2015年 | 1292篇 |
2014年 | 1776篇 |
2013年 | 1648篇 |
2012年 | 2029篇 |
2011年 | 1905篇 |
2010年 | 1412篇 |
2009年 | 1458篇 |
2008年 | 1563篇 |
2007年 | 1761篇 |
2006年 | 1475篇 |
2005年 | 1304篇 |
2004年 | 1126篇 |
2003年 | 969篇 |
2002年 | 793篇 |
2001年 | 681篇 |
2000年 | 533篇 |
1999年 | 452篇 |
1998年 | 354篇 |
1997年 | 265篇 |
1996年 | 238篇 |
1995年 | 206篇 |
1994年 | 191篇 |
1993年 | 130篇 |
1992年 | 110篇 |
1991年 | 99篇 |
1990年 | 62篇 |
1989年 | 36篇 |
1988年 | 19篇 |
1987年 | 25篇 |
1986年 | 23篇 |
1985年 | 13篇 |
1984年 | 17篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1975年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
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. 相似文献
22.
简要论述了集散控制系统的发展 ,根据火力发电厂的现场环境及实际情况 ,提出了火力发电厂集散控制系统的设计原则 ,并展望了集散控制系统的发展 相似文献
23.
24.
25.
26.
玻璃微珠的表面化学镀银及红外辐射性能研究 总被引:6,自引:1,他引:5
采用化学镀方法在玻璃微珠表面镀银,考察了预处理条件、反应温度和反应时间等因素对玻璃微珠表面镀银的影响,并通过扫描电镜和X-射线衍射分析仪,对镀银后玻璃微珠的表面形貌和结构进行了观察和表征。将镀银玻璃微珠用于涂料中,考察了玻璃微珠在涂料中的应用及其红外辐射率的变化,探讨了化学镀条件对涂料红外辐射率的影响,结果表明,在控制反应温度和浓度的条件下,可使镀银玻璃微珠的红外辐射率由原来的1.02降为0.70,将其应用于涂料后,涂层的红外辐射率为0.80。 相似文献
27.
28.
29.
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). 相似文献
30.