Kooperativer Bibliotheksverbund

UID:

Umfang: X, 487 S. : , Ill.

Sprache: Englisch

Fachgebiete: Informatik , Wirtschaftswissenschaften , Komparatistik. Außereuropäische Sprachen/Literaturen

Schlagwort(e): Symbol ; Programmiersprache ; Verarbeitung ; Programmiersprache ; Programmierung ; Nichtnumerische Datenverarbeitung ; ALGOL 68 ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift

UID:

Umfang: X, 487 S.

Ausgabe: 2. print.

ISBN: 0-7204-2020-2

Sprache: Englisch

Schlagwort(e): Symbol ; Programmiersprache ; Verarbeitung ; Nichtnumerische Datenverarbeitung ; ALGOL 68 ; Programmierung ; Konferenzschrift ; Konferenzschrift

UID:

Umfang: 1 online resource (251 p.)

Ausgabe: 1st edition

ISBN: 1-281-04964-6 , 9786611049645 , 0-08-055313-3

Serie: The Morgan Kaufmann series in systems on silicon

Inhalt: This book will explain how to verify SoC (Systems on Chip) logic designs using "formal? and "semiformal? verification techniques. The critical issue to be addressed is whether the functionality of the design is the one that the designers intended. Simulation has been used for checking the correctness of SoC designs (as in "functional? verification), but many subtle design errors cannot be caught by simulation. Recently, formal verification, giving mathematical proof of the correctness of designs, has been gaining popularity.For higher design productivity, it is essential to debug desig

Anmerkung: Description based upon print version of record. , Front Cover; Verification Techniques For System-Level Design; Copyright Page; Contents; Acknowledgments; Chapter 1 Introduction; Chapter 2 Higher-Level Design Methodology and Associated Verification Problems; 2.1 Introduction; 2.2 Issues in High-Level Design; 2.3 C/C++-Based Design and Specification Languages; 2.3.1 SpecC Language; 2.3.2 The Semantics of par Statements; 2.3.3 Relationship with Simulation Time; 2.4 System-Level Design Methodology Based on C/C++-Based Design and Specification Languages; 2.5 Verification Problems in High-Level Designs , Chapter 3 Basic Technology for Formal Verification3.1 The Boolean Satisfiability Problem; 3.2 The DPLL Algorithm; 3.3 Enhancements to Modern SAT Solvers; 3.4 Capabilities of Modern SAT Solvers; 3.5 Binary Decision Diagrams; 3.5.1 Manipulation of BDDs; 3.5.2 Variants of BDDs; 3.6 Automatic Test Pattern Generation Engines; 3.6.1 Single Stuck-at Testing for Combinational Circuits; 3.6.2 Stuck-at Testing in Sequential Circuits; 3.7 SAT, BDD, and ATPG Engines for Validation; 3.8 Theorem-Proving and Decision Procedures; References; Chapter 4 Verification Algorithms for FSM Models , 4.1 Combinational Equivalence Checking4.1.1 Sequential Equivalence Checking as Combinational Equivalence Checking; 4.1.2 Latch Mapping Problem; 4.1.3 EC Based on Internal Equivalences; 4.1.4 Anatomy and Capabilities of Modern CEC Tools; 4.2 Model Checking; 4.2.1 Modeling Concurrent Systems; 4.2.2 Temporal Logics; 4.2.3 Types of Properties; 4.2.4 Basic Model-Checking Algorithms; 4.2.5 Symbolic Model Checking; 4.3 Semi-Formal Verification Techniques; 4.3.1 SAT-Based Bounded Model Checking; 4.3.2 Symbolic Simulation; 4.3.3 Enhancing Simulation Using Formal Methods; 4.4 Conclusion; References , Chapter 5 Static Checking of Higher-Level Design Descriptions5.1 Program Slicing; 5.1.1 System Dependence Graph; 5.1.2 Nodes and Edges; 5.1.3 Concurrency; 5.1.4 Synchronization on Concurrent Processes; 5.2 Checking Method and Its Implying Design Flow; 5.2.1 Basic Static Description Checking; 5.2.2 Improvement of Accuracy Using Conditions of Control Nodes; 5.3 Application of the Checking Methods to HW/SW Partitioning and Optimization; 5.4 Case Study; 5.4.1 MPEG2; 5.4.2 JPEG2000; 5.4.3 Experimental Results on Static Checking; References , Chapter 6 Equivalence Checking on Higher-Level Design Descriptions6.1 Introduction; 6.2 High-Level Design Flow from the Viewpoint of Equivalence Checking; 6.3 Symbolic Simulation for Equivalence Checking; 6.4 Equivalence-Checking Methods Based on the Identification of Differences between two Descriptions; 6.4.1 Identification of Differences between Two Descriptions; 6.4.2 Symbolic Simulation Based on Textual Differences; 6.4.3 Example; 6.4.4 Experimental Results; 6.5 Further Improvement on the Use of Differences between Two Descriptions; 6.5.1 Extension of the Verification Area , 6.5.2 Symbolic Simulation on SDGs , English

Weitere Ausg.: ISBN 0-12-370616-5

Sprache: Englisch

UID:

Umfang: 1 online resource (705 pages)

ISBN: 9783030720193

Serie: Lecture Notes in Computer Science Ser. ; v.12648

Anmerkung: Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- The Decidability of Verification under PS 2.0 -- 1 Introduction -- 2 Preliminaries -- 3 The Promising Semantics -- 4 Undecidability of Consistent Reachability in PS 2.0 -- 5 Decidable Fragments of PS 2.0 -- 5.1 Formal Model of LoHoW -- 5.2 Decidability of LoHoW with Bounded Promises -- 6 Source to Source Translation -- 6.1 Translation Maps -- 7 Implementation and Experimental Results -- 8 Related Work and Conclusion -- References -- Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains -- 1 Introduction -- 1.1 Motivating Example: Leader election -- 1.2 Challenges in property checking -- 1.3 Our Contributions -- 2 Background and Terminology -- 2.1 Modeling of Asynchronous Message Passing Systems as VCFGs -- 2.2 Data flow analysis over iVCFGs -- 3 Backward DFAS Approach -- 3.1 Assumptions and Definitions -- 3.2 Properties of Demand and Covering -- 3.3 Data Flow Analysis Algorithm -- 3.4 Illustration -- 3.5 Properties of the algorithm -- 4 Forward DFAS Approach -- 5 Implementation and Evaluation -- 5.1 Benchmarks and modeling -- 5.2 Data flow analysis results -- 5.3 Limitations and Threats to Validity -- 6 Related Work -- 7 Conclusions and Future Work -- References -- Types for Complexity of Parallel Computation in Pi-Calculus -- 1 Introduction -- 2 The Pi-calculus with Semantics for Work and Span -- 2.1 Syntax, Congruence and Standard Semantics for π-Calculus -- 2.2 Semantics and Complexity -- 2.3 An Example Process -- 3 Size Types for the Work -- 3.1 Size Input/Output Types -- 3.2 Subject Reduction -- 4 Types for Parallel Complexity -- 4.1 Size Types with Time -- 4.2 Examples -- 4.3 Complexity Results -- 5 An Example: Bitonic Sort -- 6 Related Work -- 7 Perspectives -- Acknowledgements -- References. , Checking Robustness Between Weak Transactional Consistency Models-5pt -- 1 Introduction -- 2 Overview -- 3 Consistency Models -- 3.1 Robustness -- 4 Robustness Against CC Relative to PC -- 5 Robustness Against PC Relative to SI -- 6 Proving Robustness Using Commutativity DependencyGraphs -- 7 Experimental Evaluation -- 8 Related Work -- References -- Verified Software Units -- 1 Introduction -- 2 Program verification using VST -- 3 VSU calculus -- 3.1 Components and soundness -- 3.2 Derived rules -- 4 APDs and specification interfaces -- 4.1 Abstract predicate declarations (APDs) -- 4.2 Abstract specification interfaces (ASIs) -- 4.3 Verification of ASI-specified compilation units -- 4.4 A VSU for a malloc-free library -- 4.5 Putting it all together -- 5 Modular verification of the Subject/Observer pattern -- 5.1 Specification and proof reuse -- 5.2 Pattern-level specification -- 6 Verification of object principles -- 7 Discussion -- References -- An Automated Deductive Verification Framework for Circuit-building Quantum Programs -- 1 Introduction -- 1.1 Quantum computing -- 1.2 The hybrid model. -- 1.3 The problem with quantum algorithms. -- 1.4 Goal and challenges. -- 1.5 Proposal. -- 1.6 Contributions. -- 1.7 Discussion. -- 2 Background: Quantum Algorithms and Programs -- 2.1 Quantum data manipulation. -- 2.2 Quantum circuits. -- 2.3 Reasoning on circuits and the matrix semantics. -- 2.4 Path-sum representation. -- 3 Introducing PPS -- 3.1 Motivating example. -- 3.2 Parametrizing path-sums. -- 4 Qbricks-DSL -- 4.1 Syntax of Qbricks-DSL. -- 4.2 Operational semantics. -- 4.3 Properties. -- 4.4 Universality and usability of the chosen circuit constructs. -- 4.5 Validity of circuits. -- 4.6 Denotational semantics. -- 5 Qbricks-Spec -- 5.1 Syntax of Qbricks-Spec. -- 5.2 The types pps and ket. -- 5.3 Denotational semantics of the new types. , 5.4 Regular sequents in Qbricks-Spec. -- 5.5 Parametricity of PPS. -- 5.6 Standard matrix semantics and correctness of PPS semantics. -- 6 Reasoning on Quantum Programs -- 6.1 HQHL judgments. -- 6.2 Deduction rules for term constructs. -- 6.3 Deduction rules for pps. -- 6.4 Equational reasoning. -- 6.5 Additional deductive rules. -- 7 Implementation -- 8 Case studies and experimental evaluation -- 8.1 Examples of formal specifications. -- 8.2 Experimental evaluation. -- 8.3 Prior verification efforts. -- 8.4 Evaluation: benefits of PPS and Qbricks. -- 9 Related works -- 10 Conclusion -- Acknowledgments. -- References -- Nested Session Types -- 1 Introduction -- 2 Overview of Nested Session Types -- 3 Description of Types -- 4 Type Equality -- 4.1 Type Equality Definition -- 4.2 Decidability of Type Equality -- 5 Practical Algorithm for Type Equality -- 5.1 Type Equality Declarations -- 6 Formal Language Description -- 6.1 Basic Session Types -- 6.2 Type Safety -- 7 Relationship to Context-Free Session Types -- 8 Implementation -- 9 More Examples -- 10 Further Related Work -- 11 Conclusion -- References -- Coupled Relational Symbolic Execution for Differential Privacy -- 1 Introduction -- 2 CRSE Informally -- 3 Preliminaries -- 4 Concrete languages -- 4.1 PFOR -- 4.2 RPFOR -- 5 Symbolic languages -- 5.1 SPFOR -- 5.2 SRPFOR -- 6 Metatheory -- 7 Strategies for counterexample finding -- 8 Examples -- 9 Related Works -- 10 Conclusion -- References -- Graded Hoare Logic and its Categorical Semantics -- 1 Introduction -- 2 Overview of GHL and Prospectus of its Model -- 3 Loop Language and Graded Hoare Logic -- 3.1 Preliminaries -- 3.2 The Loop Language -- 3.3 Assertion Logic -- 3.4 Graded Hoare Logic -- 3.5 Example Instantiations of GHL -- 4 Graded Categories -- 4.1 Homogeneous Coproducts in Graded Categories. , 4.2 Graded Freyd Categories with Countable Coproducts -- 4.3 Semantics of The Loop Language in Freyd Categories -- 5 Modelling Graded Hoare Logic -- 5.1 Interpretation of the Assertion Logic using Fibrations -- 5.2 Interpretation of Graded Hoare Logic -- 5.3 Instances of Graded Hoare Logic -- 6 Related Work -- 7 Conclusion -- References -- Do Judge a Test by its Cover -- 1 Introduction -- 2 Classical Combinatorial Testing -- 3 Generalizing Coverage -- 4 Sparse Test Descriptions -- 4.1 Encoding "Eventually" -- 4.2 Defining Coverage -- 5 Thinning Generators with QuickCover -- 5.1 Online Generator Thinning -- 6 Evaluation -- 6.1 Case Study: Normalization Bugs in System F -- 6.2 Case Study: Strictness Analysis Bugs in GHC -- 7 Related Work -- 7.1 Generalizations of Combinatorial Testing -- 7.2 Comparison with Enumerative Property-Based Testing -- 7.3 Comparison with Fuzzing Techniques -- 8 Conclusion and Future Work -- 8.1 Variations -- 8.2 Combinatorial Coverage of More Types -- 8.3 Regular Tree Expressions for Directed Generation -- Acknowledgments -- References -- For a Few Dollars More -- 1 Introduction -- 2 Specification of Algorithms With Resources -- 2.1 Nondeterministic Computations With Resources -- 2.2 Atomic Operations and Control Flow -- 2.3 Refinement on NREST -- 2.4 Refinement Patterns -- 3 LLVM With Cost Semantics -- 3.1 Basic Monad -- 3.2 Shallowly Embedded LLVM Semantics -- 3.3 Cost Model -- 3.4 Reasoning Setup -- 3.5 Primitive Setup -- 4 Automatic Refinement -- 4.1 Heap nondeterminism refinement -- 4.2 The Sepref Tool -- 4.3 Extracting Hoare Triples -- 4.4 Attain Supremum -- 5 Case Study: Introsort -- 5.1 Specification of Sorting -- 5.2 Introsort's Idea -- 5.3 Quicksort Scheme -- 5.4 Final Insertion Sort -- 5.5 Separating Correctness and Complexity Proofs -- 5.6 Refining to LLVM -- 5.7 Benchmarks -- 6 Conclusions -- 6.1 Related Work. , 6.2 Future Work -- References -- Run-time Complexity Bounds Using Squeezers -- 1 Introduction -- 2 Overview -- 3 Complexity Analysis based on Squeezers -- 3.1 Time complexity as a function of rank -- 3.2 Complexity decomposition by partitioned simulation -- 3.3 Extraction of recurrence relations over ranks -- 3.4 Establishing the requirements of the recurrence relations extraction -- 3.5 Trace-length vs. state-size recurrences with squeezers -- 4 Synthesis -- 4.1 SyGuS -- 4.2 Verification -- 5 Empirical Evaluation -- 5.1 Experiments -- 5.2 Case study: Subsets example -- 6 Related Work -- 7 Conclusion -- Acknowledgements. -- References -- Complete trace models of state and control -- 1 Introduction -- 2 HOSC -- 3 HOSC[HOSC] -- 3.1 Names and abstract values -- 3.2 Actions and traces -- 3.3 Extended syntax and reduction -- 3.4 Configurations -- 3.5 Transitions -- 3.6 Correctness and full abstraction -- 4 GOSC[HOSC] -- 5 HOS[HOSC] -- 6 GOS[HOSC] -- 7 Concluding remarks -- 8 Related Work -- References -- Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols -- 1 Introduction -- 2 Session Types -- 3 Session Coalgebra -- 3.1 Alternative Presentation of Session Coalgebras -- 3.2 Coalgebra of Session Types -- 4 Type Equivalence, Duality and Subtyping -- 4.1 Bisimulation -- 4.2 Duality -- 4.3 Parallelizability -- 4.4 Simulation and Subtyping -- 4.5 Decidability -- 5 Typing Rules -- 5.1 A Session π-calculus -- 5.2 Typing Rules -- 6 Algorithmic Type Checking -- 7 Concluding Remarks -- References -- Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages -- 1 Introduction -- 2 A Motivating Example from Phylogenetics -- 3 A Calculus for Probabilistic Programming Languages -- 3.1 Syntax -- 3.2 Semantics -- 3.3 Resampling Semantics -- 4 The Target Measure of a Program -- 4.1 A Measure Space over Traces. , 4.2 A Measurable Space over Terms.

Weitere Ausg.: Print version: Yoshida, Nobuko Programming Languages and Systems Cham : Springer International Publishing AG,c2021 ISBN 9783030720186

Sprache: Englisch

Schlagwort(e): Electronic books. ; Electronic books

URL: Click to View

URL: Full-text  ((OIS Credentials Required))

URL: lizenzpflichtig

UID:

Umfang: 1 online resource (xiv, 257 pages) : , digital, PDF file(s).

Ausgabe: Second edition.

ISBN: 1-108-18468-5 , 1-108-18376-X , 1-108-12024-5

Inhalt: Scientific Python is a significant public domain alternative to expensive proprietary software packages. This book teaches from scratch everything the working scientist needs to know using copious, downloadable, useful and adaptable code snippets. Readers will discover how easy it is to implement and test non-trivial mathematical algorithms and will be guided through the many freely available add-on modules. A range of examples, relevant to many different fields, illustrate the language's capabilities. The author also shows how to use pre-existing legacy code (usually in Fortran77) within the Python environment, thus avoiding the need to master the original code. In this new edition, several chapters have been re-written to reflect the IPython notebook style. With an extended index, an entirely new chapter discussing SymPy and a substantial increase in the number of code snippets, researchers and research students will be able to quickly acquire all the skills needed for using Python effectively.

Anmerkung: Title from publisher's bibliographic system (viewed on 28 Aug 2017). , Cover -- Half-title page -- Title page -- Copyright page -- Contents -- Preface to the Second Edition -- Preface to the First Edition -- 1 Introduction -- 1.1 Scientific Software -- 1.2 The Plan of This Book -- 1.3 Can Python Compete with Compiled Languages? -- 1.4 Limitations of This Book -- 1.5 Installing Python and Add-ons -- 2 Getting Started with IPython -- 2.1 Tab Completion -- 2.2 Introspection -- 2.3 History -- 2.4 Magic Commands -- 2.5 IPython in Action: An Extended Example -- 2.5.1 An IPython terminal workflow -- 2.5.2 An IPython notebook workflow -- 3 A Short Python Tutorial -- 3.1 Typing Python -- 3.2 Objects and Identifiers -- 3.3 Numbers -- 3.3.1 Integers -- 3.3.2 Real numbers -- 3.3.3 Boolean numbers -- 3.3.4 Complex numbers -- 3.4 Namespaces and Modules -- 3.5 Container Objects -- 3.5.1 Lists -- 3.5.2 List indexing -- 3.5.3 List slicing -- 3.5.4 List mutability -- 3.5.5 Tuples -- 3.5.6 Strings -- 3.5.7 Dictionaries -- 3.6 Python if Statements -- 3.7 Loop Constructs -- 3.7.1 The Python for loop -- 3.7.2 The Python continue statement -- 3.7.3 The Python break statement -- 3.7.4 List comprehensions -- 3.7.5 Python while loop -- 3.8 Functions -- 3.8.1 Syntax and scope -- 3.8.2 Positional arguments -- 3.8.3 Keyword arguments -- 3.8.4 Variable number of positional arguments -- 3.8.5 Variable number of keyword arguments -- 3.8.6 Python input/output functions -- 3.8.7 The Python print function -- 3.8.8 Anonymous functions -- 3.9 Introduction to Python Classes -- 3.10 The Structure of Python -- 3.11 Prime Numbers: A Worked Example -- 4 NumPy -- 4.1 One-Dimensional Arrays -- 4.1.1 Ab initio constructors -- 4.1.2 Look-alike constructors -- 4.1.3 Arithmetical operations on vectors -- 4.1.4 Ufuncs -- 4.1.5 Logical operations on vectors -- 4.2 Two-Dimensional Arrays -- 4.2.1 Broadcasting -- 4.2.2 Ab initio constructors. , 4.2.3 Look-alike constructors -- 4.2.4 Operations on arrays and ufuncs -- 4.3 Higher-Dimensional Arrays -- 4.4 Domestic Input and Output -- 4.4.1 Discursive output and input -- 4.4.2 NumPy text output and input -- 4.4.3 NumPy binary output and input -- 4.5 Foreign Input and Output -- 4.5.1 Small amounts of data -- 4.5.2 Large amounts of data -- 4.6 Miscellaneous Ufuncs -- 4.6.1 Maxima and minima -- 4.6.2 Sums and products -- 4.6.3 Simple statistics -- 4.7 Polynomials -- 4.7.1 Converting data to coefficients -- 4.7.2 Converting coefficients to data -- 4.7.3 Manipulating polynomials in coefficient form -- 4.8 Linear Algebra -- 4.8.1 Basic operations on matrices -- 4.8.2 More specialized operations on matrices -- 4.8.3 Solving linear systems of equations -- 4.9 More NumPy and Beyond -- 4.9.1 SciPy -- 4.9.2 SciKits -- 5 Two-Dimensional Graphics -- 5.1 Introduction -- 5.2 Getting Started: Simple Figures -- 5.2.1 Front-ends -- 5.2.2 Back-ends -- 5.2.3 A simple figure -- 5.2.4 Interactive controls -- 5.3 Object-Oriented Matplotlib -- 5.4 Cartesian Plots -- 5.4.1 The Matplotlib plot function -- 5.4.2 Curve styles -- 5.4.3 Marker styles -- 5.4.4 Axes, grid, labels and title -- 5.4.5 A not-so-simple example: partial sums of Fourier series -- 5.5 Polar Plots -- 5.6 Error Bars -- 5.7 Text and Annotations -- 5.8 Displaying Mathematical Formulae -- 5.8.1 Non-LATEX users -- 5.8.2 LATEX users -- 5.8.3 Alternatives for LATEX users -- 5.9 Contour Plots -- 5.10 Compound Figures -- 5.10.1 Multiple figures -- 5.10.2 Multiple plots -- 5.11 Mandelbrot Sets: A Worked Example -- 6 Multi-Dimensional Graphics -- 6.1 Introduction -- 6.1.1 Multi-dimensional data sets -- 6.2 The Reduction to Two Dimensions -- 6.3 Visualization Software -- 6.4 Example Visualization Tasks -- 6.5 Visualization of Solitary Waves -- 6.5.1 The interactivity task -- 6.5.2 The animation task. , 6.5.3 The movie task -- 6.6 Visualization of Three-Dimensional Objects -- 6.7 A Three-Dimensional Curve -- 6.7.1 Visualizing the curve with mplot3d -- 6.7.2 Visualizing the curve with mlab -- 6.8 A Simple Surface -- 6.8.1 Visualizing the simple surface with mplot3d -- 6.8.2 Visualizing the simple surface with mlab -- 6.9 A Parametrically Defined Surface -- 6.9.1 Visualizing Enneper's surface using mplot3d -- 6.9.2 Visualizing Enneper's surface using mlab -- 6.10 Three-Dimensional Visualization of a Julia Set -- 7 SymPy: A Computer Algebra System -- 7.1 Computer Algebra Systems -- 7.2 Symbols and Functions -- 7.3 Conversions from Python to SymPy and Vice Versa -- 7.4 Matrices and Vectors -- 7.5 Some Elementary Calculus -- 7.5.1 Differentiation -- 7.5.2 Integration -- 7.5.3 Series and limits -- 7.6 Equality, Symbolic Equality and Simplification -- 7.7 Solving Equations -- 7.7.1 Equations with one independent variable -- 7.7.2 Linear equations with more than one independent variable -- 7.7.3 More general equations -- 7.8 Solving Ordinary Differential Equations -- 7.9 Plotting from within SymPy -- 8 Ordinary Differential Equations -- 8.1 Initial Value Problems -- 8.2 Basic Concepts -- 8.3 The odeint Function -- 8.3.1 Theoretical background -- 8.3.2 The harmonic oscillator -- 8.3.3 The van der Pol oscillator -- 8.3.4 The Lorenz equations -- 8.4 Two-Point Boundary Value Problems -- 8.4.1 Introduction -- 8.4.2 Formulation of the boundary value problem -- 8.4.3 A simple example -- 8.4.4 A linear eigenvalue problem -- 8.4.5 A non-linear boundary value problem -- 8.5 Delay Differential Equations -- 8.5.1 A model equation -- 8.5.2 More general equations and their numerical solution -- 8.5.3 The logistic equation -- 8.5.4 The Mackey-Glass equation -- 8.6 Stochastic Differential Equations -- 8.6.1 The Wiener process -- 8.6.2 The Itô calculus. , 8.6.3 Itô and Stratonovich stochastic integrals -- 8.6.4 Numerical solution of stochastic differential equations -- 9 Partial Differential Equations: A Pseudospectral Approach -- 9.1 Initial Boundary Value Problems -- 9.2 Method of Lines -- 9.3 Spatial Derivatives via Finite Differencing -- 9.4 Spatial Derivatives by Spectral Techniques for Periodic Problems -- 9.5 The IVP for Spatially Periodic Problems -- 9.6 Spectral Techniques for Non-Periodic Problems -- 9.7 An Introduction to f2py -- 9.7.1 Simple examples with scalar arguments -- 9.7.2 Vector arguments -- 9.7.3 A simple example with multi-dimensional arguments -- 9.7.4 Undiscussed features of f2py -- 9.8 A Real-Life f2py Example -- 9.9 Worked Example: Burgers' Equation -- 9.9.1 Boundary conditions: the traditional approach -- 9.9.2 Boundary conditions: the penalty approach -- 10 Case Study: Multigrid -- 10.1 The One-Dimensional Case -- 10.1.1 Linear elliptic equations -- 10.1.2 Smooth and rough modes -- 10.2 The Tools of Multigrid -- 10.2.1 Relaxation methods -- 10.2.2 Residual and error -- 10.2.3 Prolongation and restriction -- 10.3 Multigrid Schemes -- 10.3.1 The two-grid algorithm -- 10.3.2 The V-cycle scheme -- 10.3.3 The full multigrid (FMG) scheme -- 10.4 A Simple Python Multigrid Implementation -- 10.4.1 Utility functions -- 10.4.2 Smoothing functions -- 10.4.3 Multigrid functions -- Appendix A Installing a Python Environment -- A.1 Installing Python Packages -- A.2 Communication with IPython Using the Jupyter Notebook -- A.2.1 Starting and stopping the notebook -- A.2.2 Working in the notebook -- A.2.2.1 Entering headers -- A.2.2.2 Entering Markdown text -- A.2.2.3 Converting notebooks to other formats -- A.3 Communication with IPython Using Terminal Mode -- A.3.1 Editors for programming -- A.3.2 The two-windows approach -- A.3.3 Calling the editor from within IPython. , A.3.4 Calling IPython from within the editor -- A.4 Communication with IPython via an IDE -- A.5 Installing Additional Packages -- Appendix B Fortran77 Subroutines for Pseudospectral Methods -- References -- Hints for Using the Index -- Index.

Weitere Ausg.: ISBN 1-316-64123-6

Sprache: Englisch

Fachgebiete: Informatik

URL: Volltext  (lizenzpflichtig)

URL: Inhaltstext

URL: https://doi.org/10.1017/9781108120241

UID:

Umfang: 1 online resource (ix, 476 pages) : , illustrations.

ISBN: 0-262-27718-2 , 0-585-04844-4 , 9780262277181

Serie: Complex adaptive systems

Inhalt: There is increasing interest in genetic programming by both researchers and professional software developers. These twenty-two invited contributions show how a wide variety of problems across disciplines can be solved using this new paradigm.There is increasing interest in genetic programming by both researchers and professional software developers. These twenty-two invited contributions show how a wide variety of problems across disciplines can be solved using this new paradigm.Advances in Genetic Programming reports significant results in improving the power of genetic programming, presenting techniques that can be employed immediately in the solution of complex problems in many areas, including machine learning and the simulation of autonomous behavior. Popular languages such as C and C++ are used in many of the applications and experiments, illustrating how genetic programming is not restricted to symbolic computing languages such as LISP. Researchers interested in getting started in genetic programming will find information on how to begin, on what public domain code is available, and on how to become part of the active genetic programming community via electronic mail.A major focus of the book is on improving the power of genetic programming. Experimental results are presented in a variety of areas, including adding memory to genetic programming, using locality and "demes" to maintain evolutionary diversity, avoiding the traps of local optima by using coevolution, using noise to increase generality, and limiting the size of evolved solutions to improve generality.Significant theoretical results in the understanding of the processes underlying genetic programming are presented, as are several results in the area of automatic function definition. Performance increases are demonstrated by directly evolving machine code, and implementation and design issues for genetic programming in C++ are discussed.

Anmerkung: "A Bradford book." , Available through MITCogNet. , A perspective on the work in this book / Kenneth E. Kinnear, Jr. -- Introduction to genetic programming / John R. Koza -- The evolution of evolvability in genetic programming / Lee Altenberg -- Genetic programming and emergent intelligence / Peter J. Angeline -- Scalable learning in genetic programming using automatic function definition / John R. Koza -- Alternatives in automatic function definition: a comparison of performance / Kenneth E. Kinnear, Jr. -- The donut problem: scalability, generalization and breeding policies in genetic programming / Walter Alden Tackett, Aviram Carmi -- Effects of locality in individual and population evolution / Patrik D'haeseleer, Jason Bluming -- The evolution of mental models / Astro Teller -- Evolution of obstacle avoidance behavior: using noise to promote robust solutions / Craig W. Reynolds -- Pygmies and civil servants / Conor Ryan -- Genetic programming using a minimum decsription length principle / Hitoshi Iba, Hugo de Garis, Taisuke Sato -- Genetic programming in C++: implementation issues / Mike J. Keith, Martin C. Martin. A compiling genetic programming system that directly manipulates the machine code / Peter Nordin -- Automatic generation of programs for crawling and walking / Graham Spencer -- Genetic programming for the acquisition of double auction market strategies / Martin Andrews, Richard Prager -- Two scientific applications of genetic programming: stack filters and non-linear equation fitting to chaotic data / Howard Oakley -- The automatic generation of plans for a mobile robot via genetic programming with automatically defined functions / Simon G. Handley -- Competitively evolving decision trees against fixed training cases for natural language processing / Eric V. Siegel -- Cracking and co-evolving randomizers / Jan Jannink -- Optimizing confidence of text classification by evolution of symbolic expressions / Brij Masand -- Evolvable 3D modeling for model-based object recognition systems / Thang Nguyen, Thomas Huang. Automatically defined features: the simultaneous evolution of 2-dimensional feature detectors and an algorithm for using them / David Andre -- Genetic micro programming of neural networks / Frédéric Gruau. , English

Weitere Ausg.: ISBN 0-262-51553-9

Weitere Ausg.: ISBN 0-262-11188-8

Sprache: Englisch

URL: lizenzpflichtig

URL: lizenzpflichtig

URL: MIT CogNet

URL: OCLC metadata license agreement

UID:

Umfang: X, 487 S , graph. Darst

Sprache: Englisch

Fachgebiete: Philosophie

Schlagwort(e): Konferenzschrift

UID:

Umfang: X, 487 S. 8"

Anmerkung: [Nebent.:] IFIP Working Conference on Symbol Manipulation Languages , Literaturverz. S. 358-437

Sprache: Unbestimmte Sprache

UID:

Umfang: 1 online resource (XI, 590 p.)

Ausgabe: 1st ed. 1981.

Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5

ISBN: 3-540-38769-2

Serie: Lecture Notes in Computer Science, 118

Anmerkung: Bibliographic Level Mode of Issuance: Monograph , The complexity of manipulating hierarchically defined sets of rectangles -- The transformational machine: Theme and variations -- Probabilistic two-way machines -- A survey of some recent results on computational complexity in weak theories of arithmetic -- A survey on oracle techniques -- Time and space bounded complexity classes and bandwidth constrained problems -- Representations of graphs by means of products and their complexity -- Parsing strategies: A concise survey -- The art of dynamizing -- Fast parallel computation of polynomials using few processors -- Generalizations of Petri nets -- Partial match retrieval in implicit data structures -- A characterization of Floyd-provable programs -- Semantics of CSP via translation into CCS -- More about the "geography" of context-free languages -- On the power of algebraic specifications -- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages -- On the complexity of word problems in certain Thue systems -- On the transformation of derivation graphs to derivation trees -- Pushdown automata with restricted use of storage symbols -- Structured nets -- Retraceability, repleteness and busy beaver sets -- Combining T and level-N -- On realization and implementation -- Multiplicative complexity of a bilinear form over a commutative ring -- Making dynamic logic first-order -- Partial interpretations of program schemata -- Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata -- Another hierarchy defined by multihead finite automata -- An extension of Rabin's complete proof concept -- How to find invariants for coloured Petri nets -- Relationships between probabilistic and deterministic tape complexity -- Grammatical levels of the position restricted grammars -- A general framework for comparing sequential and parallel rewriting -- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit -- Codings of nonnegative integers -- The maximum k-flow in a network -- On the constructive description of graph languages accepted by finite automata -- Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries -- Maximum flow in planar networks -- Probabilistic combinatorial optimization -- Time-processor trade-offs for universal parallel computers -- Negative results on the size of deterministic right parsers -- Key-equivalence of functional dependency statements systems -- On representation of dynamic algebras with reversion -- A framework for studying grammars -- On existence of complete predicate calculus in metamathematics without exponentiation -- On structural similarity of context-free grammars -- Axioms for the term-wise correctness of programs -- Complexity and entropy -- Axiomatic semantics of indirect addressing -- Testing of join dependency preserving by a modified chase method -- A starvation-free solution of the dining philosophers' problem by use of interaction systems -- Admissible representations of effective cpo's -- Preserving total order in constant expected time -- Constructive category theory (No. 1) -- Two pebbles don't suffice. , English

In: Springer eBooks

Weitere Ausg.: ISBN 3-540-10856-4

Sprache: Englisch

DOI: 10.1007/3-540-10856-4

URL: http://dx.doi.org/10.1007/3-540-10856-4

UID:

Umfang: 1 online resource (305 pages)

Ausgabe: Second edition.

ISBN: 0-19-049952-4 , 0-19-992035-4

Inhalt: How to Write for Percussion is a comprehensive resource that clearly explains and simplifies all issues that percussionists and composers face with respect to each other. Written from a percussionist's perspective, it examines the behind-the-scenes processes to uncover all the tools the composer needs to comfortably create innovative and skilled percussion composition.

Anmerkung: Includes index. , Introduction. How this book is organized ; Instruments covered ; Working with percussionists ; Location specifics ; The value of not reading this book. , General framework. A dysfunctional family. Comparison of family relationships -- The problem of pitch. The pitches of percussion ; The validations and limitations of novelty ; Three methods for indeterminately pitch instruments -- The written/improv divide. Expanding the color palette (to shrink the setup) ; The value of improvised and non-notated music -- Social composition. Write for people, not sounds ; Write what is wanted, not what to do ; Working with percussionists. , General logistics. Instrument choice and management. Six stories, three sad and three happy ; Why use fewer instruments? ; How to consolidate ; Inexpensive instruments ; Exotic instruments ; Electronic percussion ; Multiple options for a specified instrument ; Instruments percussionists may not play ; Multiple percussionists ; Section setup ; Orchestra ; Wind ensemble ; Broadway pit ; Drum corps and marching bands ; Specialists ; Non-percussionists playing percussion ; Chairs and stands -- Issues of playability. Excessive polyphony ; How fast percussionists can play ; Unidiomatic writing : music that often requires memorization ; Dynamics ; Reaching the instruments ; Instruments with pedals ; Physical exertion and shaking ; Working with headphones or headset microphones. , General notation. Basics of percussion parts and scores. Instrument list ; Instrument key ; Setup diagram ; Language ; Parts ; Cues ; Percussion in the conductor's score ; Dynamics -- Designing a notational system. Clefs ; Staves ; Noteheads ; Mixing determinately and indeterminately pitched instruments ; Key signatures ; What goes where on the staff ; The chicken or the egg? ; Unspecified instruments (indeterminate instrumentation) ; How much to notate ; Systems of notation for which there is no standard ; Return to a "normal" method of playing -- Note length, articulation, and phrasing. Note length chart ; Exact or inexact note-length indications ; Muting (muffling, dampening) ; Dead stroke ; Damper pedals ; Rolls -- Notations that are not recommended. Symbol notation ; Altered keyboard notation (timbre-staff). , Beaters. To indicate or not to indicate? ; Beater lingo ; Logistical beater issues ; Sticks ; Mallets ; Triangle beaters and Knitting needles ; Brushes ; Rute sticks ; Chime hammers (Tubular bell hammers) ; Superball mallet ; Beaters as instruments ; Hands ; Bows -- Keyboard percussion. Ranges and construction ; Writing for keyboard percussion ; Stacked instruments ; Multiple players ; Extended techniques ; Miscellaneous. , Drums. Sticks on drums ; Mallets on drums ; Hands on drums ; Playing on the rim or shell ; Beating spot ; Mutes ; Pitch bending ; Drum size ; Two-headed drums ; Multiple drums in setups ; Idiomatic writing for drums ; Timpani ; Tom-toms ; Snare drum, Field drum, and Tenor drum ; Concert bass drum and Pedal bass drum ; Bongos and Congas ; Timbales ; Roto-toms ; Frame drums ; Tambourines ; Djembe and Doumbek ; Boobams ; Drumset. , Metal. Cymbals ; Gongs ; Finger cymbals ; Cowbells and Almglocken ; Temple bowls and Mixing bowls ; Brake drums, Metal pipes, Anvils, and Bell plates ; Thundersheet ; Junk metal, Tin cans, and Pots and pans ; Ribbon crasher ; Spring coil ; Church bells ; Hand bells ; Steel drums ; Tambourines ; Sleighbells ; Metal wind chimes, Mark tree, and Bell tree ; Flexatone ; Extended techniques. , Wood. Woodblocks, Templeblocks, and Log drum ; Wooden planks ; Wood drums, Wooden boxes, Cajâon, and Mahler hammer ; Claves ; Castanets ; Rute ; Guiro ; Slapstick ; Ratchet ; Bamboo wind chimes -- Miscellaneous instruments. Bottles ; Cabasa ; Conch shell ; Crystal glasses ; Maracas and Shakers ; Rainstick ; Rice bowls and Flower pots ; Sandpaper blocks ; Sirens ; String drum and Cuica ; Stones and Prayer stones ; Thumb piano ; Vibraslap ; Wind chimes ; Whistles ; Wind machine -- , Appendix A. Repertoire analysis. Percussion ensemble. Edgard Varáese, Ionisation (1929-1931) ; John Cage, Constructions (1939-1942) ; Iannis Xenakis, Persephassa (1969) ; Steve Reich, Drumming (1970-1971) ; Steve Mackey, It is time (2010) ; John Luther Adams, Inuksuit (2009) ; Ryan Streber, Cold pastoral (2004) ; Nico Muhly, Ta & clap (2004) ; Adam Silverman, Naked and on fire (2011) ; Paul Lansky, Travel diary (2007) -- Orchestral. Bâela Bartâok ; Sergei Prokofiev ; Maurice Ravel ; Gustav Mahler ; Dmitri Shostakovich ; Leonard Bernstein ; Carl Nielsen ; Jean Sibelius ; Wind Ensemble -- Smaller mixed ensemble. John Adams, Chamber symphony (1992) ; Stephan Hartke, Meanwhile (2007) ; Jacob Druckman, Come round (1992) ; Charles Wuorinen, New York notes (1982) ; Pierre Boulez, Sur incises (1996/1998) -- Percussion solo : Drums. Michio Kitazume, Side by side (1991) ; Elliott Carter, Eight pieces for four timpani (1950/1966) ; Casey Cangelosi, Meditation no. 1 (2011) -- Percussion solo : Keyboards. Jacob Druckman, Reflections on the nature of water (1986) ; Paul Simon, Amulet (2008) ; Steve Mackey, See ya Thursday (1992) ; Steve Swallow/Gary Burton, I'm your pal and Hullo Bolinas ; Donald Martino, Soliloquy (2003) -- Percussion solo : Multi-percussion. Iannis Xenakis, Psappha (1975) ; David Lang, Anvil chorus (1991) ; Roger Reynolds, Watershed (1995) ; Four Pieces for the author's "Setup #1" ; Nico Muhly, It's about time (2004) ; Michael Early, Raingutter (2007) ; Marcos Balter, Descarga (2006) ; Judd Greenstein, We shall be turned (2006) -- Percussion concerto. James MacMillan, Veni veni Emmanuel (1992) ; Einojuhani Rautavaara, Incantations (2008) ; Steven Mackey, Micro-concerto (1999) -- Orchestrating native sound. , 505 8 $a Appendix B. Sample setups -- Appendix C. Extended techniques. Return to a "normal" method of playing ; Manipulations of timbre ; Striking unusual parts of an instrument ; Unusual usage of beaters ; Dead stroke ; Beating spot ; Bowing ; Friction roll ; Scrape ; Prepared instruments ; Pitch bending ; Vibrato ; Adding mass ; Sympathetic resonance ; Clusters ; Harmonics -- Appendix D. Pitch specification -- Appendix E. Dynamics -- Appendix F. Register -- Appendix G. Beaters -- Appendix H. Percussion family tree. Pitch clarity chart ; Note length chart ; Register chart ; Sound production chart ; The percussion family tree.

Weitere Ausg.: ISBN 0-19-992034-6

Weitere Ausg.: ISBN 0-19-992036-2

Sprache: Englisch

Schlagwort(e): Electronic books.

URL: Click to View