Read an interview with the author: "Working Toward Gender Parity in the Geosciences" The geoscience workforce has a lower proportion of women compared to the general population of the United States and compared to many other STEM fields. This volume explores issues pertaining to gender parity in the geosciences, and sheds light on some of the best practices that increase participation by women and promote parity. Volume highlights include: • Lessons learned from NSF-ADVANCE • Data on gender composition of faculty at top earth science institutions in the US • Implicit bias and gender as a social structure • Strategies for institutional change • Dual career couples • Family friendly policies • Role of mentoring • Career advancement for women • Recruiting diverse faculty • Models of institutional transformation Women in the Geosciences is a valuable contribution to the existing literature on gender issues in STEM disciplines. It focuses specifically on the geosciences, with a goal to spreading awareness on the best practices for gender parity in academic geoscience departments. Geoscientists, policymakers, educators and administrators could all greatly benefit from the contents of this volume.
This book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.
By providing expositions to modeling principles, theories, computational solutions, and open problems, this reference presents a full scope on relevant biological phenomena, modeling frameworks, technical challenges, and algorithms. Up-to-date developments of structures of biomolecules, systems biology, advanced models, and algorithms Sampling techniques for estimating evolutionary rates and generating molecular structures Accurate computation of probability landscape of stochastic networks, solving discrete chemical master equations End-of-chapter exercises
Presents information in a user-friendly, easy-access way so that the book can act as either a quick reference for more experienced engineers or as an introductory guide for new engineers and college graduates.
This book constitutes the refereed proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2004, held in Montevideo, Uruguay in March 2005. The 33 revised full papers presented together with abstracts of 4 invited papers were carefully reviewed and selected from 77 submissions. The papers address all current issues in logic programming, automated reasoning, and AI logics in particular description logics, fuzzy logic, linear logic, multi-modal logic, proof theory, formal verification, protocol verification, constraint logic programming, programming calculi, theorem proving, etc.
The topics of this thesis are the modal μ-calculus and parity games. The modal μ-calculus is a common logic for model-checking in computer science. The model-checking problem of the modal μ-calculus is polynomial time equivalent to solving parity games, a 2-player game on labeled directed graphs. We present the first FPT algorithms (fixed-parameter tractable) for the model-checking problem of the modal μ-calculus on restricted classes of graphs, specifically on classes of bounded Kelly-width or bounded DAG-width. In this process we also prove a general decomposition theorem for the modal μ-calculus and define a useful notion of type for this logic. Then, assuming a class of parity games has a polynomial time algorithm solving it, we consider the problem of extending this algorithm to larger classes of parity games. In particular, we show that joining games, pasting games, or adding single vertices preserves polynomial-time solvability. It follows that parity games can be solved in polynomial time if their underlying undirected graph is a tournament, a complete bipartite graph, or a block graph. In the last chapter we present the first non-trivial formal proof about parity games. We explain a formal proof of positional determinacy of parity games in the proof assistant Isabelle/HOL. Die Themen dieser Dissertation sind der modale μ-Kalkül und Paritätsspiele. Der modale μ-Kalkül ist eine häufig eingesetzte Logik im Bereich des Model-Checkings in der Informatik. Das Model-Checking-Problem des modalen μ-Kalküls ist polynomialzeitäquivalent zum Lösen von Paritätsspielen, einem 2-Spielerspiel auf beschrifteten, gerichteten Graphen. Wir präsentieren die ersten FPT-Algorithmen (fixed-parameter tractable) für das Model-Checking-Problem des modalen μ-Kalküls auf Klassen von Graphen mit beschränkter Kelly-Weite oder beschränkter DAG-Weite. Für diesen Zweck beweisen wir einen allgemeineren Zerlegungssatz für den modalen μ-Kalkül und stellen eine nützliche Definition von Typen für diese Logik vor. Angenommen, eine Klasse von Paritätsspielen hat einen Polynomialzeit-Lösungs-Algorithmus, betrachten wir danach das Problem, diese Klassen zu erweitern auf eine Weise, sodass Polynomialzeit-Lösbarkeit erhalten bleibt. Wir zeigen, dass dies beim Join von Paritätsspielen, beim Pasting und beim Hinzufügen einzelner Knoten der Fall ist. Wir folgern daraus, dass das Lösen von Paritätsspielen in Polynomialzeit möglich ist, falls der unterliegende ungerichtete Graph ein Tournament, ein vollständiger bipartiter Graph oder ein Blockgraph ist. Im letzten Kapitel präsentieren wir den ersten nicht-trivialen formalen Beweis über Paritätsspiele. Wir stellen einen formalen Beweis für die positionale Determiniertheit von Paritätsspielen im Beweis-Assistenten Isabelle/HOL vor.
An extensive and authoritative introduction to property testing, the study of super-fast algorithms for the structural analysis of large quantities of data in order to determine global properties. This book can be used both as a reference book and a textbook, and includes numerous exercises.
For more than two thousand years a familiarity with mathematics has been regarded as an indispensable part of the intellectual equipment of every cultured person. Today, unfortunately, the traditional place of mathematics in education is in grave danger. The teaching and learning of mathematics has degenerated into the realm of rote memorization, the outcome of which leads to satisfactory formal ability but does not lead to real understanding or to greater intellectual independence. This new edition of Richard Courant's and Herbert Robbins's classic work seeks to address this problem. Its goal is to put the meaning back into mathematics. Written for beginners and scholars, for students and teachers, for philosophers and engineers, What is Mathematics?, Second Edition is a sparkling collection of mathematical gems that offers an entertaining and accessible portrait of the mathematical world. Covering everything from natural numbers and the number system to geometrical constructions and projective geometry, from topology and calculus to matters of principle and the Continuum Hypothesis, this fascinating survey allows readers to delve into mathematics as an organic whole rather than an empty drill in problem solving. With chapters largely independent of one another and sections that lead upward from basic to more advanced discussions, readers can easily pick and choose areas of particular interest without impairing their understanding of subsequent parts. Brought up to date with a new chapter by Ian Stewart, What is Mathematics?, Second Edition offers new insights into recent mathematical developments and describes proofs of the Four-Color Theorem and Fermat's Last Theorem, problems that were still open when Courant and Robbins wrote this masterpiece, but ones that have since been solved. Formal mathematics is like spelling and grammar--a matter of the correct application of local rules. Meaningful mathematics is like journalism--it tells an interesting story. But unlike some journalism, the story has to be true. The best mathematics is like literature--it brings a story to life before your eyes and involves you in it, intellectually and emotionally. What is Mathematics is like a fine piece of literature--it opens a window onto the world of mathematics for anyone interested to view.
Digital Transmission Systems, Third Edition, is a comprehensive overview of the theory and practices of digital transmission systems used in digital communication. This new edition has been completely updated to include the latest technologies and newest techniques in the transmission of digitized information as well as coverage of digital transmission design, implementation and testing.
