全文获取类型
收费全文 | 187篇 |
免费 | 26篇 |
国内免费 | 15篇 |
专业分类
电工技术 | 5篇 |
综合类 | 16篇 |
化学工业 | 2篇 |
建筑科学 | 1篇 |
矿业工程 | 1篇 |
能源动力 | 1篇 |
轻工业 | 1篇 |
无线电 | 103篇 |
一般工业技术 | 1篇 |
冶金工业 | 3篇 |
自动化技术 | 94篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 4篇 |
2016年 | 4篇 |
2015年 | 11篇 |
2014年 | 13篇 |
2013年 | 10篇 |
2012年 | 16篇 |
2011年 | 17篇 |
2010年 | 23篇 |
2009年 | 22篇 |
2008年 | 8篇 |
2007年 | 22篇 |
2006年 | 16篇 |
2005年 | 11篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 2篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1993年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有228条查询结果,搜索用时 15 毫秒
1.
A Novel Segmentation and Feedback Model for Resolving Contention in Optical Burst Switching 总被引:2,自引:0,他引:2
A novel segmentation and feedback model (SFM) applied to resolve contention is proposed. Simulation and performance analyses show that the SFM effectively avoids contentions in optical burst switching (OBS). The long delay time of deflection routing and the immature technology of wavelength converters and optical buffers are not deployed in the SFM. The SFM does not only realize fast switching but also allows preemption by higher priority bursts. 相似文献
2.
This paper introduces an analytical model to investigate the energy efficiency of the IEEE 802.11 distributed coordinated
function (DCF). This model not only accounts for the number of contending nodes, the contention window, but also the packet
size, and the channel condition. Based on this model, we identify the tradeoff in choosing optimum parameters to optimize
the energy efficiency of DCF in the error-prone environment. The effects of contention window and packet size on the energy
efficiency are examined and compared for both DCF basic scheme and DCF with four-way handshaking. The maximum energy efficiency
can be obtained by combining both the optimal packet size and optimal contention window. To validate our analysis, we have
done extensive simulations in ns-2, and simulation results seem to match well with the presented analytical results.
The Ohio Board of Regents Doctoral Enhancements Funds and the National Science Foundation under Grant CCR 0113361 have supported
this work.
Xiaodong Wang received his B.S. degree in communication engineering from Beijing Information Technical Institute of China in 1995, and
his M.S. degree in electric engineering from Beijing University of Aeronautics and Astronautics of China in 1998. He joined
China Telecom in 1998 where he worked on communication protocols for telecommunication. From June 2000 to July 2002, he worked
on GSM base station software development at Bell-labs China, Beijing, China. Currently he is a Ph.D. student in Computer Engineering
at University of Cincinnati. His research activities include wireless MAC protocols, energy saving for wireless sensor networks.
He is a student member of the IEEE.
Jun Yin received the BS degree in automatic control from Dalian Railway Institute of China in 1997, and the MS degree in flight control
from Beijing University of Aeronautics and Astronautics of China in 2001. Since 2001 she has been a Ph.D. student in the OBR
Research Center for Distributed and Mobile Computing at the University of Cincinnati. Her research interests include performance
evaluation of 802.11 MAC protocol, wireless ad hoc networks and sensor networks. She is a student member of the IEEE.
Dharma P.Agrawal IEEE Fellow, 1987; ACM Fellow, 1998; AAAS Fellow, 2003 Dr. Agrawal is the Ohio Board of Regents Distinguished Professor of
Computer Science and Computer Engineering in the department of Electrical and Computer Engineering and Computer Science, University
of Cincinnati, OH. He has been a faculty member at Wayne State University, (1977–1982) and North Carolina State University
(1982–1998). He has been a consultant to the General Dynamics Land Systems Division, Battelle, Inc., and the U. S. Army. He
has held visiting appointment at AIRMICS, Atlanta, GA, and the AT&T Advanced Communications Laboratory, Whippany, NJ. He has
published a number of papers in the areas of Parallel System Architecture, Multi computer Networks, Routing Techniques, Parallelism
Detection and Scheduling Techniques, Reliability of Real-Time Distributed Systems, Modeling of C-MOS Circuits, and Computer
Arithmetic. His recent research interest includes energy efficient routing, information retrieval, and secured communication
in ad hoc and sensor networks, effective handoff handling and multicasting in integrated wireless networks, interference analysis
in piconets and routing in scatternet, use of smart directional antennas (multibeam) for enhanced QoS, Scheduling of periodic
real-time applications and automatic load balancing in heterogeneous workstation environment. He has four approved patents
and three patent filings in the area of wireless cellular networks. 相似文献
3.
《International Journal of Parallel, Emergent and Distributed Systems》2012,27(1-3):165-184
The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature. 相似文献
4.
5.
6.
包括IEEE802.11、802.15.4标准在内的许多无线网络协议都采用二进制指数退避机制管理数据的重发。在动态分布式的网络环境中,二进制指数退避算法固定的竞争窗口递减方式难以适应动态变化的网络规模。针对这一问题,提出了一种改进的回退机制,该机制通过引入竞争窗口递减因子,自适应地调整无线节点的等待时间,以实现网络吞吐量的最大化。同时,在算法实现上提出一种启发式算法以跟踪网络中竞争节点数量的改变。在IEEE 802.11DCF协议中以相同的物理层参数进行仿真,结果表明改进算法提高了网络吞吐量,降低了分组平均接入时延。 相似文献
7.
PADUA Divid 《中国科学F辑(英文版)》2009,52(1):59-69
Task scheduling is an essential aspect of parallel process system. This NP-hard problem assumes fully connected homogeneous
processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication
contention has a strong influence on the execution time of a parallel application. This paper investigates the incorporation
of contention awareness into task scheduling. The innovation is the idea of dynamically scheduling edges to links, for which
we use the earliest finish communication time search algorithm based on shortest-path search method. The other novel idea
proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary processor network.
In the end, to reduce time complexity of algorithm, a parallel algorithm is proposed and speedup O(PPE) is achieved. The comparison study, based on both randomly generated graphs and the graphs of some real applications,
shows that our scheduling algorithm significantly surpasses classic and static communication contention awareness algorithm,
especially for high data transmission rate parallel application.
Supported by the National Natural Science Foundation of China (Grant Nos. 90715029 and 60603053), the Cultivation Fund of
the Key Scientific and Technical Innovation Project, Ministry of Edacation of China, and the Key Project of Science & Technology
of Hunan Province (Grant No. 2006GK2006) 相似文献
8.
We consider the problem of minimizing contention in static (read-only) dictionary data structures, where contention is measured with respect to a fixed query distribution by the maximum expected number of probes to any given cell. The query distribution is known by the algorithm that constructs the data structure but not by the algorithm that queries it. Assume that the dictionary has n items. When all queries in the dictionary are equiprobable, and all queries not in the dictionary are equiprobable, we show how to construct a data structure in O(n) space where queries require O(1) probes and the contention is O(1/n). Asymptotically, all of these quantities are optimal. For arbitrary query distributions, we construct a data structure in O(n) space where each query requires O(logn/loglogn) probes and the contention is O(logn/(nloglogn)). The lack of knowledge of the query distribution by the query algorithm prevents perfect load leveling in this case: for a large class of algorithms, we present a lower bound, based on VC-dimension, that shows that for a wide range of data structure problems, achieving contention even within a polylogarithmic factor of optimal requires a cell-probe complexity of Ω(loglogn). 相似文献
9.
为了改进流媒体在无线多跳网络中的传输质量,提出一种TCP友好的拥塞控制算法.该算法考虑了MAC层的信道竞争,节点通过标记数据包来通知数据流它的竞争状态,数据流基于所估计的竞争状态来控制传输速率.仿真结果表明所提出的算法能更有效地利用带宽,与已存在的算法相比,有较高的吞吐量和较好的平滑性. 相似文献
10.