Advances in Computing Science — ASIAN 2000: 6th Asian Computing Science Conference Penang, Malaysia, November 25–27, 2000 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The Asian Computing Science Conference (ASIAN) series was initiated in 1995 to provide a forum for researchers in computer science in Asia to meet and to promote interaction with researchers from other regions. The previous ?ve conferences were held, respectively, in Bangkok, Singapore, Kathmandu, Manila, and Phuket. The proceedings were published in the Lecture Notes in Computer Science Series of Springer-Verlag. This year’s conference (ASIAN2000) attracted 61 submissions from which 18 papers were selected through an electronic program committee (PC) meeting. The themes for this year’s conference are: – Logics in Computer Science – Data Mining – Networks and Performance The key note speaker for ASIAN2000 is Jean Vuillemin (ENS, France) and the invited speakers are Ramamohanarao Kotagiri (U. Melbourne, Australia) and Alain Jean-Marie (LIRMM, France). We thank them for accepting our - vitation. This year’s conference is sponsored by the Asian Institute of Technology (Thailand), INRIA (France), the National University of Singapore (Singapore), and UNU/IIST (Macau SAR, China). We thank all these institutions for their continued support of the ASIAN series. This year’s conference will be held in Penang, Malaysia. We are much obliged to Universiti Sains Malaysia and Penang State Government for providing the conference venue and to Dr. Abdullah Zawawi Haji Talib for making the local arrangements. We also wish to thank the PC members and the large number of referees for thesubstantialworkputinbytheminassessingthesubmittedpapers.

Author(s): Jean Vuillemin (auth.), He Jifeng, Masahiko Sato (eds.)
Series: Lecture Notes in Computer Science 1961
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000

Language: English
Pages: 306
Tags: Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Artificial Intelligence (incl. Robotics); Computer Communication Networks; Algorithm Analysis and Problem Complexity

Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables....Pages 1-12
Performance Evaluation of Networks: New Problems and Challenges....Pages 13-14
Emerging Patterns and Classification....Pages 15-32
IPv6 Performance Analysis on FreeBSD Workstation Using Simple Applications....Pages 33-42
Performance of Location Caching Scheme to Support Call Locality in Wireless Networks....Pages 43-57
A Practical Parity Scheme for Tolerating Triple Disk Failures in RAID Architectures....Pages 58-68
Genetic Algorithm for Extended Cell Assignment Problem in Wireless ATM Network....Pages 69-87
Spatial Congruence for Ambients Is Decidable....Pages 88-103
A Spatio-temporal Representation Scheme for Modeling Moving Objects in Video Data....Pages 104-118
Node-to-Set Disjoint Paths Problem in Rotator Graphs....Pages 119-132
On Simulation-Checking with Sequential Systems....Pages 133-148
Reusing Animations in Databases for Multimedia Presentations....Pages 149-161
Reflecting BDDs in Coq....Pages 162-181
On Model Checking Synchronised Hardware Circuits....Pages 182-198
Safe Ambients: Control Flow Analysis and Security....Pages 199-214
Security Types for Mobile Safe Ambients....Pages 215-236
Improving Functional Logic Programs by Difference-Lists....Pages 237-254
A New Multihop Logical Topology for Reliable Broadband Communication....Pages 255-262
A New Scalable Topology for Multihop Optical Networks....Pages 263-272
On Computable Tree Functions....Pages 273-289
Sharpening the Undecidability of Interval Temporal Logic....Pages 290-298