Vai al contenuto principale della pagina
Titolo: |
Advances in Computing Science - ASIAN 2000 : 6th Asian Computing Science Conference Penang, Malaysia, November 25-27, 2000 Proceedings / / edited by Jifeng He, Masahiko Sato
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Edizione: | 1st ed. 2000. |
Descrizione fisica: | 1 online resource (X, 306 p.) |
Disciplina: | 004 |
Soggetto topico: | Computers |
Mathematical logic | |
Computer logic | |
Artificial intelligence | |
Computer communication systems | |
Algorithms | |
Theory of Computation | |
Mathematical Logic and Formal Languages | |
Logics and Meanings of Programs | |
Artificial Intelligence | |
Computer Communication Networks | |
Algorithm Analysis and Problem Complexity | |
Persona (resp. second.): | HeJifeng |
SatoMasahiko | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables -- Performance Evaluation of Networks: New Problems and Challenges -- Emerging Patterns and Classification -- IPv6 Performance Analysis on FreeBSD Workstation Using Simple Applications -- Performance of Location Caching Scheme to Support Call Locality in Wireless Networks -- A Practical Parity Scheme for Tolerating Triple Disk Failures in RAID Architectures -- Genetic Algorithm for Extended Cell Assignment Problem in Wireless ATM Network -- Spatial Congruence for Ambients Is Decidable -- A Spatio-temporal Representation Scheme for Modeling Moving Objects in Video Data -- Node-to-Set Disjoint Paths Problem in Rotator Graphs -- On Simulation-Checking with Sequential Systems -- Reusing Animations in Databases for Multimedia Presentations -- Reflecting BDDs in Coq -- On Model Checking Synchronised Hardware Circuits -- Safe Ambients: Control Flow Analysis and Security -- Security Types for Mobile Safe Ambients -- Improving Functional Logic Programs by Difference-Lists -- A New Multihop Logical Topology for Reliable Broadband Communication -- A New Scalable Topology for Multihop Optical Networks -- On Computable Tree Functions -- Sharpening the Undecidability of Interval Temporal Logic. |
Sommario/riassunto: | 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. |
Titolo autorizzato: | Advances in Computing Science - ASIAN 2000 ![]() |
ISBN: | 3-540-44464-5 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910143609403321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |