Written by the pioneer and foremost authority on the subject, this new book is both a comprehensive university textbook and professional/research reference on the finite-difference time-domain (FD-TD) computational solution method for Maxwell's equations. It presents in-depth discussions of: The revolutionary Berenger PML absorbing boundary condition; FD-TD modelling of nonlinear, dispersive, and gain optical materials used in lasers and optical microchips; unstructured FD-TD meshes for modelling of complex systems; 2.5-dimensional body-of-revolution FD-TD algorithms; Linear and nonlinear electronic circuit models, including a seamless tie-in to SPICE; Digital signal postprocessing of FD-TD data; FD-TD modelling of microlaser cavities; and FD-TD software development for the latest Intel and Cray massively parallel computers.

Creativity in Computing and DataFlow Supercomputing, the latest release in the Advances in Computers series published since 1960, presents detailed coverage of innovations in computer hardware, software, theory, design, and applications. In addition, it provides contributors with a medium in which they can explore topics in greater depth and breadth than journal articles typically allow. As a result, many articles have become standard references that continue to be of significant, lasting value in this rapidly expanding field.

This book puts in one place and in accessible form Richard Berk's most recent work on forecasts of re-offending by individuals already in criminal justice custody. Using machine learning statistical procedures trained on very large datasets, an explicit introduction of the relative costs of forecasting errors as the forecasts are constructed, and an emphasis on maximizing forecasting accuracy, the author shows how his decades of research on the topic improves forecasts of risk. Criminal justice risk forecasts anticipate the future behavior of specified individuals, rather than "predictive policing" for locations in time and space, which is a very different enterprise that uses different data different data analysis tools. The audience for this book includes graduate students and researchers in the social sciences, and data analysts in criminal justice agencies. Formal mathematics is used only as necessary or in concert with more intuitive explanations.

This volume of selected and peer-reviewed contributions on the latest developments in time series analysis and forecasting updates the reader on topics such as analysis of irregularly sampled time series, multi-scale analysis of univariate and multivariate time series, linear and non-linear time series models, advanced time series forecasting methods, applications in time series analysis and forecasting, advanced methods and online learning in time series and high-dimensional and complex/big data time series. The contributions were originally presented at the International Work-Conference on Time Series, ITISE 2016, held in Granada, Spain, June 27-29, 2016. The series of ITISE conferences provides a forum for scientists, engineers, educators and students to discuss the latest ideas and implementations in the foundations, theory, models and applications in the field of time series analysis and forecasting. It focuses on interdisciplinary and multidisciplinary research encompassing the disciplines of computer science, mathematics, statistics and econometrics.

In the last few years, courses on parallel computation have been developed and offered in many institutions in the UK, Europe and US as a recognition of the growing significance of this topic in mathematics and computer science. There is a clear need for texts that meet the needs of students and lecturers and this book, based on the author's lecture at ETH Zurich, is an ideal practical student guide to scientific computing on parallel computers working up from a hardware instruction level, to shared memory machines, and finally to distributed memory machines. Aimed at advanced undergraduate and graduate students in applied mathematics, computer science, and engineering, subjects covered include linear algebra, fast Fourier transform, and Monte-Carlo simulations, including examples in C and, in some cases, Fortran. This book is also ideal for practitioners and programmers.

This book aims at presenting the field of Quantum Information Theory in an intuitive, didactic and self-contained way, taking into account several multidisciplinary aspects. Therefore, this books is particularly suited to students and researchers willing to grasp fundamental concepts in Quantum Computation and Quantum Information areas. The field of Quantum Information Theory has increased significantly over the last three decades. Many results from classical information theory were translated and extended to a scenario where quantum effects become important. Most of the results in this area allows for an asymptotically small probability of error to represent and transmit information efficiently. Claude E.Shannon was the first scientist to realize that error-free classical information transmission can be accomplished under certain conditions. More recently, the concept of error-free classical communication was translated to the quantum context. The so-called Quantum Zero-Error Information Theory completes and extends the Shannon Zero-Error Information Theory.

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
* Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.
* The number of exercises included has more than tripled.
* Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

Growth curve models in longitudinal studies are widely used to model population size, body height, biomass, fungal growth, and other variables in the biological sciences, but these statistical methods for modeling growth curves and analyzing longitudinal data also extend to general statistics, economics, public health, demographics, epidemiology, SQC, sociology, nano-biotechnology, fluid mechanics, and other applied areas. There is no one-size-fits-all approach to growth measurement. The selected papers in this volume build on presentations from the GCM workshop held at the Indian Statistical Institute, Giridih, on March 28-29, 2016. They represent recent trends in GCM research on different subject areas, both theoretical and applied. This book includes tools and possibilities for further work through new techniques and modification of existing ones. The volume includes original studies, theoretical findings and case studies from a wide range of applied work, and these contributions have been externally refereed to the high quality standards of leading journals in the field.

