Zusammenfassung: This book features selected papers from the 10th International Conference on Mathematics and Computing (ICMC 2024), held at Kalasalingam Academy of Research and Education (KARE), Krishnankoil, India during 2 - 7 January 2024. It covers recent advances in the field of mathematics, statistics, and scientific computing. The book presents innovative work by leading academics, researchers, and experts from industry in mathematics, statistics, cryptography, network security, cyber security, machine learning, data analytics and blockchain technology in computer science and information technology. The book is divided into two volumes

This book features selected papers from the 6th International Conference on Mathematics and Computing (ICMC 2020), organized by Sikkim University, Gangtok, Sikkim, India, during September 2020. It covers recent advances in the field of mathematics, statistics, and scientific computing. The book presents innovative work by leading academics, researchers, and experts from industry.

Contains the abstracts of the contributed papers presented at the Tenth International Conference on Civil, Structural and Environmental Engineering Computing, held in Rome, Italy, 30 August - 2 September 2005. The length papers are available in electronic format on the accompanying CD-ROM.

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.

Sponsored by the National Council of Teachers of Mathematics and written by leading experts in the field of mathematics education, the Handbook is specifically designed to make important, vital scholarship accessible to mathematics education professors, graduate students, educational researchers, staff development directors, curriculum supervisors, and teachers. The Handbook provides a framework for understanding the evolution of the mathematics education research field against the backdrop of well-established conceptual, historical, theoretical, and methodological perspectives. It is an indispensable working tool for everyone interested in pursuing research in mathematics education as the references for each of the Handbook's twenty-nine chapters are complete resources for both current and past work in that particular area.

This book constitutes the strictly refereed post-proceedings of the 5th International Hybrid Systems Workshop held in Notre Dame, Indiana, USA in September 1998. The 23 revised full papers presented in the book have gone through two rounds of thorough reviewing and revision. The volume presents state-of-the-art research results and particularly addresses such areas as program verification, concurrent and distributed processes, logic programming, logics of programs, discrete event simulation, calculus of variations, optimization, differential geometry, Lie algebras, automata theory, dynamical systems, etc.

This work is devoted to the theory and approximation of nonlinear hyper bolic systems of conservation laws in one or two space variables. It follows directly a previous publication on hyperbolic systems of conservation laws by the same authors, and we shall make frequent references to Godlewski and Raviart (1991) (hereafter noted G. R. ), though the present volume can be read independently. This earlier publication, apart from a first chap ter, especially covered the scalar case. Thus, we shall detail here neither the mathematical theory of multidimensional scalar conservation laws nor their approximation in the one-dimensional case by finite-difference con servative schemes, both of which were treated in G. R. , but we shall mostly consider systems. The theory for systems is in fact much more difficult and not at all completed. This explains why we shall mainly concentrate on some theoretical aspects that are needed in the applications, such as the solution of the Riemann problem, with occasional insights into more sophisticated problems. The present book is divided into six chapters, including an introductory chapter. For the reader's convenience, we shall resume in this Introduction the notions that are necessary for a self-sufficient understanding of this book -the main definitions of hyperbolicity, weak solutions, and entropy present the practical examples that will be thoroughly developed in the following chapters, and recall the main results concerning the scalar case.

First Published in 1989. Routledge is an imprint of Taylor & Francis, an informa company.

Answer set programming (ASP) is a declarative language tailored towards solving combinatorial optimization problems. It has been successfully applied to e.g. planning problems, configuration and verification of software, diagnosis and database repairs. However, ASP is not directly suitable for modeling problems with continuous domains. Such problems occur naturally in diverse fields such as the design of gas and electricity networks, computer vision and investment portfolios. To overcome this problem we study FASP, a combination of ASP with fuzzy logic -- a class of manyvalued logics that can handle continuity. We specifically focus on the following issues: 1. An important question when modeling continuous optimization problems is how we should handle overconstrained problems, i.e. problems that have no solutions. In many cases we can opt to accept an imperfect solution, i.e. a solution that does not satisfy all the stated rules (constraints). However, this leads to the question: what imperfect solutions should we choose? We investigate this question and improve upon the state-of-the-art by proposing an approach based on aggregation functions. 2. Users of a programming language often want a rich language that is easy to model in. However, implementers and theoreticians prefer a small language that is easy to implement and reason about. We create a bridge between these two desires by proposing a small core language for FASP and by showing that this language is capable of expressing many of its common extensions such as constraints, monotonically decreasing functions, aggregators, S-implicators and classical negation. 3. A well-known technique for solving ASP consists of translating a program P to a propositional theory whose models exactly correspond to the answer sets of P. We show how this technique can be generalized to FASP, paving the way to implement efficient fuzzy answer set solvers that can take advantage of existing fuzzy reasoners.