الصفحة 6
الصفحة 6
Android programming : The big Nerd Ranch guide (Big Nerd Ranch Guides)
For programmers with Kotlin experience. Based on Big Nerd Ranch's popular Android Bootcamp, this guide will lead you through the wilderness using hands-on example apps combined with clear explanations of key concepts and APIs. This book focuses on practical techniques for developing apps in Kotlin compatible with Android 7.0 (Nougat) through Android 12 and beyond. Write and run code every step of the way, using Android Studio to create apps that integrate with other apps, download and display pictures from the web, store data in databases, and more. Learn about the latest patterns and techniques, including Kotlin coroutines and Jetpack Compose, a new way to build Android UIs.
Android Programming : The Big Nerd Ranch Guide
An introductory Android book for programmers with Java experience. Based on Big Nerd Ranch’s popular Android Bootcamp course, this guide will lead you through the wilderness using hands-on example apps combined with clear explanations of key concepts and APIs. This book focuses on practical techniques for developing apps compatible with all versions of Android widely used today (Android 2.2 - 4.2). Write and run code every step of the way – creating apps that catalog crime scenes, browse photos, track your jogging route, and more.
Analysis and Synthesis of Logics : How to Cut and Paste Reasoning Systems
Starting with simple examples showing the relevance of cutting and pasting logics, the monograph develops a mathematical theory of combining and decomposing logics, ranging from propositional and first-order based logics to higher-order based logics as well as to non-truth functional logics. The theory covers mechanisms for combining semantic structures and deductive systems either of the same or different nature (for instance, two Hilbert calculi or a Hilbert calculus and a tableau calculus). The important issue of preservation of properties is extensively addressed. For instance, sufficient conditions are provided for a combined logic to be sound and complete when the original component logics are known to be sound and complete.
Algorithms - ESA 2008 ; 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings
This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008.
Algorithms - ESA 2006 ; 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings
This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in the context of the combined conference ALGO 2006. The book presents 70 revised full papers together with abstracts of 3 invited lectures. The papers address all current subjects in algorithmics, reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.
A Concise Introduction to Mathematical Logic
This book is unique in that it is more concise than most others; the material is treated in a streamlined fashion. This allows the lecturer to select the material for a one-semester course on a topic more easily. These initial chapters cover just the material for an introductory course on mathematical logic combined with the necessary material from set theory. Chapter 3 is partly of a descriptive nature, providing a view towards decision problems, automated theorem proving, non-standard models and related subjects. The other chapters contain material on logic programming for computer scientists, model theory, recursion theory, Gödel's Incompleteness Theorems, and applications of mathematical logic. Philosophical and foundational problems of mathematics are discussed where appropriate.
