全文获取类型
收费全文 | 20389篇 |
免费 | 3775篇 |
国内免费 | 1445篇 |
专业分类
化学 | 1008篇 |
晶体学 | 46篇 |
力学 | 562篇 |
综合类 | 196篇 |
数学 | 4216篇 |
物理学 | 5104篇 |
无线电 | 14477篇 |
出版年
2024年 | 65篇 |
2023年 | 229篇 |
2022年 | 414篇 |
2021年 | 638篇 |
2020年 | 664篇 |
2019年 | 534篇 |
2018年 | 506篇 |
2017年 | 787篇 |
2016年 | 959篇 |
2015年 | 960篇 |
2014年 | 1580篇 |
2013年 | 1585篇 |
2012年 | 1644篇 |
2011年 | 1732篇 |
2010年 | 1305篇 |
2009年 | 1241篇 |
2008年 | 1443篇 |
2007年 | 1504篇 |
2006年 | 1206篇 |
2005年 | 1033篇 |
2004年 | 886篇 |
2003年 | 817篇 |
2002年 | 615篇 |
2001年 | 569篇 |
2000年 | 506篇 |
1999年 | 393篇 |
1998年 | 264篇 |
1997年 | 265篇 |
1996年 | 212篇 |
1995年 | 178篇 |
1994年 | 131篇 |
1993年 | 111篇 |
1992年 | 101篇 |
1991年 | 76篇 |
1990年 | 53篇 |
1989年 | 46篇 |
1988年 | 50篇 |
1987年 | 24篇 |
1986年 | 27篇 |
1985年 | 47篇 |
1984年 | 29篇 |
1982年 | 25篇 |
1981年 | 25篇 |
1980年 | 20篇 |
1979年 | 24篇 |
1978年 | 18篇 |
1977年 | 16篇 |
1976年 | 14篇 |
1975年 | 9篇 |
1974年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
为了减小传统的最差情况设计方法引入的电压裕量,提出了一种变化可知的自适应电压缩减(AVS)技术,通过调整电源电压来降低电路功耗.自适应电压缩减技术基于检测关键路径的延时变化,基于此设计了一款预错误原位延时检测电路,可以检测关键路径延时并输出预错误信号,进而控制单元可根据反馈回的预错误信号的个数调整系统电压.本芯片采用SMIC180 nm工艺设计验证,仿真分析表明,采用自适应电压缩减技术后,4个目标验证电路分别节省功耗12.4%,11.3%,10.4%和11.6%. 相似文献
3.
《Microelectronics Journal》2015,46(11):1012-1019
This paper presents a voltage reference generator architecture and two different realizations of it that have been fabricated within a standard 0.18 μm CMOS technology. The architecture takes the advantage of utilizing a sampled-data amplifier (SDA) to optimize the power consumption. The circuits achieve output voltages on the order of 190 mV with temperature coefficients of 43 ppm/°C and 52.5 ppm/°C over the temperature range of 0 to 120°C without any trimming with a 0.8 V single supply. The power consumptions of the circuits are less then 500 nW while occupying an area of 0.2 mm2 and 0.08 mm2, respectively. 相似文献
4.
多带OFDM-UWB系统峰均功率比降低方法研究 总被引:1,自引:0,他引:1
针对多带OFDM—UWB信号存在高峰均功率比的问题,提出了利用扩展与交织降低系统信号峰均功率比的方法。该方法通过对传输数据进行正交扩展与交织,使得进入多载波调制的数据趋于高斯分布,减小了传输数据自相关函数的旁瓣峰值,降低了OFDM-UWB信号的峰均功率比。由于采用正交矩阵进行扩展,扩展前后的数据传输速率保持不变。仿真结果表明,扩展与交织可以有效地降低信号峰均功率比2-5dB左右。同时该方法还具有抗窄带干扰的鲁棒性。 相似文献
5.
6.
7.
Kurjenniemi Janne Hämäläinen Seppo Ristaniemi Tapani 《Wireless Personal Communications》2003,27(4):337-351
In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out. 相似文献
8.
移动通信系统中功率控制研究 总被引:2,自引:0,他引:2
在阐述功率控制在移动通信系统中的发展过程的基础上,着重研究了WCDMA系统的功率控制,最后对功率控制未来的研究方向做了简要的分析。 相似文献
9.
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. 相似文献
10.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献