Computer science Books
Springer International Publishing AG New Models for Population Protocols
Book SynopsisWireless sensor networks are about to be part of everyday life. Homes and workplaces capable of self-controlling and adapting air-conditioning for different temperature and humidity levels, sleepless forests ready to detect and react in case of a fire, vehicles able to avoid sudden obstacles or possibly able to self-organize routes to avoid congestion, and so on, will probably be commonplace in the very near future. Mobility plays a central role in such systems and so does passive mobility, that is, mobility of the network stemming from the environment itself. The population protocol model was an intellectual invention aiming to describe such systems in a minimalistic and analysis-friendly way. Having as a starting-point the inherent limitations but also the fundamental establishments of the population protocol model, we try in this monograph to present some realistic and practical enhancements that give birth to some new and surprisingly powerful (for these kind of systems) computational models. Table of Contents: Population Protocols / The Computational Power of Population Protocols / Enhancing the model / Mediated Population Protocols and Symmetry / Passively Mobile Machines that Use Restricted Space / Conclusions and Open Research Directions / Acronyms / Authors' BiographiesTable of ContentsPopulation Protocols.- The Computational Power of Population Protocols.- Enhancing the model.- Mediated Population Protocols and Symmetry.- Passively Mobile Machines that Use Restricted Space.- Conclusions and Open Research Directions.- Acronyms.- Authors' Biographies.
£26.99
Springer International Publishing AG The Theory of Timed I/O Automata, Second Edition
Book SynopsisThis monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, real-time operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability requirements, which make it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior. The TIOA framework also supports description and analysis of timed distributed algorithms -- distributed algorithms whose correctness and performance depend on the relative speeds of processors, accuracy of local clocks, or communication delay bounds. Such algorithms arise, for example, in traditional and wireless communications, networks of mobile devices, and shared-memory multiprocessors. The need to prove rigorous theoretical results about timed distributed algorithms makes it important to have a suitable mathematical foundation. An important feature of the TIOA framework is its support for decomposing timed system descriptions. In particular, the framework includes a notion of external behavior for a timed I/O automaton, which captures its discrete interactions with its environment. The framework also defines what it means for one TIOA to implement another, based on an inclusion relationship between their external behavior sets, and defines notions of simulations, which provide sufficient conditions for demonstrating implementation relationships. The framework includes a composition operation for TIOAs, which respects external behavior, and a notion of receptiveness, which implies that a TIOA does not block the passage of time. The TIOA framework also defines the notion of a property and what it means for a property to be a safety or a liveness property. It includes results that capture common proof methods for showing that automata satisfy properties. Table of Contents: Introduction / Mathematical Preliminaries / Describing Timed System Behavior / Timed Automata / Operations on Timed Automata / Properties for Timed Automata / Timed I/O Automata / Operations on Timed I/O Automata / Conclusions and Future WorkTable of ContentsIntroduction.- Mathematical Preliminaries.- Describing Timed System Behavior.- Timed Automata.- Operations on Timed Automata.- Properties for Timed Automata.- Timed I/O Automata.- Operations on Timed I/O Automata.- Conclusions and Future Work.
£25.19
Springer International Publishing AG Link Reversal Algorithms
Book SynopsisLink reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yet to be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / ConclusionTable of ContentsIntroduction.- Routing in a Graph: Correctness.- Routing in a Graph: Complexity.- Routing and Leader Election in a Distributed System.- Mutual Exclusion in a Distributed System.- Distributed Queueing.- Scheduling in a Graph.- Resource Allocation in a Distributed System.- Conclusion.
£25.19
Springer International Publishing AG Cooperative Task-Oriented Computing: Algorithms and Complexity
Book SynopsisCooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings / Bibliography / Authors' BiographiesTable of ContentsIntroduction.- Distributed Cooperation and Adversity.- Paradigms and Techniques.- Shared-Memory Algorithms.- Message-Passing Algorithms.- The Do-All Problem in Other Settings.- Bibliography.- Authors' Biographies.
£26.99
Springer International Publishing AG Distributed Graph Coloring: Fundamentals and Recent Developments
Book SynopsisThe focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible. A typical symmetry-breaking problem is the problem of graph coloring. Denote by ? the maximum degree of G. While coloring G with ? + 1 colors is trivial in the centralized setting, the problem becomes much more challenging in the distributed one. One can also compromise on the number of colors, if this allows for more efficient algorithms. Other typical symmetry-breaking problems are the problems of computing a maximal independent set (MIS) and a maximal matching (MM). The study of these problems dates back to the very early days of distributed computing. The founding fathers of distributed computing laid firm foundations for the area of distributed symmetry breaking already in the eighties. In particular, they showed that all these problems can be solved in randomized logarithmic time. Also, Linial showed that an O(?2)-coloring can be solved very efficiently deterministically. However, fundamental questions were left open for decades. In particular, it is not known if the MIS or the (? + 1)-coloring can be solved in deterministic polylogarithmic time. Moreover, until recently it was not known if in deterministic polylogarithmic time one can color a graph with significantly fewer than ?2 colors. Additionally, it was open (and still open to some extent) if one can have sublogarithmic randomized algorithms for the symmetry breaking problems. Recently, significant progress was achieved in the study of these questions. More efficient deterministic and randomized (? + 1)-coloring algorithms were achieved. Deterministic ?1 + o(1)-coloring algorithms with polylogarithmic running time were devised. Improved (and often sublogarithmic-time) randomized algorithms were devised. Drastically improved lower bounds were given. Wide families of graphs in which these problems are solvable much faster than on general graphs were identified. The objective of our monograph is to cover most of these developments, and as a result to provide a treatise on theoretical foundations of distributed symmetry breaking in the message-passing model. We hope that our monograph will stimulate further progress in this exciting area.Table of ContentsAcknowledgments.- Introduction.- Basics of Graph Theory.- Basic Distributed Graph Coloring Algorithns.- Lower Bounds.- Forest-Decomposition Algorithms and Applications.- Defective Coloring.- Arbdefective Coloring.- Edge-Coloring and Maximal Matching.- Network Decompositions.- Introduction to Distributed Randomized Algorithms.- Conclusion and Open Questions.- Bibliography.- Authors' Biographies.
£28.49
Springer International Publishing AG Distributed Computing by Oblivious Mobile Robots
Book SynopsisThe study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other DirectionsTable of ContentsIntroduction.- Computational Models.- Gathering and Convergence.- Pattern Formation.- Scatterings and Coverings.- Flocking.- Other Directions.
£31.49
Springer International Publishing AG Mathematical Surprises
Book SynopsisThis is open access book provides plenty of pleasant mathematical surprises. There are many fascinating results that do not appear in textbooks although they are accessible with a good knowledge of secondary-school mathematics. This book presents a selection of these topics including the mathematical formalization of origami, construction with straightedge and compass (and other instruments), the five- and six-color theorems, a taste of Ramsey theory and little-known theorems proved by induction. Among the most surprising theorems are the Mohr-Mascheroni theorem that a compass alone can perform all the classical constructions with straightedge and compass, and Steiner's theorem that a straightedge alone is sufficient provided that a single circle is given. The highlight of the book is a detailed presentation of Gauss's purely algebraic proof that a regular heptadecagon (a regular polygon with seventeen sides) can be constructed with straightedge and compass. Although the mathematics used in the book is elementary (Euclidean and analytic geometry, algebra, trigonometry), students in secondary schools and colleges, teachers, and other interested readers will relish the opportunity to confront the challenge of understanding these surprising theorems.Supplementary material to the book can be found at https://github.com/motib/suprises.Table of Contents- 1. The Collapsing Compass. - 2. Trisection of an Angle. - 3. Squaring the Circle. - 4. The Five-Color Theorem. - 5. How to Guard a Museum. - 6. Induction. - 7. Solving Quadratic Equations. - 8. Ramsey Theory. - 9. Langford’s Problem. - 10. The Axioms of Origami. - 11. Lill’s Method and the Beloch Fold. - 12. Geometric Constructions Using Origami. - 13. A Compass Is Sufficient. - 14. A Straightedge and One Circle is Sufficient. - 15. Are Triangles with Equal Areas and Perimeters Congruent?. - 16. Construction of a Regular Heptadecagon.
£31.49
Springer International Publishing AG Information, Communication and Computing Technology: 7th International Conference, ICICCT 2022, New Delhi, India, July 16, 2022, Revised Selected Papers
Book SynopsisThis book constitutes proceedings of the 7th International Conference on Information, Communication and Computing Technology, ICICCT 2022, held in New Delhi, India, in July 2022.The 11 papers presented in this volume were carefully reviewed and selected from 65 submissions. The papers cover a great variety of topics, such as wireless networks, deep learning, machine learning, neural networks, natural language processing, sentiment analysis, network security, image processing, image augmentation and others. The contributions are divided into the following thematic blocks: Networking and Communication; Evolutionary Computing through Machine Learning.Table of ContentsNetworking and Communication.- Energy Efficient Communication using Constrained Application Protocol for IoT Devices.- A Systematic Study on LoRa Communication in IoT: Implementation Challenges and Research Solutions.- A Low Complexity CFO Reduction Technique for LFDMA Systems.- DICCh-D: Detecting IPv6-based Covert Channels using DNN.- Evolutionary Computing through Machine Learning.- Image Caption Generation for Low Light Images.- A Study On Feature Selection For Gender Detection In Speech Processing For Assamese Language.- Bengali Fake News Detection: Transfer Learning Based Technique with Masked LM Process by BERT.- Crowd Counting Using Federated Learning And Domain Adaptation.- News Headline Generation using Abstractive Text Summarization.- Facial Based Age Estimation Among Dark Skinned Hominid Species.- Multi-class Classification of Leaves using Transfer Learning.
£49.49
Wiley-VCH Verlag GmbH Mein Jahr ohne Hosen: Überall auf der welt von zu hause aus arbeiten
Book SynopsisLernen Sie eine Arbeitswelt kennen, die Sie so vermutlich noch nicht erlebt haben! Scott Berkun leitete ein Jahr lang ein junges, innovatives Team bei WordPress. Was er dort erlebte, widersprach seinen bisherigen Erfahrungen völlig. Büroräume? Feste Arbeitszeiten? Klare Regeln? Meetings? Fehlanzeige! Ob im Homeo_ ce, im Café oder in der Hängematte, seine Kollegen konnten von überall auf der Welt virtuell zusammenarbeiten. Sie glauben, das geht nicht? Dass es funktioniert, zeigt MEIN JAHR OHNE HOSEN. Obwohl sich das Team manchmal monatelang nicht einmal auf demselben Kontinent aufhielt, war der Zusammenhalt so gut wie in wenigen Unternehmen. Dass WordPress die weltweit erfolgreichste Blogsoftware ist und un aufhörlich wächst, bestätigt außerdem dieses neue Konzept des Arbeitens. »Mein Jahr ohne Hosen ist eines der originellsten und wichtigsten Bücher, das je darüber geschrieben wurde, was Arbeit wirklich ist und was notwendig ist, um gute Arbeit zu leisten.« Robert Sutton, Professor an der Stanford University und Autor der New York Times Bestseller Der Arschloch-Faktor und Der Chef-Faktor »Wenn Sie Ihre Ansichten über Unternehmergeist, Management oder das Leben generell ändern wollen, dann lesen Sie dieses Buch.« Tim Ferriss, Autor des New York Times Bestsellers Die 4-Stunden-Woche Table of ContentsWas Sie wissen müssen 7 1 DasHotel Electra 9 2 Der erste Tag 15 3 Tickets am Caturday 27 4 Die Kultur gewinnt immer 37 5 Meetings werden getippt 51 6 Der Basar in der Kathedrale 65 7 Die große Ansprache 77 8 Die Zukunft der Arbeit, Teil 1 87 9 Teambildung 97 10 Wie man ein Feuer entzündet 111 11 Echte Künstler liefern 123 12 Fundbüro Athen 137 13 Double Down 149 14 Es kann nur einen geben 159 15 Die Zukunft der Arbeit, Teil 2 171 16 Innovation und Reibung 185 17 Die intensive Auseinandersetzung 191 18 Folge der Sonne 197 19 Der Aufstieg von Jetpack 201 20 Zeig mir das Geld 213 21 Portland und das Kollektiv 223 22 Das Amt für Sozialisation 239 23 Abgang über Hawaii 253 24 Die Zukunft der Arbeit, Teil 3 261 Epilog: Wo sind sie jetzt? 265 Anmerkungen 267 Literaturhinweise 271 Über den Autor 273 Danksagungen 275 Stichwortverzeichnis 277 Bildnachweise 285 Stimmen zu Mein Jahr ohne Hosen 286
£999.99
PHI Learning Fundamentals of Mobile Computing
£15.38
Springer Verlag Data mining: Metodi e strategie
Book SynopsisIl libro nasce dall’esigenza di coniugare esperienze e capacità procedurali diverse provenienti da vari ambiti disciplinari, quali l’informatica e la statistica, al fine di ricercare ed individuare percorsi e relazioni legate alla conoscenza. In un contesto di business, la conoscenza scoperta può avere un valore strategico per le aziende perchè consente di aumentare i profitti, riducendo i costi oppure aumentando le entrate con il conseguente aumento del ROI. Il volume è rivolto sia a studenti universitari e ricercatori, che a professionisti e manager aziendali che vogliano approfondire gli aspetti algoritmici delle tecniche di Data mining: lo studio degli algoritmi e delle principali tecniche è essenziale per conoscere meglio come la tecnologia possa essere applicata ai diversi tipi di dati e quindi anche diverse problematiche di business. Il testo pone volutamente l’attenzione sugli aspetti procedurali e di calcolo della metodologia, differenziandosi dagli altri testi in italiano che inquadrano puramente il contesto statistico. Il materiale esposto può essere utile a quanti vogliano completare la loro formazione scientifica in questa disciplina. Trade ReviewFrom the reviews:“The aim of this book is to provide both researchers and students with an overview on the area … . the book is quite well written and most of the concepts are presented in a clear manner. Moreover, the sketches of the main algorithms, the examples spread throughout the book and the exercises proposed at the end of each chapter make the book a pleasant reading and a useful tool for students and for those interested in an overview of the data mining field.” (Luigi Palopoli, Zentralblatt MATH, Vol. 1170, 2009)Table of ContentsIntroduzione.- Trattamento preliminare dei dati.- Misure di distanza e di similarità.- Cluster Analysis.- Metodi di classificazione.- Serie Temporali.- Analisi delle associazioni.- Analisi dei link.
£999.99
Atlantis Press (Zeger Karssen) Real-World Reasoning: Toward Scalable, Uncertain Spatiotemporal, Contextual and Causal Inference
Book SynopsisThe general problem addressed in this book is a large and important one: how to usefully deal with huge storehouses of complex information about real-world situations. Every one of the major modes of interacting with such storehouses – querying, data mining, data analysis – is addressed by current technologies only in very limited and unsatisfactory ways. The impact of a solution to this problem would be huge and pervasive, as the domains of human pursuit to which such storehouses are acutely relevant is numerous and rapidly growing. Finally, we give a more detailed treatment of one potential solution with this class, based on our prior work with the Probabilistic Logic Networks (PLN) formalism. We show how PLN can be used to carry out realworld reasoning, by means of a number of practical examples of reasoning regarding human activities inreal-world situations.Table of ContentsIntroduction.- Knowledge Representation Using Formal Logic.- Quantifying and Managing Uncertainty.- Representing Temporal Knowledge.- Temporal Reasoning.- Representing and Reasoning On Spatial Knowledge.- Representing and Reasoning on Contextual Knowledge.- Causal Reasoning.- Extracting Logical Knowledge from Raw Data.- Scalable Spatiotemporal Logical Knowledge Storage.- Mining Patterns from Large Spatiotemporal Logical Knowledge Stores.- Probabilistic Logic Networks.- Temporal and Contextual Reasoning in PLN.- Inferring the Causes of Observed Changes.-Adaptive Inference Control.
£109.93
Nova Science Publishers, Inc. Harnessing AI for Drug Discovery Machine Learning Perspectives
£163.19
Nova Science Publishers, Inc. The Future of Machine Learning with Automation in Engineering
£163.19
Elsevier Science Heat Exchanger Design Guide
Table of Contents1.0 Heat exchanger design2.0 Calculation of the temperature differences LMTD and CMTD3.0 Calculation of the heat transfer coefficients and pressure losses in convective heat transfer4.0 Geometrical heat exchanger calculations5.0 Dimensionsless characterisation numbers for heat transfer6.0 Overall heat transfer coefficient and temperature profile of a heat exchanger7.0 Process engineering calculations8.0 Design of condensers9.0 Design of evaporators10.0 Design of thermosiphon evaporators11.0 Double tube-, plain tube- and cross-flow heat exchanger12.0 Finned-tube heat exchanger
£107.18
Clarendon Press TypeTheoretical Grammar 1 Indices
Book SynopsisBL First book to apply type theory to natural language Per Martin Lof first presented constructive type theory in 1970 and it has become intrinsic to the foundations of mathematics and computer science. This book is the first to take an in-depth look at the theory from the point of view of linguistics and the philosophy of language.Trade Review'The formalism introduced by the author allows better understanding of the role of semantics in grammars of natural languages and supplies mechnisms for various levels of linguistic description.' T.Balanescu, Zenrrallblatt fur Mathematik und ihre Grenzgebiete No. 855, 1997Table of Contents1. Preliminary remarks ; 2. Gradual introduction to type theory ; 3. Logical operators in English ; 4. Anaphoric expressions ; 5. Temporal reference ; 6. Text and discourse ; 7. Context and possible worlds ; 8. Higher-level type theory ; 9. Sugaring and parsing ; Appendix ; Sugaring in ALF ; Bibliography ; Index
£81.70
Oxford University Press (UK) The Philosophy of Information
Book SynopsisLuciano Floridi presents a book that will set the agenda for the philosophy of information. PI is the philosophical field concerned with (1) the critical investigation of the conceptual nature and basic principles of information, including its dynamics, utilisation, and sciences, and (2) the elaboration and application of information-theoretic and computational methodologies to philosophical problems. This book lays down, for the first time, the conceptual foundations for this new area of research. It does so systematically, by pursuing three goals. Its metatheoretical goal is to describe what the philosophy of information is, its problems, approaches, and methods. Its introductory goal is to help the reader to gain a better grasp of the complex and multifarious nature of the various concepts and phenomena related to information. Its analytic goal is to answer several key theoretical questions of great philosophical interest, arising from the investigation of semantic information.Trade ReviewThe impressive and exciting project that Floridi undertakes in his book is aimed at establishing the philosophy of information as a mature subdiscipline of philosophy, with its own method and research programme ... Floridi's book not only presents a comprehensive framework for the philosophy of information but also makes a strong case for its legitimacy as a mature subdiscipline of philosophy. The intellectual debates and new research that it has already stimulated testify to its importance as a significant contribution to the literature. * Hilmi Demir, Mind *the non-technical portions are understandable to everyone and provide plenty of food for thought. * Steven Harnad, Times Literary Supplement *This is a monumental work ... Floridi goes through much of contemporary philosophy, as seen through a lens fashioned from the concept of information ... The Philosophy of Information is a lovely source of ideas, and also a wonderful indication of how much there might be to gain for philosophy by looking at contemporary computer science. * Staffan Angere, Theoria *This is an ambitious book ... there is a great deal to admire in this book, including much to admire philosophically. For example, some of the material on epistemology, especially Ch. 13 but also some of his work on the definition of knowledge, is masterful ... this an intriguing, eye-opening work * Frederick Kroon, Journal of Applied Philosophy *Given the breadth and depth of coverage of all its topics, the careful organisation and structuring of concepts, and the relevance of its contents, The Philosophy of Information shall be deemed essential reading for philosophers and computer scientists alike, especially those interested in Artificial Intelligence. * Flavio Soares Correa da Silva, AISB Quarterly *Just around the beginning of the new millennium, Floridi began his important and influential program, and this book brings between two covers much of his previous work, and also augments, updates, and connects these publications ... Floridis book sets an ambitious agenda for the philosophy of information ... there is much of interest and value in this major book. * J. Michael Dunn, Metascience *The Philosophy of Information is clearly a work of great ambition, originality, and value. * Stephen Leach, Metapsychology *Very well written, and clearly presented. ... many authors have written about philosophy and information before, but no-one has set out to deal with it in such a thorough way. This is clearly a very important book, and I think it justifies the author's claim that it describes the first philosophical analysis of information in all its aspects. * David Bawden, Library and Information Research *Table of ContentsPreface ; 1. What is the Philosophy of Information? ; 2. Open Problems in the Philosophy of Information ; 3. The Method of Levels of Abstraction ; 4. Semantic Information and the Veridicality Thesis ; 5. Outline of a Theory of Strongly Semantic Information ; 6. The Symbol Grounding Problem ; 7. Action-Based Semantics ; 8. Semantic Information and the Correctness Theory of Truth ; 9. The Logical Unsolvability of the Gettier Problem ; 10. The Logic of Being Informed ; 11. Understanding Epistemic Relevance ; 12. Semantic Information and the Network Theory of Account ; 13. Consciousness, Agents and the Knowledge Game ; 14. Against Digital Ontology ; 15. A Defence of Informational Structural Realism ; References
£98.91
Springer New York A Practical Approach to Software Quality Contents Foundations Software Inspections and Testing ISO 90002000 capability maturity model SPICE model metrics and problem solving formal methods
Book SynopsisIt provides an enhanced knowledge of software inspections, metrics, process involvement, assessment of organization, problem solving, customer satisfaction surveys, the CMM, SPICE, and formal methods. In addition, readers will gain a detailed understanding of the principles of software quality management and software process improvement.Trade Review"Since software quality assurance is still an issue in software organizations, a deep understanding of the subject itself, as well as of methods for effectively implementing software quality, is crucial for both software managers and practitioners. Comprehensive books like this one can help readers to get into the field. However, O¿Regan¿s book is more than just an introduction. It also serves as a good reference for people who want to step into the subject practically, and for those who want to find out about the quality measures that could best fit their organizations...I recommend this book to those interested in learning how software quality helps increase software companies¿ productivity." --Computing ReviewsTable of Contents* Introduction to Software Quality * * Software Inspections and Testing * The ISO 9000 Standard * The Ccapability Maturity Model * The SPICE (15504) Standard * Metrics and Problem Solving * Formal Methods and Design * References * Glossary * Index
£44.99
Springer New York the Planiverse Computer Contact With A TwoDimensional World
Book SynopsisA classic book about life in a two-dimensional universe, written by a well-known author. Now brought back into print in this revised and updated edition, the book is written within the great tradition of Abbott's Flatland, and Hinton's famous Sphereland.Table of Contents1 Arde.- 2 A House by the Sea.- 3 On Fiddib Har.- 4 Walking to Is Felblt.- 5 City Below Ground.- 6 The Trek.- 7 The Punizlan Institute.- 8 Traveling on the Wind.- 9 High on Dahl Radam.- 10 Drabk the Sharak of Okbra.- 11 Higher Dimensions.- Ardean Science and Technology.- Acknowledgments.
£31.34
Elsevier Science Perturbation Theory for Matrix Equations
£163.00
Basic Books Signs Of Life How Complexity Pervades Biology
Book SynopsisSigns of Life applies the mathematics of order and disorder, of entropy, chance, and randomness, of chaos and nonlinear dynamics to the various mysteries of the living world at all levels. This book is an entirely new approach to understanding living systems and will help set the agenda for biology in the coming century.
£20.99
Cambridge University Press Computational Physics
Book SynopsisFirst published in 2007, this second edition was fully updated with several new sections and chapters. It covers many different computational methodologies and will interest graduate students and researchers in theoretical, computational and experimental physics with a background in elementary programming, numerical analysis, and field theory, condensed matter theory and statistical physics.Trade Review'The growing importance of computational physics to physics research as a whole will depend not only on increasingly powerful computers, but also on the continuing development of algorithms and numerical techniques for putting these machines to use. Furthermore, physics departments will need to augment their curricula to provide students with the skills needed to perform research using computers … In Computational Physics, [Jos] Thijssen has produced a book that is well suited to meeting these needs … This book makes it easier to approach a new topic and encourages the reader to consider a modular approach when writing programs.' Physics Today'… I find this book very useful since it provides a thorough discussion of the computational methods used in physics combined with an extensive presentation of the underlying physics … On the one hand an experienced researcher can easily transfer the obtained knowledge from this book to a particular research topic, while on the other hand a newcomer in the field will benefit from the presentation of the subject from first principles.' Lampros Nikolopoulos, Contemporary PhysicsTable of Contents1. Introduction; 2. Quantum scattering with a spherically symmetric potential; 3. The variational method for the Schrödinger equation; 4. The Hartree–Fock method; 5. Density functional theory; 6. Solving the Schrödinger equation in periodic solids; 7. Classical equilibrium statistical mechanics; 8. Molecular dynamics simulations; 9. Quantum molecular dynamics; 10. The Monte Carlo method; 11. Transfer matrix and diagonalisation of spin chains; 12. Quantum Monte Carlo methods; 13. The infinite element method for partial differential equations; 14. The lattice Boltzmann method for fluid dynamics; 15. Computational methods for lattice field theories; 16. High performance computing and parallelism; Appendix A. Numerical methods; Appendix B. Random number generators; References; Index.
£72.99
Cambridge University Press Interacting Electrons
Book SynopsisThis extensive textbook sets out modern methods of computing properties of materials for graduates and researchers who want to use and understand advanced tools. Including essential theoretical background, practical guidelines and instructive applications, as well as less technical topic overviews for beginners, this book illuminates the mathematics behind the methods.Table of ContentsPreface; Part I. Interacting Electrons: Beyond the Independent-Particle Picture: 1. The many electron problem: introduction; 2. Signatures of electron correlation; 3. Concepts and models for interacting electrons; Part II. Foundations of Theory for Many-Body Systems: 4. Mean fields and auxiliary systems; 5. Correlation functions; 6. Many-body wavefunctions; 7. Particles and quasi-particles; 8. Functionals in many-particle physics; Part III. Many-Body Green's Function Methods: 9. Many-body perturbation theory: expansion in the interaction; 10. Many-body perturbation theory via functional derivatives; 11. The RPA and the GW approximation for the self-energy; 12. GWA calculations in practice; 13. GWA calculations: illustrative results; 14. RPA and beyond: the Bethe-Salpeter equation; 15. Beyond the GW approximation; 16. Dynamical mean field theory; 17. Beyond the single-site approximation in DMFT; 18. Solvers for embedded systems; 19. Characteristic hamiltonians for solids with d and f states; 20. Examples of calculations for solids with d and f states; 21. Combining Green's functions approaches: an outlook; Part IV. Stochastic Methods: 22. Introduction to stochastic methods; 23. Variational Monte Carlo; 24. Projector quantum Monte Carlo; 25. Path integral Monte Carlo; 26. Concluding remarks; Part V. Appendices: A. Second quantization; B. Pictures; C. Green's functions: general properties; D. Matsubara formulation for Green's functions for T ̸= 0; E. Time-ordering, contours, and non-equilibrium; F. Hedin's equations in a basis; G. Unique solutions in Green's function theory; H. Properties of functionals; I. Auxiliary systems and constrained search; J. Derivation of the Luttinger theorem; K. Gutzwiller and Hubbard approaches; References; Index.
£72.99
Cambridge University Press Enjoying Music Book 3
Book SynopsisFormal systems in computer science frequently involve specifications of computations over syntactic structures. In this book, the authors develop a programming language based on a simply typed version of higher-order logic and show that it provides an elegant approach to performing computations over structures embodying binding.Trade Review'… I am impressed with the depth of the discussion and the clearly well-produced book. The authors have argued successfully for the power and versatility of the fundamental ideas underlying λProlog.' Sara Kalvala, Computing ReviewsTable of Contents1. First-order terms and representations of data; 2. First-order horn clauses; 3. First-order hereditary Harrop formulas; 4. Typed lambda terms and formulas; 5. Using quantification at higher-order types; 6. Mechanisms for structuring large programs; 7. Computations over λ-terms; 8. Unification of λ-terms; 9. Implementing proof systems; 10. Computations over functional programs; 11. Encoding a process calculus language; Appendix: the Teyjus system.
£49.23
Cambridge University Press Ab Initio Molecular Dynamics
Book SynopsisProviding the first coherent presentation of this rapidly growing field, this book covers a range of methods and their applications. Ideal for graduate students and researchers, it contains pseudo-code and program layout for typical plane wave electronic structure codes, allowing readers to improve and add new features in their code.Trade ReviewReview of the hardback: '… a student or newcomer to the field of molecular dynamics will find the approaches discussed in Ab Initio Molecular Dynamics a good place to start … [The book is] written clearly and informed by the state-of-the-art research experiences of the authors themselves. Reading it is a valuable experience akin to spending time in their research groups.' Physics TodayTable of ContentsPreface; 1. Setting the stage: why ab initio molecular dynamics?; Part I. Basic Techniques: 2. Getting started: unifying MD and electronic structure; 3. Implementation: using the plane wave basis set; 4. Atoms with plane waves: accurate pseudopotentials; Part II. Advanced Techniques: 5. Beyond standard ab initio molecular dynamics; 6. Beyond norm-conserving pseudopotentials; 7. Computing properties; 8. Parallel computing; Part III. Applications: 9. From materials to biomolecules; 10. Properties from ab initio simulations; 11. Outlook; Bibliography; Index.
£77.00
John C. Scott But How Do It Know
£14.96
Wiley Beginning Cryptography with Java
Book SynopsisBeginning Cryptography with Java While cryptography can still be a controversial topic in the programming community, Java has weathered that storm and provides a rich set of APIs that allow you, the developer, to effectively include cryptography in applications-if you know how. This book teaches you how.Table of ContentsAcknowledgments. Introduction. Chapter 1: The JCA and the JCE. Chapter 2: Symmetric Key Cryptography. Chapter 3: Message Digests, MACs, and HMACs. Chapter 4: Asymmetric Key Cryptography. Chapter 5: Object Description in Cryptography Using ASN.1. Chapter 6: Distinguished Names and Certificates. Chapter 7: Certificate Revocation and Path Validation. Chapter 8: Key and Certificate Management Using Keystores. Chapter 9: CMS and S/MIME. Chapter 10: SSL and TLS. Appendix A: Solutions to Exercises. Appendix B: Algorithms Provided by the Bouncy Castle Provider. Appendix C: Using the Bouncy Castle API for Elliptic Curve. Appendix D: Bibliography and Further Reading. Index.
£22.49
HarperCollins Publishers Accidental Empires How the Boys of Silicon Valley Make Their Millions Battling
£12.34
Random House Publishing Group The Principles of War for the Information Age
Book SynopsisThe crisis is upon us: We have no viable doctrine for tomorrow's wars. Now that the world has entered the information age, principles that have served to enlighten the art of war no longer work. Born of agrarian times and honed during the industrial age, the classical principles of war are, in large part, hopelessly outdated. Radical change is needed now. The Principles of War for the Information Age provides a prescription for this change.
£14.74
Kings College Publications An Introduction to Lambda Calculi for Computer Scientists
£14.56
Copperhill Media Corporation A Comprehensible Guide to Controller Area Network
£14.25
Educational Computing Services Ltd A Level Computer Science For AQA Unit 2
£45.27
Cambridge University Press Statistical Methods for Recommender Systems
Book SynopsisThis book is for researchers and students in statistics, data mining, computer science, machine learning, marketing and also practitioners who implement recommender systems. It provides an in-depth discussion of challenges encountered in deploying real-life large-scale systems and state-of-the-art solutions in personalization, explore/exploit, dimension reduction and multi-objective optimization.Trade Review'This book provides a comprehensive guide to state-of-the-art statistical techniques that are used to power recommender systems. … The text is authoritative and well written, with the authors drawing on their extensive experience of researching, implementing and evaluating real-world recommender systems. The book considers the underlying mathematics of the techniques it describes and, as such, is aimed at a readership with a strong background in statistics and cognate subjects. However, while readers without such a background are likely to find the mathematics somewhat challenging, the prose descriptions are highly readable and enable readers to understand the key principles and ideas which underpin the various approaches. This book should be of interest to those involved with recommender systems as well as to those with a broader interest in machine learning.' Patrick Hill, BCS: The Chartered Institute for IT (www.bcs.org)Table of ContentsPart I. Introduction: 1. Introduction; 2. Classical methods; 3. Explore/exploit for recommender problems; 4. Evaluation methods; Part II. Common Problem Settings: 5. Problem settings and system architecture; 6. Most-popular recommendation; 7. Personalization through feature-based regression; 8. Personalization through factor models; Part III. Advanced Topics: 9. Factorization through latent dirichlet allocation; 10. Context-dependent recommendation; 11. Multi-objective optimization.
£56.16
Cambridge University Press Generalized Vectorization CrossProducts and Matrix Calculus
Book SynopsisMatrix calculus is an efficient procedure for obtaining many derivatives at once, used in statistics and econometrics. This book studies different concepts of matrix derivatives and a particular brand of mathematics behind matrix calculus, including special matrices whose elements are all zero or one.Trade Review'A very neat treatment of matrix calculus. There is no doubt that the new operators and matrices presented in the book will see their applications in many areas of econometrics.' Yong Bao, Purdue University'This book is very clearly written in a text style that conveys what needs to be said with no superfluous discussion. It represents a substantial contribution to our understanding of a difficult area. It is a beautiful book, and destined to become a classic.' Ross Maller, Australian National UniversityTable of Contents1. Mathematical prerequisites; 2. Zero-one matrices; 3. Elimination and duplication matrices; 4. Matrix calculus; 5. New matrix calculus results; 6. Applications.
£47.26
Cambridge University Press Psychology of the Digital Age
Book SynopsisThis book provides an engaging overview of life in the digital realm that will benefit scholars, students, and general readers. A founder of the cyberpsychology field, John R. Suler offers insights for improving wellbeing online, highlighting principles about identity management, online relationships, social media, virtual reality, artificial intelligence, and media overload.Trade Review'Professor John R. Suler is acknowledged as the world's leading expert in cyberpsychology and the founder of the discipline … [His] treatment creates a powerful argument for the consideration of cyberpsychology as a unique and valuable discipline in its own right, and is groundbreaking in this regard … His transdisciplinary vision is reflective of the discipline itself, and therefore the content will likely resonate with those of us who are immersed in this subject and those who are interested in discovering it. John's elegant writing style, especially the narrative and historical aspects of the book, should delight anyone with an interest in technology and psychology while providing professors and students in all the fields that interface with the digital world a coherent and informed overview of cyberpsychology.' Mary Aiken, Director, Cyberpsychology Research Centre, from the Foreword'John Suler's long anticipated follow-up to his groundbreaking The Psychology of Cyberspace is finally here - and it's well worth the wait. Exploring what it means to be human in this digital age, Suler smartly captures the challenges facing us as we integrate and translate our analog lives - and even our relationships - into digital. This is thought-provoking reading, setting a new standard as the reference for exploring and understanding our complex, ever-evolving interactions with technology.' John M. Grohol, Founder and CEO, PsychCentral.com'In Psychology of the Digital Age, Suler profoundly reviews cyberpsychology and provides thoughtful understanding of emerging human nature in the context of innovative social technologies, while suggesting interesting psychodynamic views on contemporary psychology. In a creative way, [he] offers a unique and fresh look at the psychological dynamics of numerous behavioral and emotional phenomena characterizing digitally immersed individuals, virtual social environments, and psychological interventions enabled online.' Azy Barak, University of Haifa'John Suler is a pioneer in the rapidly evolving field of cyberpsychology. This book integrates his groundbreaking work over the past two decades. Psychology of the Digital Age explains the diverse nature of online environments and how we form identity and communicate via text and photographs, and the intimate power of online relationships. The book looks at online communication and shows us how our online experiences help us grow, learn, and self-actualize.' Dr Kimberly S. Young, Founder and Director, Center for Internet Addiction Recovery'… Psychology of the Digital Age is a comprehensive and subtle exploration of the various ways that online technology is disputing norms of interaction, behaviour and identity. Professor Suler has done an excellent job of setting out a clear framework for future discussion and exploration of these subjects in a way that will be beneficial and fascinating to both professionals and laypeople, and to whom it is highly recommended.' Gareth SouthwellTable of ContentsList of figures; Foreword; Preface; Acknowledgements; Introduction: newborns in evolution; 1. Cyberpsychology architecture; 2. Presence: be here now; 3. The dynamic digital psyche; 4. The disinhibited self; 5. Electrified relationships; 6. Other than you think: interpersonal perceptions; 7. Text talk; 8. Image talk; 9. I, avatar; 10. One of us: groups and communities; 11. Change and excess; 12. Addicted or devoted; 13. The digital deviant; 14. Synthesized realities and synthesized beings; 15. Electric therapeutics; Conclusion: research and the researcher; References; Index.
£43.30
Bloomsbury Publishing (UK) Project Research in Information Systems A Students Guide
Book SynopsisTONY CORNFORD and STEVE SMITHSON are both Senior Lecturers in Information Systems at the London School of Economics and Political Science and have been involved in hundreds of student projects.
£59.99
How to Think Like A Programmer
Book SynopsisHow to Think Like a Programmer is a bright, accessible, fun read describing the mindset and mental methods of programmers. Anticipating the problems that students have through the character of Brian the Bewildered Wildebeest, the slower pace required for this approach is made interesting and engaging by hand-drawn sketches, frequent (paper-based) activities and the everyday tasks (e.g. coffee making) used as a basis of worked examples. How to Think Like a Programmer provides a fun and accessible way to learn the mental models needed to approach computational programmable problems.This edition is printed in black and white.Table of ContentsPART I THE REAL WORLD DOMAIN: PROBLEM SOLVING AND SYSTEMATIZING THE SOLUTION 1. Introduction: Starting to Think Like a Programmer 2. A Strategy for Solving Problems 3. Description Languages & Representations 4. Problems of Choices and Repeated Actions 5. Calculating and Keeping Track of Things 6. Extending our Vocabulary: Data & Control Abstractions 7. Object Orientation: Taking a Different View 8. Looking Forward to Program Design PART II THE COMPUTER DOMAIN: DATA, DATA STRUCTURES, AND PROGRAM DESIGN SOLUTIONS 9. Data Types For Computer Programs 10. Sub-Programming and Baking Cakes: Procedures and Functions 11. Streams and Files, Input and Output 12. Static Data Structures 13. Dynamic Data Structures 14. Object-Orientation Revisited 15. Getting it to Run in Processing: Putting your Programs into a Real Programming Language 16. Testing, Debugging, and Documentation
£50.99
Lulu Press Domain Driven Design Quickly
£16.88
AuthorHouse Its Not Too Late to Learn Computers
£14.84
Lulu.com Scrum and XP from the Trenches
£13.12
£9.95
Springer New York Reflexive Structures An Introduction to Computability Theory
Book Synopsis1 Functions and Predicates.- 1. Definitions.- 2. Numerical Functions.- 3. Finitary Rules.- 4. Closure Properties.- 5. Minimal Closure.- 6. More Elementary Functions and Predicates.- 2 Recursive Functions.- 1. Primitive Recursion.- 2. Functional Transformations.- 3. Recursive Specifications.- 4. Recursive Evaluation.- 5. Church's Thesis.- 3 Enumeration.- 1. Predicate Classes.- 2. Enumeration Properties.- 3. Induction.- 4. Nondeterministic Computability.- 4 Reflexive Structures.- 1. Interpreters.- 2. A Universal Interpreter.- 3. Two Constructions.- 4. The Recursion Theorem.- 5. Relational Structures.- 6. Uniform Structures.- 5 Hyperenumeration.- 1. Function Quantification.- 2. Nonfinitary Induction.- 3. Functional Induction.- 4. Ordinal Notations.- 5. Reflexive Systems.- 6. Hyperhyperenumeration.- References.Table of Contents1 Functions and Predicates.- §1. Definitions.- §2. Numerical Functions.- §3. Finitary Rules.- §4. Closure Properties.- §5. Minimal Closure.- §6. More Elementary Functions and Predicates.- 2 Recursive Functions.- §1. Primitive Recursion.- §2. Functional Transformations.- §3. Recursive Specifications.- §4. Recursive Evaluation.- §5. Church’s Thesis.- 3 Enumeration.- §1. Predicate Classes.- §2. Enumeration Properties.- §3. Induction.- §4. Nondeterministic Computability.- 4 Reflexive Structures.- §1. Interpreters.- §2. A Universal Interpreter.- §3. Two Constructions.- §4. The Recursion Theorem.- §5. Relational Structures.- §6. Uniform Structures.- 5 Hyperenumeration.- §1. Function Quantification.- §2. Nonfinitary Induction.- §3. Functional Induction.- §4. Ordinal Notations.- §5. Reflexive Systems.- §6. Hyperhyperenumeration.- References.
£44.99
Springer Us Associative Computing A Programming Paradigm For Massively Parallel Computers Frontiers in Computer Science
Book Synopsis1. Introduction.- 1.1. SITDAC Terminology.- 1.2. The SITDAC Model.- 1.3. SITDAC versus Other Models.- 1.4. Hardware Ramifications of SITDAC.- 1.5. SITDAC Algorithms.- 1.6. History.- 1.7. The Nature of SITDAC Programming.- 1.8. Reduced Programming Complexity.- 1.9. Throughput Analysis.- 1.10. Conclusion.- 2. Basic Concepts of Associative Programming.- 2.1. SIMD Parallelism.- 2.2. Flow of Control.- 2.3. The Classroom Model.- 2.4. Memory Allocation.- 2.5. Massive Parallel Searching.- 2.6. Tabular Arrays.- 2.7. Bit-Serial Arithmetic.- 2.8. Responders and Numeric Searching.- 2.9. Responder Iteration.- 2.10. Corner Turning.- 2.11. Bucket-Brigade Communication.- 2.12. Data Mapping.- 2.13. Data Replication.- 2.14. Conclusion.- 3. An Associative Model of Computation.- 3.1. The SITDAC Model of Computation.- 3.2. Cycle Nesting.- 3.3. Items and Expressions.- 3.4. Item Declarations.- 3.5. The Associative Statement.- 3.6. The Allocate and Release Statements.- 3.7. The If Statement.- 3.8. The For and While Statements.- 3.9. The Loop Statement.- 3.10. The Get Statement.- 3.11. The Next Statement.- 3.12. The Any Statement.- 3.13. The Setscope Statement.- 3.14. Maximum, Minimum, Nth and Count.- 3.15. Item Equivalences.- 3.16. ASC Pronouns and Articles.- 3.17. Module TypesMain and Subroutine.- 3.18. The I/O Statements.- 3.19. Interprocessor Communication.- 3.20. Contiguous Data Allocation.- 3.21. Indirect Addressing.- 3.22. Conclusion.- 4. Elementary ASC Programs.- 4.1. Simple Arithmetic Tasks.- 4.2. Associative Stacks and Queues.- 4.3. A Dataflow Interpreter.- 4.4. Minimal Spanning Tree.- 4.5. Conclusion.- 5. Associative Data Structures.- 5.1. An Associative Program.- 5.2. Structure Codes.- 5.3. Data Structures as Extended Associations.- 5.4. Simultaneous Multiple Data Organizations.-5.5. Generalized Array Data Structure Codes.- 5.6. Associative Data Structure References.- 5.7. Data Structure Code Manipulation.- 5.8. Synonymous Data Structures.- 5.9. Lists and Linked Lists.- 5.10. Structure-Code Functions.- 5.11. List Manipulation.- 5.12. Structure-Code Searching Functions.- 5.13. Structure-Code I/O (SCIO).- 5.14. Structure Codes for Graphs.- 5.15. Conclusion.- 6. ASC Recursion.- 6.1. The Recursewhile Construct.- 6.2. A Simple Recursewhile Example.- 6.3. How to Use Recursewhile.- 6.4. A Complex Recursewhile Example.- 6.5. Conclusion.- 7. Complex Searching.- 7.1. A Brief OPS5 Background.- 7.2. Pattern Data Structures.- 7.3. Local and Global Variables.- 7.4. The Andif Statement.- 7.5. The Andfor Statement.- 7.6. Flow of Control for And Constructs.- 7.7. Conclusion.- 8. Context-Sensitive Compilation.- 8.1. Context Sensitivity.- 8.2. A Brief Overview.- 8.3. Context-Sensitive Compilation.- 8.4. Execution of a Procedural Rule.- 8.5. Conclusion.- 9. Associative Prolog.- 9.1. Background.- 9.2. Unification.- 9.3. The Binding Association.- 9.4. Search Organization.- 9.5. Inference Engine.- 9.6. Clause Filtering.- 9.7. Binding Variables.- 9.8. Prolog I/O.- 9.9. Example of a Prolog Program.- 9.10. Additional Details.- 9.11. Conclusion.- 10. An Associative Processor Design.- 10.1. Design Rationale.- 10.2. Re-locatable Data.- 10.3. Communication Paths.- 10.4. The Basic Design.- 10.5. VLSI Organization.- 10.6. Associative Multitasking/Multiuser Parallelism.- 10.7. The Basic Associative Intermediate Level Instruction Set.- 10.8. Conclusion.- Appendix. ASC Tables.- References.Table of ContentsIntroduction. Basic Concepts of Associative Programming. An Associative Model of Computation. Elementary ASC Programs. Associative Data Structures. ASC Recursion. Complex Searching. ContextSensitive Compilation. Associative Prolog. An Associative Processor Design. Index.
£49.49
Springer Us A Practitioners Handbook for RealTime Analysis Guide To Rate Monotonic Analysis For RealTime Systems Electronic Materials Science Technology
Book SynopsisA Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems contains an invaluable collection of quantitative methods that enable real-time system developers to understand, analyze, and predict the timing behavior of many real-time systems.Table of ContentsPreface. Part 1: Introduction. 1. About this Handbook. 2. Fundamentals of RMA. Part 2: Concepts and Techniques. 3. A Framework for Describing Real-Time Systems. 4. Techniques for Analyzing Timing Behavior. Part 3: Analyzing Real-Time Systems. 5. Basic Real-Time Situations. 6. Advanced Real-Time Situations. 7. Effects of Operating System and Runtime Services on Timing Analysis. Part 4: Using the Handbook on Realistic Systems. 8. Analyzing Complex Systems. 9. Designing with Rate Monotonic Analysis. Part 5: Appendices. A. Rules of Thumb. B. Notation Used in this Handbook. C. Bibliography. D. Glossary. E. Index.
£427.49
Springer New York ComputerAssisted Medical Decision Making 2 Computers and Medicine
Book SynopsisComputer technology has impacted the practice of medicine in dramatic ways. In many cases, these appli cations are limited to administrative functions, e.g., office practice man agement, location of hospital patients, appointments, and scheduling.Table of Contentsfor Volume 1.- I. Introduction.- 1. An Overview of Methods for Computer-Assisted Medical Decision Making.- 2. Reasoning Foundations of Medical Diagnosis.- II. Algorithmic Approaches.- 3. Computer-Based Consultation: Electrolyte and Acid-Base Disorders.- 4. Reduction of Digitalis Toxicity by Computer-Assisted Glycoside Dosage Regimens.- 5. A Consultant-Extender System for Breast Cancer Adjuvant Chemotherapy.- III. Statistically Oriented Approaches.- 6. A Mathematical Approach to Medical Diagnosis: Application to Congenital Heart Disease.- 7. Computer-Aided Diagnosis of Acute Abdominal Pain.- 8. Computer-Assisted Diagnosis of Abdominal Pain Using “Estimates” Provided by Clinicians.- 9. Bayes’ Theorem and Conditional Nonindependence of Data in Medical Diagnosis.- 10. Transferability of Medical Decision Support Systems Based on Bayesian Classification.- 11. Experience with a Model of Sequential Diagnosis.- 12. Pattern-Based Interactive Diagnosis of Multiple Disorders: The MEDAS System.- 13. Enhancement of Clinical Predictive Ability by Computer Consultation.- 14. Decision Analysis and Clinical Judgment.
£49.49
Springer Us RealTime Systems Engineering and Applications Engineering And Applications 167 The Springer International Series in Engineering and Computer Science
Book SynopsisThe Origins of Real-Time Processing.- The Concept of Time in the Specification of Real-Time Systems.- Language-Independent Schedulability Analysis of Real-Time Programs.- Which Theory Matches Automation Engineering?.- Requirements Engineering for Real-Time and Embedded Systems.- Real-Time Programming Languages.- Comparison of Synchronization Concepts.- Real-Time Database Systems.- Microprocessor Architectures: A Basis for Real-Time Systems.- Buses in Real-Time Environments.- Distributed Systems for Real Time Applications.- Robot Programming.- Real-Time Data Processing of the Sensory Data of a Multi- Fingered Dextrous Robot Hand.- Fly-By-Wire Systems for Military High Performance Aircraft.- Artificial Intelligence Techniques in Real-Time Processing.- Recommendations for a Real-Time Systems Curriculum.Table of ContentsForeword. I: Introduction. 1. The Origins of Real-Time Processing; M. Schiebe. II: Theoretical Foundations. 2. The Concept of Time in the Specification of Real-Time Systems; B. Hoogeboom, W.A. Halang. 3. Language-Independent Schedulability Analysis of Real-Time Programs; A.D. Stoyenko. III: Models and Tools 4. Which Theory Matches Automation Engineering? Petri-Nets as a Formal Basis; E. Schnieder. 5. Requirements Engineering for Real-Time and Embedded Systems; P. Hruschka. IV: Practical Considerations. 6. Real-Time Programming Languages; W.A. Halang, K.-O. Mangold. 7. Comparison of Synchronization Concepts of Ada, Concurrent C and PEARL; K.-F. Gebhardt. 8. Real-Time Database Systems; H. Windauer. 9. Microprocessor Architectures: A Basis for Real-Time Systems; T. Bemmerl. 10. Buses in Real-Time Environments; F. Demmelmeier. 11. Distributed Systems for Real-Time Applications Using Manufacturing Automation as an Example; H. Rzehak. 12. Robot Programming; K. Fischer, B. Glavina, E. Hagg, G. Schrott, J. Schweiger, H.-J. Siegert. V: Examples for Applications. 13. Real-Time Data Processing of the Sensory Data of Multi-Fingered Dextrous Hand; A. Knoll. 14. Fly-By-Wire Systems for Military High Performance Aircraft; D. Langer, J. Rauch, M. Rößler. VI: Future Developments. 15. Artificial Intelligence Techniques in Real-Time Processing; K. Kratzer. 16. Recommendations for a Real-Time Systems Curriculum; W.A. Halang. Glossary. Index.
£189.99
Springer Us Algorithms for Computer Algebra
Book Synopsisto Computer Algebra.- Algebra of Polynomials, Rational Functions, and Power Series.- Normal Forms and Algebraic Representations.- Arithmetic of Polynomials, Rational Functions, and Power Series.- Homomorphisms and Chinese Remainder Algorithms.- Newton's Iteration and the Hensel Construction.- Polynomial GCD Computation.- Polynomial Factorization.- Solving Systems of Equations.- Gröbner Bases for Polynomial Ideals.- Integration of Rational Functions.- The Risch Integration Algorithm.Trade Review`The Computer Algebra community has been waiting for years for this book to appear. ...the book is a masterpiece and can be recommended to everyone interested in the algorithms for computer algebra, either as a reference for further research or just to give the casual user an idea why things work as good (or as bad) as they do in computer algebra packages. ...the recommendation would be clear: Buy this book! As it stands now my only advice is to stay away from this book, because you might be tempted to buy it anyway (at least I was).' Computer Algebra Nederland Newsletter, June 1993 Table of ContentsPreface. 1. Introduction to Computer Algebra. 2. Algebra of Polynomials, Rational Functions, and Power Series. 3. Normal Forms and Algebraic Representations. 4. Arithmetic of Polynomial, Rational Functions, and Power Series. 5. Homomorphisms and Chinese Remainder Algorithms. 6. Newton's Iteration and the Hensel Construction. 7. Polynomials GCD Computation. 8. Polynomial Factorization. 9. Solving Systems of Equation. 10. Grobner Bases for Polynomial Ideals. 11. Integration of Rational Functions. 12. The Risch Integration Algorithm. Notation. Index.
£123.49
Outskirts Press 3D Business Analyst
£39.95
