全文获取类型
收费全文 | 3901篇 |
免费 | 268篇 |
国内免费 | 17篇 |
专业分类
化学 | 25篇 |
力学 | 1篇 |
综合类 | 3篇 |
数学 | 77篇 |
物理学 | 515篇 |
无线电 | 3565篇 |
出版年
2024年 | 14篇 |
2023年 | 55篇 |
2022年 | 85篇 |
2021年 | 60篇 |
2020年 | 86篇 |
2019年 | 53篇 |
2018年 | 83篇 |
2017年 | 122篇 |
2016年 | 122篇 |
2015年 | 148篇 |
2014年 | 268篇 |
2013年 | 250篇 |
2012年 | 295篇 |
2011年 | 274篇 |
2010年 | 187篇 |
2009年 | 236篇 |
2008年 | 287篇 |
2007年 | 231篇 |
2006年 | 196篇 |
2005年 | 148篇 |
2004年 | 125篇 |
2003年 | 129篇 |
2002年 | 107篇 |
2001年 | 111篇 |
2000年 | 105篇 |
1999年 | 70篇 |
1998年 | 53篇 |
1997年 | 49篇 |
1996年 | 64篇 |
1995年 | 50篇 |
1994年 | 27篇 |
1993年 | 10篇 |
1992年 | 5篇 |
1991年 | 10篇 |
1990年 | 16篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1986年 | 2篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1972年 | 1篇 |
排序方式: 共有4186条查询结果,搜索用时 15 毫秒
1.
以用户为中心的可见光通信协作传输是近年来出现的新架构,这导致虚拟小区之间出现重叠。为避免导频污染问题,每个虚拟小区中的光接入点(AP)或者虚拟小区中选择相同AP的用户发送的训练序列应该是正交的。针对可见光通信中以用户为中心的协作网络,研究训练资源的正交分配问题,提出了一种新的导频分配算法,联合导频分配和用户选择问题,以期最大限度地增加虚拟小区内可被接入的用户数。分析和仿真结果表明,该导频分配方案可以有效改善导频污染问题,提高训练资源利用率,并且相比已有的导频分配方案,性能有所改进。 相似文献
2.
基于CVSD编码的无线语音系统方案的设计 总被引:2,自引:0,他引:2
简要介绍了连续可变斜率增量(CVSD)调制的原理。与目前应用较为广泛的其它语音编码方式相比较,CVSD拥有更优的数字特性。着重介绍了由CML公司研制开发的基于CVSD的语音编码芯片———CMX649的特点及相关的应用方式。CMX649能够成功地应用在广泛的语音编码系统中,尤其适合无线语音系统应用。在此基础上,给出了一种实用性很强的低成本、低功耗无线语音系统的设计与应用方案。该方案可提供清晰可靠的语音传输,可广泛应用于农村地区,具有广阔的市场空间。 相似文献
3.
本文在深入研究水声通信信道特性及多载波关键技术的基础上,设计并研制了基于M FSK的高速自适应多载波水声通信系统,并进行了湖上实验。理论分析、仿真及湖上试验结果表明:基于M FSK的多载波水声通信系统,多径抑制有效,对同步的精确度要求不高,性能稳健,更适合于恶劣水声通信环境下、中距离(10~30km)较高数据率多载波通信系统,易于工程实现,具有良好的应用前景。 相似文献
4.
Discrete time queueing systems have been successfully used to model packet queues in computer and digital communications systems. In this article we introduce a novel approach to analyzing the GeoX/GeoY/∞ queueing system, which is suitable for modelling high speed computer and communications systems. The approach is based on characterizing the system by a functional equation which is then solved recursively to give identical results to those obtained using other approaches. 相似文献
5.
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. 相似文献
6.
7.
The Algorithm and Its Application of a Multi-Channel Adaptive Decision-Feedback Equalizer 总被引:4,自引:2,他引:2
1 IntroductionOneofthekeyproblemsinhigh speeddigitalradiocommunicationistheInter Symbol Interfer ence (ISI)causedbythemulti pathbetweenthetransmitterandthereceiver.Becauseoftherelativemovementbetweenthereceiverandthetransmitterandthecontinuouschangeoftransmissionmedia,ISIisusuallytime variant.Inthepasttwotothreedecades,abroadstudyofthetype ,structureandadaptivealgorithmofadaptiveequalizershasbeencarriedouttomitigateISI[1~ 7] .Withtheintroductionofadaptiveantennasanddiversityreceptiontec… 相似文献
8.
面向应用的无线传感器网络 总被引:1,自引:0,他引:1
结合具体的应用环境分析了无线传感器网络发展到第二阶段需要考虑的重点问题;探讨了基于上述应用需求的无线传感器网络的协议栈结构和今后的研究方向。 相似文献
9.
Quality of service (QoS) support for multimedia services in the IEEE 802.11 wireless LAN is an important issue for such WLANs
to become a viable wireless access to the Internet. In this paper, we endeavor to propose a practical scheme to achieve this
goal without changing the channel access mechanism. To this end, a novel call admission and rate control (CARC) scheme is
proposed. The key idea of this scheme is to regulate the arriving traffic of the WLAN such that the network can work at an
optimal point. We first show that the channel busyness ratio is a good indicator of the network status in the sense that it
is easy to obtain and can accurately and timely represent channel utilization. Then we propose two algorithms based on the
channel busyness ratio. The call admission control algorithm is used to regulate the admission of real-time or streaming traffic
and the rate control algorithm to control the transmission rate of best effort traffic. As a result, the real-time or streaming
traffic is supported with statistical QoS guarantees and the best effort traffic can fully utilize the residual channel capacity
left by the real-time and streaming traffic. In addition, the rate control algorithm itself provides a solution that could
be used above the media access mechanism to approach the maximal theoretical channel utilization. A comprehensive simulation
study in ns-2 has verified the performance of our proposed CARC scheme, showing that the original 802.11 DCF protocol can
statically support strict QoS requirements, such as those required by voice over IP or streaming video, and at the same time,
achieve a high channel utilization.
Hongqiang Zhai received the B.E. and M.E. degrees in electrical engineering from Tsinghua University, Beijing, China, in July 1999 and January
2002 respectively. He worked as a research intern in Bell Labs Research China from June 2001 to December 2001, and in Microsoft
Research Asia from January 2002 to July 2002. Currently he is pursuing the PhD degree in the Department of Electrical and
Computer Engineering, University of Florida. He is a student member of IEEE.
Xiang Chen received the B.E. and M.E. degrees in electrical engineering from Shanghai Jiao Tong University, Shanghai, China, in 1997
and 2000, respectively, and the Ph.D. degree in electrical and computer engineering from the University of Florida, Gainesville,
in 2005. He is currently a Senior Research Engineer at Motorola Labs, Arlington Heights, IL. His research interests include
resource management, medium access control, and quality of service (QoS) in wireless networks. He is a Member of Tau Beta
Pi and a student member of IEEE.
Yuguang Fang received a Ph.D degree in Systems and Control Engineering from Case Western Reserve University in January 1994, and a Ph.D
degree in Electrical Engineering from Boston University in May 1997.
From June 1997 to July 1998, he was a Visiting Assistant Professor in Department of Electrical Engineering at the University
of Texas at Dallas. From July 1998 to May 2000, he was an Assistant Professor in the Department of Electrical and Computer
Engineering at New Jersey Institute of Technology. In May 2000, he joined the Department of Electrical and Computer Engineering
at University of Florida where he got the early promotion with tenure in August 2003 and has been an Associate Professor since
then. He has published over one hundred (100) papers in refereed professional journals and conferences. He received the National
Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002.
He is currently serving as an Editor for many journals including IEEE Transactions on Communications, IEEE Transactions on
Wireless Communications, IEEE Transactions on Mobile Computing, and ACM Wireless Networks. He is also actively participating
in conference organization such as the Program Vice-Chair for IEEE INFOCOM’2005, Program Co-Chair for the Global Internet
and Next Generation Networks Symposium in IEEE Globecom’2004 and the Program Vice Chair for 2000 IEEE Wireless Communications
and Networking Conference (WCNC’2000). 相似文献
10.
Scheduling Algorithms for Packet-Oriented MAC Protocols in Wireless Multimedia Systems 总被引:1,自引:1,他引:0
Romano Fantacci Giovanni Giambene Francesco Petiti 《Wireless Personal Communications》2003,24(3):363-388
Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD. 相似文献