Programming and scripting languages: general Books

Book Synopsis

Read more less

Book Synopsis

Read more less

Book Synopsis1. Introduction to Modern C++23.- 2. Components of an Object-Oriented C++ Program.- 3. Option Payoff Hierarchies in C++.- 4. Generic Programming and Template Classes in C++.- 5. Introduction to the Standard Template Library (STL) in C++23.- 6. Function Objects in C++.- 7. Matrix Classes for Quantitative Finance.- 8. Numerical Linear Algebra in C++.- 9. Black Scholes and Pricing Fundamentals.- 10. Calculating the Greeks.- 11. European Options with Monte Carlo Simulation.- 12. Binomial and Trinomial Trees.- 13. Finite Difference Methods.- 14. Asian/Path-Dependent Options with Monte Carlo.- 15. Exotic Options.- 16. Implied Volatility.- 17. Stochastic Volatility.- 18. Random Number Generation and Statistical Distributions.- 19. Jump-Diffusion Models.- 20. Single Factor Interest Rate Models.- 21. Tree Building Procedures: BDT, Hull White Tree, Lognormal (Hull-White), Vasicek Cox-Ingersoll-Ross.- 22. Bermudan and Exotic Interest Rate Derivatives.- 23. Single Factor Black-Scholes with Finite Difference Methods.- 24. Two-Factor Models and the Heath-Jarrow-Morton Model.

Read more less

Book SynopsisChapter 1: Recursion.- Chapter 2: Divide and Conquer.- Chapter 3: Greedy Algorithm.- Chapter 4: Dynamic Programming.- Chapter 5: RSA Cryptosystem.- Chapter 6: Monte Carlo.- Chapter 7: A Tale of Ten Cities.- Chapter 8: Chess.- Appendix: A Quick Review of Python.- Appendix B: Environment Setup and Package Installation.- Appendix C: References.

Read more less

Book Synopsis1.       Getting started.- 2. Images and sound.- 3. Numbers.- 4. Mouse, and if.- 5. Loops and text input.- 6. Algorithms and the development process.- 7. Functions.- 8. Functions, continued.- 9. Using the debugger.- 10. Arrays, spans and enum.- 11. Animation with structs and sprites.- 12. Building your own arcade game.  input, collisions, and putting it all together.- 13. Standard I/O and file operations.- 14. Character arrays and dynamic memory.- 15. Classes.- 16. Classes, continued.- 17. Strings, and operators.- 18. String views, exceptions, move semantics, and O notation.- 19. Templates, including vector).- 20. Inheritance.- 21. Virtual functions and multiple inheritance.- 22. Linked lists.- 23. The Standard Template Library (STL) and functional-style programming.- 24. Functional-Style Programming, continued.- 25. Esoterica (recommended).- 26. Esoterica (recommended), continued.- 27. Esoterica (not so recommended).- 28. Building bigger projects.- 29. C.- 30. Moving on with SDL.

Read more less

Book SynopsisPart I: First look at Go.- Chapter 1: A Brief Look at Go vs. Java.- Chapter 2: What Java has that Go does not.- Chapter 3: A Deeper Comparison of Go and Java.- Part II: The Go Language.- Chapter 4: Key Go Aspects.- Chapter 5: Go Basic Features.- Chapter 6: Go Types.- Chapter 7: Errors and Panics.- Chapter 8: Go Statements.- Chapter 9: Applications for interfaces.- Chapter 10: Go Unit Tests and Benchmarks.- Chapter 11: Go Generic Types, Functions and Sample Programs.- Part III: Go Library Survey.- Chapter 12: Key Packages Comparison.- Chapter 13: Key Method/Function Comparison.- Chapter 14: Go Package Survey.- Chapter 15: SQL Database Access.-  Chapter 16: Client and Server Support.- Chapter 17: Go Runtime.- Appendix A. Installing Go.- Appendix B: Some Go FAQs.- Appendix C: Go Gotchas to look out for.- Appendix D: Mark-Sweep Pseudo-code.- Appendix E: ASCII vs. UTF-8..- Appendix F: Go Playground Examples.- G. Java Example Source.

Read more less

Book SynopsisChapter 1: About Python.- Chapter 2: Naming.- Chapter 3: Components of Code.- Chapter 4: Loops and if Statements.- Chapter 5: Basic Mathematics.- Chapter 6: Functions and Methods.- Chapter 7: Classes.- Chapter 8: Util.- Chapter 9: Unit Tests.- Chapter 10: Matplotlib.- Chapter 11: Numerical mathematics.- Chapter 12. More Examples.

Read more less

Book SynopsisMaking VHDL a simple and easy-to-use hardware description language Many engineers encountering VHDL (very high speed integrated circuits hardware description language) for the first time can feel overwhelmed by it. This book bridges the gap between the VHDL language and the hardware that results from logic synthesis with clear organisation, progressing from the basics of combinational logic, types, and operators; through special structures such as tristate buses, register banks and memories, to advanced themes such as developing your own packages, writing test benches and using the full range of synthesis types. This third edition has been substantially rewritten to include the new VHDL-2008 features that enable synthesis of fixed-point and floating-point hardware. Extensively updated throughout to reflect modern logic synthesis usage, it also contains a complete case study to demonstrate the updated features. Features to this edition include: a coTable of ContentsPreface xi List of Figures xv List of Tables xvii 1 Introduction 1 1.1 The VHDL Design Cycle 1 1.2 The Origins of VHDL 2 1.3 The Standardisation Process 3 1.4 Unification of VHDL Standards 4 1.5 Portability 4 2 Register-Transfer Level Design 7 2.1 The RTL Design Stages 8 2.2 Example Circuit 8 2.3 Identify the Data Operations 10 2.4 Determine the Data Precision 12 2.5 Choose Resources to Provide 12 2.6 Allocate Operations to Resources 13 2.7 Design the Controller 14 2.8 Design the Reset Mechanism 15 2.9 VHDL Description of the RTL Design 15 2.10 Synthesis Results 16 3 Combinational Logic 19 3.1 Design Units 19 3.2 Entities and Architectures 20 3.3 Simulation Model 22 3.4 Synthesis Templates 25 3.5 Signals and Ports 27 3.6 Initial Values 29 3.7 Simple Signal Assignments 30 3.8 Conditional Signal Assignments 31 3.9 Selected Signal Assignment 33 3.10 Worked Example 34 4 Basic Types 37 4.1 Synthesisable Types 37 4.2 Standard Types 37 4.3 Standard Operators 38 4.4 Type Bit 39 4.5 Type Boolean 39 4.6 Integer Types 41 4.7 Enumeration Types 46 4.8 Multi-Valued Logic Types 47 4.9 Records 48 4.10 Arrays 49 4.11 Aggregates, Strings and Bit-Strings 53 4.12 Attributes 56 4.13 More on Selected Signal Assignments 60 5 Operators 63 5.1 The Standard Operators 63 5.2 Operator Precedence 64 5.3 Boolean Operators 70 5.4 Comparison Operators 73 5.5 Shifting Operators 76 5.6 Arithmetic Operators 79 5.7 Concatenation Operator 84 6 Synthesis Types 85 6.1 Synthesis Type System 85 6.2 Making the Packages Visible 87 6.3 Logic Types – Std_Logic_1164 90 6.4 Numeric Types – Numeric_Std 95 6.5 Fixed-Point Types – Fixed_Pkg 105 6.6 Floating-Point Types – Float_Pkg 119 6.7 Type Conversions 134 6.8 Constant Values 144 6.9 Mixing Types in Expressions 146 6.10 Top-Level Interface 147 7 Std_Logic_Arith 151 7.1 The Std_Logic_Arith Package 151 7.2 Contents of Std_Logic_Arith 152 7.3 Type Conversions 161 7.4 Constant Values 162 7.5 Mixing Types in Expressions 164 8 Sequential VHDL 167 8.1 Processes 167 8.2 Signal Assignments 170 8.3 Variables 171 8.4 If Statements 172 8.5 Case Statements 177 8.6 Latch Inference 178 8.7 Loops 181 8.8 Worked Example 187 9 Registers 191 9.1 Basic D-Type Register 191 9.2 Simulation Model 192 9.3 Synthesis Model 193 9.4 Register Templates 195 9.5 Register Types 199 9.6 Clock Types 199 9.7 Clock Gating 200 9.8 Data Gating 201 9.9 Asynchronous Reset 203 9.10 Synchronous Reset 208 9.11 Registered Variables 210 9.12 Initial Values 211 10 Hierarchy 213 10.1 The Role of Components 213 10.2 Indirect Binding 214 10.3 Direct Binding 219 10.4 Component Packages 220 10.5 Parameterised Components 222 10.6 Generate Statements 225 10.7 Worked Examples 230 11 Subprograms 243 11.1 The Role of Subprograms 243 11.2 Functions 243 11.3 Operators 254 11.4 Type Conversions 258 11.5 Procedures 261 11.6 Declaring Subprograms 267 11.7 Worked Example 270 12 Special Structures 279 12.1 Tristates 279 12.2 Finite State Machines 284 12.3 RAMs and Register Banks 292 12.4 Decoders and ROMs 297 13 Test Benches 301 13.1 Test Benches 301 13.2 Combinational Test Bench 302 13.3 Verifying Responses 305 13.4 Clocks and Resets 307 13.5 Other Standard Types 310 13.6 Don’t Care Outputs 312 13.7 Printing Response Values 314 13.8 Using TextIO to Read Data Files 315 13.9 Reading Standard Types 318 13.10 TextIO Error Handling 319 13.11 TextIO for Synthesis Types 321 13.12 TextIO for User-Defined Types 322 13.13 Worked Example 325 14 Libraries 327 14.1 The Library 327 14.2 Library Names 328 14.3 Library Work 329 14.4 Standard Libraries 330 14.5 Organising Your Files 333 14.6 Incremental Compilation 335 15 Case Study 337 15.1 Specification 337 15.2 System-Level Design 338 15.3 RTL Design 340 15.4 Trial Synthesis 352 15.5 Testing the Design 353 15.6 Floating-Point Version 361 15.7 Final Synthesis 362 15.8 Generic Version 364 15.9 Conclusions 366 Appendix A Package Listings 369 A.1 Package Standard 369 A.2 Package Standard_Additions 373 A.3 Package Std_Logic_1164 380 A.4 Package Std_Logic_1164_Additions 383 A.5 Package Numeric_Std 389 A.6 Package Numeric_Std_Additions 393 A.7 Package Fixed_Float_Types 400 A.8 Package Fixed_Pkg 401 A.9 Package Float_Pkg 415 A.10 Package TextIO 429 A.11 Package Standard_Textio_Additions 431 A.12 Package Std_Logic_Arith 432 A.13 Package Math_Real 436 Appendix B Syntax Reference 439 B.1 Keywords 439 B.2 Design Units 440 B.3 Concurrent Statements 441 B.4 Sequential Statements 443 B.5 Expressions 444 B.6 Declarations 445 References 449 Index 451

Read more less

Book SynopsisC++ is established as the leading industry programming language for object-oriented software development. This book provides a step-by-step approach to all language features, explains their practical usage, provides intuitive examples that are not too complex or easy, and provides advice for implementing classes and libraries to develop programs.Trade Review"...technically solid, excellent introduction to C++..." (Cvu, December 2002)Table of ContentsPreface. 1. About this Book. Why Did Write this Book? Prerequisites. Organization of the Book. How Should You Read this Book? Example Code and Additional Informations. Feedback. 2. Introduction: C++ and Object-Oriented Programming. The C++ Language. C++ as an Object-Oriented Programming Language. Other Concepts of C++. Teminology. 3. Basic Concepts of C++ Programs. The First Program. Types, Operators, and Control Constructs. Functions and Modules. Strings. Collections. Exception Handling. Pointers, Arrays, and C-Strings. Memory Management Using new and delete. Communication with the Outside World. 4. Class Programming. The First Class: Fraction. Operators for Classes. Running Time and Code Optimization. References and Constants. Input and Output Using Streams. Friends and Other Types. Exception Handling for Classes. 5. Inheritance and Polymorphism. Virtual Functions. Polymorphism. Multiple Inheritance. Design Pitfalls with Inheritance. 6. Dynamic and Static Members. Dynamic Members. Other Aspects of Dynamic Members. Inheritance of Classes with Dynamic Members. Classes Containing Classes. Static Members and Auxiliary Types. 7. Templates. Why Templates? Function Templates. Class Templates. Non-Type Template Parameters. Additional Aspects of Templates. Templates in Practice. 8. The Standard I/O Library in Detail. The Standard Stream Classes. File Access. Stream Classes for Strings. 9. Other Language Features and Details. Additional Details of the Standard Library. Defining Special Operators. Additional Aspects of new and delete. Function Pointers and Member Pointers. Combining C++ with C Code. Additional Keywords. 10. Summary. Hierarchy of C++ Operators. Class-Specific Properties of Operations. Rules for Automatic Type Conversion. Useful Programming Guidelines and Conventions. Bibliography. Glossary. Index.

Read more less

Book SynopsisExplains the concepts underlying programming languages, and demonstrates how these concepts are synthesized in the paradigms: imperative, OO, concurrent, functional, logic and with scripting languages. This book includes numerous examples using C, Java and C++ as exemplar languages.Table of ContentsPreface. PART I: INTRODUCTION. 1. Programming Languages. 1.1 Programming linguistics. 1.1.1 Concepts and paradigms. 1.1.2 Syntax, semantics, and pragmatics. 1.1.3 Language processors. 1.2 Historical development. Summary. Further reading. Exercises. PART II: BASIC CONCEPTS 2. Values and Types. 2.1 Types. 2.2 Primitive types. 2.2.1 Built-in primitive types. 2.2.2 Defined primitive types. 2.2.3 Discrete primitive types. 2.3 Composite types. 2.3.1 Cartesian products, structures, and records. 2.3.2 Mappings, arrays, and functions. 2.3.3 Disjoint unions, discriminated records, and objects. 2.4 Recursive types. 2.4.1 Lists. 2.4.2 Strings. 2.4.3 Recursive types in general. 2.5 Type systems. 2.5.1 Static vs dynamic typing. 2.5.2 Type equivalence. 2.5.3 The Type Completeness Principle. 2.6 Expressions. 2.6.1 Literals. 2. 6.2 Constructions. 2.6.3 Function calls. 2.6.4 Conditional expressions. 2.6.5 Iterative expressions. 2.6.6 Constant and variable accesses. 2.7 Implementation notes. 2.7.1 Representation of primitive types. 2.7.2 Representation of Cartesian products. 2.7.3 Representation of arrays. 2.7.4 Representation of disjoint unions. 2.7.5 Representation of recursive types. Summary. Further reading. Exercises. 3. Variables and Storage. 3.1 Variables and storage. 3.2 Simple variables. 3.3 Composite variables. 3.3.1 Total vs selective update. 3.3.2 Static vs dynamic vs flexible arrays. 3.4 Copy semantics vs reference semantics. 3.5 Lifetime. 3.5.1 Global and local variables. 3.5.2 Heap variables. 3.5.3 Persistent variables. 3.6 Pointers. 3.6.1 Pointers and recursive types. 3.6.2 Dangling pointers. 3.7 Commands. 3.7.1 Skips. 3.7.2 Assignments. 3.7.3 Procedure calls. 3.7.4 Sequential commands. 3.7.5 Collateral commands. 3.7.6 Conditional commands. 3.7.7 Iterative commands. 3.8 Expressions with side effects. 3.8.1 Command expressions. 3.8.2 Expression-oriented languages. 3.9 Implementation notes 3.9.1 Storage for global and local variables. 3.9.2 Storage for heap variables. Summary. Further reading. Exercises. 4. Bindings and Scope. 4.1 Bindings and environments. 4.2 Scope. 4.2.1 Block structure. 4.2.2 Scope and visibility. 4.2.3 Static vs dynamic scoping. 4.3 Declarations. 4.3.1 Type declarations. 4.3.2 Constant declarations. 4.3.3 Variable declarations. 4.3.4 Procedure definitions. 4.3.5 Collateral declarations. 4.3.6 Sequential declarations. 4.3.6 Recursive declarations. 4.3.8 Scopes of declarations. 4.4 Blocks. 4.4.1 Block commands. 4.4.2 Block expressions. 4.4.3 The Qualification Principle. Summary. Further reading. Exercises. 5. Procedural Abstraction. 5.1 Function procedures and proper procedures. 5.1.1 Function procedures. 5.1.2 Proper procedures 5.1.3 The Abstraction Principle. 5.2 Parameters and arguments. 5.2.1 Copy parameter mechanisms. 5.2.2 Reference parameter mechanisms. 5.2.3 The Correspondence Principle. 5.3 Implementation notes 5.3.1 Implementation of procedure calls. 5.3.1 Implementation of parameter passing. Summary. Further reading. Exercises. PART III: ADVANCED CONCEPTS. 6. Data Abstraction. 6.1 Program units, packages, and encapsulation. 6.1.1 Packages. 6.1.2 Encapsulation. 6.2 Abstract types. 6.3 Objects and classes. 6.3.1 Classes. 6.3.2 Subclasses and inheritance. 6.3.3 Abstract classes. 6.3.4. Single vs multiple inheritance. 6.3.5 Interfaces. 6.4 Implementation notes. 6.4.1 Representation of objects 6.4.2 Implementation of method calls. Summary. Further reading Exercises. 7. Generic Abstraction. 7.1 Generic units and instantiation. 7.1.1 Generic packages in ADA. 7.1.2 Generic classes in C++. 7.2 Type and class parameters. 7.2.1 Type parameters in ADA. 7.2.2 Type parameters in C++. 7.2.3 Class parameters in JAVA. 7.3 Implementation notes 7.3.1 Implementation of ADA generic units. 7.3.2 Implementation of C++ generic units. 7.3.3 Implementation of JAVA generic units. Summary. Further reading. Exercises 8. Type Systems. 8.1 Inclusion polymorphism. 8.1.1 Types and subtypes. 8.1.2 Classes and subclasses. 8.2 Parametric polymorphism. 8.2.1 Polymorphic procedures. 8.2.2 Parameterized types. 8.2.3 Type inference. 8.3 Overloading. 8.4 Type conversions. 8.5 Implementation notes 8.5.1 Implementation of polymorphic procedures. Summary. Further reading. Exercises. 9. Control Flow. 9.1 Sequencers. 9.2 Jumps. 9.3 Escapes. 9.4 Exceptions. 9.5 Implementation notes 9.5.1 Implementation of jumps and escapes. 9.5.2 Implementation of exceptions. Summary. Further reading. Exercises. 10. Concurrency (by William Findlay). 10.1 Why concurrency?. 10.2 Programs and processes. 10.3 Problems with concurrency. 10.3.1 Nondeterminism. 10.3.2 Speed dependence. 10.3.3 Deadlock. 10.3.4 Starvation. 10.4 Process interactions. 10.4.1 Independent processes. 10.4.2 Competing processes. 10.4.3 Communicating processes. 10.5 Concurrency primitives. 10.5.1 Process creation and control. 10.5.2 Interrupts. 10.5.3 Spin locks and wait-free algorithms. 10.5.4 Events. 10.5.5 Semaphores. 10.5.6 Messages. 10.5.7 Remote procedure calls. 10.6 Concurrent control abstractions. 10.6.1 Conditional critical regions. 10.6.2 Monitors. 10.6.3 Rendezvous. Summary. Further reading. Exercises. PART IV: PARADIGMS 11. Imperative Programming. 11.1 Key concepts. 11.2 Pragmatics. 11.2.1 A simple spellchecker. 11.3 Case study: C. 11.3.1 Values and types. 11.3.2 Variables, storage, and control. 11.3.3 Bindings and scope. 11.3.4 Procedural abstraction. 11.3.5 Independent compilation. 11.3.6 Preprocessor directives. 11.3.7 Function library. 11.3.8 A simple spellchecker. 11.4 Case study: ADA. 11.4.1 Values and types. 11.4.2 Variables, storage, and control. 11.4.3 Bindings and scope. 11.4.4 Procedural abstraction. 11.4.5 Data abstraction. 11.4.6 Generic abstraction. 11.4.7 Separate compilation. 11.4.8 Package library. 11.4.9 A simple spellchecker. Summary. Further reading. Exercises. 12. Object-Oriented Programming. 12.1 Key Concepts. 12.2 Pragmatics. 12.3 Case study: C++. 12.3.1 Values and types. 12.3.2 Variables, storage, and control. 12.3.3 Bindings and scope. 12.3.4 Procedural abstraction. 12.3.5 Data abstraction. 12.3.6 Generic abstraction. 12.3.7 Independent compilation and preprocessor directives 12.3.8 Class and template library. 12.3.9 A simple spellchecker. 12.4 Case study: JAVA. 12.4.1 Values and types. 12.4.2 Variables, storage, and control. 12.4.3 Bindings and scope. 12.4.4 Procedural abstraction. 12.4.5 Data abstraction. 12.4.6 Generic abstraction. 12.4.7 Separate compilation and dynamic linking. 12.4.8 Class library. 12.4.9 A simple spellchecker. 12.5 Case study: ADA95. 12.5.1 Types. 12.5.2 Data abstraction. Summary. Further reading. Exercises. 13. Concurrent Programming (by William Findlay). 13.1 Key concepts. 13.2 Pragmatics. 13.3 Case study: ADA95. 13.3.1 Process creation and termination. 13.3.2 Mutual exclusion. 13.3.3 Admission control. 13.3.4 Scheduling away deadlock. 13.4 Case study: JAVA. 13.4.1 Process creation and termination. 13.4.2 Mutual exclusion. 13.4.3 Admission control. Summary. Further reading. Exercises. 14. Functional Programming. 14.1 Key concepts. 14.1.1 Eager vs normal-order vs lazy evaluation. 14.2 Pragmatics. 14.3 Case study: HASKELL. 14.3.1 Values and types. 14.3.2 Bindings and scope. 14.3.3 Procedural abstraction. 14.3.4 Lazy evaluation. 14.3.5 Data abstraction. 14.3.6 Generic abstraction. 14.3.7 Modeling state. 14.3.8 A simple spellchecker. Summary. Further reading. Exercises. 15. Logic Programming. 15.1 Key concepts. 15.2 Pragmatics. 15.3 Case study: PROLOG. 15.3.1 Values, variables, and terms. 15.3.2 Assertions and clauses. 15.3.3 Relations. 15.3.4 The closed-world assumption. 15.3.5 Bindings and scope. 15.3.6 Control. 15.3.7 Input/output. 15.3.8 A simple spellchecker. Summary. Further reading. Exercises 16. Scripting. 16.1 Pragmatics. 16.1.1 Regular expressions. 16.2 Case study: PYTHON. 16.2.1 Values and types. 16.2.2 Variables, storage, and control 16.2.3 Bindings and scope. 16.2.4 Procedural abstraction. 16.2.5 Data abstraction. 16.2.6 Separate compilation 16.2.7 Module library. Summary. Further reading. Exercises. PART V: CONCLUSION. 17. Language Selection. 17.1 Criteria. 17.2 Evaluation. Summary. Exercises. 18. Language Design. 18.1 Selection of concepts. 18.2 Regularity. 18.3 Simplicity. 18.4 Efficiency. 18.5 Syntax. 18.6 Language life cycles. 18.7 The future. Summary. Further reading. Exercises. Bibliography. Glossary. Index.

Read more less

Book SynopsisClick here to read ACCU''s review of this book.This text is an indispensable collection of four tutorials covering concepts in modern engineering computations, and engineering programming in ANSI C, MATLAB Version 5 and Java 1.1.Table of ContentsCONCEPTS IN MODERN ENGINEERING COMPUTATIONS. Introduction to Engineering Computations. Principles of Engineering Software Development. C PROGRAMMING TUTORIAL. Getting Started. Basic Data Types and Variables. Operators and Expressions. Control of Flow. Functions I. Arrays and Pointers. Functions II. Dynamic Allocation of Memory. The C Preprocessor. Input and Output. MATLAB PROGRAMMING TUTORIAL. Introduction to MATLAB. MATLAB Graphics. Solution of Linear Matrix Equations. JAVA PROGRAMMING TUTORIAL. Introduction to Java. Object-Oriented Program Design. The Java Language. Java Graphics. Appendices. References. Index.

Read more less

Book SynopsisUsing the same format that has become so popular in Pascal, Karel the Robot has now become object-oriented. This book is intended to teach novice programmers the fundamentals of object-oriented programming. It accomplishes this goal with an analog equivalent of C++ that allows introductory computer science students to work through a programming project from start to finish.The book opens by explaining the elaborate Robot world that Karel lives in, a world filled with objects. The text continues this strong metaphor throughout. Through the metaphor, students learn the art of solving programming problems in an object-oriented paradigm.This text is suitable for any introductory or second course in computer science where C++ is used.Table of ContentsThe Robot World. Primitive Instructions and Simple Programs. Extending the Robot Programming Language. Conditionally Executing Instructions. Instructions That Repeat. Advanced Techniques for Robots. Appendices.

Read more less

Book SynopsisThis book examines the solution of some of the most common problems of numerical computation. By concentrating on one effective algorithm for each basic task, it develops the fundamental theory in a brief, elementary way. There are ample exercises, and codes are provided to reduce the time otherwise required for programming and debugging.Table of ContentsErrors and Floating Point Arithmetic. Systems of Linear Equations. Interpolation. Roots of Nonlinear Equations. Numerical Integration. Ordinary Differential Equations. Appendix. Answers to Selected Exercises. Index.

Read more less

Book SynopsisWith computer technologies increasingly taking over many laboratory tasks, laboratory professionals are often faced with the dilemma of having to build customized computer applications without prior training in programming.Table of ContentsVISUAL BASIC(r) AND THE INTEGRATED DEVELOPMENT ENVIRONMENT. Background. IDE Fundamentals. A Review of the Visual Basic(r) Language. The Structure of a Visual Basic(r) Application. Object-Oriented Programming in Visual Basic(r). DEVICE COMMUNICATIONS. Introducing the Virtual Instrument. Dynamic Data Exchange. Using Dynamic Data Exchange in Visual Basic(r). RS-232 Communications. RS-232 Communications in Visual Basic(r). TCP/IP Networking. TCP/IP Networking in Visual Basic(r). File Communications. DEVICE CONTROL AND DATA HANDLING. Multithreading. Multithreading in Visual Basic(r). Concepts of State. State Machines-Implementing State Diagrams in Visual Basic(r). Parsing-Understanding Message Content. A Visual Basic(r) Parser Class. Device Monitoring and Control. Device Controllers in VB. GRAPHICAL INTERFACES AND DATA PRESENTATION. Scientific Plotting with MSChart. Tabular Data Display and Editing. Visual Basic(r) Graphics Fundamentals. Active Graphic Displays. Interactive Graphic Displays. Appendices. Index.

Read more less

Book SynopsisPROGRAMMING WITH OBJECTS Your essential comparative approach to learning C++ and Java Programming with Objects: A Comparative Presentation of Object-Oriented Programming with C++ and Java, a comparative presentation of object-oriented programming with two of the most popular programming languages of today, teaches vital skills and techniques for the Internet age. Based on highly successful courses taught by the author, this book answers the need for a comprehensive educational program on the subject of object-oriented programming. In a clear and accessible format, the author compares and contrasts both languages, from basic language constructs to how both languages are used in application-level programming, such as graphics programming, network programming, and database programming. Since both C++ and Java were born out of the same language, C, learning these two languages together has several distinct advantages: Because they have much in common aTrade Review"...a wonderful volume...a very worthwhile read...essential..." (Choice, September 2003)Table of ContentsWhy OO Programming - Some Parallels with Things at Large. Baby Steps. The Notion of a Class and Some Other Key Ideas. Strings. Using the Container Classes. The Primitive Types and Their Input/Output. Declarations, Definitions, and Initializations. Object Reference and Memory Allocation. Functions and Methods. Handling Exceptions. Classes, The Rest of the Story. Overloading Operators in C++. Generics and Templates. Modeling Diagrams for OO Programs. Extending Classes. Multiple Inheritance in C++. OO for Graphical User Interfaces, A Tour of Three Toolkits. Multithreaded Object-Oriented Programming. Network Programming. Database Programming.

Read more less

Book SynopsisKoffman and Wolfgang introduce data structures in the context of C++ programming. They embed the design and implementation of data structures into the practice of sound software design principles that are introduced early and reinforced by 20 case studies. Data structures are introduced in the C++ STL format whenever possible. Each new data structure is introduced by describing its interface in the STL. Next, one or two simpler applications are discussed then the data structure is implemented following the interface previously introduced. Finally, additional advanced applications are covered in the case studies, and the cases use the STL. In the implementation of each data structure, the authors encourage students to perform a thorough analysis of the design approach and expected performance before actually undertaking detailed design and implementation. Students gain an understanding of why different data structures are needed, the applications they are suited for, and the advantTable of ContentsPreface iii Chapter P A C++ Primer 1 P.1 The C++ Environment 2 P.2 Preprocessor Directives and Macros 7 P.3 C++ Control Statements 12 P.4 Primitive Data Types and Class Types 16 P.5 Objects, Pointers, and References 23 P.6 Functions 29 P.7 Arrays and C Strings 33 P.8 The string Class 38 P.9 Input/Output Using Streams 44 Chapter Review, Exercises, and Programming Projects 59 Chapter 1 Introduction to Software Design 63 1.1 The Software Life Cycle 64 1.2 Using Abstraction to Manage Complexity 73 1.3 Defining C++ Classes 75 1.4 Abstract Data Types, Interfaces, and Pre- and Postconditions 98 1.5 Requirements Analysis, Use Cases, and Sequence Diagrams 102 1.6 Design of an Array-Based Phone Directory 108 1.7 Implementing and Testing the Array-Based Phone Directory 114 1.8 Completing the Phone Directory Application 121 Chapter Review, Exercises, and Programming Projects 125 Chapter 2 Program Correctness and Efficiency 129 2.1 Program Defects and “Bugs” 130 2.2 Exceptions 138 2.3 Testing Programs 148 2.4 Debugging a Program 160 2.5 Reasoning about Programs: Assertions and Loop Invariants 166 2.6 Efficiency of Algorithms 170 Chapter Review, Exercises, and Programming Projects 179 Chapter 3 Inheritance and Class Hierarchies 185 3.1 Introduction to Inheritance and Class Hierarchies 186 3.2 Member Function Overriding, Member Function Overloading, and Polymorphism 193 3.3 Abstract Classes, Assignment, and Casting in a Hierarchy 202 3.4 Multiple Inheritance 210 3.5 Namespaces and Visibility 213 3.6 A Shape Class Hierarchy 220 Chapter Review, Exercises, and Programming Projects 225 Chapter 4 Sequential Containers 231 4.1 Template Classes and the Vector 232 4.2 Applications of vector 238 4.3 Implementation of a vector Class 240 4.4 The Copy Constructor, Assignment Operator, and Destructor 247 4.5 Single-Linked Lists and Double-Linked Lists 252 4.6 The list Class and the Iterator 264 4.7 Implementation of a Double-Linked List Class 271 4.8 Application of the list Class 285 4.9 Standard Library Containers 292 4.10 Standard Library Algorithms and Function Objects 297 Chapter Review, Exercises, and Programming Projects 307 Chapter 5 Stacks 311 5.1 The Stack Abstract Data Type 312 5.2 Stack Applications 315 5.3 Implementing a Stack 325 5.4 Additional Stack Applications 332 Chapter Review, Exercises, and Programming Projects 351 Chapter 6 Queues and Deques 357 6.1 The Queue Abstract Data Type 358 6.2 Maintaining a Queue of Customers 362 6.3 Implementing the Queue ADT 365 6.4 The Deque 376 6.5 Simulating Waiting Lines Using Queues 380 Chapter Review, Exercises, and Programming Projects 398 Chapter 7 Recursion 403 7.1 Recursive Thinking 404 7.2 Recursive Definitions of Mathematical Formulas 412 7.3 Recursive Search 420 7.4 Problem Solving with Recursion 426 7.5 Backtracking 435 Chapter Review, Exercises, and Programming Projects 440 Chapter 8 Trees 445 8.1 Tree Terminology and Applications 447 8.2 Tree Traversals 454 8.3 Implementing a Binary_Tree Class 457 8.4 Binary Search Trees 466 8.5 Heaps and Priority Queues 484 8.6 Huffman Trees 496 Chapter Review, Exercises, and Programming Projects 505 Chapter 9 Sets and Maps 511 9.1 Associative Container Requirements 512 9.2 Maps and Multimaps 521 9.3 Hash Tables 530 9.4 Implementing the Hash Table 542 9.5 Implementation Considerations for the hash_map 555 9.6 Additional Applications of Maps 558 Chapter Review, Exercises, and Programming Projects 564 Chapter 10 Sorting 569 10.1 Using C++ Sorting Functions 570 10.2 Selection Sort 572 10.3 Bubble Sort 577 10.4 Insertion Sort 581 10.5 Comparison of Quadratic Sorts 586 10.6 Shell Sort: A Better Insertion Sort 588 10.7 Merge Sort 592 10.8 Heapsort 599 10.9 Quicksort 604 10.10 Testing the Sort Algorithms 614 10.11 The Dutch National Flag Problem (Optional Topic) 616 Chapter Review, Exercises, and Programming Projects 620 Chapter 11 Self-Balancing Search Trees 623 11.1 Tree Balance and Rotation 624 11.2 AVL Trees 628 11.3 Red-Black Trees 643 11.4 2-3 Trees 656 11.5 2-3-4 and B-Trees 663 Chapter Review, Exercises, and Programming Projects 681 Chapter 12 Graphs 691 12.1 Graph Terminology 692 12.2 The Graph ADT and Edge Class 697 12.3 Implementing the Graph ADT 701 12.4 Traversals of Graphs 715 12.5 Applications of Graph Traversals 727 12.6 Algorithms Using Weighted Graphs 734 Chapter Review, Exercises, and Programming Projects 743 Appendix A Advanced C++ Topics 755 A.1 Source Character Set, Trigraphs, Digraphs, and Alternate Keywords 755 A.2 The Allocator 756 A.3 Traits 757 A.4 Virtual Base Classes 759 A.5 Smart Pointers 764 Appendix B Overview of UML 769 B.1 The Class Diagram 770 B.2 Sequence Diagrams 776 Appendix C The CppUnit Test Framework 779 Glossary 783 Index 795

Read more less

Book SynopsisWeb Application Design and Implementation uses a hands-on approach of the major technologies and programming languages to teach readers web development. Providing an understanding of all major aspects of web programming in order to achieve the construction of a database-driven website, the book features state-of-the-art programming languages such as HTML, JavaScript, MySQL, PHP, Apache, Linux/Unix.Trade Review"It explains all concepts at a very elementary level, and allows the novice reader (with basic knowledge of programming) to learn fundamental concepts of Web programming and practical Web design. For an experienced reader, it will provide very good overview of Web programming practices form one particular perspective, that of using open-source software tools." (Computing Reviews, November 25, 2008)Table of ContentsPREFACE. About the Author. Before We Get Started. Who Should Read this book? About The Examples. How to read this book. Acknowledgments. Introduction: Web Application Recipe. Overview. Step 1 - Understanding the problem and finding the solution. Step 2 - Designing the database. Step 3 - Major functionalities. Step 4 - Back side. Step 5 - Improvements on functionality. Step 6 - Improvements on looks. Step 7 - Thorough testing, hacking attempts. Step 8 - Presentation. Step 9 - Publication. Step 10 - Celebration (and maintenance). Chapter 1. Fundamentals. The origins of the Internet. The World Wide Web. The Web Browsers. The Web Servers. TCP/IP BASICS. The Internet Layer. The Transport Layer. The Application Layer. The Toolbox. Browsers. FTP. E-Mail Clients. Programming Tools. Other Useful Tools. Chapter 2. The Different Approaches of Web Programming. Before We Get Started. The Basics - HTML. The Creator - SGML. Other SGML-based languages - XML / XSL. The good old Java. Something different - JavaScript. The Savior - PHP. The rival - ASP.NET. The Myth - CGI. Another Big Option - Perl. The Future? - C#. Client-side versus Server-side - Which side to pick? My Choices - PHP, MySQL, JavaScript. Chapter 3. Introduction To HTML. What do you need to get started? How does HTML work? Syntax basics. File Structure. Tags Parameters. Basic Text Formatting. External References. Links. Images. Organizing Data. Lists. Tables. Frames. Special Characters. Chapter 4. Work Environment. Introduction. Downloading the Software. Installing the Apache Server. Installation Steps. Checking the Installation. Possible Errors. Configuring Apache. Installing PHP5. Testing PHP. Installing MySQL. Adding a MySQL user. How do I know if MySQL is running? Installing phpMyAdmin. Installing a Bulletin Board: phpBB. Installation Steps. Basic Security things to consider! Conclusion. Chapter 5. PHP - A server Side Scripting Language. How does it work? Some “new” words on PHP. Syntax Generalities. Instructions. Operators. Mathematical Functions. Data Types. Constants. Variables. Chapter 6. PHP Arrays and Flow of Control. Arrays. Basic Arrays. Associative Arrays. Multidimensional Arrays. Arrays Functions. PHP Program Structure and Flow of control. Conditions. Loops. Functions. Chapter 7. Using files, folders and Strings in PHP. Using Files. Folder Manipulation. Basic String Manipulation. Changing a string. Finding and Comparing. Formatting Strings. Manipulating HTML files. PHP Information Functions. Closing Remarks. Writing a basic File Explorer. Requirements. HINTS. Case Study: An Indexer/Searcher STEP 1. Overview. The Indexer - Step 1. Chapter 8. PHP5 and Object-Oriented Programming. Overview. Classes and Objects. Classes in PHP. Constructors and Destructors. Visibility. The scope resolution operator. The Static Keyword. Class Constants. Class Abstraction. Object Interfaces. Copying and Cloning objects. Comparing Objects. Type Hinting. Exceptions. Final words. Chapter 9. Creating Some Interactivity. Overview. Forms. Writing a form in HTML. GET vs. POST. Retrieving the form info on a PHP script. Dynamically creating forms. Transferring data between PHP scripts. Cookies. Sessions. One last useful function and design techniques. Assignments. File explorer step 2. Case study: Indexer/Searcher - Step 2. Chapter 10: Making Cleaner Code and Output. Cleaning up your code. What you need. How to use it? - HTML side. How to use it? - PHP side. Cleaning up your output. The CSS file. Useful tools. Assignment. Chapter 11. Using Databases. Overview. Database Basics. The entity-relationship model. More Practical Example. Typical sources of Errors. Simplifying the Diagrams. Using MySQL. MySQL Syntax. Data Types. MySQL numeric data types. Date and Time data types. String Data types. MySQL Operators. MySQL Instructions. Using Functions in MySQL. Chapter 12. Using PhpMyAdmin. Overview. Creating a Database. Creating tables. Accessing an existing table. Exporting/Importing a database structure and content. Assignment - Final Project. Chapter 13. Creating Database-Driven Websites with PHP/MySQL. Overview. Connecting to your MySQL server with PHP. Submitting SQL queries. Processing the results of a query. Example of login procedure. Other useful functions. Grouping our Methods in a class. Indexer/Searcher - Steps 3 and 4. Chapter 14: JavaScript - A client side scripting language. Introduction. JavaScript syntax. Types of Data and Variables. Operations and calculations. Arrays. Decisions. Loops. Using Functions. Using Objects. The String Objects. The Math class. The Array objects. Chapter 15. Programming the Browser. Overview. The Window Object. The Location Object. The History Object. The Navigator Object. The Screen Object. The Document Object. Using Events. Timers. Time to practice! Chapter 16. Windows and Frames. Frames and JavaScript. Windows and JavaScript. Assignments. One Last Funny Example. Chapter 17: String Manipulations Revisited. Overview. New Basic String methods. Regular Expressions in JavaScript. Regular Expressions in PHP. The set of PCRE. Chapter 18. JavaScript and DHTML. Overview. Positioning Elements. Writing dynamic menus in DHTML. You turn!! . Chapter 19. Putting it All Together! Overview. Step 1 - Understanding the problem and finding the solution. Step 2 - Designing the database. Step 3 - Main functionalities. Step 4 - Back side. Step 5 - Improvements on functionality. Step 6 - Improvements on looks. Step 7 - Thorough testing, hacking attempts. Step 8 - Presentation. Step 9 - Publication. Step 10 - Celebration :) (and maintenance). What language to use? Appendix A: Special Characters. Appendix B: Installing on UNIX. Overview. Installing Apache and PHP. Installing MySQL. Appendix C: Advanced phpBB. Appendix D: class.FastTemplate.PHP. Appendix E - File Upload Script. Bibliography. Index.

Read more less

Book SynopsisProviding an easy introduction to the boundary element method, this book is ideal for any reader wishing to work in this field or use this method for the solution of engineering problems. From the beginning, the emphasis is on the implementation of the method into computer programs which can be used to solve real problems. The book covers two-andthree-dimensional linear and non-linear analysis in potential flow (heat flow and seepage) and static elasticity. Several computer programs are listed in the book and may be downloaded free of charge via the Internet. They include programs and subroutines for: * 2-D analysis of potential problems using the Trefftz method * 2-D and 3-D linear analysis of potential and static elasticity problems using isoparametric elements (single and multiple regions) * implementation of non-linear problems * coupling to finite elements The programs (written in FORTRAN 90) are well documented, and can be employed by the user to gaiTable of ContentsPreface. Acknowledgements. Preliminaries. Programming. Discretisation and Interpolation. Material Modelling and Fundamental Solutions. Boundary Integral Equations. Boundary Element Methods - Numerical Implementation. Assembly and Solution. Postprocessing. Test Examples. Multiple Regions. Edges and Corners. Body Forces. Non-Linear Problems. Coupled Boundary Element/Finite Element Analysis. Industrial Applications. Appendix A: Program Libraries. Appendix B: Answers to Exercises. Index.

Read more less

Book SynopsisThis text explains how to apply Object-Oriented Programming techniques to multimedia products made with Director, this edition incorporates the many significant changes made to the program since the first edition was published.Trade Review"...Plenty of good advice is dispensed on techniques for using objects and lists to best effect. At this price the book is value for money...", , , Computer Bulletin, November 1999 #Table of ContentsMaking an Independent Object. Adding Sophisticated Features to Objects. Getting Object-Oriented. Messages, Control and Feedback. The Ancestor Portal. The Basis of Complex Objects. The Mechanics of Linear Lists. The Mechanics of Property Lists. Using Lists. Messages and Message Paths. Using Lists in Message Paths. The Object-User Interface. Object-Controlled Menus. Magical Tricks with Lists and Objects. Making a Paint Box with a Memory. Intelligent Button and Palette Objects. The Magic of MIAW Objects. Using MIAW Objects. Behaviors. Intranets, Kiosks and Avatars. Epilog. Index.

Read more less

Book SynopsisOffers you the details on how to use and customize version 5.0 of the DocBook XML schema. This book is suitable for technical writers, developers looking to customize the schema, tools developers, and managers evaluating DocBook.

Read more less

Book SynopsisTrade Review"This book is a clear introduction to experimentation with complex systems that will appeal to multiple audiences. . . . It will serve as an example of pedagogical clarity and skill for anyone responsible for teaching the physical sciences."---H. Van Dyke Parunak, Computing Reviews"There is a certain enthusiasm distilled by the author all through the book, transporting the reader on a journey of discovery of a chosen set of complex systems, from where diverse insights into complexity science can be grasped. . . . Natural Complexity constitutes an excellent introduction to some perspectives about complexity science that might be appealing to a broad range of readers."---Miguel A. F. Sanjuán, Contemporary PhysicsTable of ContentsPreface xiii 1. Introduction: What Is Complexity? 1 1.1 Complexity Is Not Simple 1 1.2 Randomness Is Not Complexity 4 1.3 Chaos Is Not Complexity 10 1.4 Open Dissipative Systems 13 1.5 Natural Complexity 16 1.6 About the Computer Programs Listed in This Book 18 1.7 Suggested Further Reading 20 2 Iterated Growth 23 2.1 Cellular Automata in One Spatial Dimension 23 2.2 Cellular Automata in Two Spatial Dimensions 31 2.3 A Zoo of 2-D Structures from Simple Rules 38 2.4 Agents, Ants, and Highways 41 2.5 Emergent Structures and Behaviors 46 2.6 Exercises and Further Computational Explorations 47 2.7 Further Reading 50 3 Aggregation 53 3.1 Diffusion-Limited Aggregation 53 3.2 Numerical Implementation 54 3.3 A Representative Simulation 58 3.4 A Zoo of Aggregates 60 3.5 Fractal Geometry 63 3.6 Self-Similarity and Scale Invariance 73 3.7 Exercises and Further Computational Explorations 76 3.8 Further Reading 78 4 Percolation 80 4.1 Percolation in One Dimension 80 4.2 Percolation in Two Dimensions 83 4.3 Cluster Sizes 85 4.4 Fractal Clusters 98 4.5 Is It Really a Power Law? 98 4.6 Criticality 100 4.7 Exercises and Further Computational Explorations 102 4.8 Further Reading 104 5 Sandpiles 106 5.1 Model Definition 106 5.2 Numerical Implementation 110 5.3 A Representative Simulation 112 5.4 Measuring Avalanches 119 5.5 Self-Organized Criticality 123 5.6 Exercises and Further Computational Explorations 127 5.7 Further Reading 129 6 Forest Fires 130 6.1 Model Definition 130 6.2 Numerical Implementation 131 6.3 A Representative Simulation 134 6.4 Model Behavior 137 6.5 Back to Criticality 147 6.6 The Pros and Cons of Wildfire Management 148 6.7 Exercises and Further Computational Explorations 149 6.8 Further Reading 152 7 Traffic Jams 154 7.1 Model Definition 154 7.2 Numerical Implementation 157 7.3 A Representative Simulation 157 7.4 Model Behavior 161 7.5 Traffic Jams as Avalanches 164 7.6 Car Traffic as a SOC System? 168 7.7 Exercises and Further Computational Explorations 170 7.8 Further Reading 172 8 Earthquakes 174 8.1 The Burridge-Knopoff Model 175 8.2 Numerical Implementation 182 8.3 A Representative Simulation 184 8.4 Model Behavior 189 8.5 Predicting Real Earthquakes 193 8.6 Exercises and Further Computational Explorations 194 8.7 Further Reading 196 9 Epidemics 198 9.1 Model Definition 198 9.2 Numerical Implementation 199 9.3 A Representative Simulation 202 9.4 Model Behavior 205 9.5 Epidemic Self-Organization 213 9.6 Small-World Networks 215 9.7 Exercises and Further Computational Explorations 220 9.8 Further Reading 222 10 Flocking 224 10.1 Model Definition 225 10.2 Numerical Implementation 228 10.3 A Behavioral Zoo 235 10.4 Segregation of Active and Passive Flockers 240 10.5 Why You Should Never Panic 242 10.6 Exercises and Further Computational Explorations 245 10.7 Further Reading 247 11 Pattern Formation 249 11.1 Excitable Systems 249 11.2 The Hodgepodge Machine 253 11.3 Numerical Implementation 260 11.4 Waves, Spirals, Spaghettis, and Cells 262 11.5 Spiraling Out 266 11.6 Spontaneous Pattern Formation 270 11.7 Exercises and Further Computational Explorations 272 11.8 Further Reading 273 12 Epilogue 275 12.1 A Hike on Slickrock 275 12.2 Johannes Kepler and the Unity of Nature 279 12.3 From Lichens to Solar Flares 285 12.4 Emergence and Natural Order 288 12.5 Into the Abyss: Your Turn 290 12.6 Further Reading 291 A. Basic Elements of the Python Programming Language 293 A.1 Code Structure 294 A.2 Variables and Arrays 297 A.3 Operators 299 A.4 Loop Constructs 300 A.5 Conditional Constructs 304 A.6 Input/Output and Graphics 305 A.7 Further Reading 306 B. Probability Density Functions 308 B.1 A Simple Example 308 B.2 Continuous PDFs 312 B.3 Some Mathematical Properties of Power-Law PDFs 313 B.4 Cumulative PDFs 314 B.5 PDFs with Logarithmic Bin Sizes 315 B.6 Better Fits to Power-Law PDFs 318 B.7 Further Reading 320 C Random Numbers and Walks 321 C.1 Random and Pseudo-Random Numbers 321 C.2 Uniform Random Deviates 323 C.3 Using Random Numbers for Probability Tests 324 C.4 Nonuniform Random Deviates 325 C.5 The Classical Random Walk 328 C.6 Random Walk and Diffusion 335 D Lattice Computation 338 D.1 Nearest-Neighbor Templates 339 D.2 Periodic Boundary Conditions 342 D.3 Random Walks on Lattices 345 Index 351

Read more less

Book SynopsisGet the scoope on how to use VBA to create more powerful Access databases and applications.Table of ContentsIntroduction 1 Part I: Introducing VBA Programming 7 Chapter 1: Where VBA Fits In 9 Chapter 2: Your VBA Toolkit 21 Chapter 3: Jumpstart: Creating a Simple VBA Program 35 Part II: VBA Tools and Techniques 49 Chapter 4: Understanding Your VBA Building Blocks 51 Chapter 5: Controlling Access through VBA 71 Chapter 6: Programming Access Forms 87 Part III: VBA, Recordsets, and SQL 115 Chapter 7: The Scoop on SQL and Recordsets 117 Chapter 8: Putting Recordsets to Work 147 Part IV: Applying VBA in the Real World 173 Chapter 9: Creating Your Own Dialog Boxes 175 Chapter 10: Customizing Lists and Drop-Down Menus 201 Chapter 11: Creating Your Own Functions 241 Chapter 12: Testing and Debugging Your Code 267 Part V: Reaching Out with VBA 295 Chapter 13: Using VBA with Multiple Databases 297 Chapter 14: Integrating with Other Office Applications 317 Part VI: The Part of Tens 349 Chapter 15: Ten Commandments of Writing VBA 351 Chapter 16: Top Ten Nerdy VBA Tricks 357 Chapter 17: (Way More Than) Ten Shortcut Keys 367 Index 371

Read more less

Book Synopsis

Read more less

Book SynopsisThis practical guide provides system administrators, DevSecOps engineers, and cloud architects with a concise yet comprehensive overview on how to use PL/SQL to develop resilient database solutions.

Read more less

Book SynopsisLearn C++ with the best tutorial on the market! Horton''s unique tutorial approach and step-by-step guidance have helped over 100,000 novice programmers learn C++. In Ivor Horton''s Beginning Visual C++ 2013, Horton not only guides you through the fundamentals of the standard C++ language, but also teaches you how C++ is used in the latest Visual Studio 2013 environment. Visual Studio 2013 includes major changes to the IDE and expanded options for C++ coding. Ivor Horton''s Beginning Visual C++ 2013 will teach you the latest techniques to take your Visual C++ coding to an all-new level. C++ language and library changes supported under Visual Studio 2013 IDE-specific changes for code formatting and debugging Changes to the C++ Standard Language for both C++ 11 and the new C++ 14 And more Horton introduces you to both Standard C++ and Visual C++ so you can build any component your app requires. Ivor Horton'Table of ContentsIntroduction xxxiii Chapter 1: Programming with Visual C++ 1 Learning with Visual C++ 1 Writing C++ Applications 2 Learning Desktop Applications Programming 3 The Integrated Development Environment 6 Using the IDE 8 Summary 23 Chapter 2: Data, Variables, and Calculations 25 The Structure of a C++ Program 26 Defining Variables 38 Fundamental Data Types 40 Basic Input/Output Operations 47 Calculating in C++ 52 Type Conversion and Casting 63 The auto Keyword 65 Discovering Types 66 The Bitwise Operators 67 Introducing Lvalues and Rvalues 72 Understanding Storage Duration and Scope 72 Variables with Specific Sets of Values 79 Namespaces 83 Summary 86 Chapter 3: Decisions and Loops 91 Repeating a Block of Statements 109 Summary 127 Chapter 4: Arrays, Strings, and Pointers 129 Handling Multiple Data Values of the Same Type 129 Working with C-Style Strings 140 Indirect Data Access 146 Dynamic Memory Allocation 163 Using References 168 Library Functions for Strings 171 Summary 176 Chapter 5: Introducing Structure into Your Programs 179 Understanding Functions 179 Passing Arguments to a Function 188 Returning Values from a Function 206 Returning a Pointer 206 Recursive Function Calls 214 Summary 217 Chapter 6: More about Program Structure 221 Pointers to Functions 221 Initializing Function Parameters 228 Exceptions 229 Handling Memory Allocation Errors 235 Function Overloading 237 Function Templates 241 Using the decltype Operator 244 An Example Using Functions 246 Summary 264 Chapter 7: Defining Your Own Data Types 267 The struct in C++ 267 Types, Objects, Classes, and Instances 276 Understanding Classes 279 Class Constructors 287 Private Members of a Class 297 The Pointer this 304 Const Objects 306 Arrays of Objects 309 Static Members of a Class 310 Pointers and References to Objects 314 Summary 318 Chapter 8: More on Classes 323 Class Destructors 324 Implementing a Copy Constructor 329 Operator Overloading 331 The Object Copying Problem 351 Default Class Members 361 Class Templates 362 Perfect Forwarding 373 Default Arguments for Template Parameters 376 Aliases for Class Templates 381 Template Specialization 382 Using Classes 385 Organizing Your Program Code 403 Library Classes for Strings 405 Summary 427 Chapter 9: Class Inheritance and Virtual Functions 431 Object-Oriented Programming Basics 432 Inheritance in Classes 433 Access Control Under Inheritance 437 The Copy Constructor in a Derived Class 447 Preventing Class Derivation 450 Class Members as Friends 451 Virtual Functions 453 Casting Between Class Types 470 Summary 475 Chapter 10: The Standard Template Library 479 What Is the Standard Template Library? 479 Smart Pointers 485 Algorithms 488 Function Objects in the STL 489 Function Adapters 490 The Range of STL Containers 490 Sequence Containers 490 Associative Containers 543 More on Iterators 556 More on Function Objects 562 More on Algorithms 564 Type Traits and Static Assertions 566 Lambda Expressions 567 Summary 577 Chapter 11: Windows Programming Concepts 579 Windows Programming Basics 580 The Structure of a Windows Program 586 The Microsoft Foundation Classes 605 Summary 610 Chapter 12: Windows Programming with the Microsoft Foundation Classes (MF C) 613 The MFC Document/View Concept 614 Creating MFC Applications 618 Summary 635 Chapter 13: Working with Menus and Toolbars 637 Communicating with Windows 637 Extending the Sketcher Program 642 Elements of a Menu 643 Adding Menu Message Handlers 646 Adding Toolbar Buttons 656 Summary 660 Chapter 14: Drawing in a Window 663 Basics of Drawing in a Window 663 The MFC Drawing Mechanism 667 Drawing Graphics in Practice 678 Programming for the Mouse 680 Drawing a Sketch 709 Summary 713 Chapter 15: Improving the View 717 Sketcher Limitations 717 Improving the View 718 Deleting and Moving Elements 726 Implementing a Context Menu 726 Identifying an Element Under the Cursor 730 Dealing with Masked Elements 743 Summary 745 Chapter 16: Working with Dialogs and Controls 747 Understanding Dialogs 748 Understanding Controls 748 Creating a Dialog Resource 749 Programming for a Dialog 751 Supporting the Dialog Controls 755 Completing Dialog Operations 758 Using a Spin Button Control 763 Using the Scale Factor 769 Working with Status Bars 775 The CString Class 779 Using an Edit Box Control 780 Summary 790 Chapter 17: Storing and Printing Documents 793 Understanding Serialization 793 Applying Serialization 801 Exercising Serialization 809 Printing a Document 811 Implementing Multipage Printing 815 Summary 825 Chapter 18: Programming for Windows 8 827 Windows Store Applications 828 Developing Windows Store Apps 829 Windows Runtime Concepts 829 C++ Component Extensions (C++/CX) 831 The Extensible Application Markup Language (XAML) 836 Creating a Windows Store App 844 Scaling UI Elements 873 Transitions 875 Summary 879 Index 881

Read more less

Book SynopsisA practical guide to data mining using SQL and Excel Data Analysis Using SQL and Excel, 2nd Edition shows you how to leverage the two most popular tools for data query and analysisSQL and Excelto perform sophisticated data analysis without the need for complex and expensive data mining tools. Written by a leading expert on business data mining, this book shows you how to extract useful business information from relational databases. You''ll learn the fundamental techniques before moving into the where and why of each analysis, and then learn how to design and perform these analyses using SQL and Excel. Examples include SQL and Excel code, and the appendix shows how non-standard constructs are implemented in other major databases, including Oracle and IBM DB2/UDB. The companion website includes datasets and Excel spreadsheets, and the book provides hints, warnings, and technical asides to help you every step of the way. Data Analysis Using SQL and Excel, 2nd Table of ContentsForeword xxxiii Introduction xxxvii Chapter 1 A Data Miner Looks at SQL 1 Databases, SQL, and Big Data 2 Picturing the Structure of the Data 6 Picturing Data Analysis Using Dataflows 16 SQL Queries 21 Subqueries and Common Table Expressions Are Our Friends 36 Lessons Learned 47 Chapter 2 What’s in a Table? Getting Started with Data Exploration 49 What Is Data Exploration? 50 Excel for Charting 51 Sparklines 65 What Values Are in the Columns? 68 More Values to Explore—Min, Max, and Mode 79 Exploring String Values 81 Exploring Values in Two Columns 86 From Summarizing One Column to Summarizing All Columns 90 Lessons Learned 96 Chapter 3 How Different Is Different? 97 Basic Statistical Concepts 98 How Different Are the Averages? 105 Sampling from a Table 110 Counting Possibilities 115 Ratios and Their Statistics 128 Chi-Square 132 What Months and Payment Types Have Unusual Affinities for Which Types of Products? 140 Lessons Learned 143 Chapter 4 Where Is It All Happening? Location, Location, Location 145 Latitude and Longitude 146 Census Demographics 160 Geographic Hierarchies 172 Mapping in Excel 188 Lessons Learned 194 Chapter 5 It’s a Matter of Time 197 Dates and Times in Databases 198 Starting to Investigate Dates 204 How Long Between Two Dates? 218 Year-over-Year Comparisons 229 Counting Active Customers by Day 239 Simple Chart Animation in Excel 247 Lessons Learned 254 Chapter 6 How Long Will Customers Last? Survival Analysis to Understand Customers and Their Value 255 Background on Survival Analysis 256 The Hazard Calculation 260 Survival and Retention 269 Comparing Different Groups of Customers 280 Comparing Survival over Time 287 Important Measures Derived from Survival 293 Using Survival for Customer Value Calculations 298 Forecasting 308 Lessons Learned 314 Chapter 7 Factors Affecting Survival: The What and Why of Customer Tenure 315 Which Factors Are Important and When 316 Left Truncation 328 Time Windowing 336 Competing Risks 342 Before and After 353 Lessons Learned 366 Chapter 8 Customer Purchases and Other Repeated Events 367 Identifying Customers 368 RFM Analysis 393 Which Households Are Increasing Purchase Amounts Over Time? 404 Time to Next Event 416 Lessons Learned 420 Chapter 9 What’s in a Shopping Cart? Market Basket Analysis 421 Exploring the Products 422 Products and Customer Worth 437 Product Geographic Distribution 448 Which Customers Have Particular Products? 451 Lessons Learned 463 Chapter 10 Association Rules and Beyond 465 Item Sets 466 The Simplest Association Rules 480 One-Way Association Rules 483 Two-Way Associations 489 Extending Association Rules 499 Lessons Learned 506 Chapter 11 Data Mining Models in SQL 507 Introduction to Directed Data Mining 508 Look-Alike Models 515 Lookup Model for Most Popular Product 522 Lookup Model for Order Size 528 Lookup Model for Probability of Response 534 Naive Bayesian Models (Evidence Models) 546 Lessons Learned 559 Chapter 12 The Best-Fit Line: Linear Regression Models 561 The Best-Fit Line 562 Measuring Goodness of Fit Using R2 581 Direct Calculation of Best-Fit Line Coefficients 584 Weighted Linear Regression 592 More Than One Input Variable 600 Lessons Learned 607 Chapter 13 Building Customer Signatures for Further Analysis 609 What Is a Customer Signature? 610 Designing Customer Signatures 617 Operations to Build Customer Signatures 622 Extracting Features 639 Summarizing Customer Behaviors 644 Lessons Learned 653 Chapter 14 Performance Is the Issue: Using SQL Effectively 655 Query Engines and Performance 656 Considerations When Thinking About Performance 660 Performance: Its Meaning and Measurement 663 Performance Improvement 101 665 Using Indexes Effectively 668 When OR Is a Bad Thing 683 Pros and Cons: Different Ways of Expressing the Same Thing 686 Window Functions 694 Lessons Learned 701 Appendix Equivalent Constructs Among Databases 703 Index 731

Read more less

Book Synopsishighlights the patterns which frequently appear when writing programs, reinforcing the application of these patterns for problem-solving through practice exercises; introduces the use of a debugger tool to inspect a program, enabling students to discover for themselves how programs work and enhance their understanding;Trade Review“The book emphasizes hands-on learning, which makes sense when learning programming. An undergraduate student that has a computer with a Python integrated development environment (IDE) and this book can learn a lot and do some interesting projects. The book is also suitable for high school students interested in programming assignments and projects. A highly readable and compact book, students and beginning programmers will like it.” (Naga Narayanaswamy, Computing Reviews, September, 2015)“The introduction is well written and enables you to configure the WingIDE within minutes and start using the book. At the end of each chapter, there are programming tasks, most of which are resolved quite well a few pages after. This is a big plus. … if you have passion for easy-to-install scripting languages and you are interested in Python – the book is quite OK for a start!” (Vitosh, Vitosh Academy, vitoshacademy.com, February, 2015)Table of ContentsIntroduction.- Decision Making.- Repetitive Tasks.- Using Objects.- Defining Functions.- Event-Driven Programming.- Defining Classes.- Appendix A: Integer Operators.- Appendix B: Float Operators.- Appendix C: String Operators and Methods.- Appendix D: List Operators and Methods.- Appendix E: Dictionary Operators and Methods.- Appendix F: Turtle Methods.- Appendix G: TurtleScreen Methods.- Appendix H: The Reminder! Program.- Appendix I: The Bouncing Ball Program.

Read more less

Book SynopsisEvery Mac user knows how to work with windows and icons, but there is a wonderful application behind the scenes - the Terminal - that provides tremendous additional power. With this handy guide, you'll learn valuable commands that remove limits and open doors that many Mac users don't know exist.

Read more less

Book SynopsisThis book introduces you to both the original BeagleBone and the BeagleBone Black and gets you started with projects that take advantage of the board's processing power and its ability to interface with the outside world.

Read more less

Book SynopsisBrings Semantic Web practice to enterprise. Fabien Gandon joins Dean Allemang and Jim Hendler, to open up the story to a modern view of global linked data. Examples have been brought up to date and applied in a modern setting, where enterprise and global data come together as a living, linked network of data.Table of Contents Preface What is the Semantic Web? Semantic modeling RDF—the basis of the Semantic Web Semantic Web application architecture Linked data Querying the Semantic Web—SPARQL Extending RDF: RDFS and SCHACL RDF Schema RDFS-Plus Using RDFS-Plus in the wild SKOS—managing vocabularies with RDFS-Plus Basic OWL Counting and sets in OWL Ontologies on the Web—putting it all together Good and bad modeling practices Expert modeling in OWL Conclusions and future work Bibliography

Read more less