Page 113
Page 113
Ambient intelligence for scientific discovery : Foundations, theories, and systems
Many difficult scientific discovery tasks can only be solved in interactive ways, by combining intelligent computing techniques with intuitive and adaptive user interfaces. It is inevitable to use human intelligence in scientific discovery systems: human eyes can capture complex patterns and relationships, along with detecting the exceptional cases in a data set; the human brain can easily manipulate perceptions to make decisions. Ambient intelligence is about this kind of ubiquitous and autonomous human interaction with information. Scientific discovery is a process of creative perception and communication, dealing with questions like: how do we significantly reduce information while maintaining meaning, or how do we extract patterns from massive data and growing data resources. Originating from the SIGCHI Workshop on Ambient Intelligence for Scientific Discovery, this state-of-the-art survey is organized in three parts: new paradigms in scientific discovery, ambient cognition, and ambient intelligence systems. Many chapters share common features such as interaction, vision, language, and biomedicine.
Ambient Intelligence ; European Conference, AmI 2008, Nuremberg, Germany, November 19-22, 2008. Proceedings
This book constitutes the refereed proceedings of the Second European Conference on Ambient Intelligence, AmI 2008, held in Nuremberg, Germany, in November 2008.
Ambient Intelligence ; European Conference, AmI 2007, Darmstadt, Germany, November 7-10, 2007, Proceedings
This book presented sections on mobility and sensing, applications of AmI, activity and location sensing, AmI and artificial intelligence, AmI middleware and infrastructure, and interaction with the environment. The book is rounded off by a section on case studies and lessons learned, presenting a high level selection of current research reports and papers that reflect the most important activities of current ambient intelligence research.
Ambient intelligence : A novel paradigm
Ambient Intelligence (AmI) is an integrating technology for supporting a pervasive and transparent infrastructure for implementing smart environments. Such technology is used to enable environments for detecting events and behaviors of people and for responding in a contextually relevant fashion. AmI proposes a multi-disciplinary approach for enhancing human machine interaction. The authors start with a description of the iDorm as an example of a smart environment conforming to the AmI paradigm, and introduces computer vision as an important component of the system. Other computer vision examples describe visual monitoring for the elderly, classic and novel surveillance techniques using clusters of cameras installed in indoor and outdoor application domains, and the monitoring of public spaces. Face and speech recognition systems are also covered as well as enhanced LEGO blocks for novel educational purposes. The book closes with a provocative chapter on how a cybernetic system can be designed as the backbone of a human machine interaction.
Alternative breast imaging : Four model-based approaches
Medical imaging has been transformed over the past 30 years by the advent of computerized tomography (CT), magnetic resonance imaging (MRI), and various advances in x-ray and ultrasonic techniques. An enabling force behind this progress has been the (so far) exponentially increasing power of computers, which has made it practical to explore fundamentally new approaches. In particular, what our group terms "model-based" modalities-which produce tissue property images from data using nonlinear, iterative numerical modeling techniques-have become increasingly feasible. Alternative Breast Imaging: Four Model-Based Approaches explores our research on four such modalities, particularly with regard to imaging of the breast: (1) MR elastography (MRE), (2) electrical impedance spectroscopy (EIS), (3) microwave imaging spectroscopy (MIS), and (4) near infrared spectroscopic imaging (NIS).
All of Nonparametric Statistics
The goal of this text is to provide the reader with a single book where they can find a brief account of many, modern topics in nonparametric inference. The book is aimed at Master's level or Ph.D. level students in statistics, computer science, and engineering. It is also suitable for researchers who want to get up to speed quickly on modern nonparametric methods.This text covers a wide range of topics including: the bootstrap, the nonparametric delta method, nonparametric regression, density estimation, orthogonal function methods, minimax estimation, nonparametric confidence sets, and wavelets. The book has a mixture of methods and theory.
Algoritmi : Lo spirito dell’informatica = Algorithms : The spirit of information technology
Algorithms are the heart of computer science and mathematics, since without them the use of computers would not be possible. In this book, which in its English edition has been a longtime bestseller, Harel and Feldmann answer all questions relating to this topic. They talk about the evaluation, correctness and effectiveness of algorithms, but also clarify some doubts about programming techniques and also refer to the very current discussion on quantum computing. The book is useful both as a basic text for an introductory university course in computer science, and as a general introduction to natural sciences, mathematics or engineering.
Algorithms on Trees and Graphs : With Python Code
Introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Centered around the fundamental issue of graph isomorphism, the content goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference. Furthermore, Python code for all algorithms presented is given in an appendix. Topics and features: Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode / Correctness proofs are given, together with a worst-case analysis of the algorithms / Full implementation of all the algorithms in Python / An extensive chapter is devoted to the algorithmic techniques used in the book / Solutions to all the problems
Algorithms in Invariant Theory
The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions.
Algorithms in Bioinformatics ; Vol.4175 : 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings
This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms in Bioinformatics, WABI 2006, held in Zurich, Switzerland in September 2006 in the course of the ALGO 2006 conference meetings. The 36 revised full papers presented were carefully reviewed and selected from 100 submissions. All current issues of algorithms in bioinformatics are addressed, ranging from mathematical tools to experimental studies of approximation algorithms and reports on significant computational analyses. Numerous biological problems are dealt with, including genetic mapping, sequence alignment and sequence analysis, phylogeny, comparative genomics, and protein structure. For the first time also machine-learning approaches along with combinatorial optimization are covered.
Algorithms in Bioinformatics ; Vol. 3692 ; 5th international workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings
this book present the proceedings of the 5th Workshop on Algorithmsin Bioinformatics (WABI 2005) which took place in Spain, 2005. The Workshop on Algorithms in Bioinformatics highlights research workspecifically developed to address algorithmic problems in biosequence analysis. The emphasis is therefore on statistical and probabilistic algorithms that addressimportant problems in the field of molecular and structural biology. the workshop aims to present recent research results, includingsignificant work in progress, and to identify and explore directions of futureresearch.Original research papers (including significant work in progress) or state-of-the-art surveys were solicited on all aspects of algorithms in bioinformatics,including, but not limited to: exact and approximate algorithms for genomics,genetics, sequence analysis, gene and signal recognition, alignment, molecularevolution, phylogenetics, structure determination or prediction, gene expressionand gene networks, proteomics, functional genomics, and drug design.
Algorithms in Bioinformatics ; 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting.
Algorithms in Bioinformatics ; 7th International Workshop, WABI 2007, Philadelphia, PA, USA, September 8-9, 2007, Proceedings
All current issues of algorithms in bioinformatics are addressed, ranging from mathematical tools to experimental studies of approximation algorithms and reports on significant computational analyses. Numerous biological problems are dealt with, including genetic mapping, sequence alignment and sequence analysis, phylogeny, comparative genomics, and protein structure. Furthermore the papers feature high-performance computing approaches to computationally hard learning and optimization problems in bioinformatics and cover methods, software and dataset repositories for development and testing of such algorithms and their underlying models.
Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
Algorithms and Programming : Problems and Solutions
This book containing classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more.
Algorithms and Models for the Web-Graph ; 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings
The book address a wide variety of topics related to the study of the Web-graph such as random graph models for the Web-graph, PageRank analysis and computation, decentralized search, local partitioning algorithms,and traceroute sampling. The Web-graph has been the focal point of a tremendous amount of research for more than a decade. The view of the Web as a graph has great practical importance and has also generated much interesting theoretical work.
Algorithms and Models for the Web-Graph ; 4th International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers
his book constitutes the revised papers of the Fourth International Workshop on Algorithms and Models for the Web-Graph, WAW 2006, held in Banff, Canada, November 30 - December 1, 2006.
Algorithms and data structures for massive datasets
Learn: Probabilistic sketching data structures for practical problems Choosing the right database engine for your application Evaluating and designing efficient on-disk data structures and algorithms Understanding the algorithmic trade-offs involved in massive-scale systems Deriving basic statistics from streaming data Correctly sampling streaming data Computing percentiles with limited space resources Algorithms and Data Structures for Massive Datasets reveals a toolbox of new methods that are perfect for handling modern big data applications. You'll explore the novel data structures and algorithms that underpin Google, Facebook, and other enterprise applications that work with truly massive amounts of data. These effective techniques can be applied to any discipline, from finance to text analysis. Graphics, illustrations, and hands-on industry examples make complex ideas practical to implement in your projects--and there's no mathematical proofs to puzzle over. Work through this one-of-a-kind guide, and you'll find the sweet spot of saving space without sacrificing your data's accuracy. About the Technology Standard algorithms and data structures may become slow--or fail altogether--when applied to large distributed datasets. Choosing algorithms designed for big data saves time, increases accuracy, and reduces processing cost.
Algorithms and data structures ; 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
The papers in this volume were presented at the 9th Workshop on Algorithmsand Data Structures (WADS 2005). at the University of Waterloo, Waterloo, Canada. The workshopalternates with the Scandinavian Workshop on Algorithm Theory (SWAT), con-tinuing the tradition of SWAT and WADS starting with SWAT 1988 and WADS1989. From 90 submissions, the Program Committee selected 37 papers for pre-sentation at the workshop. includ Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Computer Graphics Numeric Computing
Algorithms and data structures ; 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures.
