Narrow your search
Listing 1 - 10 of 129 << page
of 13
>>
Sort by

Multi
Blockchain Scalability and its Foundations in Distributed Systems
Authors: ---
ISBN: 9783031125782 9783031125775 9783031125799 9783031125805 Year: 2022 Publisher: Cham Springer International Publishing :Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This practical new book offers the distributed-computing fundamental knowledge for individuals to connect with one another in a more secure and efficient way than with traditional blockchains. These new forms of secure, scalable blockchains promise to replace centralized institutions to connect individuals without the risks of user manipulations or data extortions. The techniques taught herein consist of enhancing blockchain security and making blockchain scalable by relying on the observation that no blockchain can exist without solving the consensus problem. First, the state-of-the-art of consensus protocols are analyzed, hence motivating the need for a new family of consensus protocols offering strong (deterministic) guarantees. Second, a didactic series of classic blockchain vulnerabilities is presented to illustrate the importance of novel designs better suited for the adversarial environment of open networks. These cutting-edge solutions are illustrated through the Redbelly blockchain design, which solves a different problem from the classic Byzantine consensus problem of 1982 and which delivers-in the modern blockchain context-high performance at large scale. Topics and features: Covers the combination of security and distributed computing to devise the new generation of blockchains Shows how blockchain has shed new light on decades of research in distributed systems Provides instruction on the security needed by the industry to use blockchains in production Explains didactically the necessary ingredients to make blockchain efficient at large scale Helps fill the gap of knowledge in the highly demanded blockchain sector This unique volume contains the building blocks to design secure and scalable blockchains. As such, it is dedicated to developers, application designers, and computer scientists and requires only a minimal undergraduate level in mathematics and computer science. Vincent Gramoli is an Australian Research Council Future Fellow at the University of Sydney and the Chief Technology Officer of Redbelly Network. He teaches the Blockchain Scalability course on Coursera.


Multi
Automata Theory and Formal Languages
Authors: ---
ISBN: 9783031119651 9783031119644 9783031119668 Year: 2022 Publisher: Cham Springer International Publishing :Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general. Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages. The book also examines decidable and undecidable problems with emphasis on the case for context-free languages. Topics and features: Provides theorems, examples, and exercises to clarify automata-languages correspondences Presents some fundamental techniques for parsing both regular and context-free languages Classifies subclasses of decidable problems, avoiding focus on the theory of complexity Examines finite-automata minimalization and characterization of their behavior using regular expressions Illustrates how to derive grammars of context-free languages in Chomsky and Greibach normal forms Offers supplementary material on counter machines, stack automata, and abstract language families This highly useful, varied text/reference is suitable for undergraduate and graduate courses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic. Alberto Pettorossi is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.


Multi
Robotic process automation in desktop publishing : an introduction to software-based automation of artwork processes
Author:
ISBN: 9783658393755 9783658393748 9783658393762 Year: 2022 Publisher: Wiesbaden, Germany : Springer Vieweg,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Automation serves as an essential component in business to achieve company goals with qualitatively and quantitatively better results. The use of automation is also in the field of desktop publishing (DTP) indispensable to achieve cost savings in the company and to improve the final results through standardization and error reduction, as well as to relieve employees with regard to laborious and monotonous tasks. This essential aims to summarize the many possibilities of automation in the field of DTP, focusing on repetitive artwork processes in prepress. The content Introduction to the topics of desktop publishing and automation Software-supported automation methods in desktop publishing with focus on Adobe applications Impulses for dealing with the structural change from manual to automated processes in the company The target groups Media designers, software developers, IT system administrators, IT decision-makers The author Ennis Gündoğan studied Business Information Systems and is an IHK-certified Media Designer for Digital and Print. In his job, he currently combines know-how from both fields of activity to realize software projects in the context of DTP automation.


Multi
Simple Type Theory : A Practical Logic for Expressing and Reasoning About Mathematical Ideas
Author:
ISBN: 9783031211126 9783031211119 9783031211133 9783031211140 Year: 2023 Publisher: Cham Springer International Publishing :Imprint: Birkhäuser

Loading...
Export citation

Choose an application

Bookmark

Abstract

This unique textbook, in contrast to a standard logic text, provides the reader with a logic that actually can be used in practice to express and reason about mathematical ideas. The book is an introduction to simple type theory, a classical higher-order version of predicate logic that extends first-order logic. It presents a practice-oriented logic called Alonzo that is based on Alonzo Church's formulation of simple type theory known as Church's type theory. Unlike traditional predicate logics, Alonzo admits undefined expressions. The book illustrates, using Alonzo, how simple type theory is suited ideally for reasoning about mathematical structures and constructing libraries of mathematical knowledge. Topics and features: Offers the first book-length introduction to simple type theory as a predicate logic Provides the reader with a logic that is close to mathematical practice Presents the tools needed to build libraries of mathematical knowledge Employs two semantics, one for mathematics and one for logic Emphasizes the model-theoretic view of predicate logic Includes several important topics, such as definite description and theory morphisms, not usually found in standard logic textbooks Aimed at students of computing and mathematics at the graduate or upper-undergraduate level, this book is also well-suited for mathematicians, computing professionals, engineers, and scientists who need a practical logic for expressing and reasoning about mathematical ideas. William M. Farmer is a Professor in the Department of Computing and Software at McMaster University in Hamilton, Ontario, Canada.


Multi
Computability
Authors: ---
ISBN: 9783030832025 9783030832018 9783030832032 9783030832049 Year: 2022 Publisher: Cham Springer International Publishing :Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of "mechanical process" using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Features: Extensive and mathematically complete coverage of the limitations of logic, including Gödel's incompleteness theorems (first and second), Rosser's version of the first incompleteness theorem, and Tarski's non expressibility of "truth" Inability of computability to detect formal theorems effectively, using Church's proof of the unsolvability of Hilbert's Entscheidungsproblem Arithmetisation-free proof of the pillars of computability: Kleene's s-m-n, universal function and normal form theorems - using "Church's thesis" and a simulation of the URM ("register machine") by a simultaneous recursion. These three pivotal results lead to the deeper results of the theory Extensive coverage of the advanced topic of computation with "oracles" including an exposition of the search computability theory of Moschovakis, the first recursion theorem, Turing reducibility and Turing degrees and an application of the Sacks priority method of "preserving agreements", and the arithmetical hierarchy including Post's theorem Cobham's mathematical characterisation of the concept deterministic polynomial time computable function is fully proved A complete proof of Blum's speed-up theorem.


Multi
Beginning Python : From Novice to Professional
Authors: ---
ISBN: 9798868801969 9798868801952 9798868801976 9798868807909 Year: 2024 Publisher: Berkeley, CA : Apress : Imprint: Apress,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Gain a fundamental understanding of Python’s syntax and features with this revised introductory and practical reference. Covering a wide array of Python–related programming topics, including addressing language internals, database integration, network programming, and web services, you’ll be guided by sound development principles. Updated to reflect the latest in Python programming paradigms and several of the most crucial features found in Python 3, Beginning Python, Fourth Edition also covers advanced topics such as extending Python and packaging/distributing Python applications. Ten accompanying projects will ensure you can get your hands dirty in no time. You will: Become a proficient Python programmer by following along with a friendly, practical guide to the language’s key features Write code faster by learning how to take advantage of advanced features such as magic methods, exceptions, and abstraction Gain insight into modern Python programming paradigms including testing, documentation, packaging, and distribution Work through several interesting projects, including a P2P file–sharing application, chat client, video game, remote text editor, and more.


