- Table View
- List View
Approaches for Science Illustration and Communication (Biomedical Visualization #4)
by Mark RoughleyThis edited book explores the breadth of approaches undertaken by scientists, artists and communicators in their crucial role making science accessible, engaging and impactful. Contemporary approaches in science illustration and visualization include a variety of creative methodologies that are valuable for effective communication, teaching, learning and professional practice. These range in method from anatomical drawings used in medical curricula, to 2D animations and editorial illustrations available in the public realm. They also include unexpected approaches such as the use of tabletop board games, comics and collage in understanding our bodies, emergent health threats and cutting-edge science developments. If you are a scientist seeking to enhance your ability to communicate your research or an artist interested in biomedical visualization, this volume serves as an introduction to contemporary approaches in science illustration and communication. By understanding the creative methods and techniques employed in this field, we can collectively work towards fostering a deeper appreciation of art in science, and continue to captivate and inspire audiences worldwide.
Approaches in Integrative Bioinformatics: Towards the Virtual Cell
by Ming Chen Ralf HofestädtApproaches in Integrative Bioinformatics provides a basic introduction to biological information systems, as well as guidance for the computational analysis of systems biology. This book also covers a range of issues and methods that reveal the multitude of omics data integration types and the relevance that integrative bioinformatics has today. Topics include biological data integration and manipulation, modeling and simulation of metabolic networks, transcriptomics and phenomics, and virtual cell approaches, as well as a number of applications of network biology. It helps to illustrate the value of integrative bioinformatics approaches to the life sciences. This book is intended for researchers and graduate students in the field of Bioinformatics. Professor Ming Chen is the Director of the Bioinformatics Laboratory at the College of Life Sciences, Zhejiang University, Hangzhou, China. Professor Ralf Hofestädt is the Chair of the Department of Bioinformatics and Medical Informatics, Bielefeld University, Germany.
Approaches, Opportunities, and Challenges for Eco-design 4.0: A Concise Guide for Practitioners and Students
by Samira KeivanpourThis book addresses the implications of the Industry 4.0 paradigm in design for the environment. We examine the opportunities for, and challenges of, the implications of cyber-physical systems, big data analytics, Internet of things, additive manufacturing, and simulation in a range of areas in an eco-design context. These include selecting low impact materials, choosing manufacturing processes with environmental considerations, end of life strategies, applying design approaches for disassembly, integrating economic and social components into environmental studies, and stakeholder’s involvement. This volume takes a step toward this journey to explore how the three pillars of technology, sustainability, and evolving consumers could shape the future of the product’s design.
Approaches to Geo-mathematical Modelling: New Tools for Complexity Science
by Alan WilsonGeo-mathematical modelling: models from complexity science Sir Alan Wilson, Centre for Advanced Spatial Analysis, University College London Mathematical and computer models for a complexity science tool kit Geographical systems are characterised by locations, activities at locations, interactions between them and the infrastructures that carry these activities and flows. They can be described at a great variety of scales, from individuals and organisations to countries. Our understanding, often partial, of these entities, and in many cases this understanding is represented in theories and associated mathematical models. In this book, the main examples are models that represent elements of the global system covering such topics as trade, migration, security and development aid together with examples at finer scales. This provides an effective toolkit that can not only be applied to global systems, but more widely in the modelling of complex systems. All complex systems involve nonlinearities involving path dependence and the possibility of phase changes and this makes the mathematical aspects particularly interesting. It is through these mechanisms that new structures can be seen to 'emerge', and hence the current notion of 'emergent behaviour'. The range of models demonstrated include account-based models and biproportional fitting, structural dynamics, space-time statistical analysis, real-time response models, Lotka-Volterra models representing 'war', agent-based models, epidemiology and reaction-diffusion approaches, game theory, network models and finally, integrated models. Geo-mathematical modelling: Presents mathematical models with spatial dimensions. Provides representations of path dependence and phase changes. Illustrates complexity science using models of trade, migration, security and development aid. Demonstrates how generic models from the complexity science tool kit can each be applied in a variety of situations This book is for practitioners and researchers in applied mathematics, geography, economics, and interdisciplinary fields such as regional science and complexity science. It can also be used as the basis of a modelling course for postgraduate students.
Approaches to Mixed Methods Research (Quantitative Applications in the Social Sciences)
by Lisa D. Pearce Jessica Halliday HardieApproaches to Mixed Methods Research focuses on the choices social scientists make when designing a study that mixes quantitative and qualitative data. Authors Lisa D. Pearce and Jessica Halliday Hardie explore ways to weave together strands of research using qualitative and quantitative data to speak to and enhance each other; a strand being a series of steps involved in collecting and analyzing a single type of data. The result, they show, is a more holistic body of evidence that emerges, and they illustrate this with examples from a wide range of studies from the United States and other countries.
Approaches to Mixed Methods Research (Quantitative Applications in the Social Sciences)
by Lisa D. Pearce Jessica Halliday HardieApproaches to Mixed Methods Research focuses on the choices social scientists make when designing a study that mixes quantitative and qualitative data. Authors Lisa D. Pearce and Jessica Halliday Hardie explore ways to weave together strands of research using qualitative and quantitative data to speak to and enhance each other; a strand being a series of steps involved in collecting and analyzing a single type of data. The result, they show, is a more holistic body of evidence that emerges, and they illustrate this with examples from a wide range of studies from the United States and other countries.
Approaches to Qualitative Research in Mathematics Education: Examples of Methodology and Methods (Advances in Mathematics Education)
by Norma Presmeg Angelika Bikner-Ahsbahs Christine KnippingThis volume documents a range of qualitative research approaches emerged within mathematics education over the last three decades, whilst at the same time revealing their underlying methodologies. Continuing the discussion as begun in the two 2003 ZDM issues dedicated to qualitative empirical methods, this book presents astate of the art overview on qualitative research in mathematics education and beyond. The structure of the book allows the reader to use it as an actual guide for the selection of an appropriate methodology, on a basis of both theoretical depth and practical implications. The methods and examples illustrate how different methodologies come to life when applied to a specific question in a specific context. Many of the methodologies described are also applicable outside mathematics education, but the examples provided are chosen so as to situate the approach in a mathematical context.
Approaching Infinity
by Michael HuemerApproaching Infinity addresses seventeen paradoxes of the infinite, most of which have no generally accepted solutions. The book addresses these paradoxes using a new theory of infinity, which entails that an infinite series is uncompletable when it requires something to possess an infinite intensive magnitude. Along the way, the author addresses the nature of numbers, sets, geometric points, and related matters. The book addresses the need for a theory of infinity, and reviews both old and new theories of infinity. It discussing the purposes of studying infinity and the troubles with traditional approaches to the problem, and concludes by offering a solution to some existing paradoxes.
Approaching Multivariate Analysis, 2nd Edition: A Practical Introduction
by Pat Dugard John Todman Harry StainesThis fully updated new edition not only provides an introduction to a range of advanced statistical techniques that are used in psychology, but has been expanded to include new chapters describing methods and examples of particular interest to medical researchers. It takes a very practical approach, aimed at enabling readers to begin using the methods to tackle their own problems. This book provides a non-mathematical introduction to multivariate methods, with an emphasis on helping the reader gain an intuitive understanding of what each method is for, what it does and how it does it. The first chapter briefly reviews the main concepts of univariate and bivariate methods and provides an overview of the multivariate methods that will be discussed, bringing out the relationships among them, and summarising how to recognise what types of problem each of them may be appropriate for tackling. In the remaining chapters, introductions to the methods and important conceptual points are followed by the presentation of typical applications from psychology and medicine, using examples with fabricated data. Instructions on how to do the analyses and how to make sense of the results are fully illustrated with dialogue boxes and output tables from SPSS, as well as details of how to interpret and report the output, and extracts of SPSS syntax and code from relevant SAS procedures. This book gets students started, and prepares them to approach more comprehensive treatments with confidence. This makes it an ideal text for psychology students, medical students and students or academics in any discipline that uses multivariate methods.
Approaching the Kannan-Lovász-Simonovits and Variance Conjectures (Lecture Notes in Mathematics #2131)
by David Alonso-Gutiérrez Jesús BasteroFocusing on two central conjectures of Asymptotic Geometric Analysis, the Kannan-Lovász-Simonovits spectral gap conjecture and the variance conjecture, these Lecture Notes present the theory in an accessible way, so that interested readers, even those who are not experts in the field, will be able to appreciate the treated topics. Offering a presentation suitable for professionals with little background in analysis, geometry or probability, the work goes directly to the connection between isoperimetric-type inequalities and functional inequalities, giving the interested reader rapid access to the core of these conjectures. In addition, four recent and important results in this theory are presented in a compelling way. The first two are theorems due to Eldan-Klartag and Ball-Nguyen, relating the variance and the KLS conjectures, respectively, to the hyperplane conjecture. Next, the main ideas needed prove the best known estimate for the thin-shell width given by Guédon-Milman and an approach to Eldan's work on the connection between the thin-shell width and the KLS conjecture are detailed.
Approximate Analytical Methods for Solving Ordinary Differential Equations
by T.S.L Radhika T. Iyengar T. RaniApproximate Analytical Methods for Solving Ordinary Differential Equations (ODEs) is the first book to present all of the available approximate methods for solving ODEs, eliminating the need to wade through multiple books and articles. It covers both well-established techniques and recently developed procedures, including the classical series solut
Approximate Dynamic Programming
by Warren B. PowellPraise for the First Edition"Finally, a book devoted to dynamic programming and written using the language of operations research (OR)! This beautiful book fills a gap in the libraries of OR specialists and practitioners."--Computing ReviewsThis new edition showcases a focus on modeling and computation for complex classes of approximate dynamic programming problemsUnderstanding approximate dynamic programming (ADP) is vital in order to develop practical and high-quality solutions to complex industrial problems, particularly when those problems involve making decisions in the presence of uncertainty. Approximate Dynamic Programming, Second Edition uniquely integrates four distinct disciplines--Markov decision processes, mathematical programming, simulation, and statistics--to demonstrate how to successfully approach, model, and solve a wide range of real-life problems using ADP.The book continues to bridge the gap between computer science, simulation, and operations research and now adopts the notation and vocabulary of reinforcement learning as well as stochastic search and simulation optimization. The author outlines the essential algorithms that serve as a starting point in the design of practical solutions for real problems. The three curses of dimensionality that impact complex problems are introduced and detailed coverage of implementation challenges is provided. The Second Edition also features:A new chapter describing four fundamental classes of policies for working with diverse stochastic optimization problems: myopic policies, look-ahead policies, policy function approximations, and policies based on value function approximationsA new chapter on policy search that brings together stochastic search and simulation optimization concepts and introduces a new class of optimal learning strategiesUpdated coverage of the exploration exploitation problem in ADP, now including a recently developed method for doing active learning in the presence of a physical state, using the concept of the knowledge gradientA new sequence of chapters describing statistical methods for approximating value functions, estimating the value of a fixed policy, and value function approximation while searching for optimal policiesThe presented coverage of ADP emphasizes models and algorithms, focusing on related applications and computation while also discussing the theoretical side of the topic that explores proofs of convergence and rate of convergence. A related website features an ongoing discussion of the evolving fields of approximation dynamic programming and reinforcement learning, along with additional readings, software, and datasets.Requiring only a basic understanding of statistics and probability, Approximate Dynamic Programming, Second Edition is an excellent book for industrial engineering and operations research courses at the upper-undergraduate and graduate levels. It also serves as a valuable reference for researchers and professionals who utilize dynamic programming, stochastic programming, and control theory to solve problems in their everyday work.
Approximate Fixed Points of Nonexpansive Mappings (Developments in Mathematics #80)
by Alexander J. ZaslavskiFixed point theory of nonlinear operators has been a rapidly growing area of research and plays an important role in the study of variational inequalities, monotone operators, feasibility problems, and optimization theory, to name just several. This book discusses iteration processes associated with a given nonlinear mapping which generate its approximate fixed point and in some cases converge to a fixed point of the mapping. Various classes of nonlinear single-valued and set-valued mappings are considered along with iteration processes under the presence of computational errors. Of particular interest to mathematicians working in fixed point theory and nonlinear analysis, the added value for the reader are the solutions presented to a number of difficult problems in the fixed point theory which have important applications.
Approximate Iterative Algorithms
by Anthony Louis AlmudevarIterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such
Approximate Solutions of Common Fixed-Point Problems (Springer Optimization and Its Applications #112)
by Alexander J. ZaslavskiThis book presents results on theconvergence behavior of algorithms which are known as vital tools for solvingconvex feasibility problems and common fixed point problems. The main goal forus in dealing with a known computational error is to find what approximatesolution can be obtained and how many iterates one needs to find it. Accordingto know results, these algorithms should converge to a solution. In thisexposition, these algorithms are studied, taking into account computationalerrors which remain consistent in practice. In this case the convergence to asolution does not take place. We show that our algorithms generate a goodapproximate solution if computational errors are bounded from above by a smallpositive constant. Beginning with an introduction, this monograph moves onto study: · dynamicstring-averaging methods for common fixed point problems in a Hilbert space · dynamicstring methods for common fixed point problems in a metric space · dynamicstring-averaging version of the proximal algorithm · common fixedpoint problems in metric spaces · common fixedpoint problems in the spaces with distances of the Bregman type · a proximalalgorithm for finding a common zero of a family of maximal monotone operators · subgradientprojections algorithms for convex feasibility problems in Hilbert spaces
Approximating Perfection
by Michael J. Cloud Leonid P. LebedevThis is a book for those who enjoy thinking about how and why Nature can be described using mathematical tools. Approximating Perfection considers the background behind mechanics as well as the mathematical ideas that play key roles in mechanical applications. Concentrating on the models of applied mechanics, the book engages the reader in the types of nuts-and-bolts considerations that are normally avoided in formal engineering courses: how and why models remain imperfect, and the factors that motivated their development. The opening chapter reviews and reconsiders the basics of calculus from a fully applied point of view; subsequent chapters explore selected topics from solid mechanics, hydrodynamics, and the natural sciences. Emphasis is placed on the logic that underlies modeling in mechanics and the many surprising parallels that exist between seemingly diverse areas. The mathematical demands on the reader are kept to a minimum, so the book will appeal to a wide technical audience.
Approximation and Online Algorithms: 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers (Lecture Notes in Computer Science #11926)
by Evripidis Bampis Nicole MegowThis book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
Approximation and Online Algorithms: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers (Lecture Notes in Computer Science #8952)
by Evripidis Bampis Ola SvenssonThis book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wrocław, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings (Lecture Notes in Computer Science #15269)
by Marcin Bieńkowski Matthias EnglertThis book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5–6, 2024. The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.
Approximation and Online Algorithms: 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings (Lecture Notes in Computer Science #14297)
by Jarosław Byrka Andreas WieseThis book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems
Approximation and Online Algorithms: 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers (Lecture Notes in Computer Science #10138)
by Klaus Jansen Monaldo MastrolilliThis book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event. The 23 revised full papers presented were carefully reviewed and selected from 58 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, echanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques, real-world applications, and scheduling problems.
Approximation and Online Algorithms: 4th International Workshop, Waoa 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers (Lecture Notes In Computer Science Ser. #4368)
by Christos Kaklamanis Asaf LevinThis book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. <P><P> The 15 revised full papers presented this book were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2018 were graph algorithms, inapproximability results, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems, algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational -finance, cuts and connectivity, geometric problems, mechanism design, resource augmentation, real-world applications. Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Approximation and Online Algorithms: 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers (Lecture Notes in Computer Science #9499)
by Martin Skutella Laura SanitàThis book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.
Approximation and Optimization: Algorithms, Complexity and Applications (Springer Optimization and Its Applications #145)
by Ioannis C. Demetriou Panos M. PardalosThis book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading experts and reflect emerging directions and connections in data approximation and optimization. Chapters discuss state of the art topics with highly relevant applications throughout science, engineering, technology and social sciences. Academics, researchers, data science practitioners, business analysts, social sciences investigators and graduate students will find the number of illustrations, applications, and examples provided useful. This volume is based on the conference Approximation and Optimization: Algorithms, Complexity, and Applications, which was held in the National and Kapodistrian University of Athens, Greece, June 29–30, 2017. The mix of survey and research content includes topics in approximations to discrete noisy data; binary sequences; design of networks and energy systems; fuzzy control; large scale optimization; noisy data; data-dependent approximation; networked control systems; machine learning ; optimal design; no free lunch theorem; non-linearly constrained optimization; spectroscopy.
Approximation by Max-Product Type Operators
by Sorin G. Gal Barnabás Bede Lucian CoroianuThis monograph presents a broad treatment of developments in an area of constructive approximation involving the so-called "max-product" type operators. The exposition highlights the max-product operators as those which allow one to obtain, in many cases, more valuable estimates than those obtained by classical approaches. The text considers a wide variety of operators which are studied for a number of interesting problems such as quantitative estimates, convergence, saturation results, localization, to name several. Additionally, the book discusses the perfect analogies between the probabilistic approaches of the classical Bernstein type operators and of the classical convolution operators (non-periodic and periodic cases), and the possibilistic approaches of the max-product variants of these operators. These approaches allow for two natural interpretations of the max-product Bernstein type operators and convolution type operators: firstly, as possibilistic expectations of some fuzzy variables, and secondly, as bases for the Feller type scheme in terms of the possibilistic integral. These approaches also offer new proofs for the uniform convergence based on a Chebyshev type inequality in the theory of possibility. Researchers in the fields of approximation of functions, signal theory, approximation of fuzzy numbers, image processing, and numerical analysis will find this book most beneficial. This book is also a good reference for graduates and postgraduates taking courses in approximation theory.