الصفحة 12
الصفحة 12
Advances in cryptology - EUROCRYPT 90 ; Workshop on the theory and application of cryptographic techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings
Eurocrypt is a conference devoted to all aspects of cryptologic research, both theoretical and practical, sponsored by the International Association for Cryptologic Research (IACR). Eurocrypt 90 took place in Åarhus, Denmark, in May 1990. From the 85 papers submitted, 42 were selected for presentation at the conference and for inclusion in this volume. In addition to the formal contributions, short abstracts of a number of informal talks are included in these proceedings. The proceedings are organized into sessions on protocols, number-theoretic algorithms, boolean functions, binary sequences, implementations, combinatorial schemes, cryptanalysis, new cryptosystems, signatures and authentication, and impromptu talks.
Advances in Case-Based Reasoning ; 8th European Conference, ECCBR 2006, Fethiye, Turkey, September 4-7, 2006, Proceedings
This book constitutes the refereed proceedings of the 8th European Conference on Case-Based Reasoning, ECCBR 2004, held in Fethiye, Turkey in September 2006. The book presents 31 revised full papers and 5 revised application papers together with 2 invited papers and 2 abstracts of invited talks. The coverage represents snapshot of current current issues in case-based reasoning, ranging from theoretical and methodological issues to advanced applications in various fields.
Advances in bioinformatics and computational biology ; 1st Brazilian symposium on bioinformatics, BSB 2005, Sao Leopoldo, Brazil, July 27-29, 2005, Proceedings
This book constitutes the refereed proceedings of the Brazilian Symposium on Bioinformatics, BSB 2005, The 15 revised full papers and 10 revised extended abstracts presented together with 3 invited papers were carefully reviewed and selected from 55 submissions. The papers address a broad range of current topics in computational biology and bioinformatics.
Advances in Artificial Intelligence ; Vol. 4013 : 19th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2006, Quebec City, Quebec, Canada, June 7-9, Proceedings
Constitutes the refereed proceedings of the 4th Hellenic Conference on Artificial Intelligence, SETN 2006, held at Heraklion, Crete, Greece in May 2006. The 43 revised full papers and extended abstracts of 34 revised short papers presented together with 2 invited contributions were carefully reviewed and selected from 125 submissions. The papers address any area of artificial intelligence; particular fields of interest include; logic programming, knowledge-based systems, intelligent information retrieval, machine learning, neural nets, genetic algorithms, data mining and knowledge discovery, hybrid intelligent systems and methods, intelligent agents, multi-agent systems, intelligent distributed systems, intelligent/natural interactivity, intelligent virtual environments, planning, scheduling, and robotics.
Advances in Artificial Intelligence ; Vol. 3955 : 4th Helenic Conference on AI, SETN 2006, Heraklion, Crete, Greece, May 18-20, 2006, Proceedings
Constitutes the refereed proceedings of the 4th Hellenic Conference on Artificial Intelligence, SETN 2006, held at Heraklion, Crete, Greece in May 2006. The 43 revised full papers and extended abstracts of 34 revised short papers presented together with 2 invited contributions were carefully reviewed and selected from 125 submissions. The papers address any area of artificial intelligence; particular fields of interest include; logic programming, knowledge-based systems, intelligent information retrieval, machine learning, neural nets, genetic algorithms, data mining and knowledge discovery, hybrid intelligent systems and methods, intelligent agents, multi-agent systems, intelligent distributed systems, intelligent/natural interactivity, intelligent virtual environments, planning, scheduling, and robotics.
Advances in Artificial Intelligence ; 15th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2002 Calgary, Canada, May 27-29, 2002 Proceedings
The AI conference series is the premier event sponsored by the Canadian - ciety for the Computational Studies of Intelligence / Soci´et´e canadienne pour l’´etude d’intelligence par ordinateur. Attendees enjoy our typically Canadian - mosphere –hospitable and stimulating. The Canadian AI conference showcases the excellent research work done by Canadians, their international colleagues, and others choosing to join us each spring. International participation is always high; this year almost 40% of the submitted papers were from non-Canadian - searchers. We accepted 24 papers and 8 poster papers from 52 full-length papers submitted. We also accepted eight of ten abstracts submitted to the Graduate Student Symposium. All of these accepted papers appear in this volume.
Advances in Artificial Intelligence - SBIA 2008 ; 19th Brazilian Symposium on Artificial Intelligence Savador, Brazil, October 26-30, 2008. Proceedings
Constitutes the refereed proceedings of the 19th Brazilian Symposium on Artificial Intelligence, SBIA 2008, held in Salvador, Brazil, in October 2008.
Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues ; 4th International Conference on Intelligent Computing, ICIC 2008 Shanghai, China, September 15-18, 2008 Proceedings
This book - in conjunction with the two volumes CCIS 0015 and LNAI 5226 - constitutes the refereed proceedings of the 4th International Conference on Intelligent Computing, ICIC 2008, held in Shanghai, China, in September 2008.
Advanced Intelligent Computing Theories and Applications : With Aspects of Artificial Intelligence ; 4th International Conference on Intelligent Computing, ICIC 2008 Shanghai, China, September 15-18, 2008 Proceeding
This book - in conjunction with the two volumes CCIS 0015 and LNCS 5226 - constitutes the refereed proceedings of the 4th International Conference on Intelligent Computing, ICIC 2008, held in Shanghai, China, in September 2008.
Adaptive Hypermedia and Adaptive Web-Based Systems ; 4th International Conference, AH 2006, Dublin, Ireland, June 21-23, 2006, Proceedings
Here are the refereed proceedings of the 4th International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems, AH 2006, held in Dublin, Ireland, June 2006. The book presents 22 revised full papers and 19 revised short papers together with abstracts of 3 keynotes, 12 poster papers, and 14 doctoral consortium posters. Topics include pioneering theories, techniques, and innovative technologies to provide dynamic personalization, adaptation, and contextualization of hypermedia resources and services.
Adapting Proofs-as-Programs : The Curry--Howard Protocol
This book nuds new things to do with an old idea. The proofs-as-programs paradigm constitutes a set of approaches to developing programs from proofs in constructive logic. there is increasingly active research in applying constructive techniques to industrial-scale, complex software engineering problems. Thismonographdetailsseveralimportantadvancesinthisdirectionofpr- tical proofs-as-programs. One of the central themes of the book is a general, abstract framework for developing new systems of program synthesis by adapting proofs-as-programs to new contexts. Framework-oriented approaches that facilitate analogous - proaches to building systems for solving particular problems have been popular and successful. Thesemethodsarehelpful asthey providea formal toolbox that enablesa“roll-your-own”approachtodevelopingsolutions.Itishopedthatour framework will have a similar impact. The framework is demonstrated by example. We will give two novel - plications of proofs-as-programs to large-scale, coarse-grain software engine- ing problems: contractual imperative program synthesis and structured p- gram synthesis.
Abstraction, Reformulation, and Approximation ; 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings
This volume contains the proceedings of SARA 2007, the seventh symposium, held at Whistler Village, British Columbia, Canada, July 18-21. Three distinguished speakers were invited to give keynote presentations, and their abstracts are included herein,It has been recognized since the inception of artificial intelligence that abstractions, problem reformulations and approximations (AR&A) are central to human common-sense reasoning and problem solving and to the ability of systems to reason effectively in complex domains.AR&A techniques have been used in a variety of problem-solving settings, including automated reasoning, cognitive modelling.
Abstraction, reformulation and approximation ; 6th International symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, proceedings
This volume contains the proceedings of the 6th Symposium on Abstraction, Reformulation and Approximation (SARA 2005). the proceedings have been published in the LNAI series of Springer. Abstractions, reformulations and approximations (AR&A) have found app- cationsin avarietyofdisciplines andproblems, including constraintsatisfaction, design, diagnosis, machine learning, planning, qualitative reasoning, scheduling, resource allocation and theorem proving, but are also deeply rooted in philo- phy and cognitive science. The papers in this volume capture a cross-section of the various facets of the ?eld and of its applications. One of the primary uses of AR&A is oriented to overcome computational intractability. AR&A techniques, however, have also proved useful for knowledge acquisition, explanation and other applications.
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
Abstraction Refinement for Large Scale Model Checking
This book describes recent research developments in automatic abstraction refinement techniques. The authors address the main challenge in abstraction refinement, i.e., the ability to efficiently reach or come close to the optimum abstraction (the smallest abstract model that proves or refutes the given property). A suite of fully automatic abstraction techniques are proposed to improve the overall computation efficiency. The suite of algorithms presented in this book has demonstrated significant improvement over the prior art; some of them have already been adopted by the EDA companies in their commercial/in-house verification tools.
Abstract State Machines, B and Z ; 1st International Conference, ABZ 2008, London, UK, September 16-18, 2008. Proceedings
This book constitutes the refereed proceedings of the First International Conference of Abstract State Machines, B and Z, ABZ 2008, held in London, UK, in September 2008.
Abstract Harmonic Analysis of Continuous Wavelet Transforms
This volume contains a systematic discussion of wavelet-type inversion formulae based on group representations, and their close connection to the Plancherel formula for locally compact groups. The connection is demonstrated by the discussion of a toy example, and then employed for two purposes: Mathematically, it serves as a powerful tool, yielding existence results and criteria for inversion formulae which generalize many of the known results. Moreover, the connection provides the starting point for a – reasonably self-contained – exposition of Plancherel theory. Therefore, the book can also be read as a problem-driven introduction to the Plancherel formula.
Abstract Computing Machines : A Lambda Calculus Perspective
The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. The emphasis is on fully normalizing machines based on full-fledged beta-reductions as essential prerequisites for symbolic computations that treat functions and variables truly as first-class objects. Their weakly normalizing counterparts are shown to be functional abstract machines that sacrifice the flavors of full beta-reductions for decidedly simpler runtime structures and improved runtime efficiency. Further downgrading of the lambda calculus leads to classical imperative machines that permit side-effecting operations on the runtime environment.
Abstract Algebra
In Abstract Algebra the first chapters blend standard contents with a careful introduction to proofs with arrowsand in the last chapters, on universal algebras and categories, including tripleability, give valuable general views of algebra.
A Posteriori Error Analysis Via Duality Theory : With Applications in Modeling and Numerical Approximations
This volume provides a posteriori error analysis for mathematical idealizations in modeling boundary value problems, especially those arising in mechanical applications, and for numerical approximations of numerous nonlinear variational problems. The author avoids giving the results in the most general, abstract form so that it is easier for the reader to understand more clearly the essential ideas involved. Many examples are included to show the usefulness of the derived error estimates.
