Thông tin tài liệu
CuuDuongThanCong.com Algorithms and Theory of Computation Handbook Second Edition Special Topics and Techniques Edited by Mikhail J Atallah Marina Blanton CuuDuongThanCong.com Chapman & Hall/CRC Applied Algorithms and Data Structures Series Series Editor Samir Khuller University of Maryland Aims and Scopes The design and analysis of algorithms and data structures form the foundation of computer science As current algorithms and data structures are improved and new methods are introduced, it becomes increasingly important to present the latest research and applications to professionals in the field This series aims to capture new developments and applications in the design and analysis of algorithms and data structures through the publication of a broad range of textbooks, reference works, and handbooks We are looking for single authored works and edited compilations that will: r Appeal to students and professionals by providing introductory as well as advanced material on mathematical, statistical, and computational methods and techniques r Present researchers with the latest theories and experimentation r Supply information to interdisciplinary researchers and practitioners who use algorithms and data structures but may not have advanced computer science backgrounds The inclusion of concrete examples and applications is highly encouraged The scope of the series includes, but is not limited to, titles in the areas of parallel algorithms, approximation algorithms, randomized algorithms, graph algorithms, search algorithms, machine learning algorithms, medical algorithms, data structures, graph structures, tree data structures, and more We are willing to consider other relevant topics that might be proposed by potential contributors Proposals for the series may be submitted to the series editor or directly to: Randi Cohen Acquisitions Editor Chapman & Hall/CRC Press 6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 33487 CuuDuongThanCong.com Algorithms and Theory of Computation Handbook, Second Edition Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques CuuDuongThanCong.com Chapman & Hall/CRC Taylor & Francis Group 6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 33487-2742 © 2010 by Taylor and Francis Group, LLC Chapman & Hall/CRC is an imprint of Taylor & Francis Group, an Informa business No claim to original U.S Government works Printed in the United States of America on acid-free paper 10 International Standard Book Number: 978-1-58488-820-8 (Hardback) This book contains information obtained from authentic and highly regarded sources Reasonable efforts have been made to publish reliable data and information, but the author and publisher cannot assume responsibility for the validity of all materials or the consequences of their use The authors and publishers have attempted to trace the copyright holders of all material reproduced in this publication and apologize to copyright holders if permission to publish in this form has not been obtained If any copyright material has not been acknowledged please write and let us know so we may rectify in any future reprint Except as permitted under U.S Copyright Law, no part of this book may be reprinted, reproduced, transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying, microfilming, and recording, or in any information storage or retrieval system, without written permission from the publishers For permission to photocopy or use material electronically from this work, please access www.copyright.com (http:// www.copyright.com/) or contact the Copyright Clearance Center, Inc (CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400 CCC is a not-for-profit organization that provides licenses and registration for a variety of users For organizations that have been granted a photocopy license by the CCC, a separate system of payment has been arranged Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe Library of Congress Cataloging-in-Publication Data Algorithms and theory of computation handbook Special topics and techniques / editors, Mikhail J Atallah and Marina Blanton 2nd ed p cm (Chapman & Hall/CRC applied algorithms and data structures series) Includes bibliographical references and index ISBN 978-1-58488-820-8 (alk paper) Computer algorithms Computer science Computational complexity I Atallah, Mikhail J II Blanton, Marina III Title IV Series QA76.9.A43A433 2009 005.1 dc22 Visit the Taylor & Francis Web site at http://www.taylorandfrancis.com and the CRC Press Web site at http://www.crcpress.com CuuDuongThanCong.com 2009017978 Contents Preface ix Editors xi Contributors xiii Computational Geometry I D.T Lee 1-1 Computational Geometry II D.T Lee 2-1 Computational Topology Afra Zomorodian 3-1 Robot Algorithms Konstantinos Tsianos, Dan Halperin, Lydia Kavraki, and Jean-Claude Latombe 4-1 Vision and Image Processing Algorithms Concettina Guerra 5-1 Graph Drawing Algorithms Peter Eades, Carsten Gutwenger, Seok-Hee Hong, and Petra Mutzel 6-1 Algorithmics in Intensity-Modulated Radiation Therapy Danny Z Chen and Chao Wang 7-1 VLSI Layout Algorithms Andrea S LaPaugh 8-1 Cryptographic Foundations Yvo Desmedt 9-1 10 Encryption Schemes Yvo Desmedt 10-1 11 Cryptanalysis Samuel S Wagstaff, Jr 11-1 12 Crypto Topics and Applications I Jennifer Seberry, Chris Charnes, Josef Pieprzyk, and Rei Safavi-Naini 12-1 v CuuDuongThanCong.com vi Contents 13 Crypto Topics and Applications II Jennifer Seberry, Chris Charnes, Josef Pieprzyk, and Rei Safavi-Naini 13-1 14 Secure Multiparty Computation Keith B Frikken 14-1 15 Voting Schemes Berry Schoenmakers 15-1 16 Auction Protocols Vincent Conitzer 16-1 17 Pseudorandom Sequences and Stream Ciphers Andrew Klapper 17-1 18 Theory of Privacy and Anonymity Valentina Ciriani, Sabrina De Capitani di Vimercati, Sara Foresti, and Pierangela Samarati 18-1 19 Database Theory: Query Languages Nicole Schweikardt, Thomas Schwentick, and Luc Segoufin 19-1 20 Scheduling Algorithms David Karger, Cliff Stein, and Joel Wein 20-1 21 Computational Game Theory: An Introduction Paul G Spirakis and Panagiota N Panagopoulou 21-1 22 Artificial Intelligence Search Algorithms Richard E Korf 22-1 23 Algorithmic Aspects of Natural Language Processing Mark-Jan Nederhof and Giorgio Satta 23-1 24 Algorithmic Techniques for Regular Networks of Processors Russ Miller and Quentin F Stout 24-1 25 Parallel Algorithms Guy E Blelloch and Bruce M Maggs 25-1 26 Self-Stabilizing Algorithms Sébastien Tixeuil 26-1 27 Theory of Communication Networks Gopal Pandurangan and Maleq Khan 27-1 CuuDuongThanCong.com vii Contents 28 Network Algorithmics George Varghese 28-1 29 Algorithmic Issues in Grid Computing Yves Robert and Frédéric Vivien 29-1 30 Uncheatable Grid Computing Wenliang Du, Mummoorthy Murugesan, and Jing Jia 30-1 31 DNA Computing: A Research Snapshot Lila Kari and Kalpana Mahalingam 31-1 32 Computational Systems Biology T.M Murali and Srinivas Aluru 32-1 33 Pricing Algorithms for Financial Derivatives Ruppa K Thulasiram and Parimala Thulasiraman 33-1 Index CuuDuongThanCong.com I-1 CuuDuongThanCong.com Preface This handbook aims to provide a comprehensive coverage of algorithms and theoretical computer science for computer scientists, engineers, and other professionals in related scientific and engineering disciplines Its focus is to provide a compendium of fundamental topics and techniques for professionals, including practicing engineers, students, and researchers The handbook is organized along the main subject areas of the discipline, and also contains chapters from application areas that illustrate how the fundamental concepts and techniques come together to provide efficient solutions to important practical problems Thecontents of each chapter were chosen in such a manner as to help the computer professional and the engineer in finding significant information on a topic of his or her interest While the reader may not find all the specialized topics in a given chapter, nor will the coverage of each topic be exhaustive, the reader should be able to find sufficient information for initial inquiries and a number of references to the current in-depth literature In addition to defining terminology and presenting the basic results and techniques for their respective topics, the chapters also provide a glimpse of the major research issues concerning the relevant topics Compared to the first edition, this edition contains 21 new chapters, and therefore provides a significantly broader coverage of the field and its application areas This, together with the updating and revision of many of the chapters from the first edition, has made it necessary to move into a two-volume format It is a pleasure to extend our thanks to the people and organizations who made this handbook possible First and foremost the chapter authors, whose dedication and expertise are at the core of this handbook; the universities and research laboratories with which the authors are affiliated for providing the computing and communication facilities and the intellectual environment for this project; Randi Cohen and her colleagues at Taylor & Francis for perfect organization and logistics that spared us the tedious aspects of such a project and enabled us to focus on its scholarly side; and, last but not least, our spouses and families, who provided moral support and encouragement Mikhail Atallah Marina Blanton ix CuuDuongThanCong.com I-7 Index Existential, 12-19 Exotic option, 33-23 Expansion, see Graph expansion Expansion in DES, 11-5 Expansion in graph embeddings, 24-15 Exponent of floating point number, 25-31 Ex-post equilibrium, 16-15 Expressive power of query language, 19-5 Extended Euclidean algorithm, 10-10 Externality, 16-3, 16-11 Extreme point, 1-2, 1-10 F Face, 3-4 Factor base, 11-10, 11-12 Factoring, 25-14 Fail-stop signatures, 12-25 FAIRPLAY system, 14-5, 14-11 Fair scheduling, 26-6 False-name bidding, 16-12 False-name-proof auction, 16-13 Families of threshold schemes, 13-7 Family of circuits, 25-8 Fan-in of circuit node, 25-8 Fan-out of circuit node, 25-8 Farthest neighbor, 2-6 Farthest neighbor Voronoi diagram, 2-6 Fast exponentiation, 10-9 Fast Fourier transform (FFT), 25-38 Fast Fourier transform (FFT) use in pricing options, 33-15 Fat tree, 24-8, 25-5 Fault-tolerant algorithm, 26-2 Faulty components, 26-1 FCSR, see Feedback with carry shift register FEAL cipher, 11-7 Feasible schedule, 20-19 Feasible solution, 20-18 Features of an image, 5-1 Feedback function, 17-6 Feedback with carry shift register (FCSR), 17-10, 17-21 Fermat’s difference of squares factoring method, 11-8 Fermat’s Little Theorem, 11-8 Fetch-and-add, 25-17 FFT, see Fast Fourier transform F function in DES, 11-5 Field-programmable gate arrays, 8-22 Field splitting, 7-12 Figures, 24-10 File transfer protocol (FTP), 27-2 Filter, 25-11 Filtered space, 3-14 Filtering search, 2-21 CuuDuongThanCong.com Filtration, 3-14 Fine-grained, 24-5 Fingerprint, 12-1, 12-9 Finite-difference computations, 29-4 Finite field, 17-7 Finite strategic form game, 21-24 Firewall, 28-16 Firewall database, rules, 28-16 First-order linear recurrence, 25-17 First-price sealed-bid auction, 16-2 Fixturing, 4-8 Flatness, 2-15 Flats, 13-5 Flatten function, 25-12, 25-22, 25-23 Flooding, 27-12 Floorplan, 8-3, 8-10, 8-23 Flow complex, 3-24 Flow control, 27-27 Flow shop, 20-5, 20-7 Flynn’s taxonomy, 24-4 Force-closure grasp, 4-7 Force directed algorithm, 6-5 Formal language, 23-15 Formal language theory approach in design of DNA sequences, 31-12 Form-closure grasp, 4-8 Fourier transform, 25-14, 25-38 Fractional solution, 20-21 Free disposal, 16-8 Free path, 4-12 Frequency analysis, 11-2, 11-3 Frequency distribution of letters, 11-2 Frontier in breadth-first search, 25-23 FTDock, 30-19 FTP, see File transfer protocol Fully connected platform, 29-14 Fully polynomial approximation scheme, 20-14 ++ Function, see Append function < − Function, see Write function
Ngày đăng: 30/08/2020, 16:48
Xem thêm:
