首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2549篇
  免费   157篇
  国内免费   4篇
化学   10篇
综合类   8篇
数学   54篇
物理学   148篇
无线电   2490篇
  2024年   4篇
  2023年   27篇
  2022年   57篇
  2021年   28篇
  2020年   51篇
  2019年   36篇
  2018年   61篇
  2017年   84篇
  2016年   90篇
  2015年   110篇
  2014年   177篇
  2013年   182篇
  2012年   203篇
  2011年   172篇
  2010年   144篇
  2009年   191篇
  2008年   192篇
  2007年   191篇
  2006年   158篇
  2005年   104篇
  2004年   107篇
  2003年   103篇
  2002年   70篇
  2001年   73篇
  2000年   36篇
  1999年   15篇
  1998年   16篇
  1997年   11篇
  1996年   8篇
  1995年   4篇
  1994年   4篇
  1992年   1篇
排序方式: 共有2710条查询结果,搜索用时 15 毫秒
1.
基于CVSD编码的无线语音系统方案的设计   总被引:2,自引:0,他引:2  
周捷  陈向东  李长春 《微电子学》2006,36(1):121-124
简要介绍了连续可变斜率增量(CVSD)调制的原理。与目前应用较为广泛的其它语音编码方式相比较,CVSD拥有更优的数字特性。着重介绍了由CML公司研制开发的基于CVSD的语音编码芯片———CMX649的特点及相关的应用方式。CMX649能够成功地应用在广泛的语音编码系统中,尤其适合无线语音系统应用。在此基础上,给出了一种实用性很强的低成本、低功耗无线语音系统的设计与应用方案。该方案可提供清晰可靠的语音传输,可广泛应用于农村地区,具有广阔的市场空间。  相似文献   
2.
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.  相似文献   
3.
面向应用的无线传感器网络   总被引:1,自引:0,他引:1  
结合具体的应用环境分析了无线传感器网络发展到第二阶段需要考虑的重点问题;探讨了基于上述应用需求的无线传感器网络的协议栈结构和今后的研究方向。  相似文献   
4.
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).  相似文献   
5.
GSM90 0 /1 80 0固定无线公用电话桌面型话机在开发过程中遇到严重的噪音问题 ,一度成为开发工作的瓶颈。本文就这一噪音问题进行了分析与测试 ,并针对干扰源采取相应的措施 ,在产品开发中付诸应用 ,最终解决了 GSM桌面型无线公话的噪音问题  相似文献   
6.
提出一种视频点播系统传送数据的结构,结合单播与群播两种数据传送的方法,通过动态改变群播与单播的频道分配比例,让大部分的使用者无需等待即可开始观看影片,进而减少整体使用者的等待时间.  相似文献   
7.
This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem.  相似文献   
8.
In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm –multicast with SRLG sharing (MSS)– to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.  相似文献   
9.
郭德彬  周峰  唐璞山 《微电子学》2002,32(1):62-65,68
提出了一个工作电压为3V,工作频率900MHZ,输出功率为20mW的高效率CMOS功率放大器。为了达到设计目标,文章采用了一些特殊的方法,包括三级放大结构,级间的调谐匹配和层叠差分结构。  相似文献   
10.
一种支持QoS的拓扑自适应动态组播路由算法   总被引:3,自引:0,他引:3  
YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开,同时为接收方提供多个可选择的组播接入路径,以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长,可扩展性不好等问题。本文在分析这些算法的基础上,提出改进的支持QoS的动态组播路由算法,即拓扑自适应动态组播路由(Topology Adaptive Dynamic Multicast Routing,TADMR)算法。该算法避免了以往算法中大部分盲目的路径搜索,并使结点加入时延不再受限于固定的等待时钟,而与网络拓扑相自适应。性能分析和仿真结果表明,该算法具有较低的控制信令开销和结点加入时延,适用于各种网络规模和群组规模,具有良好的可扩展性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号