This book presents a collection of research findings and proposals on computer science and computer engineering, introducing readers to essential concepts, theories, and applications. It also shares perspectives on how cutting-edge and established methodologies and techniques can be used to obtain new and interesting results. Each chapter focuses on a specific aspect of computer science or computer engineering, such as: software engineering, complex systems, computational intelligence, embedded systems, and systems engineering. As such, the book will bring students and professionals alike up to date on key advances in these areas.

Because of its inherent simplicity, graph theory has a wide range of applications in engineering, and in physical sciences. It has of course uses in social sciences, in linguistics and in numerous other areas. In fact, a graph can be used to represent almost any physical situation involving discrete objects and the relationship among them. Now with the solutions to engineering and other problems becoming so complex leading to larger graphs, it is virtually difficult to analyze without the use of computers. This book is recommended in IIT Kharagpur, West Bengal for B.Tech Computer Science, NIT Arunachal Pradesh, NIT Nagaland, NIT Agartala, NIT Silchar, Gauhati University, Dibrugarh University, North Eastern Regional Institute of Management, Assam Engineering College, West Bengal Univerity of Technology (WBUT) for B.Tech, M.Tech Computer Science, University of Burdwan, West Bengal for B.Tech. Computer Science, Jadavpur University, West Bengal for M.Sc. Computer Science, Kalyani College of Engineering, West Bengal for B.Tech. Computer Science. Key Features: This book provides a rigorous yet informal treatment of graph theory with an emphasis on computational aspects of graph theory and graph-theoretic algorithms. Numerous applications to actual engineering problems are incorpo-rated with software design and optimization topics.

This book presents, in a rigorous and comprehensible way, the mathematical description and analysis of linear dynamic systems, and the controllability and observability of linear dynamic systems. It also details the stability of linear dynamic systems, automatic control systems, and nonlinear dynamic systems, and the optimal control of dynamic systems. The treatment is both systemic and synthetic, achieving rigorous and applicative solutions, and is illustrated with engineering examples. The book will appeal to scientists working in the practice of systems theory, engineering, automatic control, computer science, electrical engineering, electronics, and applied mathematics in biology and economics, as well as scientists working in education, research, design and industry.

"This book introduces and explains Higher Order Neural Networks (HONNs) to people working in the fields of computer science and computer engineering, and how to use HONNS in these areas"--Provided by publisher.

The aim of this book is to provide an overview of classic as well as new research results on optimization problems and algorithms. Beside the theoretical basis, the book contains a number of chapters describing the application of the theory in practice, that is, reports on successfully solving real-world engineering challenges by means of optimization algorithms. These case studies are collected from a wide range of application domains within computer engineering. The diversity of the presented approaches offers a number of practical tips and insights into the practical application of optimization algorithms, highlighting real-world challenges and solutions. Researchers, practitioners and graduate students will find the book equally useful.

This book constitutes the proceedings of the 16th International Computer Science Symposium in Russia, CSR 2021, held in Sochi, Russia, in June/July 2021. The 28 full papers were carefully reviewed and selected from 68 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more.

Ontology was once understood to be the philosophical inquiry into the structure of reality: the analysis and categorization of ‘what there is’. Recently, however, a field called ‘ontology’ has become part of the rapidly growing research industry in information technology. The two fields have more in common than just their name. Theory and Applications of Ontology is a two-volume anthology that aims to further an informed discussion about the relationship between ontology in philosophy and ontology in information technology. It fills an important lacuna in cutting-edge research on ontology in both fields, supplying stage-setting overview articles on history and method, presenting directions of current research in either field, and highlighting areas of productive interdisciplinary contact. Theory and Applications of Ontology: Computer Applications presents ontology in ways that philosophers are not likely to find elsewhere. The volume offers an overview of current research in ontology, distinguishing basic conceptual issues, domain applications, general frameworks, and mathematical formalisms. It introduces the reader to current research on frameworks and applications in information technology in ways that are sure to invite reflection and constructive responses from ontologists in philosophy.

A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory. The applications covered include tracking dependency in distributed systems, combinatorics, detecting global predicates in distributed systems, set families, and integer partitions. The book presents algorithmic proofs of theorems whenever possible. These proofs are written in the calculational style advocated by Dijkstra, with arguments explicitly spelled out step by step. The author’s intent is for readers to learn not only the proofs, but the heuristics that guide said proofs. Introduction to Lattice Theory with Computer Science Applications: Examines; posets, Dilworth’s theorem, merging algorithms, lattices, lattice completion, morphisms, modular and distributive lattices, slicing, interval orders, tractable posets, lattice enumeration algorithms, and dimension theory Provides end of chapter exercises to help readers retain newfound knowledge on each subject Includes supplementary material at www.ece.utexas.edu/~garg Introduction to Lattice Theory with Computer Science Applications is written for students of computer science, as well as practicing mathematicians.

The book Advances in Computer Science and Engineering constitutes the revised selection of 23 chapters written by scientists and researchers from all over the world. The chapters cover topics in the scientific fields of Applied Computing Techniques, Innovations in Mechanical Engineering, Electrical Engineering and Applications and Advances in Applied Modeling.

By using computer simulations in research and development, computational science and engineering (CSE) allows empirical inquiry where traditional experimentation and methods of inquiry are difficult, inefficient, or prohibitively expensive. The Handbook of Research on Computational Science and Engineering: Theory and Practice is a reference for interested researchers and decision-makers who want a timely introduction to the possibilities in CSE to advance their ongoing research and applications or to discover new resources and cutting edge developments. Rather than reporting results obtained using CSE models, this comprehensive survey captures the architecture of the cross-disciplinary field, explores the long term implications of technology choices, alerts readers to the hurdles facing CSE, and identifies trends in future development.