Matematik til informatikfag

This book constitutes the refereed proceedings of the 12th International Conference on Rewriting Techniques and Applications, RTA 2001, held in Utrecht, The Netherlands, in May 2001.The 23 revised full papers presented together with two system descriptions were carefully reviewed and selected from 55 submissions. All current aspects of rewriting are addressed.

Looking back at the years that have passed since the realization of the very first electronic, multi-purpose computers, one observes a tremendous growth in hardware and software performance. Today, researchers and engi- neers have access to computing power and software that can solve numerical problems which are not fully understood in terms of existing mathemati- cal theory. Thus, computational sciences must in many respects be viewed as experimental disciplines. As a consequence, there is a demand for high- quality, flexible software that allows, and even encourages, experimentation with alternative numerical strategies and mathematical models. Extensibil- ity is then a key issue; the software must provide an efficient environment for incorporation of new methods and models that will be required in fu- ture problem scenarios. The development of such kind of flexible software is a challenging and expensive task. One way to achieve these goals is to in- vest much work in the design and implementation of generic software tools which can be used in a wide range of application fields. In order to provide a forum where researchers could present and discuss their contributions to the described development, an International Work- shop on Modern Software Tools for Scientific Computing was arranged in Oslo, Norway, September 16-18, 1996. This workshop, informally referred to as Sci Tools '96, was a collaboration between SINTEF Applied Mathe- matics and the Departments of Informatics and Mathematics at the Uni- versity of Oslo.

In diesem Buch werden alle Teilgebiete der KI kompakt, leicht verständlich und anwendungsbezogen vorgestellt. Der Autor kennt das Gebiet nicht nur bestens aus Forschung und praktischer Anwendung, sondern engagiert sich auch erfolgreich in der Lehre. Die Themen reichen von der klassischen Logik über das Schließen mit Unsicherheit und maschinelles Lernen bis hin zu Anwendungen wie Diagnosesysteme, lernfähige Roboter oder Kreativität in der KI.Sie profitieren von dem umfassenden Einblick in dieses faszinierende Teilgebiet der Informatik, wobei, abgesehen von grundlegenden Programmierkenntnissen sowie etwas Mathematik, alle Voraussetzungen für ein gutes Verständnis bereitgestellt werden. Sie gewinnen vertiefte Kenntnisse, z. B. hinsichtlich der wichtigsten Verfahren zur Repräsentation und Verarbeitung von Wissen und in dem immer wichtiger werdenden Gebiet des maschinellen Lernens. Vor allem der Anwendungsbezug steht im Fokus der Darstellung. Viele Übungsaufgaben mit Lösungen sowie eine strukturierte Liste mit Verweisen auf Literatur und Ressourcen im Web ermöglichen ein effektives und kurzweiliges Selbststudium.

This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations.It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of parallel iterative linear system solvers with emphasis on scalable preconditioners, (b) parallel schemes for obtaining a few of the extreme eigenpairs or those contained in a given interval in the spectrum of a standard or generalized symmetric eigenvalue problem, and (c) parallel methods for computing a few of the extreme singular triplets. Part IV focuses on the development of parallel algorithms for matrix functions and special characteristics such as the matrix pseudospectrum and the determinant. The book also reviews the theoretical and practical background necessary when designing these algorithms and includes an extensive bibliography that will be useful to researchers and students alike. The book brings together many existing algorithms for the fundamental matrix computations that have a proven track record of efficient implementation in terms of data locality and data transfer on state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.

This book constitutes the refereed proceedings of the 24th International Colloquium on Automata, Languages and Programming, ICALP '97, held in Bologna, Italy, in July 1997. ICALP '97 celebrated the 25th anniversary of the European Association for Theoretical Computer Science (EATCS), which has sponsored the ICALP meetings since 1972.The volume presents 73 revised full papers selected from a total of 197 submissions. Also included are six invited contributions. ICALP is one of the few flagship conferences in the area. The book addresses all current topics in theoretical computer science.

This book constitutes the refereed proceedings of the 18th European Conference on Genetic Programming, EuroGP 2015, held in Copenhagen, Spain, in April 2015 co-located with the Evo 2015 events, EvoCOP, Evo MUSART and Evo Applications. The 12 revised full papers presented together with 6 poster papers were carefully reviewed and selected form 36 submissions. The wide range of topics in this volume reflects the current state of research in the field. Thus, we see topics as diverse as semantic methods, recursive programs, grammatical methods, coevolution, Cartesian GP, feature selection, initialisation procedures, ensemble methods and search objectives; and applications including text processing, cryptography, numerical modelling, software parallelisation, creation and optimisation of circuits, multi-class classification, scheduling and artificial intelligence.

