- Table View
- List View
Discrete Geometry for Computer Imagery
by Nicolas Normand Jeanpierre Guédon Florent AutrusseauThisbook constitutes the refereed proceedings of the 19th IAPR InternationalConference on Discrete Geometry for Computer Imagery, DGCI 2016, held in Nantes,France, in April 2016. The 32 revised full papers presented together with 2invited talks were carefully selected from 51 submissions. The papers areorganized in topical sections on combinatorial tools; discretization; discretetomography; discrete and combinatorial topology; shape descriptors; models fordiscrete geometry; circle drawing; morphological analysis; geometrictransforms; and discrete shape representation, recognition and analysis.
Discrete Geometry for Computer Imagery: 21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26–28, 2019, Proceedings (Lecture Notes in Computer Science #11414)
by Michel Couprie Jean Cousty Yukiko Kenmochi Nabil MustafaThis book constitutes the thoroughly refereed proceedings of the 21st IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2019, held in Marne-la-Vallée, France, in March 2019. The 38 full papers were carefully selected from 50 submissions. The papers are organized in topical sections on discrete geometric models and transforms; discrete topology; graph-based models, analysis and segmentation; mathematical morphology; shape representation, recognition and analysis; and geometric computation.
Discrete Mathematical Structures: A Succinct Foundation (Mathematics and its Applications)
by Hemen Dutta B. V. KumarThis book contains fundamental concepts on discrete mathematical structures in an easy to understand style so that the reader can grasp the contents and explanation easily. The concepts of discrete mathematical structures have application to computer science, engineering and information technology including in coding techniques, switching circuits, pointers and linked allocation, error corrections, as well as in data networking, Chemistry, Biology and many other scientific areas. The book is for undergraduate and graduate levels learners and educators associated with various courses and progammes in Mathematics, Computer Science, Engineering and Information Technology. The book should serve as a text and reference guide to many undergraduate and graduate programmes offered by many institutions including colleges and universities. Readers will find solved examples and end of chapter exercises to enhance reader comprehension. Features Offers comprehensive coverage of basic ideas of Logic, Mathematical Induction, Graph Theory, Algebraic Structures and Lattices and Boolean Algebra Provides end of chapter solved examples and practice problems Delivers materials on valid arguments and rules of inference with illustrations Focuses on algebraic structures to enable the reader to work with discrete structures
Discrete Mathematics and Applications (Springer Optimization and Its Applications #165)
by Michael Th. Rassias Andrei M. RaigorodskiiAdvances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.
Discrete Mathematics and Applications, Second Edition (Textbooks in Mathematics)
by Kevin FerlandThis book is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs, then moves on to topics in number theory, employing set theory in the process. Part two focuses on computations, combinatorics, graph theory, trees, and algorithms.
Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide (Undergraduate Topics in Computer Science)
by K. ErciyesThis textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula. The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.
Discrete Mathematics and Its Applications Seventh Edition
by Kenneth H. RosenDiscrete Mathematics and Its Applications, Seventh Edition, is intended for one or two term introductory Discrete Mathematics courses taken by students from a wide variety of majors, including Computer Science, Mathematics, and Engineering.
Discrete Mathematics and Mathematical Modelling in the Digital Era: ICDM3DE-2023, Gandhigram, India, March 23–25 (Springer Proceedings in Mathematics & Statistics #458)
by P. Balasubramaniam P. Raveendran G. Mahadevan K. RatnaveluThis book features carefully selected research papers presented during the 9th International Conference on Discrete Mathematics and Mathematical Modelling in the Digital Era (ICDMMMDE-2023). The conference, organised at the Department of Mathematics, The Gandhigram Rural Institute in Gandhigram, Tamil Nadu, India, took place from 23–25 March 2023. Serving as a dynamic platform, the event attracted emerging researchers, mathematicians, industrialists, scientists, and engineers from across the globe, fostering discussions on pertinent research topics. This volume showcases noteworthy contributions from esteemed researchers within the realm of discrete mathematics and mathematical modeling, meticulously subjected to a rigorous peer-review process for publication. The included papers delve into diverse subjects, including controllability, image processing, topology, graph theory, fuzzy delay differential equations, analysis, queuing theory, and applications in networks and biology. Theculmination of these contributions forms a comprehensive and authoritative resource for scholars and professionals alike.
Discrete Mathematics for Computing (3rd Edition)
by Peter Grossman<p>Palgrave Macmillan Discrete Mathematics for Computing is suitable for students taking a one-semester introductory course in discrete mathematics, particularly those studying Computing and Informations Systems. It presents the essential mathematics needed for computing in a style suitable for students with only a moderate background in the subject. <p>Material is introduced at a gentle pace and in an informal style, without compromising mathematical integrity. The text includes many examples of how the theory is applied to problems in computing. This third edition includes: a new expanded section on encryption, additional examples to illustrate key concepts, new exercises at a variety of levels. <p>Peter Grossman has worked in universities and industry as a mathematician and computing professional. As a lecturer in mathematics, he was responsible for coordinating and developing mathematics courses for computing students. He has applied his skills in areas as diverse as calculator design, irrigation systems and underground mine layouts.
Discrete Mathematics with Coding (Textbooks in Mathematics)
by Hugo D JunghennThis book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming. Unlike most discrete mathematics texts focusing on one of the other, the book explores the rich and important connection between these two disciplines and shows how each discipline reinforces and enhances the other. The mathematics in the book is self-contained, requiring only a good background in precalculus and some mathematical maturity. New mathematical topics are introduced as needed. The coding language used is VBA Excel. The language is easy to learn, has intuitive commands, and the reader can develop interesting programs from the outset. Additionally, the spreadsheet platform in Excel makes for convenient and transparent data input and output and provides a powerful venue for complex data manipulation. Manipulating data is greatly simplified using spreadsheet features and visualizing the data can make programming and debugging easier. The VBA language is seamlessly integrated into the spreadsheet environment with no other resources required. Furthermore, as some of the modules in the book show, intricate patterns, graphs, and animation in the form of moving cells is possible. Features Introduces coding in VBA Excel assuming no previous coding experience. Develops programs in Linear Analysis, Logic, Combinatorics, Probability, and Number Theory. Contains over 90 fully tested and debugged programs. The code for these is as well as the exercises is available on the author's website. Contains numerous examples that gradually introduce the reader to coding techniques. Includes programs that solve systems of linear equations, linear programming problems, combinatorial problems, Venn diagram problems and programs that produce truth tables from logic statements and logic statements from switching and gate circuits, encrypt and decrypt messages and simulate probability experiments.
Discrete Mathematics with Ducks (Textbooks in Mathematics)
by Sarah-Marie Belcastro<p>Discrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions of mathematics challenging. At the same time, it provides stimulating material that instructors can use for more advanced students. The first edition was widely well received, with its whimsical writing style and numerous exercises and materials that engaged students at all levels. <p>The new, expanded edition continues to facilitate effective and active learning. It is designed to help students learn about discrete mathematics through problem-based activities. These are created to inspire students to understand mathematics by actively practicing and doing, which helps students better retain what they’ve learned. As such, each chapter contains a mixture of discovery-based activities, projects, expository text, in-class exercises, and homework problems. The author’s lively and friendly writing style is appealing to both instructors and students alike and encourages readers to learn. The book’s light-hearted approach to the subject is a guiding principle and helps students learn mathematical abstraction.</p>
Discrete Mathematics: A Concise Introduction (Synthesis Lectures on Mathematics & Statistics)
by George TourlakisThis book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. “Safe” – that is, paradox-free – informal set theory is introduced following on the heels of Russell’s Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor’s diagonalisation technique. Predicate logic “for the user” is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics.
Discrete Mathematics: Proofs, Structures and Applications, Third Edition
by John Taylor Rowan GarnierTaking an approach to the subject that is suitable for a broad readership, Discrete Mathematics: Proofs, Structures, and Applications, Third Edition provides a rigorous yet accessible exposition of discrete mathematics, including the core mathematical foundation of computer science. The approach is comprehensive yet maintains an easy-to-follow prog
Discrete Problems in Nature Inspired Algorithms
by Ritu Tiwari Anupam ShuklaThis book includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial optimization problems, path formation problems, etc. Each chapter includes the introduction of the basic traditional nature inspired algorithm and discussion of the modified version for discrete algorithms including problems pertaining to discussed algorithms.
Discrete Structures and Their Interactions
by Jason I. BrownDiscover the Connections between Different Structures and FieldsDiscrete Structures and Their Interactions highlights the connections among various discrete structures, including graphs, directed graphs, hypergraphs, partial orders, finite topologies, and simplicial complexes. It also explores their relationships to classical areas of mathematics,
Discrete Time Systems and Signal Processing
by S. PalaniThis book is designed to serve as a textbook for courses offered to undergraduate students enrolled in the Electrical, Electronics, Communications, and Instrumentation Engineering disciplines. The book presents a clear and comprehensive introduction to digital signal processing. For easier comprehension, the course contents of all the chapters are in sequential order. A variety of examples and solved problems are included in the book to enable application and ease of understanding of theoretical concepts. Every chapter contains several homework problems with answers followed by question-and-answer-type assignments. The detailed coverage and pedagogical tools make this an ideal textbook for students and researchers enrolled in electrical engineering and related programs.
Discrete and Computational Geometry
by Joseph O'Rourke Satyan L. DevadossAn essential introduction to discrete and computational geometryDiscrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science.This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also features numerous exercises and unsolved problems.The essential introduction to discrete and computational geometryCovers traditional topics as well as new and advanced materialFeatures numerous full-color illustrations, exercises, and unsolved problemsSuitable for sophomores in mathematics, computer science, engineering, or physicsRigorous but accessibleAn online solutions manual is available (for teachers only).
Discrete and Computational Geometry and Graphs: 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers (Lecture Notes in Computer Science #9943)
by Jin Akiyama, Hiro Ito, Toshinori Sakai and Yushi UnoThis book constitutes the thoroughly refereed post-conference proceedings of the 18th Japanese Conference on Discrete and Computational Geometry and Graphs, JDCDGG 2015, held in Kyoto, Japan, in September 2015. The total of 25 papers included in this volume was carefully reviewed and selected from 64 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics. This proceedings are dedicated to Naoki Katoh on the occasion of his retirement from Kyoto University.
Discrete and Computational Geometry, Graphs, and Games: 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers (Lecture Notes in Computer Science #13034)
by Jin Akiyama Yushi Uno Reginaldo M. Marcelo Mari-Jo P. RuizThis book constitutes the thoroughly refereed post-conference proceedings of the 21st Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2018, held in Quezon City, Philippines, in September 2018. The total of 14 papers included in this volume was carefully reviewed and selected from 25 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.
Discrete-Event Modeling and Simulation: A Practitioner's Approach (Computational Analysis, Synthesis, and Design of Dynamic Systems)
by Gabriel A. WainerComplex artificial dynamic systems require advanced modeling techniques that can accommodate their asynchronous, concurrent, and highly non-linear nature. Discrete Event systems Specification (DEVS) provides a formal framework for hierarchical construction of discrete-event models in a modular manner, allowing for model re-use and reduced development time. Discrete Event Modeling and Simulation presents a practical approach focused on the creation of discrete-event applications. The book introduces the CD++ tool, an open-source framework that enables the simulation of discrete-event models. After setting up the basic theory of DEVS and Cell-DEVS, the author focuses on how to use the CD++ tool to define a variety of models in biology, physics, chemistry, and artificial systems. They also demonstrate how to map different modeling techniques, such as Finite State Machines and VHDL, to DEVS. The in-depth coverage elaborates on the creation of simulation software for DEVS models and the 3D visualization environments associated with these tools. A much-needed practical approach to creating discrete-event applications, this book offers world-class instruction on the field’s most useful modeling tools.
Discrete-Event Modeling and Simulation: Theory and Applications (Computational Analysis, Synthesis, and Design of Dynamic Systems)
by Pieter J. Mosterman Gabriel A. WainerCollecting the work of the foremost scientists in the field, Discrete-Event Modeling and Simulation: Theory and Applications presents the state of the art in modeling discrete-event systems using the discrete-event system specification (DEVS) approach. It introduces the latest advances, recent extensions of formal techniques, and real-world examples of various applications. The book covers many topics that pertain to several layers of the modeling and simulation architecture. It discusses DEVS model development support and the interaction of DEVS with other methodologies. It describes different forms of simulation supported by DEVS, the use of real-time DEVS simulation, the relationship between DEVS and graph transformation, the influence of DEVS variants on simulation performance, and interoperability and composability with emphasis on DEVS standardization. The text also examines extensions to DEVS, new formalisms, and abstractions of DEVS models as well as the theory and analysis behind real-world system identification and control. To support the generation and search of optimal models of a system, a framework is developed based on the system entity structure and its transformation to DEVS simulation models. In addition, the book explores numerous interesting examples that illustrate the use of DEVS to build successful applications, including optical network-on-chip, construction/building design, process control, workflow systems, and environmental models. A one-stop resource on advances in DEVS theory, applications, and methodology, this volume offers a sampling of the best research in the area, a broad picture of the DEVS landscape, and trend-setting applications enabled by the DEVS approach. It provides the basis for future research discoveries and encourages the development of new applications.
Discrete-Time and Discrete-Space Dynamical Systems (Communications and Control Engineering)
by Lihua Xie Lijun Zhang Kuize ZhangDiscrete-Time and Discrete-Space Dynamical Systems provides a systematic characterization of the similarities and differences of several types of discrete-time and discrete-space dynamical systems, including:Boolean control networks;nondeterministic finite-transition systems;finite automata;labelled Petri nets; andcellular automata.The book's perspective is primarily based on topological properties though it also employs semitensor-product and graph-theoretic methods where appropriate. It presents a series of fundamental results: invertibility, observability, detectability, reversiblity, etc., with applications to systems biology.Academic researchers with backgrounds in applied mathematics, engineering or computer science and practising engineers working with discrete-time and discrete-space systems will find this book a helpful source of new understanding for this increasingly important class of systems. The basic results to be found within are of fundamental importance for further study of related problems such as automated synthesis and safety control in cyber-physical systems using formal methods.
Discriminating Data: Correlation, Neighborhoods, and the New Politics of Recognition
by Wendy Hui ChunHow big data and machine learning encode discrimination and create agitated clusters of comforting rage.In Discriminating Data, Wendy Hui Kyong Chun reveals how polarization is a goal—not an error—within big data and machine learning. These methods, she argues, encode segregation, eugenics, and identity politics through their default assumptions and conditions. Correlation, which grounds big data&’s predictive potential, stems from twentieth-century eugenic attempts to &“breed&” a better future. Recommender systems foster angry clusters of sameness through homophily. Users are &“trained&” to become authentically predictable via a politics and technology of recognition. Machine learning and data analytics thus seek to disrupt the future by making disruption impossible. Chun, who has a background in systems design engineering as well as media studies and cultural theory, explains that although machine learning algorithms may not officially include race as a category, they embed whiteness as a default. Facial recognition technology, for example, relies on the faces of Hollywood celebrities and university undergraduates—groups not famous for their diversity. Homophily emerged as a concept to describe white U.S. resident attitudes to living in biracial yet segregated public housing. Predictive policing technology deploys models trained on studies of predominantly underserved neighborhoods. Trained on selected and often discriminatory or dirty data, these algorithms are only validated if they mirror this data. How can we release ourselves from the vice-like grip of discriminatory data? Chun calls for alternative algorithms, defaults, and interdisciplinary coalitions in order to desegregate networks and foster a more democratic big data.
Discursive Design: Critical, Speculative, and Alternative Things (Design Thinking, Design Theory)
by Bruce M. Tharp Stephanie M. TharpExploring how design can be used for good—prompting self-reflection, igniting the imagination, and affecting positive social change.Good design provides solutions to problems. It improves our buildings, medical equipment, clothing, and kitchen utensils, among other objects. But what if design could also improve societal problems by prompting positive ideological change? In this book, Bruce and Stephanie Tharp survey recent critical design practices and propose a new, more inclusive field of socially minded practice: discursive design. While many consider good design to be unobtrusive, intuitive, invisible, and undemanding intellectually, discursive design instead targets the intellect, prompting self-reflection and igniting the imagination. Discursive design (derived from “discourse”) expands the boundaries of how we can use design—how objects are, in effect, good(s) for thinking. Discursive Design invites us to see objects in a new light, to understand more than their basic form and utility. Beyond the different foci of critical design, speculative design, design fiction, interrogative design, and adversarial design, Bruce and Stephanie Tharp establish a more comprehensive, unifying vision as well as innovative methods. They not only offer social criticism but also explore how objects can, for example, be used by counselors in therapy sessions, by town councils to facilitate a pre-vote discussions, by activists seeking engagement, and by institutions and industry to better understand the values, beliefs, and attitudes of those whom they serve. Discursive design sparks new ways of thinking, and it is only through new thinking that our sociocultural futures can change.
Discursive Disruption, Populist Communication and Democracy: The Cases of Hugo Chávez and Donald J. Trump (Routledge Research in Political Communication)
by Elena BlockIn Discursive Disruption, Populist Communication and Democracy, Elena Block explores the links between declining democratic discourses, populist communication, and reflects on the communicative and moral dimensions of populism. Block proposes the concept of discursive disruption to help to identify, analyze and understand the disruptive power of populist speech, turning to the communicative styles of Venezuela’s late President Hugo Chávez and the US’s President Donald J. Trump to illustrate and support this new conceptual and analytical tool. While the mainstream political class and media traditionally sought to manage the processes of political communication, the book contends that they have now been displaced and their role has been undermined. Middle ground politics and journalism have been substituted by the adversarial rhetorical styles of populists, multiplied through multi-fragmented channels, texts and voices. With this book, Block continues her introspection in the conceptual, communicative and mediatic dimensions of populism by adding a perspective that draws on democratic and discursive theories. Discursive Disruption, Populist Communication and Democracy is ideally designed for scholars and professional communicators in political science and communication studies eager to understand the connection between weakening discourses of modern democracy and the pervasiness of confrontational styles of populist communication in contemporary political exchanges.