Mathematical theory of computation Books

Book SynopsisThe algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro­ posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under­ standing of the intrinsic computational difficulty of problems.Trade ReviewP. Bürgisser, M. Clausen, M.A. Shokrollahi, and T. Lickteig Algebraic Complexity Theory "The book contains interesting exercises and useful bibliographical notes. In short, this is a nice book."—MATHEMATICAL REVIEWS From the reviews: "This book is certainly the most complete reference on algebraic complexity theory that is available hitherto. … superb bibliographical and historical notes are given at the end of each chapter. … this book would most certainly make a great textbook for a graduate course on algebraic complexity theory. … In conclusion, any researchers already working in the area should own a copy of this book. … beginners at the graduate level who have been exposed to undergraduate pure mathematics would find this book accessible." (Anthony Widjaja, SIGACT News, Vol. 37 (2), 2006)Table of Contents1. Introduction.- I. Fundamental Algorithms.- 2. Efficient Polynomial Arithmetic.- 3. Efficient Algorithms with Branching.- II. Elementary Lower Bounds.- 4. Models of Computation.- 5. Preconditioning and Transcendence Degree.- 6. The Substitution Method.- 7. Differential Methods.- III. High Degree.- 8. The Degree Bound.- 9. Specific Polynomials which Are Hard to Compute.- 10. Branching and Degree.- 11. Branching and Connectivity.- 12. Additive Complexity.- IV. Low Degree.- 13. Linear Complexity.- 14. Multiplicative and Bilinear Complexity.- 15. Asymptotic Complexity of Matrix Multiplication.- 16. Problems Related to Matrix Multiplication.- 17. Lower Bounds for the Complexity of Algebras.- 18. Rank over Finite Fields and Codes.- 19. Rank of 2-Slice and 3-Slice Tensors.- 20. Typical Tensorial Rank.- V. Complete Problems.- 21. P Versus NP: A Nonuniform Algebraic Analogue.- List of Notation.

Read more less

Book SynopsisThis book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal—Katona theorem on shadows, the Lovász—Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi—Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.Trade ReviewFrom the reviews of the second edition:“This is an entertaining and impressive book. I say impressive because the author managed to cover a very large part of combinatorics in 27 short chapters, without assuming any graduate-level knowledge of the material. … The collection of topics covered is another big advantage of the book. … The book is ideal as reference material or for a reading course for a dedicated graduate student. One could teach a very enjoyable class from it as well … .” (Miklós Bóna, The Mathematical Association of America, May, 2012)"[R]eaders interested in any branch of combinatorics will find this book compelling. ... This book is very suitable for advanced undergraduate and graduate mathematics and computer science majors. It requires a very solid grounding in intermediate-level combinatorics and an appreciation for several proof methods, but it is well worth the study." (G.M. White, ACM Computing Reviews, May 2012)“This is the second edition of a well-received textbook. It has been extended with new and updated results. Typographical errors in the first edition are corrected. … This textbook is suitable for advanced undergraduate or graduate students as well as researchers working in discrete mathematics or theoretical computer science. The author’s enthusiasm for the subject is evident and his writing is clear and smooth. This is a book deserving recommendation.” (Ko-Wei Lih, Zentralblatt MATH, Vol. 1239, 2012)“This is an introductory book that deals with the subject of extremal combinatorics. … The book is nicely written and the author has included many elegant and beautiful proofs. The book contains many interesting exercises that will stimulate the motivated reader to get a better understanding of this area. … author’s goal of writing a self-contained book that is more or less up to date … and that is accessible to graduate and motivated undergraduate students in mathematics and computer science, has been successfully achieved.” (Sebastian M. Cioabă, Mathematical Reviews, January, 2013)Table of ContentsPreface.- Prolog: What this Book Is About.- Notation.- Counting.- Advanced Counting.- Probabilistic Counting.- The Pigeonhole Principle.- Systems of Distinct Representatives.- Sunflowers.- Intersecting Families.- Chains and Antichains.- Blocking Sets and the Duality.- Density and Universality.- Witness Sets and Isolation.- Designs.- The Basic Method.- Orthogonality and Rank Arguments.- Eigenvalues and Graph Expansion.- The Polynomial Method.- Combinatorics of Codes.- Linearity of Expectation.- The Lovász Sieve.- The Deletion Method.- The Second Moment Method.- The Entropy Function.- Random Walks.- Derandomization.- Ramseyan Theorems for Numbers.- The Hales–Jewett Theorem.- Applications in Communications Complexity.- References.- Index.

Read more less

Book SynopsisThis tutorial book presents revised and extended lecture notes for a selection of the contributions presented at the International Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE 2009), which was held in Braga, Portugal, in July 2009. The 16 articles comprise 7 long tutorials, 6 short tutorials and 3 participants contributions; they shed light on the generation and transformation of programs, data, models, metamodels, documentation, and entire software systems. The topics covered include software reverse and re-engineering, model driven engineering, automated software engineering, generic language technology, and software language engineering.Table of ContentsAn Introduction to Software Product Line Refactoring.- Excerpts from the TXL Cookbook.- Model Synchronization: Mappings, Tiles, and Categories.- An Introductory Tutorial on JastAdd Attribute Grammars.- Model Driven Language Engineering with Kermeta; EASY Meta-programming with Rascal.- The Theory and Practice of Modeling Language Design for Model-Based Software Engineering—A Personal Perspective.- Code Transformations for Embedded Reconfigurable Computing Architectures.- Model Transformation Chains and Model Management for End-to-End Performance Decision Support; Building Code Generators with Genesys: A Tutorial Introduction; The Need for Early Aspects.- Lightweight Language Processing in Kiama .- Some Issues in the ‘Archaeology’ of Software Evolution; Teaching Computer Language Handling – From Compiler Theory to Meta-modelling; C++ Metastring Library and Its Applications.- Language Convergence Infrastructure.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 23rd International Conference on Computer Aided Verification, CAV 2011, held in Snowbird, UT, USA, in July 2011. The 35 revised full papers presented together with 20 tool papers were carefully reviewed and selected from 161 submissions. The papers are organized in topical sections on the following workshops: 4th International Workshop on Numerical Software Verification (NSV 2011), 10th International Workshop on Parallel and Distributed Methods in Verifications (PDMC 2011), 4th International Workshop on Exploiting Concurrency Efficiently and Correctly (EC2 2011), Frontiers in Analog Circuit Synthesis and Verification (FAC 2011), International Workshop on Satisfiability Modulo Theories, including SMTCOMP (SMT 2011), 18th International SPIN Workshop on Model Checking of Software (SPIN 2011), Formal Methods for Robotics and Automation (FM-R 2011), and Practical Synthesis for Concurrent Systems (PSY 2011).

Read more less

Book SynopsisThe purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the “resources” by “profit” and then be interested in the maximal profit realized, correspondingly, by a given word.Trade ReviewFrom the reviews:"This book is an excellent reference for researchers in the field, as well as students interested in this research area. The presentation of applications makes it interesting to researchers from other fields to study weighted automata. ... One of the main arguments in favor of this handbook is the completeness of its index table — usually a faulty section in such volumes. The chapters are globally well-written and self-contained, thus pleasant to read, and the efforts put to maintain consistency in vocabulary thorough the book are very appreciable." (Michaël Cadilhac, The Book Review Column 43-3, 2012)“The book presents a broad survey, theory and applications, of weighted automata, classical nondeterministic automata in which transitions carry weights. … The individual articles are written by well-known researchers in the field: they include extensive lists of references and many open problems. The book is valuable for both computer scientists and mathematicians (being interested in discrete structures).” (Cristian S. Calude, Zentralblatt MATH, Vol. 1200, 2011)Table of ContentsFoundations.- Semirings and Formal Power Series.- Fixed Point Theory.- Concepts of Weighted Recognizability.- Finite Automata.- Rational and Recognisable Power Series.- Weighted Automata and Weighted Logics.- Weighted Automata Algorithms.- Weighted Discrete Structures.- Algebraic Systems and Pushdown Automata.- Lindenmayer Systems.- Weighted Tree Automata and Tree Transducers.- Traces, Series-Parallel Posets, and Pictures: A Weighted Study.- Applications.- Digital Image Compression.- Fuzzy Languages.- Model Checking Linear-Time Properties of Probabilistic Systems.- Applications of Weighted Automata in Natural Language Processing.

Read more less

Book SynopsisComputer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives. In addition, it will play a crucial role in the science the 21st century, which will be dominated by biology and biochemistry, similar to the role of mathematics in the physical sciences of the 20th century. In this award-winning best-seller, the author and his co-author focus on the fundamentals of computer science, which revolve around the notion of the algorithm. They discuss the design of algorithms, and their efficiency and correctness, the inherent limitations of algorithms and computation, quantum algorithms, concurrency, large systems and artificial intelligence. Throughout, the authors, in their own words, stress the ‘fundamental and robust nature of the science in a form that is virtually independent of the details of specific computers, languages and formalisms'. This version of the book is published to celebrate 25 years since its first edition, and in honor of the Alan M. Turing Centennial year. Turing was a true pioneer of computer science, whose work forms the underlying basis of much of this book. Trade ReviewFrom the reviews of the third edition:“This book should be on any short list for a central course in computer science. It is designed to provide a uniform background on which all students might draw. It has a good-humored, easy style, which would make any reader unwilling to close the book after opening it anywhere. All computer scientists should have this book. … the bibliography is organized in a convenient chapter-by-chapter form, which makes the book useful for advanced work, and the exercises will help instructors identify capable students.” (Harvey Cohn, ACM Computing Reviews, August, 2012)“This is a reprint of the 3rd edition on the occasion of the 25th year of the existence of the book; it is also intended to honor Alan Turing’s 100th birthday. … it is highly readable, even if one is largely acquainted with the field. It is very well written, containing many illustrative examples, suited also for the non-specialist.” (Gunther Schmidt, Zentralblatt MATH, Vol. 1243, 2012)Table of ContentsPreliminaries.- and Historical Review.- Algorithms and Data.- Programming Languages and Paradigms.- Methods and Analysis.- Algorithmic Methods.- The Correctness of Algorithms.- The Efficiency of Algorithms.- Limitations and Robustness.- Inefficiency and Intractability.- Noncomputability and Undecidability.- Algorithmic Universality and Its Robustness.- Relaxing the Rules.- Parallelism, Concurrency, and Alternative Models.- Probabilistic Algorithms.- Cryptography and Reliable Interaction.- The Bigger Picture.- Software Engineering.- Reactive Systems.- Algorithmics and Intelligence.

Read more less

Book SynopsisThis book is intended for students in computer science, formal linguistics, mathematical logic and to colleagues interested in categorial grammars and their logical foundations. These lecture notes present categorial grammars as deductive systems, in the approach called parsing-as-deduction, and the book includes detailed proofs of their main properties. The papers are organized in topical sections on AB grammars, Lambek’s syntactic calculus, Lambek calculus and montague grammar, non-associative Lambek calculus, multimodal Lambek calculus, Lambek calculus, linear logic and proof nets and proof nets for the multimodal Lambek calculus.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 16th International Conference on Model Driven Engineering Languages and Systems, MODELS 2013, held in Miami, FL, USA, in September/October 2013. The 47 full papers presented in this volume were carefully reviewed and selected from a total of 180 submissions. They are organized in topical sections named: tool support; dependability; comprehensibility; testing; evolution; verification; product lines; semantics; domain-specific modeling languages; models@RT; design and architecture; model transformation; model analysis; and system synthesis.Table of ContentsTool support.- Dependability.- Comprehensibility.- Testing.- Evolution.- Verification.- Product lines.- Semantics.- Domain-specific modeling languages.- Design and architecture.- Model transformation.- Model analysis.- System synthesis.

Read more less

Book SynopsisComputer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives. In addition, it will play a crucial role in the science the 21st century, which will be dominated by biology and biochemistry, similar to the role of mathematics in the physical sciences of the 20th century. In this award-winning best-seller, the author and his co-author focus on the fundamentals of computer science, which revolve around the notion of the algorithm. They discuss the design of algorithms, and their efficiency and correctness, the inherent limitations of algorithms and computation, quantum algorithms, concurrency, large systems and artificial intelligence. Throughout, the authors, in their own words, stress the ‘fundamental and robust nature of the science in a form that is virtually independent of the details of specific computers, languages and formalisms'. This version of the book is published to celebrate 25 years since its first edition, and in honor of the Alan M. Turing Centennial year. Turing was a true pioneer of computer science, whose work forms the underlying basis of much of this book. Trade ReviewFrom the reviews of the third edition:“This book should be on any short list for a central course in computer science. It is designed to provide a uniform background on which all students might draw. It has a good-humored, easy style, which would make any reader unwilling to close the book after opening it anywhere. All computer scientists should have this book. … the bibliography is organized in a convenient chapter-by-chapter form, which makes the book useful for advanced work, and the exercises will help instructors identify capable students.” (Harvey Cohn, ACM Computing Reviews, August, 2012)“This is a reprint of the 3rd edition on the occasion of the 25th year of the existence of the book; it is also intended to honor Alan Turing’s 100th birthday. … it is highly readable, even if one is largely acquainted with the field. It is very well written, containing many illustrative examples, suited also for the non-specialist.” (Gunther Schmidt, Zentralblatt MATH, Vol. 1243, 2012)Table of ContentsPreliminaries.- and Historical Review.- Algorithms and Data.- Programming Languages and Paradigms.- Methods and Analysis.- Algorithmic Methods.- The Correctness of Algorithms.- The Efficiency of Algorithms.- Limitations and Robustness.- Inefficiency and Intractability.- Noncomputability and Undecidability.- Algorithmic Universality and Its Robustness.- Relaxing the Rules.- Parallelism, Concurrency, and Alternative Models.- Probabilistic Algorithms.- Cryptography and Reliable Interaction.- The Bigger Picture.- Software Engineering.- Reactive Systems.- Algorithmics and Intelligence.

Read more less

Book SynopsisDynamic complexity results from hidden, un­known factors—or more precisely, interactions between factors—that can unexpectedly im­pact the perfor­mance of systems. When the influences of dynamic complexity are not meas­ured and understood, new never-seen-before behaviors can come as unwelcomed surprises, which disrupt the performance of systems. Left alone, processes that were once prized for their effi­ciency unexpectedly begin to degrade—costs increase, while volumes and quality decline. Evidence of problems may come too late for effective resolution as technology advance­ments induce rapid change and compress the time available to react to that change. The results of dynamic complexity are always negative and unmanaged dynamic complexity can bring business or global systems to the point of sudden chaos. The 2009 H1N1 pandemic, 2008 Credit Crunch and 2011 Fukushima Daiichi nuclear disaster are global examples of the dangers of undiagnosed dynamic complexity.With increasing frequency executive leaders today are discovering that their business and IT system performance levels are not meeting expectations. In most cases these performance deficiencies are caused by dynamic complexity, which lies hidden like a cancer until the symptoms reveal themselves—often when it is too late to avoid negative impacts on business outcomes. This book examines the growing business problem of dynamic complexity and presents a path to a practical solution. To achieve better predictability, organizations must be able to expose new, dangerous patterns of behavior in time to take corrective actions and know which actions will yield the optimal results. The book authors promote new methods of risk management that use data collection, analytics, machine learning and automation processes to help organizations more accurately predict the future and take strategic actions to improve performance outcomes. The presented means of achieving this goal are based upon the authors’ practical experiences, backed by scientific principles, and results achieved through consulting engagements with over 350 global organizations.Table of ContentsIntroducing and understanding the challenge.- Probability of uncertainty; Complexity Dynamics and how they can drag down the efficiency of a business.- Mathematics and Modeling.- Introduction to patterns, dynamic patterns and compound patterns.- Perturbation theory helps us.- Emulative deconstruction theory.- The components and characteristics of the solution.- Introduction to the WATCHWEB.- Proposed methodology for the WATCHWEB.- Conclusion.

Read more less

Book SynopsisObject-Process Methodology (OPM) is an intuitive approach to systems engineering. This book presents the theory and practice of OPM with examples from various industry segments and engineering disciplines, as well as daily life. OPM is a generic, domain independent approach that is applicable almost anywhere in systems engineering.Table of ContentsI Foundations of Object-Process Methodology.- 1 A Taste of OPM.- 1.1 The Wedding Example: A Sneak Preview of OPM.- 1.2 OPM Building Blocks: Objects, Processes, and States.- 1.3 Specialization and Inheritance.- 1.4 Aggregation and the Result Link.- Summary.- Problems.- 2 Object-Process Diagrams.- 2.1 Objects and Aggregation.- 2.2 Structural Relations and Structural Links.- 2.3 Processes and Procedural Links.- 2.4 System Diagram: The Top-Level OPD.- 2.5 Zooming into the Transaction Executing Process.- 2.6 The OPD Set.- 2.7 How to Read an OPD.- 2.7.1 Flow of Control.- 2.7.2 The Timeline in OPDs.- 2.7.3 Object States and Conditions.- 2.8 Completing the In-Zoomed Transaction Executing OPD.- 2.8.1 Logical XOR, AND, and OR Operators.- 2.8.2 The System Map.- 2.8.3 The Ultimate OPD.- 2.8.4 Zooming Out of Transaction Executing.- Summary.- Problems.- 3 Object-Process Language.- 3.1 Motivation for a Language.- 3.1.1 Real-Time Textual Feedback.- 3.1.2 Closing the Requirements-Implementation Gap.- 3.2 Structural Links and Structure Sentences.- 3.2.1 The First OPL Sentence.- 3.2.2 The First OPL Aggregation Sentence.- 3.3 The OPL Paragraph and the Graphics-Text Principle.- 3.3.1 Extending the OPL Paragraph.- 3.3.2 Enabling Sentences.- 3.3.3 Transformation Sentences.- 3.3.4 The SD Paragraph.- 3.4 More OPL Sentence Types.- 3.4.1 State Enumeration and Condition Sentences.- 3.4.2 AND, XOR, and OR Logical Operators.- 3.4.3 The SD1 Paragraph.- 3.4.4 In-Zooming and Out-Zooming Sentences.- 3.5 Boolean Objects and Determination Sentence.- 3.5.1 Boolean Condition Sentences.- 3.5.2 Compound Condition Sentences.- 3.5.3 State-Specified Generation Sentence.- 3.5.4 Converting a Dual-State Object into a Boolean Object.- 3.6 OPD-OPL Item Pairs and Synergy.- Summary.- Problems.- 4 Objects and Processes.- 4.1 Existence, Things, and Transformations.- 4.1.1 Objects.- 4.1.2 Transformation and Processes.- 4.2 Processes and Time.- 4.2.1 Cause and Effect.- 4.2.2 Syntactic vs. Semantic Sentence Analysis.- 4.2.3 The Process Test.- 4.3 Things.- 4.3.1 Things and Entities.- 4.3.2 The Perseverance of Things.- 4.3.3 The Essence of Things.- 4.3.4 Symbolizing Physical Things.- 4.3.5 The Origin of Things.- 4.3.6 The Complexity of Things.- 4.3.7 Thing Types.- 4.3.8 The Relativity of Object and Process Importance.- 4.3.9 Object and Process Naming.- 4.4 Informatical Objects.- 4.4.1 Telling Informatical and Physical Objects Apart.- 4.4.2 Systems and Information Systems.- 4.4.3 Translation of Informatical Objects.- 4.4.4 Toward “Pure” Informatical Objects.- 4.5 Object Identity.- 4.5.1 Change of State or Change of Identity?.- 4.5.2 Classes and Instances of Objects and Processes.- Summary.- Problems.- II Concepts of OPM Systems Modeling.- 5Dynamics.- 5.1 States.- 5.1.1 Object States and Status.- 5.1.2 Change and Effect.- 5.1.3 Explicit and Implicit Status Representations.- 5.1.4 The Input, Output, and Effect Links.- 5.1.5 State Suppression and the Effect Link.- 5.1.6 State Expression.- 5.2 Existence and Transformation.- 5.2.1 Result and Consumption Links.- 5.2.2 Procedural Links, Enablers, and Transformées.- 5.2.3 Enablers.- 5.2.4 Agents.- 5.2.5 Instruments.- 5.2.6 Enabling Links.- 5.2.7 Transformées.- 5.2.8 Odd Man Out: The Invocation Linkt.- 5.3 Object Roles with Respect to a Process.- 5.3.1 Enablers and Affectees.- 5.3.2 The Involved, Preprocess, and Postprocess Object Sets.- 5.3.3 Condition and Agent Condition Links.- 5.3.4 Operator, Operand, and Transform?.- Summary.- Problems.- 6Structure.- 6.1 Structural Relations.- 6.1.1 Structural Links.- 6.1.2 Structural Relation Directions.- 6.1.3 Unidirectional Structural Link.- 6.1.4 OPD Sentences.- 6.1.5 The Reciprocity of a Structural Relation.- 6.1.6 Null Tags and Their Default OPL Reserved Phrases.- 6.1.7 Structural Relations as Static Verbs.- 6.2 Participation Constraints and Cardinality.- 6.2.1 Participation Constraints.- 6.2.2 Parameterized Participation Constraints.- 6.2.3 Range Participation Constraints.- 6.2.4 Shorthand Notations and Reserved Phrases.- 6.2.5 Cardinality.- 6.2.6 Participation Constraints in Procedural Relations.- 6.3 The Distributive Law and Forks.- 6.3.1 Forks.- 6.3.2 Fork Degree.- 6.3.3 Fork Comprehensiveness.- 6.4 The Transitivity of Structural Relations.- 6.5 The Four Fundamental Structural Relations.- Summary.- Problems.- 7Aggregation and Exhibition.- 7.1 Aggregation-Participation: Underlying Concepts.- 7.1.1 Aggregation-Participation as a Tagged Structural Relation.- 7.1.2 The Aggregation-Participation Symbol.- 7.1.3 Sets and Order.- 7.1.4 Aggregate Naming.- 7.1.5 Aggregating Processes.- 7.2 Aggregation Hierarchy and Comprehensiveness.- 7.2.1 Aggregation Hierarchy.- 7.2.2 Aggregation Comprehensiveness.- 7.2.3 Parameterized Participation Constraints.- 7.2.4 Participation Level and Aggregational Complexity.- 7.3 Exhibition-Characterization: Underlying Concepts.- 7.3.1 The Name Exhibition-Characterization.- 7.3.2 The Exhibition-Characterization Symbol.- 7.3.3 Attribute and Operation Are Features.- 7.3.4 Exhibition Complexity.- 7.4 Features in 00 vs. OPM.- 7.5 The Four Thing-Feature Combinations.- 7.5.1 The Object-Attribute Combination.- 7.5.2 The Object-Operation Combination.- 7.5.3 The Process-Attribute Combination.- 7.5.4 Process-Operation Combination.- 7.6 The Feature Hierarchy.- 7.7 Feature-Related Natural Language Issues.- 7.7.1 Attribute Naming Dilemmas.- 7.7.2 Reserved Objects and the Measurement Unit Reserved Object.- 7.7.3 Continuous Values and Multi-Valued Attributes.- 7.7.4 Mathematical Inequalities in OPM.- 7.8 Reflective Metamodeling of an Attribute.- 7.8.1 The Size of an Attribute.- 7.8.2 The Mode of an Attribute.- 7.8.3 The Touch of an Attribute.- 7.8.4 The Source of a Feature.- 7.8.5 The Operation a Feature Carries.- Summary.- Problems.- 8 Generalization and Instantiation.- 8.1 Generalization-Specialization: Introduction.- 8.1.1 Specialization Symbol and Sentence.- 8.1.2 Process Specialization.- 8.2 Inheritance.- 8.2.1 Feature Inheritance.- 8.2.2 Structural Relations Inheritance.- 8.2.3 Procedural Link Inheritance.- 8.2.4 State Inheritance.- 8.2.5 State Specialization.- 8.2.6 Process Specialization.- 8.2.7 Generalization Complexity.- 8.3 Qualification.- 8.3.1 Qualification Inheritance.- 8.3.2 Multiple Qualification Inheritance.- 8.4 Classification-Instantiation.- 8.4.1 Classes and Instances.- 8.4.2 The Relation Between Instantiation and Specialization.- 8.4.3 The Relativity of Instance.- 8.4.4 Instance Qualification.- 8.4.5 Process Instances.- 8.4.6 Classification Complexity.- 8.5 Modifiers and Instances.- 8.5.1 Natural Language Modifiers and Shortcuts.- 8.5.2 Adjectives and Attributes.- 8.5.3 Adverbs and Operations.- 8.6 Specializations of the Involved Object Set Members.- 8.7 Non-Comprehensiveness.- 8.7.1 Non-Comprehensiveness of Fundamental Structural Relations.- 8.7.2 Non-Comprehensiveness of States and Values.- Summary.- Problems.- 9 Managing Systems’ Complexity.- 9.1 The Need for Complexity Management.- 9.1.1 Middle-Out as the De-Facto Architecting Practice.- 9.1.2 Determining the Extent of Refinement.- 9.1.3 Towards Quantifying Complexity.- 9.2 Divide and Conquer: By Aspects or by Details?.- 9.2.1 Why is Detail Decomposition Good?.- 9.2.2 When Should a New OPD Be Created?.- 9.3 The Attributes of Scaling.- 9.3.1 The Purpose of Scaling.- 9.3.2 The Mode of Scaling.- 9.3.3 Controlling Visibility by In- and Out-Zooming.- 9.3.4 The Distributivity of Procedural Links.- 9.3.5 Unfolding and Folding.- 9.3.6 State Expressing and Suppressing.- 9.3.7 Primary and Secondary Operands.- 9.4 Abstracting.- 9.4.1 Consolidating.- 9.4.2 Zoom consolidating.- 9.4.3 Paths and Path Labels.- 9.4.4 Zoom Consolidating Pitfalls.- 9.4.5 Zoom Consolidating Conditions.- 9.4.6 Fold Consolidating.- 9.5 What Happens to Procedural Links During Abstracting?.- 9.5.1 Procedural Link Precedence.- 9.5.2 Semi-Folding and Semi-Unfolding.- 9.5.3 Selective Semi-Folding and Semi-Unfolding.- 9.6 Looking at the Big Picture: The System Map and the OPM Construct Pairs.- Summary.- Problems.- III Building Systems with OPM.- 10 Systems and Modeling.- 10.1 Defining Systems.- 10.1.1 Some Existing Definitions.- 10.1.2 Function.- 10.1.3 The Various Functions of Stone.- 10.2 System Defined.- 10.2.1 System as a Relative Term.- 10.2.2 System as a Subjective Term.- 10.2.3 The Function of Naturaland Artificial Systems.- 10.3 Goal, Concept, and Function.- 10.3.1 The Intent and Goal of Artificial Systems.- 10.3.2 Telling System Function and Dynamics Apart.- 10.3.3 Function, Structure, and Behavior.- 10.4 System Architecture.- 10.4.1 Function vs. Dynamics.- 10.4.2 The Concept Behind a System.- 10.4.3 The Origin and Essence of Systems.- 10.5 Objects, Systems, and Products.- 10.5.1 Product Defined.- 10.5.2 The Object-System-Product Hierarchy.- 10.5.3 Goods, Services, and Projects.- 10.6 Documenting Functions of the System Architecture.- 10.6.1 The Function Hierarchy.- 10.6.2 Function Boxes and Function Sentences.- 10.6.3 Functionality.- 10.7 From Systems to Models.- 10.7.1 Some Model Definitions.- 10.7.2 Model Defined.- 10.8 Modeling Paradigms.- 10.8.1 Natural Language as a Modeling Tool.- 10.8.2 Mathematical and Symbolic Modeling.- 10.8.3 Graphic Modeling and Knowledge Representation.- 10.9 Reflective Metamodeling.- Summary.- Problems.- 11 System Lifecycle and Evolution.- 11.1 System Lifecycle.- 11.1.1 Lifecycle of Artificial Systems.- 11.1.2 Software and Product Development Processes.- 11.2 Systems Analysis and the Scientific Method.- 11.3 Categorization vs. Interdisciplinarity.- 11.4 System Engineering and the Role of the System Architect.- 11.5 An OPM Model of System Lifecycle Phases.- 11.5.1 Top-Level Description of System Evolution.- 11.5.2 Initiating the System.- 11.5.3 Developing the System.- 11.5.4 Analyzing.- 11.5.5 The Refining-Abstracting Cycles.- 11.5.6 Designing.- 11.5.7 The Waterfall Model vs. Iterative and Incremental Development.- 11.5.8 Deploying the System.- 11.6 Zooming into Analyzing.- 11.7 Zooming into Designing and Implementing.- 11.8 From Design to Implementation.- Summary.- Problems.- 12 States and Values.- 12.1 State-specified Objects and Links.- 12.1.1 Initial, Ultimate and Default States.- 12.1.2 The Transformation Attribute of a Process.- 12.1.3 Object as a Role Player for State.- 12.1.4 State Maintaining Processes.- 12.1.5 Sentences and Phrases of States and Values.- 12.1.6 Single Value Sentence.- 12.2 Telling States Apart from Values.- 12.3 Metamodeling the Attributes of Value and Their States.- 12.3.1 Numeric and Symbolic Values.- 12.3.2 Mapping Object States onto Attribute Values.- 12.4 Compound States and State Space.- 12.4.1 The Attribute Feasibility Matrix.- 12.4.2 Logical Compound States.- Summary.- Problems.- 13 Advanced OPM Concepts.- 13.1 Real-Time Issues.- 13.1.1 Sequential vs. Parallel Process Execution.- 13.1.2 Process Synchronization.- 13.1.3 Events.- 13.1.4 Chronon and Event.- 13.1.5 Basic Triggering Event Types.- 13.2 Process and State Duration.- 13.3 Processing states.- 13.4 Probability in Procedural Relations.- 13.5 Scope and Name Disambiguation.- 13.5.1 The Fundamental DAG.- 13.5.2 Scope of an Object.- 13.6 The Reserved Words “of” and “which”.- 13.6.1 The Reserved Word “of” and the Dot Operator.- 13.6.2 Using “of” with Tagged Structural Relations.- 13.6.3 The Reserved Word “which”.- 13.6.4 Operation: A Process Without Side Effect.- 13.7 Structure-Related Issues.- 13.7.1 Transitivity Strength.- 13.7.2 Hamiltonian Distance.- 13.7.3 The Fractal Relation.- 13.7.4 Covariance and Contravariance.- 13.8 OPM Metamodeling Issues.- 13.8.1 AMetamodelofThing.- 13.8.2 The Specialization-Specification Hierarchy.- 13.8.3 A Refined Generic Processing Model.- 13.8.4 Time Exception Handling.- 13.9 The OPM Construct Hierarchy.- Summary.- Problems.- 14 Systems Theory.- 14.1 The Informatics Hierarchy.- 14.1.1 Computers Are Climbing the Informatics Hierarchy.- 14.1.2 Knowledge and Understanding.- 14.2 Ontology.- 14.3 General Systems Theory.- 14.3.1 A Brief History of General Systems Theory.- 14.3.2 The Hierarchy of System Levels.- 14.4 Autopoietic vs. Allopoietic Systems.- 14.5 Systems and Humans.- 14.6 Systems Theory Characteristics.- 14.6.1 Previously Defined Characteristics.- 14.6.2 System, Environment and Beneficiaries.- 14.6.3 Control and Feedback.- 14.7 Classical Physics vs. Quantum Theory.- 14.7.1 Visualization.- 14.7.2 Causality.- 14.7.3 Locality.- 14.7.4 Self-Identity.- 14.7.5 Objectivity.- 14.8 Objectifying: Converting a Process into an Object.- Summary.- Problems.- 15 Object-Oriented Modeling.- 15.1 The Evolution of System Analysis Methods.- 15.1.1 Data Flow Diagrams.- 15.1.2 Entity-Relationship Diagrams and Their Combination with DFD.- 15.1.3 The Object-Oriented Paradigm.- 15.2 Pre-UML Object-Oriented Methods.- 15.2.1 Object Modeling Technique.- 15.2.2 Object-Oriented Software Engineering.- 15.2.3 Object-Oriented Analysis and Object-Oriented Design.- 15.2.4 Object-Oriented Systems Analysis.- 15.2.5 Object-Oriented Analysis & Design.- 15.2.6 Object Life-Cycles.- 15.2.7 The Booch Method.- 15.2.8 MOSES.- 15.2.9 The Fusion Method.- 15.2.10 OPEN Modeling Language.- 15.3 Unified Modeling Language-UML.- 15.4 Metamodeling in OO Methods.- 15.5 OO Methods - A Summary.- 15.6 Software Development Approaches and Trends.- 15.6.1 Aspect-Oriented Programming.- 15.6.2 The Rational Unified Process.- 15.6.3 Extreme Programming.- 15.6.4 Agile Modeling.- 15.7 Challenges for OO Methods.- 15.7.1 A Historic Perspective.- 15.7.2 The Encapsulation Challenge.- 15.7.3 The Model Multiplicity Challenge.- 15.7.4 Empirical Evidence of the Model Multiplicity Problem.- 15.7.5 The Complexity Management Challenge.- 15.8 OPM and OO.- 15.8.1 The UML 2.0 Initiative.- 15.8.2 Systemantica: an OPM Supporting Tool.- 15.8.3 OPM Applications and Research: Present and Future.- Summary.- Problems.- Appendix A: The ATM System.- References.

Read more less

Book SynopsisDas Buch Arithmetik ist eine Übersetzung des vierten Kapitels der legendären Werkreihe "The Art of Computer Programming" von Donald E. Knuth in der neuesten Fassung. Es handelt sich um eine umfangreiche Einführung in die Computeralgebra, die den neuesten Stand der Forschung berücksichtigt. Donald E. Knuth versteht es, die Algorithmen didaktisch sehr geschickt und ohne Kompromisse bei der Strenge aufzubereiten. Das Buch enthält außerdem Hunderte von Aufgaben verschiedener Schwierigkeitsgrade mit Lösungen. Der Übersetzer, Prof. Dr. R. Loos, lehrt an der Universität Tübingen.Table of Contents4 — Arithmetik.- 4.1. Stellenwertsysteme.- 4.2. Gleitkomma-Aritlunetik.- 4.2.1. Einfachgenaue Rechnungen.- 4.2.2. Genauigkeit der Gleitkonuna-Arithmetik.- *4.2.3. Doppeltgenaue Rechnungen.- 4.2.4. Verteilung von Gleitkomrnazahlen.- 4.3. Mehrfachgenaue Aritlunetik.- 4.3.1. Die klassischen Algorithmen.- *4.3.2. Modulare Aritlnnetik.- *4.3.3. Wie schnell könn en wir multiplizieren?.- 4.4. Basiswechsel.- 4.5. Rationale Arithmetik.- 4.5.1. Brüche.- 4.5.2. Der größte gemeinsame Teiler.- *4.5.3. Analyse des euklidschen Algorithmus.- 4.5.4. Zerlegung in Prirnfaktoren.- 4.6. Polynornarithmetik.- 4.6.1. Division von Polynomen.- *4.6.2. Faktorisierung von Polynomen.- 4.6.3. Auswertung von Potenzen.- 4.6.4. Auswertung von Polynomen.- *4.7. Operationen an Potenzreihen.- Lösungen zu den Übungsaufgaben.- Anhang A — Tafeln numerischer Größen.- 1. Fundamentale Konstanten (dezimal).- 2. Fundamentale Konstanten (oktal).- 3. Harrnonische Zahlen , Bernoulli-Zahlen, Fibonacci-Zahlen.- Anhang B — Index der Bezeichnungen.- Index und Glossar.

Read more less

Book SynopsisThe design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen­ dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith­ mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa­ tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven­ tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.Table of ContentsI. Foundations.- 1. Machine Models: RAM and RASP.- 2. Randomized Computations.- 3. A High Level Programming Language.- 4. Structured Data Types.- 4.1 Queues and Stacks.- 4.2 Lists.- 4.3 Trees.- 5. Recursion.- 6. Order of Growth.- 7. Secondary Storage.- 8. Exercises.- 9. Bibliographic Notes.- II. Sorting.- 1. General Sorting Methods.- 1.1 Sorting by Selection, a First Attempt.- 1.2 Sorting by Selection: Heapsort.- 1.3 Sorting by Partitioning: Quicksort.- 1.4 Sorting by Merging.- 1.5 Comparing Different Algorithms.- 1.6 Lower Bounds.- 2. Sorting by Distribution.- 2.1 Sorting Words.- 2.2 Sorting Reals by Distribution.- 3. The Lower Bound on Sorting, Revisited.- 4. The Linear Median Algorithm.- 5. Exercises.- 6. Bibliographic Notes.- III. Sets.- 1. Digital Search Trees.- 1.1 Tries.- 1.2 Static Tries or Compressing Sparse Tables.- 2. Hashing.- 2.1 Hashing with Chaining.- 2.2 Hashing with Open Addressing.- 2.3 Perfect Hashing.- 2.4 Universal Hashing.- 2.5 Extendible Hashing.- 3. Searching Ordered Sets.- 3.1 Binary Search and Search Trees.- 3.2 Interpolation Search.- 4. Weighted Trees.- 4.1 Optimum Weighted Trees, Dynamic Programming, and Pattern Matching.- 4.2 Nearly Optimal Binary Search Trees.- 5. Balanced Trees.- 5.1 Weight-Balanced Trees.- 5.2 Height-Balanced Trees.- 5.3 AdvancedTopicson(a,b)-Trees.- 5.3.1 Mergable Priority Queues.- 5.3.2 Amortized Rebalancing Cost and Sorting Presorted Files.- 5.3.3 Finger Trees.- 5.3.4 Fringe Analysis.- 6. Dynamic Weighted Trees.- 6.1 Self-Organizing Data Structures and Their Amortized and Average Case Analysis.- 6.1.1 Self-Organizing Linear Lists.- 6.1.2 Splay Trees.- 6.2 D-trees.- 6.3 An Application to Multidimensional Searching.- 7. A Comparison of Search Structures.- 8. Subsets of a Small Universe.- 8.1 The Boolean Array (Bitvector).- 8.2 The O(log log N) Priority Queue.- 8.3 The Union-Find Problem.- 9. Exercises.- 10. Bibliographic Notes.- IX. Algorithmic Paradigms.

Read more less

Book SynopsisThe present book is based on the conference Software Development and Reality Construction held at SchloB Eringerfeld in Germany, September 25 - 30, 1988. This was organized by the Technical University of Berlin (TUB) in cooperation with the German National Research Center for Computer Science (GMD), Sankt Augustin, and sponsored by the Volkswagen Foundation whose financial support we gratefully acknowledge. The conference was an interdisciplinary scientific and cultural event aimed at promoting discussion on the nature of computer science as a scientific discipline and on the theoretical foundations and systemic practice required for human-oriented system design. In keeping with the conversational style of the conference, the book comprises a series of individual contributions, arranged so as to form a coherent whole. Some authors reflect on their practice in computer science and system design. Others start from approaches developed in the humanities and the social sciences for understanding human learning and creativity, individual and cooperative work, and the interrelation between technology and organizations. Thus, each contribution makes its specific point and can be read on its own merit. But, at the same time, it takes its place as a chapter in the book, along with all the other contributions, to give what seemed to us a meaningful overall line of argumentation. This required careful editorial coordination, and we are grateful to all the authors for bearing with us throughout the slow genesis of the book and for complying with our requests for extensive revision of some of the manuscripts.Table of ContentsPrologue.- 1 Thinking About Computer Science.- 1.1 Human Questions in Computer Science.- 1.2 Learning from our Errors.- 2 Living Computer Science.- 2.1 The Technical and the Human Side of Computer Science.- 2.2 Hermeneutics and Path.- 2.3 Computing: Yet Another Reality Construction.- 2.4 How Many Choices Do We Make? How Many Are Difficult?.- 2.5 From Scientific Practice to Epistemological Discovery.- 3 On Reality Construction.- 3.1 Self-Organization and Software Development.- 3.2 Software Development as Reality Construction.- 3.3 The Idea that Reality is Socially Constructed.- 4 Learning to Know.- 4.1 Scientific Expertise as a Social Process.- 4.2 How to Communicate Proofs or Programs.- 4.3 Making Errors, Making Sense, Making Use.- 4.4 Artifacts in Software Design.- 5 Computer Science and Beyond.- 5.1 The Denial of Error.- 5.2 Towards a New Understanding of Data Modelling.- 5.3 A Reappraisal of Information Science.- 6 Understanding the Computer Through Metaphors.- 6.1 Perspectives and Metaphors for Human-Computer Interaction.- 6.2 Software Tools in a Programming Workshop.- 6.3 Soft Engines — Mass-Produced Software for Working People?.- 6.4 Artificial Intelligence: A Hermeneutic Defense.- 7 Designing for People.- 7.1 Shared Responsibility: A Field of Tension.- 7.2 A Subject-Oriented Approach to Information Systems.- 7.3 Anticipating Reality Construction.- 7.4 On Controllability.- 7.5 Work Design for Human Development.- 8 Epistemological Approaches to Informatics.- 8.1 Truth and Meaning Beyond Formalism.- 8.2 Informatics and Hermeneutics.- 8.3 Language and Software, or: Fritzl’s Quest.- 8.4 Activity Theory as a Foundation for Design.- 8.5 Reflections on the Essence of Information.- Epilogue.- List of Authors.

Read more less

Book SynopsisDem Leser werden neben praxisnahen Beispielen zu jedem Thema auch zahlreiche Übungsaufgaben mit Lösungen zur Verfügung gestellt. Somit kann der zukünftige Studierende sich zunächst orientieren, ob seine Fähigkeiten für das gewünschte Ingenieurstudium bereits ausreichend sind oder ob er mehr hierfür tun muss.Table of ContentsMathematische Grundlagen.- Elementare Geometrie.- Funktionen.- Differentialrechnung.- Integralrechnung.- Vektorrechnung.- Matrizenrechnung.- Wahrscheinlichkeits- und Fehlerrechnung.- Folgen und Reihen.- Ausblick: Komplexe Zahlen und Differentialgleichungen.

Read more less

Book SynopsisFabian Lorig develops a procedure model for hypothesis-driven simulation studies which supports the design, conducting, and analysis of simulation experiments. It is aimed at facilitating the execution of simulation studies with regard to the replicability and reproducibility of the results. In comparison to existing models, this approach is based on a formally specified hypothesis. Each step of the simulation study can be adapted to the central hypothesis and performed in such a way that it can optimally contribute to the verification and thus to the confirmation or rejection of the hypothesis.Table of ContentsFoundations and Methods of Simulation.- Assistance and Automation of Simulation.- Requirements Analysis on Hypotheses in Simulation.- Hypothesis-Driven Simulation Studies.- Services for the Assistance of Simulation Studies.- Case Study: Supply Chain Management.

Read more less

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 21st Workshop on Logic, Language, Information and Communication, WoLLIC 2014, held in Valparaiso, Chile, in September 2014. The 15 contributed papers presented together with 6 invited lectures were carefully reviewed and selected from 29 submissions. The focus of the workshop was on the following subjects Inter-Disciplinary Research involving Formal Logic, Computing and Programming Theory, and Natural Language and Reasoning.

Read more less

Book SynopsisThe overall structure of this new edition is three-tier: Part I presents the basics, Part II is concerned with methodological issues, and Part III discusses advanced topics. In the second edition the authors have reorganized the material to focus on problems, how to represent them, and then how to choose and design algorithms for different representations. They also added a chapter on problems, reflecting the overall book focus on problem-solvers, a chapter on parameter tuning, which they combined with the parameter control and "how-to" chapters into a methodological part, and finally a chapter on evolutionary robotics with an outlook on possible exciting developments in this field.The book is suitable for undergraduate and graduate courses in artificial intelligence and computational intelligence, and for self-study by practitioners and researchers engaged with all aspects of bioinspired design and optimization.Trade Review“This book aims to give a thorough introduction to evolutionary computing, covering techniques and methodological issues. … the book does a good job of giving a general overview of the field. It assumes very little initial knowledge and the breath of its coverage is very impressive. … the supporting website does contain suggested further reading for each of the chapters.” (Barry Wilkes, bcs The Chartered Institute for IT, bcs.org, May, 2016)“This second edition of the book under review is very timely and corresponds to Evolutionary Computation (EC)’s status as an established methodology. … The chapter subdivision into different algorithms used in the first edition … has been replaced by a more suitable student/researcher-oriented approach; this is also supported by the website www.evolutionarycomputation.org, which contains a trove of exercises, slides and extra bibliographic references.” (Anna I. Esparcia-Alcázar, Mathematical Reviews, May, 2016)“Introduction to Evolutionary Computing is an excellent and readable text that should find a place on the bookshelf of anyone who researches and/or teaches in this domain. Suitable for a graduate course or upper-level undergraduate course in Evolutionary Computing, it is also a superior and well-organized reference book. … papers and presentations cited in the text provide a marvelous literature review. … The clarity of exposition and detail are excellent … .” (Jeffrey L. Popyack, Genetic Programming and Evolvable Machines, Vol. 17 (2), 2016)Table of ContentsProblems to Be Solved.- Evolutionary Computing: The Origins.- What Is an Evolutionary Algorithm?.- Representation, Mutation, and Recombination.- Fitness, Selection, and Population Management.- Popular Evolutionary Algorithm Variants.- Hybridisation with Other Techniques: Memetic Algorithms.- Nonstationary and Noisy Function Optimisation.- Multiobjective Evolutionary Algorithms.- Constraint Handling.- Interactive Evolutionary Algorithms.- Coevolutionary Systems.- Theory.- Evolutionary Robotics.- Parameters and Parameter Tuning.- Parameter Control.- Working with Evolutionary Algorithms.- References.

Read more less

Book SynopsisParameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). For problems at higher levels of the PH, a promising solving approach is to develop fixed-parameter tractable reductions to SAT, and to subsequently use a SAT solving algorithm to solve the problem. In this dissertation, a theoretical toolbox is developed that can be used to classify in which cases this is possible. The use of this toolbox is illustrated by applying it to analyze a wide range of problems from various areas of computer science and artificial intelligence.Table of ContentsComplexity Theory and Non-determinism.- Parameterized Complexity Theory.- Fpt-Reducibility to SAT.- The Need for a New Completeness Theory.- A New Completeness Theory.- Fpt-algorithms with Access to a SAT Oracle.- Problems in Knowledge Representation and Reasoning.- Model Checking for Temporal Logics.- Problems Related to Propositional Satisfiability.- Problems in Judgment Aggregation.- Planning Problems.- Graph Problems.- Relation to Other Topics in Complexity Theory.- Subexponential-Time Reductions.- Non-Uniform Parameterized Complexity.- Open Problems and Future Research Directions.- Conclusion.- Compendium of Parameterized Problems.- Generalization to Higher Levels of the Polynomial Hierarchy.

Read more less

Book SynopsisThis book explains compactly, without theoretical superstructure and with as little mathematical formalism as possible, the essential concepts in the encryption of messages and data worthy of protection. The focus is on the description of the historically and practically important cipher, signature and authentication methods. Both symmetric encryption and public-key ciphers are discussed. In each case, the strategies used to attack and attempt to "crack" encryption are also discussed. Special emphasis is placed on the practical use of ciphers, especially in the everyday environment. The book is suitable for working groups at STEM schools and STEM teacher training, for introductory courses at universities as well as for interested students and adults.Table of ContentsBasics and history.- Symmetric ciphers.- Public-key ciphers.- Digital signature.

Read more less

Book SynopsisThese transactions publish research in computer-based methods of computational collective intelligence (CCI) and their applications in a wide range of fields such as performance optimization in IoT, big data, reliability, privacy, security, service selection, QoS and machine learning. This 37th issue contains 9 selected papers which present new findings and innovative methodologies as well as discuss issues and challenges in the field of collective intelligence from big data and networking paradigms while addressing security, privacy, reliability and optimality to achieve QoS to the benefit of final users. Table of ContentsThe decline of the Buchholz tiebreaker system: a preferable alternative.- Constructing Varied and Attractive Shortlists from Databases: A Group Decision Approach Algorithms for measuring indirect control in corporate networks and effects of divestment.- Algorithms for measuring indirect control in corporate networks and effects of divestment.- Lies, Damned Lies, and Crafty Questionnaire Design.- Solidarity Measures.- Transportation problem with fuzzy unit costs. Z-fuzzy numbers approach.- The new ecological paradigm, functional stupidity and university sustainability – a polish case study.- A Model of a Parallel Design Environment for the Development of Decision-making IoT.

Read more less

Book SynopsisDiese Theorie-Einführung hat konsequent aktuelle Anwendungen im Blick. Seien es Suchmaschinen, Workflow-Managementsysteme, Web Services, Verschlüsselung von Informationen, Authentifizierungsprotokolle – all diese Technologien beruhen auf theoretischen Grundlagen der Informatik. So trägt das Buch dazu bei, dass Studierende die Grundlagen der Theoretischen Informatik nicht nur kennen lernen, sondern auch anwenden können, um effektiv und produktiv an informationstechnischen Problemlösungen mitwirken zu können. Wegen seiner speziellen inhaltlichen und didaktischen Qualität ist das Buch neben dem Einsatz in der Lehre auch für das Selbststudium geeignet.Table of ContentsEndliche Automaten und reguläre Sprachen - Kontextfreie Sprachen und Kellerautomaten - Turingmaschinen und Berechenbarkeit - Grenzen von Algorithmen - Komplexität, Effizienz und Effektivität - Vielfältige Anwendungen theoretischer Konzepte in der Praxis

Read more less

Book Synopsis

Read more less

Book SynopsisThis book demonstrates that the concept of an instruction sequence offers a novel and useful viewpoint on issues relating to diverse subjects in computer science. Selected issues relating to well-known subjects from the theory of computation and the area of computer architecture are rigorously investigated in this book thinking in terms of instruction sequences. The subjects from the theory of computation, to wit the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits. The subjects from the area of computer architecture, to wit instruction sequence performance, instruction set architectures and remote instruction processing, are usually not investigated in a rigorous way at all.Table of ContentsIntroduction.- Instruction Sequences.- Instruction Processing.- Expressiveness of Instruction Sequences.- Computation-Theoretic Issues.- Computer-Architectural Issues.- Instruction Sequences and Process Algebra.- Variations on a Theme.- Appendix A: Five Challenges for Projectionism.- Appendix B: Natural Number Functional Units.- Appendix C: Dynamically Instantiated Instructions.- Appendix D: Analytic Execution Architectures.

Read more less

Book SynopsisThe volume contains original research papers as the Proceedings of the International Conference on Advances in Mathematics and Computing, held at Veer Surendra Sai University of Technology, Odisha, India, on 7-8 February, 2020. It focuses on new trends in applied analysis, computational mathematics and related areas. It also includes certain new models, image analysis technique, fluid flow problems, etc. as applications of mathematical analysis and computational mathematics. The volume should bring forward new and emerging topics of mathematics and computing having potential applications and uses in other areas of sciences. It can serve as a valuable resource for graduate students, researchers and educators interested in mathematical tools and techniques for solving various problems arising in science and engineering.Table of ContentsChapter 1. A fuzzy two-ware-house inventory model of deteriorating items with exponentially demand and backlogged condition.- Chapter 2. A comparative study of non-linear convection in a confined fluid overlying a porous layer.- Chapter 3. Persistence barcoded vehicular traffic videos in a topology of data approach to shape tracking.- Chapter 4. Heat transfer of MHD channel flow of viscoelastic (PTT) fluid.- Chapter 5. Properties of characteristic polynomials of oriented graphs.- Chapter 6. An inventory model on price-dependent-demand and linear deteriorating item with allowable shortages under partial-backlogged condition.- Chapter 7. On the local convergence of a sixth-order iterative scheme in Banach spaces.- Chapter 8. New results on chromatic polynomials.- Chapter 9. Recurrence relations of edge-Zagreb and sum-edge characteristic polynomials of some graphs.- Chapter 10. Effects of radiation on MHD flow with induced magnetic field.- Chapter 11. Various approximate multiplicative inverse lie ⋆-derivations.- Chapter 12. Analysis and computation of reactive second grade fluid flow with variable viscosity within porous channel.- Chapter 13. Hopf bifurcation and stability analysis of delayed Lotka-Volterra predator-prey model having disease for both existing species.- Chapter 14. An EOQ model without shortages with uncertain cost associated with some fuzzy parameters and interval parameters.- Chapter 15. Free Poisson elements induced by orthogonal projections.

Read more less

Book SynopsisThis book gathers selected papers presented at the 6th International Conference on Artificial Intelligence and Evolutionary Computations in Engineering Systems, held at the Anna University, Chennai, India, from 20 to 22 April 2020. It covers advances and recent developments in various computational intelligence techniques, with an emphasis on the design of communication systems. In addition, it shares valuable insights into advanced computational methodologies such as neural networks, fuzzy systems, evolutionary algorithms, hybrid intelligent systems, uncertain reasoning techniques, and other machine learning methods and their application to decision-making and problem-solving in mobile and wireless communication networks.Table of ContentsChapter 1. Design and Construction of a Dual Axis Solar Tracking System by Astronomical Algorithm.- Chapter 2. Estimation of Magnetic Flux linkage in SRM using various defuzzification techniques.- Chapter 3. Multilevel Inverter based STATCOM for Distribution System.- Chapter 4. Sensitivity Analysis and Design Optimization of Synchronous Reluctance and Permanent Magnet Motors.- Chapter 5. A New Heuristic algorithm for Economic Load Dispatch incorporating wind power.- Chapter 6. Enhanced Grasshopper Optimization Algorithm For Numerical Optimization.- Chapter 7. Eco-Routing – To Reduce Vehicle CO2 Emissions by CACC: An IoT Application.- Chapter 8. Fuzzy Sliding Mode Control of DC-DC Boost Converter with Right-Half Plane Zero.- Chapter 9. Liquid Level Control of Non Linear Process Using Big Bang - Big Crunch Optimization Based Controller.- Chapter 10. Impact of PV Cells and MPPT Controller on Power System Dynamics.- Chapter 11. Wavelet Feature Based Microcalcification Detection in Mammogram.- Chapter 12. Reliable Radiation Hardened Memory Cells for Single-Event Multiple Effects.- Chapter 13. Finger Vein Identification Using Deep Convolutional Generative Adversarial Networks.- Chapter 14. Computer Aided Detection of Malignant Mass in Mammogram using U-Net Architecture.- Chapter 15. Visualization and Evaluation of Methane Gas Leakage by Thermal Image Processing using Supervised Deep Learning Models.

Read more less

Book SynopsisThis book highlights the practical aspects of computer modelling and simulation of complex dynamical systems for students. Mechanical systems are considered in the book as representative examples of dynamical systems. Wolfram SystemModeler, in combination with Learning Management System Sakai, is used as an instrument for studying features of various physical and technical phenomena and processes. Each of the presented virtual labs may be considered a stand-alone mini project to enable students to go through all the steps of mathematical modelling and computer simulation—from the problem statement to mathematical and physical analysis of the obtained result. The book is useful for teachers to organize the educational process, allowing gradual monitoring of the learning process and assessment of students’ competencies. It also allows tutors to design individual educational trajectories for students to achieve educational properties. The subject of the book is an extension of activity started by the international team of authors within the InMotion project of the European programme ERASMUS+.Trade Review“The authors went to great effort to produce beautiful figures, with color no less, to aid the reader. The tables are laid out logically, and the discussion for each model is, for the most part straightforward. I wish I could recommend the book … .” (David S. Mazel, MAA Reviews, August 22, 2022)Table of Contents1. Virtual Labs (76 pages) 2 Guidelines for performing virtual labs in Wolfram SystemModeler (63 pages)

Read more less

Book SynopsisThis textbook is intended as a textbook for one-semester, introductory computer science courses aimed at undergraduate students from all disciplines. Self-contained and with no prerequisites, it focuses on elementary knowledge and thinking models. The content has been tested in university classrooms for over six years, and has been used in summer schools to train university and high-school teachers on teaching introductory computer science courses using computational thinking. This book introduces computer science from a computational thinking perspective. In computer science the way of thinking is characterized by three external and eight internal features, including automatic execution, bit-accuracy and abstraction. The book is divided into chapters on logic thinking, algorithmic thinking, systems thinking, and network thinking. It also covers societal impact and responsible computing material – from ICT industry to digital economy, from the wonder of exponentiation to wonder of cyberspace, and from code of conduct to best practices for independent work. The book’s structure encourages active, hands-on learning using the pedagogic tool Bloom's taxonomy to create computational solutions to over 200 problems of varying difficulty. Students solve problems using a combination of thought experiment, programming, and written methods. Only 300 lines of code in total are required to solve most programming problems in this book.Trade Review“The book companion website includes the course’s lecture and project slides as well as Go source code. … Xu and Zhang validate the view that it is indeed more concerned with … CS instruction itself and provides an effective framework for teaching the subject from introductory to advanced courses. Thus they agree with other notable CT researchers and practitioners, such as Denning and Tedre [1], and their textbook is a most valuable contribution to CS education.” (Harry J. Foxwell, Computing Reviews, October 12, 2022)“The book has a companion website from which readers can pull down over 200 MB of zip files with lecture notes, lab notes … and project notes. This is a puzzling book in some respects. On the one hand it covers basic concepts and terminology for the beginning student, yet on the other hand plunges into sophisticated topics without drawing a breadth. Likewise, it claims that programing experience is not a prerequisite … .” (Anthony J. Duben, Computing Reviews, August 30, 2022)“The most preeminent characteristic of this book is its ‘thinking’-perspective, which the reader may or may not like, and which perhaps leads to a suboptimal arrangements of topics. … the material presented is impressive, and at least the fundamentals are covered in great detail.” (Dieter Riebesehl, zbMATH 1490.68001, 2022)Table of Contents1 Overview of Computer Science.-2 Processes of Digital Symbol Manipulation.- 3 Logic Thinking.- 4 Algorithmic Thinking.- 5 Systems Thinking.- 6 Network Thinking.- 7 Projects.- 8 Appendices.

