Search results for "Program Or Be Programmed"
Items we need to order for you
Program Implementation in Preventive Trials
Program Implementation in Preventive Trials shows you how you can take a more active part in program evaluation and how you can direct existing programs toward new horizons of more effective service. In this concise, focused look at community-based psychology and its operative programs, you’ll see how and why community programs should be comprehensively evaluated. You’ll see the importance of understanding how interventions were conducted before making conclusions about a program’s impact, and you’ll discover why there’s an ever-widening gap between what is planned and what actually gets implemented in community-based programs.In short, Program Implementation in Preventive Trials helps you see the increasing need for the assessment of implementation, the “active” side of community psychology. You’ll gain instant understanding as to why there’s a need for constant monitoring of a program’s use, and you’ll find answers to the following questions that continue to plague community psychologists who are interested in implementing programs of change: Does the current personnel follow the implementation program? Will new members to the setting understand and utilize the procedures developed for that setting? Will the procedures be modified such that their utility decreases? Specifically, you’ll read about:how to ensure intervention programs are conducted as planned why implementation data should be collected what protocol compliance is and its role in treatment programs when to be flexible so modifications can be made in program procedures who can enhance program adherence by “buying in” to a multi-change agent approach where cultural sensitivity helps programs be more faithfully adopted and conductedIf you’re a scholar or a student interested in studying the fundamental issue of implementation, you’ll definitely want to see what these professionals have compiled in Program Implementation in Preventive Trials. You’ll find that your program agenda, however beneficial it is now, will only be raised and elevated to a new level of performance by the positive examples and research carefully collected here.
R 7,549.26
Neuro-Linguistisches Programmieren für Dummies
Öffnen Sie Ihr Denken für neue M??glichkeiten! M??chten Sie andere Menschen besser verstehen und sich ihnen gegenüber besser verständlich machen? Dann ist dieses Buch genau das richtige für Sie. Romilla Ready und Kate Burton zeigen Ihnen, wie Sie mit NLP Ihre Kommunikation mit anderen erfolgreich gestalten k??nnen und Ihre Ziele leichter erreichen. Sie erfahren, was es mit »Landkarten«, »Ankern«, »Zeitreisen« oder »Rapport« auf sich hat, und werden schon bald merken, wie Sie einen neuen Blick auf Ihre Umwelt werfen und wie positiv sich Ihre Kommunikation mit anderen entwickelt. Sie erfahren Wie Sie Ihre Ziele mit neuer Energie und Überzeugung erreichenWie Sie sich Geh??r für Ihre Botschaft verschaffenWie Sie Zweifel überwinden und mehr Zufriedenheit erlangen
R 547.00
Thinking About Programs
This book describes how to think about computer programs, and how to use mathematics as part of that thinking. Many books and online tutorials teach the basics of coding: the syntax of the language, and how to translate an algorithm into code. But how do you come up with that algorithm? And how can you be confident that the algorithm is correct?The first part of the book considers small programs that use a loop, and how to demonstrate their correctness using loop invariants. It also covers some algorithms and algorithmic techniques that every programmer should know. The second half of the book considers slightly larger programs. It teaches the basics of modularisation, splitting up a program into manageable chunks. It teaches about abstract datatypes, values within a program that can be treated as mathematical values: how to specify their behaviours formally; and how to treat them as abstract mathematical objects when programming. It also teaches how to use data structures to represent abstract datatypes, and what it means for such a representation to be correct. And it presents some abstract datatypes and data structures that every programmer should know.The book is aimed at those who want to obtain a better understanding of programs they work on, and so become better programmers. The target audience ranges from those who are just starting out, to professional programmers. The book aims to be pragmatic: the philosophy is to include enough formality to be convincing and to guide the programmer towards correct code, without getting bogged down in the mathematics.
R 2,604.00
Minimalist Program
The development of the Minimalist Program (MP), Noam Chomsky's most recent generative model of linguistics, has been highly influential over the last twenty years. It has had significant implications not only for the conduct of linguistic analysis itself, but also for our understanding of the status of linguistics as a science. The reflections and analyses in this book contain insights into the strengths and the weaknesses of the MP. These include: a clarification of the content of the Strong Minimalist Thesis (SMT); a synthesis of Chomsky's linguistic and interdisciplinary discourses; and an analysis of the notion of optimal computation from conceptual, empirical and philosophical perspectives. This book will encourage graduate students and researchers in linguistics to reflect on the foundations of their discipline, and the interdisciplinary nature of the topics explored will appeal to those studying biolinguistics, neurolinguistics, the philosophy of language and other related disciplines.
R 4,733.94
Logic Program Synthesis from Incomplete Information
Program synthesis is a solution to the software crisis. If we had a program that develops correct programs from specifications, then program validation and maintenance would disappear from the software life-cycle, and one could focus on the more creative tasks of specification elaboration, validation, and maintenance, because replay of program development would be less costly. This monograph describes a novel approach to Inductive Logic Programming (ILP), which cross-fertilizes logic programming and machine learning. Aiming at the synthesis of recursive logic programs only, and this from incomplete information, we take a software engineering approach that is more appropriate than a pure artificial intelligence approach. This book is suitable as a secondary text for graduate level courses in software engineering and artificial intelligence, and as a reference for practitioners of program synthesis.
R 4,648.57
Logic-Based Program Synthesis and Transformation
This book constitutes the thoroughly refereed post-conference proceedings of the 23rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2013, held in Madrid, Spain, in September 2013.The 13 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 21 submissions during two rounds of reviewing and improvement. LOPSTR traditionally solicits papers in the areas of specification, synthesis, verification, transformation, analysis, optimization, composition, security, reuse, applications and tools, component-based software development, software architectures, agent-based software development, and program refinement.
R 2,165.67
R 497.00
R 275.00
Algebra, Sprachen, Programmierung
Keine ausführliche Beschreibung für "Algebra, Sprachen, Programmierung" verfügbar.
R 6,071.00
Logic Program Synthesis and Transformation
This book constitutes the refereed proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, LOPSTR'95, held in Utrecht, The Netherlands in September 1995.The 19 papers included were selected from 40 workshop submissions; they offer a unique up-to-date account of the use of formal synthesis and transformation techniques for computer-aided development of logic programs. Among the topics addressed are deductive and inductive program synthesis, synthesis models based on constructive type theory, program specification, program analysis, theorem proving, and applications to various types of programs.
R 1,553.72
Foundations of Parallel Programming
The major reason for the lack of use of parallel computing is the mismatch between the complexity and variety of parallel hardware, and the software development tools to program it. The cost of developing software needs to be amortised over decades, but the platforms on which it executes change every few years, requiring complete rewrites. The evident cost-effectiveness of parallel computation has not been realized because of this mismatch. This book presents an integrated approach to parallel software development by addressing both software and performance issues together. It presents a methodology for software construction that produces architecture-independent and intellectually abstract software. The software can execute efficiently on a range of existing and potential hardware configurations. The approach is based on the construction of categorical data types, a generalization of abstract data types, and of objects. Categorical data types abstract both from the representation of a data type, and also from the detailed control flow necessary to perform operations on it. They thus impose a strong separation between the semantics, on which programs can depend, and the implementation, which is therefore free to hide the parallel machine properties that are used.
R 2,039.31
Concise Guide to Object-Oriented Programming
This engaging textbook provides an accessible introduction to coding and the world of Object-Oriented (OO) programming, using Java as the illustrative programming language. Emphasis is placed on what is most helpful for the first-time coder, in order to develop and understand their knowledge and skills in a way that is relevant and practical. The examples presented in the text demonstrate how skills in OO programming can be used to create applications and programs that have real-world value in daily life.Topics and features: presents an overview of programming and coding, a brief history of programming languages, and a concise introduction to programming in Java using BlueJ; discusses classes and objects, reviews various Java library objects and packages, and introduces the idea of the Application Programming Interface (API); highlights how OO design forms an essential role in producing a useful solution to a problem, and the importance of the concept of class polymorphism; examines what to do when code encounters an error condition, describing the exception handling mechanism and practical measures in defensive coding; investigates the work of arrays and collections, with a particular focus on fixed length arrays, the ArrayList, HashMap and HashSet; describes the basics of building a Graphical User Interface (GUI) using Swing, and the concept of a design pattern; outlines two complete applications, from conceptual design to implementation, illustrating the content covered by the rest of the book; provides code for all examples and projects at an associated website.This concise guide is ideal for the novice approaching OO programming for the first time, whether they are a student of computer science embarking on a one-semester course in this area, or someone learning for the purpose of professional development or self-improvement. The text does not require any prior knowledge of coding, software engineering, OO, or mathematics.
R 1,392.00
Programming Languages: Implementations, Logics, and Programs
This volume constitutes the refereed proceedings of the 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP '97, held in Southampton, UK, in September 1997, including a special track on Declarative Programming in Education.The volume presents 25 revised full papers selected from 68 submissions. Also included are one invited paper and three posters. The papers are devoted to exploring the relation between implementation techniques, the logic of the languages, and the use of the languages in construcing real programs. Topics of interest include implementation of declarative concepts, integration of paradigms, program analysis and transformation, programming environments, executable specifications, reasoning about language constructs, etc.
R 1,579.58
Automatic Quantum Computer Programming
Automatic Quantum Computer Programming provides an introduction to quantum computing for non-physicists, as well as an introduction to genetic programming for non-computer-scientists. The book explores several ways in which genetic programming can support automatic quantum computer programming and presents detailed descriptions of specific techniques, along with several examples of their human-competitive performance on specific problems. Source code for the author’s QGAME quantum computer simulator is included as an appendix, and pointers to additional online resources furnish the reader with an array of tools for automatic quantum computer programming.
R 3,824.03
Generative Programming and Component Engineering
This volume constitutes the proceedings of the ?rst ACM SIGPLAN/SIGSOFT International Conference on Generative Programming and Component Engine- ing (GPCE 2002), held October 6–8, 2002, in Pittsburgh, PA, USA, as part of the PLI 2002 event, which also included ICFP, PPDP, and a?liated workshops. The future of Software Engineering lies in the automation of tasks that are performed manually today. Generative Programming (developing programs that synthesize other programs), Component Engineering (raising the level of mo- larization and analysis in application design), and Domain-Speci?c Languages (elevating program speci?cations to compact domain-speci?c notations that are easier to write and maintain) are key technologies for automating program de- lopment. In a time of conference and workshop proliferation, GPCE represents acounter-trend in the merging of two distinct communities with strongly ov- lapping interests: the Generative and Component-Based Software Engineering Conference (GCSE) and the International Workshop on the Semantics, App- cations, and Implementation of Program Generation (SAIG). Researchers in the GCSE community address the topic of program automation from a contemporary software engineering viewpoint; SAIG correspondingly represents a community attacking automation from a more formal programming languages viewpoint. Together, their combination provides the depth of theory and practice that one would expect in apremier research conference. Three prominent PLI invited speakers lectured at GPCE 2002: Neil Jones (University of Copenhagen), Catuscia Palamidessi (Penn State University), and Janos Sztipanovits (Vanderbilt University). GPCE 2002 received 39 submissions, of which 18 were accepted.
R 1,564.16
Windows Assembly Language and Systems Programming
-Access Real mode from Protected mode; Protected mode from Real mode Apply OOP concepts to assembly language programs Interface assembly language programs with high-level languages Achieve direct hardware manipulation and memory access Explore the archite
R 4,358.13
Automatische Komplexitätsanalyse funktionaler Programme
Es gibt im Bereich der Softwaretechnik viele Werkzeuge, die den Programmentwicklungsprozeß unterstützen. Sie stellen die Korrektheit der Implementierung sicher, nicht aber ihre Effizienz. Die vorliegende Arbeit führt daher eine Methode ein, die es erlaubt, die Zeitkomplexität funktionaler Programme automatisch zu ermitteln. Die Grundidee dieser Methode besteht darin, ein funktionales Programm in ein System von Rekurrenzgleichungen zu übersetzen, dessen Lösung das Zeitverhalten des Programms angibt. Durch Einführung von bedingten Rekurrenzen und Rekurrenzfamilien ist es möglich, obere und untere Schranken für die Zeitkomplexität zu finden. Um die mittlere Zeitkomplexität zu bestimmen, müssen Wahrscheinlichkeiten dafür berechnet werden, daß im Programm vorkommende Bedingungen wahr bzw. falsch werden. Diese Wahrscheinlichkeiten werden anhand einer probabilistischen Semantik des Programms berechnet. Um möglichst genaue Schranken für die Zeitkomplexität zu erhalten, muß eine Abhängigkeitsanalyse durchgeführt werden. Dies ermöglicht eine genaue Analyse von Divide-and-Conquer-Programmen.
R 1,749.87
R 1,155.00
Verification of Sequential and Concurrent Programs
HIS BOOK CONTAINS a most comprehensive text that presents syntax-directed and compositional methods for the formal veri?- T cation of programs. The approach is not language-bounded in the sense that it covers a large variety of programming models and features that appear in most modern programming languages. It covers the classes of - quential and parallel, deterministic and non-deterministic, distributed and object-oriented programs. For each of the classes it presents the various c- teria of correctness that are relevant for these classes, such as interference freedom, deadlock freedom, and appropriate notions of liveness for parallel programs. Also, special proof rules appropriate for each class of programs are presented. In spite of this diversity due to the rich program classes cons- ered, there exist a uniform underlying theory of veri?cation which is synt- oriented and promotes compositional approaches to veri?cation, leading to scalability of the methods. The text strikes the proper balance between mathematical rigor and - dactic introduction of increasingly complex rules in an incremental manner, adequately supported by state-of-the-art examples. As a result it can serve as a textbook for a variety of courses on di?erent levels and varying durations. It can also serve as a reference book for researchers in the theory of veri?- tion, in particular since it contains much material that never before appeared in book form. This is specially true for the treatment of object-oriented p- grams which is entirely novel and is strikingly elegant.
R 3,074.04
Programming in Prolog
Originally published in 1981, this was the first textbook on programming in the Prolog language and is still the definitive introductory text on Prolog. Though many Prolog textbooks have been published since, this one has withstood the test of time because of its comprehensiveness, tutorial approach, and emphasis on general programming applications. Prolog has continued to attract a great deal of interest in the computer science community, and has turned out to be a basis for an important new generation of programming languages and systems for Artificial Intelligence. Since the previous edition of Programming in Prolog, the language has been standardised by the International Organization for Standardization (ISO) and this book has been updated accordingly. The authors have also introduced some new material, clarified some explanations, corrected a number of minor errors, and removed appendices about Prolog systems that are now obsolete.
R 1,963.41
R 439.68
Theoretical Introduction to Programming
Including easily digested information about fundamental techniques and concepts in software construction, this book is distinct in unifying pure theory with pragmatic details. Driven by generic problems and concepts, with brief and complete illustrations from languages including C, Prolog, Java, Scheme, Haskell and HTML.This book is intended to be both a how-to handbook and easy reference guide. Discussions of principle, worked examples and exercises are presented. All concepts outside introductory programming are explained with clear demarcation and dependencies so the experienced programmer can quickly locate material. Readable in a linear manner, with short mono-thematic to encourage dipping and reference. Also included are sections on open problems in software theory and practice.While little other than a novice programmer's knowledge is explicitly assumed, a certain conceptual maturity, either through commercial programming or academic training is required – each language is introduced and explained briefly as needed.
R 2,106.49
Assembly Language Programming Made Clear
Assembly Language Programming Made Clear: A Systematic Approach teaches students the fundamentals of assembly language programming through the use of two pseudo-languages that enable them to design their programs. It also prepares them to write their programs by teaching them the structure of the necessary registers.Chapters are organized so that information is presented in manageable chunks, all supported with clear examples and include exercises that allow students to immediately apply what they have learned. Over the course of the book students will work with number bases for integers, simple algorithms for converting between a number base and the base, if-then and while conditional statements, and arithmetic expressions. They will also study dynamic storage for decimal numbers through stacks and strings, string arrays, and much more. The book includes an appendix on signed numbers and the flag signals.Assembly Language Programming Made Clear can be used in courses within computer science programs. Its cogent discussion of foundational skills also makes it appropriate for classes in anti-virus software and those that prepare students for the development of higher-level language.
R 5,844.50
Temporal Logic of Programs
Introduction to the temporal logic of - in particular paral- lel - programs.Divided into three main parts: - Presenta- tion of the pure temporal logic: language, semantics, and proof theory; - Representation of programs and their proper- ties within the language of temporal logic; - Application of the logical apparatus to the verification of program proper- ties including a new embedding of Hoare's logic into the temporal framework.
R 1,591.08
Principles of Constraint Programming
Constraints are everywhere: most computational problems can be described in terms of restrictions imposed on the set of possible solutions, and constraint programming is a problem-solving technique that works by incorporating those restrictions in a programming environment. It draws on methods from combinatorial optimisation and artificial intelligence, and has been successfully applied in a number of fields from scheduling, computational biology, finance, electrical engineering and operations research through to numerical analysis. This textbook for upper-division students provides a thorough and structured account of the main aspects of constraint programming. The author provides many worked examples that illustrate the usefulness and versatility of this approach to programming, as well as many exercises throughout the book that illustrate techniques, test skills and extend the text. Pointers to current research, extensive historical and bibliographic notes, and a comprehensive list of references will also be valuable to professionals in computer science and artificial intelligence.
R 2,971.40
Programming Crystal
Crystal is for Ruby programmers who want more performance, or for developers who enjoy working in a high-level scripting environment. Crystal combines native execution speed and concurrency with Ruby-like syntax, so you will feel right at home. This book, the first available on Crystal, shows you how to write applications that have the beauty and elegance of a modern language, combined with the power of types and modern concurrency tooling. Now you can write beautiful code that runs faster, scales better, and is a breeze to deploy. Crystal is elegant to read and easy to program like Ruby, allowing full object-oriented development. Its compiler is powerful enough to nearly always infer the type of your variables. So you get the benefits of a statically typed language: more robust code, safety and execution speed, while still reaching high productivity in development. Null pointer exceptions as in JavaScript, Java or C#, are a thing of the past: Crystal annihilates them, just like Rust. Explore the building blocks and design of the language, and how you can use the Crystal tool-chain to build and manage powerful applications. Harness the power of the macro system, as well as how to work with fibers and channels, making concurrency as easy as possible. Learn how to use the Kemal web framework and access databases, and how to tap the potential of existing Crystal libraries. Find the spot that Crystal fills in today's software world with real-world examples. With Crystal, you can combine the best of both worlds: the high-level coding of dynamic languages, and the safety and blazing performance of a natively compiled language. What You Need: To develop in Crystal, you only need Crystal v 0.26 the latest version, a common text editor and a browser.
R 1,244.00
Functional and Logic Programming
ThisvolumecontainstheproceedingsoftheFifthInternationalSymposiumon FunctionalandLogicProgramming,FLOPS2001,heldinTokyo,Japan,March 7{9,2001,andhostedbyWasedaUniversity. FLOPSisaforumforresearchonallissuesconcerningfunctionalprogr- ming and logic programming. In particular, it aims to stimulate the cro- fertilizationaswellastheintegrationofthetwoparadigms. ThepreviousFLOPS meetingstookplaceinFuji-Susono(1995),Shonan(1996),Kyoto(1998),and Tsukuba (1999). The proceedings of FLOPS'99 were published by Springer- VerlagasLectureNotesinComputerScience,volume1722. There were 40 submissions, 38 of which were considered by the program 1 / committee. TheycamefromAustralia(5),Belgium( ),Denmark(3),Egypt 3 1 1 2 1 / / / / (1),France( ),Germany(2 ),Italy(4 ),Japan(5),Korea(1 ),Mexico 2 3 3 2 1 1 5 / / / (1),TheNetherlands(1 ),Spain(10 ),Switzerland(1),UK(1 ),andUSA 6 6 6 1 / (1 ). Eachpaperwasreviewedbyatleastthree,andmostlyfour,reviewers. 2 Theprogramcommitteemeetingwasconductedelectronicallyfortheperiodof twoweeksinNovember2000. Asaresultofactivediscussions,21papers(52. 5%) wereselectedforpresentation,whichappearinthisvolume.Inaddition,weare verypleasedtoincludeinthisvolumefullpapersbythreedistinguishedinvited speakers,namelyGopalanNadathur,GeorgeNecula,andTaisukeSato. Onbehalfoftheprogramcommittee,theprogramchairswouldliketothank theinvitedspeakerswhoagreedtogivetalksandcontributepapers,allthosewho submittedpapers,andalltherefereesfortheircarefulworkinthereviewingand selectionprocess. Thesupportofoursponsorsisalsogratefullyacknowledged. Inparticular,wewouldliketothanktheJapanSocietyforSoftwareScience andTechnology(JSSST),SpecialInterestGrouponPrinciplesofProgramming, andtheAssociationforLogicProgramming(ALP). Finally,wewouldliketo thankthemembersoftheorganizingcommittee,notablyZhenjiangHu,Yasuhiro Ajiro, Kazuhiko Kakehi, and Madoka Kuniyasu, for their invaluable support throughoutthepreparationandorganizationofthesymposium. January2001 HerbertKuchen KazunoriUeda Symposium Organization Program Chairs Herbert Kuchen University of Munster, ..Germany Kazunori Ueda Waseda University, Tokyo, Japan Program Committee Sergio Antoy Portland State University, USA Gopal Gupta University of Texas at Dallas, USA Michael Hanus University of Kiel, Germany Fergus Henderson University of Melbourne, Australia Zhenjiang Hu University of Tokyo, Japan Herbert Kuchen University of Munster, .. Germany Giorgio Levi University of Pisa, Italy Michael Maher Gri th University, Brisbane, Australia Dale Miller Pennsylvania State University, USA I. V. Ramakrishnan State University of New York at Stony Brook, USA Olivier Ridoux IRISA, Rennes, France Mario Rodr guez-Artalejo Complutense University, Madrid, Spain Colin Runciman University of York, UK Akihiko Takano Hitachi, Ltd.
R 1,573.86
R 1,831.00
R 675.00
R 6,336.62
R 458.00
Programmed Cells from Basic Neuroscience to Therapy
The recent advances in Programming Somatic Cell (PSC) including induced Pluripotent Stem Cells (iPS) and Induced Neuronal phenotypes (iN), has changed our experimental landscape and opened new possibilities. The advances in PSC have provided an important tool for the study of human neuronal function as well as neurodegenerative and neurodevelopmental diseases in live human neurons in a controlled environment. For example, reprogramming cells from patients with neurological diseases allows the study of molecular pathways particular to specific subtypes of neurons such as dopaminergic neurons in Parkinson’s Disease, Motor neurons for Amyolateral Sclerosis or myelin for Multiple Sclerosis. Detecting disease-specific molecular signatures in live human brain cells, opens possibilities for early intervention therapies and new diagnostic tools. Importantly, once the neurological neural phenotype is detected in vitro, the so-called “disease-in-a-dish” approach allows for the screening of drugs that can ameliorate the disease-specific phenotype. New therapeutic drugs could either act on generalized pathways in all patients or be patient-specific and used in a personalized medicine approach. However, there are a number of pressing issues that need to be addressed and resolved before PSC technology can be extensively used for clinically relevant modeling of neurological diseases. Among these issues are the variability in PSC generation methods, variability between individuals, epigenetic/genetic instability and the ability to obtain disease-relevant subtypes of neurons . Current protocols for differentiating PSC into specific subtypes of neurons are under development, but more and better protocols are needed. Understanding the molecular pathways involved in human neural differentiation will facilitate the development of methods and tools to enrich and monitor the generation of specific subtypes of neurons that would be more relevant in modeling different neurological diseases.
R 7,012.90
Thinking About Programs
This book describes how to think about computer programs, and how to use mathematics as part of that thinking. Many books and online tutorials teach the basics of coding: the syntax of the language, and how to translate an algorithm into code. But how do you come up with that algorithm? And how can you be confident that the algorithm is correct?The first part of the book considers small programs that use a loop, and how to demonstrate their correctness using loop invariants. It also covers some algorithms and algorithmic techniques that every programmer should know. The second half of the book considers slightly larger programs. It teaches the basics of modularisation, splitting up a program into manageable chunks. It teaches about abstract datatypes, values within a program that can be treated as mathematical values: how to specify their behaviours formally; and how to treat them as abstract mathematical objects when programming. It also teaches how to use data structures to represent abstract datatypes, and what it means for such a representation to be correct. And it presents some abstract datatypes and data structures that every programmer should know.The book is aimed at those who want to obtain a better understanding of programs they work on, and so become better programmers. The target audience ranges from those who are just starting out, to professional programmers. The book aims to be pragmatic: the philosophy is to include enough formality to be convincing and to guide the programmer towards correct code, without getting bogged down in the mathematics.
R 1,953.00
Programming for Engineers
To learn to program is to be initiated into an entirely new way of thinking about engineering, mathematics, and the world in general. Computation is integral to all modern engineering disciplines, so the better you are at programming, the better you will be in your chosen field.The author departs radically from the typical presentation by teaching concepts and techniques in a rigorous manner rather than listing how to use libraries and functions. He presents pointers in the very first chapter as part of the development of a computational model that facilitates an ab initio presentation of subjects such as function calls, call-by-reference, arrays, the stack, and the heap. The model also allows students to practice the essential skill of memory manipulation throughout the entire course rather than just at the end. As a result, this textbook goes further than is typical for a one-semester course -- abstract data types and linked lists, for example, are covered in depth. The computational model will also serve students in their adventures with programming beyond the course: instead of falling back on rules, they can think through the model to decide how a new programming concept fits with what they already know.The book is appropriate for undergraduate students of engineering and computer science, and graduate students of other disciplines. It contains many exercises integrated into the main text, and the author has made the source code available online.
R 2,220.89
R 305.00
R 397.00
R 3,603.14
Gene Expression Programming
This book describes the basic ideas of gene expression programming (GEP) and numerous modifications to this powerful new algorithm. It provides all the implementation details of GEP so that anyone with elementary programming skills will be able to implement it themselves. The book includes a self-contained introduction to this new exciting field of computational intelligence. This second edition has been revised and extended with five new chapters.
R 4,686.63
R 641.00
R 458.00
R 608.00
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs has had a dramatic impact on computer science curricula over the past decade. This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.
R 2,878.00
Stochastic Programming
This book is devoted to the problems of stochastic (or probabilistic) programming. The author took as his basis the specialized lectures which he delivered to the graduates from the economic cybernetics department of Leningrad University beginning in 1967. Since 1971 the author has delivered a specialized course on Stochastic Programming to the gradu ates from the faculty of applied mathematics/management processes at Leningrad University. The present monograph consists of seven chapters. In Chapter I, which is of an introductory character, consideration is given to the problems of uncertainty and probability, used for modelling complicated systems. Fundamental indications for the classification of stochastic pro gramming problems are given. Chapter II is devoted to the analysis of various models of chance-constrained stochastic programming problems. Examples of technological and applied economic problems of management with chance-constraints are given. In Chapter III two-stage stochastic programming problems are investigated, various models are given, and these models are qualitatively analyzed. In the conclusion of the chapter consideration is given to: the transport problem with random data, the problem of the determination of production volume, and the problem of planning the flights of aircraft as two-stage stochastic programming problems. Multi-stage stochastic programming problems are investigated in Chapter IV. The dependencies between prior and posterior decision rules and decision distributions are given. Dual problems are investigated.
R 3,023.49
Fundamentals of X Programming
This book provides an overview of the X Window System focusing on characteristics that have significant impact on the development of both application programs and widgets. We pay special attention to applications that go beyond graphical user interfaces (GUIs); therefore we discuss issues affecting video games, visualization and imaging programs, and designing widgets with a complex appearance. While the book does not assume previous knowledge of X, it is intended for experienced programmers, especially those who want to write programs that go beyond simple GUIs. X is the dominant window system under Unix, and X servers are available for Microsoft Windows, thus enabling graphics over a network in the PC world. While Java offers an apparently universal graphics library (the abstract window toolkit), the reality is quite different: For high-quality graphics and image display, we must program on the target platform itself (X or one of Microsoft’s APIs) rather than rely on Java peer objects. X is a vast subject, so it is impossible to provide a complete coverage in a few hundred pages. Thus we selected topics that are fundamental to the system, so that the reader who masters them should be able to read the documentation of the numerous libraries and toolkits. Therefore we provide documentation on the most important Xlib and X toolkit functions only.
R 1,708.61
Beginning Programming in 24 Hours, Sams Teach Yourself
Sams Teach Yourself Beginning Programming in 24 Hours explains the basics of programming in the successful 24 Hours format. The book's examples are easily readable and understandable by even those with no previous exposure to programming. This book covers the absolute basics of programming: Why program? What tools to use? How does a program tell the computer what to do? Readers will learn how to program the computer and will explore some of the most popular programming languages in use. This book will introduce the reader to common programming fundamentals using Python and will provide an overview of other common programming languages and their uses.
R 684.00
