全文获取类型
收费全文 | 72162篇 |
免费 | 6564篇 |
国内免费 | 3759篇 |
专业分类
电工技术 | 4520篇 |
技术理论 | 2篇 |
综合类 | 6674篇 |
化学工业 | 12043篇 |
金属工艺 | 3791篇 |
机械仪表 | 4165篇 |
建筑科学 | 5404篇 |
矿业工程 | 1831篇 |
能源动力 | 1715篇 |
轻工业 | 8519篇 |
水利工程 | 1493篇 |
石油天然气 | 2831篇 |
武器工业 | 662篇 |
无线电 | 7794篇 |
一般工业技术 | 7700篇 |
冶金工业 | 2759篇 |
原子能技术 | 736篇 |
自动化技术 | 9846篇 |
出版年
2024年 | 355篇 |
2023年 | 1217篇 |
2022年 | 2305篇 |
2021年 | 2976篇 |
2020年 | 2358篇 |
2019年 | 1882篇 |
2018年 | 1996篇 |
2017年 | 2274篇 |
2016年 | 2084篇 |
2015年 | 2944篇 |
2014年 | 3932篇 |
2013年 | 4512篇 |
2012年 | 5046篇 |
2011年 | 5504篇 |
2010年 | 5116篇 |
2009年 | 4850篇 |
2008年 | 4887篇 |
2007年 | 4606篇 |
2006年 | 4345篇 |
2005年 | 3501篇 |
2004年 | 2525篇 |
2003年 | 2141篇 |
2002年 | 2271篇 |
2001年 | 1876篇 |
2000年 | 1480篇 |
1999年 | 1175篇 |
1998年 | 847篇 |
1997年 | 672篇 |
1996年 | 625篇 |
1995年 | 509篇 |
1994年 | 370篇 |
1993年 | 265篇 |
1992年 | 216篇 |
1991年 | 179篇 |
1990年 | 128篇 |
1989年 | 109篇 |
1988年 | 97篇 |
1987年 | 57篇 |
1986年 | 54篇 |
1985年 | 30篇 |
1984年 | 28篇 |
1983年 | 20篇 |
1982年 | 18篇 |
1981年 | 13篇 |
1980年 | 29篇 |
1979年 | 15篇 |
1978年 | 5篇 |
1976年 | 12篇 |
1959年 | 6篇 |
1951年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
Ye Wan Jun Tan Guangling Song Chuanwei Yan 《Metallurgical and Materials Transactions A》2006,37(7):2313-2316
The focused ion beam technique was employed to investigate the atmospheric corrosion morphology of AZ91D. It was found that
the α matrix of the alloy was preferentially corroded in the areas adjacent to intermetallic phases. The most interesting
finding was that the corrosion products in corrosion cavities were pelletlike, which has never been reported before. 相似文献
2.
Introduction
The IEC central office informed in 7/543/AC that the secretariat of TC 7 would be taken over by the Chinese National Committee on January 10, 2003 and affirmed subsequently in 7/544/AC that the secretariat of TC 7 has been taken over by the Chinese National Committee which appointing secretary in Shanghai Electric Cable Research Institute as no objection has been raised by the Standardization Management Board members. It's the first IEC secretariat that assumed by China, with great significance, just as commented by the media that the commitment indicate undoubtedly China is to play a much more active and important role in the world especially after its entry into world trade organization as well as the trend of global economic integration. 相似文献
3.
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. 相似文献
4.
5.
提出了一种基于移动代理的分布式网络管理系统模型,阐述了该系统发现网络拓扑的过程,介绍了具体算法思想,给出了数据结构和算法描述,最后进行了仿真,证明了算法的有效性. 相似文献
6.
7.
8.
Hao Wang Ying Lin Biao Chen 《Signal Processing, IEEE Transactions on》2003,51(10):2613-2623
We investigate non data-aided channel estimation for cyclically prefixed orthogonal frequency division multiplexing (OFDM) systems. By exploiting channel diversity using only two receive antennas, a blind deterministic algorithm is proposed. Identifiability conditions are derived that guarantee the perfect channel retrieval in the absence of noise. In the presence of noise, the proposed method has the desired property of being data efficient-only a single OFDM block is needed to achieve good estimation performance for a wide range of SNR values. The algorithm is also robust to input symbols as it does not have any restriction on the input symbols with regard to their constellation or their statistical properties. In addition, this diversity-based algorithm is computationally efficient, and its performance compares favorably to most existing blind algorithms. 相似文献
9.
10.
Polyaryloxydiphenylsilanes were prepared from phosphorus‐containing diols and diphenydichlorolsilane through solution polymerization. With a stoichiometric imbalance in feed monomers, the resulting polymers exhibited moderate melting points and good processing properties. The polymers prepared showed initial decomposition temperatures above 340 °C, excellent thermal stability, high char yields at 850 °C and very high limited oxygen index values of 56–59. The polymers' char yields and their (P + Si) contents showed linear relationships. © 2003 Society of Chemical Industry 相似文献