全文获取类型
收费全文 | 182136篇 |
免费 | 18572篇 |
国内免费 | 11173篇 |
学科分类
工业技术 | 211881篇 |
出版年
2024年 | 908篇 |
2023年 | 2972篇 |
2022年 | 5895篇 |
2021年 | 8116篇 |
2020年 | 6134篇 |
2019年 | 4742篇 |
2018年 | 5323篇 |
2017年 | 6329篇 |
2016年 | 5431篇 |
2015年 | 8112篇 |
2014年 | 10215篇 |
2013年 | 12153篇 |
2012年 | 14010篇 |
2011年 | 14515篇 |
2010年 | 13537篇 |
2009年 | 12680篇 |
2008年 | 12501篇 |
2007年 | 11902篇 |
2006年 | 10837篇 |
2005年 | 8504篇 |
2004年 | 5943篇 |
2003年 | 5134篇 |
2002年 | 5022篇 |
2001年 | 4393篇 |
2000年 | 3521篇 |
1999年 | 2877篇 |
1998年 | 1902篇 |
1997年 | 1578篇 |
1996年 | 1452篇 |
1995年 | 1225篇 |
1994年 | 1010篇 |
1993年 | 634篇 |
1992年 | 521篇 |
1991年 | 389篇 |
1990年 | 310篇 |
1989年 | 259篇 |
1988年 | 187篇 |
1987年 | 122篇 |
1986年 | 121篇 |
1985年 | 49篇 |
1984年 | 53篇 |
1983年 | 33篇 |
1982年 | 40篇 |
1981年 | 50篇 |
1980年 | 53篇 |
1979年 | 31篇 |
1977年 | 12篇 |
1976年 | 18篇 |
1959年 | 12篇 |
1951年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
In this paper we investigated the BER performance of DS-CDMA using various chip-waveforms, which include three time-limited chip-waveforms and two band-limited chip-waveforms. Closed-form formulae were derived for evaluating the achievable bit-error rate performance with the aid of the standard Gaussian approximation, when communicating over a Nakagami-m channel. The time-limited waveforms impose a low implementational complexity, since they maybe over sampled and read from a look-up table. However, they are outperformed by the frequency-domain raised-cosine waveform as well as the optimum waveform specifically designed by Cho and Lehnert for achieving the lowest possible bit error rate 相似文献
2.
动态评价技术在塔河碳酸盐岩缝洞型油气藏中的应用 总被引:5,自引:2,他引:3
塔河油田奥陶系油气藏是大型碳酸盐岩溶洞型油气藏,其储渗空间主要为大小不同的溶洞、裂缝带、溶蚀孔隙等组成,该油气藏具有极强的非均质性,单纯用静态资料来认识这类油气藏是非常困难。文章提出利用生产动态资料和信息进行该类型油气藏研究的新思路,利用人工神经网络技术在处理非线性相关参数预测方面的优势,并以渗流理论为基础,结合试井成果,选用已知油井的产量、油嘴、油压、含水率、气油比、原油密度等6个开发动态参数作为样品输入数据,推导出影响油气藏开发的重要参数(地层系数)与生产信息的关系,建立了人工神经网络预测储层参数的结构模型。通过塔里木盆地塔河油气田实例研究,说明了利用动态信息评价油气藏技术在碳酸盐岩缝洞型油气藏储层预测和非均质性分析等方面具有较高的实用价值。 相似文献
3.
设计并实现了一种DVB—T调制器的外码编码器,着重介绍了码流自适应接口、能量扩散、RS编码器及卷积交织器的设计方法,该设计方案最终在Altera的FPGA上进行验证。 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
7.
川合137井大修井工艺技术浅析 总被引:2,自引:0,他引:2
在川合137井的修井作业中,运用了多种修井工具和工艺技术。通过内捞、外捞、强提、倒扣、磨铣、套铣、开钻新井眼和铣锥通井的方法,充分解放了油气层,达到了修井目的。其独特的想法、施工和自制工具的成功应用对今后大修井作业具有很高的参考价值。 相似文献
8.
9.
根据Flether等人的研究,基于感知独立性假设的子带识别方法被用于抗噪声鲁棒语音识别。本文拓展子带方法,采用基于噪声污染假定的多带框架来减少噪声影响。论文不仅从理论上分析了噪声污染假定多带框架在识别性能上的潜在优势,而且提出了多带环境下的鲁棒语音识别算法。研究表明:多带框架不仅回避了独立感知假设要求,而且与子带方法相比,多带方法能更好的减少噪声影响,提高系统识别性能。 相似文献
10.
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. 相似文献