Read more less

Book SynopsisThis book is a collection of peer-reviewed best selected research papers presented at the Second International Conference on Machine Intelligence and Smart Systems (MISS 2021), organized during September 24–25, 2021, in Gwalior, India. The book presents new advances and research results in the fields of machine intelligence, artificial intelligence and smart systems. It includes main paradigms of machine intelligence algorithms, namely (1) neural networks, (2) evolutionary computation, (3) swarm intelligence, (4) fuzzy systems and (5) immunological computation. Scientists, engineers, academicians, technology developers, researchers, students and government officials will find this book useful in handling their complicated real-world issues by using machine intelligence methodologies.Table of ContentsArtificial Intelligence Aided Neurodevelopmental Disorders Diagnosis: Techniques Revisited.- Deep Learning Implementation for Dark Matter Particle Detection.- Augmentation of Handwritten Devanagari Character Dataset Using DCGAN.- Deep Reinforcement Learning for Optimal Traffic Control.- Ensemble Semi-Supervised Machine Learning Algorithm for Classifying Complaint Tweets.- Underwater Image Enhancement Using Fusion Stretch Method.- A Novel Approach for Semantic Microservices Description and Discovery towards Smarter Applications.

Read more less

Book SynopsisThis book contains select papers presented at the 3rd International Conference on Engineering Mathematics and Computing (ICEMC 2020), held at the Haldia Institute of Technology, Purba Midnapur, West Bengal, India, from 5–7 February 2020. The book discusses new developments and advances in the areas of neural networks, connectionist systems, genetic algorithms, evolutionary computation, artificial intelligence, cellular automata, self-organizing systems, soft computing, fuzzy systems, hybrid intelligent systems, etc. The book, containing 19 chapters, is useful to the researchers, scholars, and practising engineers as well as graduate students of engineering and applied sciences. Table of ContentsFuzzy Random Continuous Review Inventory Model with Controllable Lead-time and Exponential Crashing Cost.- Multilevel Meshfree RBF-FD Method for Elliptic Partial Differential Equations.- Some Fixed Point Theorems in Fuzzy Strong B-Metric Spaces.- Camera Tracking for Robotic Ships.- Some Arithmetic Operations on Trapezoidal Intuitionistic Fuzzy Number and Its Application in Solving Linear Programming Problem by Simplex Algorithm.- Investment Analysis Based on New Fuzzy Methodology.- Existence of Quadruple Fixed Point Results in Ordered K Metric Space Through C Distance with Application in Integral Equation.- New Dice Similarity Measure of Fuzzy Numbers and its application in Multicriteria Decision Making.- Ensemble of Cyberspace Users Tendency in Blog Writing Using Regression Algorithms.- An Intelligent Intrusion Detection System Using a Novel Combination of PCA and MLP.- Performance Analysis for Various Mobility Nodes for Manet Protocol Using Fuzzy Inference System.- Ion Partitioning Effects on Electroosmotic Flow Through ph Regulated Cylindrical Nanopore.- Optimal Control of Complementary and Substitute Items in a Production System for Infinite Time Horizon.

Read more less

Book SynopsisThis book presents various theories and algorithms to create a quantum computer. The concept of the classical and quantum computers, and the concept of circuits and gates are reviewed. The example of the Deutsch and the Deutsch-Josca algorithm is discussed to illustrate some key features of quantum computing. The Grover algorithm, considered to be of major milestone of the subject, is discussed in detail to exemplify the techniques used in computer algorithms. The role of quantum superposition (also called quantum parallelism) and of quantum entanglement is discussed in order to understand the key advantages of a quantum over a classical computer.Table of Contents1 Introduction 2 Classical Computer 2.1 Binary Representation 3 Quantum Computer 3.1 Qubit 4 Classical Gates and Circuits 5 Quantum Gates and Circuits 5.1 Hilbert space 5.2 Measurement 6 Deutsch Algorithm 7 Grover Algorithm 7.1 Grover algorithm: two-qubit 7.2 Grover algorithm: n-qubit 7.3 Grover diffusion and rotation gate G 7.4 Single Recursion: Two qubit 8 Deutsch-Josza Algorithm 9 Simon’s Algorithm 9.1 Quantum Algorithm 9.2 An Illustrative Example 10 Quantum Fourier Transform (QFT) 51 10.1 Quantum circuit of QFT 11 Shor 11.1 Introduction 11.2 Understanding the classical algorithm 11.3 Quantum algorithm 12 Option Pricing 12.1 Quantum Algorithm for Option Pricing 12.2 Quadratic Improvement 12.3 Estimation of Phase 12.4 Call Option 13 Solving Linear Equations 13.1 Introduction 13.2 Harrow-Hassidim-Lloyd Algorithm 13.3 Specific Example 13.4 Other applications 14 Quantum-Classical Hybrid Algorithms 14.1 Why bother? 14.2 Overlap of Wavefunctions 14.3 Variational Quantum Eigensolvers 15 Quantum Error Correction 15.1 Introduction 15.2 Simple quantum errors 15.3 Kraus Operators 15.4 Nine-qubit Code 15.5 General properties of quantum error-correcting codes 15.6 Classical Linear Codes 15.7 CSS Codes 16 Efficiency of a Quantum Computer 16.1 So where does quantum computation take place? 16.2 Conclusions 16.3 Acknowledgements

Read more less

Book SynopsisThis textbook highlights a concise introduction to quantum mechanics in a readable and serious manner. Being readable, the book intends to present the beauty and magic of quantum mechanics to the mass public. Being serious, the book uses mathematics to describe the most profound results in quantum mechanics. To balance the two, the book assumes that the readers are familiar with high-school mathematics and instructs the least possible advanced mathematics necessary for the understanding of quantum mechanics.The book first covers the history of quantum mechanics and then introduces the magical quantum world, including quantum states living in Hilbert space, indistinguishable particles, linear superposition, Heisenberg's uncertainty relations, quantum entanglement, Bell's inequality, quantum energy levels, Schrödinger’s cat and many-worlds theory, etc. To compare with classic physics, the book also covers the classic mechanics before introducing quantum mechanics. At last, the book briefly covers quantum computing and quantum communications. Besides readers of other majors, the book is also a good reference for students in physics. It helps physics students to develop a solid understanding of the basics of quantum mechanics, preventing them from getting lost in solving the Schrödinger equation. The book also discusses quantum entanglement and quantum information which traditional quantum mechanics textbooks do not cover. The Foreword is written by Frank Wilczek, Nobel Laureate in physics, 2004.This book is a translation of an original Chinese edition. The translation was done with the help of artificial intelligence (machine translation by the service DeepL.com). A subsequent human revision was done primarily in terms of content, so that the book will read stylistically differently from a conventional translation.Table of ContentsChapter 1. What is quantum?.- Chapter 2. Brief history of quantum mechanics.- Chapter 3. Classical mechanics and old quantum theories.- Chapter 4. Complex number and linear algebra.- Chapter 5. Quantum entanglement and Bell’s inequality.- Chapter 6. Quantum measurement.- Chapter 7. Quantum computing.- Chapter 8. Quantum communications.

Read more less

Book SynopsisThis book focuses on improving the performance (convergence rate, communication efficiency, computational efficiency, etc.) of algorithms in the context of distributed optimization in networked systems and their successful application to real-world applications (smart grids and online learning). Readers may be particularly interested in the sections on consensus protocols, optimization skills, accelerated mechanisms, event-triggered strategies, variance-reduction communication techniques, etc., in connection with distributed optimization in various networked systems. This book offers a valuable reference guide for researchers in distributed optimization and for senior undergraduate and graduate students alike.Table of ContentsChapter 1. Distributed Nesterov-Like Accelerated Algorithms in Networked Systems with Directed Communications.- Chapter 2. Distributed Stochastic Projected Gradient Algorithms for Composite Constrained Optimization in Networked Systems.- Chapter 3. Distributed Proximal Stochastic Gradient Algorithms for Coupled Composite Optimization in Networked Systems.- Chapter 4. Distributed Subgradient Algorithms Based on Event-Triggered Strategy in Networked Systems.- Chapter 5. Distributed Accelerated Stochastic Algorithms Based on Event-Triggered Strategy in Networked Systems.- Chapter 6. Event-Triggered Based Distributed Optimal Economic Dispatch in Smart Grids.- Chapter 7. Fast Distributed Optimal Economic Dispatch in Dynamic Smart Grids with Directed Communications.- Chapter 8. Accelerated Distributed Optimal Economic Dispatch in Smart Grids with Directed Communications.- Chapter 9. Privacy Preserving Distributed Online Learning with Time-Varying and Directed Communications.

Read more less

Book Synopsis

Read more less

Book SynopsisMulti layer Clos Network Task Optimization Based on Heuristic and Greedy Algorithms.- Optimization of Fresh E Commerce Warehouse Layout Based on 0-1 Integer Programming.- An Integrated Simulated Annealing Algorithm for WiFi based Indoor Positioning.- Constructions of Teaching Materials, Curriculums, and the Teaching System Cross Region for "Solving Problems by Programming".- Exploration on Teaching Content Reform of Programming Course in the Era of AI.- Exploration of K12 Multi level Information and AI Talent Training Model.- Course Design and Textbook Development for Introduction to Computer Systems Course in the Era of Concurrency.- A TOF Estimation Method Based on the Improved MUSIC Algorithm.- Task Scheduling in MultiLayer CLOS Topology Networks Based on Shortest Path.- Indoor Localization Problem Based on WiFi Using MUSIC Algorithm and Maximum Likelihood Estimation.- Optimizing Fresh Warehouse Networks Using MIP and SARIMA Forecasting.- Teaching Study on Algorithm Design and Analysis Innovation Teaching Method Reform Based on Practice.- New Teaching Philosophy of Theoretical Computer Science Courses in AI Era Data Structure as an Example.

Read more less

Book Synopsis

Read more less

Book Synopsis.- Particle Swarm Optimization..- Set-Based Particle Swarm Optimization for the Multi-Objective Multi-Dimensional Knapsack Problem..- Proposal of a Memory-Based Ensemble Particle Swarm Optimizer..- A Tri-swarm Particle Swarm Optimization Considering the Cooperation and the Fitness Value..- A Modified Variable Velocity Strategy Particle Swarm Optimization Algorithm for Multi-objective Feature Selection..- Multi-Strategy Enhanced Particle Swarm Optimization Algorithm for Elevator Group Scheduling..- A Self-Learning Particle Swarm Optimization Algorithm for Dynamic Job Shop Scheduling Problem with New Jobs Insertion..- Convolutional Neural Network Architecture Design Using An Improved Surrogate-assisted Particle Swarm Optimization Algorithm..- Swarm Intelligence Computing..- Cooperative Search and Rescue Target Assignment Based on Improved Ant Colony Algorithm..- A Metabolic Pathway Design Method based on surrogate-assisted Fireworks Algo

Read more less

Book SynopsisThis book constitutes the proceedings of the 24th International Conference on Formal Methods and Software Engineering, ICFEM 2023, held in Brisbane, QLD, Australia, during November 21–24, 2023.The 13 full papers presented together with 8 doctoral symposium papers in this volume were carefully reviewed and selected from 34 submissions, the volume also contains one invited paper. The conference focuses on applying formal methods to practical applications and presents papers for research in all areas related to formal engineering methods.Table of Contents​Invited Talk: Verifying Compiler Optimisations.- Regular Papers: An Idealist’s Approach for Smart Contract Correctness.- Active Inference of EFSMs Without Reset.- Learning Mealy Machines with Local Timers.- Compositional Vulnerability Detection with Insecurity Separation Logic.- Dynamic Extrapolation in Extended Timed Automata.- Formalizing Robustness against Character-level Perturbations for Neural Network Language Models.- Trace models of concurrent valuation algebras.- Branch and Bound for Sigmoid-like Neural Network Verification.- Certifying Sequential Consistency of Machine Learning Accelerators.- Guided Integration of Formal Verification in Assurance Cases.- Validation-Driven Development.- Incremental Property Directed Reachability.- Proving Local Invariants in ASTDs.- Doctoral Symposium Papers: Formal Verification of the Burn-to-Claim Blockchain Interoperable Protocol.- Early and systematic validation of formal models.- Verifying Neural Networks by Approximating Convex Hulls.- Eager to Stop: Efficient Falsification of Deep Neural Networks.- A Runtime Verification Framework For Cyber-physical Systems Based On Data Analytics And LTL Formula Learning.- Unified Verification of Neural Networks’ Robustness and Privacy in Computer Vision.- IoT Software Vulnerability Detection Techniques through Large Language Model.- Vulnerability Detection via Typestate-Guided Code Representation Learning.

Read more less

Book SynopsisThe six-volume set LNCS 14447 until 14452 constitutes the refereed proceedings of the 30th International Conference on Neural Information Processing, ICONIP 2023, held in Changsha, China, in November 2023. The 652 papers presented in the proceedings set were carefully reviewed and selected from 1274 submissions. They focus on theory and algorithms, cognitive neurosciences; human centred computing; applications in neuroscience, neural networks, deep learning, and related fields. Table of ContentsTheory and Algorithms.- Efficient Lightweight Network with Transformer-based Distillation for Micro-crack Detection of Solar Cells.- {MTLAN: Multi-Task Learning and Auxiliary Network for Enhanced Sentence Embedding.- Correlated Online k-Nearest Neighbors Regressor Chain for Online Multi-Output Regression.- Evolutionary Computation for Berth Allocation Problems: A Survey.- Cognitive Neurosciences.- Privacy-Preserving Travel Time Prediction for Internet of Vehicles: A Crowdsensing and Federated Learning Approach.- A Fine-Grained Domain Adaptation Method for Cross-Session Vigilance Estimation in SSVEP-Based BCI.- RMPE:Reducing Residual Membrane Potential Error for Enabling High-accuracy and Ultra-low-latency Spiking Neural Networks.- An improved target searching and imaging method for CSAR.- Block-Matching Multi-Pedestrian Tracking.- RPF3D: Range-Pillar Feature Deep Fusion 3D Detector for Autonomous Driving.- Traffic Signal Control Optimization Based on Deep Reinforcement Learning With Attention Mechanisms.- CMCI: A Robust Multimodal Fusion Method For Spiking Neural Networks.- A Weakly Supervised Deep Learning Model for Alzheimer's Disease Prognosis Using MRI and Incomplete Labels.- Two-Stream Spectral-Temporal Denoising Network for End-to-end Robust EEG-based Emotion Recognition.- Brain-inspired Binaural Sound Source Localization Method Based On Liquid State Machine.- A Causality-Based Interpretable Cognitive Diagnosis Model.- RoBrain: Towards Robust Brain-to-Image Reconstruction via Cross-Domain Contrastive Learning.- High-dimensional multi-objective PSO based on radial projection.- Link Prediction Based on the Sub-graphs Learning with Fused Features.- Naturalistic Emotion Recognition Using EEG and Eye Movements.- Task Scheduling With Improved Particle Swarm Optimization In Cloud Data Center.- Traffic Signal Optimization at T-shaped intersections Based on Deep Q Networks.- A Multi-task Framework for Solving Multimodal Multiobjective Optimization Problems.- Domain Generalized Object Detection with Triple Graph Reasoning Network.- RPUC: Semi-supervised 3D Biomedical Image Segmentation through Rectified Pyramid Unsupervised Consistency.- Cancellable iris recognition scheme based on inversion fusion and local ranking.- EWMIGCN: Emotional Weighting based Multimodal Interaction Graph Convolutional Networks for Personalized Prediction.- Neighborhood Learning for Artificial Bee Colony Algorithm: A Mini-survey.- Human Centred Computing.- Channel Attention Separable Convolution Network for Skin Lesion Segmentation.- A DNN-based Learning Framework for Continuous Movements Segmentation.- Neural-Symbolic Recommendation with Graph-Enhanced Information.- Contrastive Hierarchical Gating Networks for Rating Prediction.- Interactive Selection Recommendation Based on the Multi-Head Attention Graph Neural Network.- CM-TCN: Channel-aware Multi-scale Temporal Convolutional Networks For Speech Emotion Recognition.- FLDNet: A Foreground-Aware Network for Polyp Segmentation Leveraging Long-Distance Dependencies.- Domain-Invariant Task Optimization for Cross-domain Recommendation.- Ensemble of randomized neural network and boosted trees for eye tracking-based driver situation awareness recognition and interpretation.- Temporal Modeling Approach for Video Action Recognition Based on Vision-Language Models.- A Deep Learning Framework with Pruning RoI Proposal for Dental Caries Detection in Panoramic X-ray Images.- User stance aware network for rumor detection using semantic relation inference and temporal graph convolution.- IEEG-CT: A CNN and Transformer Based Method for Intracranial EEG Signal Classification.- Multi-Task Learning Network for Automatic Pancreatic Tumor Segmentation and Classification with Inter-Network Channel Feature Fusion.- Fast and Efficient Brain Extraction with Recursive MLP based 3D UNet.- A Hip-Knee Joint Coordination Evaluation System in Hemiplegic Individuals Based on Cyclogram Analysis.- Evaluation of football players' performance based on Multi-Criteria Decision Analysis approach and sensitivity analysis.

Read more less

Book SynopsisProfessor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and profound way." This volume includes a selection of seminal papers embodying the work that led to this award, exemplifying Cook's synthesis of ideas and techniques from logic and the theory of computation including NP-completeness, proof complexity, bounded arithmetic, and parallel and space-bounded computation. These papers are accompanied by contributed articles by leading researchers in these areas, which convey to a general reader the importance of Cook's ideas and their enduring impact on the research community. The book also contains biographical material, Cook's Turing Award lecture, and an interview. Together these provide a portrait of Cook as a recognized leader and innovator in mathematics and computer science, as well as a gentle mentor and colleague.

Read more less

Book Synopsis1. Why Learning Tech is Important for Kids.- 2. Early Learners.- 3. Getting Started with Block Coding.- 4. Youth Coding Projects.- 5. Five Women in Tech Role Models

Read more less