首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7050篇
  免费   1087篇
  国内免费   669篇
电工技术   452篇
综合类   506篇
化学工业   103篇
金属工艺   41篇
机械仪表   224篇
建筑科学   86篇
矿业工程   30篇
能源动力   65篇
轻工业   12篇
水利工程   30篇
石油天然气   26篇
武器工业   24篇
无线电   1973篇
一般工业技术   402篇
冶金工业   66篇
原子能技术   3篇
自动化技术   4763篇
  2024年   113篇
  2023年   130篇
  2022年   117篇
  2021年   140篇
  2020年   192篇
  2019年   159篇
  2018年   133篇
  2017年   175篇
  2016年   210篇
  2015年   222篇
  2014年   393篇
  2013年   425篇
  2012年   480篇
  2011年   483篇
  2010年   459篇
  2009年   556篇
  2008年   607篇
  2007年   607篇
  2006年   635篇
  2005年   615篇
  2004年   449篇
  2003年   423篇
  2002年   317篇
  2001年   214篇
  2000年   164篇
  1999年   93篇
  1998年   66篇
  1997年   47篇
  1996年   25篇
  1995年   38篇
  1994年   18篇
  1993年   16篇
  1992年   12篇
  1991年   16篇
  1990年   12篇
  1989年   10篇
  1988年   6篇
  1987年   1篇
  1986年   3篇
  1985年   5篇
  1984年   8篇
  1983年   2篇
  1982年   3篇
  1981年   1篇
  1980年   3篇
  1978年   1篇
  1977年   1篇
  1966年   1篇
排序方式: 共有8806条查询结果,搜索用时 15 毫秒
71.
The development of efficient quality of service (QoS) routing algorithms in a high‐speed networking or the next generation IP networking environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently, a heuristic algorithm H_MCOP, which is based on a non‐linear Lagrange relaxation (NLR) technique, has been proposed to resolve the contradiction between the time complexity and the quality of solution. Even though H_MCOP has demonstrated outstanding capability of finding feasible solutions to the multi‐path constrained (MCP) problem, it has not exploited the full capability that an NLR‐based technique could offer. In this paper, we propose a new NLR‐based heuristic called NLR_MCP, in which the search process is interpreted from a probability's perspective. Simulation results indicate that NLR_MCP can achieve a higher probability of finding feasible solutions than H_MCOP. We also verify that the performance improvement of a MCP heuristic has a tremendous impact on the performance of a higher level heuristic that uses a MCP heuristic as the basic step. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   
72.
In this paper, a distributed adaptive guard channel reservation (DAGCR) scheme is proposed to give priority to handoff calls. This scheme is built upon the concept of guard channels and it uses an adaptive algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality‐of‐service (QoS) parameters used are the new and handoff call blockings. Simulation studies are performed to compare the present algorithm with the static guard channel policy. Simulation results show that this proposed algorithm guarantees the handoff call blocking probability to remain below the targeted threshold up to a substantially high offered load with a minimal blocking to new calls up to a moderate offered load and also shows significantly high channel utilization in all offered load conditions. This scheme is examined over a wide range of offered load. Thus, it seems the proposed scheme is very useful in controlling the blocking performances in wireless cellular networks. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   
73.
Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   
74.
By integrating the concept of effective capacity, we propose the resource allocation schemes for subcarrier‐pair based OFDM decode‐and‐forward and amplify‐and‐forward relay systems for quality‐of‐service (QoS) guarantees. The objective is to maximize the system throughput subject to a given statistical delay QoS constraint. First, we pair the subcarriers over the source‐relay channel and the relay‐destination channel by the descending order of the subcarriers' channel gains. Second, by making use of the derived equivalent end‐to‐end channel gains of the subcarrier pairs, we apply joint water‐filling power allocation over the subcarrier pairs and then partition the power of the subcarrier pairs between the source and the relay. We prove that as the equivalent end‐to‐end channel gains of the subcarrier pairs are given, the combination of sorted subcarrier pairing and joint water‐filling power allocation is jointly optimal to maximize the effective capacity. The simulation results show that our proposed schemes achieve the highest effective capacity for OFDM decode‐and‐forward and amplify‐and‐forward relay systems as compared with other existing schemes. The results also verify that our proposed schemes can efficiently provide different levels of delay QoS guarantees, even if under the stringent delay QoS constraints. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   
75.
Pricing based adaptive scheduling method for bandwidth allocation   总被引:2,自引:0,他引:2  
In this paper we present a packet scheduling method which guarantees bandwidth of the connection and optimizes revenue of the network service provider. A closed form formula for updating the adaptive weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections’ statistical behavior. The features of the algorithm are simulated and analyzed with and without a call admission control (CAC) mechanism. We also show in context with the CAC procedure a mechanism for guaranteeing a specified mean bandwidth for different service classes.  相似文献   
76.
区分服务中一种TCP友好的公平数据包标记算法   总被引:2,自引:0,他引:2  
在DiffServ网络中,存在一些对带宽利用的不公平性。为了解决这些不公平性,该文提出了一种基于TSW的标记算法,称之为TCP友好的公平数据包标记算法,它能以一种近似按比例的方式在各个汇聚流之间公平地分配网络中的剩余带宽,同时还能在汇聚流内部对TCP流和UDP流进行公平的带宽分配。通过仿真试验对算法进行了验证,并与其它几种标记算法进行比较,结果证实本算法比其它几种算法具有更好的公平性。  相似文献   
77.
多协议标记交换MPLS通过在传统的IP包里加入标记,使原来依赖于IP头标分析的路由转发转变为依赖于标记的转发,这不仅可以大大地提高IP包的转发速度,更可使传统IP网络具有QoS能力。本文深入分析了标记转发的思想.并指出了MPLS实现其优点所用的机制与原理。  相似文献   
78.
动态频率选择(DFS)是解决频道实时优化的有力手段,本文针对无线局域网,无线个域网(WLAN/WPAN)等小区域无线多媒体通信系统,首次把模拟退火算法应用到DFS中,针对WLAN/WPAN的情况,给出其处理过程的完整描述,并以HiperLAN/2系统为例进行了仿真。仿真结果表明,与目前已有的算法相比较,新算法实现了整个系统的组合优化,克服了现有算法可能存在的跳转较频繁、性能不够稳定等缺点,能在复杂传播环境下提高WLAN/WPAN的服务质量(QOS)。  相似文献   
79.
一种基于QoS的QoE到SLA映射方法   总被引:2,自引:0,他引:2  
该文提出一种算法IQoE2QoS(Improved QoE to QoS),采用模糊理论的方法计算QoE到QoS的映射。该算法有3重目标:从大量的经验数据中通过计算互信息量方式总结被统计指标之间的关联程度。在大量经验数据的基础上通过多指标模糊判定理论将用户感知映射到应用层用户QoS参数。考虑了用户的QoE和QoS的双向映射,并且阐述了得到的QoE如何自然映射到SLA(Service Level Agreement)。通过仿真表明,IQoE2QoS算法对用户体验的分类准确度是线性回归算法的2到3倍。  相似文献   
80.
吴秋丽  李太君 《通信技术》2010,43(6):198-200,203
为满足不同业务对服务质量的不同要求,提出了一种适用于无线流媒体业务的呼叫接纳控制算法。算法的思想是通过移动站和基站的协作和反馈控制,以剩余带宽和业务类型为依据进行接纳概率设计;通过互相协作的反馈控制,移动站可以获取系统的剩余可用带宽等级,依此调整业务的呼叫请求速率;仿真结果表明,该算法的输出变化较平滑、稳定,在呼叫阻塞概率、切换呼叫丢弃概率和带宽利用率方面有良好的综合性能。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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