Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Die Antwortzeit im Portal kann derzeit länger als üblich sein. Wir bitten um Entschuldigung.
Exportieren
Filter
Medientyp
Sprache
Region
Zugriff
  • 1
    UID:
    almahu_BV003662373
    Umfang: X, 487 S. : , Ill.
    Sprache: Englisch
    Fachgebiete: Wirtschaftswissenschaften , Komparatistik. Außereuropäische Sprachen/Literaturen
    RVK:
    RVK:
    Schlagwort(e): Symbol ; Programmiersprache ; Verarbeitung ; Programmiersprache ; Programmierung ; Nichtnumerische Datenverarbeitung ; ALGOL 68 ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Online-Ressource
    Online-Ressource
    Amsterdam, [Netherlands] :Morgan Kaufmann Publishers,
    UID:
    almatuudk_9923224851202884
    Umfang: 1 online resource (513 pages) : , illustrations.
    Ausgabe: Second edition.
    ISBN: 9786611010119 , 9781281010117 , 1281010111 , 9780080478494 , 0080478492
    Serie: Morgan Kaufmann Series in Interactive Technologies
    Anmerkung: Cover -- Contents -- Figure Credits -- Foreword -- Preface -- Chapter 1 Foundation for a Science of Data Visualisation -- Visualization Stages -- Experimental Semiotics Based on Perception -- Semiotics of Graphics -- Pictures as Sensory Languages -- Sensory versus Arbitrary Symbols -- Properties of Sensory and Arbitrary Representation -- Testing Claims about Sensory Representations -- Arbitrary Conventional Representations -- The Study of Arbitrary Conventional Symbols -- A Model of Perceptual Processing -- Stage 1: Parallel Processing to Extract Low-Level Properties of the Visual Scene -- Stage 2: Pattern Perception -- Stage 3: Sequential Goal-Directed Processing -- Types of Data -- Entities -- Relationships -- Attributes of Entities or Relationships -- Operations Considered as Data -- Metadata -- Conclusion -- Chapter 2 The Environment, Optics, Resolution and the Display -- The Environment -- Visible Light -- Ecological Optics -- Optical Flow -- Textured Surfaces and Texture Gradients -- The Paint Model of Surfaces -- The Eye -- The Visual Angle Defined -- The Lens -- Optics and Augmented-Reality Systems -- Optics in Virtual-Reality Displays -- Chromatic Aberration -- Receptors -- Simple Acuities -- Acuity Distribution and the Visual Field -- Brain Pixels and the Optimal Screen -- Spatial Contrast Sensitivity Function -- Visual Stress -- The Optimal Display -- Aliasing -- Number of Dots -- Superacuities and Displays -- Temporal Requirements of the Perfect Display -- Conclusion -- Chapter 3 Lightness, Brightness, Contrast and Constancy -- Neurons, Receptive Fields, and Brightness Illusions -- Simultaneous Brightness Contrast -- Mach Bands -- The Chevreul Illusion -- Simultaneous Contrast and Errors in Reading Maps -- Contrast Effects and Artifacts in Computer Graphics -- Edge Enhancement -- Luminance, Brightness, Lightness, and Gamma. , Luminance -- Brightness -- Adaptation, Contrast, and Lightness Constancy -- Contrast and Constancy -- Perception of Surface Lightness -- Lightness Differences and the Gray Scale -- Monitor Illumination and Monitor Surrounds -- Conclusion -- Chapter 4 Color -- Trichromacy Theory -- Color Blindness -- Color Measurement -- Change of Primaries -- CIE System of Color Standards -- Chromaticity Coordinates -- Color Differences and Uniform Color Spaces -- Opponent Process Theory -- Naming -- Cross-Cultural Naming -- Unique Hues -- Neurophysiology -- Categorical Colors -- Properties of Color Channels -- Color Appearance -- Color Contrast -- Saturation -- Brown -- Applications of Color in Visualization -- Application 1: Color Specification Interfaces and Color Spaces -- Application 2: Color for Labeling -- Application 3: Color Sequences for Data Maps -- Application 4: Color Reproduction -- Application 5: Color for Exploring Multidimensional Discrete Data -- Conclusion -- Chapter 5 Visual Attention and Information that Pops Out -- Searching the Visual Field -- Useful Field of View -- Tunnel Vision and Stress -- The Role of Motion in Attracting Attention -- Reading from the Iconic Buffer -- Preattentive Processing -- Rapid Area Judgments -- Coding with Combinations of Features -- Conjunctions with Spatial Dimensions -- Highlighting -- Designing a Symbol Set -- Neural Processing, Graphemes, and Tuned Receptors -- The Grapheme -- The Gabor Model and Texture in Visualization -- Texture Segmentation -- Tradeoffs in Information Density: An Uncertainty Principle -- Texture Coding Information -- Primary Perceptual Dimensions of Texture -- Generation of Distinct Textures -- Spatial-Frequency Channels, Orthogonality, and Maps -- Texture Resolution -- Texture Contrast Effects -- Other Dimensions of Visual Texture -- Texture Field Displays. , Glyphs and Multivariate Discrete Data -- Restricted Classification Tasks -- Speeded Classification Tasks -- Integral-Separable Dimension Pairs -- Monotonicity of Visual Attributes -- Multidimensional Discrete Data -- Stars, Whiskers, and Other Glyphs -- Conclusion -- Chapter 6 Static and Moving Patterns -- Gestalt Laws -- Proximity -- Similarity -- Connectedness -- Continuity -- Symmetry -- Closure -- Relative Size -- Figure and Ground -- More on Contours -- Perceiving Direction: Representing Vector Fields -- Comparing 2D Flow Visualization Techniques -- Perception of Transparency: Overlapping Data -- Pattern Learning -- The Perceptual Syntax of Diagrams -- The Grammar of Node-Link Diagrams -- The Grammar of Maps -- Patterns in Motion -- Form and Contour in Motion -- Moving Frames -- Expressive Motion -- Perception of Causality -- Perception of Animate Motion -- Enriching Diagrams with Simple Animation -- Conclusion -- Chapter 7 Visual Objects and Data Objects -- Image-Based Object Recognition -- Applications of Images in User Interfaces -- Structure-Based Object Recognition -- Geon Theory -- Silhouettes -- Faces -- The Object Display and Object-Based Diagrams -- The Geon Diagram -- Perceiving the Surface Shapes of Objects -- Spatial Cues for Representing Scalar Fields -- Integration of Cues for Surface Shape -- Interaction of Shading and Contour -- Guidelines for Displaying Surfaces -- Bivariate Maps: Lighting and Surface Color -- Cushion Maps -- Integration -- Conclusion -- Chapter 8 Space Perception and the Display of Data in Space -- Depth Cue Theory -- Perspective Cues -- Pictures Seen from the Wrong Viewpoint -- Occlusion -- Depth of Focus -- Cast Shadows -- Shape-from-Shading -- Eye Accommodation -- Structure-from-Motion -- Eye Convergence -- Stereoscopic Depth -- Problems with Stereoscopic Displays -- Making Effective Stereoscopic Displays. , Artificial Spatial Cues -- Depth Cues in Combination -- Task-Based Space Perception -- Tracing Data Paths in 3D Graphs -- Judging the Morphology of Surfaces and Surface Target Detection -- Patterns of Points in 3D Space -- Judging Relative Positions of Objects in Space -- Judging the Relative Movement of Self within the Environment -- Reaching for Objects -- Judging the "Up" Direction -- The Aesthetic Impression of 3D Space (Presence) -- Conclusion -- Chapter 9 Images, Worlds and Gestures -- Coding Words and Images -- The Nature of Language -- Visual and Spoken Language -- Images vs. Words -- Links between Images and Words -- Static Links -- Gestures as Linking Devices -- Deixis -- Symbolic Gestures -- Expressive Gestures -- Visual Momentum in Animated Sequences -- Animated Visual Languages -- Conclusion -- Chapter 10 Interacting with Visualizations -- Data Selection and Manipulation Loop -- Choice Reaction Time -- 2D Positioning and Selection -- Hover Queries -- Path Tracing -- Two-Handed Interaction -- Learning -- Control Compatibility -- Vigilance -- Exploration and Navigation Loop -- Locomotion and Viewpoint Control -- Frames of Reference -- Map Orientation -- Focus, Context, and Scale -- Rapid Interaction with Data -- Conclusion -- Chapter 11 Thinking with Visualizations -- Memory Systems -- Visual Working Memory -- Visual Working Memory Capacity -- Rensink's Model -- Eye Movements -- Accommodation -- Eye Movements, Search, and Monitoring -- Long-Term Memory -- Problem Solving with Visualizations -- Visual Problem Solving Processes -- The Problem Solving Strategy -- Visual Query Construction -- The Pattern-Finding Loop -- The Eye Movement Control Loop -- The Intrasaccadic Scanning Loop -- Implications for Interactive Visualization Design -- Interfaces to Knowledge Structures -- Creative Problem Solving -- Conclusion. , Appendix A Changing Primaries -- Appendix B CIE Color Measurement System -- Appendix C The Perceptual Evaluation of Visualization Techniques and Systems -- Research Goals -- Psychophysics -- Detection Methods -- Method of Adjustment -- Cognitive Psychology -- Structural Analysis -- Testbench Application for Discovery -- Structured Interviews -- Rating Scales -- Statistical Exploration -- Principal Components Analysis -- Multidimensional Scaling -- Clustering -- Multiple Regression -- Cross-Cultural Studies -- Child Studies -- Practical Problems in Conducting User Studies -- Experimenter Bias -- How Many Subjects to Use? -- Combinatorial Explosion -- Task Identification -- Controls -- Getting Help -- Bibliography -- Subject Index -- Author Index -- About the Author.
    Weitere Ausg.: ISBN 9781558608191
    Weitere Ausg.: ISBN 1558608192
    Weitere Ausg.: ISBN 9781417536931
    Weitere Ausg.: ISBN 1417536934
    Sprache: Englisch
    Schlagwort(e): Electronic books.
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Online-Ressource
    Online-Ressource
    Amsterdam ; : Morgan Kaufmann Publishers,
    UID:
    almatuudk_9922563344502884
    Umfang: 1 online resource (251 p.)
    Ausgabe: 1st edition
    ISBN: 9786611049645 , 9781281049643 , 1281049646 , 9780080553139 , 0080553133
    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 9780123706164
    Weitere Ausg.: ISBN 0123706165
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    almafu_9959186246202883
    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
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    almafu_9959186384402883
    Umfang: 1 online resource (XII, 488 p.)
    Ausgabe: 1st ed. 1989.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46153-1
    Serie: Lecture Notes in Computer Science, 358
    Inhalt: The ISSAC'88 is the thirteenth conference in a sequence of international events started in 1966 thanks to the then established ACM Special Interest Group on Symbolic and Algebraic Manipulation (SIGSAM). For the first time the two annual conferences "International Symposium on Symbolic and Algebraic Computation" (ISSAC) and "International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes" (AAECC) have taken place as a Joint Conference in Rome, July 4-8, 1988. Twelve invited papers on subjects of common interest for the two conferences are included in the proceedings and divided between this volume and the preceding volume of Lecture Notes in Computer Science which is devoted to AAECC-6. This book contains contributions on the following topics: Symbolic, Algebraic and Analytical Algorithms, Automatic Theorem Proving, Automatic Programming, Computational Geometry, Problem Representation and Solution, Languages and Systems for Symbolic Computation, Applications to Sciences, Engineering and Education.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Dynamic maintenance of paths and path expressions on graphs -- Generic programming -- From a noncomputability result to new interesting definitions and computability results -- Symbolic derivation and automatic generation of parallel routines for finite element analysis -- Liouvillian first integrals of differential equations -- Fast reduction of the Risch differential equation -- An application of reduce to the approximation of F(X,Y) -- The use of symbolic computation in solving some non-relativistic quantum mechanical problems -- Experiments with quadtree representation of matrices -- Discovering inequality conditions in the analytical solution of optimization problems -- Can EXCALC be used to investigate high-dimensional cosmological models with non-linear Lagrangians? -- Gröbner trace algorithms -- Solving systems of algebraic equations -- Groebner bases in non-commutative algebras -- Greater easy common divisor and standard basis completion algorithms -- Experiments with a projection operator for algebraic decomposition -- Rational Newton algorithm for computing formal solutions of linear differential equations -- An ordinary differential equation solver for REDUCE -- A fixed point method for power series computation -- An algorithm for symbolic computation of center manifolds -- Shortest division chains in imaginary quadratic number fields -- Effective tests for cyclotomic polynomials -- The probability of relative primality of Gaussian integers -- Some computational aspects of root finding in GF(qm) -- Symbolic computation for Witt rings -- Computations with algebraic curves -- On the computational complexity of the resolution of plane curve singularities -- Generalized characteristic polynomials -- Decomposition of algebras -- Algebraic transformations of polynomial equations, symmetric polynomials and elimination -- Tetrahedrizing point sets in three dimensions -- A generalization of the roider method to solve the robot collision problem in 3D -- Symbolic analysis of planar drawings -- A geometrical decision algorithm based on the gröbner bases algorithm -- Solving permutation problems using rewriting systems -- Applying rewriting techniques to groups with power-commutation-presentations -- Efficient decision procedures for locally finite theories II -- Aformal approach to some usually informal techniques used in mathematical reasoning -- Decision procedures for elementary sublanguages of set theory. XIV. Three languages involving rank related constructs -- Computer algebra on MIMD machine -- Algebraic extensions and algebraic closure in Scratchpad II -- Software development for computer algebra or from ALDES/SAC-2 to WEB/Modula-2 -- Cayley, version 4: The user language -- Improved sparse multivariate polynomial interpolation algorithms -- Heuristic methods for operations with algebraic numbers -- Asymptotic estimation of oscillating functions using an interval calculus -- A new algorithm for computing symbolic limits using hierarchical series -- Verification of non-identities in algebras -- Equations in words -- Cayley factorization -- Complexity of computing the characters and the genre of a system of exterior differential equations. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-51084-2
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Online-Ressource
    Online-Ressource
    Berkeley, CA :Apress :
    UID:
    almatuudk_9923049598402884
    Umfang: 1 online resource (369 pages)
    Ausgabe: 1st ed. 2024.
    ISBN: 9798868801372
    Serie: Maker Innovations Series,
    Inhalt: Gain the skills required to dive into the fundamentals of the RISC-V instruction set architecture. This book explains the basics of code optimization, as well as how to interoperate with C and Python code, thus providing the starting points for your own projects as you develop a working knowledge of assembly language for various RISC-V processors. The RISC-V processor is the new open-source CPU that is quickly gaining popularity and this book serves as an introduction to assembly language programming for the processor in either 32- or 64-bit mode. You’ll see how to write assembly language programs for several single board computers, including the Starfive Visionfive 2 and the Espressif ESP32=C3 32-bit RISC-V microcontroller. The book also covers running RISC-V Linux with the QEMU emulator on and Intel/AMD based PC or laptop and all the tools required to do so. Moving on, you’ll examine the basics of the RISC-V hardware architecture, all the groups of RISC-V assembly language instructions and understand how data is stored in the computer’s memory. In addition, you’ll learn how to interface to hardware such as GPIO ports. With RISC-V Assembly Language Programming you’ll develop enough background to use the official RISC-V reference documentation for your own projects. What You'll Learn See how data is represented and stored in a RISC-V based computer Make operating system calls from assembly language and include other software libraries in projects Interface to various hardware devices Use the official RISC-V reference documentation.
    Anmerkung: Includes index. , Intro -- Table of Contents -- About the Author -- About the Technical Reviewer -- Acknowledgments -- Introduction -- Chapter 1: Getting Started -- History and Evolution of the RISC-V CPU -- What You Will Learn -- Ten Reasons to Learn Assembly Language Programming -- Running Programs on RISC-V Systems -- Coding a Simple "Hello World" Program -- Hello World on the Starfive Visionfive 2 -- Programming Hello World in the QEMU Emulator -- Install QEMU on Windows -- Install QEMU on Linux -- Compiling in Emulated Linux -- About Hello World on the ESP32-C3 Microcontroller -- Summary -- Exercises -- Chapter 2: Loading and Adding -- Computers and Numbers -- Negative Numbers -- About Two's Complement -- RISC-V Assembly Instructions -- CPU Registers -- RISC-V Instruction Format -- About the GCC Assembler -- Adding Registers -- 32-bits in a 64-bit World -- Moving Registers -- About Pseudoinstructions -- About Immediate Values -- Loading the Top -- Shifting the Bits -- Loading Larger Numbers into Registers -- More Shift Instructions -- About Subtraction -- Summary -- Exercises -- Chapter 3: Tooling Up -- GNU Make -- Rebuild a Project -- Rule for Building .S files -- Define Variables -- Build with CMake -- Debugging with GDB -- Preparation to Debug -- Setup for Linux -- Start GDB -- Set Up gdb for the ESP32-C3 -- Debugging with GDB -- Summary -- Exercises -- Chapter 4: Controlling Program Flow -- Creating Unconditional Jumps -- Understanding Conditional Branches -- Using Branch Pseudoinstructions -- Constructing Loops -- Create FOR Loops -- Code While Loops -- Coding If/Then/Else -- Manipulating Logical Operators -- Using AND -- Using XOR -- Using OR -- Adopting Design Patterns -- Converting Integers to ASCII -- Using Expressions in Immediate Constants -- Storing a Register to Memory -- Why Not Print in Decimal? -- Performance of Branch Instructions. , Using Comparison Instructions -- Summary -- Exercises -- Chapter 5: Thanks for the Memories -- Defining Memory Contents -- Aligning Data -- About Program Sections -- Big vs. Little Endian -- Pros of Little Endian -- About Memory Addresses -- Loading a Register with an Address -- PC Relative Addressing -- Loading Data from Memory -- Combining Loading Addresses and Memory -- Storing a Register -- Optimizing Through Relaxing -- Converting to Uppercase -- Summary -- Exercises -- Chapter 6: Functions and the Stack -- About Stacks -- Jump and Link -- Nesting Function Calls -- Function Parameters and Return Values -- Managing the Registers -- Summary of the Function Call Algorithm -- Uppercase Revisited -- Stack Frames -- Stack Frame Example -- Defining Symbols -- Macros -- Include Directive -- Macro Definition -- Labels -- Why Macros? -- Using Macros to Improve Code -- Summary -- Exercises -- Chapter 7: Linux Operating System Services -- So Many Services -- Calling Convention -- Finding Linux System Call Numbers -- Return Codes -- Structures -- About Wrappers -- Converting a File to Uppercase -- Building .S Files -- Opening a File -- Error Checking -- Looping -- Summary -- Exercises -- Chapter 8: Programming GPIO Pins -- GPIO Overview -- In Linux, Everything is a File -- Flashing LEDs -- Moving Closer to the Metal -- Virtual Memory -- In Devices, Everything is Memory -- Registers in Bits -- GPIO Enable Registers -- GPIO Output Set Registers -- More Flashing LEDs -- GPIOTurnOn in Detail -- Root Access -- Summary -- Exercises -- Chapter 9: Interacting with C and Python -- Calling C Routines -- Printing Debug Information -- Preserving State -- Calling Printf -- Passing a String -- Register Masking Revisited -- Calling Assembly Routines from C -- Packaging the Code -- Static Library -- Shared Library -- Embedding Assembly Language Code inside C Code. , Calling Assembly from Python -- Summary -- Exercises -- Chapter 10: Multiply and Divide -- Multiplication -- Examples -- Division -- Division by Zero and Overflow -- Example -- Example: Matrix Multiplication -- Vectors and Matrices -- Multiplying 3x3 Integer Matrices -- Accessing Matrix Elements -- Register Usage -- Summary -- Exercises -- Chapter 11: Floating-Point Operations -- About Floating Point Numbers -- About Normalization and NaNs -- Recognizing Rounding Errors -- Defining Floating Point Numbers -- About Floating Point Registers -- The Status and Control Register -- Defining the Function Call Protocol -- Loading and Saving FPU Registers -- Performing Basic Arithmetic -- Calculating Distance Between Points -- Performing Floating-Point Conversions -- Floating-Point Sign Injection -- Comparing Floating-Point Numbers -- Example -- Summary -- Exercises -- Chapter 12: Optimizing Code -- Optimizing the Uppercase Routine -- Simplifying the Range Comparison -- Restricting the Problem Domain -- Tips for Optimizing Code -- Avoiding Branch Instructions -- Moving Code Out of Loops -- Avoiding Expensive Instructions -- Use Macros -- Loop Unrolling -- Delay Preserving Registers in Functions -- Keeping Data Small -- Beware of Overheating -- Summary -- Exercises -- Chapter 13: Reading and Understanding Code -- Browsing Linux & -- GCC Code -- Comparing Strings -- About the Algorithm -- Macros and Kernel Options -- Code Created by GCC -- Reverse Engineering and Ghidra -- Summary -- Exercises -- Chapter 14: Hacking Code -- Buffer Overrun Hack -- Causes of Buffer Overrun -- Stealing Credit Card Numbers -- Stepping Through the Stack -- Mitigating Buffer Overrun Vulnerabilities -- Do Not Use strcpy -- PIE Is Good -- Poor Stack Canaries Are the First to Go -- Preventing Code Running on the Stack -- Tradeoffs of Buffer Overflow Mitigation Techniques -- Summary. , Exercises -- Appendix A: The RISC-V Instruction Set -- RV32I Base Integer Instruction Set -- RV64I Base Integer Instruction Set-in Addition to RV32I -- RV32M Standard Extension -- RV64M Standard Extension-in Addition to RV32M -- RV32F Standard Extension -- RV64F Standard Extension-in Addition to RV32F -- RV32D Standard Extension -- RV64D Standard Extension-in Addition to RV32D -- Appendix B: Binary Formats -- Integers -- Floating Point -- Addresses -- Appendix C: Assembler Directives -- Appendix D: ASCII Character Set -- Appendix E: Answers to Exercises -- Chapter 2 -- Chapter 3 -- Chapter 5 -- Chapter 6 -- Chapter 8 -- Chapter 10 -- Chapter 12 -- Index.
    Weitere Ausg.: ISBN 9798868801365
    Sprache: Englisch
    URL: Volltext  (URL des Erstveröffentlichers)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    UID:
    almafu_9959186208102883
    Umfang: 1 online resource (XIII, 439 p.)
    Ausgabe: 1st ed. 1992.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47333-5
    Serie: Lecture Notes in Computer Science, 639
    Inhalt: This volume collects the papers presented at the first international conference dedicated to spatial and temporal reasoning in geographic space, entitled "GIS: from space to territory - theories and methods of spatio-temporal reasoning". Within the National Center for Geographic Information and Analysis (NCGIA, one of the supporters of the conference) the importance of spatial and temporal reasoning was recognized several years ago. Initial research found that spatial reasoning in geographic or large-scale space is different from spatial reasoning in small-scale space, as usually dealt with in robotics and expertsystems. Temporal reasoning has attracted interest in the artificial intelligence community. The volume also includes two invited papers: "Do people understand spatial concepts: the case of first-order primtives" by R.G. Golledge, and "Temporal databases" by R.T. Snodgrass.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Do people understand spatial concepts: The case of first-order primitives -- Temporal databases -- People manipulate objects (but cultivate fields): Beyond the raster-vector debate in GIS -- Time and space:An economic model -- The changing language of and persisting patterns in the urban design of Edo/Tokyo -- Toward a behavioral theory of regionalization -- Descriptive modeling and prescriptive modeling in spatial data handling -- The geometry of environmental knowledge -- Spatial reasoning using symbolic arrays -- Using orientation information for qualitative spatial reasoning -- The observer's point of view: An extension of symbolic projections -- Reasoning about gradual changes of topological relationships -- The meaning of “neighbour” -- A hierarchical triangle-based model for terrain description -- A model for expressing topological integrity constraints in geographic databases -- Encoding spatial information: The evidence for hierarchical processing -- Is there a relationship between spatial cognition and environmental patterns? -- Counter-intuitive geographic ‘facts’: Clues for spatial reasoning at geographic scales -- Spatial-linguistic reasoning in LEI -- User models and information theory in the design of a query interface for GIS -- A conceptual model of wayfinding using multiple levels of abstraction -- Towards acquiring spatio-temporal knowledge from sensor data -- Automatically acquiring knowledge by digital maps in artificial intelligence planning techniques -- Machine induction of geospatial knowledge -- Treatment of qualitative geographic information in monitoring environmental pollution. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-55966-3
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    UID:
    almafu_9959186222502883
    Umfang: 1 online resource (XI, 384 p.)
    Ausgabe: 1st ed. 1990.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46905-2
    Serie: Lecture Notes in Computer Science, 407
    Inhalt: This volume contains the proceedings of a workshop held in Grenoble in June 1989. This was the first workshop entirely devoted to the verification of finite state systems. The workshop brought together researchers and practitioners interested in the development and use of methods, tools and theories for automatic verification of finite state systems. The goal at the workshop was to compare verification methods and tools to assist the applications designer. The papers in this volume review verification techniques for finite state systems and evaluate their relative advantages. The techniques considered cover various specification formalisms such as process algebras, automata and logics. Most of the papers focus on exploitation of existing results in three application areas: hardware design, communication protocols and real-time systems.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Process calculi, from theory to practice: Verification tools -- Testing equivalence as a bisimulation equivalence -- The concurrency workbench -- Argonaute: Graphical description, semantics and verification of reactive systems by using a process algebra -- Using the axiomatic presentation of behavioural equivalences for manipulating CCS specifications -- Verifying properties of large sets of processes with network invariants -- A method for verification of trace and test equivalence -- Projections of the reachability graph and environment models -- Proving properties of elementary net systems with a special-purpose theorem prover -- Verification by abstraction and bisimulation -- MEC : a system for constructing and analysing transition systems -- Fair SMG and linear time model checking -- Network grammars, communication behaviors and automatic verification -- CCS, liveness, and local model checking in the linear time mu-calculus -- Implementing a model checking algorithm by adapting existing automated tools -- On-line model-checking for finite linear temporal logic specifications -- Timing assumptions and verification of finite-state concurrent systems -- Specifying, programming and verifying real-time systems using a synchronous declarative language -- Modal specifications -- Automated verification of timed transition models -- Temporal logic case study -- The complexity of collapsing reachability graphs -- What are the limits of model checking methods for the verification of real life protocols? -- Requirement analysis for communication protocols -- State exploration by transformation with lola -- Parallel protocol verification: The two-phase algorithm and complexity analysis -- Formal verification of synchronous circuits based on string-functional semantics: The 7 paillet circuits in boyer-moore -- Combining CTL, trace theory and timing models -- Localized verification of circuit descriptions -- Verification of synchronous sequential machines based on symbolic execution -- Parallel composition of lockstep synchronous processes for hardware validation: Divide-and-conquer composition. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-52148-8
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    UID:
    almafu_9959186273102883
    Umfang: 1 online resource (VIII, 404 p.)
    Ausgabe: 1st ed. 1990.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 0-387-34801-8
    Serie: Lecture Notes in Computer Science, 408
    Inhalt: Current research into formal methods for hardware design is presented in the papers in this volume. Because of the complexity of VLSI circuits, assuring design validity before circuits are manufactured is imperative. The goal of research in this area is to develop methods of improving the design process and the quality of the resulting designs. The major trend apparent at the workshop is that researchers are rapidly moving away from post hoc proof techniques with their great expense. A number of papers were presented that dealt with problems of synthesizing correct circuits and of designing with the goal of verification. Researchers are also beginning to deal with the theoretical issues of reasoning about concurrent systems and asynchronous systems, and to introduce new logical tools such as constructive type theory and category theory. Most of the research reported was performed in the United States.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Design for verifiability -- Verification of synchronous circuits by symbolic logic simulation -- Constraints, abstraction, and verification -- Formalising the design of an SECD chip -- Reasoning about state machines in higher-order logic -- A mechanically derived systolic implementation of pyramid initialization -- Behavior-preserving transformations for high-level synthesis -- From programs to transistors: Verifying hardware synthesis tools -- Combining engineering vigor with mathematical rigor -- Totally verified systems: Linking verified software to verified hardware -- What's in a timing discipline? Considerations in the specification and synthesis of systems with interacting asynchronous and synchronous components -- Complete trace structures -- The design of a delay-insensitive microprocessor: An example of circuit synthesis by program transformation -- Manipulating logical organization with system factorizations -- The verification of a bit-slice ALU -- Verification of a pipelined microprocessor using clio -- Verification of combinational logic in Nuprl -- Veritas+: A specification language based on type theory -- Categories for the working hardware designer. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 0-387-97226-9
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    UID:
    almafu_BV004243137
    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
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz