الصفحة 81
الصفحة 81
Contemporary Cryptology
The aim of this text is to treat selected topics of the subject of contemporary cryptology, structured in five quite independent but related themes: Efficient distributed computation modulo a shared secret / Multiparty computation / Foundations of modern cryptography / Provable security for public key schemes / Efficient and secure public-key cryptosystems.
Consuming Music Together : Social and Collaborative Aspects of Music Consumption Technologies
This book collects together the most recent studies of music consumption, and new developments in music technology. It combines the perspectives of both social scientists and technology designers, uncovering how new music technologies are actually being used, along with discussions of new music technologies still in development. With a specific focus on the social nature of music.
Construction and Analysis of Safe, Secure, and Interoperable Smart Devices ; Vol. 3956 ; Second International Workshop, CASSIS 2005, Nice, France, March 8-11, 2005, Revised Selected Papers
This book constitutes the refereed post-proceedings of the Second International Workshop on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, CASSIS 2005. The 9 revised full papers presented were carefully selected during two rounds of reviewing and improvement from about 30 workshop talks. The papers are organized in topical sections on research trends in smart devices, Web services, virtual machine technology, security, validation and formal methods, proof-carrying code, and embedded devices.
Construction and analysis of safe, secure, and interoperable smart devices ; Vol. 3362 : International workshop, CASSIS 2004, Marseille, France, March 10-14, 2004, Revised Selected Papers
History based access control and secure information flow / The spec# programming system / Mastering test generation from smart card software formal models / A mechanism for secure, fine-grained dynamic provisioning of applications on small devices / A type system for checking applet isolation in java card / Verification of safety properties in the presence of transactions / Modelling mobility aspects of security policies / Smart devices for next generation mobile services / A flexible framework for the estimation of coverage metrics in explicit state software model checking / Combining several paradigms for circuit validation and verification / Smart card research perspectives
Constructing Correct Software
Central to Formal Methods is the so-called Correctness Theorem which relates a specification to its correct Implementations. This theorem is the goal of traditional program testing and, more recently, of program verification (in which the theorem must be proved). Proofs are difficult, though even with the use of powerful theorem provers. This volume explains and illustrates an alternative method, which allows the construction of (necessarily correct) algorithms from a specification using algebraic transformations and refinement techniques which prevent the introduction of errors. Based on teaching material used extensively at Loughborough University, John Cooke introduces the basics, using simple examples and lots of detailed working (which can often be re-used). Constructing Correct Software will provide invaluable reading for students and practitioners of Computer Science and Software Engineering to whom correctness of software is of prime importance.
Constructing Ambient Intelligence ; AmI 2007 Workshops Darmstadt, Germany, November 7-10, 2007 Revised Papers
This book constitutes the refereed proceedings of the workshops of the First European Conference on Ambient Intelligence, AmI 2007, held in Darmstadt, Germany, in November 2007.
Constraint-Based Mining and Inductive Databases ; European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten, Germany, March 11-13, 2004, Revised Selected Papers
The interconnected ideas of inductive databases and constraint-based mining are appealing and have the potential to radically change the theory and practice of data mining and knowledge discovery.
Constraint solving and language processing
Contains selected and thoroughly revised papers plus contributions from invited speakers presented at the First International Workshop on C- straint Solving and Language Processing, held in Roskilde, Denmark, September 1–3, 2004. Constraint Programming and Constraint Solving, in particular Constraint Logic Programming, appear to be a very promising platform, perhaps the most promising present platform, for bringing forward the state of the art in natural language processing, this due to the naturalness in speci?cation and the direct relation to e?cient implementation. Language, in the present context, may - fer to written and spoken language, formal and semiformal language, and even general input data to multimodal and pervasive systems, which can be handled in very much the same ways using constraint programming. The notion of constraints, with slightly differing meanings, apply in the characterization of linguistic and cognitive phenomena, in formalized linguistic m- els as well as in implementation-oriented frameworks. Programming techniques for constraint solving have been, and still are, in a period with rapid devel- ment of new eficient methods and paradigms from which language processing can prompt. A common metaphor for human language processing is one big c- straint solving process in which the differently specified linguistic and cognitive phases take place in parallel and with mutual cooperation, which ?ts quite well with current constraint programming paradigms.
Constraint satisfaction techniques for agent-based reasoning
Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to the modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains such as transportation, production, supply-chains, network management and human resource management. In this book we study new techniques for solving constraint satisfaction problems, with a special focus on solution adaptation applied to agent reasoning.
Constraint handling rules : Current research topics
The Constraint Handling Rules (CHR) language is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs. The aim of this volume was to attract high-quality research papers on these recent advances in Constraint Handling Rules.
Constituents of Modern System-safety Thinking
Constituents of Modern System-safety Thinking contains the invited papers presented at the Thirteenth annual Safety-critical Systems Symposium, held at Southampton, UK in February 2005. The papers included in this volume bring together topics that are of the utmost importance in current safety thinking. The core of modern safety thinking and practice is a risk-based approach, and, this is not only a common thread running throughout the papers, but is also explored in two of them. Other themes considered include the safety case, safety assessment, accident investigation, and the commonality between the processes and techniques employed in safety and security engineering. Papers contain extensive industrial experience as well as recent academic research and are presented under the headings: Independent Safety Assessment, Safety and Security, Accident Investigation, Risk and its Tolerability, Achieving and Arguing the Safety of Modular Systems, and Technologies for Dependability.
Conditionals, Information, and Inference
Conditionals are fascinating and versatile objects of knowledge representation. On the one hand, they may express rules in a very general sense, representing, for example, plausible relationships, physical laws, and social norms. On the other hand, as default rules or general implications, they constitute a basic tool for reasoning, even in the presence of uncertainty. In this sense, conditionals are intimately connected both to information and inference. Due to their non-Boolean nature, however, conditionals are not easily dealt with. They are not simply true or false — rather, a conditional “if A then B” provides a context, A, for B to be plausible (or true) and must not be confused with “A entails B” or with the material implication “not A or B.” This ill- trates how conditionals represent information, understood in its strict sense as reduction of uncertainty. To learn that, in the context A, the proposition B is plausible, may reduce uncertainty about B and hence is information. The ab- ity to predict such conditioned propositions is knowledge and as such (earlier) acquired information. The ?rst work on conditional objects dates back to Boole in the 19th c- tury, and the interest in conditionals was revived in the second half of the 20th century, when the emerging Arti?cial Intelligence made claims for appropriate formaltoolstohandle“generalizedrules.”Sincethen,conditionalshavebeenthe topic of countless publications, each emphasizing their relevance for knowledge representation, plausible reasoning, nonmonotonic inference, and belief revision.
Concurrent Zero-Knowledge : With Additional Background by Oded Goldreich
Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory de?nition; ze- knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a predetermined protocol. In addition to their direct applicability in cr- tography, zero-knowledge proofs serve as a good benchmark for the study of variousproblemsregardingcryptographicprotocols(e.g.,“securecomposition of protocols”).
Concurrency, Graphs and Models : Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday
The volume consists of seven sections, six of which are dedicated to the main research areas to which Ugo Montanari has contributed: Graph Transformation; Constraint and Logic Programming; Software Engineering; Concurrency; Models of Computation; and Software Verification.
Concurrency Theory : Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory is a synthesis of one of the major threads of theoretical computer science research focusing on languages and graphical notations for describing collections of simultaneously evolving components that interact through synchronous communication. The main specification notation focused on in this book is LOTOS. An extensive introduction to this particular process calculus is given, highlighting how the approach differs from competitor techniques, such as CCS and CSP.
CONCUR 2008 - Concurrency Theory ; 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings
This book constitutes the refereed proceedings of the 19th International Conference on Concurrency Theory, CONCUR 2008, held in Toronto, Canada, August 19-22, 2008.
CONCUR 2007 – Concurrency Theory ; 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings
This book includes model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.
CONCUR 2006 - Concurrency Theory ; 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006
This volume contains the proceedings of the 17th International Conference on Concurrency Theory (CONCUR) held in Bonn, Germany, August 27–30, 2006. The scope of CONCUR covers all areas of semantics, logics, and verification techniques for concurrent systems.
CONCUR 2005 - Concurrency Theory
This volume contains the papers presented at CONCUR 2005, the 16th - ternational Conference on Concurrency Theory. The purpose of the CONCUR series of conferences is to bring together researchers,developers, and students in order to advance the theory of concurrency and to promote its applications. The Program Committee selected 38 papers for presentation. Because of the format of the conference and the high number of submissions, many good papers could not be included. Although submissions werereadand evaluated, the papers that appear in this volume may di?er in form and contents from the corresponding submissions.
Concise Guide to Quantum Computing : Algorithms, Exercises, and Implementations
This textbook is intended for practical, laboratory sessions associated with the course of quantum computing and quantum algorithms, as well as for self-study. It contains basic theoretical concepts and methods for solving basic types of problems and gives an overview of basic qubit operations, entangled states, quantum circuits, implementing functions, quantum Fourier transform, phase estimation, etc. The book serves as a basis for the application of new information technologies in education and corporate technical training: theoretical material and examples of practical problems, as well as exercises with, in most cases, detailed solutions, have relation to information technologies. A large number of detailed examples serve to better develop professional competencies in computer science.
