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

IEEE Sarnoff Symposium

作者： Jian Pu Mounir Hamdi Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

ISBN: (纸本)9781424400027;1424400023

Quick Flow Control Protocol (QFCP) is a new congestion control protocol designed for high bandwidth-delay product networks. QFCP has two good features: "quick start" and "quick convergence". It allows a sender to start with a high initial sending rate identified by routers along the path, and all running flows converge to the fair-share sending rate quickly based on feedback from routers. Although it needs the assistance of routers, QFCP does not require routers to store any per-flow information or to do any complex per-packet calculation. The rate allocation algorithm is quite simple and only needs to be run periodically by routers. We have implemented QFCP in Network Simulator (NS). Simulations have been done to address the issues such as fairness, convergence, responsiveness and utilization, as well as flow completion time for Poison-arriving Pareto-distributed-size flows. Performance evaluation of these simulations is presented in this paper. The preliminary results are promising.

关键词： Routers Next generation networks flow control information flow control protocol allocation algorithm Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Efficient audio coding with optimized subband configurations

Efficient audio coding with optimized subband configurations

引用

Workshop on Applications of Signal Processing to Audio and Acoustics

作者： Ali, MT Mian, MS Univ Engn & Technol Dept Elect Engn Lahore Pakistan

ISBN: (纸本)0780391543

A dynamic subbands design selection scheme for perceptual audio coding is presented which optimizes the coding efficiency in association with all improved utilization of the masking potential of the signal. The choices for subbands design Selection include critical hands, uniform subbands, uniform subbands with a non-uniform last hand and a non-uniform-non-critical (NUNC) subbands distribution. A particular consideration is given to corresponding critical band boundaries while formulating NUNC subbands, to minimize the perception of coding noise. The design selection decision is made by First identifying the best tradeoff between empty quantizer slots and amount of side information, followed by a minimization or the perceptual entropy (PE) estimates. A further analysis is carried Out to identify the prominent spectral peaks (PSPs), with a view to efficiently utilize their masking potential by the bit allocation algorithm which makes a bit cut first to subbands with PSPs. Test results based oil ITU-R recommendation BS.1 116 show that Our coding scheme performs slightly better as compared to MPEG-4 AAC verification model (V-M) for a majority of signal types from the SQAM database. The paper Concludes with a discussion Of future research implications of the work.

关键词： audio coding entropy ITU-R recommendation BS.1116 MPEG-4 AAC verification model SQAM database bit allocation algorithm coding efficiency coding noise critical bands dynamic subbands design selection scheme nonuniform last band nonuniform-noncritical subb Audio coding Subbands allocation algorithm critical band entropy code efficiency side information

来源：评论

学校读者我要写书评

暂无评论

Linkage identification for real-valued loci by fitness difference classification

Linkage identification for real-valued loci by fitness diffe...

引用

IEEE Congress on Evolutionary Computation

作者： Tsuji, M Munetomo, M Akama, K Hokkaido Univ Sapporo Hokkaido Japan

ISBN: (纸本)0780393635

In order to enhance efficiency of genetic algorithms, it is important to identify a linkage set, i.e. a set of loci tightly linked to construct a building block. In this paper, we propose a novel linkage identification method for real-valued strings called the real-valued Dependency Detection for Distribution Derived from df (rD(5)). It can detect linkage sets with quasi-linear fitness evaluations. The rD(5) is designed based on the D-5 which has been proposed for binary strings. It detects dependencies of loci by estimating the distribution of strings classified according to fitness differences. The rD(5) and the LINC-R which is one of linkage identification methods proposed elsewhere, provide approximate equivalent information about a function to be solved, however, the rD(5) performs smaller number of fitness evaluations than the LINC-R for larger functions. Although estimation of distribution algorithms (EDAs) also estimate distribution of strings, it is difficult for EDAs to solve a function composed of exponentially scaled sub-functions. The proposed method, by contrast, can be applied to the function in the similar way to as to a function composed of uniformly scaled sub-functions which is easy for EDAs. We perform experiments to compare the proposed method with the LINC-R and to examine the scaling effect stability of the rD(5). We also investigate two parameters, that define the amount of perturbation (mutation) and that define the quantization level.

