This book features selected papers from the 9th International Conference on Mathematics and Computing (ICMC 2023), organized at BITS Pilani K. K. Birla Goa Campus, India, during 6–8 January 2023. 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, cybersecurity, machine learning, data analytics, and blockchain technology in computer science and information technology.

This book constitutes the thoroughly refereed post-proceedings of the International Computer Music Modeling and Retrieval Symposium, CMMR 2004, held in Esbjerg, Denmark in May 2004. The 26 revised full papers presented were carefully selected during two rounds of reviewing and improvement. Due to the interdisciplinary nature of the area, the papers address a broad variety of topics. The papers are organized in topical sections on pitch and melody detection; rhythm, tempo, and beat; music generation and knowledge; music performance, rendering, and interfaces; music scores and synchronization; synthesis, timbre, and musical playing; music representation and retrieval; and music analysis.

This book presents high-quality papers from the Fifth International Conference on Microelectronics, Computing & Communication Systems (MCCS 2020). It discusses the latest technological trends and advances in MEMS and nanoelectronics, wireless communication, optical communication, instrumentation, signal processing, image processing, bioengineering, green energy, hybrid vehicles, environmental science, weather forecasting, cloud computing, renewable energy, RFID, CMOS sensors, actuators, transducers, telemetry systems, embedded systems and sensor network applications. It includes papers based on original theoretical, practical and experimental simulations, development, applications, measurements and testing. The applications and solutions discussed here provide excellent reference material for future product development.

A panorama of new ideas in mathematics that are driving innovation in computing and communications.

As society comes to rely increasingly on software for its welfare and prosperity there is an urgent need to create systems in which it can trust. Experience has shown that confidence can only come from a more profound understanding of the issues, which in turn can come only if it is based on logically sound foundations. This volume contains contributions from leading researchers in the critical disciplines of computing and information science, mathematics, logic, and complexity. All contributions are self-contained, aiming at comprehensibility as well as comprehensiveness. The volume also contains introductory hints to technical issues, concise surveys, introductions, and various fresh results and new perspectives.

Computers are playing a fundamental role in enhancing exploratory learning techniques in education. This volume in the NATO Special Programme on Advanced Educational Technology covers the state of the art in the design and use of computer systems for exploratory learning. Contributed chapters treat principles, theory, practice, and examples of some of the best contemporary computer-based learning environments: Logo, Boxer, Microworlds, Cabri-Géomètre, Star Logo, Table Top, Geomland, spreadsheets, Function Machines, and others. Emphasis is on mathematics and science education. Synthetic chapters provide an overview of the current scene in computers and exploratory learning, and analyses from the perspectives of epistemology, learning, and socio-cultural studies.

This is a collection of essays on issues related to the evolutionary design and the practical future of intelligent tutoring systems. Following in the tradition of Foundations of Intelligent Tutoring Systems and Intelligent Tutoring Systems: Lessons Learned, this volume examines some of the visions and near-term issues that have been further explored and better defined since those groundbreaking books first appeared. Questions addressed in this volume include: *How can knowledge bases generate explanations? *Will case-based reasoning techniques be worth pursuing in the ITS framework? *Will high performance skills be successfully taught in an ITS design? *Are there dimensions of ITS design which the research laboratories are ignoring, and ignoring at the customer's peril? Of particular importance to those engaged in research and development, this book will be of value to all who wish to apprise themselves of the advances being made in the rapidly evolving field of intelligent tutoring systems.

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.