This book covers applications of machine learning in artificial intelligence. The specific topics covered include human language, heterogeneous and streaming data, unmanned systems, neural information processing, marketing and the social sciences, bioinformatics and robotics, etc. It also provides a broad range of techniques that can be successfully applied and adopted in different areas. Accordingly, the book offers an interesting and insightful read for scholars in the areas of computer vision, speech recognition, healthcare, business, marketing, and bioinformatics.

This monograph combines the commutant lifting theorem for operator theory and the state space method from system theory to provide a unified approach for solving both stationary and nonstationary interpolation problems with norm constraints. Included are the operator-valued versions of the tangential Nevanlinna-Pick problem, the Hermite-FejA(c)r problem, the Nehari problem, the Sarason problem, and the two-sided Nudelman problem, and their nonstationary analogues. The main results concern the existence of solutions, the explicit construction of the central solutions in state space form, the maximum entropy property of the central solutions, and state space parametrizations of all solutions. Direct connections between the various interpolation problems are displayed. Applications to H infinity] control problems are presented. This monograph should appeal to a wide group of mathematicians and engineers. The material is self-contained and may be used for advanced graduate courses and seminars.

This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis. Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent programs. The state space of a concurrent program is described as a higher-dimensional space, the topology of which encodes the essential properties of the system. In order to analyse all possible executions in the state space, more than "just" the topological properties have to be considered: Execution paths need to respect a partial order given by the time flow. As a result, tools and concepts from topology have to be extended to take privileged directions into account. The target audience for this book consists of graduate students, researchers and practitioners in the field, mathematicians and computer scientists alike.

This easy-to-understand textbook presents a modern approach to learning numerical methods (or scientific computing), with a unique focus on the modeling and applications of the mathematical content. Emphasis is placed on the need for, and methods of, scientific computing for a range of different types of problems, supplying the evidence and justification to motivate the reader. Practical guidance on coding the methods is also provided, through simple-to-follow examples using Python. Topics and features: provides an accessible and applications-oriented approach, supported by working Python code for many of the methods; encourages both problem- and project-based learning through extensive examples, exercises, and projects drawn from practical applications; introduces the main concepts in modeling, python programming, number representation, and errors; explains the essential details of numerical calculus, linear, and nonlinear equations, including the multivariable Newton method; discusses interpolation and the numerical solution of differential equations, covering polynomial interpolation, splines, and the Euler, Runge-Kutta, and shooting methods; presents largely self-contained chapters, arranged in a logical order suitable for an introductory course on scientific computing. Undergraduate students embarking on a first course on numerical methods or scientific computing will find this textbook to be an invaluable guide to the field, and to the application of these methods across such varied disciplines as computer science, engineering, mathematics, economics, the physical sciences, and social science.

This book gives a detailed survey of the main results on bent functions over finite fields, presents a systematic overview of their generalizations, variations and applications, considers open problems in classification and systematization of bent functions, and discusses proofs of several results. This book uniquely provides a necessary comprehensive coverage of bent functions.It serves as a useful reference for researchers in discrete mathematics, coding and cryptography. Students and professors in mathematics and computer science will also find the content valuable, especially those interested in mathematical foundations of cryptography. It can be used as a supplementary text for university courses on discrete mathematics, Boolean functions, or cryptography, and is appropriate for both basic classes for under-graduate students and advanced courses for specialists in cryptography and mathematics.

This uniquely accessible book helps readers use CABology to solve real-world business problems and drive real competitive advantage. It provides reliable, concise information on the real benefits, usage and operationalization aspects of utilizing the "Trio Wave" of cloud, analytic and big data. Anyone who thinks that the game changing technology is slow paced needs to think again. This book opens readers' eyes to the fact that the dynamics of global technology and business are changing. Moreover, it argues that businesses must transform themselves in alignment with the Trio Wave if they want to survive and excel in the future. CABology focuses on the art and science of optimizing the business goals to deliver true value and benefits to the customer through cloud, analytic and big data. It offers business of all sizes a structured and comprehensive way of discovering the real benefits, usage and operationalization aspects of utilizing the Trio Wave.

This book provides a general survey of the main concepts, questions and results that have been developed in the recent interactions between quantum information, quantum computation and logic. Divided into 10 chapters, the books starts with an introduction of the main concepts of the quantum-theoretic formalism used in quantum information. It then gives a synthetic presentation of the main "mathematical characters" of the quantum computational game: qubits, quregisters, mixtures of quregisters, quantum logical gates. Next, the book investigates the puzzling entanglement-phenomena and logically analyses the Einstein-Podolsky-Rosen paradox and introduces the reader to quantum computational logics, and new forms of quantum logic. The middle chapters investigate the possibility of a quantum computational semantics for a language that can express sentences like "Alice knows that everybody knows that she is pretty", explore the mathematical concept of quantum Turing machine, and illustrate some characteristic examples that arise in the framework of musical languages. The book concludes with an analysis of recent discussions, and contains a Mathematical Appendix which is a survey of the definitions of all main mathematical concepts used in the book.

This book provides both conceptual knowledge of quantitative finance and a hands-on approach to using Python. It begins with a description of concepts prior to the application of Python with the purpose of understanding how to compute and interpret results. This book offers practical applications in the field of finance concerning Python, a language that is more and more relevant in the financial arena due to big data. This will lead to a better understanding of finance as it gives a descriptive process for students, academics and practitioners.

This book presents an intuitive picture-oriented approach to the formative processes technique and to its applications. In the first part the authors introduce basic set-theoretic terminology and properties, the decision problem in set theory, and formative processes. The second part of the book is devoted to applications of the technique of formative processes to decision problems. All chapters contain exercises and the book is appropriate for researchers and graduate students in the area of computer science logic.

This book addresses agent-based computing, concentrating in particular on evolutionary multi-agent systems (EMAS), which have been developed since 1996 at the AGH University of Science and Technology in Cracow, Poland. It provides the relevant background information on and a detailed description of this computing paradigm, along with key experimental results. Readers will benefit from the insightful discussion, which primarily concerns the efficient implementation of computing frameworks for developing EMAS and similar computing systems, as well as a detailed formal model. Theoretical deliberations demonstrating that computing with EMAS always helps to find the optimal solution are also included, rounding out the coverage.

This book is aimed at two kinds of readers: firstly, people working in or near mathematics, who are curious about continued fractions; and secondly, senior or graduate students who would like an extensive introduction to the analytic theory of continued fractions. The book contains several recent results and new angles of approach and thus should be of interest to researchers throughout the field. The first five chapters contain an introduction to the basic theory, while the last seven chapters present a variety of applications. Finally, an appendix presents a large number of special continued fraction expansions. This very readable book also contains many valuable examples and problems.

This book brings together the latest findings on efficient solutions of multi/many-objective optimization problems from the leading researchers in the field. The focus is on solving real-world optimization problems using strategies ranging from evolutionary to hybrid frameworks, and involving various computation platforms. The topics covered include solution frameworks using evolutionary to hybrid models in application areas like Analytics, Cancer Research, Traffic Management, Networks and Communications, E-Governance, Quantum Technology, Image Processing, etc. As such, the book offers a valuable resource for all postgraduate students and researchers interested in exploring solution frameworks for multi/many-objective optimization problems.

This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiri Matousek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition - something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiri Matousek's numerous areas of mathematical interest.

These are the proceedings of the 25th International Conference on Domain Decomposition Methods in Science and Engineering, which was held in St. John's, Newfoundland, Canada in July 2018. Domain decomposition methods are iterative methods for solving the often very large systems of equations that arise when engineering problems are discretized, frequently using finite elements or other modern techniques. These methods are specifically designed to make effective use of massively parallel, high-performance computing systems. The book presents both theoretical and computational advances in this domain, reflecting the state of art in 2018.

This book presents selected papers from the 3rd International Workshop on Computational Engineering held in Stuttgart from October 6 to 10, 2014, bringing together innovative contributions from related fields with computer science and mathematics as an important technical basis among others. The workshop discussed the state of the art and the further evolution of numerical techniques for simulation in engineering and science. We focus on current trends in numerical simulation in science and engineering, new requirements arising from rapidly increasing parallelism in computer architectures, and novel mathematical approaches. Accordingly, the chapters of the book particularly focus on parallel algorithms and performance optimization, coupled systems, and complex applications and optimization.

The authors describe systematic methods for uncovering scientific laws a priori, on the basis of intuition, or "Gedanken Experiments". Mathematical expressions of scientific laws are, by convention, constrained by the rule that their form must be invariant with changes of the units of their variables. This constraint makes it possible to narrow down the possible forms of the laws. It is closely related to, but different from, dimensional analysis. It is a mathematical book, largely based on solving functional equations. In fact, one chapter is an introduction to the theory of functional equations.

Threshold graphs have a beautiful structure and possess many important mathematical properties. They have applications in many areas including computer science and psychology. Over the last 20 years the interest in threshold graphs has increased significantly, and the subject continues to attract much attention.

The book contains many open problems and research ideas which will appeal to graduate students and researchers interested in graph theory. But above all "Threshold Graphs and Related Topics" provides a valuable source of information for all those working in this field.