Title of the Paper: An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
Authors: Chang-Rui Yu and Yan Luo
Abstract: This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of the algorithm. Then the paper introduces the simulated annealing (SA) algorithm and incorporates the ideas of SA into two of the arithmetic operators of NP algorithm to form the combined NP/SA algorithm. Moreover, the paper presents the explicit optimization procedure of the combined algorithm NP/SA and explains the feasibility and superiority of it. The NP/SA algorithm adopts the global optimization ability of NP algorithm and the local search ability of SA algorithm so that it improves the optimization efficiency and the convergence rate. This paper also illustrates the NP/SA algorithm through an optimization example.
Keywords: Nested partitions algorithm, Simulated annealing, Complex decision problem.
Title of the Paper: Faulty-Tolerant Algorithm for Mapping a Complete Binary Tree in an IEH
Authors: Shih-Jung Wu, Jen-Chih Lin, and Huan-Chao Keh
Abstract: Different parallel architectures may require different algorithms to make the existent algorithms on one architecture be easily transformed to or implemented on another architecture. This paper proposes a novel algorithm for embedding complete binary trees in a faulty Incrementally Extensible Hypercube (IEH). Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n+1) faults can be tolerated with dilation 3, congestion 1 and load 1. The presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible. According to the result, we can map the parallel algorithms developed by the structure of complete binary tree in an IEH. These methods of reconfiguring enable extremely high-speed parallel computation.
Keywords: Hypercube, Incrementally Extensible Hypercube, Complete binary tree, Fault-Tolerance, Embedding
Title of the Paper: Height, Size Performance of Complete and Nearly Complete Binary Search Trees in Dictionary Applications
Authors: Ahmed Tarek
Abstract: Trees are frequently used data structures for fast access to the stored data. Data structures like arrays, vectors and linked lists are limited by the trade-off between the ability to perform a fast search and the ability to resize easily. Binary Search Trees are an alternative data structure that is both dynamic in size and easily searchable. Now-a-days, more and more people are getting interested in using electronic organizers and telephone dictionaries avoiding the hard copy counter parts. In this paper, performance of complete and nearly complete binary search trees are analyzed in terms of the number of tree nodes and the tree heights. Analytical results are used together with an electronic telephone dictionary for a medium sized organization. It�s performance is evaluated in lieu of the real-world applications. The concept of multiple keys in data structure literature is relatively new, and was first introduced by the author. To determine the dictionary performance, another algorithm for determining the internal and the external path lengths is also discussed. New results on performance analysis are presented. Using tree-sort, individual records inside the dictionary may be displayed in ascending order.
No comments:
Post a Comment