检索结果-内蒙古大学图书馆

IEEE International Conference on Communications (ICC)

作者： Jian Zhu A. Matrawy I. Lombadaris M. Ashourian Department of Systems and Computer Engineering Carleton University Ottawa Ontario Canada Carleton University Ottawa ON CA Dept. of Syst. & Comput. Eng. Carleton Univ. Ottawa Ont. Canada Islamic Azad University of Iran Majlesi Branch Isfahan Iran

Resilient packet ring (RPR) is an emerging standard for the construction of local and metropolitan area networks. The priority queue (PQ) algorithm, which is recommended as the scheduling scheme for RPR always gives priority to the transit buffer. Using this scheduling scheme in single transit buffer RPR, the high priority traffic, such as video packets waiting to access the ring at congested node in the transmit buffer will suffer large delays and unsteady delay jitters. In this paper, we propose a new scheduling scheme for RPR to improve the quality of service for video traffic transmission. The proposed scheduling scheme alternately selects packets from the single transit buffer and the high priority transmit buffer using deficit round-robin (DRR) algorithm. If there is no packet in the above two buffers, low priority transmit buffer is then served. We investigate the syst.m performance for transmission of MPEG-4 encoded bitstream as high priority traffic in an RPR network in scenario that all traffic is forwarded to a common node. We report end-to-end delay and delay jitter for I, P and B frames of several encoded video streams. Simulation results show certain improvement on overall delay and delay jitter performance for all types of video frames, especially for I frames which are the most important frames for video reconstruction.

关键词： MPEG 4 Standard Streaming media Delay Traffic control Telecommunication traffic Jitter Scheduling algorithm Metropolitan area networks Quality of service Round robin

来源：评论

学校读者我要写书评

暂无评论

Selecting distances in arrangements of hyperplanes spanned by points

引用

Journal of Discrete Algorithms 2004年第3期2卷 333-345页

作者： Bespamyatnikh, Sergei Segal, Michael Department of Computer Science University of Texas at Dallas Richardson TX 75083 United States Commun. Syst. Engineering Department Ben-Gurion University of the Negev Beer-Sheva 84105 Israel

In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k, 1 &le k &le (d), determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(n log2 n) runtime algorithm using parametric search partly different from the usual approach [N. Megiddo, J. ACM 30 (1983) 852]. We establish a connection between this problem in 3-d and the well-known 3 SUM problem using an auxiliary problem of counting the number of vertices in the arrangement of n planes that lie between two sheets of a hyperboloid. We show that the 3-d problem is almost 3SUM-hard and solve it by an O(n2 log2 n) runtime algorithm. We generalize these results to the d-dimensional (d ≥ 4) space and consider also a problem of enumerating distances. © 2003 Elsevier B.V. All rights reserved.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Spectral interpretation of a handover overflow process in a hiearchical cellular network

Spectral interpretation of a handover overflow process in a ...

引用

2004 9th IEEE Singapore International Conference on Communication syst.ms, ICCS

作者： Seo, Jun-Bae Lee, Seung-Que Park, Nam-Hoon Lee, Hyong-Woo Cho, Choong-Ho ETRI Deparment of Wireless Syst. Research Korea University Dept. of Electronics Engineering Korea University Department of Computer Science

ISBN: (纸本)0780385497

In this paper, queueing effects on handover calls in a hierarchical cellular network are examined by varying call holding times, cell dwell times, signal degradation interval and queue size, especially in terms of handover call dropping probability and the power spectral density (PSD) of handover overflow process. Using the PSD, it is found in the numerical examples that queue for handover calls and large signal degradation interval, that is, large handover region, can remove occurrence of the short overflow periods which are related to low dropping rate of handover calls and that handover calls with high mobility induce the long overflow periods which are related to high dropping rate. It is also concluded that large queue size over two, can not give significant enhancement on call performance, because long overflow periods remain to be the dominant factor on the performance.

关键词： Wireless telecommunication syst.ms

来源：评论

学校读者我要写书评

暂无评论

Pattern recovery in networks of recursive processing elements with continuous learning

Pattern recovery in networks of recursive processing element...

引用

2004 IEEE International Joint Conference on Neural Networks - Proceedings

作者： Del Moral Hernandez, Emílio Moral Sandmann, Humberto Da Silva, Leandro Augusto Dept. of Electron. Syst. Engineering University of Sao Paulo Sao Paulo Brazil Department of Computer Engineering University of Sao Paulo Sao Paulo Brazil

This paper addresses a continuous learning method using associative memories based on recursive processing elements (RPEs). In order to decide if a pattern recovered by the associative RPEs is known or unknown, we are using two discriminators: a network stabilization criterion and a Hamming distance criterion. The network stabilization criterion is based on the disagreement between the current and the next state, and the Hamming distance criterion checks the number of bits flipped between the prompting pattern and the recovered pattern. Experiments for the performance of continuous learning when the prompting patterns are exposed to digital noise and experiments for the evaluation of the capacity of network storage are presented and analyzed.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

JPEG rate control algorithm for multimedia

JPEG rate control algorithm for multimedia

引用

IEEE International Symposium on Consumer Electronics

作者： Bruna, A Smith, S Vella, F Naccari, F STMicroelectronics Imaging and Multimedia Labs Catania's Adv. Syst. Technol. Div. STMicroelectronics Edinburgh Laboratories Imaging Division United Kingdom University of Palermo Department of Computer Engineering Italy

ISBN: (纸本)0780385268

The JPEG (Joint picture Experts Group) file format is the most used still image compression standard. It allows obtaining high compression ratios with good image quality. Unfortunately it is difficult to estimate the compression ratio, i.e. the bit per pixel, due to the presence of the variable length encoding algorithm. For this reason, a compression factor control algorithm is required to obtain the target file, size. In this paper we describe a novel technique allowing the rate control with an iterative algorithm. Its main feature is the very fast converging function. Moreover, thanks to its properties, it can be used for video encoding when the Motion JPEG compression data format is used.

关键词： bit per pixel compression JPEG quantization

来源：评论

学校读者我要写书评

暂无评论

On hierarchical extensions of large-scale 4-regular grid network structures

On hierarchical extensions of large-scale 4-regular grid net...

引用

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04

作者： Pedersen, Jens Myrup Patel, Ahmed Knudsen, Thomas Phillip Madsen, Ole Brun Department of Control Engineering Aalborg University DK-9220 Aalborg East Denmark Comp. Netwk./Distributed Syst. R.G. Department of Computer Science University College Dublin Belfield Dublin 4 Ireland

ISBN: (纸本)1932415262

It is studied how the introduction of ordered hierarchies in 4-regular grid network structures decreases distances remarkably, while at the same time allowing for simple topological routing schemes. Both meshes and tori are considered;In both cases non-hierarchical structures have power-law dependencies between the number of nodes and the distances in the structures. The perfect square mesh is introduced for hierarchies, and it is shown that applying ordered hierarchies in this way results in logarithmic dependencies between the number of nodes and the distances, resulting in better scaling structures. For example, in a mesh of 391876 nodes the average distance is reduced from 417.33 to 17.32 by adding hierarchical lines. This is gained by increasing the number of lines by 4.20% compared to the non-hierarchical structure. A similar hierarchical extension of the torus structure also results in logarithmic dependencies, the relative difference between performance of mesh and torus structures being less significant than for non-hierarchical structures, especially for large structures. The skew and extended meshes are introduced as variants of the perfect square mesh and their performances studied, and it is shown that while they allow for more flexibility in design and construction of structures supporting topological routing, their performances are comparable to the performance of the perfect square mesh. Finally suggestions for further research within the field is given.

关键词： Large scale syst.ms

来源：评论

学校读者我要写书评

暂无评论

Signal propagation delay as a barrier to control applications in WAN

Signal propagation delay as a barrier to control application...

引用

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04

作者： Knudsen, Thomas Phillip Patel, Ahmed Pedersen, Jens Myrup Madsen, Ole Brun Department of Control Engineering Aalborg University Aalborg East DK 9220 Denmark Comp. Netwk. Distributed Syst. R. G. Department of Computer Science University College Dublin Belfield Dublin 4 Ireland

ISBN: (纸本)1932415262

