الصفحة 8
الصفحة 8
img

An Invitation to Abstract Mathematics

this book begins with a playful exploration of the building blocks of mathematics, such as definitions, axioms, and proofs. A study of the fundamental concepts of logic, sets, and functions follows, before focus turns to methods of proof. Having covered the core of a transition course, the author goes on to present a selection of advanced topics that offer opportunities for extension or further study. Throughout, appendices touch on historical perspectives, current trends, and open questions, showing mathematics as a vibrant and dynamic human enterprise.This second edition has been reorganized to better reflect the layout and curriculum of standard transition courses. It also features recent developments and improved appendices. An Invitation to Abstract Mathematics is ideal for those seeking a challenging and engaging transition to advanced mathematics, and will appeal to both undergraduates majoring in mathematics, as well as non-math majors interested in exploring higher-level concepts.

img

Algorithms in Bioinformatics ; 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings

This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting.

img

Algorithmic Learning in a Random World

This new monograph integrates mathematical theory and revealing experimental work. It demonstrates mathematically the validity of the reliability claimed by conformal predictors when they are applied to independent and identically distributed data, and it confirms experimentally that the accuracy is sufficient for many practical problems. Later chapters generalize these results to models called repetitive structures, which originate in the algorithmic theory of randomness and statistical physics. The approach is flexible enough to incorporate most existing methods of machine learning, including newer methods such as boosting and support vector machines and older methods such as nearest neighbors and the bootstrap.

img

AI*IA 2005 : Advances in artificial intelligence ; 9th congress of the Italian Association for Artificial Intelligence Milan, Italy, September 21-23, 2005, Proceedings

This volume collects the papers selected for presentation at the IX Congress of the Italian Association for Arti?cial Intelligence (AI*IA), 2005 On the one hand this congress continues the tradition of AI*IA in organizing its biannual s- enti?c meeting from 1989; on the other hand, this edition is a landmark in the involvement of the international community of arti?cial intelligence (AI), directly involving a broad number of experts from several countries in the P- gramCommittee. Moreover,the peculiar nature of scienti?c researchin arti?cial intelligence (which is intrinsically international) and several consolidated int- national collaborations in projects and mobility programs allowed the collection and selection of papers from many di?erent countries, all around the world, enlarging the visibility of the Italian contribution within this research ?eld. Arti?cial intelligence is today a growing complex set of conceptual, theor- ical, methodological, and technological frameworks, o?ering innovative com- tational solutions in the design and development of computer-based systems. Within this perspective, researchers working in this area must tackle a broad range of knowledge about methods, results, and solutions coming from di?erent classical areas of this discipline. The congress was designed as a forum allowing researchers to present and discuss specialized results as general contributions to AI growth.

img

Advances in Rule Interchange and Applications ; International Symposium, RuleML 2007, Orlando, Florida, October 25-26, 2007, Proceedings

The goal of RuleM is to develop an open, general, XML-based family of rule languages as intermediaries between various ‘specialized’ rule vendors, applications, industrial and academic research groups, as well as standardization efforts such as OMG’s PRR or W3C’s RIF. A general advantage of using declarative rules is that they can be easily represented in a machine-readable and platform-independent manner, often governed by an XML schema. This fits well into today’s distributed, heterogeneous Web-based system environments. Rules represented in standardized Web formats can be discovered, interchanged and invoked at runtime within and across Web systems, and can be interpreted and executed on any platform.

img

Advances in proof-theoretic semantics

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory.

img

Advances in intelligent data analysis VI ; 6th International symposium on intelligent data analysis, IDA 2005, Madrid, Spain, September 8-10, 2005, Proceedings

One of the superb characteristics of Intelligent Data Analysis (IDA) is that it is an interdisciplinary ?eld in which researchers and practitioners from a number of areas are involved in a typical project. This also creates a challenge in which the success of a team depends on the participation of users and domain experts who need to interact with researchers and developers of any IDA system. All this is usually re?ected in successful projects and of course on the papers that were evaluated by this year’s program committee from which the ?nal program has been developed. In our call for papers, we solicited papers on (i) applications and tools, (ii) theory and general principles, and (iii) algorithms and techniques. We received a total of 184 papers, In the end 46 papers were accepted, which are all included in the proceedings and presented at the conference. This year’s papers re?ect the results of applied and theoretical researchfrom a number of disciplines all of which are related to the ?eld of Intelligent Data Analysis. To have the best combination of theoretical and applied research and also provide the best focus.

img

Advances in Information Systems Research, Education and Practice ; IFIP 20th World Computer Congress, TC 8, Information Systems, September 7-10, 2008, Milano, Italy

The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing.

img

Advances in Information Systems Development : Information Systems Beyond 2020

Features a collection of papers on emerging concepts, significant insights, novel approaches and ideas in information systems development (ISD). It xamines advances in ISD in general and investigates emerging trends that will shape the ISD research agenda beyond 2020. The book gathers selected papers from the 28th International Conference on Information Systems Development held in Toulon, France on August 28-30, 2019.

img

Advances in bioinformatics and computational biology ; 3rd Brazilian symposium on bioinformatics, BSB 2008, Santo André, Brazil, August 28-30, 2008. Proceedings

Constitutes the refereed proceedings of the Third Brazilian Symposium on Bioinformatics, BSB 2008, held in Sao Paulo, Brazil, in August 2008 - co-located with IWGD 2008, the International Workshop on Genomic Databases.

img

Advances and applications of DSmT for information fusion: Collected works ; Vol.3

One of the most comprehensive and flexible fusion theory based on belief functions. It can work in all fusion spaces: power set, hyper-power set, and super-power set, and has various fusion and conditioning rules that can be applied depending on each application. Some new generalized rules are introduced in this volume with codes for implementing some of them. For the qualitative fusion, the DSm Field and Linear Algebra of Refined Labels (FLARL) is proposed which can convert any numerical fusion rule to a qualitative fusion rule. When one needs to work on a refined frame of discernment, the refinement is done using Smarandache s algebraic codification. New interpretations and implementations of the fusion rules based on sampling techniques and referee functions are proposed, including the probabilistic proportional conflict redistribution rule.

img

Advances and applications of DSmT for information fusion ; Vol. 4

One of the most comprehensive and flexible fusion theory based on belief functions. It can work in all fusion spaces: power set, hyper-power set, and super-power set, and has various fusion and conditioning rules that can be applied depending on each application. Some new generalized rules are introduced in this volume with codes for implementing some of them. For the qualitative fusion, the DSm Field and Linear Algebra of Refined Labels (FLARL) is proposed which can convert any numerical fusion rule to a qualitative fusion rule. When one needs to work on a refined frame of discernment, the refinement is done using Smarandache s algebraic codification. New interpretations and implementations of the fusion rules based on sampling techniques and referee functions are proposed, including the probabilistic proportional conflict redistribution rule.

img

Advanced Data Warehouse Design : From Conventional to Spatial and Temporal Applications

This book serves as an introduction to the state of the art on data warehouse design, with many references to more detailed sources. Providing a clear and a concise presentation of the major concepts and results of data warehouse design, it can also be used as the basis of a graduate or advanced undergraduate course.

img

Advanced Data Mining and Applications ; 4th International Conference, ADMA 2008, Chengdu, China, October 8-10, 2008. Proceedings

This book constitutes the refereed proceedings of the 4th International Conference on Advanced Data Mining and Applications, ADMA 2008, held in Chengdu, China, in October 2008.

img

Adaptive Machine Learning Algorithms with Python : Solve Data Analytics and Machine Learing Problems on Edge Devices

Learn to use adaptive algorithms to solve real-world streaming data problems. This book covers a multitude of data processing challenges, ranging from the simple to the complex. At each step, you will gain insight into real-world use cases, find solutions, explore code used to solve these problems, and create new algorithms for your own use. You will: Apply adaptive algorithms to practical applications and examples / Understand the relevant data representation features and computational models for time-varying multi-dimensional data / Derive adaptive algorithms for mean, median, covariance, eigenvectors (PCA) and generalized eigenvectors with experiments on real data / Speed up your algorithms and put them to use on real-world stationary and non-stationary data / Master the applications of adaptive algorithms on critical edge device computation applications

img

Adaptive Learning of Polynomial Networks : Genetic Programming, Backpropagation and Bayesian Methods

This book provides theoretical and practical knowledge for develop­ ment of algorithms that infer linear and nonlinear models. It offers a methodology for inductive learning of polynomial neural network mod­ els from data. The design of such tools contributes to better statistical data modelling when addressing tasks from various areas like system identification, chaotic time-series prediction, financial forecasting and data mining. The main claim is that the model identification process involves several equally important steps: finding the model structure, estimating the model weight parameters, and tuning these weights with respect to the adopted assumptions about the underlying data distrib­ ution. When the learning process is organized according to these steps, performed together one after the other or separately, one may expect to discover models that generalize well.

img

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.

img

Access to online resources : A guide for the modern librarian

The book offers a concise guide for librarians, helping them understand the challenges, processes and technologies involved in managing access to online resources. After an introduction the book presents cases of general authentication and authorisation. It helps readers understand web based authentication and provides the fundamentals of IP address recognition in an easy to understand manner. A special chapter is dedicated to Security Assertion Markup Language (SAML), followed by an overview of the key concepts of OpenID Connect. The book concludes with basic troubleshooting guidelines and recommendations for further assistance. Librarians will benefit from this quick and easy read, which demystifies the technologies used, features real-life scenarios, and explains how to competently employ authentication and access management.

img

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.

عدد النتائج بكل صفحة