全文获取类型
收费全文 | 16378篇 |
免费 | 1508篇 |
国内免费 | 807篇 |
专业分类
电工技术 | 1094篇 |
技术理论 | 1篇 |
综合类 | 1046篇 |
化学工业 | 2918篇 |
金属工艺 | 912篇 |
机械仪表 | 1035篇 |
建筑科学 | 1171篇 |
矿业工程 | 482篇 |
能源动力 | 460篇 |
轻工业 | 1152篇 |
水利工程 | 298篇 |
石油天然气 | 885篇 |
武器工业 | 106篇 |
无线电 | 1913篇 |
一般工业技术 | 2194篇 |
冶金工业 | 755篇 |
原子能技术 | 228篇 |
自动化技术 | 2043篇 |
出版年
2024年 | 47篇 |
2023年 | 314篇 |
2022年 | 437篇 |
2021年 | 651篇 |
2020年 | 551篇 |
2019年 | 438篇 |
2018年 | 506篇 |
2017年 | 566篇 |
2016年 | 500篇 |
2015年 | 690篇 |
2014年 | 821篇 |
2013年 | 1020篇 |
2012年 | 1023篇 |
2011年 | 1036篇 |
2010年 | 971篇 |
2009年 | 878篇 |
2008年 | 838篇 |
2007年 | 869篇 |
2006年 | 894篇 |
2005年 | 694篇 |
2004年 | 498篇 |
2003年 | 530篇 |
2002年 | 607篇 |
2001年 | 473篇 |
2000年 | 408篇 |
1999年 | 442篇 |
1998年 | 370篇 |
1997年 | 306篇 |
1996年 | 278篇 |
1995年 | 212篇 |
1994年 | 182篇 |
1993年 | 129篇 |
1992年 | 107篇 |
1991年 | 86篇 |
1990年 | 69篇 |
1989年 | 49篇 |
1988年 | 43篇 |
1987年 | 29篇 |
1986年 | 33篇 |
1985年 | 11篇 |
1984年 | 17篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 12篇 |
1980年 | 13篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 8篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 562 毫秒
31.
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. 相似文献
32.
龙口水利枢纽坝基岩体主要由奥陶系中统马家沟组(O2m2)灰岩组成,其中发育有多层软弱夹层。作为其中之一的钙质充填夹层,强度虽不很低,但由于处于坝基下的持力层内,间距不大,发育密集,产状平缓,是坝基浅层抗滑稳定的主要控制因素,因此,在大坝抗滑稳定分析时,应进行分析和研究。 相似文献
33.
34.
35.
HFC网络设备管理系统标准与应用 总被引:1,自引:0,他引:1
日前,HFC网络设备管理系统国家标准已正式颁布实施,作者作为主要参加人参与了该标准的起草工作。本文阐述了规划建设统一、开放的HFC网络管理系统的必要性,介绍了国标与IEC国际标准的区别,并对国标在应用中需注意的关键技术问题进行了初步探讨。 相似文献
36.
研究了厚膜永磁阵列微致动器中的磁场分布,并研究了永磁阵列单元几何尺寸对微致动器电磁力的影响。结果表明,厚膜永磁阵列单元高宽比和磁体单元间隔对微致动器电磁力影响较大磁徕单元高宽比为0.7是一个比较合适的尺寸。 相似文献
37.
38.
Bong Keun Kim Wan Kyun Chung 《Industrial Electronics, IEEE Transactions on》2003,50(6):1207-1216
Disturbance-observer (DOB)-based controller design is one of the most popular methods in the field of motion control. In this paper, the generalized disturbance compensation framework, named the robust internal-loop compensator (RIC) is introduced and an advanced design method of a DOB is proposed based on the RIC. The mixed sensitivity optimization problem, which is the main issue of DOB design, is also solved through the parametrization of the DOB in the RIC framework. Differently from conventional methods, the Q-filter is separated from the mixed sensitivity optimization problem and a systematic design law for the DOB is proposed. This guarantees the robustness and optimality of the DOB and enables the design for unstable plants. 相似文献
39.
三江盆地西部藻类地层学特征 总被引:3,自引:1,他引:2
本文依据三江盆地西部4口井的藻类分布特征,自下而上划分9个组合,并对各组合的时代及沉积环境进行了探讨。 相似文献
40.
共焦显微术和多光子显微术因其可以对厚的生物样品实现光学断层成像,因而在生物医学等领域具有广泛的应用前景,本文详细综述了共焦显微术和多光子显微术在成像原理及特性等方面的差别,在此基础上,讨论了每种显微术各自的优点、局限性及应用前景。 相似文献