Computer programming / software engineering Books
O'Reilly Media Programming Scala
Book SynopsisPacked with code examples, this comprehensive book shows you how to be productive with the language and ecosystem right away. You'll learn why Scala is ideal for building today's highly scalable, data-centric applications, while maximizing developer productivity.
£47.99
O'Reilly Media Gitops Cookbook
Book SynopsisWith this practical, developer-oriented book, DevOps engineers, developers, IT architects, and SREs will learn the most useful recipes and examples for following GitOps practices.
£47.99
Jones and Bartlett Publishers, Inc Game Design: Theory And Practice,
Book Synopsis“Both burgeoning game designers and devoted gamers should consider [Game Design: Theory & Practice] an essential read.” — Computer Gaming World “Ultimately, in both theory and practice, Rouse’s Game Design bible gets the job done. Let us pray.” - Next Generation magazine In the second edition to the acclaimed Game Design: Theory & Practice, designer Richard Rouse III balances a discussion of the essential concepts behind game design with an explanation of how you can implement them in your current project. Detailed analysis of successful games is interwoven with concrete examples from Rouse’s own experience. This second edition thoroughly updates the popular original with new chapters and fully revised text.
£37.04
J Ross Publishing Principles of Computer Science: An Invigorating,
Book SynopsisPrinciples of Computer Science is an invigorating and rapid adventure that covers core introductory theoretical computer science topics, including discrete mathematics, logic, programming languages, and programming language pragmatics. Readers dive deep into the syntax and semantics of constructing a small yet usable programming language (interpreter) containing paradigms from functional and non-functional programming. Additionally, users will gain an understanding of compilation by writing functions that translate code written in their high-level language down to low-level machine language. Moreover, Crotts provides a perspective on event-driven programming, memory management via garbage collection, and much more. Principles of Computer Science assumes no prior programming experience--all topics are taught from scratch, making this a highly approachable and inclusive textbook.Table of ContentsPrefaceChapter 1: A Computing MindsetChapter 2: A Logic PrimerChapter 3: Data StructuresChapter 4: Formal LanguagesChapter 5: Programming and DesignChapter 6: InterpretationChapter 7: Functional ProgrammingChapter 8: Imperative ProgrammingChapter 9: CompilationChapter 10: Memory ManagementChapter 11: Event-Driven ProgrammingAppendix A: Environment and Code Setup Appendix B: Graphics Library Source CodeAppendix C: Assembly Environment SetupBibliographyIndex
£54.00
J Ross Publishing Mastering Work Intake: From Chaos to Predictable
Book SynopsisRegardless of whether you’re creating, enhancing, or maintaining software products, work intake is a challenge you deal with constantly. Doing the right work at the right time can make or break your project, and there are surprisingly few resources to show you how to manage this process effectively. You need to know what your team is executing, what work is next, and the skill sets required to do the work.Mastering Work Intake: From Chaos to Predictable Delivery focuses on the full pipeline that work follows as it enters and exits your organization, including the different types of work that enter at different levels and times. It is a must-read for agile coaches, Scrum Masters, product owners, project and portfolio managers, team members, and anyone who touches the software development process. Mastering work intake involves recognizing that it’s easy to say “yes” and much harder to say “no.”
£40.80
Texas A & M University Press XQuery for Humanists
Book SynopsisXQuery is the best language for querying, manipulating, and transforming XML and JSON documents. Because XML is in many ways the lingua franca of the digital humanities, learning XQuery empowers humanists to discover and analyze their data in new ways. Until now, though, XQuery has been difficult to learn because there was no textbook designed for non- or beginner programmers. XQuery for Humanists fills this void with an approachable guidebook aimed directly at digital humanists. Clifford B. Anderson and Joseph C. Wicentowski introduce XQuery in terms accessible to humanities scholars and do not presuppose any prior background in programming. It provides an informed, opinionated overview and recommends the best implementations, libraries, and paradigms to empower those who need it most. Emphasizing practical applicability, the authors go beyond the XQuery language to include the basics of underlying standards like XPath, related standards like XQuery Full Text and XQuery Update, and explain the difference between XQuery and languages like Python and R. This book will afford readers the skills they need to build and analyze large-scale documentary corpora in XML. XQuery for Humanists is immeasurably valuable to instructors of digital humanities and library science courses alike and likewise is a ready reference for faculty, graduate students, and librarians who seek to master XQuery for their projects.
£37.46
O'Reilly Media Family Projects for Smart Objects
Book Synopsis"The Internet of Things" is the new buzzphrase, but what is it? A toaster that texts? The fitness band on your wrist? The camera in an infant's room? Sure, it's all of those things. But it's also your phone: an ultra-sophisticated sensor and communications system in your pocket or purse--capable of tracking your steps, capturing an image, or calling an Uber. And it is actually not hard or expensive to make a sensing, communicating object yourself. Doing so can be rewarding, fun, and even useful. This book teaches the basics of building sensors and communicating objects through a series of practical, demonstrative, and fun activities.
£14.39
Centre for the Study of Language & Information Knuth par Knuth
Book SynopsisThe interviews in this volume form the nearest thing possible to an autobiography of eminent computer scientist Donald E. Knuth. Based on the English-language Companion to the Papers of Donald Knuth, also published by CSLI Publications, this book brings the highlights of that material to a Francophone audience.
£23.00
Arcler Press Fundamentals of Programming
Book SynopsisThis text is a comprehensive guide to computer programming, covering the basic principles, concepts, and techniques of programming. The book provides a detailed overview of programming languages, algorithms, data structures, and software development methodologies. With clear explanations and practical examples, this book is an excellent starting point for anyone interested in learning programming fundamentals. It is an essential resource for students and professionals who want to develop their programming skills and enhance their understanding of computer science.Table of Contents Chapter 1 Introduction to Programming Chapter 2 Evaluation of Major Programming Languages Chapter 3 Data Types Chapter 4 Algorithms and Data Structures in Programming Chapter 5 Functions Chapter 6 Arrays Chapter 7 Control Structures Chapter 8 Fundamentals of Object-Oriented Programming
£87.20
Arcler Press Project and Programme Management
Book SynopsisThis book covers the principles, tools, and techniques of managing projects and programs effectively. It provides practical guidance for planning, executing, and controlling projects and programs, including risk management, stakeholder engagement, and quality assurance. The book also explores the importance of leadership and communication skills for successful project and program management. This book is a valuable resource for an experienced project manager or a novice, improving the skills and achieving project success.
£87.20
Arcler Education Inc Python Programming
Book SynopsisPython Programming is a comprehensive guide that aims to equip beginners and experienced programmers alike with the knowledge and skills to master the Python programming language. This book provides a detailed overview of Python's syntax and semantics, making it accessible to those who are new to programming. It covers fundamental concepts such as variables, data types, control structures, and functions, gradually building up to more advanced topics like object-oriented programming and file handling. The aim of Python Programming is to empower readers to write efficient, clean, and elegant Python code. By emphasizing readability and simplicity, Python Programming promotes good coding practices and encourages the development of intuitive and maintainable programs.Table of Contents Chapter 1 The Context of Software Development Chapter 2 Values and Variables Chapter 3 Expressions and Arithmetic Chapter 4 Conditional Execution Chapter 5 Iteration Chapter 6 Functions Chapter 7 Writing Functions Chapter 8 More on Functions Chapter 9 Objects Chapter 10 Lists Chapter 11 Tuples, Dictionaries, and Sets
£143.20
ISTE Ltd and John Wiley & Sons Inc Concepts and Semantics of Programming Languages
Book SynopsisThis book – composed of two volumes – explores the syntactical constructs of the most common programming languages, and sheds a mathematical light on their semantics, providing also an accurate presentation of the material aspects that interfere with coding.Concepts and Semantics of Programming Languages 2 presents an original semantic model, collectively taking into account all of the constructs and operations of modules and classes: visibility, import, export, delayed definitions, parameterization by types and values, extensions, etc. The model serves for the study of Ada and OCaml modules, as well as C header files. It can be deployed to model object and class features, and is thus used to describe Java, C++, OCaml and Python classes.This book is intended not only for computer science students and teachers but also seasoned programmers, who will find a guide to reading reference manuals and the foundations of program verification.Table of ContentsForeword ix Preface xi Chapter 1. Namespaces: Model and Operations 1 1.1. Reusing, dividing, confining 2 1.1.1. Analysis of some developer needs 2 1.1.2. Meeting developer needs 3 1.2. Namespaces 5 1.2.1. Namespaces definition 6 1.2.2. Extending notions of environment and binding 8 1.3. kit development 12 1.3.1. Namespace of a kit 14 1.3.2. Order of fields introduction 15 1.3.3. Typing kits 15 1.3.4. kit values 18 1.3.5. kit export, confining fields 22 1.3.6. kits import 28 1.3.7. Stages of kit development 32 1.4. Incomplete kits 33 1.4.1. Type and value of an incomplete kit 34 1.4.2. Completion of an incomplete kit 34 1.4.3. Confining an incomplete kit 36 1.5. Parameterized kits 36 1.5.1. kits parameterized by a type 36 1.5.2. kits parameterized by types and values 41 1.5.3. Confinement, parametrization, incomplete kits and export 45 1.6. Functors of kits 46 1.7. kit extension 49 1.7.1. Presentation of extension 49 1.7.2. Confinement and extension 55 1.8. Conclusion 59 Chapter 2. Modules 61 2.1. Modules in Ada 62 2.1.1. Developing modules 62 2.1.2. Export and confinement 65 2.1.3. Nesting modules 66 2.1.4. Importing a module 66 2.1.5. Flattening an import 67 2.1.6. Generic modules 68 2.1.7. Modules and separate compilation 71 2.2. Modules in OCaml 71 2.2.1. Module definition 72 2.2.2. Export and confinement 73 2.2.3. Confinement of type definitions 78 2.2.4. Functors 82 2.3. Modularity, namespaces and W-kit 85 2.3.1. Declaration interfaces 85 2.3.2. W-kits 86 2.3.3. Modularity and header files in C 86 Chapter 3. Class and Object Features 93 3.1. Object-oriented features 93 3.1.1. Objects 94 3.1.2. Classes 95 3.2. kits and object features 104 3.2.1. Modeling classes 104 3.2.2. Modeling objects 107 3.2.3. Inheritance, redefinition and late binding 109 3.2.4. Incomplete C-kits, parameterized C-kits 113 3.2.5. Subclassing, subtyping 115 3.2.6. Type languages, classes and objects 119 Chapter 4. Classes in Selected Languages 123 4.1. Classes in Java 123 4.1.1. General presentation 123 4.1.2. Modules and packages 124 4.1.3. Classes 125 4.1.4. Marks 131 4.1.5. Developing classes 134 4.2. Classes in C++ 144 4.2.1. Header files, namespaces, confinement 145 4.2.2. Classes 148 4.2.3. Inheritance and confinement 155 4.2.4. Overloading in C++ 165 4.2.5. Parameterized classes 168 4.3. Classes in OCaml 174 4.3.1. Presentation 174 4.3.2. An overview of classes 174 4.3.3. Marks, incomplete classes, parametrization 181 4.3.4. Objects 186 4.3.5. Class signatures: confinement and inheritance 192 4.3.6. Multiple inheritance 195 4.3.7. Other features 197 4.4. Presentation of Python 197 4.4.1. Getting started 198 4.4.2. An overview of classes, modules and types 199 4.4.3. Names and assignment 208 4.4.4. Assignment and typechecking 211 4.4.5. Overloading 213 4.4.6. Modules and packages 217 4.4.7. Confinement 218 4.4.8. Inheritance 219 4.4.9. Incomplete C-kits and abstract classes 221 4.4.10. Other features 222 Appendix: Questions to Guide Learning 225 List of Notations 229 References 231 Index 233
£124.15
Cognella, Inc Fundamentals in Computer Programming Workbook: An Active and Guided Inquiry Learning Approach to Enhance Computational Thinking
Book SynopsisMeticulously crafted to align with the ACM/IEEE-CS/AAAI Computer Science CS2023 curricular guidelines, Fundamentals in Computer Programming Workbook: An Active and Guide Inquiry Learning Approach to Enhance Computational Thinking empowers students to master the art of programming.Structured to facilitate both individual and collaborative learning, this workbook guides students through the intricacies of Java programming, decision structures, loops, methods, and beyond. It delves into the realms of object-oriented programming, exception handling, recursion, and algorithmic complexities before advancing into the sophisticated territories of arrays, linked lists, stacks, queues, trees, heaps, and hash tables.With a focus on active learning, the workbook employs Bloom's for Computing revised taxonomy to ensure a robust development of computational thinking skills. Each chapter is a step-by-step journey through problem-solving, supported by digital content accessible via QR codes for a seamless blend of traditional and modern learning experiences.Designed for a diverse range of learners--from community colleges to technical schools to four-year institutions--Fundamentals in Computer Programming Workbook is the perfect companion for undergraduate computer science courses and programs.
£53.55
ISTE Ltd and John Wiley & Sons Inc Advanced Backend Code Optimization
Book SynopsisThis book is a summary of more than a decade of research in the area of backend optimization. It contains the latest fundamental research results in this field. While existing books are often more oriented toward Masters students, this book is aimed more towards professors and researchers as it contains more advanced subjects.It is unique in the sense that it contains information that has not previously been covered by other books in the field, with chapters on phase ordering in optimizing compilation; register saturation in instruction level parallelism; code size reduction for software pipelining; memory hierarchy effects and instruction level parallelism.Other chapters provide the latest research results in well-known topics such as register need, and software pipelining and periodic register allocation.Table of ContentsIntroduction xiii Part 1 Prolog: Optimizing Compilation 1 Chapter 1 On the Decidability of Phase Ordering in Optimizing Compilation 3 Part 2 Instruction Scheduling 23 Chapter 2 Instruction Scheduling Problems and Overview 25 Chapter 3 Applications of Machine Scheduling to Instruction Scheduling 39 Chapter 4 Instruction Scheduling Before Register Allocation 51 Chapter 5 Instruction Scheduling After Register Allocation 77 Chapter 6 Dealing in Practice with Memory Hierarchy Effects and Instruction Level Parallelism 91 Part 3 Register Optimization 119 Chapter 7 The Register Need of a Fixed Instruction Schedule 121 Chapter 8 The Register Saturation 141 Chapter 9 Spill Code Reduction 159 Chapter 10 Exploiting the Register Access Delays Before Instruction Scheduling 177 Chapter 11 Loop Unrolling Degree Minimization for Periodic Register Allocation 191 Part 4 Epilog: Performance, Open Problems 231 Chapter 12 Statistical Performance Analysis: The Speedup-Test Protocol 233 Conclusion 257 Appendix 1 Presentation of the Benchmarks Used in Our Experiments 263 Appendix 2 Register Saturation Computation on Stand-Alone DDG 271 Appendix 3 Efficiency of SIRA on the Benchmarks 279 Appendix 4 Efficiency of Non-Positive Circuit Elimination in the SIRA Framework 293 Appendix 5 Loop Unroll Degree Minimization: Experimental Results 303 Appendix 6 Experimental Efficiency of Software Data Preloading and Prefetching for Embedded VLIW 313 Appendix 7 Appendix of the Speedup-Test Protocol 319 Bibliography 327 Lists of Figures, Tables and Algorithms 345 Index 353
£125.06
ISTE Ltd and John Wiley & Sons Inc CENELEC 50128 and IEC 62279 Standards
Book SynopsisCENELEC EN 50128 and IEC 62279 standards are applicable to the performance of software in the railway sector. The 2011 version of the 50128 standard firms up the techniques and methods to be implemented. This is a guide to its implementation, in order to understand the foundations of the standard and how it impacts on the activities to be undertaken, helping towards better a preparation for the independent evaluation phase, which is mandatory.Table of ContentsINTRODUCTION xiii CHAPTER 1. FROM THE SYSTEM TO THE SOFTWARE 1 1.1. Introduction 1 1.2. Command/control system 2 1.3. System 6 1.4. Software application 8 1.4.1. What is software? 8 1.4.2. Different types of software 9 1.4.3. The software application in its proper context 10 1.5. Conclusion 11 CHAPTER 2. RAILWAY STANDARDS 13 2.1. Introduction 13 2.2. Generic standards 14 2.2.1. Introduction 14 2.2.2. Safety levels 15 2.3. History between CENELEC and the IEC 16 2.4. CENELEC referential framework 17 2.4.1. Introduction 17 2.4.2. Description 18 2.4.3. Implementation 21 2.4.4. Software safety 22 2.4.5. Safety versus availability 22 2.5. EN 50155 standard 23 2.6. CENELEC 50128 26 2.6.1. Introduction 26 2.6.2. SSIL management 26 2.6.3. Comparison of 2001 and 2011 versions 28 2.7. Conclusion 30 CHAPTER 3. RISK AND SAFETY INTEGRITY LEVEL 31 3.1. Introduction 31 3.2. Basic definitions 31 3.3. Safety enforcement 37 3.3.1. What is safety? 37 3.3.2. Safety management 40 3.3.3. Safety integrity 47 3.3.4. Determination of the SIL 50 3.3.5. SIL table 55 3.3.6. Allocation of SILs 56 3.3.7. SIL management 57 3.3.8. Software SIL 58 3.3.9. Iterative process 59 3.3.10. Identification of safety requirements 60 3.4. In IEC 61508 and IEC 61511 61 3.4.1. Risk graph 62 3.4.2. LOPA 64 3.4.3. Overview 66 3.5. Conclusion 66 CHAPTER 4. SOFTWARE ASSURANCE 67 4.1. Introduction 67 4.2. Prerequisites 67 4.3. Quality assurance 68 4.3.1. Introduction 68 4.3.2. Quality assurance management 69 4.3.3. Realization of a software application 73 4.3.4. Software quality assurance plan (SQAP) 75 4.4. Organization 78 4.4.1. Typical organization 78 4.4.2. Skill management 80 4.5. Configuration management 82 4.6. Safety assurance management 84 4.7. Verification and validation 86 4.7.1. Introduction 86 4.7.2. Verification 87 4.7.3. Validation 103 4.8. Independent assessment 104 4.9. Tool qualification 104 4.10. Conclusion 105 4.11. Appendix A: list of quality documents to be produced 106 4.12. Appendix B: structure of a software quality assurance plan 106 CHAPTER 5. REQUIREMENTS MANAGEMENT 109 5.1. Introduction 109 5.2. Requirements acquisition phase 110 5.2.1. Introduction 110 5.2.2. Requirements elicitation 111 5.2.3. Process of analysis and documentation 119 5.2.4. Verification and validation of the requirements 126 5.3. Requirements specification 129 5.3.1. Requirements characterization 129 5.3.2. Characterization of requirements specification 135 5.3.3. Expression of requirements 135 5.3.4. Requirements validation 140 5.4. Requirements realization 140 5.4.1. Process 140 5.4.2. Verification 141 5.4.3. Traceability 143 5.4.4. Change management 146 5.5. Requirements management 150 5.5.1. Activities 150 5.5.2. Two approaches 151 5.5.3. Implementation of tools 152 5.6. Conclusion 154 CHAPTER 6. DATA PREPARATION 155 6.1. Introduction 155 6.2. Recap 156 6.3. Issue 156 6.4. Data-parameter-based system 158 6.4.1. Introduction 158 6.4.2. Characterization of data 161 6.4.3. Service inhibition 162 6.4.4. Overview 164 6.5. From the system to the software 165 6.5.1. Need 165 6.5.2. What the CENELEC framework does not say 167 6.6. Data preparation process 169 6.6.1. Context 169 6.6.2. Presentation of section 8 of the CENELEC 50128:2011 standard 170 6.7. Data preparation process 174 6.7.1. Management of the data preparation process 174 6.7.2. Verification 182 6.7.3. Specification phase 182 6.7.4. Architecture phase 186 6.7.5. Data production 190 6.7.6. Integration of the application and acceptance of the tests 196 6.7.7. Validation and evaluation of the application 197 6.7.8. Procedure and tools for preparation of the application 197 6.7.9. Development of generic software 198 6.8. Conclusion 199 6.9. Appendix: documentation to be produced 199 CHAPTER 7. GENERIC APPLICATION 201 7.1. Introduction 201 7.2. Software application realization process 201 7.3. Realization of a generic application 203 7.3.1. Specification phase 203 7.3.2. Architecture and component design phase 213 7.3.3. Component design phase 236 7.3.4. Coding phase 242 7.3.5. Execution of component tests 243 7.3.6. Software integration phase 246 7.3.7. Overall software testing phase 247 7.4. Some feedback on past experience 249 7.5. Conclusion 250 7.6. Appendix A: the programming language “Ada” 251 7.7. Appendix B: the programming language “C” 253 7.7.1. Introduction 253 7.7.2. The difficulty with C 253 7.7.3. MISRA-C 254 7.7.4. Example of a rule 255 7.8. Appendix C: introduction to object-oriented languages 255 7.9. Appendix D: documentation needing to be produced 258 CHAPTER 8. MODELING AND FORMALIZATION 261 8.1. Introduction 261 8.2. Modeling 261 8.2.1. Objectives 261 8.2.2. Different types of modeling 263 8.2.3. Model 264 8.3. Use of formal techniques and formal methods 265 8.3.1. Definitions 265 8.3.2. UML 268 8.4. Brief introduction to formal methods 269 8.4.1. Recap 269 8.4.2. Usage in the railway domain 270 8.4.3. Summary 276 8.5. Implementation of formal methods 279 8.5.1. Conventional processes 279 8.5.2. Process including formal methods 280 8.5.3. Issues 282 8.6. Maintenance of the software application 284 8.7. Conclusion 285 CHAPTER 9. TOOL QUALIFICATION 287 9.1. Introduction 287 9.2. Concept of qualification 288 9.2.1. Issue 288 9.2.2. CENELEC 50128:2001 288 9.2.3. DO-178 291 9.2.4. IEC 61508 292 9.2.5. ISO 26262 293 9.3. CENELEC 50128:2011 293 9.3.1. Introduction 293 9.3.2. Qualification file 294 9.3.3. Qualification process 295 9.3.4. Implementation of the qualification process 297 9.4. Fitness for purpose 305 9.4.1. Design method 305 9.4.2. In case of incompatibility 305 9.4.3. Code generation 306 9.5. Version management 306 9.5.1. Identification of versions 306 9.5.2. Bug/defect analysis 307 9.5.3. Changing versions 307 9.6. Qualification process 307 9.6.1. Qualification file 307 9.6.2. Ultimately 308 9.6.3. Qualification of non-commercial tools 308 9.7. Conclusion 308 CHAPTER 10. MAINTENANCE AND DEPLOYMENT 309 10.1. Introduction 309 10.2. Requirements 309 10.2.1. Fault management 309 10.2.2. Managing changes 310 10.3. Deployment 312 10.3.1. Issue 312 10.3.2. Implementation 313 10.3.3. In reality 314 10.4. Software maintenance 315 10.4.1. Issue 315 10.4.2. Implementation 315 10.5. Product line 316 10.6. Conclusion 318 10.7. Appendix: documentation needing to be produced 319 CHAPTER 11. ASSESSMENT AND CERTIFICATION 321 11.1. Introduction 321 11.2. Evaluation 321 11.2.1. Principles 321 11.2.2. CENELEC 50128:2011324 11.3. Cross-acceptance 325 11.4. Certification 326 11.4.1. Product certification 326 11.4.2. Software certification 327 11.4.3. Evolution management 327 11.5. Conclusion 328 11.6. Appendix: documentation needing to be produced 328 CONCLUSION 329 BIBLIOGRAPHY 331 GLOSSARY 343 INDEX 351
£125.06
ISTE Ltd and John Wiley & Sons Inc Comparable Corpora and Computer-assisted
Book SynopsisComputer-assisted translation (CAT) has always used translation memories, which require the translator to have a corpus of previous translations that the CAT software can use to generate bilingual lexicons. This can be problematic when the translator does not have such a corpus, for instance, when the text belongs to an emerging field. To solve this issue, CAT research has looked into the leveraging of comparable corpora, i.e. a set of texts, in two or more languages, which deal with the same topic but are not translations of one another. This work had two primary objectives. The first is to assess the input of lexicons extracted from comparable corpora in the context of a specialized human translation task. The second objective is to identify bilingual-lexicon-extraction methods which best match the translators' needs, determining the current limits of these techniques and suggesting improvements. The author focuses, in particular, on the identification of fertile translations, the management of multiple morphological structures, and the ranking of candidate translations. The experiments are carried out on two language pairs (English–French and English–German) and on specialized texts dealing with breast cancer. This research puts significant emphasis on applicability – methodological choices are guided by the needs of the final users. This book is organized in two parts: the first part presents the applicative and scientific context of the research, and the second part is given over to efforts to improve compositional translation. The research work presented in this book received the PhD Thesis award 2014 from the French association for natural language processing (ATALA).Table of ContentsAcknowledgments ix Introduction xi Part 1 Applicative and Scientific Context 1 Chapter 1 Leveraging Comparable Corpora and Computer-Assisted Translation 3 Chapter 2 User-Centered Evaluation of Lexicons Extracted from Comparable Corpora 41 Chapter 3 Automatic Generation of Term Translations 67 Part 2 Contributions to Compositional Translation 99 Chapter 4 Morph-Compositional Translation: Methodological Framework 101 Chapter 5 Experimental Data 123 Chapter 6 Formalization and Evaluation of Candidate Translation Generation 139 Chapter 7 Formalization and Evaluation of Candidate Translation Ranking 179 Conclusion and Perspectives 199 Part 3 Appendices 205 Appendix 1 Measures 207 Appendix 2 Data 215 Appendix 3 Comparable Corpora Lexicons Consultation Interface 261 List of Tables 265 List of Figures 271 List of Algorithms 273 List of Extracts 275 Bibliography 277 Index 289
£125.06
ISTE Ltd and John Wiley & Sons Inc Information and Recommender Systems
Book SynopsisInformation is an element of knowledge that can be stored, processed or transmitted. It is linked to concepts of communication, data, knowledge or representation. In a context of steady increase in the mass of information it is difficult to know what information to look for and where to find them. Computer techniques exist to facilitate this research and allow relevant information extraction. Recommendation systems introduced the notions inherent to the recommendation, based, inter alia, information search, filtering, machine learning, collaborative approaches. It also deals with the assessment of such systems and has various applications.Table of ContentsIntroduction vii Chapter 1. A Few Important Details Before We Begin 1 1.1. Information systems 1 1.2. Decision support systems 2 1.3. Recommender systems 3 1.4. Comparisons 4 1.5. Recommendation versus personalization 5 1.5.1. Recommendation 5 1.5.2. Personalization 6 Chapter 2. Recommender Systems 7 2.1. Introduction 8 2.2. Classification of recommender systems 9 2.2.1. Classification by score estimation method 9 2.2.2. Classification by data exploitation 10 2.2.3. Classification by objective 11 2.3. User profiles 11 2.4. Data mining 12 2.5. Content-based approaches 14 2.6. Collaborative filtering approaches 17 2.7. Knowledge-based approaches 20 2.8. Hybrid approaches 23 2.9. Other approaches 25 Chapter 3. Key Concepts, Useful Measures and Techniques 29 3.1. Vector space model 31 3.2. Similarity measures 31 3.2.1. Cosine similarity 31 3.2.2. Pearson correlation coefficient 32 3.2.3. Euclidean distance 33 3.2.4. Dice index 33 3.3. Dimensionality reduction 34 3.3.1. Principal component analysis 34 3.3.2. Singular value decomposition 35 3.3.3. Latent semantic analysis 36 3.4. Classification/clustering 36 3.4.1. Classification 36 3.4.2. Clustering 37 3.5. Other techniques 39 3.5.1. Term frequency-inverse document frequency (TF-IDF) 39 3.5.2. Association rules 40 3.6. Comparisons 41 Chapter 4. Practical Implementations 43 4.1. Commercial applications 43 4.1.1. Amazon.com 43 4.1.2. Netflix 45 4.2. Databases 46 4.3. Collaborative environments 48 4.4. Smart cities 49 4.5. Early warning systems 54 Chapter 5. Evaluating the Quality of Recommender Systems 57 5.1. Data sets, sparsity and errors 57 5.2. Measures 59 5.2.1. Accuracy 59 5.2.2. Other measures 63 Conclusion 65 Bibliography 67 Index 77
£125.06
Momentum Press Software Defined Networks
Book SynopsisSoftware defined networking (SDN) is one of the most promising recent developing in the networking. Together with network function virtualization (NFV) it has the potential to automate the networking tasks in a seamless manner.This book introduces the reader to this burgeoning field and explains the basic concepts within a historical context. It should be useful to senior undergraduates, beginning graduate students, and also to anyone curious about this topic.
£38.66
Morgan & Claypool Publishers Hardness of Approximation Between P and NP
Book SynopsisNash equilibrium is the central solution concept in Game Theory.Since Nash's original paper in 1951, it has found countless applications in modeling strategic behavior of traders in markets, (human) drivers and (electronic) routers in congested networks, nations in nuclear disarmament negotiations, and more. A decade ago, the relevance of this solution concept was called into question by computer scientists, who proved (under appropriate complexity assumptions) that computing a Nash equilibrium is an intractable problem. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one? The remaining hope was that at least approximate Nash equilibria can be efficiently computed.Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. In this book, we provide strong evidence that even finding an approximate Nash equilibrium is intractable. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games.The problem of approximate Nash equilibrium in a two-player game poses a unique technical challenge: it is a member of the class PPAD, which captures the complexity of several fundamental total problems, i.e., problems that always have a solution; and it also admits a quasipolynomial time algorithm. Either property alone is believed to place this problem far below NP-hard problems in the complexity hierarchy; having both simultaneously places it just above P, at what can be called the frontier of intractability. Indeed, the tools we develop in this book to advance on this frontier are useful for proving hardness of approximation of several other important problems whose complexity lies between P and NP: Brouwer's fixed point, market equilibrium, CourseMatch (A-CEEI), densest k-subgraph, community detection, VC dimension and Littlestone dimension, and signaling in zero-sum games.Table of Contents Preface Part I: Overview The Frontier of Intractability Preliminaries Part II: Communication Complexity Communication Complexity of Approximate Nash Equilibrium Brouwer's Fixed Point Part III: PPAD PPAD-Hardness of Approximation The Generalized Circuit Problem Many-Player Games Bayesian Nash Equilibrium Market Equilibrium CourseMatch Part IV: Quasi-Polynomial Time Birthday Repetition Densest k-Subgraph Community Detection VC and Littlestone's Dimensions Signaling Part V: Approximate Nash Equilibrium2-Player Approximate Nash Equilibrium References Index Author Biography
£71.20
Morgan & Claypool Publishers Hardness of Approximation Between P and NP
Book SynopsisNash equilibrium is the central solution concept in Game Theory.Since Nash's original paper in 1951, it has found countless applications in modeling strategic behavior of traders in markets, (human) drivers and (electronic) routers in congested networks, nations in nuclear disarmament negotiations, and more. A decade ago, the relevance of this solution concept was called into question by computer scientists, who proved (under appropriate complexity assumptions) that computing a Nash equilibrium is an intractable problem. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one? The remaining hope was that at least approximate Nash equilibria can be efficiently computed.Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. In this book, we provide strong evidence that even finding an approximate Nash equilibrium is intractable. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games.The problem of approximate Nash equilibrium in a two-player game poses a unique technical challenge: it is a member of the class PPAD, which captures the complexity of several fundamental total problems, i.e., problems that always have a solution; and it also admits a quasipolynomial time algorithm. Either property alone is believed to place this problem far below NP-hard problems in the complexity hierarchy; having both simultaneously places it just above P, at what can be called the frontier of intractability. Indeed, the tools we develop in this book to advance on this frontier are useful for proving hardness of approximation of several other important problems whose complexity lies between P and NP: Brouwer's fixed point, market equilibrium, CourseMatch (A-CEEI), densest k-subgraph, community detection, VC dimension and Littlestone dimension, and signaling in zero-sum games.Table of Contents Preface Part I: Overview The Frontier of Intractability Preliminaries Part II: Communication Complexity Communication Complexity of Approximate Nash Equilibrium Brouwer's Fixed Point Part III: PPAD PPAD-Hardness of Approximation The Generalized Circuit Problem Many-Player Games Bayesian Nash Equilibrium Market Equilibrium CourseMatch Part IV: Quasi-Polynomial Time Birthday Repetition Densest k-Subgraph Community Detection VC and Littlestone's Dimensions Signaling Part V: Approximate Nash Equilibrium2-Player Approximate Nash Equilibrium References Index Author Biography
£87.20
Morgan & Claypool Publishers Ada's Legacy: Cultures of Computing from the Victorian to the Digital Age
Book SynopsisAda’s Legacy illustrates the depth and diversity of writers, thinkers, and makers who have been inspired by Ada Lovelace, the English mathematician and writer. The volume, which commemorates the bicentennial of Ada’s birth in December 1815, celebrates Lovelace’s many achievements as well as the impact of her life and work, which reverberated widely since the late nineteenth century. In the 21st century we have seen a resurgence in Lovelace scholarship, thanks to the growth of interdisciplinary thinking and the expanding influence of women in science, technology, engineering and mathematics. Ada’s Legacy is a unique contribution to this scholarship, thanks to its combination of papers on Ada’s collaboration with Charles Babbage, Ada’s position in the Victorian and Steampunk literary genres, Ada’s representation in and inspiration of contemporary art and comics, and Ada’s continued relevance in discussions around gender and technology in the digital age.With the 200th anniversary of Ada Lovelace’s birth on December 10, 2015, we believe that the timing is perfect to publish this collection of papers. Because of its broad focus on subjects that reach far beyond the life and work of Ada herself, Ada’s Legacy will appeal to readers who are curious about Ada’s enduring importance in computing and the wider world.Table of Contents Introduction Part 1: Ada's Legacy in Computing Charles Babbage, Ada Lovelace, and the Bernoulli Numbers Sketch of the Analytical Engine invented by Charles Babbage, Esq. Ada: Past, Present, Future The Ada Programming Language The Rise, Fall, and Persistence of Ada Part 2: Ada's Legacy in Literature "I shall in due time be a poet": Ada Lovelace's Poetical Science in its Literary Context "A Different Sort of Bird": Ada Lovelace in History and Steampunk Ada Bright and Dark: Steampunk Representations of the Enchantress of Numbers Part 3: Ada's Legacy in the Digital Age Oracle: The Engine Weaves "Genderless" Online Discourse in the 1970s: Muted Group Theory in Early Social Computing Rebooting the Ada Lovelace Mythos
£37.95
Morgan & Claypool Publishers The Continuing Arms Race: Code-Reuse Attacks and
Book SynopsisAs human activities moved to the digital domain, so did all the well-known malicious behaviors including fraud, theft, and other trickery. There is no silver bullet, and each security threat calls for a specific answer. One specific threat is that applications accept malformed inputs, and in many cases it is possible to craft inputs that let an intruder take full control over the target computer system.The nature of systems programming languages lies at the heart of the problem. Rather than rewriting decades of well-tested functionality, this book examines ways to live with the (programming) sins of the past while shoring up security in the most efficient manner possible. We explore a range of different options, each making significant progress towards securing legacy programs from malicious inputs.The solutions explored include enforcement-type defenses, which excludes certain program executions because they never arise during normal operation. Another strand explores the idea of presenting adversaries with a moving target that unpredictably changes its attack surface thanks to randomization. We also cover tandem execution ideas where the compromise of one executing clone causes it to diverge from another thus revealing adversarial activities. The main purpose of this book is to provide readers with some of the most influential works on run-time exploits and defenses. We hope that the material in this book will inspire readers and generate new ideas and paradigms.Table of Contents Preface 1. How Memory Safety Violations Enable Exploitation of Programs 2. Protecting Dynamic Code 3. Diversity and Information Leaks 4. Code-Pointer Integrity 5. Evaluating Control-Flow Restricting Defenses 6. Attacking Dynamic Code 7. Hardware Control Flow Integrity 8. Multi-Variant Execution Environments References Contributor Biographies
£64.00
Morgan & Claypool Publishers The Continuing Arms Race: Code-Reuse Attacks and
Book SynopsisAs human activities moved to the digital domain, so did all the well-known malicious behaviors including fraud, theft, and other trickery. There is no silver bullet, and each security threat calls for a specific answer. One specific threat is that applications accept malformed inputs, and in many cases it is possible to craft inputs that let an intruder take full control over the target computer system.The nature of systems programming languages lies at the heart of the problem. Rather than rewriting decades of well-tested functionality, this book examines ways to live with the (programming) sins of the past while shoring up security in the most efficient manner possible. We explore a range of different options, each making significant progress towards securing legacy programs from malicious inputs.The solutions explored include enforcement-type defenses, which excludes certain program executions because they never arise during normal operation. Another strand explores the idea of presenting adversaries with a moving target that unpredictably changes its attack surface thanks to randomization. We also cover tandem execution ideas where the compromise of one executing clone causes it to diverge from another thus revealing adversarial activities. The main purpose of this book is to provide readers with some of the most influential works on run-time exploits and defenses. We hope that the material in this book will inspire readers and generate new ideas and paradigms.Table of Contents Preface 1. How Memory Safety Violations Enable Exploitation of Programs 2. Protecting Dynamic Code 3. Diversity and Information Leaks 4. Code-Pointer Integrity 5. Evaluating Control-Flow Restricting Defenses 6. Attacking Dynamic Code 7. Hardware Control Flow Integrity 8. Multi-Variant Execution Environments References Contributor Biographies
£79.20
Morgan & Claypool Publishers Declarative Logic Programming: Theory, Systems,
Book SynopsisThe idea of this book grew out of a symposium that was held at Stony Brook in September 2012 in celebration of David S.Warren's fundamental contributions to Computer Science and the area of Logic Programming in particular.Logic Programming (LP) is at the nexus of Knowledge Representation, Artificial Intelligence, Mathematical Logic, Databases, and Programming Languages. It is fascinating and intellectually stimulating due to the fundamental interplay among theory, systems, and applications brought about by logic. Logic programs are more declarative in the sense that they strive to be logical specifications of ""what"" to do rather than ""how"" to do it, and thus they are high-level and easier to understand and maintain. Yet, without being given an actual algorithm, LP systems implement the logical specifications automatically.Several books cover the basics of LP but focus mostly on the Prolog language with its incomplete control strategy and non-logical features. At the same time, there is generally a lack of accessible yet comprehensive collections of articles covering the key aspects in declarative LP. These aspects include, among others, well-founded vs. stable model semantics for negation, constraints, object-oriented LP, updates, probabilistic LP, and evaluation methods, including top-down vs. bottom-up, and tabling.For systems, the situation is even less satisfactory, lacking accessible literature that can help train the new crop of developers, practitioners, and researchers. There are a few guides onWarren’s Abstract Machine (WAM), which underlies most implementations of Prolog, but very little exists on what is needed for constructing a state-of-the-art declarative LP inference engine. Contrast this with the literature on, say, Compilers, where one can first study a book on the general principles and algorithms and then dive in the particulars of a specific compiler. Such resources greatly facilitate the ability to start making meaningful contributions quickly. There is also a dearth of articles about systems that support truly declarative languages, especially those that tie into first-order logic, mathematical programming, and constraint solving.LP helps solve challenging problems in a wide range of application areas, but in-depth analysis of their connection with LP language abstractions and LP implementation methods is lacking. Also, rare are surveys of challenging application areas of LP, such as Bioinformatics, Natural Language Processing, Verification, and Planning.The goal of this book is to help fill in the previously mentioned void in the LP literature. It offers a number of overviews on key aspects of LP that are suitable for researchers and practitioners as well as graduate students. The following chapters in theory, systems, and applications of LP are included.Table of Contents Preface PART I THEORY 1. Datalog: Concepts, History, and Outlook 2. An Introduction to the Stable and Well-Founded Semantics of Logic Programs 3. A Survey of Probabilistic Logic Programming PART II SYSTEMS 4. WAM for Everyone: A Virtual Machine for Logic Programming 5. Predicate Logic as a Modeling Language: The IDP System 6. SolverBlox: Algebraic Modeling in Dialog PART III APPLICATIONS 7. Exploring Life: Answer Set Programming in Bioinformatics 8. State-Space Search with Tabled Logic Programs 9. Natural Language Processing with (Tabled and Constraint) Logic Programming 10. Logic Programming Applications: What Are the Abstractions and Implementations? Index Biographies
£84.15
Morgan & Claypool Publishers Declarative Logic Programming: Theory, Systems,
Book SynopsisThe idea of this book grew out of a symposium that was held at Stony Brook in September 2012 in celebration of David S.Warren's fundamental contributions to Computer Science and the area of Logic Programming in particular.Logic Programming (LP) is at the nexus of Knowledge Representation, Artificial Intelligence, Mathematical Logic, Databases, and Programming Languages. It is fascinating and intellectually stimulating due to the fundamental interplay among theory, systems, and applications brought about by logic. Logic programs are more declarative in the sense that they strive to be logical specifications of "what" to do rather than "how" to do it, and thus they are high-level and easier to understand and maintain. Yet, without being given an actual algorithm, LP systems implement the logical specifications automatically.Several books cover the basics of LP but focus mostly on the Prolog language with its incomplete control strategy and non-logical features. At the same time, there is generally a lack of accessible yet comprehensive collections of articles covering the key aspects in declarative LP. These aspects include, among others, well-founded vs. stable model semantics for negation, constraints, object-oriented LP, updates, probabilistic LP, and evaluation methods, including top-down vs. bottom-up, and tabling.For systems, the situation is even less satisfactory, lacking accessible literature that can help train the new crop of developers, practitioners, and researchers. There are a few guides onWarren’s Abstract Machine (WAM), which underlies most implementations of Prolog, but very little exists on what is needed for constructing a state-of-the-art declarative LP inference engine. Contrast this with the literature on, say, Compilers, where one can first study a book on the general principles and algorithms and then dive in the particulars of a specific compiler. Such resources greatly facilitate the ability to start making meaningful contributions quickly. There is also a dearth of articles about systems that support truly declarative languages, especially those that tie into first-order logic, mathematical programming, and constraint solving.LP helps solve challenging problems in a wide range of application areas, but in-depth analysis of their connection with LP language abstractions and LP implementation methods is lacking. Also, rare are surveys of challenging application areas of LP, such as Bioinformatics, Natural Language Processing, Verification, and Planning.The goal of this book is to help fill in the previously mentioned void in the LP literature. It offers a number of overviews on key aspects of LP that are suitable for researchers and practitioners as well as graduate students. The following chapters in theory, systems, and applications of LP are included.Table of Contents Preface PART I THEORY 1. Datalog: Concepts, History, and Outlook 2. An Introduction to the Stable and Well-Founded Semantics of Logic Programs 3. A Survey of Probabilistic Logic Programming PART II SYSTEMS 4. WAM for Everyone: A Virtual Machine for Logic Programming 5. Predicate Logic as a Modeling Language: The IDP System 6. SolverBlox: Algebraic Modeling in Dialog PART III APPLICATIONS 7. Exploring Life: Answer Set Programming in Bioinformatics 8. State-Space Search with Tabled Logic Programs 9. Natural Language Processing with (Tabled and Constraint) Logic Programming 10. Logic Programming Applications: What Are the Abstractions and Implementations? Index Biographies
£95.20
Springer Nature Switzerland AG Systems Programming in Unix/Linux
Book SynopsisCovering all the essential components of Unix/Linux, including process management, concurrent programming, timer and time service, file systems and network programming, this textbook emphasizes programming practice in the Unix/Linux environment. Systems Programming in Unix/Linux is intended as a textbook for systems programming courses in technically-oriented Computer Science/Engineering curricula that emphasize both theory and programming practice. The book contains many detailed working example programs with complete source code. It is also suitable for self-study by advanced programmers and computer enthusiasts.Systems programming is an indispensable part of Computer Science/Engineering education. After taking an introductory programming course, this book is meant to further knowledge by detailing how dynamic data structures are used in practice, using programming exercises and programming projects on such topics as C structures, pointers, link lists and trees.This book provides a wide range of knowledge about computer systemsoftware and advanced programming skills, allowing readers to interface with operatingsystem kernel, make efficient use of system resources and develop application software.It also prepares readers with the needed background to pursue advanced studies inComputer Science/Engineering, such as operating systems, embedded systems, databasesystems, data mining, artificial intelligence, computer networks, network security,distributed and parallel computing.Table of ContentsChapter 1. Introduction to Unix/Linux.- Chapter 2. Programming Background.- Chapter 3 Process Management in Unix/Linux.- Chapter 4 Concurrent Programming.- Chapter 5 Timers and Time Service.- Chapter 6 Signals and Signal Processing.- Chapter 7 File Operations.- Chapter 8 System Calls for File Operations.- Chapter 9 Library I/O FunctionsChapter 10 Sh Programming.- Chapter 11 EXT2 File System.- Chapter 12. Block Device I/O and Buffer Management.- Chapter 13 TCP/IP and Network Programming.
£49.49
Springer Nature Switzerland AG SQL Server Database Programming with Java:
Book SynopsisThis textbook covers both fundamental and advanced Java database programming techniques for beginning and experienced students as well as programmers (courses related to database programming in Java with Apache NetBeans IDE 12 environment). A sample SQL Server 2019 Express database, CSE_DEPT, is created and implemented in all example projects throughout this textbook. Over 40 real sample database programming projects are covered in this textbook with detailed illustrations and explanations to help students understand the key techniques and programming technologies. Chapters include homework and selected solutions to strengthen and improve students’ learning and understanding for topics they study in the classroom. Both Java desktop and Web applications with SQL Server database programming techniques are discussed and analyzed. Some updated Java techniques, such as Java Server Pages (JSP), Java Server Faces (JSF), Java Web Service (JWS), JavaServer Pages Standard Tag Library (JSTL), JavaBeans and Java API for XML Web Services (JAX-WS) are also discussed and implemented in the real projects developed in this textbook.This textbook targets mainly advanced-level students in computer science, but it also targets entry-level students in computer science and information system. Programmers, software engineers and researchers will also find this textbook useful as a reference for their projects.Table of Contents
£42.74
Springer Nature Switzerland AG SQL Server Database Programming with Java:
Book SynopsisThis textbook covers both fundamental and advanced Java database programming techniques for beginning and experienced students as well as programmers (courses related to database programming in Java with Apache NetBeans IDE 12 environment). A sample SQL Server 2019 Express database, CSE_DEPT, is created and implemented in all example projects throughout this textbook. Over 40 real sample database programming projects are covered in this textbook with detailed illustrations and explanations to help students understand the key techniques and programming technologies. Chapters include homework and selected solutions to strengthen and improve students’ learning and understanding for topics they study in the classroom. Both Java desktop and Web applications with SQL Server database programming techniques are discussed and analyzed. Some updated Java techniques, such as Java Server Pages (JSP), Java Server Faces (JSF), Java Web Service (JWS), JavaServer Pages Standard Tag Library (JSTL), JavaBeans and Java API for XML Web Services (JAX-WS) are also discussed and implemented in the real projects developed in this textbook.This textbook targets mainly advanced-level students in computer science, but it also targets entry-level students in computer science and information system. Programmers, software engineers and researchers will also find this textbook useful as a reference for their projects.Table of Contents
£42.74
Springer International Publishing AG Reuse and Software Quality: 20th International
Book SynopsisThis book constitutes the proceedings of the 20th International Conference on Software and Systems Reuse, ICSR 2022, held in Montpellier, France in June 2022. The 7 full papers and 2 short papers included in this book were carefully reviewed and selected from 29 submissions. The papers were organized in topical sections named: Code Recommendations and Ruse; Learning and Reuse; Evolution and Reuse; Quality, Longevity and Reuse.
£44.99
Springer International Publishing AG Knowledge Engineering and Knowledge Management:
Book SynopsisThis book constitutes the refereed proceedings of the 23rd International Conference on Knowledge Engineering and Knowledge Management, EKAW 2022, held in Bolzano, Italy, in September 2022. The 11 full papers presented together with 5 short papers were carefully reviewed and selected from 57 submissions The previous event in the series, EKAW 2020, introduced a special theme related to “Ethical and Trustworthy Knowledge Engineering.” This theme is still very relevant in 2022, and thus has remained one of the core topics of the conference.The conference concerned with all aspects about eliciting, acquiring, modeling and managing knowledge, and the construction of knowledge-intensive systems and services for the semantic web, knowledge management, e-business, natural language processing, intelligent information integration, and much more.Table of ContentsBasic Human Values and Moral Foundations Theory in ValueNet Ontology.- Extending Ontology Engineering Practices to Facilitate Application Development.- MultiAligNet: Cross-Lingual Knowledge Bridges between Words and Senses.- Question Answering with Additive Restrictive Training (QuAART): Question Answering for the Rapid Development of New Knowledge Extraction Pipelines.- New Strategies for Training Knowledge Graph Embeddings: the Recommendation Case.- Documenting the Creation, Manipulation and Evaluation of Links for Reuse and Reproducibility.- Should we afford affordances? Injecting ConceptNet knowledge into BERT-based models to improve commonsense reasoning ability.- Towards a Knowledge Graph of Health Evolution.- Beyond Causality: Representing Event Relations in Knowledge Graphs.- Evaluating the Interpretability of Threshold Operators.- EBOCA: Evidences for BiOmedical Concepts Association Ontology.- Counter Effect Rules Mining in Knowledge Graphs.- A FAIR Core Semantic Metadata Model for FAIR Multidimensional Tabular Datasets.- Human-centric Ontology Evaluation: Process and Tool Support.- Towards Pragmatic Explanations for Domain Ontologies.- Quasi-equivalent concept trade-off in ontology design: initial considerations and analyses.
£33.24
Springer International Publishing AG Programming Languages and Systems: 32nd European
Book SynopsisThis open access book constitutes the proceedings of the 32nd European Symposium on Programming, ESOP 2023, which was held during April 22-27, 2023, in Paris, France, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023.The 20 regular papers presented in this volume were carefully reviewed and selected from 55 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems.Table of ContentsLogics for extensional, locally complete analysis via domain refinements.- Clustered Relational Thread-Modular Abstract Interpretation with Local Traces.- Adversarial Reachability for Program-level Security Analysis.- Automated Grading of Regular Expressions.- Builtin Types viewed as Inductive Families.- Pragmatic Gradual Polymorphism with References.- Modal crash types for intermittent computing.- Gradual Tensor Shape Checking.- A Type System for Effect Handlers and Dynamic Labels.- Interpreting Knowledge-based Programs.- Contextual Modal Type Theory with Polymorphic Contexts.- A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests.- Quorum Tree Abstractions of Consensus Protocols.- MAG π : Types for Failure-Prone Communication.- System $Fˆ\mu \omega$ with Context-free Session Types.- Safe Session-Based Concurrency with Shared Linear State.- Bunched Fuzz: Sensitivity for Vector Metrics.- Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing.- Type-safe Quantum Programming in Idris.- Automatic Alignment in Higher-Order Probabilistic Programming Languages.
£33.24
Springer International Publishing AG Logic and Argumentation: 5th International
Book SynopsisThis book constitutes the refereed proceedings of the 5th International Conference on Logic and Argumentation, CLAR 2023, held in Hangzhou, China, during September 10-12, 2023. The 11 full papers, one short paper and one invited paper presented in this book were carefully reviewed and selected from 20 submissions. The papers focus on topics such as: logic and automated deduction; abstract and structured argumentation; dialogues, games and practical reasoning; and quantitative argumentation.Table of ContentsLogic and Automated Deduction.- Dynamic Modal Logic with Counting: when Reduction Axioms Work and Fail.- Solving Modal Logic Problems by Translation to Higher-order Logic.- Formalizing the Unexpected Hanging Paradox: a Classical Surprise.- Abstract and Structured Argumentation.- Weakest Link in Formal Argumentation: Lookahead and Principle-based Analysis.- A Logical Encoding for k-m-Realization of Extensions in Abstract Argumentation.- Topological Conditions and Solutions for Repairing Argumentation Frameworks.- Dialogues, Games and Practical Reasoning.- Providing personalized Explanations: a Conversational Approach.- Audience irrelevance in Strategic Argumentation Games.- A Structured Bipolar Argumentation Theory for Providing Explanations in Practical Reasoning.- Quantitative Argumentation.- A Filtering-based General Approach to Learning Rational Constraints of Epistemic Graphs.- Fuzzy Labeling Semantics for Quantitative Argumentation.- A Logic for Preference Lifting under Uncertainty and its Decidability.
£47.49
Springer International Publishing AG Composability, Comprehensibility and Correctness
Book SynopsisThis book constitutes the revised selected papers of the 8th Summer School, CEFP 2019, held in Budapest, Hungary, during June 2019.The 7 full papers and the 4 short papers included in this volume were carefully reviewed and selected. The lectures cover various programming subjects with a focus on composability, comprehensibility, and correctness of working software.Table of ContentsMain Lectures.- PhD Workshop.
£56.99
Springer International Publishing AG Recent Trends in Algebraic Development
Book SynopsisThis book constitutes the thoroughly refereed post-conference proceedings of the 26th International Workshop on Algebraic Development Techniques, WADT 2022, held in Aveiro, Portugal, in June 2022.The 6 revised papers presented together with 2 invited papers were carefully reviewed and selected from 25 submissions. The contributed presentations covered a range of topics about the algebraic approach to system specification, which encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, the algebraic approach now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic, and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed, and mobile systems).Table of ContentsInvited Talks.- Taming Distributed System Complexity through Formal Patterns.- Why Adjunctions Matter — a Functional Programmer Perspective.- Standard Contributions.- A Computability Perspective on (Verified Machine Learning.- A Presheaf Semantics for Quantifie Temporal Logics.- Shades of Iteration: from Elgot to Kleene.- Automated QoS-Aware Service Selection Based on Soft Constraints.- Runtime Composition Of Systems of Interacting Cyber-Physical Components.- SpeX: a rewriting-based formal specificatio environment.
£42.74
Springer International Publishing AG ObjectOriented Analysis Design and Implementation
Book SynopsisThis new edition demonstrates a modeling-based approach to object-oriented development. It is a significant and comprehensive revision of the book. While the central focus remains the same as in previous editions, the reader will notice substantial improvements in the presentation. Salient featuresAll expected background materials are now in one chapter, making it easier for both the teacher and the learner. The treatment of modeling concepts and UML diagrams is both broader anddeeper. Securing the software is considered in the design and implementation phases. The design is evaluated for bad smells, which are corrected by refactoring. Implementation is carried out in both JavaFX and Swing. Software reuse is dealt with in much greater depth. The role of substitutability is examined and explained in this context. Comparison of the finite state machine and use case models is provided. A procedure to assist readers in analysis and design using the finite state machine model is included.
£47.49
De Gruyter Linear Algebra
Book Synopsis
£73.80
Springer Fachmedien Wiesbaden Kompakt im Doppelpack: HTML und JavaScript:
Book SynopsisMit diesem Buch schlagen Sie drei Fliegen mit einer Klappe: Sie lernen HTML und JavaScript und zugleich die Kunst des Programmierens. Man benötigt nur einen Editor und einen Browser und schon kann man mit den ersten Beispielen starten. Das Buch regt mit vielen praxisnahen Aufgaben zum eigenen Programmieren an. Es enthält viele Aufgaben, die anhand der Beispielprogramme gelöst werden können. Schrittweise treten Sie damit in die faszinierende Welt des Webdesigns ein. Beispiele, Lösungen und Ergänzungen lassen sich aus dem Internet problemlos herunterladen.Table of ContentsTextgestaltung.- Protokolle, Verweise und Bilder.- Listen und Tabellen.- Formatvorlagen (CCS).- Formulare und Ereignisse.- Grundlagen von JavaScript.- Operatoren.- Ablaufkontrolle.- Objekte und Arrays.- Rahmen und Fenster.- Funktionen.
£24.69
Springer Fachmedien Wiesbaden Programmieren in C#: Von den ersten Gehversuchen
Book SynopsisLernen Sie Programmieren mit Freude. Zahlreiche Beispiele machen den Einstieg in schwierige Themen einfach. Datenstrukturen und Algorithmen werden so in ihrem vollen Umfang anschaulich dargestellt. Anhand vieler Übungsaufgaben kann das Erlernte direkt ausprobiert werden. Ausführliche Lösungen erleichtern das Selbststudium und sichern den Lernerfolg. Table of ContentsEinführung in die objektorientierte Programmierung - Darstellung von Daten - Das NET-Framework - Vordefinierte Datentypen - Arrays - Operationen und Ausdrücke - Statische Methoden und Variablen - Programmsteuerung - Klassen und Objekte
£28.49
Springer Fachmedien Wiesbaden Programmieren mit PostScript: Eine umfassende
Book SynopsisTable of Contents1 Einleitung.- 1.1 Zur Entstehung von PostScript.- 1.2 Die Seitenbeschreibungssprache PostScript.- 1.3 Zielrichtung dieses Buches.- 2 Grundlagen.- 2.1 Der Stack und einfache Arithmetik.- 2.2 Weitere arithmetische Befehle.- 2.3 Koordinatensystem und aktueller Punkt.- 2.4 Einfache Textausgabe.- 2.4.1 Das Font.- 2.4.2 Strings und der Befehl »show«.- 2.4.3 Programm-Struktur.- 2.5 Linien.- 2.6 Spezielle Befehle für die Stackverwaltung.- 3 Variablen, Prozeduren und Schleifen.- 3.1 Variablen.- 3.2 Aufbau von Namen und Zahlen.- 3.3 Prozeduren.- 3.4 Schleifen.- 3.4.1 Der Befehl »loop«.- 3.4.2 Der Befehl »repeat«.- 3.4.3 Der Befehl »for«.- 4 Füllen.- 4.1 Graue Flächen und Linien.- 4.2 Die Befehle »gsave« und »grestore«.- 4.3 Die Füllregeln.- 4.3.1 Die »Non-Zero-Winding-Rule«.- 4.3.2 Die »Even-Odd-Rule«.- 5 Kurven.- 5.1 Kreise.- 5.2 Bezier-Kurven.- 5.3 Abgerundete Ecken.- 6 Arrays, Dictionaries und Strings.- 6.1 Die Arrays.- 6.1.1 Der Befehl »setdash«.- 6.1.2 Spezielle Befehle für Arrays.- 6.1.3 Spezielle Befehle für Markierungen.- 6.2 Die Dictionaries.- 6.3 Eintragungen in Dictionaries.- 6.4 Spezielle Befehle für Strings.- 6.4.1 Die Befehle »string« und »cvs«.- 6.4.2 Der Suchbefehl »search«.- 6.5 Gemeinsame Befehle für Arrays, Dictionaries und Strings.- 6.5.1 Der Befehl »put«.- 6.5.2 Der Befehl »get«.- 6.5.3 Der Befehl »length«.- 6.5.4 Der Befehl »copy«.- 6.5.5 Die Befehle »putinterval« und »getinterval«.- 6.5.6 Der Befehl »forall«.- 6.6 Zugriffsrechte.- 7 Abfragen in PostScript.- 7.1 Die Vergleichsoperationen.- 7.2 Verknüpfung von logischen Werten.- 7.3 Die Befehle »if« und »ifelse«.- 8 Fonts.- 8.1 Die Organisation der Fonts.- 8.2 Ausgabe einer Liste aller verfügbaren Fonts.- 8.3 Aktivierung von Umlauten in PostScript.- 8.4 Outline-Fonts.- 8.5 Userfonts.- 8.5.1 Ein einfaches Userfont.- 8.5.2 Ein vollwertiges Userfont.- 8.5.3 Spezialitäten mit Userfonts.- 9 Transformationen.- 9.1 Der Befehl »translate«.- 9.2 Der Befehl »scale«.- 9.3 Rotation.- 9.4 Der Aufbau der Transformationsmatrix.- 9.5 Die Befehle »transform« und »itransform«.- 9.6 Transformation eines Fonts.- 10 Clipping.- 11 Bildverarbeitung.- 11.1 Aufbau des Bildes.- 11.2 Der Befehl »image«.- 11.3 Der Befehl »imagemask«.- 11.4 Rasterzellen.- 11.5 Der Aufbau der Rasterzelle.- 11.6 Die Transferfunktion.- 12 Ein- und Ausgaben in PostScript.- 12.1 Lesen von Daten aus Datenströmen.- 12.2 Ausgabe von Daten auf Datenströme.- 12.3 Ausführung einer Datei.- 12.4 Erweiterungen für die Dateienverwaltung.- 13 Druckerspezifische Befehle.- 13.1 Allgemeine Druckereinstellungen.- 13.2 Spezielle Befehle für Laserdrucker.- 13.3 Spezielle Befehle für Belichter.- 14 Speicherverwaltung und Programmausführung.- 14.1 Der Befehl »bind« und die Funktion »//«.- 14.2 Die Speicherverwaltung.- 14.3 Die Befehle »exec« und »execstack«.- 14.4 Die Befehle »stop« und »stopped«.- 14.5 Zusammenfassung der PostScript-Typen.- 15 Der graphische Status.- 16 Fehlerbehandlung.- 16.1 Fehler und ihre möglichen Ursachen.- 17 Kommentar-Konventionen.- A ASCII-Tabellen.- B Zahlensysteme.- C Lösungen zu den Aufgaben.- D Literaturverzeichnis.- E Sachwortverzeichnis.
£49.49
Springer Fachmedien Wiesbaden Programmieren in Pascal: Ein einführendes
Book Synopsis0 Einleitung und Notationen.- 0.1 Historische Entwicklung.- 0.2 Einführende Beispiele.- 0.3 Schreibweisen.- 0.4 Testfragen.- 1 Einfache Datentypen und Ein/Ausgabe.- 1.1 AufZählungstypen und Unterbereichstypen.- 1.2 CHAR, siehe A.2.2.- 1.3 BOOLEAN, siehe A.2.2.- 1.4 Ordinale und Simple Typen.- 1.5 Zahlbezeichnungen.- 1.6 INTEGER, siehe A.2.2.- 1.7 REAL, siehe A.2.2.- 1.8 String, vgl. 5.3.- 1.9 Einfache Ein/Ausgabe mit READ, WRITE.- 1.10 Testfragen.- 2 Einfacher Programmaufbau.- 2.1 Verfügbarmachung externer Dateien, vgl. 8.- 2.2 Vereinbarungen.- 2.3 Testfragen.- 3 Ausdrücke.- 3.1 Primärausdrücke.- 3.2 Ausdrücke, allgemein.- 3.3 Testfragen.- 4 Anweisungen.- 4.1 Assignment Statement.- 4.2 Empty Statement.- 4.3 IF Statement.- 4.4 CASE Statement.- 4.5 Schleifen.- 4.6 Folgen von Anweisungen (compound statement).- 4.7 Label, GOTO Statement.- 4.8 Testfragen.- 5 Reihung (Array) und Mengenbildung (SET).- 5.1 Reihungstyp, Komponente.- 5.2 PACKED, vgl. A.2.5.2.- 5.3 String, vgl. 1.8.- 5.4 Potenzmengentyp, Mengen-Aggregat.- 5.5 Testfragen.- 6 Zeiger und Verbund.- 6.1 Zeiger (^ Symbol).- 6.2 Verbund (RECORD).- 6.3 Testfragen.- 7 Unterprogramme.- 7.1 Unterprogramm-Technik.- 7.2 Parameterübergabe.- 7.3 Konforme Reihungsschemata (level 1 implementation).- 7.4 Prozedur (PROCEDURE).- 7.5 Funktion (FUNCTION).- 7.6 Rundreise-Problem.- 7.7 Bereichsschachtelung.- 7.8 Testfragen.- 8 Datei (File).- 8.l Sequentieller Dateityp, Modus, Komponente.- 8.2 Text-Datei (TEXT), siehe A.2.2/5/6.- 8.3 Testfragen.- A Anhang.- A. l Syntax-Diagramme.- A.2 Standard-Bibliothek (Vordefinierte Vereinbarungen).- A.2.1 Standard-Konstanten.- A.2.2 Standard-Typen.- A.2.3 Standard-Operationen.- A.2.3.1 Arithmetic Operations.- A.2.3.2 Relational Operations.- A.2.3.3 Boolean Operations.- A.2.3.4 Set Operations.-A.2.3.5 Other Operations'.- A.2.4 Standard-Funktionen.- A.2.4.1 Arithmetic Functions.- A.2.4.2 Boolean Functions (Predicates).- A.2.4.3 Transfer Functions.- A.2.4.4 Further Standard Functions.- A.2.5 Standard-Prozeduren.- A.2.5.1 Dynamic Allocation Procedures.- A.2.5.2 Data Transfer Procedures.- A.2.5.3 File Handling Procedures.- A.2.5.4 Input- Procedures READ and READLN.- A.2.5.5 Output-Procedures WRITE and WRITELN.- A.2.6 Standard-Dateien INPUT, OUTPUT.- Übg Übungsaufgaben.- Geordnet nach dem ACM-Index.- Lit Literaturverzeichnis.- Lit. l Lehrbücher.- Lit.2 Anwendungen.- Ind Alphabetischer Index.- Fachausdrücke, deutsch/englisch.Table of Contents0 Einleitung und Notationen.- 0.1 Historische Entwicklung.- 0.2 Einführende Beispiele.- 0.2.1 Anzahl der Buchstaben E/e in einem Satz.- 0.2.2 Turm von Hanoi, rekursive Lösung.- 0.3 Schreibweisen.- 0.3.1 Quelltext-Zeichen und lexikalische Symbole.- 0.3.2 Verwendung des Syntax-Diagramms, siehe A.1.- 0.3.3 Kommentar.- 0.4 Testfragen.- 1 Einfache Datentypen und Ein/Ausgabe.- 1.1 AufZählungstypen und Unterbereichstypen.- 1.2 CHAR, siehe A.2.2.- 1.3 BOOLEAN, siehe A.2.2.- 1.4 Ordinale und Simple Typen.- 1.5 Zahlbezeichnungen.- 1.6 INTEGER, siehe A.2.2.- 1.7 REAL, siehe A.2.2.- 1.8 String, vgl. 5.3.- 1.9 Einfache Ein/Ausgabe mit READ, WRITE.- 1.10 Testfragen.- 2 Einfacher Programmaufbau.- 2.1 Verfügbarmachung externer Dateien, vgl. 8.- 2.2 Vereinbarungen.- 2.2.1 Zielvereinbarung (LABEL).- 2.2.2 Konstantenvereinbarung (CONST).- 2.2.3 Typvereinbarung (TYPE).- 2.2.4 Variablenvereinbarung (VAR).- 2.3 Testfragen.- 3 Ausdrücke.- 3.1 Primärausdrücke.- 3.1.1 Aufrufe von Standard-Funktionen, siehe A.2.4.- 3.1.2 Rundung ROUND, Abschneiden TRUNC.- 3.2 Ausdrücke, allgemein.- 3.2.1 Prioritäten von Operatoren.- 3.2.2 Ganzahlige Division DIV, Rest MOD.- 3.3 Testfragen.- 4 Anweisungen.- 4.1 Assignment Statement.- 4.2 Empty Statement.- 4.3 IF Statement.- 4.4 CASE Statement.- 4.5 Schleifen.- 4.5.1 FOR Statement.- 4.5.2 WHILE Statement.- 4.5.3 REPEAT Statement.- 4.6 Folgen von Anweisungen (compound statement).- 4.7 Label, GOTO Statement.- 4.8 Testfragen.- 5 Reihung (Array) und Mengenbildung (SET).- 5.1 Reihungstyp, Komponente.- 5.2 PACKED, vgl. A.2.5.2.- 5.3 String, vgl. 1.8.- 5.4 Potenzmengentyp, Mengen-Aggregat.- 5.5 Testfragen.- 6 Zeiger und Verbund.- 6.1 Zeiger (^ Symbol).- 6.1.1 Zeigertyp, Allokation, Selektor.- 6.2 Verbund (RECORD).- 6.2.1 Verbundtyp, Komponente, Selektor.- 6.2.2 Namensabkürzung für Komponenten (WITH).- 6.3 Testfragen.- 7 Unterprogramme.- 7.1 Unterprogramm-Technik.- 7.1.1 Unterprogramm-Vereinbarung, FORWARD- Spezifikation.- 7.1.2 Unterprogramm-Aufruf, Rekursion.- 7.2 Parameterübergabe.- 7.2.1 Wert-Parameter.- 7.2.2 VAR -Parameter.- 7.2.3 Unterprogramm-Parameter.- 7.3 Konforme Reihungsschemata (level 1 implementation).- 7.4 Prozedur (PROCEDURE).- 7.5 Funktion (FUNCTION).- 7.6 Rundreise-Problem.- 7.7 Bereichsschachtelung.- 7.7.1 Vereinbart / nicht vereinbart.- 7.7.2 Lokal / global.- 7.7.3 Erzeugt / nicht erzeugt, Ausnahmen.- 7.7.4 Aufrufbar / unterdrückt.- 7.7.5 Bereichsfreie Größen, Speicherbereinigung,u.a.m..- 7.8 Testfragen.- 8 Datei (File).- 8.l Sequentieller Dateityp, Modus, Komponente.- 8.2 Text-Datei (TEXT), siehe A.2.2/5/6.- 8.3 Testfragen.- A Anhang.- A. l Syntax-Diagramme.- A.2 Standard-Bibliothek (Vordefinierte Vereinbarungen).- A.2.1 Standard-Konstanten.- A.2.2 Standard-Typen.- A.2.3 Standard-Operationen.- A.2.3.1 Arithmetic Operations.- A.2.3.2 Relational Operations.- A.2.3.3 Boolean Operations.- A.2.3.4 Set Operations.- A.2.3.5 Other ‘Operations’.- A.2.4 Standard-Funktionen.- A.2.4.1 Arithmetic Functions.- A.2.4.2 Boolean Functions (Predicates).- A.2.4.3 Transfer Functions.- A.2.4.4 Further Standard Functions.- A.2.5 Standard-Prozeduren.- A.2.5.1 Dynamic Allocation Procedures.- A.2.5.2 Data Transfer Procedures.- A.2.5.3 File Handling Procedures.- A.2.5.4 Input- Procedures READ and READLN.- A.2.5.5 Output-Procedures WRITE and WRITELN.- A.2.6 Standard-Dateien INPUT, OUTPUT.- Übg Übungsaufgaben.- Geordnet nach dem ACM-Index.- Lit Literaturverzeichnis.- Lit. l Lehrbücher.- Lit.2 Anwendungen.- Ind Alphabetischer Index.- Fachausdrücke, deutsch/englisch.
£40.84
Springer Fachmedien Wiesbaden COBOL — Das Handbuch für den professionellen
Book SynopsisCOBOL dürfte die am meisten angewendete Programmiersprache seit ihrer ersten Veröffentlichung im Jahre 1960 sein. Man schätzt, daß etwa 40% aller geschriebenen Programme in COBOL abgefaßt worden sind, wobei der Trend eher als zunehmend zu beurteilen ist. Der Grund für dieses gesteigerte Interesse liegt vor allem in der ständig zu nehmenden Aufbereitung und Verarbeitung von Massendaten aus allen wirtschaftlich orientierten Bereichen, wofür COBOL hervorragend ge eignet ist. Da die anwenderbezogenen Anforderungen an die Verar beitung dieser Daten einer ständigen Entwicklung unterliegen, muß auch COBOL dieser Entwicklung gerecht werden. Seit 1968 hat das American National Standards Institute (ANS I) , dem auch ein inter nationaler Beraterkreis angehört, die Standardisierung der COBOL Entwicklung übernommen. Dadurch wurde der Grundstein für die Kompatibilität der Sprache gelegt. Heute sind alle publizierten COBOL Versionen aufwärtskompatibel. Das heißt, daß auch Programme, die in älteren Versionen geschrieben wurden, beim Einsatz neuer Compiler Versionen unter geringfügigen Quell-Code-Änderungen läuffähig bleiben. Damit ist COBOL zu einer lebendigen Programmiersprache geworden, die eine zukünftige Entwicklung bereits in sich trägt und universell einsetzbar ist. Da COBOL für die Verarbeitung großer Datenmengen geschaffen wurde, war ihr Einsatz in der Vergangenheit auf Großrechner be schränkt. Durch die rasche Hardware-Entwicklung, die vor allem durch immer schnellere Rechner und größere Speicherkapazitäten auf kleinstem Raum zum Ausdruck kommt, können COBOL-Programme auch zunehmend auf mittleren und Kleinanlagen eingesetzt werden. Die Computer-Hersteller haben dieser Entwicklung Rechnung getragen und eine Reihe sehr guter Compiler entwickelt, die auf dem PC einsetzbar sind.Table of Contents1 Entwicklung von COBOL.- 2 COBOL-Notation (Syntax).- 3 Die COBOL-Programmstruktur.- 3.1 Die Divisions.- 3.2 Der COBOL-Zeichenvorrat.- 3.3 COBOL-Zeichenfolgen.- 3.3.1 COBOL-Wortarten.- 3.3.1.1 Programmierer-Wörter.- 3.3.1.2 Systemnamen.- 3.3.1.3 Reservierte Wörter.- 3.3.2 Literate.- 3.3.2.1 Numerische Literate.- 3.3.2.2 Nichtnumerische Literate.- 3.3.3 PICTURE-Zeichenfolgen.- 3.4 Das Standard-COBOL-Format.- 3.4.1 Zeilenfortsetzung.- 3.4.1.1 Trennen von Wörtern und numerischen Literaten.- 3.4.1.2 Trennen von nichtnumerischen Literaten.- 3.4.2 Kommentarzeilen.- 3.4.3 Leerzeilen.- 3.5 Das COBOL-Quellprogramm.- 4 Identification Division.- 4.1 Der Paragraph PROGRAM-ID.- 4.2 Die wahlfreien Paragraphen.- 5 Environment Division.- 5.1 Configuration Section.- 5.1.1 Der Paragraph SOURCE-COMPUTER.- 5.1.1.1 WITH DEBUGGING MODE-Klausel.- 5.1.2 Der Paragraph OBJECT-COMPUTER.- 5.1.2.1 MEMORY SIZE-Klausel.- 5.1.2.2 SEGMENT-LIMIT-Klausel.- 5.1.2.3 PROGRAM COLLATING SEQUENCE-Klausel.- 5.1.3 Der Paragraph SPECIAL-NAMES.- 5.1.3.1 Funktionsname-1 IS Merkname-Klausel.- 5.1.3.2 Funktionsname-2 IS Merkname-Klausel.- 5.1.3.3 ALPHABET Alphabetname-Klausel.- 5.1.3.4 CURRENCY SIGN-Klausel.- 5.1.3.5 DECIMAL-POINT IS COMMA-Klausel.- 5.1.3.6 CLASS-Klausel.- 5.2 Input-Output Section.- 5.2.1 Dateiorganisationsformen und Zugriffsmethoden.- 5.2.1.1 Sequentielle Organisationsform.- 5.2.1.2 Indizierte Organisationsform.- 5.2.1.3 Relative Organisationsform.- 5.2.1.4 Sequentieller Zugriff.- 5.2.1.5 Wahlfreier Zugriff.- 5.2.1.6 Dynamischer Zugriff.- 5.3 Der Paragraph FILE-CONTROL.- 5.3.1 SELECT-Klausel.- 5.3.2 ASSIGN-Klausel.- 5.3.3 RESERVE-Klausel.- 5.3.4 ORGANIZATION-Klausel.- 5.3.5 ACCESS MODE-Klausel.- 5.3.6 PADDING CHARACTER-Klausel.- 5.3.7 RECORD DELIMITER-Klausel.- 5.3.8 RECORD KEY-Klausel.- 5.3.9 ALTERNATE RECORD KEY-Klausel.- 5.3.10 FILE STATUS-Klausel.- 5.4 Der Paragraph I-O-CONTROL.- 5.4.1 RERUN-Klausel.- 5.4.2 SAME AREA-Klausel.- 5.4.3 MULTIPLE FILE TAPE-Klausel.- 5.4.4 APPLY WRITE ONLY-Klausel.- 6 Data Division.- 6.1 File Section.- 6.1.1 BLOCK CONTAINS-Klausel.- 6.1.2 RECORD CONTAINS-Klausel.- 6.1.3 LABEL RECORD-Klausel.- 6.1.4 VALUE OF-Klausel.- 6.1.5 DATA RECORDS-Klausel.- 6.1.6 LINAGE-Klausel.- 6.1.7 RECORDING MODE-Klausel.- 6.1.8 CODE SET-Klausel.- 6.2 Datenbeschreibung.- 6.2.1 Stufennummern.- 6.2.1.1 Stufennummern für die Satzbeschreibung.- 6.2.1.2 Spezielle Stufennummern.- 6.3 Datenerklärung.- 6.3.1 Datennamen.- 6.3.1.1 Die Feldbezeichnung FILLER.- 6.3.2 PICTURE-Klausel.- 6.3.2.1 Datenklassen und Datenkategorien.- 6.3.2.2 Alphabetische Datenelemente.- 6.3.2.3 Numerische Datenelemente.- 6.3.2.4 Alphanumerische Datenelemente.- 6.3.2.5 Aufbau der PICTURE-Zeichenfolge.- 6.3.2.6 PICTURE-Symbole für die Druckaufbereitung.- 6.3.2.7 Mindestlange der PICTURE-Zeichenfolge.- 6.3.3 SIGN-Klausel.- 6.3.4 REDEFINES-Klausel.- 6.3.4.1 Implizite Redefinition (FILE SECTION).- 6.3.4.2 Explizite Redefinition.- 6.3.4.3 Mehrmalige Redefinition eines Datenbereichs.- 6.3.4.4 Redefinition von Einzelfeldern.- 6.3.4.5 Datenübertragungen in redefinierte und redefinierende Felder.- 6.3.5 BLANK WHEN ZERO-Klausel.- 6.3.6 JUSTIFIED RIGHT-Klausel.- 6.3.7 OCCURS-Klausel.- 6.3.8 SYNCHRONIZED-Klausel.- 6.3.8.1 Einfügung von Füll-Bytes durch den Compiler.- 6.3.8.2 Einfügung von Füll-Bytes durch den Programmierer.- 6.3.9 USAGE-Klausel.- 6.3.9.1 Usage Is Display.- 6.3.9.2 Usage Is Binary.- 6.3.9.3 Usage Is Computational (COMP).- 6.3.9.4 Usage Is Index.- 6.3.9.5 Usage Is Packed-Decimal.- 6.3.9.6 Vorzeichenverarbeitung unter VS COBOL II.- 6.3.9.7 Einfluß des Datenformats auf die Effizienz arithmetischer Operationen.- 6.3.10 VALUE-Klausel.- 6.3.11 RENAMES-Klausel.- 6.3.12 Stufennummer 88.- 7 Procedure Division.- 7.1 Die Struktur der PROCEDURE DIVISION.- 7.1.1 Der selbstdefinierte Dateistatus.- 7.2 Datenübertragungen.- 7.2.1 ACCEPT-Anweisung.- 7.2.1.1 Übertragung von Daten.- 7.2.1.2 Übertragung von Systeminformationen.- 7.2.2 DISPLAY-Anweisung.- 7.2.3 MOVE-Anweisung.- 7.2.4 MOVE CORRESPONDING-Anweisung.- 7.2.5 STRING-Anweisung.- 7.2.6 UNSTRING-Anweisung.- 7.2.7 INSPECT-Anweisung.- 7.2.8 INITIALIZE-Anweisung.- 7.2.8.1 Initialisierung von Tabellen.- 7.3 Arithmetische Ausdrücke.- 7.3.1 Arithmetische Operatoren.- 7.4 Bedingungen.- 7.4.1 Einfache Bedingungen.- 7.4.1.1 Klassenbedingungen.- 7.4.1.2 Vorzeichenbedingungen.- 7.4.1.3 Vergleichsbedingungen.- 7.4.1.4 Bedingungsnamen-Bedingungen.- 7.4.2 Zusammengesetzte Bedingungen.- 7.5 Bedingte Anweisungen.- 7.5.1 IF-Anweisung.- 7.5.1.1 Geschachtelte IF-Anweisungen.- 7.5.1.2 IF-Anweisungen mit Leerzweigen.- 7.5.2 CONTINUE-Anweisung.- 7.5.3 EVALUATE-Anweisung.- 7.5.3.1 Verarbeitung von Entscheidungstabellen.- 7.6 Arithmetische Anweisungen.- 7.6.1 ROUNDED-Angabe.- 7.6.2 ON SIZE ERROR-Angabe.- 7.6.3 NOT ON SIZE ERROR-Angabe.- 7.6.4 END-Begrenzungen.- 7.6.5 ADD-Anweisung.- 7.6.6 SUBTRACT-Anweisung.- 7.6.7 MULTIPLY-Anweisung.- 7.6.8 DIVIDE-Anweisung.- 7.6.9 COMPUTE-Anweisung.- 7.7 Eingabe-/Ausgabeanweisungen.- 7.7.1 OPEN-Anweisung.- 7.7.2 CLOSE-Anweisung.- 7.7.3 READ-Anweisung.- 7.7.4 WRITE-Anweisung.- 7.7.5 REWRITE-Anweisung.- 7.7.6 START-Anweisung.- 7.7.7 DELETE-Anweisung.- 7.8 Programmverzweigungen.- 7.8.1 PERFORM-Anweisung.- 7.8.1.1 Tabellverarbeitung mit PERFORM VARYING.- 7.8.1.2 Geschachtelte PERFORM-Anweisungen.- 7.8.2 EXIT-Anweisung.- 7.8.3 GO TO-Anweisung.- 7.8.4 GO TO ... DEPENDING ON-Anweisung.- 7.8.5 STOP-Anweisung.- 7.8.6 ALTER-Anweisung.- 7.9 Tabellenverarbeitung.- 7.9.1 OCCURS-Klausel.- 7.9.1.1 Normalindizierung (Subscripting).- 7.9.1.2 Spezialindizierung (Indexing).- 7.9.1.3 Mehrdimensionale Tabellen.- 7.9.2 SET-Anweisung.- 7.9.3 SEARCH-Anweisung.- 7.9.3.1 Sequentielles Durchsuchen einer Tabelle.- 7.9.3.2 Binares Durchsuchen einer Tabelle.- 7.10 Änderung von Quell-Text.- 7.10.1 COPY-Anweisung.- 7.10.2 REPLACING-Anweisung.- 7.10.3 BASIS-Anweisung.- 8 Externe Unterprogramme.- 8.1 CALL-Anweisung.- 8.1.1 USING-Zusatz.- 8.1.1.1 Using by Reference/Content.- 8.2 USING-Zusatz in der PROCEDURE DIVISION des Unterprogramms.- 8.3 LINKAGE SECTION.- 8.4 EXIT PROGRAM-Anweisung.- 8.5 CANCEL-Anweisung.- 8.6 ENTRY-Anweisung.- 9 Sortieren und Mischen.- 9.1 Sortieren von Dateien (SORT).- 9.1.1 SELECT/ASSIGN-Klausel.- 9.1.2 SD-Eintragung.- 9.1.3 SORT-Anweisung.- 9.1.4 RELEASE-Anweisung.- 9.1.5 RETURN-Anweisung.- 9.2 Mischen von Dateien (MERGE).- 9.2.1 MERGE-Anweisung.- 9.3 Das IBM-Dienstprogramm DFSORT.- 9.3.1 Die IBM-Sonderregister.- 10 Declaratives.- 10.1 USE-Anweisung.- 11 Dialog-orientierte Programmierung.- 11.1 Menü-Technik mit MS-COBOL.- 11.1.1 Positionierung des Cursors.- 11.1.1.1 Cursor-Klausel (CURSOR IS daten-name).- 11.1.2 Löschen des Bildschirms.- 11.1.3 Struktur der Aus- und Eingabebereiche.- 11.2 Menü-Technik mit den Mitteln des ANSI-Standards unter VS COBOL II.- 12 Grundlagen der strukturierten Programmierung.- 12.1 Der logische Aufbau eines strukturierten Programms.- 12.1.1 Der Haupt-Modul.- 12.2 COBOL-Tools für die strukturierte Programmierung.- 12.3 Allgemeine Regeln und Empfehlungen zur Erstellung eines strukturierten Programms.- 12.3.1 Maßnahmen zur Verbesserung der Lesbarkeit des Quell-Programms.- 12.3.2 Kennzeichnung der Paragraphen-Namen.- 12.3.3 Der eingeschränkte Gebrauch von GO TO.- 12.3.4 Der Programmentwurf im Strukturtext.- 12.4 Struktogramm-Technik.- 12.4.1 Einfacher Strukturblock.- 12.4.2 Bedingungs-Strukturblock.- 12.4.3 CASE-Strukturblock.- 12.4.4 CYCLE-Strukturblock.- 12.4.4.1 Realisierung eines CYCLE-Blocks durch das IN-LINE-PERFORM.- 12.4.5 Prozeduraufruf-Strukturblock.- 12.4.6 BREAK-Strukturblock.- 12.4.7 Klammer-Strukturblock.- Anhang 1: ASCII-Sortierfolge (8-Bit-Code).- Anhang 2: EBCDIC-Sortierfolge (IBM-Standard U.S.).- Anhang 3: Liste der reservierten COBOL-Wörter.- Sachwortverzeichnis.
£58.49
Springer Fachmedien Wiesbaden Pattern Recognition and Image Processing in C++
Book SynopsisParts of this text were used for several years by students in a one~term under graduate course in computer science. The students had to prepare projects in small groups (2~4 students).1 This book emphasizes practical experience with image processing. It offers a comprehensive study of • image processing and image analysis, • basics of speech processing, • object~oriented programming, • software design, • and programming in C++. The book is divided into four parts. In the first part we introduce image processing, image analysis, programming tools, and the basics of C++. In the second part we describe object~oriented programming in general and the possible applications of object~oriented concepts in C++. Several appli cations of object~oriented programming for image processing are discussed as well. The new features of C++ are introduced entirely through the use of examples. We cover the proper representation of the data that is a result of pattern analysis as well. The third part describes a complete system for image segmentation. Some of the material covered refers to the exercises found in the first and second parts: this verifies our belief that an image segmentation system of programs can be developed while simultaneously acquainting others to C++. We combine the data representation described in the second part with the algorithms that use and manipulate them here in the third part.Table of ContentsI Introductions.- 1 Pattern Recognition.- 1.1 Images and Sound.- 1.2 Applications of Pattern Recognition.- 1.3 Environment, Problem Domain, and Patterns.- 1.4 Characterization of Pattern Recognition.- 1.5 Recording of Speech Signals.- 1.6 Video Cameras and Projections.- 1.7 From Continuous to Digital Signals.- 1.8 Sampling Theorem in Practice.- 1.9 Visualization and Sound Generation.- 2 From C to C++.- 2.1 Syntax Notation.- 2.2 Principle of C++ Compilation.- 2.3 Function Calls and Arguments.- 2.4 Declaration and Definition of Variables.- 2.5 Unix-File Access via Standard Functions.- 2.6 Formatted Input and Output.- 2.7 Main Program.- 2.8 Preprocessor Directives.- 2.9 Conditional Compilation.- 3 Software Development.- 3.1 Software for Pattern Recognition.- 3.2 Principles of Software Development.- 3.3 Modular and Structured Programming.- 3.4 Comments and Program Layout.- 3.5 Documentation.- 3.6 Teamwork.- 3.7 Efficiency.- 3.8 Tools for Software Development with Unix.- 3.9 PUMA.- 4 Expressions, Statements, Functions.- 4.1 Instructions and Expressions.- 4.2 Logical Values and Conditionals.- 4.3 Function Definition.- 4.4 Loops.- 4.5 Declarations and Scope.- 4.6 Switches.- 4.7 Linkage.- 4.8 Programming with Modules.- 4.9 Control Structures.- 5 Classification and Pattern Analysis.- 5.1 Classification.- 5.2 Preprocessing.- 5.3 Feature Extraction.- 5.4 Analysis.- 5.5 Image Segmentation.- 5.6 Speech Segmentation.- 5.7 Pattern Understanding.- 5.8 Active Vision and Real Time Processing.- 5.9 Top-Level Loop for Speech Analysis.- 6 Arrays and Pointers.- 6.1 Vectors and Matrices.- 6.2 Pointers.- 6.3 Vectors vs. Pointers.- 6.4 Vector Initialization.- 6.5 Strings.- 6.6 Pointers Operations and Allocation.- 6.7 Pointer and Array Arguments.- 6.8 Pointer to Pointer.- 6.9 Main Function Arguments.- 7 Statistics for Pattern Recognition.- 7.1 Axioms.- 7.2 Discrete Random Variables.- 7.3 Continuous Random Variables.- 7.4 Mean and Variance.- 7.5 Moments of a Distribution.- 7.6 Random Vectors.- 7.7 Statistical Features and Entropy.- 7.8 Signal-to-Noise Ratio.- 7.9 Histograms.- 8 C++ as a better C.- 8.1 Type Declaration.- 8.2 Type Conversion for Pointers.- 8.3 Bit- and Shift-Operations.- 8.4 Type Specifiers and Variable Declaration.- 8.5 Type-Safe Linkage.- 8.6 Overloaded Function Names.- 8.7 Return Value and Arguments.- 8.8 Macros and Inline Functions.- 8.9 Function Pointers.- II Object-Oriented Pattern Analysis.- 9 Object-Oriented Programming.- 9.1 Object-Oriented Software Techniques.- 9.2 Basic Concepts.- 9.3 Data Abstraction and Modules.- 9.4 Inheritance.- 9.5 Abstract Classes.- 9.6 Object-Oriented Classification.- 9.7 Polymorphism.- 9.8 Other Object-Oriented Concepts.- 9.9 Class Libraries.- 10 Classes in C++.- 10.1 Structures.- 10.2 Methods and ADT’s.- 10.3 Class Declarations.- 10.4 Object Construction.- 10.5 Destruction of Objects.- 10.6 Overloaded Operators.- 10.7 Advanced Methods and Constructors.- 10.8 Vector Class.- 10.9 Class Design.- 11 Intensity Images.- 11.1 Array Class.- 11.2 Templates in C++.- 11.3 Images.- 11.4 External Data Formats.- 11.5 Binary Images.- 11.6 Color Images.- 11.7 Sub Images.- 11.8 Image Transformation and Registration.- 11.9 Neighborhood.- 12 Inheritance in C++-Classes.- 12.1 Motivation and Syntax.- 12.2 Base Class Access.- 12.3 Construction and Destruction.- 12.4 Pointer to Objects.- 12.5 Virtual Functions.- 12.6 Abstract Classes.- 12.7 Image Class Hierarchy.- 12.8 Multiple Inheritance.- 12.9 Implementation Issues.- 13 Edge Detection and Edge Images.- 13.1 Motivation.- 13.2 Strategies.- 13.3 Discrete Derivative of the Intensity.- 13.4 Sobel and Prewitt Operator.- 13.5 Bit Fields in C++.- 13.6 Unions in C++.- 13.7 Edge Class.- 13.8 Edge Images.- 13.9 Color Edge Operators.- 14 Class Libraries.- 14.1 Stream Input and Output.- 14.2 NIH Class Library.- 14.3 Dynamic Class Descriptions.- 14.4 Static Class Members.- 14.5 Input and Output for Objects.- 14.6 Strings.- 14.7 Container Classes.- 14.8 Time and Date.- 14.9 More Classes.- 15 Hierarchy of Picture Processing Objects.- 15.1 General Structure.- 15.2 Hippos Object.- 15.3 Images and Matrices.- 15.4 Chain Code Class.- 15.5 Enumerations and Scope Resolution.- 15.6 Polygonal Representation.- 15.7 Atomic Objects.- 15.8 Segmentation Objects.- 15.9 External Representation.- 16 Spectral Features and Speech Processing.- 16.1 Fourier Series and Fourier Transform.- 16.2 Discrete Fourier Transform.- 16.3 Fast Fourier Transform.- 16.4 2D Fourier Transform.- 16.5 Short time Fourier analysis.- 16.6 Linear Predictive Coding.- 16.7 Dynamic Time Warping.- 16.8 Hidden Markov Models.- 16.9 Different Types of Hidden Markov Modells.- III Pattern Recognition Algorithms.- 17 An Image Analysis System.- 17.1 Data Flow.- 17.2 Design of ANIMALS.- 17.3 XDR.- 17.4 Display and Capture.- 17.5 Graphical User Interfaces.- 17.6 Geometric Distortions.- 17.7 Polymorphic image processing.- 17.8 Efficiency.- 17.9 Image Segmentation Program.- 18 Synthetic Signals and Images.- 18.1 Synthetic Sound.- 18.2 Geometric Patterns.- 18.3 Pixel Noise.- 18.4 Gaussian Noise.- 18.5 Salt-and-Pepper Noise.- 18.6 Different Views of a 3D Polyhedral Object.- 18.7 Digits and Letters.- 18.8 Single Stereo Images.- 18.9 Spectrogram.- 19 Filtering and Smoothing Signals.- 19.1 Mean-Filter and Gaussian-Filter.- 19.2 Median-Filter.- 19.3 Smoothed Median-Filter.- 19.4 Edge Preserving Smoothing.- 19.5 K-Nearest Neighbor Averaging.- 19.6 Conditional Average Filter.- 19.7 Linear Reconstruction.- 19.8 Elimination of Noisy Image Rows.- 19.9 Resolution Hierarchies.- 20 Histogram Algorithms.- 20.1 Discriminant and Least Squares Threshold.- 20.2 Histogram Entropy Thresholding.- 20.3 Multithresholding.- 20.4 Local Histogram Equalization.- 20.5 Lookup Table Transformation.- 20.6 A Class for Histograms.- 21 Edge Images.- 21.1 Robert’s Cross.- 21.2 Second Derivative.- 21.3 Edge Model Masks.- 21.4 Alternative Methods.- 21.5 Thinning of Edge Images.- 21.6 Edge Thresholding.- 21.7 Non Maxima Suppression.- 21.8 Non Maxima Absorption.- 21.9 Class Edge Revisited.- 22 Line Detection Algorithms.- 22.1 Line Detection.- 22.2 Local Connectivity.- 22.3 Hysteresis Thresholds.- 22.4 Closing of Gaps.- 22.5 Zero crossings in Laplace-Images.- 22.6 Hough Transform.- 22.7 Canny Line Detection.- 22.8 Shen and Castan.- 22.9 Representation as Segmentation Objects.- 23 Chain Codes.- 23.1 Length of a Chain.- 23.2 Smoothing.- 23.3 Digital Linear Lines.- 23.4 Similarity.- 23.5 Intersections.- 23.6 Rotation.- 23.7 Conversion.- IV Appendix.- A Basics of C++.- A.1 History.- A.2 Identifier and Constants.- A.3 Basis Data Types in C and C++.- B Software Development Tools.- B.1 Groups and ID’s with Unix.- B.2 Program Building with make.- B.3 The Use of Libraries.- B.4 Version and Access Control with rcs.- C Source Codes and Tools.- C.1 List of Tools.- C.2 How to get the sources.- C.3 X11.- C.4 Slides.- C.5 Addresses.- C.6 Headers and Source Files.- C.7 Dummy Definitions.- C.7.1 Listing of animals/dummy/Dictionary.h.- C.7.2 Listing of animals/dummy/OIOxdr.h.- C.7.3 Listing of animals/ dummy/Represent.h.- C.7.4 Listing of animals/dummy/SeqCltn.h.- C.7.5 Listing of animals/dummy/Set.h.- C.7.6 Listing of animals/dummy/dummies. C.- References.- Figures.- Tables.- Index for Exercises.
£98.99
Springer Fachmedien Wiesbaden Einführung in die klassische und intensionale
Book SynopsisDas Buch setzt sich zum Ziel, auch mathematisch wenig vorgebildete Leser in die klassische zweiwertige Logik und ihre intensionalen Erweiterungen wie Modal-Logik, Zeit-Logik und dynamische Logik einzuführen. Die hier näher betrachteten intensionalen Systeme hängen zusammen mit Fragen aus der Beweistheorie der Peano-Arithmetik, Korrektheitsfragen in der Theorie der Programmiersprachen und mit Problemen, die die Semantik natürlicher Sprachen betreffen.Table of ContentsAussagenlogik - modale Aussagenlogik und Varianten - Grundbegriffe der Prädikatenlogik - Herbrandscher Satz - Gödelscher Vollständigkeitssatz - modale Aspekte der Gödelschen Unvollständigkeitssätze - modelltheoretische Begriffe - modale und dynamische Prädikatenlogik - höherstufige Prädikatenlogik und Typentheorie.
£49.49
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Software Engineering 3: Domains, Requirements, and Software Design
Book SynopsisThe final installment in this three-volume set is based on this maxim: "Before software can be designed its requirements must be well understood, and before the requirements can be expressed properly the domain of the application must be well understood." The book covers the process from the development of domain descriptions, through the derivation of requirements prescriptions from domain models, to the refinement of requirements into software architectures and component design.Trade ReviewFrom the reviews: "The presentation is focused on the fundamental ideas of domain engineering, requirements engineering and computer system engineering. … The rigorous treatment and the author’s original style of viewing the software engineering approaches are important, outstanding features … . is of special interest for both software engineering theorists and practitioners … . The style is very concise, but at the same time very friendly. … Undoubtedly, readers coming from a large variety of fields of interest will appreciate the novelty and usefulness … ." (Tudor Balanescu, Zentralblatt MATH, Vol. 1095 (21), 2006)Table of ContentsOpening.- The Triptych Paradigm.- Documents.- Conceptual Framework.- Methods and Methodology.- Models and Modelling.- Descriptions: Theory and Practice.- Phenomena and Concepts.- On Defining and on Definitions.- Jackson’s Description Principles.- Domain Engineering.- Overview of Domain Engineering.- Domain Stakeholders.- Domain Attributes.- Domain Facets.- Domain Acquisition.- Domain Analysis and Concept Formation.- Domain Verification and Validation.- Towards Domain Theories.- The Domain Engineering Process Model.- Requirements Engineering.- Overview of Requirements Engineering.- Requirements Stakeholders.- Requirements Facets.- Requirements Acquisition.- Requirements Analysis and Concept Formation.- Requirements Verification and Validation.- Requirements Satisfiability and Feasibility.- The Requirements Engineering Process Model.- Computing Systems Design.- Hardware/Software Codesign.- Software Architecture Design.- A Case Study in Component Design.- Domain-Specific Architectures.- Etcetera: Coding and All That!.- The Computing Systems Design Process Model.- Closing.- The Triptych Development Process Model.- Finale.
£89.99
Springer Fachmedien Wiesbaden Grundkurs Microsoft Dynamics AX: Die
Book SynopsisPraktiker, IT-Verantwortliche und Berater erhalten eine konkrete und leicht verständliche Anleitung zur Arbeit in Microsoft Dynamics AX 2009. Dieses von Microsoft als Premium-Lösung für den Mittelstand positionierte ERP-System ist für alle Unternehmen interessant, die ein leistungsfähiges System suchen, das dennoch einfach zu bedienen ist. Über ein zur besseren Verständlichkeit einfach gehaltenes, durchgängiges Fallbeispiel - die Modellfirma "Anso Technologies GmbH" - erhalten Sie das erforderliche Fachwissen zu Grundlagen und Systemfunktionen und können sämtliche zentrale Geschäftsprozesse in Dynamics AX abwickeln. Übungsaufgaben unterstützen die Erläuterungen, sodass dieses Buch auch für das Selbststudium gut geeignet ist. Das Buch bezieht sich auf die aktuelle Version Dynamics AX 2009. Neuerungen im Vergleich zur Vorgängerversion Dynamics AX 4.0 sind hervorgehoben.Table of ContentsGrundlagen und Architektur - Oberfläche und Bedienung - Logistik und Supply Chain Management - Handel und Vertriebsabwicklung - Produktionsplanung und -steuerung - Finanzmanagement
£36.09
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Softwareprojekte erfolgreich managen: Grundlagen,
Book SynopsisWissenschaftlich belegt scheitern mehr als die Hälfte aller Softwareprojekte. Da sie nicht zum Kerngeschäft gehören, werden ihre Komplexität und Risiken unterschätzt. Angesichts der Investitionen und Folgewirkungen, die ein Softwareprojekt mit sich bringt, muss es im Interesse des Unternehmens liegen, diese Risiken zumindest zu minimieren, wenn nicht sogar abzustellen. Das Buch zeigt den Lösungsweg, der es ermöglicht, Softwareprojekte erfolgreich zum Abschluss zu bringen. Ausgehend von Studien über die Ursachen des Scheiterns dieser Projekte werden Lösungskonzepte vorgestellt. Hieraus wird dann eine Methodik entwickelt, wie Softwareprojekte nach einem fest definierten Schema in analytischer Weise bearbeitet werden, um erfolgreich zu sein. Aus der Erfahrung einer 25jährigen Praxis beschreibt der Autor, wie Auftraggeber Softwareprojekte erfolgreich managen, wie sie jederzeit die Kontrolle über den gesamten Ablauf behalten, wie sie zusätzliche Kosten vermeiden, wie sie Verträge zu ihren Gunsten durchsetzen und wie sie ungerechtfertigte Ansprüche von Lieferanten abwehren. Zusätzlich gibt es Tipps und Ratschläge für typische Praxisprobleme und Checklisten zur Qualitätsverbesserung. Table of ContentsBedeutung des Softwareprojektmanagements.- Grundlagen und Zusammenhänge.- Methodische Entwicklung des Softwareprojektmanagements.- Praktische Umsetzung.- Entwicklung des Software-Projektmanagements.
£31.34
Springer Fachmedien Wiesbaden Angebotserstellung und Planung von
Book SynopsisAxel Kalenborn stellt einen Mock-Up-basierten Lösungsansatz zur Unterstützung der Angebotsphase bei Internet-Projekten vor und illustriert diesen durch ein Werkzeug. Der Ansatz des Autors ist wichtig, da viele Methoden des Requirements Engineering einen zu hohen Aufwand verursachen, so dass sie in der Phase der Angebotserstellung noch nicht angewendet werden können. Vor der Umsetzung eines Software-Projektes liegt aber diese in der Literatur bisher wenig beachtete Phase, während der eine Grobkonzeption der umzusetzenden Software in Form eines Angebotes erstellt werden muss. Bestandteil eines Angebots ist eine möglichst präzise Aufwandschätzung. In der Angebotsphase erhalten die Anbieter aber keine Vergütung und stehen in Konkurrenz zueinander, weshalb unter hohem Zeit-, Erfolgs- und Kostendruck gearbeitet werden muss.Table of ContentsMotivation.- Die Vorvertragsphase von Softwareprojekten.- Anforderungserhebung in der Vorvertragsphase.- Die werkzeugbasierte Modeling by Example Methode.- Das Mobex-Werkzeug zur Realisierung der MbE-Methode.- Evaluation der Methode.- Zusammenfassung und Ausblick.
£49.49
Springer Fachmedien Wiesbaden Systemkonsolidierung und Datenmigration als
Book SynopsisDieses essential geht präzise auf die Anforderungen und Lösungsansätze in Datenmigrations- und Konsolidierungsszenarien im SAP-Umfeld ein und präsentiert Fallbeispiele von SAP-Kunden. Der Beitrag unterstützt Unternehmen, die vor Fusionen, Zu- oder Verkäufen oder Umstrukturierungsvorhaben stehen und effiziente und verlässliche Lösungen zur Datenmigration benötigen, um die Organisationsstrukturen und Prozesse innerhalb ihrer Systemlandschaft an die betrieblichen Veränderungen anzupassen. Die Autoren zeigen, wie Unternehmen ihre Systemlandschaft harmonisieren und konsolidieren können und somit einheitliche Strukturen etabliert, die Systemkomplexität reduziert und damit der Geschäftsbetrieb verbessert werden können.Table of ContentsWas Sie in diesem Essential finden können.- Die Bedeutung von Datenmigration und Systemkonsolidierung für den Unternehmenserfolg.- Vereinfachung und Standardisierung bei großen Datenvolumen (Big Data) durch Systemkonsolidierung.- Datenmigration.- Was Sie aus diesem Essential mitnehmen können.
£11.77
