全文获取类型
收费全文 | 20134篇 |
免费 | 3189篇 |
国内免费 | 2052篇 |
学科分类
工业技术 | 25375篇 |
出版年
2024年 | 160篇 |
2023年 | 370篇 |
2022年 | 629篇 |
2021年 | 798篇 |
2020年 | 905篇 |
2019年 | 684篇 |
2018年 | 597篇 |
2017年 | 722篇 |
2016年 | 799篇 |
2015年 | 920篇 |
2014年 | 1423篇 |
2013年 | 1229篇 |
2012年 | 1502篇 |
2011年 | 1459篇 |
2010年 | 1204篇 |
2009年 | 1220篇 |
2008年 | 1223篇 |
2007年 | 1354篇 |
2006年 | 1201篇 |
2005年 | 1205篇 |
2004年 | 1060篇 |
2003年 | 904篇 |
2002年 | 726篇 |
2001年 | 631篇 |
2000年 | 472篇 |
1999年 | 419篇 |
1998年 | 314篇 |
1997年 | 275篇 |
1996年 | 214篇 |
1995年 | 185篇 |
1994年 | 149篇 |
1993年 | 88篇 |
1992年 | 77篇 |
1991年 | 56篇 |
1990年 | 51篇 |
1989年 | 30篇 |
1988年 | 21篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 12篇 |
1980年 | 11篇 |
1979年 | 8篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
3.
岩石物理横波速度曲线计算技术 总被引:15,自引:3,他引:12
横波速度是地震勘探中的重要参数。针对实际生产中缺乏横波速度测井曲线资料,利用经验公式计算精确度不高的问题,通过对横波速度计算理论模型的研究分析,选择Blot-Gassman模型法,利用岩石矿物成分、流体成分、孔隙度及密度等测井曲线进行横波速度测井曲线的计算,并对横波速度计算技术和流程进行研究。在实际工区进行了横波速度曲线计算,计算结果与实测横波吻合程度较高,误差小于10%,该技术在储层和流体识别预测的应用中取得了较好效果。 相似文献
4.
5.
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). 相似文献
6.
7.
一种新的线性分布参数系统辨识方法 总被引:1,自引:0,他引:1
本文应用块脉冲函数(BPF)将含有未知参数的线性分布参数系统偏微分方程转换为矩阵方程,通过最小二乘法辨识线性分布参数系统的参数,辨识结果表明,BPF辨识法具有原理简捷,实现方便,辨识精度高等优点。 相似文献
8.
9.
2001年4月,石油物探装备学会在北京召开了新千年首届技术研讨会,本文根据与会外国公司发布的信息,围绕当前地震勘探仪器的技术现状和发展进行了综合评述,并提出了一些看法和观点。 相似文献
10.