Data Structures

This extensively illustrated book presents the astrophysics of galaxies since their beginnings in the early Universe. It has been thoroughly revised to take into account the most recent observational data, and recent discoveries such as dark energy. There are new sections on galaxy clusters, gamma ray bursts and supermassive black holes. The authors explore the basic properties of stars and the Milky Way before working out towards nearby galaxies and the distant Universe. They discuss the structures of galaxies and how galaxies have developed, and relate this to the evolution of the Universe. The book also examines ways of observing galaxies across the whole electromagnetic spectrum, and explores dark matter and its gravitational pull on matter and light. This book is self-contained and includes several homework problems with hints. It is ideal for advanced undergraduate students in astronomy and astrophysics.

This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and

Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Though the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze. For most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to be developed in order for analysis to take place. Still, there are several basic principles and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructi

This book gives a comprehensive description of the physics and applications of resonant tunnelling diodes. The opening chapters of the book set out the basic principles of coherent tunnelling theory. The effects of impurity scattering, femtosecond dynamics, non-equilibrium distribution and intrinsic bistabilities are then described in detail. The applications of RTDs, such as in high-frequency signal generation and multi-valued data storage, are also reviewed. The book closes with a chapter devoted to the more recent field of resonant tunnelling through laterally confined zero-dimensional structures. Covering all the key theoretical and experimental aspects of this stimulating area of research, the book will be of great value to graduate students of quantum transport physics and device engineering, as well as to researchers in both these fields.

There is a growing need for a more automated system of partitioning data sets into groups, or clusters. For example, digital libraries and the World Wide Web continue to grow exponentially, the ability to find useful information increasingly depends on the indexing infrastructure or search engine. Clustering techniques can be used to discover natural groups in data sets and to identify abstract structures that might reside there, without having any background knowledge of the characteristics of the data. Clustering has been used in a variety of areas, including computer vision, VLSI design, data mining, bio-informatics (gene expression analysis), and information retrieval, to name just a few. This book focuses on a few of the most important clustering algorithms, providing a detailed account of these major models in an information retrieval context. The beginning chapters introduce the classic algorithms in detail, while the later chapters describe clustering through divergences and sh

Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory.

Demography in Archaeology, first published in 2006, is a review of current theory and method in the reconstruction of populations from archaeological data. Starting with a summary of demographic concepts and methods, the book examines historical and ethnographic sources of demographic evidence before addressing the methods by which reliable demographic estimates can be made from skeletal remains, settlement evidence and modern and ancient biomolecules. Recent debates in palaeodemography are evaluated, new statistical methods for palaeodemographic reconstruction are explained, and the notion that past demographic structures and processes were substantially different from those pertaining today is critiqued. The book covers a wide span of evidence, from the evolutionary background of human demography to the influence of natural and human-induced catastrophes on population growth and survival. This is essential reading for any archaeologist or anthropologist with an interest in relating t

Demography in Archaeology, first published in 2006, is a review of current theory and method in the reconstruction of populations from archaeological data. Starting with a summary of demographic concepts and methods, the book examines historical and ethnographic sources of demographic evidence before addressing the methods by which reliable demographic estimates can be made from skeletal remains, settlement evidence and modern and ancient biomolecules. Recent debates in palaeodemography are evaluated, new statistical methods for palaeodemographic reconstruction are explained, and the notion that past demographic structures and processes were substantially different from those pertaining today is critiqued. The book covers a wide span of evidence, from the evolutionary background of human demography to the influence of natural and human-induced catastrophes on population growth and survival. This is essential reading for any archaeologist or anthropologist with an interest in relating t

This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. The resulting synthesis serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems. A logical perspective is adopted which employs an attribute-value description language along with complete equational axiomatizations of the various systems of feature structures. At the same time, efficiency concerns are kept in mind and complexity and representability results are provided. The application of feature structures to phrase structure grammars is described and completeness results are shown for standard evaluation strategies. Definite clause logic programs are treated as a special case of phrase structure grammars. Constraint systems are introduced and an enumeration technique is developed for solving arbitrary

When a structure is put under an increasing compressive load, it becomes unstable and buckling occurs. Buckling is a particularly significant concern in designing shell structures such as aircraft, automobiles, ships, or bridges. This book discusses stability analysis and buckling problems and offers practical tools for dealing with uncertainties that exist in real systems. The techniques are based on two complementary theories which are developed in the text. First, the probabilistic theory of stability is presented, with particular emphasis on reliability. Both theoretical and computational issues are discussed. Secondly, the authors present the alternative to probability based on the notion of 'anti-optimization', a theory that is valid when the necessary information for probabilistic analysis is absent, that is, when only scant data are available. Design engineers, researchers, and graduate students in aerospace, mechanical, marine, and civil engineering who are concerned with iss

Fundamentals of Structural Geology provides a new framework for the investigation of geological structures by integrating field mapping and mechanical analysis. Assuming a basic knowledge of physical geology, introductory calculus and physics, it emphasizes the observational data, modern mapping technology, principles of continuum mechanics, and the mathematical and computational skills, necessary to quantitatively map, describe, model, and explain deformation in Earth's lithosphere. By starting from the fundamental conservation laws of mass and momentum, the constitutive laws of material behavior, and the kinematic relationships for strain and rate of deformation, the authors demonstrate the relevance of solid and fluid mechanics to structural geology. This book offers a modern quantitative approach to structural geology for advanced students and researchers in structural geology and tectonics. It is supported by a website hosting images from the book, additional colour images, studen

In this book the theories, techniques and applications of reflection electron microscopy (REM), reflection high-energy electron diffraction (RHEED) and reflection electron energy-loss spectroscopy (REELS) are comprehensively reviewed for the first time. The book is divided into three parts: diffraction, imaging and spectroscopy. The text is written to combine basic techniques with special applications, theories with experiments, and the basic physics with materials science, so that a full picture of RHEED and REM emerges. An entirely self-contained study, the book contains much invaluable reference material, including FORTRAN source codes for calculating crystal structures data and electron energy loss spectra in different scattering geometries. This and many other features make the book an important and timely addition to the materials science literature.

During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This 2005 volume, which contains 32 papers on a broad range of topics of interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension. There are points of contact with many applied areas such as mathematical programming, visibility problems, kinetic data structures, and biochemistry, as well as with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.

Binding theory seeks to explain how different kinds of nominal expressions such as names, noun phrases and pronouns have anaphoric relations amongst one another, and how they come to have reference to things in the world. This textbook provides a thorough and comprehensive introduction to modern binding theory. Starting at a very basic level, it introduces the reader to a huge variety of nominal and especially pronominal expressions from the world's languages, the ways they can be used, and current theorising about their grammatical properties and their interpretation. Daniel Büring discusses a wide range of cross-linguistic data and theoretical approaches, and unlike in existing introductions, pairs the discussion of syntactic facts with a detailed introduction to the semantic interpretation of binding structures. Written in a clear and accessible style, and with numerous exercises and examples, this textbook will be invaluable to graduate and advanced undergraduate students of syntax

The emerging field of computational topology utilizes theory from topology and the power of computing to solve problems in diverse fields. Recent applications include computer graphics, computer-aided design (CAD), and structural biology, all of which involve understanding the intrinsic shape of some real or abstract space. A primary goal of this book is to present basic concepts from topology and Morse theory to enable a non-specialist to grasp and participate in current research in computational topology. The author gives a self-contained presentation of the mathematical concepts from a computer scientist's point of view, combining point set topology, algebraic topology, group theory, differential manifolds, and Morse theory. He also presents some recent advances in the area, including topological persistence and hierarchical Morse complexes. Throughout, the focus is on computational challenges and on presenting algorithms and data structures when appropriate.

This book provides an integrated treatment of blockmodeling, the most frequently used technique in social network analysis. It secures its mathematical foundations and then generalizes blockmodeling for the analysis of many types of network structures. Examples are used throughout the text and include small group structures, little league baseball teams, intra-organizational networks, inter-organizational networks, baboon grooming networks, marriage ties of noble families, trust networks, signed networks, Supreme Court decisions, journal citation networks, and alliance networks. Also provided is an integrated treatment of algebraic and graph theoretic concepts for network analysis and a broad introduction to cluster analysis. These formal ideas are the foundations for the authors' proposal for direct optimizational approaches to blockmodeling which yield blockmodels that best fit the data, a measure of fit that is integral to the establishment of blockmodels, and creates the potential

The authors provide a concise overview of FreeBSD's design and implementation. Then, while explaining key design decisions, they detail the concepts, data structures, and algorithms used in implement

Michael McMillan provides a complete presentation of the object-oriented features of the Visual Basic .NET language for advanced Visual Basic programmers. Beginning with an introduction to abstract data types and their initial implementation using structures, he explains standard OOP topics including class design, inheritance, access modifiers and scoping issues, abstract classes, design and implemention of interfaces and design patterns, and refactoring in VB.NET. More advanced OOP topics are included as well, such as reflection, object persistence, and serialization. To tie everything together, McMillan demonstrates sound OOP design and implementation principles through practical examples of standard Windows applications, database applications using ADO.NET, Web-based applications using ASP.NET, and Windows service applications.

Although topology was recognized by Gauss and Maxwell to play a pivotal role in the formulation of electromagnetic boundary value problems, it is a largely unexploited tool for field computation. The development of algebraic topology since Maxwell provides a framework for linking data structures, algorithms, and computation to topological aspects of three-dimensional electromagnetic boundary value problems. This book attempts to expose the link between Maxwell and a modern approach to algorithms. The first chapters lay out the relevant facts about homology and cohomology, stressing their interpretations in electromagnetism. These topological structures are subsequently tied to variational formulations in electromagnetics, the finite element method, algorithms, and certain aspects of numerical linear algebra. A recurring theme is the formulation of and algorithms for the problem of making branch cuts for computing magnetic scalar potentials and eddy currents.

In an in-depth comparative and long-term analysis, first published in 2004, Daniele Caramani studies the macro-historical process of the nationalization of politics. Using a great wealth of data on single constituencies in seventeen West European countries, he reconstructs the territorial structures of electoral support for political parties, as well as their evolution since the mid-nineteenth century from highly fragmented politics in the early stages toward nation-wide alignments. Caramani provides a multi-pronged empirical analysis through time, across countries, and between party families. The inclusion in the analysis of all the most important social and political cleavages - class, state-church, rural-urban, ethno-linguistic and religious - allows him to assess the nationalizing impact of the class cleavage that emerged from national and industrial revolutions, and the resistance of preindustrial cultural factors to national integration. Institutional and socio-economic factors a

In an in-depth comparative and long-term analysis, first published in 2004, Daniele Caramani studies the macro-historical process of the nationalization of politics. Using a great wealth of data on single constituencies in seventeen West European countries, he reconstructs the territorial structures of electoral support for political parties, as well as their evolution since the mid-nineteenth century from highly fragmented politics in the early stages toward nation-wide alignments. Caramani provides a multi-pronged empirical analysis through time, across countries, and between party families. The inclusion in the analysis of all the most important social and political cleavages - class, state-church, rural-urban, ethno-linguistic and religious - allows him to assess the nationalizing impact of the class cleavage that emerged from national and industrial revolutions, and the resistance of preindustrial cultural factors to national integration. Institutional and socio-economic factors a

A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

The paradigm of deterministic chaos has influenced thinking in many fields of science. Chaotic systems show rich and surprising mathematical structures. In the applied sciences, deterministic chaos provides a striking explanation for irregular behaviour and anomalies in systems which do not seem to be inherently stochastic. The most direct link between chaos theory and the real world is the analysis of time series from real systems in terms of nonlinear dynamics. Experimental technique and data analysis have seen such dramatic progress that, by now, most fundamental properties of nonlinear dynamical systems have been observed in the laboratory. Great efforts are being made to exploit ideas from chaos theory wherever the data displays more structure than can be captured by traditional methods. Problems of this kind are typical in biology and physiology but also in geophysics, economics, and many other sciences.

Cross-country comparisons of sectoral balance sheets offer crucial indications of differences in overall financial structure, which in turn underlie contrasts in financing and economic behaviour. In this context, this book aims to confront theory and extant empirical work with aggregate financial data across the G-7, covering the period from 1970 to 2000. Viewed in the light of the main theoretical and empirical results in the economic literature, it explores the contrasting patterns and development of financial structures in the UK, the US, Germany, Japan, Canada, France and Italy. It uses as raw material sectoral balance sheet data published by national statistical authorities across the corporate, household, general government, foreign, financial, banking and institutional-investor sectors.

A supplementary textbook for introductory programming and data structures courses using a LINUX or UNIX platform; or for advanced courses in programming, introductory software engineering, and operati

* Edited by Josef Singer, the world's foremost authority on structural buckling.* Time-saving and cost-effective design data for all structural, mechanical, and aerospace engineering researchers.

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures.

Provides an innovative hands-on introduction to techniques for specifying the behaviour of software components. It is primarily intended for use as a text book for a course in the 2nd or 3rd year of Computer Science and Computer Engineering programs, but it is also suitable for self-study. Using this book will help the reader improve programming skills and gain a sound foundation and motivation for subsequent courses in advanced algorithms and data structures, software design, formal methods, compilers, programming languages, and theory. The presentation is based on numerous examples and case studies appropriate to the level of programming expertise of the intended readership. The main topics covered are techniques for using programmer-friendly assertional notations to specify, develop, and verify small but non-trivial algorithms and data representations, and the use of state diagrams, grammars, and regular expressions to specify and develop recognizers for formal languages.

Provides an innovative hands-on introduction to techniques for specifying the behaviour of software components. It is primarily intended for use as a text book for a course in the 2nd or 3rd year of Computer Science and Computer Engineering programs, but it is also suitable for self-study. Using this book will help the reader improve programming skills and gain a sound foundation and motivation for subsequent courses in advanced algorithms and data structures, software design, formal methods, compilers, programming languages, and theory. The presentation is based on numerous examples and case studies appropriate to the level of programming expertise of the intended readership. The main topics covered are techniques for using programmer-friendly assertional notations to specify, develop, and verify small but non-trivial algorithms and data representations, and the use of state diagrams, grammars, and regular expressions to specify and develop recognizers for formal languages.

When a structure is put under an increasing compressive load, it becomes unstable and buckling occurs. Buckling is a particularly significant concern in designing shell structures such as aircraft, automobiles, ships, or bridges. This book discusses stability analysis and buckling problems and offers practical tools for dealing with uncertainties that exist in real systems. The techniques are based on two complementary theories which are developed in the text. First, the probabilistic theory of stability is presented, with particular emphasis on reliability. Both theoretical and computational issues are discussed. Secondly, the authors present the alternative to probability based on the notion of 'anti-optimization', a theory that is valid when the necessary information for probabilistic analysis is absent, that is, when only scant data are available. Design engineers, researchers, and graduate students in aerospace, mechanical, marine, and civil engineering who are concerned with iss

There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and w

The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message - or indeed an entire computer program - across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcomed by them, and their students.

The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message - or indeed an entire computer program - across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcomed by them, and their students.

Many geological features of the Earth's lithosphere create variations in the Earth's magnetic field that can be detected by satellites. The resulting magnetic anomaly maps can provide insights into the tectonic features and broad structures of the lithosphere. This book, which was originally published in 1998, documents the acquisition, reduction and analysis of satellite magnetic field data in the study of the Earth's lithosphere. The text considers issues of interpreting data, summarises various interpretation methods, considers rock magnetism concepts and sources of variation in magnetism, and provides a summary of published maps and the various methods used to create them. Mapping and interpreting lithospheric fields from satellite magnetic data has resulted in the sub-discipline of geomagnetism. Advanced students and researchers will find this book to be of interest.

A textbook for the advanced undergraduate or graduate student beginning a serious study of X-ray crystallography. It will be of interest both to those intending to become professional crystallographers and to those physicists, chemists, biologists, geologists, metallurgists and others who will use it as a tool in their research. All major aspects of crystallography are covered - the geometry of crystals and their symmetry, theoretical and practical aspects of diffracting X-rays by crystals and how the data may be analysed to find the symmetry of the crystal and its structure. Recent advances are fully covered, including the synchrotron as a source of X-rays, methods of solving structures from power data and the full range of techniques for solving structures from single-crystal data. A suite of computer programs is provided for carrying out many operations of data-processing and solving crystal structures - including by direct methods. While these are limited to two dimensions they ful

All archaeological sites have been abandoned, but people abandoned sites in many different ways, and for different reasons. What they did when leaving a settlement, structure, or activity area had a direct effect on the kind and quality of the cultural remains entering the archaeological record - for example, whether tools were removed, destroyed, or buried in the ground, and building structures dismantled or left standing. This book examines abandonment as a stage in the formation of an archaeological site, and relies on ethnoarchaelogical and archaeological data from many areas of the world - North and South America, Europe, Africa, and the Near East. It documents the many complex factors surrounding abandonment both across entire regions and within settlement areas, and makes an important theoretical and methodological contribution to this area of archaeological investigation.

The new edition of this successful and established textbook retains its two original intentions of explaining how to program in the ML language, and teaching the fundamentals of functional programming. The major change is the early and prominent coverage of modules, which are extensively used throughout. In addition, the first chapter has been totally rewritten to make the book more accessible to those without experience of programming languages. The main features of new Standard Library for the revised version of ML are described and many new examples are given, while references have also been updated. Dr Paulson has extensive practical experience of ML and has stressed its use as a tool for software engineering; the book contains many useful pieces of code, which are freely available (via the Internet) from the author. He shows how to use lists, trees, higher-order functions and infinite data structures. Many illustrative and practical examples are included.. Efficient functional imp

This book gives a comprehensive description of the physics and applications of resonant tunnelling diodes. The opening chapters of the book set out the basic principles of coherent tunnelling theory. The effects of impurity scattering, femtosecond dynamics, non-equilibrium distribution and intrinsic bistabilities are then described in detail. The applications of RTDs, such as in high-frequency signal generation and multi-valued data storage, are also reviewed. The book closes with a chapter devoted to the more recent field of resonant tunnelling through laterally confined zero-dimensional structures. Covering all the key theoretical and experimental aspects of this stimulating area of research, the book will be of great value to graduate students of quantum transport physics and device engineering, as well as to researchers in both these fields.

For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.