Computational and theoretical open problems in optimization, computational geometry, data science, logistics, statistics, supply chain modeling, and data analysis are examined in this book. Each contribution provides the fundamentals needed to fully comprehend the impact of individual problems. Current theoretical, algorithmic, and practical methods used to circumvent each problem are provided to stimulate a new effort towards innovative and efficient solutions. Aimed towards graduate students and researchers in mathematics, optimization, operations research, quantitative logistics, data analysis, and statistics, this book provides a broad comprehensive approach to understanding the significance of specific challenging or open problems within each discipline. The contributions contained in this book are based on lectures focused on “Challenges and Open Problems in Optimization and Data Science” presented at the Deucalion Summer Institute for Advanced Studies in Optimization, Mathematics, and Data Science in August 2016.

Data mining of massive data sets is transforming the way we think about crisis response, marketing, entertainment, cybersecurity and national intelligence. Collections of documents, images, videos, and networks are being thought of not merely as bit strings to be stored, indexed, and retrieved, but as potential sources of discovery and knowledge, requiring sophisticated analysis techniques that go far beyond classical indexing and keyword counting, aiming to find relational and semantic interpretations of the phenomena underlying the data. Frontiers in Massive Data Analysis examines the frontier of analyzing massive amounts of data, whether in a static database or streaming through a system. Data at that scale-terabytes and petabytes-is increasingly common in science (e.g., particle physics, remote sensing, genomics), Internet commerce, business analytics, national security, communications, and elsewhere. The tools that work to infer knowledge from data at smaller scales do not necessarily work, or work well, at such massive scale. New tools, skills, and approaches are necessary, and this report identifies many of them, plus promising research directions to explore. Frontiers in Massive Data Analysis discusses pitfalls in trying to infer knowledge from massive data, and it characterizes seven major classes of computation that are common in the analysis of massive data. Overall, this report illustrates the cross-disciplinary knowledge-from computer science, statistics, machine learning, and application disciplines-that must be brought to bear to make useful inferences from massive data.

The volume LNCS 12393 constitutes the papers of the 22nd International Conference Big Data Analytics and Knowledge Discovery which will be held online in September 2020. The 15 full papers presented together with 14 short papers plus 1 position paper in this volume were carefully reviewed and selected from a total of 77 submissions. This volume offers a wide range to following subjects on theoretical and practical aspects of big data analytics and knowledge discovery as a new generation of big data repository, data pre-processing, data mining, text mining, sequences, graph mining, and parallel processing.

This book covers algorithm portfolios, multi-method schemes that harness optimization algorithms into a joint framework to solve optimization problems. It is expected to be a primary reference point for researchers and doctoral students in relevant domains that seek a quick exposure to the field. The presentation focuses primarily on the applicability of the methods and the non-expert reader will find this book useful for starting designing and implementing algorithm portfolios. The book familiarizes the reader with algorithm portfolios through current advances, applications, and open problems. Fundamental issues in building effective and efficient algorithm portfolios such as selection of constituent algorithms, allocation of computational resources, interaction between algorithms and parallelism vs. sequential implementations are discussed. Several new applications are analyzed and insights on the underlying algorithmic designs are provided. Future directions, new challenges, and open problems in the design of algorithm portfolios and applications are explored to further motivate research in this field.

The ten-volume set LNCS 12949 – 12958 constitutes the proceedings of the 21st International Conference on Computational Science and Its Applications, ICCSA 2021, which was held in Cagliari, Italy, during September 13 – 16, 2021. The event was organized in a hybrid mode due to the Covid-19 pandemic.The 466 full and 18 short papers presented in these proceedings were carefully reviewed and selected from 1588 submissions. The books cover such topics as multicore architectures, blockchain, mobile and wireless security, sensor networks, open source software, collaborative and social computing systems and tools, cryptography, applied mathematics human computer interaction, software design engineering, and others. Part IV of the set includes the papers on Urban and Regional Planning and the proceedings of the following workshops: ​International Workshop on Blockchain and Distributed Ledgers: Technologies and Applications (BDLTA 2021); International Workshop on Computational and Applied Mathematics (CAM 2021); International Workshop on Computational and Applied Statistics (CAS 2021); International Workshop on Computerized Evaluation of Economic Activities: Urban Spaces (CEEA 2021).The chapters "Automated Housing Price Valuation and Spatial Data", "Spatial Automated Valuation Model (sAVM) – From the Notion of Space to the Design of an Evaluation Tool", and "A MCDA/GIS-Based Approach for Evaluating Accessibility to Health Facilities" are published open access under a CC BY license (Creative Commons Attribution 4.0 International License).

This book provides a comprehensive picture of fog computing technology, including of fog architectures, latency aware application management issues with real time requirements, security and privacy issues and fog analytics, in wide ranging application scenarios such as M2M device communication, smart homes, smart vehicles, augmented reality and transportation management. This book explores the research issues involved in the application of traditional shallow machine learning and deep learning techniques to big data analytics. It surveys global research advances in extending the conventional unsupervised or clustering algorithms, extending supervised and semi-supervised algorithms and association rule mining algorithms to big data Scenarios. Further it discusses the deep learning applications of big data analytics to fields of computer vision and speech processing, and describes applications such as semantic indexing and data tagging. Lastly it identifies 25 unsolved research problems and research directions in fog computing, as well as in the context of applying deep learning techniques to big data analytics, such as dimensionality reduction in high-dimensional data and improved formulation of data abstractions along with possible directions for their solutions.

The work presented in this book is a combination of theoretical advancements of big data analysis, cloud computing, and their potential applications in scientific computing. The theoretical advancements are supported with illustrative examples and its applications in handling real life problems. The applications are mostly undertaken from real life situations. The book discusses major issues pertaining to big data analysis using computational intelligence techniques and some issues of cloud computing. An elaborate bibliography is provided at the end of each chapter. The material in this book includes concepts, figures, graphs, and tables to guide researchers in the area of big data analysis and cloud computing.

This handbook is an endeavour to cover many current, relevant, and essential topics related to decision sciences in a scientific manner. Using this handbook, graduate students, researchers, as well as practitioners from engineering, statistics, sociology, economics, etc. will find a new and refreshing paradigm shift as to how these topics can be put to use beneficially. Starting from the basics to advanced concepts, authors hope to make the readers well aware of the different theoretical and practical ideas, which are the focus of study in decision sciences nowadays. It includes an excellent bibliography/reference/journal list, information about a variety of datasets, illustrated pseudo-codes, and discussion of future trends in research. Covering topics ranging from optimization, networks and games, multi-objective optimization, inventory theory, statistical methods, artificial neural networks, times series analysis, simulation modeling, decision support system, data envelopment analysis, queueing theory, etc., this reference book is an attempt to make this area more meaningful for varied readers. Noteworthy features of this handbook are in-depth coverage of different topics, solved practical examples, unique datasets for a variety of examples in the areas of decision sciences, in-depth analysis of problems through colored charts, 3D diagrams, and discussions about software.

This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances

"This book focuses on the mathematical models and methods that support most data mining applications and solution techniques, covering such topics as association rules; Bayesian methods; data visualization; kernel methods; neural networks; text, speech, and image recognition; an invaluable resource for scholars and practitioners in the fields of biomedicine, engineering, finance, manufacturing, marketing, performance measurement, and telecommunications"--Provided by publisher.