全文获取类型
收费全文 | 24393篇 |
免费 | 4463篇 |
国内免费 | 2892篇 |
专业分类
电工技术 | 4421篇 |
综合类 | 2645篇 |
化学工业 | 649篇 |
金属工艺 | 264篇 |
机械仪表 | 1175篇 |
建筑科学 | 662篇 |
矿业工程 | 388篇 |
能源动力 | 613篇 |
轻工业 | 237篇 |
水利工程 | 420篇 |
石油天然气 | 414篇 |
武器工业 | 1218篇 |
无线电 | 6525篇 |
一般工业技术 | 1370篇 |
冶金工业 | 481篇 |
原子能技术 | 419篇 |
自动化技术 | 9847篇 |
出版年
2024年 | 234篇 |
2023年 | 549篇 |
2022年 | 1015篇 |
2021年 | 1097篇 |
2020年 | 1111篇 |
2019年 | 969篇 |
2018年 | 839篇 |
2017年 | 1016篇 |
2016年 | 1135篇 |
2015年 | 1331篇 |
2014年 | 1763篇 |
2013年 | 1583篇 |
2012年 | 1938篇 |
2011年 | 1915篇 |
2010年 | 1563篇 |
2009年 | 1608篇 |
2008年 | 1602篇 |
2007年 | 1845篇 |
2006年 | 1390篇 |
2005年 | 1353篇 |
2004年 | 1150篇 |
2003年 | 960篇 |
2002年 | 783篇 |
2001年 | 638篇 |
2000年 | 491篇 |
1999年 | 411篇 |
1998年 | 299篇 |
1997年 | 221篇 |
1996年 | 219篇 |
1995年 | 166篇 |
1994年 | 137篇 |
1993年 | 91篇 |
1992年 | 71篇 |
1991年 | 52篇 |
1990年 | 35篇 |
1989年 | 26篇 |
1988年 | 25篇 |
1987年 | 16篇 |
1986年 | 16篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1961年 | 2篇 |
1959年 | 6篇 |
1956年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
针对不同地质目标的叠前时间偏移成像解释评价 总被引:3,自引:0,他引:3
随着计算机硬件和地震勘探成像技术的发展,叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标,叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢?为此,从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论,并基于某地区三维数据常规处理结果和叠前时间偏移处理结果,针对不同地质目标进行了剖析与评价。认为:叠前时间偏移成像的垂向分辨率较常规处理明显降低,但对于空间波阻抗变化明显的河流和断层,叠前时间偏移成像的空间分辨率要高于常规处理;对于小于1/4波长的叠置薄储层,叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。 相似文献
2.
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. 相似文献
3.
4.
基于扩展分形和CFAR特征融合的SAR图像目标识别 总被引:3,自引:0,他引:3
研究了多信息融合技术在SAR图像目标识别中的应用。将扩展分形特征(Extended Fractal)与双参数恒虚警特征(Double Parameter CFAR)形成的多信息进行融合处理。运用Dempster-Shafer证据理论,在决策层对SAR图像中的像素进行识别分类。实验结果表明通过融合对像素分类的准确性明显好于单特征的检测结果,减少了虚警概率,提高了系统的识别能力。 相似文献
5.
6.
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). 相似文献
7.
8.
Thirty patients who had undergone either a right or left unilateral temporal lobectomy (14 RTL; 16 LTL) and 16 control participants were tested on a computerized human analogue of the Morris Water Maze. The procedure was designed to compare allocentric and egocentric spatial memory. In the allocentric condition, participants searched for a target location on the screen, guided by object cues. Between trials, participants had to walk around the screen, which disrupted egocentric memory representation. In the egocentric condition, participants remained in the same position, but the object cues were shifted between searches to prevent them from using allocentric memory. Only the RTL group was impaired on the allocentric condition, and neither the LTL nor RTL group was impaired on additional tests of spatial working memory or spatial manipulation. The results support the notion that the right anterior temporal lobe stores long-term allocentric spatial memories. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
9.
一种新的线性分布参数系统辨识方法 总被引:1,自引:0,他引:1
本文应用块脉冲函数(BPF)将含有未知参数的线性分布参数系统偏微分方程转换为矩阵方程,通过最小二乘法辨识线性分布参数系统的参数,辨识结果表明,BPF辨识法具有原理简捷,实现方便,辨识精度高等优点。 相似文献
10.