Search results for "Discrete Structures"
Items we need to order for you
R 7,315.96
Discrete Structures
Discrete Structures introduces readers to the mathematical structures and methods that form the foundation of computer science and features multiple techniques that readers will turn to regularly throughout their careers in computer and information sciences.Over the course of five modules, students learn specific skills including binary and modular arithmetic, set notation, methods of counting, evaluating sums, and solving recurrences. They study the basics of probability, proof by induction, growth of functions, and analysis techniques. The book also discusses general problem-solving techniques that are widely applicable to real problems. Each module includes motivation applications, technique, theory, and further opportunities for application.Informed by extensive experience teaching in computer science programs, Discrete Structures has been developed specifically for first-year students in those programs. The material is also suitable for courses in computer engineering, as well as those for students who are transferring from other disciplines and just beginning their computer science or engineering education.
R 3,811.47
R 275.00
R 4,572.00
Applied Discrete Structures
Applied Discrete Structures, is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures. The algebraic structures that are discussed are monoids, groups, rings, fields and vector spaces. Website: http://discretemath.org Applied Discrete Structures has been approved by the American Institute of Mathematics as part of their Open Textbook Initiative. For more information on open textbooks, visit http://www.aimath.org/textbooks/. This version was created using Mathbook XML (https://mathbook.pugetsound.edu/) Al Doerr is Emeritus Professor of Mathematical Sciences at UMass Lowell. His interests include abstract algebra and discrete mathematics. Ken Levasseur is a Professor of Mathematical Sciences at UMass Lowell. His interests include discrete mathematics and abstract algebra, and their implementation using computer algebra systems.
R 1,949.99
R 4,360.00
Discrete Mathematical Structures
This 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 AlgebraProvides end of chapter solved examples and practice problemsDelivers materials on valid arguments and rules of inference with illustrationsFocuses on algebraic structures to enable the reader to work with discrete structures
R 2,954.79
Discrete Structures
The aim of this text is to introduce discrete mathematics to beginning students of mathematics or computer science. It does this by bringing some coherency into the seemingly incongruent subjects that compose discrete math, such as logic, set theory, algebra, and combinatorics. It emphasizes their theoretical foundations and illustrates proofs along the way. The book prepares readers for the analysis of algorithms by discussing asymptotic analysis and a discrete calculus for sums. The book also deduces combinatorial methods from the foundations that are laid out. Unlike other texts on this subject, there is a greater emphasis on foundational material that leads to a better understanding. To further assist the reader in grasping and practicing concepts, roughly 690 exercises are provided at various levels of difficulty. Readers are encouraged to study the examples in the text and solve as many of the exercises as possible.The text is intended for freshman or sophomore undergraduate students in mathematics, computer science, or similar majors. The assumed background is precalculus. The chapter dependency chart included is designed to help students, independent readers, and instructors follow a systematic path for learning and teaching the material, with the option to explore material in later chapters.
R 2,564.00
Applied Discrete Structures - Part 1: Fundamentals
This is Part 1 of Applied Discrete Structures, containing the fundamental concepts taught in a one semester course in discrete mathematics. It corresponds with the content of Discrete Structures I at UMass Lowell, which is a required course for students in Computer Science, Mathematics and Information Technology. Part II - Applied Abstract Algebra would normally be used in a second semester course such as Discrete Structures II at UMass Lowell. Applied Discrete Structures has been approved by the American Institute of Mathematics as part of their Open Textbook Initiative. For more information on open textbooks, visit http://www.aimath.org/textbooks/. This version was created using Mathbook XML (https://mathbook.pugetsound.edu/) Version 3.6 - May 2019
R 1,282.45
Fuzzy Discrete Structures
This ambitious exposition by Malik and Mordeson on the fuzzification of discrete structures not only supplies a solid basic text on this key topic, but also serves as a viable tool for learning basic fuzzy set concepts "from the ground up" due to its unusual lucidity of exposition. While the entire presentation of this book is in a completely traditional setting, with all propositions and theorems provided totally rigorous proofs, the readability of the presentation is not compromised in any way; in fact, the many ex cellently chosen examples illustrate the often tricky concepts the authors address. The book's specific topics - including fuzzy versions of decision trees, networks, graphs, automata, etc. - are so well presented, that it is clear that even those researchers not primarily interested in these topics will, after a cursory reading, choose to return to a more in-depth viewing of its pages. Naturally, when I come across such a well-written book, I not only think of how much better I could have written my co-authored monographs, but naturally, how this work, as distant as it seems to be from my own area of interest, could nevertheless connect with such. Before presenting the briefest of some ideas in this direction, let me state that my interest in fuzzy set theory (FST) has been, since about 1975, in connecting aspects of FST directly with corresponding probability concepts. One chief vehicle in carrying this out involves the concept of random sets.
R 3,034.68
Discrete and Algebraic Structures
This textbook presents the topics typically covered in a standard course on discrete structures. It is aimed at students of computer science and mathematics (teaching degree and Bachelor's/Master's) and is designed to accompany lectures, for self-study, and for exam preparation.Through explanatory introductions to definitions, numerous examples, counterexamples, diagrams, cross-references, and outlooks, the authors manage to present the wide range of topics concisely and comprehensibly.Numerous exercises facilitate the deepening of the material. Due to its compact presentation of all important discrete and algebraic structures and its extensive index, the book also serves as a reference for mathematicians, computer scientists, and natural scientists.Contents: From propositional and predicate logic to sets and combinatorics, numbers, relations and mappings, graphs, to the rich spectrum of algebraic structures, and a brief introduction to category theory. Additional chapters include rings and modules as well as matroids.This book is a translation of the second German edition. The translation was done with the help of artificial intelligence. A subsequent human revision was done primarily in terms of content, so the book may read stylistically differently from a conventional translation.
R 2,198.00
R 1,221.00
Course In Discrete Mathematical Structures, A
This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures. It starts with a chapter on sets and goes on to provide examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal. Computational techniques including the principle of mathematical introduction are provided, as well as a study on elementary properties of graphs, trees and lattices. Some basic results on groups, rings, fields and vector spaces are also given, the treatment of which is intentionally simple since such results are fundamental as a foundation for students of discrete mathematics. In addition, some results on solutions of systems of linear equations are discussed.
R 4,632.63
Fuzzy Discrete Structures
This ambitious exposition by Malik and Mordeson on the fuzzification of discrete structures not only supplies a solid basic text on this key topic, but also serves as a viable tool for learning basic fuzzy set concepts "from the ground up" due to its unusual lucidity of exposition. While the entire presentation of this book is in a completely traditional setting, with all propositions and theorems provided totally rigorous proofs, the readability of the presentation is not compromised in any way; in fact, the many ex cellently chosen examples illustrate the often tricky concepts the authors address. The book's specific topics - including fuzzy versions of decision trees, networks, graphs, automata, etc. - are so well presented, that it is clear that even those researchers not primarily interested in these topics will, after a cursory reading, choose to return to a more in-depth viewing of its pages. Naturally, when I come across such a well-written book, I not only think of how much better I could have written my co-authored monographs, but naturally, how this work, as distant as it seems to be from my own area of interest, could nevertheless connect with such. Before presenting the briefest of some ideas in this direction, let me state that my interest in fuzzy set theory (FST) has been, since about 1975, in connecting aspects of FST directly with corresponding probability concepts. One chief vehicle in carrying this out involves the concept of random sets.
R 4,030.00
R 1,465.37
Fundamental Discrete Structures
This book serves as a core text in discrete mathematics. It discusses topics such as symbolic logic, enumerative combinatorics, algebraic structures, graph theory, and related applications to computer science and other allied subjects. The presentation of related concepts is suitable for sophomore, junior, and senior-level undergraduate students. Exercises provided at the end of each chapter are designed to help the reader have an active learning experience throughout the study.
R 3,114.00
Course In Discrete Mathematical Structures, A
This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures. It starts with a chapter on sets and goes on to provide examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal. Computational techniques including the principle of mathematical introduction are provided, as well as a study on elementary properties of graphs, trees and lattices. Some basic results on groups, rings, fields and vector spaces are also given, the treatment of which is intentionally simple since such results are fundamental as a foundation for students of discrete mathematics. In addition, some results on solutions of systems of linear equations are discussed.
R 2,305.46
Applied Discrete Structures - Part 2- Algebraic Structures
Applied Discrete Structures, Part II - Algebraic Structures, is an introduction to groups, monoids, vector spaces, lattices, boolean algebras, rings and fields. It corresponds with the content of Discrete Structures II at UMass Lowell, which is a required course for students in Computer Science. It presumes background contained in Part I - Fundamentals. Applied Discrete Structures has been approved by the American Institute of Mathematics as part of their Open Textbook Initiative. For more information on open textbooks, visit http://www.aimath.org/textbooks/. This version was created using Mathbook XML (https://mathbook.pugetsound.edu/) Al Doerr is Emeritus Professor of Mathematical Sciences at UMass Lowell. His interests include abstract algebra and discrete mathematics. Ken Levasseur is a Professor of Mathematical Sciences at UMass Lowell. His interests include discrete mathematics and abstract algebra, and their implementation using computer algebra systems.
R 1,048.06
Random Discrete Structures
The articles in this volume present the state of the art in a variety of areas of discrete probability, including random walks on finite and infinite graphs, random trees, renewal sequences, Stein's method for normal approximation and Kohonen-type self-organizing maps. This volume also focuses on discrete probability and its connections with the theory of algorithms. Classical topics in discrete mathematics are represented as are expositions that condense and make readable some recent work on Markov chains, potential theory and the second moment method. This volume is suitable for mathematicians and students.
R 4,645.17
Spectra of Discrete Structures
Addressing the active and challenging field of spectral theory, this book develops the general theory of spectra of discrete structures, on graphs, simplicial complexes, and hypergraphs. In fact, hypergraphs have long been neglected in mathematical research, but due to the discovery of Laplace operators that can probe their structure, and their manifold applications from chemical reaction networks to social interactions, they now constitute one of the hottest topics of interdisciplinary research. The authors' analysis of spectra of discrete structures embeds intuitive and easily visualized examples, which are often quite subtle, within a general mathematical framework. They highlight novel research on Cheeger type inequalities which connect spectral estimates with the geometry, more precisely the cohesion, of the underlying structure. Establishing mathematical foundations and demonstrating applications, this book will be of interest to graduate students and researchers in mathematics working on the spectral theory of operators on discrete structures.
R 3,147.54
Random Discrete Structures
The articles in this volume present the state of the art in a variety of areas of discrete probability, including random walks on finite and infinite graphs, random trees, renewal sequences, Stein's method for normal approximation and Kohonen-type self-organizing maps. This volume also focuses on discrete probability and its connections with the theory of algorithms. Classical topics in discrete mathematics are represented as are expositions that condense and make readable some recent work on Markov chains, potential theory and the second moment method. This volume is suitable for mathematicians and students.
R 4,646.07
R 698.48
R 1,791.00
Ramsey Theory for Discrete Structures
This monograph covers some of the most important developments in Ramsey theory from its beginnings in the early 20th century via its many breakthroughs to recent important developments in the early 21st century.The book first presents a detailed discussion of the roots of Ramsey theory before offering a thorough discussion of the role of parameter sets. It presents several examples of structures that can be interpreted in terms of parameter sets and features the most fundamental Ramsey-type results for parameter sets: Hales-Jewett's theorem and Graham-Rothschild¹s Ramsey theorem as well as their canonical versions and several applications. Next, the book steps back to the most basic structure, to sets. It reviews classic results as well as recent progress on Ramsey numbers and the asymptotic behavior of classical Ramsey functions. In addition, it presents product versions of Ramsey's theorem, a combinatorial proof of the incompleteness of Peano arithmetic, provides a digression to discrepancy theory and examines extensions of Ramsey's theorem to larger cardinals. The next part of the book features an in-depth treatment of the Ramsey problem for graphs and hypergraphs. It gives an account on the existence of sparse and restricted Ramsey theorem's using sophisticated constructions as well as probabilistic methods. Among others it contains a proof of the induced Graham-Rothschild theorem and the random Ramsey theorem. The book closes with a chapter on one of the recent highlights of Ramsey theory: a combinatorial proof of the density Hales-Jewett theorem.This book provides graduate students as well as advanced researchers with a solid introduction and reference to the field.
R 1,548.14
Ramsey Theory for Discrete Structures
This monograph covers some of the most important developments in Ramsey theory from its beginnings in the early 20th century via its many breakthroughs to recent important developments in the early 21st century.The book first presents a detailed discussion of the roots of Ramsey theory before offering a thorough discussion of the role of parameter sets. It presents several examples of structures that can be interpreted in terms of parameter sets and features the most fundamental Ramsey-type results for parameter sets: Hales-Jewett's theorem and Graham-Rothschild¹s Ramsey theorem as well as their canonical versions and several applications. Next, the book steps back to the most basic structure, to sets. It reviews classic results as well as recent progress on Ramsey numbers and the asymptotic behavior of classical Ramsey functions. In addition, it presents product versions of Ramsey's theorem, a combinatorial proof of the incompleteness of Peano arithmetic, provides a digression to discrepancy theory and examines extensions of Ramsey's theorem to larger cardinals. The next part of the book features an in-depth treatment of the Ramsey problem for graphs and hypergraphs. It gives an account on the existence of sparse and restricted Ramsey theorem's using sophisticated constructions as well as probabilistic methods. Among others it contains a proof of the induced Graham-Rothschild theorem and the random Ramsey theorem. The book closes with a chapter on one of the recent highlights of Ramsey theory: a combinatorial proof of the density Hales-Jewett theorem.This book provides graduate students as well as advanced researchers with a solid introduction and reference to the field.
R 1,547.24
Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 1,557.97
Fundamental Structures of Algebra and Discrete Mathematics
Introduces and clarifies the basic theories of 12 structural concepts, offering a fundamental theory of groups, rings and other algebraic structures. Identifies essentials and describes interrelationships between particular theories. Selected classical theorems and results relevant to current research are proved rigorously within the theory of each structure. Throughout the text the reader is frequently prompted to perform integrated exercises of verification and to explore examples.
R 8,758.00
Discrete Structural Optimization
The engineering design of structures and machines consists often in finding the best solution among a finite number of feasible decisions. This volume comprises problems and solution methods for discrete structural optimization. Exact, approximate and heuristic methods are presented applying deterministic and stochastic approaches.
R 3,122.61
Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 2,365.27
Diskrete Strukturen
Dieses Lehrbuch umfaßt Themen, die mittlerweile an vielen Universitäten unter dem Titel "Diskrete Strukturen" fester Bestandteil des Informatik-Grundstudiums sind. Die Autorin legt in ihrer Darstellung neben der mathematischen Exaktheit besonderen Wert darauf, das intuitive Verständnis zu fördern. Ihr didaktischer Ansatz hilft Studenten dabei, den Stoff leichter zu verstehen und einzuordnen. Zahlreiche Beispiele und Aufgaben, vorwiegend aus dem Bereich der Informatik, unterstützen ihr Anliegen. Die Themen: Kombinatorik, Graphentheorie, algorithmische Grundprinzipien, Rekursionsgleichungen, Algebra.
R 1,015.07
Probability on Discrete Structures
Most probability problems involve random variables indexed by space and/or time. These problems almost always have a version in which space and/or time are taken to be discrete. This volume deals with areas in which the discrete version is more natural than the continuous one, perhaps even the only one than can be formulated without complicated constructions and machinery. The 5 papers of this volume discuss problems in which there has been significant progress in the last few years; they are motivated by, or have been developed in parallel with, statistical physics. They include questions about asymptotic shape for stochastic growth models and for random clusters; existence, location and properties of phase transitions; speed of convergence to equilibrium in Markov chains, and in particular for Markov chains based on models with a phase transition; cut-off phenomena for random walks. The articles can be read independently of each other. Their unifying theme is that of models built on discrete spaces or graphs. Such models are often easy to formulate. Correspondingly, the book requires comparatively little previous knowledge of the machinery of probability.
R 3,048.35
IUTAM Symposium on Discretization Methods in Structural Mechanics
The JUT AMlIACM Symposium on Discretization Methods in Structural Mechanics was nd th held in Vienna, Austria, from 2 to 6 June 1997. The site of the Symposium was the "Theatersaal" of the Austrian Academy of Sciences. The Symposium was attended by 71 persons from 23 countries. In addition, several Austrian graduate students and research associates participated in the meeting. In the 5-day Symposium a total of 48 papers were presented. All of them were invited and accorded equal weight in the programme. The following topics were covered: • Error-controlled adaptivity of finite element methods • Large deformations and buckling, including inelastic deformations • Inelastic brittle or ductile localization, phase transition and system failure, resulting from monotonic, cyclic or impact loading • Sensitivity analysis and inverse problems with special emphasis on identification of material parameters • Development of linear and nonlinear finite element methods for thin-walled structures and composites • Implicit integration schemes for nonlinear dynamics • Coupling of rigid and deformable structures; fluid-structures and acoustic-structure interaction • Competitive numerical methods (finite element methods, boundary element methods, coupling ofthese two methods) • Identification of material and structural data. Comments on details of the treatment of these topics are contained in the Concluding Remarks. The Editors would like to express their appreciation to E. Stein who has prepared these Concluding Remarks.
R 4,668.84
Monotone Structure in Discrete-Event Systems
Information previously available only in journal articles and research papers has been brought together in this outstanding text. Uses the unifying theme of monotone structure to transcend the two-perspective approach to DES--one stressing logical/qualitative issues and the other temporal/quantitative analysis--to encompass elements from both. Features notes and references at the end of each chapter.
R 8,204.00
R 782.00
Computational Modeling of Masonry Structures Using the Discrete Element Method
The Discrete Element Method (DEM) has emerged as a solution to predicting load capacities of masonry structures. As one of many numerical methods and computational solutions being applied to evaluate masonry structures, further research on DEM tools and methodologies is essential for further advancement.Computational Modeling of Masonry Structures Using the Discrete Element Method explores the latest digital solutions for the analysis and modeling of brick, stone, concrete, granite, limestone, and glass block structures. Focusing on critical research on mathematical and computational methods for masonry analysis, this publication is a pivotal reference source for scholars, engineers, consultants, and graduate-level engineering students.
R 8,183.14
Probability on Discrete Structures
Most probability problems involve random variables indexed by space and/or time. These problems almost always have a version in which space and/or time are taken to be discrete. This volume deals with areas in which the discrete version is more natural than the continuous one, perhaps even the only one than can be formulated without complicated constructions and machinery. The 5 papers of this volume discuss problems in which there has been significant progress in the last few years; they are motivated by, or have been developed in parallel with, statistical physics. They include questions about asymptotic shape for stochastic growth models and for random clusters; existence, location and properties of phase transitions; speed of convergence to equilibrium in Markov chains, and in particular for Markov chains based on models with a phase transition; cut-off phenomena for random walks. The articles can be read independently of each other. Their unifying theme is that of models built on discrete spaces or graphs. Such models are often easy to formulate. Correspondingly, the book requires comparatively little previous knowledge of the machinery of probability.
R 3,047.45
Tale Of Discrete Mathematics, A: A Journey Through Logic, Reasoning, Structures And Graph Theory
Topics covered in Discrete Mathematics have become essential tools in many areas of studies in recent years. This is primarily due to the revolution in technology, communications, and cyber security. The book treats major themes in a typical introductory modern Discrete Mathematics course: Propositional and predicate logic, proof techniques, set theory (including Boolean algebra, functions and relations), introduction to number theory, combinatorics and graph theory.An accessible, precise, and comprehensive approach is adopted in the treatment of each topic. The ability of abstract thinking and the art of writing valid arguments are emphasized through detailed proof of (almost) every result. Developing the ability to think abstractly and roguishly is key in any areas of science, information technology and engineering. Every result presented in the book is followed by examples and applications to consolidate its comprehension. The hope is that the reader ends up developing both the abstract reasoning as well as acquiring practical skills.All efforts are made to write the book at a level accessible to first-year students and to present each topic in a way that facilitates self-directed learning. Each chapter starts with basic concepts of the subject at hand and progresses gradually to cover more ground on the subject. Chapters are divided into sections and subsections to facilitate readings. Each section ends with its own carefully chosen set of practice exercises to reenforce comprehension and to challenge and stimulate readers.As an introduction to Discrete Mathematics, the book is written with the smallest set of prerequisites possible. Familiarity with basic mathematical concepts (usually acquired in high school) is sufficient for most chapters. However, some mathematical maturity comes in handy to grasp some harder concepts presented in the book.
R 5,474.25
IUTAM Symposium on Discretization Methods in Structural Mechanics
The JUT AMlIACM Symposium on Discretization Methods in Structural Mechanics was nd th held in Vienna, Austria, from 2 to 6 June 1997. The site of the Symposium was the "Theatersaal" of the Austrian Academy of Sciences. The Symposium was attended by 71 persons from 23 countries. In addition, several Austrian graduate students and research associates participated in the meeting. In the 5-day Symposium a total of 48 papers were presented. All of them were invited and accorded equal weight in the programme. The following topics were covered: • Error-controlled adaptivity of finite element methods • Large deformations and buckling, including inelastic deformations • Inelastic brittle or ductile localization, phase transition and system failure, resulting from monotonic, cyclic or impact loading • Sensitivity analysis and inverse problems with special emphasis on identification of material parameters • Development of linear and nonlinear finite element methods for thin-walled structures and composites • Implicit integration schemes for nonlinear dynamics • Coupling of rigid and deformable structures; fluid-structures and acoustic-structure interaction • Competitive numerical methods (finite element methods, boundary element methods, coupling ofthese two methods) • Identification of material and structural data. Comments on details of the treatment of these topics are contained in the Concluding Remarks. The Editors would like to express their appreciation to E. Stein who has prepared these Concluding Remarks.
R 4,669.74
Discrete Structural Optimization
The IUTAM Symposium on "Discrete Structural Optimization" was devoted to discuss optimization problems for which design va riables may not be sought among continuous sets. Optimum sizing from lists of available profiles, segmentation; as well as allocation and number of supports, sensors or actuators, are good exam ples of such problems for which design variables may be chosen only from finite sets. The above problems are having not only important practical applications. They are also inspiring scienti fic research in the field of discrete applied mathematics. Among them are controlled enumeration methods, subgradient approach, genetic programming, multicriteria optimization, neural nets etc. Along with its tradition of promoting and supporting new im portant fields of research in mechanics and its application, General Assembly of IUTAM decided in 1990 to support the Sumposium. It is worthy to note that this is the second IUTAM Symposium on structural optimization, organized in Poland. The first one was held in Warsaw twenty years ago and was organized by Profe ssors Sawczuk and Mroz. It was devoted mostly to problems with continuous design variables. The Symposium which gathered 40 participants from 12 coun tries was sponsored by several institutions listed below. However support by IUTAM should be specially appreciated. It helped se veral scientists to contribute to the Symposium which other way wouldn't attend the meeting.
R 3,032.90
R 2,849.00
Diskrete Strukturen 2
Dieses zweibändige Lehrbuch umfaßt einen Kanon von Themen, der an vielen Universitäten unter dem Titel "Diskrete Strukturen" fester Bestandteil des Informatik-Grundstudiums geworden ist. Bei der Darstellung wird neben der mathematischen Exaktheit besonderer Wert darauf gelegt, auch das intuitive Verständnis zu fördern, um so das Verstehen und Einordnen des Stoffs zu erleichtern. Unterstützt wird dies durch zahlreiche Beispiele und Aufgaben, vorwiegend aus dem Bereich der Informatik. Das Lehrbuch basiert auf Vorlesungen, die seit mehreren Jahren an der Technischen Universität München gehalten werden.Themen des zweiten Bandes: Endliche und unendliche Wahrscheinlichkeitsräume, Markov-Ketten, Warteschlangen, Induktive Statistik.
R 877.15
Discretization Methods and Structural Optimization — Procedures and Applications
In recent years, the Finite Element Methods FEM were more and more employed in development and design departments as very fast working tools in order to determine stresses, deformations, eigenfrequencies etc. for all kinds of constructions under complex loading conditions. Meanwhile. very effective software systems have been developed by various research teams although some mathematical problems (e. g. convergence) have not been solved satisfac torily yet. In order to make further advances and to find a common language between mathe maticians and mechanicians the "Society for Applied Mathematics and Mechanics" (GAMM) agreed on the foundation of a special Committee: "Discretization Methods in Solid Mechanics" focussing on the following problems: - Structuring of various methods (displacement functions, hybrid and mixed approaches, etc. >, - Survey of approach functions (Lagrange-/Hermite-polynominals, Spline-functions), - Description of singularities, - Convergence and stability, - Practical and theoretical optimality to all mentioned issues (single and interacting). One of the basic aims of the GAMM-Committee is the interdisciplinary cooperation between mechanicians, mathematicians, and users which shall be intensified. Thus, on September 22, 1985 the committee decided to hold a seminar on "Structural Optimization" in order to allow an exchange of experiences and thoughts between the experts of finite element methods and those of structural optimization. A GAMM-seminar entitled "Discretization Methods and Structural Optimization - Procedures and Applications" was hold on October 5-7, 1988 at the Unversity of Siegen.
R 3,184.48
Discretization Methods in Structural Mechanics
The advent of the digital computer has given great impetus to the development of modern discretization methods in structural mechanics. The young history of the finite element method (FEM) reflects the dramatic increase of computing speed and storage capacity within a relatively short period of time. The history of the boundary element method (BEM) is still younger. Presently, intense scientific efforts aimed at extending the range of application of the BEM can be observed. More than 10 years ago, O.C. Zienkiewicz and his co-workers published the first papers on the coupling of FE and BE discretizations of subregions of solids for the purpose of exploiting the complementary advantages of the two discretization methods and reducing their disadvantages. The FEM has revolutionized structural analysis in industry as well as academia. The BEM has a fair share in the continuation of this revolution. Both discretization methods have become a domain of vigorous, world-wide research activities. The rapid increase of the number of specialized journals and scientific meetings indicates the remarkable increase of research efforts in this important subdolll.ain of computational ulechanics. Several discussions of this situation in the Committee for Discretization Methods ill Solid Mechanics of the Society for Applied Mathematics and Mechanics (GAMM) resulted in the plan to submit a proposal to the General Assembly of the International Union of Theoretical and Applied Mechanics (IUTAM) to sponsor a pertinent IUTAM Symposium.
R 3,065.24
Practice of Discrete Element Method in Soil-Structure Interface Modelling
This book is related to a parametric study of the soil–structural interface shearing behavior based on the numerical simulations of interface shear test with DEM, which is conducted from the role of soil properties, particle properties and structural properties.To aid readers in easily understanding the generation, implementation of models and controlling modes, for each part, the relevant code is provided in the text, and the whole source code of model is given in Appendix to share with readers for practice. The book is intended for graduate-level teaching and research in soil mechanics and geotechnical engineering, as well as in other related engineering specialties. This book is also of use to industry practitioners due to the inclusion of real-world applications, opening the door to advanced courses on modeling within the industrial engineering and operations research fields.
R 8,305.87
Discrete Optimization in Architecture
This book is comprised of two parts, both of which exploremodular systems: Pipe-Z (PZ) and Truss-Z (TZ), respectively. It presents severalmethods of creating PZ and TZ structures subjected to discrete optimization.The algorithms presented employ graph-theoretic and heuristic methods. Theunderlying idea of both systems is to create free-form structures using theminimal number of types of modular elements. PZ is more conceptual, as it formssingle-branch mathematical knots with a single type of module. Conversely, TZis a skeletal system for creating free-form pedestrian ramps and ramp networksamong any number of terminals in space. In physical space, TZ uses two types ofmodules that are mirror reflections of each other. The optimization criteriadiscussed include: the minimal number of units, maximal adherence to the givenguide paths, etc.
R 1,972.42
