首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3019篇
  免费   424篇
  国内免费   34篇
化学   6篇
晶体学   1篇
力学   3篇
综合类   25篇
数学   466篇
物理学   117篇
无线电   2859篇
  2024年   9篇
  2023年   44篇
  2022年   45篇
  2021年   49篇
  2020年   66篇
  2019年   62篇
  2018年   55篇
  2017年   81篇
  2016年   113篇
  2015年   136篇
  2014年   194篇
  2013年   237篇
  2012年   193篇
  2011年   220篇
  2010年   175篇
  2009年   206篇
  2008年   179篇
  2007年   257篇
  2006年   214篇
  2005年   161篇
  2004年   172篇
  2003年   152篇
  2002年   114篇
  2001年   111篇
  2000年   60篇
  1999年   31篇
  1998年   26篇
  1997年   26篇
  1996年   20篇
  1995年   23篇
  1994年   8篇
  1993年   8篇
  1992年   9篇
  1991年   2篇
  1990年   1篇
  1989年   2篇
  1988年   1篇
  1987年   1篇
  1985年   10篇
  1983年   1篇
  1982年   1篇
  1981年   1篇
  1970年   1篇
排序方式: 共有3477条查询结果,搜索用时 343 毫秒
81.
In the heterogeneous and unreliable channel environment of cognitive radio ad hoc networks (CRAHNs), a multipath route with channel assigned is preferable in both throughput and reliability. The cross‐layer multipath routing and channel assignment in CRAHNs is becoming a challenging issue. In this paper, this problem is characterized, formulated, and shown to be in the form of mixed integer programming. For this Non‐deterministic Polynomial‐time (NP)‐hard problem, the deficiency of the widely used linearization and sequential fixing algorithm is first analyzed. The main contribution of this paper is the development of a new backtracking algorithm with feasibility checking to search optimal solutions and a heuristic algorithm with high feasible solution‐obtained probability (HHFOP) for distributed application in CRAHNs. Through feasibility checking and solution bounds validating, backtracking algorithm with feasibility checking cuts off unnecessary searching space in early stage without loss of optimal solutions, making it much more efficient than brute searching. For practical application in CRAHNs with polynomial complexity, HHFOP first computes the maximal‐supported throughput through link‐channel assignment and link‐capacity coordination for each candidate path. Then the paths are combined, and the route throughput is optimized. Extensive simulation results demonstrate that HHFOP can achieve a high feasible solution‐obtained probability with little throughput degradation compared with linearization and sequential fixing algorithm, indicating its practicability for distributed applications in CRAHNs. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
82.
Vehicular ad hoc networks (VANETs) are witnessing in recent years a rapid development for road transmissions and are considered as one of the most important types of next generation networks, in which drivers can have access anywhere and anytime to information. However, vehicles have to deal with many challenges such as the links failures due to their frequent mobility as well as limited degrees of freedom in their mobility patterns. In this paper, we propose a new quality of service multicast and multipath routing protocol for VANETs, based on the paradigm of bee's communication, called multicast quality of service swarm bee routing for VANETs (MQBV). The MQBV finds and maintains robust routes between the source node and all multicast group members. Therefore, the average end‐to‐end delay and the normalized overhead load should be reduced, while at the same time increasing the average bandwidth and the packet delivery ratio. Extensive simulation results were obtained using ns‐2 simulator in a realistic VANET settings and demonstrated the efficiency of the proposed protocol. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
83.
Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real‐time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video‐aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   
84.
在分析MSDP协议工作机制的基础上,给出了一种协议的实现方案。该方案将协议分为peer连接模块、报文处理模块、定时器模块以及外部接口模块并加以实现,适合在核心路由器中采用来支持域间组播功能。  相似文献   
85.
WDM疏导网络中一种新的多播业务路由算法   总被引:8,自引:6,他引:2  
研究了波分复用(WDM)网状网中动态多播业务量疏导,提出一种新的辅助疏导模型,其可以描述当前网络资源状况和节点分光特点,并动态更新.进而提出一种有效的多播业务量疏导启发式算法(MGA),将业务的多播选路和波长分配同时完成.仿真表明,该算法在波长连续性限制、网络波长和节点收发器数目有限的情况下,具有较低网络阻塞率.  相似文献   
86.
为了降低带宽阻塞率,节约频谱资源,在动态业务到达的弹性光网络(EONs)场景下,不同业务请求的路径状况可能不同,因此不能确定单路径专有保护与带宽分割多路径专有保护的优劣.文章结合单路径专有保护和带宽分割多路径专有保护提出了一种混合路径专有保护(HDPP)算法.该算法利用路径的单位频谱效率和路径跳数计算了k条链路不相关候...  相似文献   
87.
MANET路由协议的最新发展   总被引:1,自引:0,他引:1  
由于移动Ad hoc网络(MANET)自身的特殊性,其路由协议的设计与传统固定网络有很大不同。本文在MANET路由协议的设计原则的基础上,分析了几种典型的MANET路由协议的特点,并对MANET路由协议未来的发展方向作出了展望。  相似文献   
88.
This paper gives a brief and systematic presentation of the computer simulation techniques of satellite communications, especially for a mobile satellite channel, based on a summarization of the author's exploration and experience in this area. It includes the equivalent complex baseband notation (ECBN) method, a very convenient mathematical form for software simulation; development of a multi-functional and expandable channel simulation system on a computer from L-band to Ka-band; channel impulse or frequency response estimation in real time by the technique burst-mode link analyser with least-squares algorithm (BMLA/LS), modelling and simulation of the channel fast fading due to multipath and shadowing; acquisition of the equivalent normalized binary signal-to-noise ratio (Eb/N0) data at the channel input; and bit-error rate (BER) evaluation by the directly error-counting approach and the computational approach at the channel output in simulation.  相似文献   
89.
朱艺华  沈毅俊  吴小燕  汪加才 《电子学报》2006,34(11):2004-2007
在移动自组网络MANET(Mobile Ad-hoc Networks)中,移动节点之间的通信是多跳(Multi-hop)的,即需要网络中其他节点的参与得以进行,因此,节点之间的通信路径会因为节点的电力耗竭或节点的移动而中断.本文提出了根据移动节点当前电力及通信负荷来选择支配节点的最小连通支配集CDS(Connected Dominating Set)构造算法,这种算法可以减小由移动节点电力耗竭所致的通信路径失效的概率,也可以减少数据包通过各移动节点的延误时间,对设计MANET的高效稳定的路由策略有着重要的应用价值.  相似文献   
90.
强磊  陈卉 《电信科学》2006,22(5):19-22
目前国内外各通信标准组织都将以3GPPIMS为基础的网络作为未来语音交换网络的演进方向,由于未来的IMS网络将在很长一段时间内与基于电路交换的电话网络共存,因此存在着IMS中SIP用户呼叫E.164号码被叫用户时的路由选择判断问题.为此,本文给出了3GPPIMS中SIP用户呼叫E.164号码被叫用户时在主叫归属S-CSCF可采取的三种路由方案:S-CSCF自身路由方案、ENUM查询判断方案以及BGCF路由判断方案,并对这三种方案进行了分析比较与应用建议.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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