The conference proceeding of ICMMCS 2021 presents most recent scientific and technological advances in the fields of engineering mathematics and computational science to strengthen the links in the scientific community. It is a collection of high-quality, peer-reviewed research papers presented at the Second International Conference on Mathematical Modeling and Computational Science (ICMMCS 2021), held online during October 29–30, 2021. The topics covered in the book are mathematical logic and foundations, numerical analysis, neural networks, fuzzy set theory, coding theory, higher algebra, number theory, graph theory and combinatory, computation in complex networks, calculus, differential educations and integration, application of soft computing, knowledge engineering, machine learning, artificial intelligence, big data and data analytics, high-performance computing, network and device security, Internet of Things (IoT).

This is the first of two volumes by Professor Cherlin presenting the state of the art in the classification of homogeneous structures in binary languages and related problems in the intersection of model theory and combinatorics. Researchers and graduate students in the area will find in these volumes many far-reaching results and interesting new research directions to pursue. In this volume, Cherlin develops a complete classification of homogeneous ordered graphs and provides a full proof. He then proposes a new family of metrically homogeneous graphs, a weakening of the usual homogeneity condition. A general classification conjecture is presented, together with general structure theory and applications to a general classification conjecture for such graphs. It also includes introductory chapters giving an overview of the results and methods of both volumes, and an appendix surveying recent developments in the area. An extensive accompanying bibliography of related literature, organized by topic, is available online.

In this book, Ramsey theoretic methods introduced by Lachlan are applied to classify the countable homogeneous directed graphs. This is an uncountable collection, and this book presents the first explicit classification result covering an uncountable family. The author's aim is to demonstrate the potential of Lachlan's method for systematic use.

This monograph identifies polytopes that are ?combinatorially ?1-embeddable?, within interesting lists of polytopal graphs, i.e. such that corresponding polytopes are either prominent mathematically (regular partitions, root lattices, uniform polytopes and so on), or applicable in chemistry (fullerenes, polycycles, etc.). The embeddability, if any, provides applications to chemical graphs and, in the first case, it gives new combinatorial perspective to ??2-prominent? affine polytopal objects.The lists of polytopal graphs in the book come from broad areas of geometry, crystallography and graph theory. The book concentrates on such concise and, as much as possible, independent definitions. The scale-isometric embeddability ? the main unifying question, to which those lists are subjected ? is presented with the minimum of technicalities.

Issues in Algebra, Geometry, and Topology / 2013 Edition is a ScholarlyEditions™ book that delivers timely, authoritative, and comprehensive information about Topology. The editors have built Issues in Algebra, Geometry, and Topology: 2013 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Topology in this book to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Issues in Algebra, Geometry, and Topology: 2013 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.

This book provides a comprehensive and accessible introduction to knowledge graphs, which have recently garnered notable attention from both industry and academia. Knowledge graphs are founded on the principle of applying a graph-based abstraction to data, and are now broadly deployed in scenarios that require integrating and extracting value from multiple, diverse sources of data at large scale. The book defines knowledge graphs and provides a high-level overview of how they are used. It presents and contrasts popular graph models that are commonly used to represent data as graphs, and the languages by which they can be queried before describing how the resulting data graph can be enhanced with notions of schema, identity, and context. The book discusses how ontologies and rules can be used to encode knowledge as well as how inductive techniques—based on statistics, graph analytics, machine learning, etc.—can be used to encode and extract knowledge. It covers techniques for the creation, enrichment, assessment, and refinement of knowledge graphs and surveys recent open and enterprise knowledge graphs and the industries or applications within which they have been most widely adopted. The book closes by discussing the current limitations and future directions along which knowledge graphs are likely to evolve. This book is aimed at students, researchers, and practitioners who wish to learn more about knowledge graphs and how they facilitate extracting value from diverse data at large scale. To make the book accessible for newcomers, running examples and graphical notation are used throughout. Formal definitions and extensive references are also provided for those who opt to delve more deeply into specific topics.