This book constitutes the revised selected papers of the 9th Italian Workshop on Advances in Artificial Life and Evolutionary Computation held in Vietri sul Mare, Italy, in May 2014, in conjunction with the 24th Italian Workshop on Neural Networks, WIRN 2014.The 16 papers presented have been thoroughly reviewed and selected from 40 submissions. They cover the following topics: artificial neural networks; fuzzy inference systems; rough set; approximate reasoning; and optimization methods such as evolutionary computation, swarm intelligence, particle swarm optimization.

This book constitutes the refereed proceedings of the 7th International Workshop on Probabilistic Graphical Models, PGM 2014, held in Utrecht, The Netherlands, in September 2014. The 38 revised full papers presented in this book were carefully reviewed and selected from 44 submissions. The papers cover all aspects of graphical models for probabilistic reasoning, decision making, and learning.

This book constitutes the refereed proceedings of the 11th Theory of Cryptography Conference, TCC 2014, held in San Diego, CA, USA, in February 2014. The 30 revised full papers presented were carefully reviewed and selected from 90 submissions. The papers are organized in topical sections on obfuscation, applications of obfuscation, zero knowledge, black-box separations, secure computation, coding and cryptographic applications, leakage, encryption, hardware-aided secure protocols, and encryption and signatures.

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms.

This book constitutes the refereed proceedings of the 5th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, held in Warsaw, Poland, in September 2013. The 18 full papers presented together with 4 invited talks were carefully reviewed and selected from 33 submissions. The papers cover topics in the fields of abstract models and logics, specialized models and calculi, algebraic and coalgebraic semantics, system specification and verification, as well as corecursion in programming languages, and algebra and coalgebra in quantum computing. The book also includes 6 papers from the CALCO Tools Workshop, co-located with CALCO 2013 and dedicated to tools based on algebraic and/or coalgebraic principles.

Walter Gautschi has written extensively on topics ranging from special functions, quadrature and orthogonal polynomials to difference and differential equations, software implementations, and the history of mathematics. He is world renowned for his pioneering work in numerical analysis and constructive orthogonal polynomials, including a definitive textbook in the former, and a monograph in the latter area. This three-volume set, Walter Gautschi: Selected Works with Commentaries, is a compilation of Gautschi's most influential papers and includes commentaries by leading experts. The work begins with a detailed biographical section and ends with a section commemorating Walter's prematurely deceased twin brother. This title will appeal to graduate students and researchers in numerical analysis, as well as to historians of science. Selected Works with Commentaries, Vol. 1Numerical ConditioningSpecial FunctionsInterpolation and Approximation Selected Works with Commentaries, Vol. 2Orthogonal Polynomials on the Real LineOrthogonal Polynomials on the SemicircleChebyshev QuadratureKronrod and Other QuadraturesGauss-type Quadrature Selected Works with Commentaries, Vol. 3Linear Difference EquationsOrdinary Differential EquationsSoftwareHistory and BiographyMiscellaneaWorks of Werner Gautschi

This book constitutes the refereed proceedings of the 7th International Conference on Sequences and Their Applications, SETA 2012, held in Waterloo, Canada, in June 2012. The 28 full papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 48 submissions. The papers are grouped in topical sections on perfect sequences; finite fields; boolean functions; Golomb 80th birthday session; linear complexity; frequency hopping; correlation of sequences; bounds on sequences, cryptography; aperiodic correlation; and Walsh transform.

This book constitutes the refereed proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, PKC 2012, held in Darmstadt, Germany, in May 2012. The 41 papers presented were carefully reviewed and selected from 188 submissions. The book also contains one invited talk. The papers are organized in the following topical sections: homomorphic encryption and LWE, signature schemes, code-based and multivariate crypto, public key encryption: special properties, identity-based encryption, public-key encryption: constructions, secure two-party and multi-party computations, key exchange and secure sessions, public-key encryption: relationships, DL, DDH, and more number theory, and beyond ordinary signature schemes.

This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Models for the Web-Graph, WAW 2012, held in Halifax, Nova Scotia, Canada, in June 2012. The 13 papers presented were carefully reviewed and selected for inclusion in this volume. They address a number of topics related to the complex networks such hypergraph coloring games and voter models; algorithms for detecting nodes with large degrees; random Appolonian networks; and a sublinear algorithm for Pagerank computations.

Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems. The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem. The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too.

