الصفحة 2
الصفحة 2
Leveraging Applications of Formal Methods ; 1st International Symposium, ISoLA 2004, Paphos, Cyprus, October 30 - November 2, 2004, Revised Selected Papers
This book constitutes the thoroughly refereed post-proceedings of the First International Symposium on Leveraging Applications of Formal Methods, ISoLA 2004, held in Paphos, Cyprus in October/November 2004. The 12 revised full papers presented were carefully selected from more than 70 submissions. The papers discuss issues related to the adoption and use of rigorous tools and methods for the specification, analysis, verification, certification, construction, test, and maintenance of systems. In particular, by discussing common problems, requirements, algorithms, methodologies, and practices, ISoLA aims at supporting researchers in their quest to improve the utility, reliability, flexibility, and efficiency of tools for building systems, and users in their search for adequate solutions to their problems.
Case-Based Approximate Reasoning
Case-based reasoning (CBR) has received a great deal of attention in recent years and has established itself as a core methodology in the field of artificial intelligence. The key idea of CBR is to tackle new problems by referring to similar problems that have already been solved in the past. More precisely, CBR proceeds from individual experiences in the form of cases. The generalization beyond these experiences typically relies on a kind of regularity assumption demanding that 'similar problems have similar solutions'. Making use of different frameworks of approximate reasoning and reasoning under uncertainty, notably probabilistic and fuzzy set-based techniques, this book develops formal models of the above inference principle, which is fundamental to CBR. The case-based approximate reasoning methods thus obtained especially emphasize the heuristic nature of case-based inference and aspects of uncertainty in CBR. This way, the book contributes to a solid foundation of CBR which is grounded on formal concepts and techniques from the aforementioned fields. Besides, it establishes interesting relationships between CBR and approximate reasoning, which not only cast new light on existing methods but also enhance the development of novel approaches and hybrid systems.
Artificial neural networks : Formal Models and Their Applications – ICANN 2005 ; 15th International Conference, Warsaw, Poland, September 11-15, 2005, Proceedings, Part II
The second volume contains 162 contributions related to Formal Models and their Applications and deals with new neural network models, supervised learning algorithms, ensemble-based learning, unsupervised learning, recurent neural networks, reinforcement learning, bayesian approaches to learning, learning theory, artificial neural networks for system modeling, decision making, optimalization and control, knowledge extraction from neural networks, temporal data analysis, prediction and forecasting, support vector machines and kernel-based methods, soft computing methods for data representation, analysis and processing, data fusion for industrial, medical and environmental applications, non-linear predictive models for speech processing, intelligent multimedia and semantics, applications to natural language processing, various applications, computational intelligence in games, and issues in hardware implementation.
Applying fuzzy mathematics to formal models in comparative politics
This book explores the intersection of fuzzy mathematics and the spatial modeling of preferences in political science. This book develops single- and multidimensional models of fuzzy preference landscapes and characterizes the surprisingly high levels of stability that emerge from interactions between players operating.
Anti-Spam Measures : Analysis and Design
The goal of this book is the methodical analysis of the potential, limitations, advantages, and drawbacks of anti-spam measures. These determine to which extent the measures can contribute to the reduction of spam in the long run. The range of considered anti-spam measures includes legislative, organizational, behavioral and technological ones. Furthermore, the conceptual development and analysis of an infrastructural email framework that features such a complementary application, is pointed out. The technological and organizational facets, the framework is analyzed twofold: its theoretical effectiveness is assessed with the aid of the formal model mentioned above, its storage and traffic requirements are analyzed quantitatively.
Algorithmic Aspects of Bioinformatics
Advances in bioinformatics and systems biology require improved computational methods for analyzing data, while progress in molecular biology is in turn influencing the development of computer science methods. This book introduces some key problems in bioinformatics, discusses the models used to formally describe these problems, and analyzes the algorithmic approaches used to solve them. After introducing the basics of molecular biology and algorithmics, Part I explains string algorithms and alignments; Part II details the field of physical mapping and DNA sequencing; and Part III examines the application of algorithmics to the analysis of biological data. Exciting application examples include predicting the spatial structure of proteins, and computing haplotypes from genotype data. This book describes topics in detail and presents formal models in a mathematically precise, yet intuitive manner, with many figures and chapter summaries, detailed derivations, and examples. It is well suited as an introduction into the field of bioinformatics, and will benefit students and lecturers in bioinformatics and algorithmics, while also offering practitioners an update on current research topics.
Advances in cryptology - CRYPTO -87 ; Conference on the theory and applications of cryptographic techniques : Proceedings
Zero-knowledge interactive proofsystems are a new technique which can be used as a cryptographic tool for designing provably secure protocols. Goldwasser, Micali, and Rackoff originally suggested this technique for controlling the knowledge released in an interactive proof of membership in a language, and for classification of languages. In this approach, knowledge is defined in terms of complexity to convey knowledge if it gives a computational advantage to the receiver, theory, and a message is said for example by giving him the result of an intractable computation. The formal model of interacting machines is described in. A proof-system (for a language L) is an interactive protocol by which one user, the prover, attempts to convince another user, the verifier, that a given input x is in L. We assume that the verifier is a probabilistic machine which is limited to expected polynomial-time computation, while the prover is an unlimited probabilistic machine.
