| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910778897703321 |
|
|
Autore |
Honeywill Paul |
|
|
Titolo |
Visual language for the world wide web [[electronic resource] /] / Paul Honeywill |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Exeter, England ; ; Portland, OR, : Intellect, 1999 |
|
|
|
|
|
|
|
ISBN |
|
1-280-47744-X |
9786610477449 |
1-84150-862-4 |
0-585-21099-3 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (194 p.) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Web sites |
Visual communication |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (p. 183-188) and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Front Cover; Preliminaries; Table of Contents; Acknowledgements; Trademarks; Introduction to a Visual Language for the World Wide Web; Chapter 1: Learning from the Past to Inform the Present: Maya Hieroglyphic Writing; Chapter 2: Simple Words and Visual Metaphors; Chapter 3: Designing Icons for the Graphical User Interface; Chapter 4: Computer Compound Icons and their Families; Chapter 5: Evaluating Representative and Abstract Computer Compound Icons; Chapter 6: Navigating Interfaces; Conclusion; Bibliography; Index; Back Cover |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
In this digital age, are there cultural lessons for us in looking to the earliest kinds of communications? The icons used in ancient Mayan and Sumerian language systems are presented here as direct cultural links to the visual presentation of World Wide Web pages on the Internet. The book shows how the development of digital screens has caused visual human communication to come full circle from the earliest representations. The in-depth analysis demonstrates how these visual languages now serve as a rich source for renewed study for the development of meaningful computer icons. Readers are als |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910484772803321 |
|
|
Titolo |
Reachability Problems : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings / / edited by Joel Ouaknine, Igor Potapov, James Worrell |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2014.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XX, 246 p. 59 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8762 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Software engineering |
Compilers (Computer programs) |
Machine theory |
Coding theory |
Information theory |
Theory of Computation |
Computer Science Logic and Foundations of Programming |
Software Engineering |
Compilers and Interpreters |
Formal Languages and Automata Theory |
Coding and Information Theory |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
Complexity Bounds for Ordinal-Based Termination -- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems -- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives -- Parameterized Verification of Communicating Automata under Context Bounds -- Regular Strategies in Pushdown Reachability Games -- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations -- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic -- Synthesising Succinct Strategies in Safety and |
|
|
|
|
|
|
|
|
|
|
|
Reachability Games -- Integer Vector Addition Systems with States -- Reachability in MDPs: Refining Convergence of Value Iteration -- On the Expressiveness of Metric Temporal Logic over Bounded Timed Words -- Trace Inclusion for One-Counter Nets Revisited -- Mean-Payoff Games with Partial-Observation -- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions -- On Functions Weakly Computable by Petri Nets and Vector Addition Systems -- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems -- Transformations for Compositional Verification of Assumption-Commitment Properties -- Compositional Reachability in Petri Nets. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The 17 papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains a paper summarizing the invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. |
|
|
|
|
|
|
|
| |