关键词： estimation theory genetic algorithms pattern classification string matching binary strings estimation of distribution algorithm exponentially scaled subfunctions fitness difference classification linkage identification mutation perturb Genetic algorithm (GA) binary string estimation theory String matching Pattern recognition Cosmic strings quantization level allocation algorithm health

来源：评论

学校读者我要写书评

暂无评论

Development of an advanced encoder for HDTV broadcasting

引用

SMPTE MOTION IMAGING JOURNAL 2004年第12期113卷 419-424页

作者： Yasuda, H Miyazawa, S Honma, Y Waseda University in Japan

A new video encoder for MPEG-2 HDTV (MP@HL (1080i)), which achieves good performance at 11 Mbits/sec, has been developed. It is a higher video quality encoder than the TM5 MPEG-2 video encoding algorithm, the algorithm test model used during MPEG-2 standard development. Many problems were found in low bit rate domains (around 11 Mbits/sec), and to correct these problems, the traditional method was tuned up, and a new method was established. Pre-encoding architecture and a flexible group-of-pictures (GOP) structure were adopted to achieve high-compression performance. The control of symbols distribution algorithm and pre-filtering-logic were also adopted, and attempts were made to assign more discrete cosine transform (DCT) coefficients while optimizing-the method for computing motion vectors. Using these methods, a signal-to-noise ration (SNR) about 4-dB higher than TM5 was achieved.

关键词： Videotapes discrete cosine transforms allocation algorithm broadcasting ENCODER motion vector

来源：评论

学校读者我要写书评

暂无评论

Soft-bar: A network-assisted resource allocation algorithm for throughput maximization and QoS provisioning in wireless data networks

Soft-bar: A network-assisted resource allocation algorithm f...

引用

IEEE Wireless Communications and Networking Conference

作者： Chawla, K Qiu, XX Chuang, J Sollenberger, N AT&T Labs Res Red Bank NJ 07701 USA

ISBN: (纸本)0780365968

We propose a network assisted radio resource allocation algorithm for wireless data networks with synchronized base stations, which support variable rate transmission. The algorithm, Soft-Bar may be used in both mobile and fixed wireless systems to assign the channel, transmission mode and transmit power for each user, and may be implemented in a distributed manner. The basic idea of the algorithm is to use measurements at the base and the terminal, and limited, real-time inter-base signaling, to control the interference generated by the few dominant interferers for each user. We show that in an EDGE-like system using 1/3 reuse, compared to conventional random packet assignment, Soft-Bar ran (I) increase the system throughput by more than 50% for a given delay constraint;or (2) increase the number of users by more than 30% for a given user outage requirement, while at the same time improving the user experience. In addition, it can facilitate QoS provisioning in a straight-forward manner.

关键词： wireless data CARRIER SYSTEM DADANET algorithms Resource utilization management of resources Quality of service Throughput BASE STATION Transmitter power allocation algorithm provisioning

来源：评论

学校读者我要写书评

暂无评论

Optimality and greed in dynamic allocation

引用

JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2001年第2期41卷 244-261页

作者： Winkler, P Bell Labs Murray Hill NJ 07974 USA

In dynamic allocation items arrive and depart randomly and while present are stored in a limited facility;the job of an allocation algorithm is to decide whether and where to store an arriving item, while trying to minimize the cost incurred by rejections. Ordinarily, to prove the value of such an algorithm, one must either assume a specific arrival distribution (e.g., Poisson-lambda), or try to obtain bounds relative to an adversary (as in competitive analysis). We present here a novel method of proving precise optimality for certain kinds of dynamic allocation algorithms, without assuming a specific arrival distribution. We do need to assume memoryless departure for at least some item types, and most importantly, we must assume conditions are such that it is not right to reject arrivals unnecessarily. The method is applied to two simple call assignment problems which arose, in quite different circumstances, at Lucent Technologies. In both cases the method was successful in showing that the intuitively best assignment algorithm really does minimize expected cost under fairly general, and essentially necessary, assumptions. (C) 2001 Elsevier Science.

关键词： dynamic allocation Rejection (Psychology) greedy method allocation algorithm optimality

来源：评论

学校读者我要写书评

暂无评论

An efficient data structure for dynamic memory management

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2000年第3期54卷 219-226页

作者： Chang, JM Daugherty, CH IIT Dept Comp Sci Chicago IL 60616 USA

Advances in software engineering, such as graphical user interface and object-oriented programming, have caused applications to become more memory intensive. The growing popularity of these applications increases the importance of high-performance dynamic memory management. This paper introduces a new data structure intended to increase the emciency of implementations of common dynamic memory allocation and deallocation algorithms, including First Fit. The data structure, called the Common List, establishes a relationship between the allocated and free list. This strategy increases significantly the deallocation performance. Simulation results based on the traces from publicly available software applications are presented. (C) 2000 Elsevier Science Inc. All rights reserved.

关键词： memory management run-time system allocation algorithm deallocation algorithm

来源：评论

学校读者我要写书评

暂无评论

On the algorithm for Allocating Wavelength Converters in All Optical Networks

引用

The Journal of China Universities of Posts and Telecommunications 2000年第4期7卷 44-50页

作者： WEN Xiang-ming ZHU Yun ZHU Xiang-hua Beijing University of Posts and Telecommunications Beijing 100876P.R.China

In this paper, after presenting the functions of the wavelength converter in all optical networks, we educe and analyze the blocking probabilities of the network. Based on the above, we propose an algorithm for allocating wavelength converters in all optical networks and use the computer simulations to evaluate the performance of the proposed allocation algorithm. The simulation results show that the performance of our algorithm is close to that of the optimal ones in terms of blocking probabilities. However, the time complexity of our algorithm is only O(3H+w 2/2).

关键词： all-optical network wavelength conversion blocking probability allocation algorithm All-optical networks Fiber optic networks algorithms Wavelength conversion Wavelength converters Blocking probability

来源：评论

学校读者我要写书评

暂无评论

Incorporating temporal considerations during assignment and pre-run-time scheduling of objects and processes

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1996年第1期36卷 13-31页

作者： Verhoosel, JPC Welch, LR Hammer, DK Luit, EJ NEW JERSEY INST TECHNOL DEPT COMP & INFORMAT SCINEWARKNJ 07102 EINDHOVEN UNIV TECHNOL DEPT MATH & COMP SCINL-5600 MB EINDHOVENNETHERLANDS

Object-based programming techniques help to reduce the cost of software development and maintenance due to the benefits of reuse, information hiding, and encapsulation. This is especially helpful in large, real-time systems that are highly parallel and distributed. The paper reviews a semi-preemption execution model of object-based real-time systems that simplifies reasoning about the quality of process-to-processor assignment. The model is used to define system properties such as interprocess parallelism, processor utilization, and interprocessor communication. Additionally, an innovative assignment algorithm is presented which incorporates feasibility constraints. The algorithm is guided by an objective that balances minimum communication against maximum parallelism. Experimental results show that the process assignment algorithm performs extremely well with respect to finding process assignments in isolation. The algorithm easily finds process assignments for which a feasible schedule exists as long as the number of items to be scheduled does not exceed approximately 500. (C) 1996 Academic Press, Inc.

关键词： Programs System computer software Synclitism processor utilization parallelism interprocessor communication real-time systems object orientation Reasoning encapsulation allocation algorithm

来源：评论

学校读者我要写书评

暂无评论

A timing-constrained incremental routing algorithm for symmetrical FPGAs

A timing-constrained incremental routing algorithm for symme...

引用

European Design and Test Conference

作者： Raman, S Liu, CL Jones, LG MOTOROLA INC ADV DESIGN TECHNOLAUSTINTX 78735

ISBN: (纸本)0818674237

in this paper we present a timing-constrained routing algorithm for symmetrical FPGAs which embodies a novel incremental routing strategy that combines global and detailed routing, and a routing resource allocation algorithm that takes into account both the characteristics of the routing resources and timing information. Experimental results confirm that the algorithm reduces delay along the longest path in the circuit, uses routing resources efficiently, and requires low CPU time.

关键词： Routing algorithms Network routing CPU time Incremental algorithms time information allocation algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：