This book brings together the latest research in this new and exciting area of visualization, looking at classifying and modelling cognitive biases, together with user studies which reveal their undesirable impact on human judgement, and demonstrating how visual analytic techniques can provide effective support for mitigating key biases. A comprehensive coverage of this very relevant topic is provided though this collection of extended papers from the successful DECISIVe workshop at IEEE VIS, together with an introduction to cognitive biases and an invited chapter from a leading expert in intelligence analysis. Cognitive Biases in Visualizations will be of interest to a wide audience from those studying cognitive biases to visualization designers and practitioners. It offers a choice of research frameworks, help with the design of user studies, and proposals for the effective measurement of biases. The impact of human visualization literacy, competence and human cognition on cognitive biases are also examined, as well as the notion of system-induced biases. The well referenced chapters provide an excellent starting point for gaining an awareness of the detrimental effect that some cognitive biases can have on users' decision-making. Human behavior is complex and we are only just starting to unravel the processes involved and investigate ways in which the computer can assist, however the final section supports the prospect that visual analytics, in particular, can counter some of the more common cognitive errors, which have been proven to be so costly.

This edited volume presents advances in modeling and computational analysis techniques related to networks and online communities. It contains the best papers of notable scientists from the 4th European Network Intelligence Conference (ENIC 2017) that have been peer reviewed and expanded into the present format. The aim of this text is to share knowledge and experience as well as to present recent advances in the field. The book is a nice mix of basic research topics such as data-based centrality measures along with intriguing applied topics, for example, interaction decay patterns in online social communities. This book will appeal to students, professors, and researchers working in the fields of data science, computational social science, and social network analysis.

This book reports on advanced concepts in fuzzy graph theory, showing a set of tools that can be successfully applied to understanding and modeling illegal human trafficking. Building on the previous book on fuzzy graph by the same authors, which set the fundamentals for readers to understand this developing field of research, this second book gives a special emphasis to applications of the theory. For this, authors introduce new concepts, such as intuitionistic fuzzy graphs, the concept of independence and domination in fuzzy graphs, as well as directed fuzzy networks, incidence graphs and many more.

A key element of any modern video codec is the efficient exploitation of temporal redundancy via motion-compensated prediction. In this book, a novel paradigm of representing and employing motion information in a video compression system is described that has several advantages over existing approaches. Traditionally, motion is estimated, modelled, and coded as a vector field at the target frame it predicts. While this "prediction-centric" approach is convenient, the fact that the motion is "attached" to a specific target frame implies that it cannot easily be re-purposed to predict or synthesize other frames, which severely hampers temporal scalability. In light of this, the present book explores the possibility of anchoring motion at reference frames instead. Key to the success of the proposed "reference-based" anchoring schemes is high quality motion inference, which is enabled by the use of a more "physical" motion representation than the traditionally employed "block" motion fields. The resulting compression system can support computationally efficient, high-quality temporal motion inference, which requires half as many coded motion fields as conventional codecs. Furthermore, "features" beyond compressibility - including high scalability, accessibility, and "intrinsic" framerate upsampling - can be seamlessly supported. These features are becoming ever more relevant as the way video is consumed continues shifting from the traditional broadcast scenario to interactive browsing of video content over heterogeneous networks. This book is of interest to researchers and professionals working in multimedia signal processing, in particular those who are interested in next-generation video compression. Two comprehensive background chapters on scalable video compression and temporal frame interpolation make the book accessible for students and newcomers to the field.

This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open questions and suggestions for further reading.

This book provides the basis of a formal language and explores its possibilities in the characterization of multiplex networks. Armed with the formalism developed, the authors define structural metrics for multiplex networks. A methodology to generalize monoplex structural metrics to multiplex networks is also presented so that the reader will be able to generalize other metrics of interest in a systematic way. Therefore, this book will serve as a guide for the theoretical development of new multiplex metrics. Furthermore, this Brief describes the spectral properties of these networks in relation to concepts from algebraic graph theory and the theory of matrix polynomials. The text is rounded off by analyzing the different structural transitions present in multiplex systems as well as by a brief overview of some representative dynamical processes. Multiplex Networks will appeal to students, researchers, and professionals within the fields of network science, graph theory, and data science.

