الصفحة 2
الصفحة 2
Foundations of information and knowledge systems ; 5th International Symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008. Proceedings
This book constitutes the refereed proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2008 held in Pisa, Italy, in February 2008. The 13 revised full papers presented together with 9 revised short papers and 3 invited lectures were carefully selected during two rounds of reviewing and improvement from from 79 submissions. The papers deal with any foundational aspect of information and knowledge systems, including submissions from researchers working in fields such as discrete mathematics, logic and algebra, model theory, information theory, complexity theory, algorithmics and computation, geometry, analysis, statistics and optimisation who are interested in applying their ideas, theories and methods to research on information and knowledge systems.
Finite model theory and its applications
This book gives a broad overview of core topics of finite model theory: expressive power, descriptive complexity, and zero-one laws, together with selected applications to database theory and artificial intelligence, especially, constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, which emphasizes the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of, and hierarchies within, first order, second order, fixed point, and infinitary logics to gain insight into phenomena in complexity theory and combinatorics.
Finite Model Theory ; 2nd ed.
The book presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. Other topics include DATALOG languages, quantifiers and oracles, 0-1 laws, and optimization and approximation problems. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently. This second edition is a thoroughly revised and enlarged version of the original text.
Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Economics, Sustainability, and Natural Resources: Economics of Sustainable Forest Management
The economics of sustainability is much more complex than the neoclassical (Newtonian) economic approach to economic efficiency. Forest resources provide the ideal starting point for the economic analysis of sustainability. This book provides a systematic critique of neoclassical economic approaches and their limitations with respect to sustainability. Leading economists from different streams of economics discuss key economic aspects of sustainability and sustainable forest management including complexity, ethical issues, consumer choice theory, intergenerational equity, non-convexities, and multiple equilibria. This is the book which integrates different streams of economics – complexity theory, behavioral economics, post-Keynesian consumer choice theory, social choice theory, and non-convexities – and suggests the main features of Post-Newtonian economics.
DNA Computing ; 13th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers
This book constitutes the thoroughly refereed postproceedings of the 13th International Meeting on DNA Computing, DNA 13, held in Memphis, TN, USA, June 4-8, 2007.
Developments in Language Theory ; Vol. 4036 ; 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings
This book constitutes the refereed proceedings of the 10th International Conference on Developments in Language Theory, DLT 2006, held in Santa Barbara, CA, June 2006. All important issues in language theory are addressed including grammars, acceptors and transducers for strings, trees, graphs, arrays.
Developments in language theory ; Vol. 3572 ; 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings
Constitutes the refereed proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005, held in Palermo, Italy in July 2005. Several issues in language theory are addressed including grammars, acceptors, and transducers for strings frees, graphs, and arrays; efficient text algorithms; and more.
Developments in language theory ; 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings
Basic Notions of Reaction Systems / A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms / Algebraic and Topological Models for DNA Recombinant Processes / Contributed Papers : Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet / On Competence in CD Grammar Systems / The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels, and other
Developments in Language Theory ; 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008.
Developments in Language Theory ; 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; relationships to cryptography, concurrency, complexity theory and logic; bioinspired computing, and quantum computing.
Cryptanalytic Attacks on RSA
RSA is a public-key cryptographic system, and is the most famous and widely-used cryptographic system in today's digital world. Cryptanalytic Attacks on RSA, a professional book, covers almost all major known cryptanalytic attacks and defenses of the RSA cryptographic system and its variants.
Computing and Combinatorics ; Vol. 4112 ; 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, and more.
Computing and combinatorics ; Vol. 3595 ; 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings
The papers in this volume were presented at theEleventh Annual InternationalComputing and Combinatorics Conference(COCOON 2005), The topics cover most aspects of theoretical computerscience and combinatorics related to computing.Submissions to the conference this year were conducted electronically. A totalof 353 papers were submitted, of which 96 were accepted.
Combinatorial optimization and applications ; 2nd International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings
This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008.
Combinatorial optimization and applications ; 1st International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings
This book presented feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
Logic, language, information and computation ; 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings
The Workshop on Logic, Language, Information and Computation (WoLLIC) is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. The WoLLIC meetings alternate between Brazil (and Latin America) and other countries, with the aim of fostering interest in applied logic among Latin Am- ican scientists and students, and facilitating their interaction with the international - plied logic community.
List decoding of error-correcting codes : Winning thesis of the 2002 ACM doctoral dissertation competition
Presents some spectacular new results in the area of decoding algorithms for error-correcting codes. Specifically, it shows how the notion of “list-decoding” can be applied to recover from far more errors, for a wide variety of err- correcting codes, than achievable before. A brief bit of background : error-correcting codes are combinatorial str- tures that show how to represent (or “encode”) information so that it is - silient to a moderate number of errors. Speci?cally, an error-correcting code takes a short binary string, called the message, and shows how to transform it into a longer binary string, called the codeword, so that if a small number of bits of the codewordare ?ipped, the resulting string does not look like any other codeword. The maximum number of errorsthat the code is guaranteed to detect, denoted d, is a central parameter in its design. A basic property of such a code is that if the number of errors that occur is known to be smaller than d/2, the message is determined uniquely. This poses a computational problem, called the decoding problem : compute the message from a corrupted codeword, when the number of errors is less than d/2.
LATIN 2008 : Theoretical Informatics ; 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008. Proceedings
The Latin American Theoretical INformatics Symposium (LATIN) is becoming a traditional and high-quality conference on the Theory of Computing. Previous conferences havebeen organized twiceinBrazil: SaoPaulo (1992) and Campinas (1998); twice in Chile: Valpara so (1995) and Valdivia (2006); once in Uruguay: Punta del Este (2000); once in Mexico: Cancun (2002); and once in Argentina: Buenos Aires (2004). This volume contains the proceedings of the 8th Latin American Theore- cal INformatics Symposium (LATIN 2008), which was held in Buzio s, Rio de Janeiro, Brazil, April 7 11, 2008.
Computation Engineering : Applied Automata Theory and Logic
This book covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.