With the advent in WAN of delay sensitive technical applications, such as remote control, signal propagation delay becomes a major problem. The extent of the problem is analysed by lower bounding the delay in relation to different transmission media. Requirements for reliability and bandwidth are considered. The consequences of this bounding for communication network planning and provisioning are discussed in relation to mitigating the effects of signal propagation delay as a barrier to the penetration of control applications into WAN.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

Chain-packet switching

Chain-packet switching

引用

Proceedings - 18th International Conference on Advanced Information Networking and Applications, AINA 2004

作者： Wang, Zhen-Xing Wang, He-Ming Zhang, Yan-Xiao Sun, Ya-Min Wu, Jiang-Xing Computer Department Nanjing Univ. of Sci. and Technology Nanjing China Information Science Department Information Engineering University Zhengzhou China College of Information Engineering Zhengzhou University Zhengzhou China Information Research Department Univ. of Information Engineering Zhengzhou China Natl. Digit Switching Syst. Eng. Technological Research Center Zhengzhou China

ISBN: (纸本)0769520510

It is difficult for routers to detect if traffic is a data flow suitable to be mapped to a circuit, or several sporadic packets only being better forwarded respectively. Based on the research of the characteristics of data flows, this paper introduces new concept, chain-packet, which wrap data into a chain of packets making flow detecting easy;presents a flexible and efficient switching mechanism, chain-packet switching, with which both sporadic packets and flow traffics can be forwarded across the Internet efficiently. The research results can not only improve the performance of those approaches directly based on the existing traditional packet previously, but also be propitious to QOS, traffic engineering, traffic measurements, and traffic accounts.

关键词： Internet

来源：评论

学校读者我要写书评

暂无评论

A hierarchical placement method for standard cell layout based on wire length driven clustering

A hierarchical placement method for standard cell layout bas...

引用

The 2004 47th Midwest Symposium on Circuits and syst.ms - Conference Proceedings

作者： Kubota, Hajime Wakabayashi, Shin'ichi Koide, Tetsushi Dept. of Artif. Complex Syst. Eng. Hiroshima University 4-1 Kagamiyama 1 Chome Higashi-Hiroshima 739-8527 Japan Department of Computer Engineering Faculty of Information Sciences Hiroshima City University 3-4-1 Ozuka-higashi Asaminami-ku Hiroshima 731-3194 Japan Res. Ctr. for Nanodevices and Syst. Hiroshima University 4-2 Kagamiyama 1 chome Higashi-Hiroshima 739-8527 Japan

This paper presents a new hierarchical placement method for standard cell layout. The proposed method consists of three phases, clustering of cells, hierarchical global cluster placement, and detailed cell placement. First, a set of clusters is constructed considering their internal structures. When cluster placement is determined based on simulated annealing, the wire length between clusters is estimated based on the structural information of each cluster so as to produce a good cluster placement. In the detailed cell placement phase, cells are placed in rows according to the global cluster placement, and cell placement is iteratively improved to get a final cell placement. Experimental results based on benchmark data demonstrate the effectiveness of the proposed method.

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

Network robotics, a framework for dynamic distributed architectures

Network robotics, a framework for dynamic distributed archit...

引用

2004 IEEE/RSJ International Conference on Intelligent Robots and syst.ms (IROS)

作者： Baker, Duncan I. McKee, Gerard T. Schenker, Paul S. University of Reading Department of Computer Science School of Systems Engineering Reading Berkshire RG6 6AY United Kingdom Mobility Syst. Concept Devmt. Sect. Jet Propulsion Laboratory M/S 125-224 4800 Oak Grove Drive Pasadena CA United States

ISBN: (纸本)0780384636

In this paper we present the Networked Robotics approach to dynamic architecture creation. Building on our prior work we highlight the ease at which syst.m and architecture creation can be moved from the single robot domain to the cooperative/multiple robotic domain;indeed under the Networked Robotic framework there are no differences between the two, as a multiple, cooperative, robotic architecture simply emerges from a richer network environment (the module pool). Essentially task-driven architectures are instantiated on an as needed basis, allowing conceptualised designs to be run wherever a suitable framework (i.e. a module pool) exists. In this paper we demonstrate this framework applied in the creation of a multi robot syst.m, highlighting the flexibility and robustness of the approach, and the experimental freedom inherent within it. The approach has been tested experimentally.

关键词： Robotics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：