Explaining Algorithms Using Metaphors

Author: Michal Forišek
Publisher: Springer Science & Business Media
ISBN: 1447150198
Format: PDF, Kindle
Download and Read
There is a significant difference between designing a new algorithm, proving its correctness, and teaching it to an audience. When teaching algorithms, the teacher's main goal should be to convey the underlying ideas and to help the students form correct mental models related to the algorithm. This process can often be facilitated by using suitable metaphors. This work provides a set of novel metaphors identified and developed as suitable tools for teaching many of the "classic textbook" algorithms taught in undergraduate courses worldwide. Each chapter provides exercises and didactic notes for teachers based on the authors’ experiences when using the metaphor in a classroom setting.

Automatic Design of Decision Tree Induction Algorithms

Author: Rodrigo C. Barros
Publisher: Springer
ISBN: 3319142313
Format: PDF, ePub
Download and Read
Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction algorithm regardless of the data, the authors argue on the benefits that a bias-fitting strategy could bring to decision-tree induction, in which the ultimate goal is the automatic generation of a decision-tree induction algorithm tailored to the application domain of interest. For such, they discuss how one can effectively discover the most suitable set of components of decision-tree induction algorithms to deal with a wide variety of applications through the paradigm of evolutionary computation, following the emergence of a novel field called hyper-heuristics. "Automatic Design of Decision-Tree Induction Algorithms" would be highly useful for machine learning and evolutionary computation students and researchers alike.

Introduction to Algorithms

Author: Thomas H. Cormen
Publisher: MIT Press
ISBN: 0262533057
Format: PDF, Kindle
Download and Read
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.

Concepts Ontologies and Knowledge Representation

Author: Grega Jakus
Publisher: Springer Science & Business Media
ISBN: 1461478227
Format: PDF
Download and Read
Recording knowledge in a common framework that would make it possible to seamlessly share global knowledge remains an important challenge for researchers. This brief examines several ideas about the representation of knowledge addressing this challenge. A widespread general agreement is followed that states uniform knowledge representation should be achievable by using ontologies populated with concepts. A separate chapter is dedicated to each of the three introduced topics, following a uniform outline: definition, organization, and use. This brief is intended for those who want to get to know the field of knowledge representation quickly, or would like to be up to date with current developments in the field. It is also useful for those dealing with implementation as examples of numerous operational systems are also given.

Practical Analysis of Algorithms

Author: Dana Vrajitoru
Publisher: Springer
ISBN: 3319098888
Format: PDF, Kindle
Download and Read
This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.

Computational Movement Analysis

Author: Patrick Laube
Publisher: Springer
ISBN: 3319102680
Format: PDF, Kindle
Download and Read
This SpringerBrief discusses the characteristics of spatiotemporal movement data, including uncertainty and scale. It investigates three core aspects of Computational Movement Analysis: Conceptual modeling of movement and movement spaces, spatiotemporal analysis methods aiming at a better understanding of movement processes (with a focus on data mining for movement patterns), and using decentralized spatial computing methods in movement analysis. The author presents Computational Movement Analysis as an interdisciplinary umbrella for analyzing movement processes with methods from a range of fields including GIScience, spatiotemporal databases and data mining. Key challenges in Computational Movement Analysis include bridging the semantic gap, privacy issues when movement data involves people, incorporating big and open data, and opportunities for decentralized movement analysis arising from the internet of things. The interdisciplinary concepts of Computational Movement Analysis make this an important book for professionals and students in computer science, geographic information science and its application areas, especially movement ecology and transportation research.

Agile Risk Management

Author: Alan Moran
Publisher: Springer Science & Business Media
ISBN: 3319050087
Format: PDF, Kindle
Download and Read
This work is the definitive guide for IT managers and agile practitioners. It elucidates the principles of agile risk management and how these relate to individual projects. Explained in clear and concise terms, this synthesis of project risk management and agile techniques is illustrated using the major methodologies such as XP, Scrum and DSDM. Although the agile community frequently cites risk management, research suggests that risk is often narrowly defined and, at best, implicitly treated, which in turn leads to an inability to make informed decisions concerning risk and reward and a poor understanding of when to engage in risk-related activities. Moreover, the absence of reference to enterprise risk management means that project managers are unable to clearly articulate scope or tailor their projects in line with the wider expectations of the organisation. Yet the agile approach, with its rich toolset of techniques, is very well equipped to effectively and efficiently deal with the risks that arise in projects. Alan Moran addresses the above issues by proposing an agile risk-management process derived from classical risk management but adapted to the circumstances of agile projects. Though his main focus is on the software development process, much of what he describes could be applied to other types of IT projects as well. This book is intended for anyone who is serious about balancing risk and reward in the pursuit of value for their stakeholders, and in particular for those directly involved in agile software development who share a concern for how risk should be managed. Whilst a thorough background in risk management is not presumed, a basic level of familiarity with or exposure to agility is helpful.

Algorithms and Programming

Author: Alexander Shen
Publisher: Springer Science & Business Media
ISBN: 1441917489
Format: PDF, ePub, Mobi
Download and Read
This text is structured in a problem-solution format that requires the student to think through the programming process. New to the second edition are additional chapters on suffix trees, games and strategies, and Huffman coding as well as an Appendix illustrating the ease of conversion from Pascal to C.

Distributed Context Aware Systems

Author: Paulo Ferreira
Publisher: Springer Science & Business
ISBN: 3319048821
Format: PDF, ePub, Docs
Download and Read
Context-aware systems aim to deliver a rich user experience by taking into account the current user context (location, time, activity, etc.), possibly captured without his intervention. For example, cell phones are now able to continuously update a user’s location while, at the same time, users execute an increasing amount of activities online, where their actions may be easily captured (e.g. login in a web application) without user consent. In the last decade, this topic has seen numerous developments that demonstrate its relevance and usefulness. The trend was accelerated with the widespread availability of powerful mobile devices (e.g. smartphones) that include a myriad of sensors which enable applications to capture the user context. However, there are several challenges that must be addressed; we focus on scalability (large number of context aware messages) and privacy (personal data that may be propagated). This book is organized in five chapters starting with an introduction to the theme raising the most important challenges. Then, chapter two presents several important definitions (establishing a common ground for the following chapters) and taxonomy. These are important to chapter three which describes some of the most relevant distributed context-aware systems that can be classified according to the taxonomy. Privacy is addressed in chapter four and chapter five presents some important conclusions. The audience for this book is wide; researchers, students and professionals interested in the areas addressed will find the most relevant information regarding scalability and privacy in distributed context-aware systems.

Space Efficient Data Structures Streams and Algorithms

Author: Andrej Brodnik
Publisher: Springer
ISBN: 3642402739
Format: PDF, Mobi
Download and Read
This Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "Conference on Space Efficient Data Structures, Streams and Algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures.