This collection of four short courses looks at group representations, graph spectra, statistical optimality, and symbolic dynamics, highlighting their common roots in linear algebra. It leads students from the very beginnings in linear algebra to high-level applications: representations of finite groups, leading to probability models and harmonic analysis; eigenvalues of growing graphs from quantum probability techniques; statistical optimality of designs from Laplacian eigenvalues of graphs; and symbolic dynamics, applying matrix stability and K-theory. An invaluable resource for researchers and beginning Ph.D. students, this book includes copious exercises, notes, and references.

The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.

This volume contains surveys of current research directions in combinatorics written by leading researchers in their fields.

This handbook examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, this second edition presents full proofs of many important results as well as up-to-date research and conjectures. It illustrates applications of graph products in several areas and contains well over 300 exercises. Supplementary material is available on the book's website.

This outstanding new book presents the modern, geometric approach to group theory, in an accessible and engaging approach to the subject. Topics include group actions, the construction of Cayley graphs, and connections to formal language theory and geometry. Theorems are balanced by specific examples such as Baumslag-Solitar groups, the Lamplighter group and Thompson's group. Only exposure to undergraduate-level abstract algebra is presumed, and from that base the core techniques and theorems are developed and recent research is explored. Exercises and figures throughout the text encourage the development of geometric intuition. Ideal for advanced undergraduates looking to deepen their understanding of groups, this book will also be of interest to graduate students and researchers as a gentle introduction to geometric group theory.

Just like the industrial society of the last century depended on natural resources, today’s society depends on information and its exchange. Staab and Stuckenschmidt structured the selected contributions into four parts: Part I, "Data Storage and Access", prepares the semantic foundation, i.e. data modelling and querying in a flexible and yet scalable manner. These foundations allow for dealing with the organization of information at the individual peers. Part II, "Querying the Network", considers the routing of queries, as well as continuous queries and personalized queries under the conditions of the permanently changing topological structure of a peer-to-peer network. Part III, "Semantic Integration", deals with the mapping of heterogeneous data representations. Finally Part IV, "Methodology and Systems", reports experiences from case studies and sample applications. The overall result is a state-of-the-art description of the potential of Semantic Web and peer-to-peer technologies for information sharing and knowledge management when applied jointly.

This best selling text on computer organization has been thoroughly updated to reflect the newest technologies. Examples highlight the latest processor designs, benchmarking standards, languages and tools. As with previous editions, a MIPs processor is the core used to present the fundamentals of hardware technologies at work in a computer system. The book presents an entire MIPS instruction set—instruction by instruction—the fundamentals of assembly language, computer arithmetic, pipelining, memory hierarchies and I/O. A new aspect of the third edition is the explicit connection between program performance and CPU performance. The authors show how hardware and software components--such as the specific algorithm, programming language, compiler, ISA and processor implementation--impact program performance. Throughout the book a new feature focusing on program performance describes how to search for bottlenecks and improve performance in various parts of the system. The book digs deeper into the hardware/software interface, presenting a complete view of the function of the programming language and compiler--crucial for understanding computer organization. A CD provides a toolkit of simulators and compilers along with tutorials for using them. For instructor resources click on the grey "companion site" button found on the right side of this page.This new edition represents a major revision. New to this edition:* Entire Text has been updated to reflect new technology* 70% new exercises.* Includes a CD loaded with software, projects and exercises to support courses using a number of tools * A new interior design presents defined terms in the margin for quick reference * A new feature, "Understanding Program Performance" focuses on performance from the programmer's perspective * Two sets of exercises and solutions, "For More Practice" and "In More Depth," are included on the CD * "Check Yourself" questions help students check their understanding of major concepts * "Computers In the Real World" feature illustrates the diversity of uses for information technology *More detail below...

Industrial Product-Service Systems (IPS2), which is defined as “an integrated industrial product and service offering that delivers value in use,” has expanded rapidly over the last decade. IPS2 has allowed us to achieve both high added value and high productivity and has enriched our QOL by improving the performance of products and services. We are now struggling with many awkward issues related to sustainability, but IPS2 is expected to be the “philosopher’s stone” for solving these issues. Following the pattern of conferences held in Cranfield in 2009, Linköping in 2010, and Braunschweig in 2011, the fourth International CIRP Conference on Industrial Product-Service Systems, held on November 8-9, 2012, in Tokyo, will cover various aspects of IPS2. Topics planned for this year’s conference reflect the latest IPS2 information in both the natural sciences and humanities and include case studies from various industries. IPS2 is still a relatively new field, so it is important to keep track of the entire context in order to promote more cross-sectional cooperation between multimodal fields and disciplines. The fourth International CIRP Conference on Industrial Product-Service Systems will serve as a vital platform for such collaborations and the discussion of new scientific ideas.

Graph models are extremely useful for a large number of applications as they play an important role as structuring tools. They allow to model net structures – like roads, computers, telephones, social networks – instances of abstract data structures – like lists, stacks, trees – and functional or object oriented programming. The focus of this highly self-contained book is on homomorphisms and endomorphisms, matrices and eigenvalues.