This is the second volume of a three-volume set comprising a comprehensive study of the tractability of multivariate problems. The second volume deals with algorithms using standard information consisting of function values for the approximation of linear and selected nonlinear functionals. An important example is numerical multivariate integration. The proof techniques used in volumes I and II are quite different. It is especially hard to establish meaningful lower error bounds for the approximation of functionals by using finitely many function values. Here, the concept of decomposable reproducing kernels is helpful, allowing it to find matching lower and upper error bounds for some linear functionals. It is then possible to conclude tractability results from such error bounds. Tractability results, even for linear functionals, are very rich in variety. There are infinite-dimensional Hilbert spaces for which the approximation with an arbitrarily small error of all linear functionals requires only one function value. There are Hilbert spaces for which all nontrivial linear functionals suffer from the curse of dimensionality. This holds for unweighted spaces, where the role of all variables and groups of variables is the same. For weighted spaces one can monitor the role of all variables and groups of variables. Necessary and sufficient conditions on the decay of the weights are given to obtain various notions of tractability. The text contains extensive chapters on discrepancy and integration, decomposable kernels and lower bounds, the Smolyak/sparse grid algorithms, lattice rules and the CBC (component-by-component) algorithms. This is done in various settings. Path integration and quantum computation are also discussed. This volume is of interest to researchers working in computational mathematics, especially in approximation of high-dimensional problems. It is also well suited for graduate courses and seminars. There are 61 open problems listed to stimulate future research in tractability.

This work offers a unified presentation of the theory of binary polynomial transforms and details their numerous applications in nonlinear signal processing. The book also: introduces the Rademacher logical functions; considers fast algorithms for computing Rademacher and polynomial logical functions; focuses attention on general auto- and cross-correlation functions; and more.;The work is intended for applied mathematicians; electrical, electronics and other engineers; computer scientists; and upper-level undergraduate and graduate students in these disciplines.

The tools and techniques you need to break the analog design bottleneck! Ten years ago, analog seemed to be a dead-end technology. Today, System-on-Chip (SoC) designs are increasingly mixed-signal designs. With the advent of application-specific integrated circuits (ASIC) technologies that can integrate both analog and digital functions on a single chip, analog has become more crucial than ever to the design process. Today, designers are moving beyond hand-crafted, one-transistor-at-a-time methods. They are using new circuit and physical synthesis tools to design practical analog circuits; new modeling and analysis tools to allow rapid exploration of system level alternatives; and new simulation tools to provide accurate answers for analog circuit behaviors and interactions that were considered impossible to handle only a few years ago. To give circuit designers and CAD professionals a better understanding of the history and the current state of the art in the field, this volume collects in one place the essential set of analog CAD papers that form the foundation of today's new analog design automation tools. Areas covered are: * Analog synthesis * Symbolic analysis * Analog layout * Analog modeling and analysis * Specialized analog simulation * Circuit centering and yield optimization * Circuit testing Computer-Aided Design of Analog Integrated Circuits and Systems is the cutting-edge reference that will be an invaluable resource for every semiconductor circuit designer and CAD professional who hopes to break the analog design bottleneck.

An essential task in radar systems is to find an appropriate solution to the problems related to robust signal processing and the definition of signal parameters. Signal Processing in Radar Systems addresses robust signal processing problems in complex radar systems and digital signal processing subsystems. It also tackles the important issue of defining signal parameters. The book presents problems related to traditional methods of synthesis and analysis of the main digital signal processing operations. It also examines problems related to modern methods of robust signal processing in noise, with a focus on the generalized approach to signal processing in noise under coherent filtering. In addition, the book puts forth a new problem statement and new methods to solve problems of adaptation and control by functioning processes. Taking a systems approach to designing complex radar systems, it offers readers guidance in solving optimization problems. Organized into three parts, the book first discusses the main design principles of the modern robust digital signal processing algorithms used in complex radar systems. The second part covers the main principles of computer system design for these algorithms and provides real-world examples of systems. The third part deals with experimental measurements of the main statistical parameters of stochastic processes. It also defines their estimations for robust signal processing in complex radar systems. Written by an internationally recognized professor and expert in signal processing, this book summarizes investigations carried out over the past 30 years. It supplies practitioners, researchers, and students with general principles for designing the robust digital signal processing algorithms employed by complex radar systems.

This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

From the reviews: "About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as "the Lawler" simply. I think that now, with this volume Springer has landed a coup: "The Schrijver". The box is offered for less than 90.- EURO, which to my opinion is one of the best deals after the introduction of this currency." OR-Spectrum

The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24–26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The Netherlands, Norway, Spain, UK, USA) attended the conference. Since1975,ithastakenplace20timesinGermany,fourtimesinTheNeth- lands, twice in Austria, as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway, and the UK. The conference aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from appli- tions. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists. There were 69 submissions. Each submission was reviewed by at least three, and on average four, Program Committee members. The Committee decided to accept 28 papers. Due to the competition and the limited schedule, some good papers could not be accepted. Theprogramalsoincludedexcellentinvitedtalks:onegivenbyDanielKràlon “AlgorithmsforClassesofGraphswithBoundedExpansion,” the otherbyDavid Eppsteinon“Graph-TheoreticSolutionstoComputationalGeometryProblems.” The proceedings contains two survey papers on these topics.