By Topic

Information Engineering, 2009. ICIE '09. WASE International Conference on

Date 10-11 July 2009

Go

Filter Results

Displaying Results 1 - 25 of 126
  • [Front cover - Vol 2]

    Publication Year: 2009 , Page(s): C1
    Request Permissions | PDF file iconPDF (7539 KB)  
    Freely Available from IEEE
  • [Title page i - Volume 2]

    Publication Year: 2009 , Page(s): i
    Request Permissions | PDF file iconPDF (23 KB)  
    Freely Available from IEEE
  • [Title page iii - Volume 2]

    Publication Year: 2009 , Page(s): iii
    Request Permissions | PDF file iconPDF (113 KB)  
    Freely Available from IEEE
  • [Copyright notice - Volume 2]

    Publication Year: 2009 , Page(s): iv
    Request Permissions | PDF file iconPDF (148 KB)  
    Freely Available from IEEE
  • Table of contents - Volume 2

    Publication Year: 2009 , Page(s): v - xii
    Request Permissions | PDF file iconPDF (169 KB)  
    Freely Available from IEEE
  • Preface - Volume 2

    Publication Year: 2009 , Page(s): xiii
    Request Permissions | PDF file iconPDF (82 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organizing Committee - Volume 2

    Publication Year: 2009 , Page(s): xiv
    Request Permissions | PDF file iconPDF (74 KB)  
    Freely Available from IEEE
  • Technical Program Committee - Volume 2

    Publication Year: 2009 , Page(s): xv
    Request Permissions | PDF file iconPDF (89 KB)  
    Freely Available from IEEE
  • Reviewers - Volume 2

    Publication Year: 2009 , Page(s): xvi
    Request Permissions | PDF file iconPDF (67 KB)  
    Freely Available from IEEE
  • Case Study on Dynamic Evolution of Software Based on AOP

    Publication Year: 2009 , Page(s): 3 - 8
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (414 KB) |  | HTML iconHTML  

    Many software must be upgraded continuously and dynamically for the bugs and the needs of new function as well as the change of environment. Dynamic evolution to software contains the adding, modifying, deleting of software modules and the transferring of states from the old version to the new one. In this paper, we propose an AOP based method that (1) views the evolution of modules as aspects, (2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic Algorithm for Hybrid Flow-Shop Scheduling with Parrel Batch Processors

    Publication Year: 2009 , Page(s): 9 - 13
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (172 KB) |  | HTML iconHTML  

    In classical flow-shop scheduling problem, each processor can process one job at a time. However, in practice, there may be many processors that can process jobs batch by batch. We call these processors batch processors. If the processing time of a batch is equal to the largest processing time among its members, we call such a batch processor parallel batch processor. In this paper, we study the h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Identity-Based Proxy Signature from Bilinear Pairings

    Publication Year: 2009 , Page(s): 14 - 17
    Request Permissions | Click to expandAbstract | PDF file iconPDF (192 KB) |  | HTML iconHTML  

    Currently, ID-based PKC has attracted much attention and got many achievements. Proxy signature allows an original signer to delegate his private key to a proxy signer to sign some message on behalf of the original signer. We present a ID-based proxy signature in this paper. The scheme is relatively efficient as there is no pairing computation during the Delegation and PSign phases. It is secure a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Energy-Aware AODV Routing Protocol

    Publication Year: 2009 , Page(s): 18 - 21
    Request Permissions | Click to expandAbstract | PDF file iconPDF (291 KB) |  | HTML iconHTML  

    Ad hoc mobile network is a highly dynamic wireless network, routing is the key issues in application. The most of current routing protocols perform not well on energy-saving, for which a improved energy-saving AODV is proposed. The protocol proposes a strategy for energy levels and improved Hello mechanisms. Simulations and related analyses show that in large-scale ad hoc network, the routing prot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Cognitive Radio Node Engine Based on Genetic Algorithm

    Publication Year: 2009 , Page(s): 22 - 25
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (199 KB) |  | HTML iconHTML  

    The radio frequency spectrum is a scarce natural resource, so it is very important to use the spectrum efficiently. Cognitive radio, which can greatly improve the spectrum utilization, is able to adjust the transmit parameters according to the environment. In this paper, an adaptive multi-objective genetic algorithm is proposed to design the cognitive radio engine. In order to improve the performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm of Static Load Balance Based on Topology for MPLS Traffic Engineering

    Publication Year: 2009 , Page(s): 26 - 28
    Request Permissions | Click to expandAbstract | PDF file iconPDF (227 KB) |  | HTML iconHTML  

    Aimed to the limitations of traditional routing algorithms and to perfect MPLS application in the domain of load balance, an algorithm of static load balance based on topology is designed in this dissertation. When the shortest path is congested in the network, the algorithm is used to find a low load sub-shortest path for the congestion path based on the bandwidth occupied situation and the topol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel Routing Algorithms for Hierarchical Architecture in ASON

    Publication Year: 2009 , Page(s): 29 - 32
    Request Permissions | Click to expandAbstract | PDF file iconPDF (402 KB) |  | HTML iconHTML  

    The hierarchical routing infrastructure in automatic switched optical network (ASON) is researched. Three operational algorithms MLLR (multi-layer least loaded routing algorithm), MLCR (multi-layer least congestion routing algorithm) and MROB (multi-layer routing algorithm based on backtracking) are proposed. In these algorithms, the resource coordination and balancing of multi-domain and multilay... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research of Grid-Similarity-Based Clustering Algorithm

    Publication Year: 2009 , Page(s): 33 - 36
    Request Permissions | Click to expandAbstract | PDF file iconPDF (307 KB) |  | HTML iconHTML  

    Aim at the limitations of traditional measurement method on similitude between objects, we put forward grid-similarity-based clustering algorithm (GSCA), it brings in a new criterion to measure the similitude between objects. It applies on the grid clustering and disposes the density threshold of grid by the method of density threshold that improves the precision of clustering. Besides, the GSCA a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Classifier Based on Decision Tree

    Publication Year: 2009 , Page(s): 37 - 40
    Request Permissions | Click to expandAbstract | PDF file iconPDF (256 KB) |  | HTML iconHTML  

    A new classifier ensemble learning algorithm based on decision tree is proposed. Ensemble learning algorithm is one of the algorithms which have best classification results in many classification algorithms. A decision tree algorithm is a kind of greedy algorithm, it use top-down recursive way to determine the tree structure. The proposed algorithm improved the accuracy of classification by combin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Entropy-Based Ant Clustering Algorithm

    Publication Year: 2009 , Page(s): 41 - 44
    Request Permissions | Click to expandAbstract | PDF file iconPDF (234 KB) |  | HTML iconHTML  

    Sorting and clustering methods inspired by the behavior of real ants are among the earliest methods in ant-based meta-heuristics. We revisit these methods in the context of a concrete application and introduce some modifications that yield significant improvements in terms of both quality and efficiency. In this paper, we propose an Improved entropy-based ant clustering (IEAC) algorithm. Firstly, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Depth-Dependent Fusion Algorithm for Enhanced Reality Based on Binocular Vision

    Publication Year: 2009 , Page(s): 45 - 49
    Request Permissions | Click to expandAbstract | PDF file iconPDF (5957 KB) |  | HTML iconHTML  

    As one of the pivot techniques in enhanced reality the fusion of virtual and real scene image often happens in two ways, either to incorporate a real object into a virtual environment, or to incorporate a virtual object into a real scene. Most of the conventional methods for the fusion are conducted at the image level, which fails to handle three-dimensional objects. In this paper, a novel depth-d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Ant Colony Algorithm Based on Vehicle Routing Problem with Time Windows

    Publication Year: 2009 , Page(s): 50 - 53
    Request Permissions | Click to expandAbstract | PDF file iconPDF (290 KB) |  | HTML iconHTML  

    Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid ant colony system (DSACA-VRPTW) is proposed to solve this problem. Firstly, each antpsilas solution might be improved by dynamic sweep algorithm wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum Algorithms of the Subset-Sum Problem on a Quantum Computer

    Publication Year: 2009 , Page(s): 54 - 57
    Request Permissions | Click to expandAbstract | PDF file iconPDF (265 KB) |  | HTML iconHTML  

    In this paper, quantum algorithms for solving an instance of the subset-sum problem is proposed and a NMR experiment for the simplest subset-sum problem to test our theory is also performed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Ultralightweight RFID Protocol with Mutual Authentication

    Publication Year: 2009 , Page(s): 58 - 61
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (231 KB) |  | HTML iconHTML  

    Due to the well-developed technology and its variety of applications, the radio frequency identifications (RFIDs) become more and more popular. In many applications such as authentication, the RFID systems need security mechanism to resist all possible attacks and threats. However, most of the security mechanisms always too complex on computation or need large memory space such that they are not s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bionic Learning Algorithm Based on Skinner's Operant Conditioning and Control of Robot

    Publication Year: 2009 , Page(s): 62 - 65
    Request Permissions | Click to expandAbstract | PDF file iconPDF (251 KB) |  | HTML iconHTML  

    Aiming at the problem about the movement balance control of two-wheeled self-balancing mobile robot, a learning algorithm that it is made up of BP neural network and eligibility traces based on the operant conditioning theory is put forward as a learning mechanism of the two-wheeled robot. The algorithm utilizes the characters of eligibility traces about quicker learning speed, higher reliability ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptable Anycast Routing Algorithm Based on Density and Proximity

    Publication Year: 2009 , Page(s): 66 - 69
    Request Permissions | Click to expandAbstract | PDF file iconPDF (268 KB) |  | HTML iconHTML  

    Most existing anycast routing algorithms are based on shortest path algorithm. In this paper, an adaptable anycast routing algorithm based on density and proximity is proposed. While determining anycast member, both the proximity factor and nearby anycast members number of the target (density factor) should be considered. Density is calculated on the base of field theory. In comparison with proxim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.