Algorithms and data structures Books
Taylor & Francis Sociology and Human Ecology
a huge range and FREE tracked UK delivery on ALL orders.
£41.99
Taylor & Francis Ltd Desktop Grid Computing
a huge range and FREE tracked UK delivery on ALL orders.
£58.89
Taylor & Francis Ltd Temporal Data Mining Chapman HallCrc Data Mining and Knowledge Discovery
a huge range and FREE tracked UK delivery on ALL orders.
£56.99
Taylor & Francis Ltd Algorithms and Theory of Computation Handbook Volume 2 Special Topics and Techniques Chapman HallCRC Applied Algorithms and Data Structures series
a huge range and FREE tracked UK delivery on ALL orders.
£56.99
Taylor & Francis Ltd Integer Programming
a huge range and FREE tracked UK delivery on ALL orders.
£58.89
Taylor & Francis Ltd Parallel Computing
a huge range and FREE tracked UK delivery on ALL orders.
£56.99
Taylor & Francis Ltd Grammars and Automata for String Processing From Mathematics and Computer Science to Biology and Back Topics in Computer Mathematics
a huge range and FREE tracked UK delivery on ALL orders.
£39.99
Taylor & Francis Ltd Spectral Computations for Bounded Operators
a huge range and FREE tracked UK delivery on ALL orders.
£56.04
Taylor & Francis Ltd Discovering Computer Science Interdisciplinary Problems Principles and Python Programming Chapman HallCRC Textbooks in Computing
a huge range and FREE tracked UK delivery on ALL orders.
£71.24
Taylor & Francis Ltd Swarm Intelligence
a huge range and FREE tracked UK delivery on ALL orders.
£80.74
Taylor & Francis Ltd Mechanizing Hypothesis Formation
a huge range and FREE tracked UK delivery on ALL orders.
£142.50
Taylor & Francis Algorithms Automation and News
a huge range and FREE tracked UK delivery on ALL orders.
£128.25
Taylor & Francis Ltd Beyond Algorithms
a huge range and FREE tracked UK delivery on ALL orders.
£46.54
Taylor & Francis Ltd Data Structures using C
a huge range and FREE tracked UK delivery on ALL orders.
£105.00
Taylor & Francis Ltd Beyond Algorithms
a huge range and FREE tracked UK delivery on ALL orders.
£123.50
Taylor & Francis Digital Technology and Justice Justice Apps
a huge range and FREE tracked UK delivery on ALL orders.
£51.29
Taylor & Francis Ltd Swarm Intelligence for Iris Recognition
a huge range and FREE tracked UK delivery on ALL orders.
£47.49
Taylor & Francis Ltd Recommender Systems
a huge range and FREE tracked UK delivery on ALL orders.
£94.99
Taylor & Francis Ltd An Integrated Approach to Home Security and Safety Systems
a huge range and FREE tracked UK delivery on ALL orders.
£104.50
Taylor & Francis Ltd Criminal Futures
a huge range and FREE tracked UK delivery on ALL orders.
£39.99
Taylor & Francis Ltd Software Essentials
a huge range and FREE tracked UK delivery on ALL orders.
£42.74
Taylor & Francis Ltd IP Routing Protocols Fundamentals and DistanceVector Routing Protocols
a huge range and FREE tracked UK delivery on ALL orders.
£65.54
Taylor & Francis Ltd IP Routing Protocols LinkState and PathVector Routing Protocols
a huge range and FREE tracked UK delivery on ALL orders.
£65.54
Taylor & Francis Local Theories of Argument
a huge range and FREE tracked UK delivery on ALL orders.
£128.25
Taylor & Francis Ltd Artificial Intelligence for the Internet of Health Things
a huge range and FREE tracked UK delivery on ALL orders.
£45.99
Taylor & Francis Ltd Transportation Networks A Quantitative Treatment 19 Routledge Library Edtions Global Transport Planning
a huge range and FREE tracked UK delivery on ALL orders.
£87.39
Taylor & Francis Ltd Transportation Networks
a huge range and FREE tracked UK delivery on ALL orders.
£28.99
Taylor & Francis Ltd NatureInspired Algorithms
a huge range and FREE tracked UK delivery on ALL orders.
£109.25
Taylor & Francis Ltd Evolutionary Optimization Algorithms
a huge range and FREE tracked UK delivery on ALL orders.
£105.00
Taylor & Francis Ltd Soft Computing Techniques in Engineering Health Mathematical and Social Sciences
a huge range and FREE tracked UK delivery on ALL orders.
£105.00
Taylor & Francis Ltd Machine Learning for Computer and Cyber Security Principle Algorithms and Practices
a huge range and FREE tracked UK delivery on ALL orders.
£47.49
Taylor & Francis Ltd Mathematical Modeling and Soft Computing in Epidemiology
a huge range and FREE tracked UK delivery on ALL orders.
£147.25
Taylor & Francis Machine Learning for Criminology and Crime
Book SynopsisMachine Learning for Criminology and Crime Research: At the Crossroads reviews the roots of the intersection between machine learning, artificial intelligence (AI), and research on crime; examines the current state of the art in this area of scholarly inquiry; and discusses future perspectives that may emerge from this relationship.As machine learning and AI approaches become increasingly pervasive, it is critical for criminology and crime research to reflect on the ways in which these paradigms could reshape the study of crime. In response, this book seeks to stimulate this discussion. The opening part is framed through a historical lens, with the first chapter dedicated to the origins of the relationship between AI and research on crime, refuting the novelty narrative that often surrounds this debate. The second presents a compact overview of the history of AI, further providing a nontechnical primer on machine learning. The following chapter reviews some of the moTable of ContentsChapter 1: The "Novelty Narrative": An Unorthodox IntroductionChapter 2: A Collective Journey: A Short Overview on Artificial IntelligenceChapter 3: Criminology at the Crossroads? Computational PerspectivesChapter 4: To Reframe and Reform: Increasing the Positive Social Impact of Algorithmic Applications in Research on CrimeChapter 5: Causal Inference in Criminology and Crime Research and the Promises of Machine LearningChapter 6: Concluding Remarks
£39.99
Taylor & Francis Ltd Robust and ErrorFree Geometric Computing
Book SynopsisThis is a how-to book for solving geometric problems robustly or error free in actual practice. The contents and accompanying source code are based on the feature requests and feedback received from industry professionals and academics who want both the descriptions and source code for implementations of geometric algorithms. The book provides a framework for geometric computing using several arithmetic systems and describes how to select the appropriate system for the problem at hand. Key Features: A framework of arithmetic systems that can be applied to many geometric algorithms to obtain robust or error-free implementations Detailed derivations for algorithms that lead to implementable code Teaching the readers how to use the book concepts in deriving algorithms in their fields of application The Geometric Tools Library, a repository of well-tested code at the Geometric Tools website, https:/Table of Contents1.Introduction. 2. Arbitrary Precision Arithmetic. 3. Interval Arithmetic. 4. Computational Geometry Algorithms. 5. Distance Queried. 6. Intersection Queries. 7. Mixed-Mode Computing. 8. Robust Floating-Point Computing. 9. Implementation of Arithmetic
£42.74
Taylor & Francis Ltd Learn Programming with C
Book SynopsisAuthored by two standout professors in the field of Computer Science and Technology with extensive experience in instructing, Learn Programming with C: An Easy Step-by Step Self-Practice Book for Learning C is a comprehensive and accessible guide to programming with one of the most popular languages.Meticulously illustrated with figures and examples, this book is a comprehensive guide to writing, editing, and executing C programs on different operating systems and platforms, as well as how to embed C programs into other applications and how to create oneâs own library. A variety of questions and exercises are included in each chapter to test the readersâ knowledge.Written for the novice C programmer, especially undergraduate and graduate students, this bookâs line-by-line explanation of code and succinct writing style makes it an excellent companion for classroom teaching, learning, and programming labs.Table of ContentsPrefaceChapter 1: Introduction History of Programming Language Different Types of Programming Language Importance of Programming C Program Structure Step-by-Step Tutorial to Run a C Program Keywords Identifiers Operators Operator Precedence in C Variables Constants Escape Sequences Data Types Type Casting Examples Exercises MCQ with Answers Questions with Short Answers Problems to Practice Chapter 2: Flow-Control if Statement if..else Statement Nested if..else Statement Conditional Operator for Loop while Loop do..while Loop continue Statement break Statement switch..case Statement goto Statement Examples Exercises MCQ with Answers Questions with Short Answers Problems to Practice Chapter 3: Arrays and Pointers Arrays 2-D arrays Multidimensional arrays String String Function Pointers Memory Allocation Examples Exercises MCQ with Answers Questions with Short Answers Problems to Practice Chapter 4: Functions Function Types Function Structure Function Call Arrays and Functions Pointers and Functions Storage Class Examples Exercises MCQ with Answers Questions with Short Answers Problems to Practice Chapter 5: Structure and Union Structure Union enum Data Structure and Algorithm Linked List Types of Linked List Examples Exercises MCQ with Answers Questions with Short Answers Problems to Practice Chapter 6: File Management File Types File Operations Preprocessors Conditional Compilation Examples Exercises MCQ with Answers Questions with Short Answers Problems to Practice Chapter 7: C Graphics Introduction Functions Color Table Fonts of Text Fill Patterns Including graphics.h in CodeBlocks Examples Problems to PracticeChapter 8: C Cross-platform Creating Own Library Turbo C Visual Studio Code Visual Studio Command Line Command Line Arguments Linux Embedding C Code into MATLAB Integrating C Code into Python Switching from One Language to Another Transition to C++ or C# from C Chapter 9: C Projects
£56.99
Taylor & Francis Ltd Algorithms
Algorithms: Technology, Culture, Politics develops a relational, situated approach to algorithms. It takes a middle ground between theories that give the algorithm a singular and stable meaning in using it as a central analytic category for contemporary society and theories that dissolve the term into the details of empirical studies.The book discusses algorithms in relation to hardware and material conditions, code, data, and subjects such as users, programmers, but also data doubles. The individual chapters bridge critical discussions on bias, exclusion, or responsibility with the necessary detail on the contemporary state of information technology. The examples include state-of-the-art applications of machine learning, such as self-driving cars, and large language models such as GPT.The book will be of interest for everyone engaging critically with algorithms, particularly in the social sciences, media studies, STS, political theory, or philosophy. With its b
£36.99
Taylor & Francis Ltd Decolonizing Data
Book SynopsisThis book focuses on the values and effects that are operational in data technologies as they sustain colonial and imperialist legacies while also highlighting strategies for resistance to autocratic regimes and pathways towards decolonizing efforts.Systems and schemes for databases and automated data flow processing often contain implicitly Westernized, autocratic or even imperialist features, but can also be appropriated for resistance and revolt. Algorithms are not strictly mathematical but also embody cultural constructs. Values circulate in systems along with labels and quantities. This entails more critically reflective data practices whether in government, academia, industry or the civic sphere. The volume covers a critique of the data colonialism thesis which frames computer science as a colonizing science that uses data to classify and govern us, an alternate framing of metadata as data near data' to challenge seemingly neutral technical terms, and a case study of thTable of Contents1 Notes on the Historiography of Data Colonialism; 2 Metadata Is Not Data About Data; 3 Social Media Use in the Sudanese Uprising, 2018: Mediating Civilian–Military Discourse
£49.99
Taylor & Francis Ltd A Primer on Machine Learning Applications in
Book SynopsisMachine learning has undergone rapid growth in diversification and practicality, and the repertoire of techniques has evolved and expanded. The aim of this book is to provide a broad overview of the available machine-learning techniques that can be utilized for solving civil engineering problems. The fundamentals of both theoretical and practical aspects are discussed in the domains of water resources/hydrological modeling, geotechnical engineering, construction engineering and management, and coastal/marine engineering. Complex civil engineering problems such as drought forecasting, river flow forecasting, modeling evaporation, estimation of dew point temperature, modeling compressive strength of concrete, ground water level forecasting, and significant wave height forecasting are also included.Features Exclusive information on machine learning and data analytics applications with respect to civil engineering Includes many machiTable of Contents1. Introduction 2. Artificial Neural Networks 3. Fuzzy Logic 4. Support Vector Machine 5. Genetic Algorithm (GA) 6. Hybrid Systems 7. Data Statistics and Analytics 8. Applications in the Civil Engineering Domain 9. Conclusion and Future Scope of Work
£87.39
Taylor & Francis Ltd Automata and Computability
Book SynopsisAutomata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation. The author uses illustrations, engaging examples, and historical remarks to make the material interesting and relevant for students. It incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda calculus. The book also shows how to sculpt automata by making the regular language conversion pipeline available through a simple command interface. A Jupyter notebook will accompany the book to feature code, YouTube videos, and other supplements to assist instructors and studentsFeatures Uses illustrations, engaging examples, and historical remarks to make the material accessible Incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda Trade Review"I have taught formal languages and automata theory for decades, and I have seen many, perhaps most, students struggle with the material because it is so abstract. I've often thought that computer science students would learn it better by programming it. Indeed, that's how I really learned these topics -- by implementing constructions directly in practical compiler generation and formal verification tools to do my research. Prof. Gopalakrishnan's approach is to have students learn by doing, while still going into greater depth than some purely pencil-and-paper courses." -Prof. David L. Dill, Donald E. Knuth Professor, Emeritus, in the School of Engineering, Stanford University "It is probably a safe assumption to make these days that many, if not most, computer science undergraduates have had programming experience, but few of them know the language of mathematics. Professor Gopalakrishnan’s book builds on the student’s experience in programming and animates the theory of automata, formal languages, and computability with actual programs which the student can easily modify and play with. Doing is the best way of learning. This book should enable the typical computer science student to acquire a more visceral, and therefore in the long run more useful, understanding of the theory." -Dr. Ching-Tsun Chou, Silicon Architecture Engineer, Intel Corporation "As a long-time researcher in programming languages and high-performance computing, I find the coverage of Automata and Computability in this book illuminating from a foundational perspective as well as timely from a practical perspective. In addition to classical topics such as automata theory and parsing, it allows a student to interactively study via Jupyter notebooks a wide range of topics including grammar disambiguation, Boolean satisfiability, Post Correspondence and Lambda Calculus --- all important topics for students who aspire to become proficient in computer science." -Vivek Sarkar, Professor, School of Computer Science & Stephen Fleming Chair for Telecommunications, College of Computing, Georgia Institute of Technology "I have taught formal languages and automata theory for decades, and I have seen many, perhaps most, students struggle with the material because it is so abstract. I've often thought that computer science students would learn it better by programming it. Indeed, that's how I really learned these topics -- by implementing constructions directly in practical compiler generation and formal verification tools to do my research. Prof. Gopalakrishnan's approach is to have students learn by doing, while still going into greater depth than some purely pencil-and-paper courses." -Prof. David L. Dill, Donald E. Knuth Professor, Emeritus, in the School of Engineering, Stanford University "It is probably a safe assumption to make these days that many, if not most, computer science undergraduates have had programming experience, but few of them know the language of mathematics. Professor Gopalakrishnan’s book builds on the student’s experience in programming and animates the theory of automata, formal languages, and computability with actual programs which the student can easily modify and play with. Doing is the best way of learning. This book should enable the typical computer science student to acquire a more visceral, and therefore in the long run more useful, understanding of the theory." -Dr. Ching-Tsun Chou, Silicon Architecture Engineer, Intel Corporation "As a long-time researcher in programming languages and high-performance computing, I find the coverage of Automata and Computability in this book illuminating from a foundational perspective as well as timely from a practical perspective. In addition to classical topics such as automata theory and parsing, it allows a student to interactively study via Jupyter notebooks a wide range of topics including grammar disambiguation, Boolean satisfiability, Post Correspondence and Lambda Calculus --- all important topics for students who aspire to become proficient in computer science." -Vivek Sarkar, Professor, School of Computer Science & Stephen Fleming Chair for Telecommunications, College of Computing, Georgia Institute of Technology Table of ContentsI Foundations 1 What Machines Think 2 Defining Languages: Patterns in Sets of Strings 3 Kleene Star: Basic Method of defining Repetitious Patterns II Machines 4 Basics of DFAs 5 Designing DFA 6 Operations on DFA 7 Nondeterministic Finite Automata 8 Regular Expressions and NFA 9 NFA to RE conversion 10 Derivative-based Regular Expression Matching 11 Context-Free Languages and Grammars 12 Pushdown Automata 13 Turing Machines III Concepts 14 Interplay Between Formal Languages 15 Post Correspondence, and Other Undecidability Proofs 16 NP-Completeness 17 Binary Decision Diagrams as Minimal DFA 18 Computability using Lambdas
£78.84
Taylor & Francis Inc Fundamentals of Dependable Computing for Software Engineers
Book SynopsisFundamentals of Dependable Computing for Software Engineers presents the essential elements of computer system dependability. The book describes a comprehensive dependability-engineering process and explains the roles of software and software engineers in computer system dependability. Readers will learn: Why dependability matters What it means for a system to be dependable How to build a dependable software system How to assess whether a software system is adequately dependable The author focuses on the actions needed to reduce the rate of failure to an acceptable level, covering material essential for engineers developing systems with extreme consequences of failure, such as safety-critical systems, security-critical systems, and critical infrastructure systems. The text explores the systems engineering aspects of dependability and provides a framework for engineers to reason and make deTrade ReviewThe book is an important addition to one’s bookshelf. … it is insightful, close to faultless, and a wonderful reference. Read it from front to back and cite it in your proposals and professional and scholarly papers. … This book can and should be taught as part of an undergraduate or graduate software engineering program. I wish it had been available when I was setting up a graduate software engineering program … .—Larry Bernstein, Computing Reviews, June 2012This book takes full advantage of the extensive work that has been undertaken over many years on the creation of a rich set of system dependability concepts. John Knight makes excellent use of these concepts in producing a very well-argued and comprehensive account, aimed squarely at software engineers, of the variety of dependability issues they are likely to find in real systems and of the strategies that they should use to address these issues. Appropriately qualified students who study this book thoroughly and computer professionals seeking a greater understanding of the various dependability-related problems that they have encountered already in their careers should gain much from this book. I therefore take great pleasure in enthusiastically recommending it to both classes of reader.—From the Foreword by Brian Randell, Newcastle University, UKTable of ContentsIntroduction. Dependability Requirements. Errors, Faults, and Hazards. Dependability Analysis. Dealing with Faults. Degradation Faults and Software. Software Dependability. Software Fault Avoidance in Specification. Software Fault Avoidance in Implementation. Software Fault Elimination. Software Fault Tolerance. Dependability Assessment. Bibliography.
£49.39
Cambridge University Press Lectures in Parallel Computation
a huge range and FREE tracked UK delivery on ALL orders.
£66.49
Cambridge University Press Communication Complexity
a huge range and FREE tracked UK delivery on ALL orders.
£40.84
Cambridge University Press Efficient Algorithms for Listing Combinatorial Structures
a huge range and FREE tracked UK delivery on ALL orders.
£35.14
Cambridge University Press Transitions and Trees An Introduction to Structural Operational Semantics
a huge range and FREE tracked UK delivery on ALL orders.
£55.09
Cambridge University Press Iterative Methods in Combinatorial Optimization 46 Cambridge Texts in Applied Mathematics Series Number 46
a huge range and FREE tracked UK delivery on ALL orders.
£42.74
Cambridge University Press Digital Nets and Sequences
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Cambridge University Press Enterprise Liability and the Common Law
Book SynopsisProgramming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary. Scheme demonstrates that a very small number of rules for forming expressions, with no restrictions on how they are composed, are enough to form a practical and efficient programming language that is flexible enough to support most of the major programming paradigms in use today. This book contains the three parts comprising 'R6RS', the sixth revision of a series of reports describing the programming language Scheme. The book is divided into parts: a description of the language itself, a description of the standard libraries and non-normative appendices. Early chapters introduce Scheme and later chapters act as a reference manual. This is an important report for programmers that work with or want to learn about the Scheme language.Table of ContentsPreface; Part I. Language: Description of the language; 1. Overview of Scheme; 2. Requirement levels; 3. Numbers; 4. Lexical syntax and datum syntax; 5. Semantic concepts; 6. Entry format; 7. Libraries; 8. Top-level programs; 9. Primitive syntax; 10. Expansion process; 11. Base library; Appendices; Part II. Standard Libraries: 12. Unicode; 13. Bytevectors; 14. List utilities; 15. Sorting; 16. Control structures; 17. Records; 18. Exceptions and conditions; 19. I/O; 20. File system; 21. Command-line access and exit values; 22. Arithmetic; 23. syntax-case; 24. Hashtables; 25. Enumerations; 26. Composite library; 27. Eval; 28. Mutable pairs; 29. Mutable strings; 30. R5RS compatibility; Part III. Non-Normative Appendices: A. Standard-conformant mode; B. Optional case insensitivity; C. Use of square brackets; D. Scripts; E. Source code representation; F. Use of library versions; G. Unique library names; References; Alphabetic index of definitions of concepts, keywords, and procedures.
£91.20
Cambridge University Press The Design of Approximation Algorithms
a huge range and FREE tracked UK delivery on ALL orders.
£56.04
