Mathematical Techniques of Fractional Order Systems illustrates advances in linear and nonlinear fractional-order systems relating to many interdisciplinary applications, including biomedical, control, circuits, electromagnetics and security. The book covers the mathematical background and literature survey of fractional-order calculus and generalized fractional-order circuit theorems from different perspectives in design, analysis and realizations, nonlinear fractional-order circuits and systems, the fractional-order memristive circuits and systems in design, analysis, emulators, simulation and experimental results. It is primarily meant for researchers from academia and industry, and for those working in areas such as control engineering, electrical engineering, computer science and information technology. This book is ideal for researchers working in the area of both continuous-time and discrete-time dynamics and chaotic systems.

In the world of mathematics and computer science, technological advancements are constantly being researched and applied to ongoing issues. Setbacks in social networking, engineering, and automation are themes that affect everyday life, and researchers have been looking for new techniques in which to solve these challenges. Graph theory is a widely studied topic that is now being applied to real-life problems. Advanced Applications of Graph Theory in Modern Society is an essential reference source that discusses recent developments on graph theory, as well as its representation in social networks, artificial neural networks, and many complex networks. The book aims to study results that are useful in the fields of robotics and machine learning and will examine different engineering issues that are closely related to fuzzy graph theory. Featuring research on topics such as artificial neural systems and robotics, this book is ideally designed for mathematicians, research scholars, practitioners, professionals, engineers, and students seeking an innovative overview of graphic theory.

In the study of the structure of substances in recent decades, phenomena in the higher dimension was discovered that was previously unknown. These include spontaneous zooming (scaling processes), discovery of crystals with the absence of translational symmetry in three-dimensional space, detection of the fractal nature of matter, hierarchical filling of space with polytopes of higher dimension, and the highest dimension of most molecules of chemical compounds. This forces research to expand the formulation of the question of constructing n-dimensional spaces, posed by David Hilbert in 1900, and to abandon the methods of considering the construction of spaces by geometric figures that do not take into account the accumulated discoveries in the physics of the structure of substances. There is a need for research that accounts for the new paradigm of the discrete world and provides a solution to Hilbert's 18th problem of constructing spaces of higher dimension using congruent figures. Normal Partitions and Hierarchical Fillings of N-Dimensional Spaces aims to consider the construction of spaces of various dimensions from two to any finite dimension n, taking into account the indicated conditions, including zooming in on shapes, properties of geometric figures of higher dimensions, which have no analogue in three-dimensional space. This book considers the conditions of existence of polytopes of higher dimension, clusters of chemical compounds as polytopes of the highest dimension, higher dimensions in the theory of heredity, the geometric structure of the product of polytopes, the products of polytopes on clusters and molecules, parallelohedron and stereohedron of Delaunay, parallelohedron of higher dimension and partition of n-dimensional spaces, hierarchical filling of n-dimensional spaces, joint normal partitions, and hierarchical fillings of n-dimensional spaces. In addition, it pays considerable attention to biological problems. This book is a valuable reference tool for practitioners, stakeholders, researchers, academicians, and students who are interested in learning more about the latest research on normal partitions and hierarchical fillings of n-dimensional spaces.

This book covers an introduction to convex optimization, one of the powerful and tractable optimization problems that can be efficiently solved on a computer. The goal of the book is tohelp develop a sense of what convex optimization is, and how it can be used in a widening array of practical contexts with a particular emphasis on machine learning.The first part of the book covers core concepts of convex sets, convex functions, and related basic definitions that serve understanding convex optimization and its corresponding models. The second part deals with one very useful theory, called duality, which enables us to: (1) gain algorithmic insights; and (2) obtain an approximate solution to non-convex optimization problems which are often difficult to solve. The last part focuses on modern applications in machine learning and deep learning.A defining feature of this book is that it succinctly relates the "story" of how convex optimization plays a role, via historical examples and trending machine learning applications. Another key feature is that it includes programming implementation of a variety of machine learning algorithms inspired by optimization fundamentals, together with a brief tutorial of the used programming tools. The implementation is based on Python, CVXPY, and TensorFlow. This book does not follow a traditional textbook-style organization, but is streamlined via a series of lecture notes that are intimately related, centered around coherent themes and concepts. It serves as a textbook mainly for a senior-level undergraduate course, yet is also suitable for a first-year graduate course. Readers benefit from having a good background in linear algebra, some exposure to probability, and basic familiarity with Python.

This book demonstrates Microsoft EXCEL-based Fourier transform of selected physics examples. Spectral density of the auto-regression process is also described in relation to Fourier transform. Rather than offering rigorous mathematics, readers will "try and feel" Fourier transform for themselves through the examples. Readers can also acquire and analyze their own data following the step-by-step procedure explained in this book. A hands-on acoustic spectral analysis can be one of the ideal long-term student projects.

This book is a general introduction to the statistical analysis of networks, and can serve both as a research monograph and as a textbook. Numerous fundamental tools and concepts needed for the analysis of networks are presented, such as network modeling, community detection, graph-based semi-supervised learning and sampling in networks. The description of these concepts is self-contained, with both theoretical justifications and applications provided for the presented algorithms.Researchers, including postgraduate students, working in the area of network science, complex network analysis, or social network analysis, will find up-to-date statistical methods relevant to their research tasks. This book can also serve as textbook material for courses related to thestatistical approach to the analysis of complex networks.In general, the chapters are fairly independent and self-supporting, and the book could be used for course composition "a la carte". Nevertheless, Chapter 2 is needed to a certain degree for all parts of the book. It is also recommended to read Chapter 4 before reading Chapters 5 and 6, but this is not absolutely necessary. Reading Chapter 3 can also be helpful before reading Chapters 5 and 7. As prerequisites for reading this book, a basic knowledge in probability, linear algebra and elementary notions of graph theory is advised. Appendices describing required notions from the above mentioned disciplines have been added to help readers gain further understanding.