全文获取类型
收费全文 | 9352篇 |
免费 | 1617篇 |
国内免费 | 178篇 |
专业分类
化学 | 63篇 |
晶体学 | 6篇 |
力学 | 123篇 |
综合类 | 107篇 |
数学 | 466篇 |
物理学 | 764篇 |
无线电 | 9618篇 |
出版年
2024年 | 48篇 |
2023年 | 125篇 |
2022年 | 188篇 |
2021年 | 233篇 |
2020年 | 242篇 |
2019年 | 268篇 |
2018年 | 266篇 |
2017年 | 312篇 |
2016年 | 372篇 |
2015年 | 472篇 |
2014年 | 672篇 |
2013年 | 615篇 |
2012年 | 824篇 |
2011年 | 753篇 |
2010年 | 605篇 |
2009年 | 526篇 |
2008年 | 585篇 |
2007年 | 658篇 |
2006年 | 605篇 |
2005年 | 552篇 |
2004年 | 436篇 |
2003年 | 425篇 |
2002年 | 295篇 |
2001年 | 295篇 |
2000年 | 198篇 |
1999年 | 151篇 |
1998年 | 133篇 |
1997年 | 45篇 |
1996年 | 50篇 |
1995年 | 44篇 |
1994年 | 44篇 |
1993年 | 22篇 |
1992年 | 15篇 |
1991年 | 8篇 |
1990年 | 12篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1974年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
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.
5.
基于扩展分形和CFAR特征融合的SAR图像目标识别 总被引:3,自引:0,他引:3
研究了多信息融合技术在SAR图像目标识别中的应用。将扩展分形特征(Extended Fractal)与双参数恒虚警特征(Double Parameter CFAR)形成的多信息进行融合处理。运用Dempster-Shafer证据理论,在决策层对SAR图像中的像素进行识别分类。实验结果表明通过融合对像素分类的准确性明显好于单特征的检测结果,减少了虚警概率,提高了系统的识别能力。 相似文献
6.
7.
8.
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). 相似文献
9.
10.
基于直升机目标旋转部件的调制模型,本文针对防空雷达提出了分析直升机信号特征的一种新方法——WVD法,并对直升机目标旋转部件调制回波信号在不同噪声情况下加以仿真分析,结果表明:用WVD分析雷达回波中直升机信号特征是一种非常有效的方法。 相似文献