Mathematical theory of computation Books

Book SynopsisThis text aims to provide graduate students with a self-contained introduction to topics that are at the forefront of modern algebra, namely, coalgebras, bialgebras and Hopf algebras. The last chapter (Chapter 4) discusses several applications of Hopf algebras, some of which are further developed in the author’s 2011 publication, An Introduction to Hopf Algebras. The book may be used as the main text or as a supplementary text for a graduate algebra course. Prerequisites for this text include standard material on groups, rings, modules, algebraic extension fields, finite fields and linearly recursive sequences.The book consists of four chapters. Chapter 1 introduces algebras and coalgebras over a field K; Chapter 2 treats bialgebras; Chapter 3 discusses Hopf algebras and Chapter 4 consists of three applications of Hopf algebras. Each chapter begins with a short overview and ends with a collection of exercises which are designed to review and reinforce the material. Exercises range from straightforward applications of the theory to problems that are devised to challenge the reader. Questions for further study are provided after selected exercises. Most proofs are given in detail, though a few proofs are omitted since they are beyond the scope of this book.Trade Review“The goal of the book under review is to introduce graduate students to some basic results on coalgebras, bialgebras, Hopf algebras, and their applications. The book may be used as the main text or as a supplementary text for a graduate course. … This book should be very useful as a first introduction for someone who wants to learn about Hopf algebras and their applications.” (Jörg Feldvoss, zbMATH 1341.16034, 2016)Table of ContentsPreface.- Notation.- 1. Algebras and Coalgebras.- 2. Bialgebras.- 3. Hopf Algebras.- 4. Applications of Hopf Algebras.- Bibliography.

Read more less

Book SynopsisPresenting a comprehensive resource for the mastery of network analysis in R, the goal of Network Analysis with R is to introduce modern network analysis techniques in R to social, physical, and health scientists. The mathematical foundations of network analysis are emphasized in an accessible way and readers are guided through the basic steps of network studies: network conceptualization, data collection and management, network description, visualization, and building and testing statistical models of networks. As with all of the books in the Use R! series, each chapter contains extensive R code and detailed visualizations of datasets. Appendices will describe the R network packages and the datasets used in the book. An R package developed specifically for the book, available to readers on GitHub, contains relevant code and real-world network datasets as well.Table of ContentsIntroducing Network Analysis in R.- The Network Analysis "5 Number Summary".- Network Data Management in R.- Basic Network Plotting and Layout.- Effective Network Graphic Design.- Advanced Network Graphics.- Actor Prominence.- Subgroups.- Affiliation Networks.- Random Network Models.- Statistical Network Models.- Dynamic Network Models.- Simulations.

Read more less

Book SynopsisThis book presents in their basic form the most important models of computation, their basic programming paradigms, and their mathematical descriptions, both concrete and abstract. Each model is accompanied by relevant formal techniques for reasoning on it and for proving some properties. After preliminary chapters that introduce the notions of structure and meaning, semantic methods, inference rules, and logic programming, the authors arrange their chapters into parts on IMP, a simple imperative language; HOFL, a higher-order functional language; concurrent, nondeterministic and interactive models; and probabilistic/stochastic models.The authors have class-tested the book content over many years, and it will be valuable for graduate and advanced undergraduate students of theoretical computer science and distributed systems, and for researchers in this domain. Each chapter of the book concludes with a list of exercises addressing the key techniques introduced, solutions to selected exercises are offered at the end of the book.Table of ContentsPreliminaries.- Operational Semantics of IMP.- Induction and Recursion.- Partial Orders and Fixpoints.- Denotational Semantics of IMP.- Operational Semantics of HOFL.- Domain Theory.- HOFL Denotational Semantics.- Equivalence Between HOFL Denotational and Operational Semantics.- Calculus for Communicating Systems (CCS).- Temporal Logic and mu-Calculus.- Pi-Calculus.- Measure Theory and Markov Chains.- Markov Chains with Actions and Non-determinism.- Performance Evaluation Process Algebra (PEPA).

Read more less

Book SynopsisGegenstand dieses Werkes sind die Theorie und Praxis der modernen funktionalen Programmierung. Dabei betrachten die Autoren aber nicht nur das, was mittels der heute implementierten Sprachen wie HASKELL, OPAL, ML usw. machbar ist, sondern weisen auch auf aktuelle Entwicklungen hin. Zum einen werden fortgeschrittene Programmiertechniken vorgestellt, wie z.B. die Verwendung unendlicher Datenstrukturen, Parser als Funktionen höherer Ordnung, Approximations-Algorithmen, Lösung von Gleichungssystemen usw. Zum anderen werden aber auch Sprachkonzepte diskutiert, wie z.B. eine systematische Form der Modularisierung oder besonders ausdrucksstarke und flexible Formen der Typisierung. Ein besonderes Gewicht wird generell auf die Integration verschiedener Paradigmen gelegt, wie etwa die Verbindung mit Konzepten der objektorientierten, der nebenläufigen oder der Constraint-basierten Programmierung. In diesem Zusammenhang wird speziell auch die Bedeutung von Monaden analysiert und kritisch hinterfragt.Trade ReviewAus den Rezensionen: "Bei diesem Titel … werden … fortgeschrittene Leser angesprochen, die mit den Grundlagen der funktionalen Programmierung vertraut sind. … ‘Im Vordergrund stehen Ideen und Konzepte einer eleganten, sicheren und produktiven Form des Programmierens‘, wobei der Blick in die Zukunft gerichtet ist und Konzepte und Methoden vorgestellt werden, die erst in den Sprachen der nächsten Generation verfügbar sein werden. Geeignet für Bibliotheken … an Hochschulstandorten … Das Lehrbuch kann noch weiter genutzt werden." (Isigkeit, in: ekz-Informationsdienst, 2006)Table of ContentsElementare Funktionale Programmierung Eine Wiederholung.- Das Strittigste vorab: Notationen.- Grundlagen der Funktionalen Programmierung.- Faulheit währt unendlich.- Parser als Funktionen höherer Ordnung.- Strukturierung von Programmen.- Gruppen: Die Basis der Modularisierung.- Operatoren auf Gruppen (Morphismen).- Die Idee der Typisierung.- Typen.- Subtypen (Vererbung).- Polymorphe und abhängige Typen.- Spezifikationen und Typklassen: Wie Typen typisiert werden.- Beispiel: Berechnung von Fixpunkten.- Beispiel: Monaden.- Datenstrukturen.- Netter stack und böse Queue.- Compilertechniken für funktionale Datenstrukturen.- Funktionale Arrays und Numerische Mathematik.- Map: Wenn Funktionen zu Daten werden.- Beispiel: Synthese von Programmen.- Integration von Paradigmen.- Zeit und Zustand in der funktionalen Welt.- Objekte und Ein-/Ausgabe.- Agenten und Prozesse.- Graphische Schnittstellen (GUIs).- Massiv parallele Programme.- Integration von Konzepten anderer Programmierparadigmen.

Read more less

Book SynopsisThis is a thoroughly revised and enlarged second edition that presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently.Table of ContentsPreliminaries.- The Ehrenfeucht-Fraïssé Method.- More on Games.- 0-1 Laws.- Satisfiability in the Finite.- Finite Automata and Logic: A Microcosm of Finite Model Theory.- Descriptive Complexity Theory.- Logics with Fixed-Point Operators.- Logic Programs.- Optimization Problems.- Logics for PTIME.- Quantifiers and Logical Reductions.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.Table of ContentsKeynotes.- Algorithmic Challenges in Web Search Engines.- RNA Molecules: Glimpses Through an Algorithmic Lens.- Squares.- Matching Based Augmentations for Approximating Connectivity Problems.- Modelling Errors and Recovery for Communication.- Lossless Data Compression Via Error Correction.- The Power and Weakness of Randomness in Computation.- Regular Contributions.- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.- On Clusters in Markov Chains.- An Architecture for Provably Secure Computation.- Scoring Matrices That Induce Metrics on Sequences.- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.- The Complexity of Diffuse Reflections in a Simple Polygon.- Counting Proportions of Sets: Expressive Power with Almost Order.- Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.- Relations Among Notions of Security for Identity Based Encryption Schemes.- Optimally Adaptive Integration of Univariate Lipschitz Functions.- Classical Computability and Fuzzy Turing Machines.- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.- An Algorithm for a Generalized Maximum Subsequence Problem.- Random Bichromatic Matchings.- Eliminating Cycles in the Discrete Torus.- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.- Pattern Matching Statistics on Correlated Sources.- Robust Model-Checking of Linear-Time Properties in Timed Automata.- The Computational Complexity of the Parallel Knock-Out Problem.- Reconfigurations in Graphs and Grids.- -Varieties, Actions and Wreath Product.- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.- Oblivious Medians Via Online Bidding.- Efficient Computation of the Relative Entropy of Probabilistic Automata.- A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.- De Dictionariis Dynamicis Pauco Spatio Utentibus.- Customized Newspaper Broadcast: Data Broadcast with Dependencies.- On Minimum k-Modal Partitions of Permutations.- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.- Maximizing Throughput in Queueing Networks with Limited Flexibility.- Network Flow Spanners.- Finding All Minimal Infrequent Multi-dimensional Intervals.- Cut Problems in Graphs with a Budget Constraint.- Lower Bounds for Clear Transmissions in Radio Networks.- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.- Lower Bounds for Geometric Diameter Problems.- Connected Treewidth and Connected Graph Searching.- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.- The Committee Decision Problem.- Common Deadline Lazy Bureaucrat Scheduling Revisited.- Approximate Sorting.- Stochastic Covering and Adaptivity.- Algorithms for Modular Counting of Roots of Multivariate Polynomials.- Hardness Amplification Via Space-Efficient Direct Products.- The Online Freeze-Tag Problem.- I/O-Efficient Algorithms on Near-Planar Graphs.- Minimal Split Completions of Graphs.- Design and Analysis of Online Batching Systems.- Competitive Analysis of Scheduling Algorithms for Aggregated Links.- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains.- On Sampling in Higher-Dimensional Peer-to-Peer Systems.- Mobile Agent Rendezvous in a Synchronous Torus.- Randomly Colouring Graphs with Girth Five and Large Maximum Degree.- Packing Dicycle Covers in Planar Graphs with No K 5–e Minor.- Sharp Estimates for the Main Parameters of the Euclid Algorithm.- Position-Restricted Substring Searching.- Rectilinear Approximation of a Set of Points in the Plane.- The Branch-Width of Circular-Arc Graphs.- Minimal Eulerian Circuit in a Labeled Digraph.- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.- RISOTTO: Fast Extraction of Motifs with Mismatches.- Minimum Cost Source Location Problems with Flow Requirements.- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.- Constructions of Approximately Mutually Unbiased Bases.- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.

Read more less

Book SynopsisThe workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.Table of ContentsComputability and Complexity in Analysis.- Effectivity of Regular Spaces.- The Degree of Unsolvability of a Real Number.- A Survey of Exact Arithmetic Implementations.- Standard Representations of Effective Metric Spaces.- Banach-Mazur Computable Functions on Metric Spaces.- A Generic Root Operation for Exact Real Arithmetic.- Effective Contraction Theorem and Its Application.- Polynomially Time Computable Functions over p-Adic Fields.- On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems.- Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory.- Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations.- ?-Approximable Functions.- Computabilities of Fine-Continuous Functions.- The iRRAM: Exact Arithmetic in C++.- The Uniformity Conjecture.- Admissible Representations of Limit Spaces.- Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions.- Effective Fixed Point Theorem over a Non-Computably Separable Metric Space.- Computational Dimension of Topological Spaces.- Some Properties of the Effective Uniform Topological Space.- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.- Is the Linear Schrödinger Propagator Turing Computable?.- A Computable Spectral Theorem.- Report on Competition.- Exact Real Arithmetic Systems: Results of Competition.

Read more less

Book Synopsisto the Encyclopaedia Subseries on Operator Algebras and Non-Commutative Geometry The theory of von Neumann algebras was initiated in a series of papers by Murray and von Neumann in the 1930's and 1940's. A von Neumann algebra is a self-adjoint unital subalgebra M of the algebra of bounded operators of a Hilbert space which is closed in the weak operator topology. According to von Neumann's bicommutant theorem, M is closed in the weak operator topology if and only if it is equal to the commutant of its commutant. Afactor is a von Neumann algebra with trivial centre and the work of Murray and von Neumann contained a reduction of all von Neumann algebras to factors and a classification of factors into types I, II and III. C* -algebras are self-adjoint operator algebras on Hilbert space which are closed in the norm topology. Their study was begun in the work of Gelfand and Naimark who showed that such algebras can be characterized abstractly as involutive Banach algebras, satisfying an algebraic relation connecting the norm and the involution. They also obtained the fundamental result that a commutative unital C* -algebra is isomorphic to the algebra of complex valued continuous functions on a compact space - its spectrum. Since then the subject of operator algebras has evolved into a huge mathematical endeavour interacting with almost every branch of mathematics and several areas of theoretical physics.Trade ReviewFrom the reviews:"... These notes [by E.Stormer] describe the main approaches to noncommutative entropy, together with several ramifications and variants. The notion of generator and variational principle are used to give applications to subfactors and C*-algebra formalism of quantum statistical mechanics. The author considers the most frequently studied examples, including Bernoulli shifts, Bogolyubov automorphisms, dual automorphisms on crossed products, shifts on infinite free products, and binary shifts on the CAR-algebra. The mathematical techniques and ideas are beautifully exposed, and the whole paper is a rich resource on the subject, either for the expert or the beginner. ..."V.Deaconu, Mathematical Reviews 2004"... the author gives a clear presentation of the dramatic developments in the classification theory for simple C*-algebras that have taken place over the past 25 years or so. ... As there is such a large amount of literature on the subject, this monograph article is particularly useful to the relative novice who wants to know the fundamental results in the theory without wading through a massive amount of detail. ...This monograph-length article is extremely well-written, filled with concrete examples, and has an exhaustive bibliography. I recommend it as an excellent introduction to graduate students and other mathematicians who want to bring themselves up-to-date on the subject. .."J.A.Packer, Mathematical Reviews 2004“Both contributions to this volume are high-end, excellently written research reviews, reflecting very thoroughly the current status in the respectively treated subbranches of the quickly evolving complex field of C* algebra theory. They both give a beautiful lay-out of the vast research program in the field which has been going on for decades … as well as to the standard works. … an excellent, very thorough, concise and needed overview for the researcher who is active in this field.” (Mark Sioen, Bulletin of the Belgian Mathematical Society, 2007) Table of ContentsI. Classification of Nuclear, Simple C*-algebras.- II. A Survey of Noncommutative Dynamical Entropy.

Read more less

Book SynopsisThis monograph covers the recent major advances in various areas of set theory. From the reviews: "One of the classical textbooks and reference books in set theory....The present ‘Third Millennium’ edition...is a whole new book. In three parts the author offers us what in his view every young set theorist should learn and master....This well-written book promises to influence the next generation of set theorists, much as its predecessor has done." --MATHEMATICAL REVIEWSTrade ReviewFrom the reviews of the third edition: "Thomas Jech’s text has long been considered a classic survey of the state of the set theory … . As every logician will know, this is a work of extraordinary scholarship, essential for any graduate logician who needs to know where the current boundaries of research are situated. Each chapter ends with a valuable historical survey and there is an extensive bibliography. This will continue to be the bible for set theorists in the new century." (Gerry Leversha, The Mathematical Gazette, March, 2005) "The book does masterly what it is supposed to do. … every mathematician who wishes to refresh his knowledge of set theory will read it with pleasure. … They will also find historical notes, and precise references … . A very comprehensive bibliography, and detailed indexes complete the work. This book fills a serious gap in the literature and there is no doubt that it will become a standard reference … . One can strongly recommend its acquisition for any mathematical library." (Jean-Roger Roisin, Bulletin of the Belgian Mathematical Society, Vol. 11 (3), 2004) "One of the classical textbooks and reference books in set theory is Jech’s Set Theory. … The present ‘Third Millennium’ edition … is a whole new book. In three parts the author offers us what in his view every young set theorist should learn and master. … This well-written book promises to influence the next generation of set theorists, much as its predecessor has done over the last quarter of a century." (Eva Coplakova, Mathematical Reviews, 2004 g) "Jech’s book, ‘Set Theory’ has been a standard reference for over 25 years. This ‘Third Millennium Edition’, not only includes all the materials in the first two editions, but also covers recent developments of set theory during the last 25 years. We believe that this new version will become a standard reference on set theory for the next few years." (Guohua Wu, New Zealand Mathematical Society Newsletter, April, 2004) "Jech’s classic monograph has been a standard reference for a generation of set theorists. Though … labeled ‘The Third Millennium Edition’, the present work is in fact a new book. ... Even sections presenting older results have been rewritten and modernized. Exercises have been moved to the end of each section. The bibliography, the section on notation, and the index have been considerably expanded as well. This new edition will certainly become a standard reference on set theory for years to come." (Jörg D. Brendle, Zentralblatt MATH, Vol. 1007, 2003) "Thomas Jech’s Set Theory contains the most comprehensive treatment of the subject in any one volume. The present third edition is a revised and expanded version … . The third edition has three parts. The first, Jech says, every student of set theory should learn, the second every set theorist should master and the third consists of various results reflecting ‘the state of the art of set theory at the turn of the new millennium’. This last part especially contains a lot of new material." (Martin Bunder, The Australian Mathematical Society Gazette, Vol. 30 (2), 2003)Table of ContentsBasic Set Theory.- Axioms of Set Theory.- Ordinal Numbers.- Cardinal Numbers.- Real Numbers.- The Axiom of Choice and Cardinal Arithmetic.- The Axiom of Regularity.- Filters, Ultrafilters and Boolean Algebras.- Stationary Sets.- Combinatorial Set Theory.- Measurable Cardinals.- Borel and Analytic Sets.- Models of Set Theory.- Advanced Set Theory.- Constructible Sets.- Forcing.- Applications of Forcing.- Iterated Forcing and Martin’s Axiom.- Large Cardinals.- Large Cardinals and L.- Iterated Ultrapowers and L[U].- Very Large Cardinals.- Large Cardinals and Forcing.- Saturated Ideals.- The Nonstationary Ideal.- The Singular Cardinal Problem.- Descriptive Set Theory.- The Real Line.- Selected Topics.- Combinatorial Principles in L.- More Applications of Forcing.- More Combinatorial Set Theory.- Complete Boolean Algebras.- Proper Forcing.- More Descriptive Set Theory.- Determinacy.- Supercompact Cardinals and the Real Line.- Inner Models for Large Cardinals.- Forcing and Large Cardinals.- Martin’s Maximum.- More on Stationary Sets.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the First International Conference on Fundamental Approaches to Software Engineering, FASE'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, held in Lisbon, Portugal, in March/April 1998.Besides two invited presentations and three system demonstrations, this volume presents 18 revised full papers selected from a total of 59 submissions. Among the various fundamental software engineering issues addressed are formal methods, specification languages, refinement, object-oriented modeling, software architectures, statecharts, model checking, etc.Table of ContentsExtreme programming: A humanistic discipline of software development.- Some mistakes I have and what I have learned from them.- Specifying and analyzing dynamic software architectures.- Observational proofs with critical contexts.- Integrating AORTA with model-based data specification languages.- Specifying safety-critical embedded systems with statecharts and Z: A case study.- Specifying embedded systems with statecharts and Z: An agenda for cyclic software components.- Algebra transformation systems and their composition.- Navigation expressions in object-oriented modelling.- Compositional verification of reactive systems specified by graph transformation.- Reflections on the design of a specification language.- Constructs, concepts and criteria for reuse in concurrent object-oriented languages.- Backtracking-free design planning by automatic synthesis in metaframe.- Model-checking CSP-Z.- Rule-based refinement of high-level nets preserving safety properties.- Automated formal analysis of networks: FDR models of arbitrary topologies and flow-control mechanisms.- Behaviour analysis and safety conditions: A case study in CML.- Distributed safety controllers for web services.- A refinement calculus for statecharts.- Refining formal specifications of human computer interaction by graph rewrite rules.- RELVIEW — A system for calculating with relations and relational programming.- ALBERT: A formal language and its supporting tools for requirements engineering.- Moby/plc — A design tool for hierarchical real-time automata.

Read more less

Book SynopsisWritten with graduate and advanced undergraduate students in mind, this textbook introduces computational logic from the foundations of first-order logic to state-of-the-art decision procedures for arithmetic, data structures, and combination theories. The textbook also presents a logical approach to engineering correct software. Verification exercises are given to develop the reader's facility in specifying and verifying software using logic. The treatment of verification concludes with an introduction to the static analysis of software, an important component of modern verification systems. The final chapter outlines courses of further study.Trade Review"...this book, which addresses the verification of sequential programs, exhibits all the features of a field that has finally fully matured. The material is substantial; it is organized very thoughtfully; the writing is concise but simple, easy to follow, and illustrated with ample examples... Overall, this book is very well written, thoughtfully constructed, and substantive yet accessible. It is bound to become a standard textbook in program verification." (Fatma Mill, ACM Computing Reviews, August 2008)Table of ContentsFoundations.- Propositional Logic.- First-Order Logic.- First-Order Theories.- Induction.- Program Correctness: Mechanics.- Program Correctness: Strategies.- Algorithmic Reasoning.- Quantified Linear Arithmetic.- Quantifier-Free Linear Arithmetic.- Quantifier-Free Equality and Data Structures.- Combining Decision Procedures.- Arrays.- Invariant Generation.- Further Reading.

Read more less

Book SynopsisKonrad Zuse is one of the great pioneers of the computer age. He created thefirst fully automated, program controlled, freely programmable computer using binary floating-point calculation. It was operational in 1941. He built his first machines in Berlin during the Second World War, with bombs falling all around, and after the war he built up a company that was taken over by Siemens in 1967. Zuse was an inventor in the traditional style, full of phantastic ideas, but also gifted with a powerful analytical mind. Single-handedly, he developed one of the first programming languages, the Plan Calculus, including features copied only decades later in other languages. He wrote numerousbooks and articles and won many honors and awards. This is his autobiography, written in an engagingly lively and pleasant style, full of anecdotes, reminiscences, and philosophical asides. It traces his life from his childhood in East Prussia, through tense wartime experiences and hard times building up his business after the war, to a ripe old age andwell-earned celebrity.Trade ReviewFrom the reviews:“The book tells the story of an inventor and an entrepreneur. It is refreshing because it allows one to see things outside of the box, beyond the more traditional story, so that he or she can better appreciate key aspects of computing and computation. Furthermore, the book tells the story of a father, a hard worker, and a recognized inventor, including pictures and plenty of anecdotes. … The book is probably the only reliable source about Konrad Zuse’s life and contributions to the world.” (Hector Zenil, ACM Computing Reviews, November, 2011)Table of Contents1 Ancestors and parents — Early childhood memories — School days — Metropolis — Abitur.- 2 Studies (not without detours and by-ways) and general studies — First inventions — The Akademischer Verein Motiv — Student life between science and politics.- 3 The early years of the computer (and a digression on its prehistory) — Colleagues remember — From mechanics to electromechanics — Schreyer’s electronic computing machine — First outside contacts — Thoughts on the future.- 4 Outbreak of the war and (first) call-up — Structural engineer in aircraft construction — The Z2 and Z3 — Second call-up — Zuse Ingenieurbüro und Apparatebau, Berlin — The first process computer.- 5 Origins of the Z4 — News from the United States — Attempt at a Ph.D. dissertation — Computing machine for logic operations — Final months of the war in Berlin — The evacuation — Z4 completed in Göttingen — Final war days in the Allgäu.- 6 End of the war — Refugees in Hinterstein — The Plankalkül — The computing universe — Automation and self-reproducing systems — A logarithmic computing machine — Computer development in Germany and the United States — Move to Hopferau near Füssen — The mill of the Patent Office.- 7 The Zuse-Ingenieurbüro, Hopferau bei Füssen — First business partners: IBM and Remington Rand — The first pipelining design — Founding of ZUSE KG in Neukirchen — The Z4 in the ETH in Zurich — The computer in Europe: taking stock — Lost opportunities — The first German contract: the Z5.- 8 The partners leave — Computing machine for land use zoning — Electronics gains acceptance — First funds from the Deutsche Forschungsgemeinschaft — Losing one’s way (and possibly a lost opportunity) — The array processor — Custom work for geodesists — The Graphomat Z64 — Growth and crisis of ZUSE KG — The end.- 9 Free for science (again) — Honors — A look to the future.- Appendices.- 1. From Forms to Program Control.- 2. Construction of Devices.- 3. On Computer Architecture.- 4. On the Plan Calculus.- 5. Lecture on the Occasion of the Award of the Honorary Doctorate by the Technical University of Berlin (Extract).- 6. The Computer Did Not Fall from Heaven.- Notes.- References.- Name Index.- Computer Index.

Read more less

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 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 is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects. The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.Trade ReviewFrom the reviews:“Concurrent programming is the study of the methods which will ensure correct interactions. … Raynal (Univ. of Rennes, France) presents these classical techniques at the beginning of his book, and then moves on to cover such topics as transactional memory and current areas of research like consensus in the face of crash failures. The coverage is very up-to-date, including references through 2010. … This would be an ideal text for a beginning graduate course. Summing Up: Highly recommended. Graduate students, researchers/faculty, and professionals/practitioners.” (P. Cull, Choice, Vol. 50 (11), August, 2013)“A very comprehensive treatment of both fundamentals and recent results in concurrent programming is presented in this book. … The book is well structured, with many examples to help the reader. Each chapter starts with a short presentation of the content and a list of keywords, and concludes with a summary of the main points and results. … I can recommend this book … .” (Sergei Gorlatch, Computing Reviews, June, 2013)Table of ContentsPart I - Lock-Based Synchronization.- Chap. 1 - The Mutual Exclusion Problem.- Chap. 2 - Solving Mutual Exclusion.- Chap. 3 - Lock-Based Concurrent Objects.- Part II - On the Foundations Side: The Atomicity Concept.- Chap. 4 - Atomicity: Formal Definition and Properties.- Part III - Mutex-Free Synchronization.- Chap. 5 - Mutex-Free Concurrent Objects.- Chap. 6 - Hybrid Concurrent Objects.- Chap. 7 - Wait-Free Objects from Read/Write Registers Only.- Chap. 8 - Snapshot Objects from Read/Write Registers Only.- Chap. 9 - Renaming Objects from Read/Write Registers Only.- Part IV - The Transactional Memory Approach.- Chap. 10 - Transactional Memory.- Part V - On the Foundations Side: From Safe Bits to Atomic Registers.- Chap. 11 - Safe, Regular and Atomic Read/Write Registers.- Chap. 12 - From Safe Bits to Atomic Bits: A Lower Bound and an Optimal Construction.- Chap. 13 - Bounded Constructions of Atomic b-Valued Registers.- Part VI - On the Foundations Side: The Computability Power of Concurrent Objects (Consensus).- Chap. 14 - Universality of Consensus.- Chap. 15 - The Case of Unreliable Base Objects.- Chap. 16 - Consensus Numbers and the Consensus Hierarchy.- Chap. 17 - The Alphas and Omega of Consensus: Failure Detector-Based Consensus.- Afterword.- Bibliography.- Index.

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 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

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 SynopsisScheduling theory has received a growing interest since its origins in the second half of the 20th century. Developed initially for the study of scheduling problems with a single objective, the theory has been recently extended to problems involving multiple criteria. However, this extension has still left a gap between the classical multi-criteria approaches and some real-life problems in which not all jobs contribute to the evaluation of each criterion.In this book, we close this gap by presenting and developing multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. Several scenarios are introduced, depending on the definition and the intersection structure of the job subsets. Complexity results, approximation schemes, heuristics and exact algorithms are discussed for single-machine and parallel-machine scheduling environments. Definitions and algorithms are illustrated with the help of examples and figures.Trade Review“It is very readable and precisely written. The major results are proved and 43 algorithmic descriptions are provided. The book contains also several numerical examples to illustrate the presented solution approaches. The book is recommended not only for researchers and practitioners working in scheduling, but also for graduate students since only basic knowledge in discrete mathematics, complexity theory, algorithms, and programming languages is required.” (Frank Werner, Mathematical Reviews, May, 2017)Table of Contents1. Multiagent Scheduling Fundamentals.- 2. Problems, Algorithms and Complexity.- 3. Single Machine Problems.- 4. Batching Scheduling Problems.- 5. Parallel Machine Scheduling Problems.- 6. Scheduling Problems with Variable Job Processing Times.- References.

Read more less

Book SynopsisMathematische Notation digitaler Bilder.- Skalar- und Matrixoperationen, Histogrammmanipulation.- Stochastisches Bildrauschen und Filter.- Filter zum Entrauschen und Kantenerkennung.

Read more less

Book Synopsis.- Approximation Algorithms..- Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints..- Approximation Algorithms for the Maximum Connected Submodular Functions..- Approximating per-scenario bound for the two-stage stochastic facility location problem..- Bilevel adversarial scheduling problem on parallel machines..- A Randomized FPT Approximation Algorithm for Sorting Unsigned Genomes by Translocations: Breaking the 1.375 Approximation Barrier..- On Online Approximation Algorithms for Two-Stage Bins..- An Improved Approximation Algorithm for the Minimum k-Star Partition Problem..- Doubly Constrained Fair Clustering for General p-Norms..- Combinatorial Optimization.- Discrete Effort Distribution via Regret-Enabled Greedy Algorithm..- Improving Local Search for Weighted Partial MaxSAT by Initializing with Historical Information..- Regularized Submodular Maximization over Integer Lattice..- Adaptive Weighting-based Local Search for Route Number Minimization for Vehicle Routing Problem with Time Windows..- Computational Complexity..- Hunting a rabbit is hard..- A Nearly-4 log n Depth Lower Bound for Formulas With Restriction on Top..- Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight..- Optimal Framework for Clustering with Noisy Queries..- Computational Geometry..- Minimum-Membership Geometric Dominating Set: Complexity and Algorithms..- New Lower Bound and Algorithm for Online Geometric Hitting Set Problem..- Erd?os-Szekeres Maker-Breaker Games..- Minimum Membership Geometric Set Cover in the Continuous Setting..- Economics and Computation..- On the Distortion of Multi-winner Election Using Single-Candidate Ballots..- Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities..- Equivalence of Connected and Peak-Pit Maximal Condorcet Domains..- On the Oscillations in Cournot Games with Best Response Strategies..- Simultaneous All-Pay Auctions with Budget Constraints..- Online Budget Allocation Maximization Problem on Two Uniform Machines with a Common Due Date.

Read more less

Book Synopsis.- Graph Algorithms and Graph Theory..- On the Complexity of 2-Club Cluster Editing with Vertex Splitting..- A sufficient condition for the existence of two completely independent spanning trees..- Undecidability of polynomial inequalities in subset densities and additive energies..- Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints..- Sum-of-Max Chain Partition of a Tree..- Reconfiguring Multiple Connected Components with Size Multiset Constraints..- Fault diagnosability evaluation of BCCC data center networks..- Testing Some First-Order Logic Properties on Sparse Graphs..- Massively Parallel Approximate Steiner Tree Algorithms..- A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem..- Vertex-Critical (P5, W4)-Free Graphs..- Learning and Data-Related Theory..- A Dynamic Working Set Method for Compressed Sensing..- Data Debugging is NP-hard for Classifiers Trained with SGD..- Coresets for k-Median of Lines with Group Fairness Constraints..- Redefining Entity Integration: Theoretical Insights for GNN-based Recommender Systems..- Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits..- A Robust Distributed Minimax Learning Method against Model Poisoning Attacks..- Parameterized Algorithms..- Parameterized Complexity of Influence Maximization..- Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows..- Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be?..- An FPT Factor-11 Approximation Algorithm for TSP..- From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems..- String Algorithms and Discrete Structures..- Revisit the Partial Coloring Method: Prefix Spencer and Sampling..- A Sparse Dynamic Programming Algorithm for Solving the Coding Sequence Design Problem..- Improved Approximation Algorithm and Hardness Result for Sorting Unsigned Strings by Symmetric Reversals..- Longest Double-Bounded (k]-tuple Common Substrings..- Finding cycle types in permutation groups with few generators..- Counting overlapping pairs of words.

Read more less

Book Synopsis.- AI Logic Foundation..- Game Semantics for Modal Logic with Counting..- Adding concurrency to Quantum Dynamic Logic..- Lattices for Many-logics Modal Logic: constructions and representations..- A note to the construction of t-norms based on T nM..- Conditional Distributivity of S-uninorms and T-uninorms over Uninorms..- Fuzzy Integrals Induced From Semi-Quasi-Overlap (Grouping) Functions..- The Research on the multi-agent argumentation Semantics..- An exercise in Uppaal: Modelling the circadian clock of a cyanobacteria..- AI Logic Reasoning..- Semi-Quasi-Overlap Functions and Their Applications in Classifier Ensemble..- Data and Knowledge Dual-Driven Traffic Sign Recognition Algorithm..- Automatic Inspection of Static Application Security Testing (SAST) Reports via Large Language Model Reasoning..- Semantic Abstractions for Multi-label Classification..- Multi-granularity Semantic Representation and Rule-based Labeling for Relation Classification..- AI Logic Applications..- Feature Representation Learning based on Graph Curvature-revised Deep Graph Learning..- Non-negative Tensor Representation and Unsupervised Classification of Object Pose in Continuous Image Sequences..- An Optimal Scheduling Algorithm for Intelligent Embedded Heterogeneous Multicore System..- Kernel Cutset-type Possibility C-Means Algorithm for Gaussian Granularity. .- Research on Fusion Modeling for Active Magnetic Bearings Based on Mechanism and Data Driven..- Multi-Objective Waterborne Trash Tracking based on D-StrongSORT..- A Contributor-Based Segmentation Model for Open Source Software Source Code Trustworthiness Measurement..- Facilitating the Propagation of Oscillatory Signals in Cortical Networks through Mixed Resonance..- An Empirical Study for Source Code Incompatibility Between Versions of Java Open-Source Software..- Exploring Multi-source Mobile Applications Association Discovery Based on Representation Learning..- TakagiSugeno Target Recognition Algorithm Based on Global Intuitionistic Fuzzy Method..- Automated Legality Detection on Privacy Policy Based on Deep Learning..- CNN lung sound recognition and classification model based on multi-feature fusion and data enhancement..- The Specialization of AGI: Exploration of Industrial Applications for General Artificial Intelligence.

Read more less

Book Synopsis.- Can the 1.375 approximation ratio of unsigned genomes distances be improved?..- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths..- On Extensions of Min-k-Union..- Sublinear Algorithms for Scheduling with Chain Precedence Constraints..- Bicriteria approximation algorithms for the unit disk coverage problem..- Private Neural Network Training with Packed Secret Sharing..- k-Balanced Biclique Partition on Signed Bipartite Graphs..- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions..- On Sorting Signed Permutations by Flanked DCJs..- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two..- Relations between monotone complexity measures based on decision tree complexity..- Minimum sum vertex cover: kernelization and parameterized algorithms..- Facility location game for maximizing the social satisfaction on a line..- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line..- MPMD on Two Sources with Lookahead..- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling..- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design..- 1.6-approximation algorithm for generalized traveling salesman path probem..- Assortment Planning with Sponsored Products..- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam..- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems..- The Complexity of Distance-$r$ Dominating Set Reconfiguration..- A characterization of uniquely representable two-directional orthogonal ray graphs..- The complexity of strong confl?ict-free vertex-connection k-colorability..- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset..- Bipartite domination in outerplanar graphs..- Robust Matroid Bandit Optimization against Adversarial Contamination..- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism..- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging..- Maximin Share Allocation under Knapsack Constraint..- On the Minimum Edge Bisection of Graph..- Random Schreier graphs as expanders..- Direct Sum Theorems From Fortification..- On Sorting by Unsigned Symmetric Reversals..- Some Results on Critical ($P_5,H$)-free Graphs..- Single machine lot scheduling to minimize maximum weighted completion time..- A Quadratic Vertex Kernel for Diamond-free Edge Deletion..- Graph convexity partizan games..- Almost optimum $ell$-covering of $mathbb{Z}_n$..- The Communication Complexity of Distributed Maximization..- Approximately Covering Vertices by Order-5 or Longer Paths..- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering..- A Little Aggression Goes a Long Way..- Monotone Properties of Uncertain Graphs.

Read more less

Book Synopsis.- Algorithm Design..- EFX Graph Division with (Weakly) Lexicographic Preferences..- Online bottleneck matching on a ring..- learn to design greedy algorithm for NP-complete problems using neural networks..- Approximation Algorithm..- Approximation Algorithms on Linear Equalities and Inequalities mod..- Online clustering on the line with ?-th power cost variable sized clustering..- 1-line minimum ?-Steiner tree problem..- Logic..- Generalized Possibilistic CTL* Model Check with Fuzzy Temporal Logic Operators..- Medical procedures based on bayesian network and possibilistic model checking..- Artificial Intelligence Theory and Algorithm..- A Triple-Branch Frequency-Aware Network for Image Manipulation Detection..- Advances in Neural Radiance Fields for Large-Scale 3D Scene Reconstruction: A Comprehensive Review..- Chinese Medical Spoken Language Understanding Based on Prototypical Modification Network and Contrastive Learning..- Algorithm Application..- Hierarchical Feature Selection Method based on Sequential Backward Selection Algorithm for Fasting Blood Glucose Prediction..- Personalized Recommendation Algorithm Based on Knowledge Graphs with High-order Information.

Read more less

Book SynopsisSteDM: Efficient Image Steganography With Diffusion Models.- BDFC:A New Flow Control Mechanism for Torus Networks.- A Hybrid Vectorized Merge Sort on ARM NEON.- An Encoder-based Framework for Privacy-preserving Machine Learning.- Load Balancing Optimizations for Distributed GMRES Algorithm.- ZKCross: An Efficient and Reliable Cross-chain Authentication Scheme Based on Lightweight Attribute-based Zero-knowledge Proof.- LSSM-SpMM: A Long-Row Splitting and Short-Row Merging Approach for Parallel SpMM on PEZY-SC3s.- A Model Inference Attack based on Random Sampling in DLaaS.- Defense Against Textual Backdoors via Elastic Weighted Consolidation-based Machine Unlearning.- Cross-Chain Transaction Auditing with Truth Discovery.- Exploring the Vulnerability of ECG-based Authentication Systems through A Dictionary Attack Approach.-LBVP: Lightweight Blockchain-based Vehicle Platooning Scheme for Secure and Efficient Platoon Management.- Low-Carbon Geographically Distributed Cloud-Edge Task Scheduling.- Integrating Blockchain, Smart Contracts, NFTs, and IPFS for Enhanced Transparency and Ethical Sourcing in Coffee and Cocoa Supply Chains.- The Role of Artificial Intelligence Technologies in Sustainable Urban Development: A Systematic Survey.- Enhancing Privacy in Machine Unlearning: Posterior Perturbation against Membership Inference Attack.- PEbfs: Implement High-performance Breadth-first Search on PEZY-SC3s.- Textual Data De-privatization Scheme Based on Generative Adversarial Networks.-Modeling and Simulation Verification of Operating Mode Switching of Train Control System Based on Train-to-Train Communication.- Performance Evaluation of NLP Models for European Portuguese: Multi-GPU/Multi-Node Configurations and Optimization Techniques.- FusionFrame: A Fusion Dataflow Scheduling Framework for DNN Accelerators via Analytical Modeling.

Read more less

Book SynopsisIntroduction: by Trang Phan (Vietnam National University Hanoi), Nguyen Tuan Cuong (Associate Professor, Vietnam Academy of Social Sciences) & Masaaki Shimizu (Professor, Osaka University).- Etymological study of Vietnamese words for textiles and clothing by Mark Alves (Montgomery College).- The rise of negative markers: the case of Sino-Vietnamese 'không' and beyond by Trang Phan (Vietnam National University Hanoi), Nguyen Tuan Cuong (Vietnam Academy of Social Sciences) & Masaaki Shimizu (Osaka University).- On the development of particle 'chu?ng' as a merger of object pronomial and relative pronomial functions: Evidence from the Cô? Châu Pháp Vân Ph?^t ba?n hành ngu~ lu?c by John Phan (Columbia University).- Initial Consonants Comparison of Tay and Nung in Trang Dinh district from the diachronic perspective by Hirana Ayaka (Osaka University).- Reflections ofVoiced Initials in Tay Manuscripts from Cao Bang Province by David Holm (National Chengchi University).- Possibility modals in Chinese and the morpho-syntax of their complements: a view from First Phase Syntax by Barbara Meisterernst (National Tsing Hua University).- The multifunctionality of gwo in Cantonese: A synchronic and diachronic study by Carine Yuk-man Yiu (The Hong Kong University of Science and Technology).- Deriving Syntactic Variation of Old Chinese and Contemporary Chinese from the Bidirectional Growth Model of Child Language Acquisition by Mengmeng Yang and Jianhua Hu (Institute of Linguistics, Chinese Academy of Social Sciences).- Proto-Austronesian Interrogative Pronouns and Their Development by Edith Aldridge (Academia Sinica, Taiwan).- Why do you give/put something when you say you take it? by Yoshihisa Taguchi (Chiba University).

Read more less

Book SynopsisChapter 1 Introduction.- Chapter 2 Graphs and Computational Complexity.- Chapter 3 Biocomputing -- Data.- Chapter 4 Biological Computing Operators -- Enzymes and Biochemical Operations.- Chapter 5 DNA Coding Theory and Algorithms.- Chapter 6 Enumerative DNA Computing Model.- Chapter 7 Non-enumerative DNA Computing Model for Graph Vertex Coloring.- Chapter 8 Parallel Vertex Coloring DNA Computing Model.- Chapter 9 Probe Machine.- Chapter 10 DNA Algorithmic Self-Assembly.- Chapter 11 RNA Computing.- Chapter 12 Protein Computing.

Read more less

Book Synopsis .- 25th International Conference on Parallel and Distributed Computing, Applications and Technologies..- Decentralized Federated Learning with Knowledge Distillation for Image Classification and Demand Forecasting in Industrial Chains..- Integrating Blockchain into Insurance Claim Management: Applications of NFTs, Smart Contracts and IPFS..- A Meta-Reinforcement Learning Framework for Adaptive Quadrotor UAV Attitude Control..- Securing Energy Transactions for Electric Vehicles: The Blockchain Approach and Encrypted NFTs..- Optimizing Task Allocation in Heterogeneous Agent Manufacturing Systems..- MPG: Multi-Modal Personal Health Graph for Alzheimer’s Disease Diagnosis..- SMAC: A secure multi-authority access control scheme with attribute unifi cation for Fog enabled IoT in e-health..- Convolutional Neural Networks Parameter Training for SCM Algorithm based on Hausdorff Difference..- Handling Non-stationarity with Distribution Shifts and Data Dependency in Time Series Forecasting..- The two-stage stochastic facility location game..- Regularized non-monotone $gamma$-weakly submodular maximization..- Fed-MoE: Efficient Federated Learning for Mixture-of-Experts Models via Empirical Pruning..- WaitIO-Hybrid: Communication for Coupling MPI Programs among Heterogeneous Systems..- The Material Delivery Route Prediction Method Based on Deep Reinforcement Learning..- Privacy-Preserving in Medical Image Analysis: A Review of Methods and Applications..- Research on Task Migration Problem Based on Link Uncertainty in Adver sarial Scenarios..- Optimizing Production Component Scheduling In Multivariate Industrial Networks With Dynamic Changes In Production Costs..- Multi-Agent Collaboration for Time-Sensitive Tasks in Multiple Networked Adversarial Scenarios..- Containerized Data-Flow Processing for Scalable Real-Time Analytics on Edge Devices..- Fast Approximation for Scheduling Malleable Jobs on Parallel Batch Machines with Rejection..- Real-Time and In-Situ Temperature Profiling for Determining Detonation of White Dwarf Mergers..- accparser: A Standalone OpenACC Parser and its Usage on Mapping Ope nACC to OpenMP Directives..- Out-of-Memory GPU Sorting using Asynchronous CUDA Streams..- Long-Term and Periodicity-Aware Spatio-Temporal Model for Traffic Flow Prediction..- A new approximation algorithm for two-machine flow shop with transporter coordinate..- Enhancing Federated Learning Robustness in Non-IID Data Environments via MMD-Based Distribution Alignment..- Multi-scale Time-frequency Representation for Multi-component Radar Signal Recognition..- An LP-based approximation algorithm for the fault-tolerant facility location problem with penalties..- A Q-Learning Driven Artificial Bee Colony Algorithm for Multi-Objective Multiplex Industrial Chain Networks Design with Multiple Supply Cycles..- Complete Bipartite Graph Division Under Weakly Lexicographic Preferences..- Multiagent Reinforcement Learning based on Structural Coordination..- Fair Division of Indivisible Chores with Weighted and Prioritized Agents..- An Efficient Incentive Mechanism for Collaborative Anomaly Detection in Internet of Things..- Advancing Evasion: Highly Effective Distributed Backdoor Attacks in Federated Learning..- DCAFNet: An Efficient Change Detection Structure for Remote Sensing Images..- Feature norms-aware and Hardness guided Complementary Entropy Balanced Loss for Long-tailed Image Classification..- Research on Two-stage Text Language Identification Algorithms for Chinese, Japanese, and Korean..- Improved XGBoost-MLP model and application to performance prediction..- STB-GraCapsNet: A Novel Capsule Network Structure with Swin Transformer Block..- NAAM: Enhancing Automatic Task Mapping Efficiency on NUMA Machines..- A Lightweight Garbage Classification Algorithm for Scenic Spots..- Soft capacitated two-stage stochastic facility location problem..- TSR: a Location Privacy Preservation Mechanism in Public Transportation Route Planning Service..- Parallel Acceleration of Transportation Problem Solving Using SpMV in the Industrial Chain Context..- Reinforcement Learning for Airline Multi-product Continuous Dynamic Pricing..- I/O Latency Management in Private Cloud Infrastructures..- UAV Swarm Collaborative Target Assignment Problem: A Deletion Robust Submodular Maximization Approach..- Streaming algorithm for balance gain and cost with Knapsack constraint on the integer lattice..- Decentralizing Energy Trading for Electric Vehicles using Blockchain Technology..- Leveraging Hardware Performance Counters for Predicting Workload Interference in Vector Supercomputers..- Intelligent Multi-agent Systems for UAV-Robot Path Optimization via Reflective Evolution.  .- The hub location and flow assignment problem in the high-speed railway and highway co-transportation network..- Predicting MPI communication for solving partial differential equations using Machine Learning..- A CNN_LSTM_KAN based genetic algorithm for photovoltaic power generation revenue prediction..- A Multiscale Global-Local Transformer for Long-Sequence PV power generation Forecasting.

Read more less

Book Synopsis.- An Optimization Strategy for Fresh Agricultural Product Supply Chain with Altruistic Preference under Blockchain Technology..- Approximation Algorithms for the Capacitated Min-Max and Minimum Graph Cover Problems..- A Simple Algorithm for Scheduling Unit Jobs with Unknown Number of Machines..- Faster Algorithms for Grid and Layered Drawings of Plane 3-Trees..- Reinforcement Learning for Airline Continuous Dynamic Pricing..- Approximation Algorithms for the Combination of Prize-Collecting Vertex Cover and Scheduling..- Randomized Mechanisms for Improved Approximation Ratios in Heterogeneous Two-facility Location..- Comprehensive Multi-view Subspace Clustering with Global-and-Local Representation Learning..- On the Twin-width of Outerplanar Graphs..- Maximize an approximate $k$-submodular function under a knapsack constraint..- A Short Proof and Experimental Study of the Approximation Algorithm for Label s-t Cut..- Risk-embedded Scheduling of a Virtual Power Plant with Electric Vehicle Parking Lot Considering Carbon Emission Trading..- On the constrained Steiner strong connectivity augmentation problem..- Competitive algorithms for online traveling salesman problem on a semi-line..- On the inapproximability of two-machine open shop scheduling with exact delays..- Minimum Power Partial Cover with Fairness Constraint..- Differentially Private Counting Queries on Approximate Shortest Paths..- Semi-online multiprocessor scheduling with known largest job processing time..- Acyclically edge color triangle-free toroidal graphs in $Delta + 2$ colors..- An Equally-Split Bin Packing Problem..- The location-routing problem in the pallet pooling system considering carbon emissions..- Scheduling Fully Parallel Jobs with Integer Units..- UAV Target Tracking with Bandit-Based Data Fusion..- Fair Maximization of Monotone Submodular Functions in Data Streams..- Tournament transitivity of graphs..- Approximation algorithm for min-max correlation clustering problem with penalties..- Improved Approximation Algorithm for Individual Fairness k-median..- The Price of Fairness for Budget-Feasible EF1 Allocations..- On the min-max heterogeneous weighted delivery problem..- Exact and Approximate Heuristics for the Multi-Modal Stable Matching with Applications in Industry Chains..- Budget feasible mechanism for a k-submodular function in the clock auction model..- Kernel for Proper Helly Circular-arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism..- Approximately Non-k-submodular Maximization under p-System and l Knapsack Constraints..- Alternating Lagrangian decomposition combining with branch and pricing for robust and integrated airline aircraft routing and crew pairing..- A Comparative Analysis of NFT-Based Insurance Claim Management Systems Across EVM-Compatible Blockchain Platforms..- Attaining Equilibria Using Control Sets..- Scheduling on parallel-batch machines with rejection and resource matching..- Some Combinatorial Algorithms on the Independent Number of k-Regular Connected Hyper graphs..- Approximation Algorithms on k-Correlation Clustering of Uniform Hypergraphs.

Read more less

Book SynopsisChapter 1 Roughness-Dice Similarity Measure Generalization for Rough Neutrosophic Set Application in Investment Selection Company.- Chapter 2 Mathematical Modelling of a Food Chain with Intraspecific Competition in the Middle Predator.- Chapter 3 The Application of Simplified Multi-Granular Linguistic Term Sets in Decision-Making Method for an Investment Company.- Chapter 4 Optimum Resource Allocation at Emergency Department's Yellow Zone using Simulation and Data Envelopment Analysis.- Chapter 5 Performance Efficiency of Paddy Granaries Production in Malaysia Using Bi-O MCDEA BCC Super Efficiency Model.- Chapter 6 A Hybrid Multicriteria Decision Making Model for Environmentally Sustainable Port.- Chapter 7 Spatial and Time Series Modeling for The Groundwater Level of Peatlands in Riau and Central Kalimantan, Indonesia.- Chapter 8 Singular Value Decomposition on Correspondence Analysis as Derivation of Principal Component Analysis.- Chapter 9 Stackelberg Equilibrium between Insured and Insurer in n-year Life Insurance.- chapter 10 Modelling and Forecasting Natural Rubber Price in Malaysia: Comparison between HES, ARIMA and ANN.- Chapter 11The Study of Cramer's V for Variables Association on Stainless Steels Corrosion Problem.- Chapter 12 Analysis of Hospital Occupancy for COVID-19 Patients using Erlang B Queueing System.- Chapter 13 Effect of Frequent Adjustments of Risky Assets on Portfolio Value of Unit-Linked Insurance.- Chapter 14 The Correspondence Analysis Between Types of Motor Vehicle Claims and Customer Locations: A Case Study on Sharia General Insurance in Indonesia.- Chapter 15 Autoregressive Integrated Moving Average (ARIMA) Model for Forecasting Malaysia Under-5 Mortality by State and Gender.- Chapter 16 Point Biserial Correlation Coefficient on Climate Variables and Dengue Cases using R Programming.- Chapter 17 Spatio-Temporal Patterns of Land Use Land Cover Change Associated with the Establishment of UiTM Cawangan Kelantan, Malaysia.- Chapter 18 Image Data Clustering Based on the Distribution Function.- Chapter 19 Optimizing Color Model Selection for Accurate Target Detection in Rail Anomaly.- Chapter 20  Cyberbullying Detection Using Data Mining and Sentiment Analysis: Repository Building in Bruneian Context.- Chapter 21 Real-Time Masked Facial Recognition with MobileNetV2and Transfer Learning.- Chapter 22 JUVDATA: Data Visualization of Juvenile Crime in Malaysia.- Chapter 23 MalAware: An Agile and OSEMN-Based Big Data Visualisation for Malware Detection.- Chapter 24 A Systematic Mapping of Data Visualization in Business Intelligence.

Read more less

Book SynopsisChapter 1 Concepts shared by net systems.- Chapter 2 The system hierarchy.- Chapter 3 EN-system.- Chapter 4 Place/Transition net systems.- Chapter 5 High level net systems: Pr/T-system.- Chapter 6 colour net systems.- Chapter 7 Self-control systems.- Chapter 9 Synchronizer.- hapter 10  Business process management (BPM).- Chapter 11 Synchrony.- Chapter 12 Net logic (Enlogy).- Chapter 13 Information flow structure.- Chapter 14 Net topology.- Chapter 15 Concurrency.

Read more less