Search results for "Mathematical Foundations of Computer Science"
Items we need to order for you
Empirical Foundations of Information and Software Science III
The monograph presents the proceedings of the Third Symposium on Empir ical Foundations of Information and Software Sciences (EFISS) held at the Riso National Laboratory in Roskilde, Denmark, 23-25 October 1985. The EFISS series of meetings was initiated with the express purpose of explor ing subjects and methods of scientific inquiry of empirical nature which are of common interest to information and software sciences. Furthermore, these meetings were expected to provide a cross-disciplinary forum for discussion of problems and exchange of research results of importance for the design and application of advanced information systems. The previous two EFISS symposia took place at the Georgia Institute of Technology in Atlanta, Georgia, USA. The first meeting in 1982 focused on methods of experimental design and measurement techniques in information and software sciences. The second meeting was held in 1984 and its main theme was the value of information in prescriptive contexts, such as value of information for understanding and implementation of these messages, instructions, and commands. Specific examples of problems of this kind are the value of comments for the enhancement of understanding of computer programs, the value of information in assisting and guiding users of on line interactive systems, and the value of lexical aids in information retrieval. In both symposia, contributed papers were considered on any other valid subject of empirical foundations of the said two sciences.
R 1,571.24
Studies in Computer Science
This book is the proceedings ofa conference held November 1-3, 1989, to honor Samuel D. Conte for his many contributions to computer sci ences at Purdue University and to the profession as a whole. The com puter sciences program reflected the breadth of Conte's interests and ac complishments; there were tributes to Conte, perspectives on computer science itself, and research papers. The first part of these proceedings chronicles the career and contri butions; much of it is based on Conte's remarks made at the conference banquet. The second part of the proceedings starts with one vision of the future of computer sciences given in Peter Denning's keynote address. Historical accounts of building successful educational programs in com puter sciences follow. The third part consists of seven research contribu tions, primarily from past or present colleagues. These include Conte's numerical analysis, computational geometry, and discussions of software engineering. The conference was organized by the Purdue University Department of Computer Sciences and the Software Engineering Research Center at Purdue. Both of these organizations were founded by Conte, so is fitting for them to recognize their founder's achievements in such a con crete way.
R 1,549.76
Cognitive Dynamics of Computer Science
A groundbreaking, unifying theory of computer science for low-cost, high-quality software The Cognitive Dynamics of Computer Science represents the culmination of more than thirty years of the author's hands-on experience in software development, which has resulted in a remarkable and sensible philosophy and practice of software development. It provides a groundbreaking ontology of computer science, while describing the processes, methodologies, and constructs needed to build high-quality, large-scale computer software systems on schedule and on budget. Based on his own experience in developing successful, low-cost software projects, the author makes a persuasive argument for developers to understand the philosophical underpinnings of software. He asserts that software in reality is an abstraction of the human thought system. The author draws from the seminal works of the great German philosophers--Kant, Hegel, and Schopenhauer--and recasts their theories of human mind and thought to create a unifying theory of computer science, cognitive dynamics, that opens the door to the next generation of computer science and forms the basic architecture for total autonomy. * Four detailed cases studies effectively demonstrate how philosophy and practice merge to meet the objective of high-quality, low-cost software. * The Autonomous Cognitive System chapter sets forth a model for a completely autonomous computer system, using the human thought system as the model for functional architecture and the human thought process as the model for the functional data process. * Although rooted in philosophy, this book is practical, addressing all the key areas that software professionals need to master in order to remain competitive and minimize costs, such as leadership, management, communication, and organization. This thought-provoking work will change the way students and professionals in computer science and software development conceptualize and perform their work. It provides them with both a philosophy and a set of practical tools to produce high-quality, low-cost software.
R 4,785.00
Formal Methods: Foundations and Applications
This book constitutes the refereed proceedings of the 24rd Brazilian Symposium on Formal Methods, SBMF 2021, which was held in December 2021. Due to COVID 19-pandemic it took place virtually. The 8 regular papers presented in this book were carefully reviewed and selected from 15 submissions. The papers detail the development, dissemination, and use of formal methods for the construction of high-quality computational systems, aiming to promote opportunities for researchers and practitioners with an interest in formal methods to discuss the recent advances in this area
R 2,340.32
Foundations of Probabilistic Logic Programming
The integration of logic and probability combines the capability of the first to represent complex relations among entities with the capability of the latter to model uncertainty over attributes and relations. Logic programming provides a Turing complete language based on logic and thus represent an excellent candidate for the integration. Since its birth, the field of Probabilistic Logic Programming has seen a steady increase of activity, with many proposals for languages and algorithms for inference and learning. One of most successful approaches to Probabilistic Logic Programming is the Distribution Semantics, where a probabilistic logic program defines a probability distribution over normal logic programs and the probability of a ground query is then obtained from the joint distribution of the query and the programs. Foundations of Probabilistic Logic Programming aims at providing an overview of the field of Probabilistic Logic Programming, with a special emphasis on languages under the Distribution Semantics. The book presents the main ideas for semantics, inference and learning and highlights connections between the methods. Many examples of the book include a link to a page of the web application http://cplint.eu where the code can be run online.
R 4,579.00
Learn Computer Science with Swift
Master the basics of solving logic puzzles, and creating algorithms using Swift on Apple platforms. This book is based on the curriculum currently being used in common computer classes. You’ll learn to automate algorithmic processes that scale using Swift in the context of iOS, macOS, tvOS, and watchOS.Begin by understanding how to think computationally: to formulate a computational problem and recognize patterns and ways to validate it. Then jump ahead past the abstractions and conceptual work into using code snippets to build frameworks and write code using Xcode and Swift. Once you have frameworks in place, you’ll learn to use algorithms and structure data. Finally, you’ll see how to bring people into what you’ve built through a useable UI and how UI and code relate.What You'll LearnRecognize patterns and use abstractionsBuild code into reusable frameworksManage code and share version controlSolve logic puzzlesWho This Book Is For Young professionals interested in learning computer science from an Apple platform standpoint.
R 684.00
High-Performance Embedded Computing
High-Performance Embedded Computing, Second Edition, combines leading-edge research with practical guidance in a variety of embedded computing topics, including real-time systems, computer architecture, and low-power design. Author Marilyn Wolf presents a comprehensive survey of the state of the art, and guides you to achieve high levels of performance from the embedded systems that bring these technologies together. The book covers CPU design, operating systems, multiprocessor programs and architectures, and much more. Embedded computing is a key component of cyber-physical systems, which combine physical devices with computational resources for control and communication. This revised edition adds new content and examples of cyber-physical systems throughout the book, including design methodologies, scheduling, and wide-area CPS to illustrate the possibilities of these new systems.
R 2,500.00
Foundations of Global Genetic Optimization
Genetic algorithms today constitute a family of e?ective global optimization methods used to solve di?cult real-life problems which arise in science and technology. Despite their computational complexity, they have the ability to explore huge data sets and allow us to study exceptionally problematic cases in which the objective functions are irregular and multimodal, and where information about the extrema location is unobtainable in other ways. Theybelongtotheclassofiterativestochasticoptimizationstrategiesthat, during each step, produce and evaluate the set of admissible points from the search domain, called the random sample or population. As opposed to the Monte Carlo strategies, in which the population is sampled according to the uniform probability distribution over the search domain, genetic algorithms modify the probability distribution at each step. Mechanisms which adopt sampling probability distribution are transposed from biology. They are based mainly on genetic code mutation and crossover, as well as on selection among living individuals. Such mechanisms have been testedbysolvingmultimodalproblemsinnature,whichiscon?rmedinpart- ular by the many species of animals and plants that are well ?tted to di?erent ecological niches. They direct the search process, making it more e?ective than a completely random one (search with a uniform sampling distribution). Moreover,well-tunedgenetic-basedoperationsdonotdecreasetheexploration ability of the whole admissible set, which is vital in the global optimization process. The features described above allow us to regard genetic algorithms as a new class of arti?cial intelligence methods which introduce heuristics, well tested in other ?elds, to the classical scheme of stochastic global search.
R 3,026.59