Multi
Algorithmic Trading Systems and Strategies: A New Approach : Design, Build, and Maintain an Effective Strategy Search Mechanism
Author:
ISBN: 9798868803574 9798868803567 9798868803581 Year: 2024 Publisher: Berkeley, CA : Apress : Imprint: Apress,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Design and develop a complex trading system from idea to operation. Old approaches were based on manually searching for strategy ideas. This book shows you how to create a system that will generate, optimize, and launch profitable strategies into a fully automatic mode. Imagine a system that only requires access to the Internet and electricity from a trader. This book describes the architecture and features of such a system and provides recommendations for further development. Most books cover only the implementation stage and overlook the design and maintenance of these systems. Here, you’ll walk through the entire process of creating a complex, scalable and easily supported system. For example, you’ll design an application based on microservice architecture and learn about development environments. You’ll also examine the advantages of horizontal scaling in the context of creating trading systems. Along the way, you’ll set up Kubernetes, connect the monitoring system. and understand the intricacies of continuous integration and continuous delivery. Testing and identifying only dozens of strategies is a thing of the past. Algorithmic Trading Systems and Strategies: A New Approach shows you how to analyze thousands in the same amount of time. .


Book
Python, PyGame and Raspberry Pi Game Development
Author:
ISBN: 9781484225172 Year: 2016 Publisher: Berkeley, CA : Apress : Imprint: Apress,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Gain the basics of Python and use PyGame to create fast-paced video games with great graphics and sounds. You'll also learn about object oriented programming (OOP) as well as design patterns like model-view-controller (MVC) and finite state machines (FSMs). Python, PyGame and Raspberry Pi Game Development teaches you how to use Python and PyGame on your computer. Whether you use Windows, macOS, Linux, or a Raspberry Pi you can unleash the power of Python and PyGame to create great looking games. Included in the text are complete code listings and explanations for "Bricks," "Snake" and "Invaders"-- three fully-working games. These allow you to get started making your own great games. Modify them or build your own exciting titles. What You'll Learn Gain the basics of Python and employ it for game development Design your game Build games using game projects as templates like Bricks, Snake, and Invaders Work with user defined functions, inheritance, composition, and aggregation Add sound to your games Implement finite state machines Who This Book Is For Experienced coders or game developers new to Python, PyGame and Raspberry Pi. This book is also for makers interested in getting into game development.


Multi
Realizing an Andreev Spin Qubit
Authors: ---
ISBN: 9783030838799 9783030838805 9783030838812 9783030838782 Year: 2021 Publisher: Cham Springer International Publishing :Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

The thesis gives the first experimental demonstration of a new quantum bit ("qubit") that fuses two promising physical implementations for the storage and manipulation of quantum information - the electromagnetic modes of superconducting circuits, and the spins of electrons trapped in semiconductor quantum dots - and has the potential to inherit beneficial aspects of both. This new qubit consists of the spin of an individual superconducting quasiparticle trapped in a Josephson junction made from a semiconductor nanowire. Due to spin-orbit coupling in the nanowire, the supercurrent flowing through the nanowire depends on the quasiparticle spin state. This thesis shows how to harness this spin-dependent supercurrent to achieve both spin detection and coherent spin manipulation. This thesis also represents a significant advancement to our understanding and control of Andreev levels and thus of superconductivity. Andreev levels, microscopic fermionic modes that exist in all Josephson junctions, are the microscopic origin of the famous Josephson effect, and are also the parent states of Majorana modes in the nanowire junctions investigated in this thesis. The results in this thesis are therefore crucial for the development of Majorana-based topological information processing.


Multi
Cybercomplexity
Authors: ---
ISBN: 9783031069949 9783031069932 9783031069956 9783031069963 Year: 2022 Publisher: Cham Springer International Publishing :Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book tackles the problem of complexity within IT environments, i.e., "Cybercomplexity," which is generally recognized as a principal source of cybersecurity risk. The book first defines complexity and simplifies its analysis by assuming a probabilistic approach to security risk management. It then proposes a simple model of cybercomplexity that is based on Shannon entropy, a basic concept in information theory. The key drivers of cybercomplexity emerge from this model, where these drivers reveal the scale-dependence of cybersecurity risk and explain why macroscopic security controls are required to address cybersecurity risk on an enterprise scale. The significant operational implications of cybercomplexity are also discussed, thereby providing both a theoretical framework and a practical guide to addressing this longstanding problem in cybersecurity risk management. .

Listing 1 - 10 of 129 << page
of 13
>>
Sort by