Machine learning and nonparametric function estimation procedures can be effectively used in forecasting. One important and current application is used to make forecasts of "e;future dangerousness"e; to inform criminal justice decision. Examples include the decision to release an individual on parole, determination of the parole conditions, bail recommendations, and sentencing. Since the 1920s, "e;risk assessments"e; of various kinds have been used in parole hearings, but the current availability of large administrative data bases, inexpensive computing power, and developments in statistics and computer science have increased their accuracy and applicability. In this book, these developments are considered with particular emphasis on the statistical and computer science tools, under the rubric of supervised learning, that can dramatically improve these kinds of forecasts in criminal justice settings. The intended audience is researchers in the social sciences and data analysts in criminal justice agencies.

This book constitutes the refereed proceedings of the Second International Conference on Algorithmic Decision Theory, ADT 2011, held in Piscataway, NJ, USA, in October 2011.The 24 revised full papers presented were carefully reviewed and selected from 50 submissions.

This book constitutes the refereed proceedings of the 14th International Conference on Information Security, ISC 2011, held in Xi'an, China, in October 2011. The 25 revised full papers were carefully reviewed and selected from 95 submissions. The papers are organized in topical sections on attacks; protocols; public-key cryptosystems; network security; software security; system security; database security; privacy; digital signatures.

This three-volume set LNAI 6911, LNAI 6912, and LNAI 6913 constitutes the refereed proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2011, held in Athens, Greece, in September 2011.The 121 revised full papers presented together with 10 invited talks and 11 demos in the three volumes, were carefully reviewed and selected from about 600 paper submissions. The papers address all areas related to machine learning and knowledge discovery in databases as well as other innovative application domains such as supervised and unsupervised learning with some innovative contributions in fundamental issues; dimensionality reduction, distance and similarity learning, model learning and matrix/tensor analysis; graph mining, graphical models, hidden markov models, kernel methods, active and ensemble learning, semi-supervised and transductive learning, mining sparse representations, model learning, inductive logic programming, and statistical learning. a significant part of the papers covers novel and timely applications of data mining and machine learning in industrial domains.

This three-volume set LNAI 6911, LNAI 6912, and LNAI 6913 constitutes the refereed proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2011, held in Athens, Greece, in September 2011.The 121 revised full papers presented together with 10 invited talks and 11 demos in the three volumes, were carefully reviewed and selected from about 600 paper submissions. The papers address all areas related to machine learning and knowledge discovery in databases as well as other innovative application domains such as supervised and unsupervised learning with some innovative contributions in fundamental issues; dimensionality reduction, distance and similarity learning, model learning and matrix/tensor analysis; graph mining, graphical models, hidden markov models, kernel methods, active and ensemble learning, semi-supervised and transductive learning, mining sparse representations, model learning, inductive logic programming, and statistical learning. a significant part of the papers covers novel and timely applications of data mining and machine learning in industrial domains.

This three-volume set LNAI 6911, LNAI 6912, and LNAI 6913 constitutes the refereed proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2011, held in Athens, Greece, in September 2011.The 121 revised full papers presented together with 10 invited talks and 11 demos in the three volumes, were carefully reviewed and selected from about 600 paper submissions. The papers address all areas related to machine learning and knowledge discovery in databases as well as other innovative application domains such as supervised and unsupervised learning with some innovative contributions in fundamental issues; dimensionality reduction, distance and similarity learning, model learning and matrix/tensor analysis; graph mining, graphical models, hidden markov models, kernel methods, active and ensemble learning, semi-supervised and transductive learning, mining sparse representations, model learning, inductive logic programming, and statistical learning. a significant part of the papers covers novel and timely applications of data mining and machine learning in industrial domains.

This book constitutes the refereed proceedings of the 17th International Conference on DNA Computing and Molecular Programming, DNA17, held in Pasadena, CA, USA, in September 2011. The 12 revised full papers presented together with 5 invited talks were carefully selected from numerous submissions. Research in DNA computing and molecular programming draws together mathematics, computer science, physics, chemistry, biology, and nanotechnology to address the analysis, design, and synthesis of information-based molecular systems. This annual meeting is the premier forum where scientists with diverse backgrounds come together with the common purpose of advancing the engineering and science of biology and chemistry from the point of view of computer science, physics, and mathematics.