This treatise presents an integrated perspective on the interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. Features: explores the interrelationships between sets and graphs and their applications to finite combinatorics; introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a discussion on set universes; explains how sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs; investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets; presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant; contains numerous exercises, examples, definitions, problems and insight panels.

Orthogonal designs have proved fundamental to constructing code division multiple antenna systems for more efficient mobile communications. Starting with basic theory, this book develops the algebra and combinatorics to create new communications modes. Intended primarily for researchers, it is also useful for graduate students wanting to understand some of the current communications coding theories.

This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors' favorite conjectures and open problems, enhancing the reader's overall comprehension and enthusiasm. The editors were inspired to create these volumes by the popular and well attended special sessions, entitled "My Favorite Graph Theory Conjectures," which were held at the winter AMS/MAA Joint Meeting in Boston (January, 2012), the SIAM Conference on Discrete Mathematics in Halifax (June,2012) and the winter AMS/MAA Joint meeting in Baltimore(January, 2014). In an effort to aid in the creation and dissemination of open problems, which is crucial to the growth and development of a field, the editors requested the speakers, as well as notable experts in graph theory, to contribute to these volumes.

This valuable source for graduate students and researchers provides a comprehensive introduction to current theories and applications in optimization methods and network models. Contributions to this book are focused on new efficient algorithms and rigorous mathematical theories, which can be used to optimize and analyze mathematical graph structures with massive size and high density induced by natural or artificial complex networks. Applications to social networks, power transmission grids, telecommunication networks, stock market networks, and human brain networks are presented. Chapters in this book cover the following topics: Linear max min fairness Heuristic approaches for high-quality solutions Efficient approaches for complex multi-criteria optimization problems Comparison of heuristic algorithms New heuristic iterative local search Power in network structures Clustering nodes in random graphs Power transmission grid structure Network decomposition problems Homogeneity hypothesis testing Network analysis of international migration Social networks with node attributes Testing hypothesis on degree distribution in the market graphs Machine learning applications to human brain network studies This proceeding is a result of The 6th International Conference on Network Analysis held at the Higher School of Economics, Nizhny Novgorod in May 2016. The conference brought together scientists and engineers from industry, government, and academia to discuss the links between network analysis and a variety of fields.

This book discusses research, methods, and recent developments in the interdisciplinary field that spans research in visualization, eye tracking, human-computer interaction, and psychology. It presents extended versions of papers from the First Workshop on Eye Tracking and Visualization (ETVIS), which was organized as a workshop of the IEEE VIS Conference 2015. Topics include visualization and visual analytics of eye-tracking data, metrics and cognitive models, eye-tracking experiments in the context of visualization interfaces, and eye tracking in 3D and immersive environments. The extended ETVIS papers are complemented by a chapter offering an overview of visualization approaches for analyzing eye-tracking data and a chapter that discusses electrooculography (EOG) as an alternative of acquiring information about eye movements. Covering scientific visualization, information visualization, and visual analytics, this book is a valuable resource for eye-tracking researchers within the visualization community.

This book constitutes the proceedings of the 24th International Conference on Computing and Combinatorics, COCOON 2018, held in Qing Dao, China, in July 2018. The 62 papers presented in this volume were carefully reviewed and selected from 120 submissions. They deal with the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing.

This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomised algorithms, algorithms for big data analytics, and new paradigms of computation.

This text is intended for an honors calculus course or for an introduction to analysis. Involving rigorous analysis, computational dexterity, and a breadth of applications, it is ideal for undergraduate majors. This third edition includes corrections as well as some additional material. Some features of the text include: The text is completely self-contained and starts with the real number axioms; The integral is defined as the area under the graph, while the area is defined for every subset of the plane; There is a heavy emphasis on computational problems, from the high-school quadratic formula to the formula for the derivative of the zeta function at zero; There are applications from many parts of analysis, e.g., convexity, the Cantor set, continued fractions, the AGM, the theta and zeta functions, transcendental numbers, the Bessel and gamma functions, and many more; Traditionally transcendentally presented material, such as infinite products, the Bernoulli series, and the zeta functional equation, is developed over the reals; and There are 385 problems with all the solutions at the back of the text.

This book is the second edition of the third and last volume of a treatise on projective spaces over a finite field, also known as Galois geometries. This volume completes the trilogy comprised of plane case (first volume) and three dimensions (second volume). This revised edition includes much updating and new material. It is a mostly self-contained study of classical varieties over a finite field, related incidence structures and particular point sets in finite n-dimensional projective spaces. General Galois Geometries is suitable for PhD students and researchers in combinatorics and geometry. The separate chapters can be used for courses at postgraduate level.

The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The "Fourth International Conference in Network Analysis," held at the Higher School of Economics, Nizhny Novgorod in May 2014, initiated joint research between scientists, engineers and researchers from academia, industry and government; the major results of conference participants have been reviewed and collected in this Work. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis.

The contributions in this volume aim to deepen understanding of some of the current research problems and theories in modern topics such as calculus of variations, optimization theory, complex analysis, real analysis, differential equations, and geometry. Applications to these areas of mathematics are presented within the broad spectrum of research in Engineering Science with particular emphasis on equilibrium problems, complexity in numerical optimization, dynamical systems, non-smooth optimization, complex network analysis, statistical models and data mining, and energy systems. Additional emphasis is given to interdisciplinary research, although subjects are treated in a unified and self-contained manner. The presentation of methods, theory and applications makes this tribute an invaluable reference for teachers, researchers, and other professionals interested in pure and applied research, philosophy of mathematics, and mathematics education. Some review papers published in this volume will be particularly useful for a broader audience of readers as well as for graduate students who search for the latest information. Constantin Caratheodory's wide-ranging influence in the international mathematical community was seen during the first Fields Medals awards at the International Congress of Mathematicians, Oslo, 1936. Two medals were awarded, one to Lars V. Ahlfors and one to Jesse Douglass. It was Caratheodory who presented both their works during the opening of the International Congress. This volume contains significant papers in Science and Engineering dedicated to the memory of Constantin Caratheodory and the spirit of his mathematical influence.

This book gives a detailed survey of the main results on bent functions over finite fields, presents a systematic overview of their generalizations, variations and applications, considers open problems in classification and systematization of bent functions, and discusses proofs of several results. This book uniquely provides a necessary comprehensive coverage of bent functions.It serves as a useful reference for researchers in discrete mathematics, coding and cryptography. Students and professors in mathematics and computer science will also find the content valuable, especially those interested in mathematical foundations of cryptography. It can be used as a supplementary text for university courses on discrete mathematics, Boolean functions, or cryptography, and is appropriate for both basic classes for under-graduate students and advanced courses for specialists in cryptography and mathematics.

Stochastic geometry is the branch of mathematics that studies geometric structures associated with random configurations, such as random graphs, tilings and mosaics. Due to its close ties with stereology and spatial statistics, the results in this area are relevant for a large number of important applications, e.g. to the mathematical modeling and statistical analysis of telecommunication networks, geostatistics and image analysis. In recent years - due mainly to the impetus of the authors and their collaborators - a powerful connection has been established between stochastic geometry and the Malliavin calculus of variations, which is a collection of probabilistic techniques based on the properties of infinite-dimensional differential operators. This has led in particular to the discovery of a large number of new quantitative limit theorems for high-dimensional geometric objects. This unique book presents an organic collection of authoritative surveys written by the principal actors in this rapidly evolving field, offering a rigorous yet lively presentation of its many facets.

This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups. The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a workshop in connection with the research project Thales on Algebraic Modeling of Topological and Computational Structures and Applications, held at the National Technical University of Athens, Greece in July 2015. The reader will benefit from the innovative approaches to tackling difficult questions in topology, applications and interrelated research areas, which largely employ algebraic tools.

This volume collects contributions by leading experts in the area of commutative algebra related to the INdAM meeting "Homological and Computational Methods in Commutative Algebra" held in Cortona (Italy) from May 30 to June 3, 2016 . The conference and this volume are dedicated to Winfried Bruns on the occasion of his 70th birthday. In particular, the topics of this book strongly reflect the variety of Winfried Bruns' research interests and his great impact on commutative algebra as well as its applications to related fields. The authors discuss recent and relevant developments in algebraic geometry, commutative algebra, computational algebra, discrete geometry and homological algebra. The book offers a unique resource, both for young and more experienced researchers seeking comprehensive overviews and extensive bibliographic references.

This volume presents recent advances in the field of matrix analysis based on contributions at the MAT-TRIAD 2015 conference. Topics covered include interval linear algebra and computational complexity, Birkhoff polynomial basis, tensors, graphs, linear pencils, K-theory and statistic inference, showing the ubiquity of matrices in different mathematical areas. With a particular focus on matrix and operator theory, statistical models and computation, the International Conference on Matrix Analysis and its Applications 2015, held in Coimbra, Portugal, was the sixth in a series of conferences. Applied and Computational Matrix Analysis will appeal to graduate students and researchers in theoretical and applied mathematics, physics and engineering who are seeking an overview of recent problems and methods in matrix analysis.

This book constitutes the refereed post-conference proceedings of the 28th International Workshopon Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms.

This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute for Mathematics and its Applications during Fall 2014, when combinatorics was the focus. Leading experts have written surveys of research problems, making state of the art results more conveniently and widely available. The three-part structure of the volume reflects the three workshops held during Fall 2014. In the first part, topics on extremal and probabilistic combinatorics are presented; part two focuses on additive and analytic combinatorics; and part three presents topics in geometric and enumerative combinatorics. This book will be of use to those who research combinatorics directly or apply combinatorial methods to other fields.

This text is an introduction to harmonic analysis on symmetric spaces, focusing on advanced topics such as higher rank spaces, positive definite matrix space and generalizations. It is intended for beginning graduate students in mathematics or researchers in physics or engineering. As with the introductory book entitled "Harmonic Analysis on Symmetric Spaces - Euclidean Space, the Sphere, and the Poincare Upper Half Plane, the style is informal with an emphasis on motivation, concrete examples, history, and applications. The symmetric spaces considered here are quotients X=G/K, where G is a non-compact real Lie group, such as the general linear group GL(n,P) of all n x n non-singular real matrices, and K=O(n), the maximal compact subgroup of orthogonal matrices. Other examples are Siegel's upper half "plane" and the quaternionic upper half "plane". In the case of the general linear group, one can identify X with the space Pn of n x n positive definite symmetric matrices. Many corrections and updates have been incorporated in this new edition. Updates include discussions of random matrix theory and quantum chaos, as well as recent research on modular forms and their corresponding L-functions in higher rank. Many applications have been added, such as the solution of the heat equation on Pn, the central limit theorem of Donald St. P. Richards for Pn, results on densest lattice packing of spheres in Euclidean space, and GL(n)-analogs of the Weyl law for eigenvalues of the Laplacian in plane domains. Topics featured throughout the text include inversion formulas for Fourier transforms, central limit theorems, fundamental domains in X for discrete groups (such as the modular group GL(n,Z) of n x n matrices with integer entries and determinant +/-1), connections with the problem of finding densest lattice packings of spheres in Euclidean space, automorphic forms, Hecke operators, L-functions, and the Selberg trace formula and its applications in spectral theory as well as number theory.