全文获取类型
收费全文 | 944篇 |
免费 | 116篇 |
国内免费 | 40篇 |
专业分类
化学 | 77篇 |
晶体学 | 2篇 |
力学 | 12篇 |
综合类 | 8篇 |
数学 | 151篇 |
物理学 | 93篇 |
无线电 | 757篇 |
出版年
2023年 | 4篇 |
2022年 | 12篇 |
2021年 | 21篇 |
2020年 | 21篇 |
2019年 | 19篇 |
2018年 | 19篇 |
2017年 | 25篇 |
2016年 | 22篇 |
2015年 | 40篇 |
2014年 | 62篇 |
2013年 | 69篇 |
2012年 | 48篇 |
2011年 | 60篇 |
2010年 | 67篇 |
2009年 | 44篇 |
2008年 | 45篇 |
2007年 | 57篇 |
2006年 | 53篇 |
2005年 | 68篇 |
2004年 | 62篇 |
2003年 | 59篇 |
2002年 | 38篇 |
2001年 | 43篇 |
2000年 | 32篇 |
1999年 | 18篇 |
1998年 | 20篇 |
1997年 | 12篇 |
1996年 | 6篇 |
1995年 | 11篇 |
1994年 | 11篇 |
1993年 | 7篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 1篇 |
1987年 | 4篇 |
1986年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1980年 | 2篇 |
排序方式: 共有1100条查询结果,搜索用时 15 毫秒
1.
异构分层无线网络中基于逗留时间的动态流量均衡算法研究 总被引:1,自引:1,他引:0
为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高. 相似文献
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.
多业务移动通信系统中的呼叫接入控制 总被引:4,自引:0,他引:4
在多业务无线移动通信系统的呼叫接入控制中,不仅要考虑业务之间的优先级,同时也必须考虑切换呼叫的优先级。本文结合可移动边界算法和保护信道策略,提出了一种有效的多业务呼叫接入控制算法。为了方便地分析方案的性能,设计了一个二维的Markov链对方案的性能进行理论上的分析。通过数值分析结果表明,提出的算法同时保证了两种优先级,并提高了系统的性能。1 相似文献
4.
5.
6.
介绍佛山有线电视网络呼叫中心基础平台的建设情况以及呼叫中心系统的发展规划,佛山有线电视呼叫中心采用先进的IP技术建立起呼叫中心的基本平台,在此基础平台上,通过建立先进的多媒体业务平台,佛山有线电视呼叫中心最终将发展成为佛山有线电视网络的服务支持平台、数据收集平台和业务销售平台。 相似文献
7.
8.
运输网络中最小饱和流的求解 总被引:4,自引:0,他引:4
运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用. 相似文献
9.
Huayi Wu Xiaohua Jia Yanxiang He Chuanhe Huang 《International Journal of Communication Systems》2005,18(9):803-816
This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
10.
在3G(第3代移动通信系统)中,为了给不同类型的业务提供不同级别的端到端QoS,网络资源必须进行合理分配。QoS和资源分配是密不可分的,而无线资源分配显得尤为重要。文中提出了UMTS的QoS结构,分3部分对空中接口部分的QoS(即无线资源分配策略问题)进行了讨论:首先提出了一种RRA算法,接着讨论了W-CDMA和TD-CDMA系统的无线资源分配问题,最后讨论了下行链路及上行链路的呼叫允许控制(CAC)。 相似文献