SiteMap All

• Courses
  • Remixer University
    • Download Center
      • Book: CS11
    • Username: admin
      • Eloquent JavaScript.epub
        • Untitled Page 01
        • Untitled Page 02
      • original-23ca8931ec69a61d91342ac83d2b5830.epub
        • 0.10: Chapter 10: Force Method of Analysis of Indeterminate Structures
        • 0.11: Chapter 11: Slope-Deflection Method of Analysis of Indeterminate Structures
        • 0.12: Chapter 12: Moment Distribution Method of Analysis of Structures
        • 0.13: Chapter 13: Influence Lines for Statically Indeterminate Structures
        • 0.1: Chapter 1: Introduction to Structural Analysis
        • 0.2: Chapter 2: Structural Loads and Loading System
        • 0.3: Chapter 3: Equilibrium Structures, Support Reactions, Determinacy and Stability of Beams and Frames
        • 0.4: Chapter 4: Internal Forces in Beams and Frames
        • 0.5: Chapter 5: Internal Forces in Plane Trusses
        • 0.6: Chapter 6: Arches and Cables
        • 0.7: Chapter 7: Deflection of Beams: Geometric Methods
        • 0.8: Chapter 8: Deflections of Structures: Work-Energy Methods
        • 0.9: Chapter 9: Influence Lines for Statically Determinate Structures
        • Contents
        • Copyright
        • Cover
        • Dedication
        • Part One: Introduction to Structural Analysis and Structural Loads
        • Part Three: Analysis of Statically Indeterminate Strctures
        • Part Two: Analysis of Statically Determinate Structures
        • Title Page
        • Untitled Page 01
      • tempPat-1575431935.epub
        • 1: Part I: What is an information system?
          • 01.1: Chapter 1: What Is an Information System?
          • 01.2: Chapter 2: Hardware
        • 2: Part II: Information Systems for Strategic Advantage
        • 3: Part III: Information Systems Beyond the Organization
    • Username: jhalpern
  • ASCCC
  • Arapahoe Community College
  • Community College of Allegheny County
  • De Anza College
  • Diablo Valley College
    • ENGTC168 - Intro To Computer Numerical Control (CNC)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Overview Of CNC Machining
        • 1.1: Types of CNC Machines
        • 1.2: The role of CNC machining in production and prototyping
        • 1.3: CNC tools and characteristics
        • 1.4: Introduction to CNC machine components
        • 1.5: Lab - Safety and protocol
      • 2: Introduction To G-code Programming
        • 2.1: Basic programming terms
        • 2.2: Programming formats
        • 2.3: Format notation
        • 2.4: Symbols in CNC programming
        • 2.5: Typical program structure
        • 2.6: Lab - Program planning
        • 2.7: Lab - Axes Designation
        • 2.8: Lab - Feeds and speed settings
        • 2.9: Lab - Cutter compensation
      • 3: CNC Control Systems
        • 3.1: Operation panel
        • 3.2: Parameter settings
        • 3.3: System defaults
        • 3.4: Manual data input
        • 3.5: Lab - Overview of simulator interface
        • 3.6: Lab - Simulator operation
        • 3.7: Lab - Air passes and code verification before milling
      • 4: CNC Milling Machine Setup For Part Production
        • 4.1: Safety and general setup and operation
        • 4.2: Vices and fixtures
        • 4.3: Lab - Vices and fixtures
        • 4.4: Lab - Stock and materials
        • 4.5: Coolant
        • 4.6: Lab - Coolant and coolant maintenance
      • 5: Introduction To Cutting Tool Characteristics
        • 5.1: Types of cutting tools
        • 5.2: Lab - Cutting tools, collets, tapers, and the CNC tool changer
        • 5.3: Cutting tool sizes and applications
        • 5.4: Cutting tool behavior and parameters
        • 5.5: Lab - Speeds, feeds, and depths
      • 6: Post-Processing Part Files For Machining
        • 6.1: Proofing a parts file for manufacturing
        • 6.2: Editing in G-Code
        • 6.3: Running a program on a CNC simulator
        • 6.4: Test runs, air-passes, and simulations
        • 6.5: Lab - Cutting and final part production
      • 7: 3D Modeling Of Parts And Components (CAD)
        • 7.1: Tools, menus and commands
        • 7.2: Views and projections
        • 7.3: Solid geometry, extrusions, surfaces, lofts, and sweeps
        • 7.4: Working planes and reference planes
        • 7.5: Lab - 3D Modeling CAD Exercise
      • 8: Introduction to Computer Aided Machining (CAM) Software
        • 8.1: Graphic user interface and operating environment
        • 8.2: Tools menu
        • 8.3: Lab - Tool libraries and tool length offsets
        • 8.4: Lab - Types of tool paths
        • 8.5: Cartesian coordinate systems
        • 8.6: Graphic standards and representation methods
        • 8.7: Creating part geometry
        • 8.8: Creating points, lines, and arcs using CAM software
        • 8.9: Lab - Creating tool paths in 2D
        • 8.10: Lab - Creating tool paths in 3D
        • 8.11: Assembly design workflow
        • 8.12: Lab - Additional instructions and operations
        • 8.13: Lab - Previewing a tool path
      • Back Matter
  • Delta College
    • CS11 - Informations Systems
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: What is an Information System?
        • 1.1: Introduction to Information Systems?
          • 1.1A: Components of an Information System
          • 1.1B: The Role of Information Systems
          • 1.1C: Competitive Advantage
          • 1.1S: Section #1 Summary
        • 1.2: Hardware
          • 1.2A Hardware Components
          • 1.2B More Computing Devices
          • 1.2C Computers are part of life
          • 1.2S: Section #2 Summary
        • 1.3: Software
          • 1.3E: Software Creation & open Source Software
          • 1.3A Operating Systems
          • 1.3B: Application Software
          • 1.3C Mobile Apps
          • 1.3D: Cloud Computing
          • 1.3S: Section #3 Summary
        • 1.4: Data and Databases
          • 1.4A Relational Database
            • 1.4B: Designing a Database
            • 1.4C: Normalization of a Database
            • 1.4D: Data Types
            • 1.4E: Structured Query Language (SQL)
          • 1.4F: Database Management Systems
          • 1.4G: Big Data
          • 1.4H: Data Warehousing
          • 1.4I: Data Mining and stuff
          • 1.4S: Unit 4 Summary
        • 1.5: Networking and Communication
          • 1.5A: History Lesson
          • 1.5B: Internet and the Web
          • 1.5C: Broadband
          • 1.5D: Wireless
          • 1.5E: LAN / WAN and Client Server
          • 1.5F: Intranet, Extranet, and Cloud
          • 1.5S: Section #5 Summary
        • 1.6: Information Systems Security
          • 1.6A: CIA
          • 1.6B: Tools to Use
            • 1.6C: Authentication
            • 1.6D: Access Control
            • 1.6E: Encryption
            • 1.6F: Backups
          • 1.6G: Firewalls
          • 1.6H: IDS
          • 1.6I: Physical Security
          • 1.6J: Security Policies
            • 1.6K: Mobile Secuirty
          • 1.6L: Personal info Sec
          • 1.6.S: Section #6 Summary
      • 2: Information Systems for Strategic Advantage
        • 2.1: Does IT Matter?
          • 2.1A: The Paradox
          • 2.1B: No - IT does NOT Matter
          • 2.1C: What is Competitive Advantage
          • 2.1D: The Value Chain
          • 2.1E: Porter's Five Forces
          • 2.1F: Using Information Systems for Competitive Advantage
            • 2.1.6.3: Collaborative Systems
            • 2.1.6.4: Decision Support Systems
            • 2.1G: Business Process Management Systems
            • 2.1G: EDI
          • 2.1H: Investing in IT
          • 2.1S: Section #1 Summary
        • 2.2: Business Processes
          • 2.2A: Business Process
          • 2.2B: Documenting a Process
          • 2.2C: Managing Documentation
          • 2.2D: ERP Systems
          • 2.2E: Process Management
          • 2.2F: Process Re-engineering
          • 2.2G: Sample of Re-engineering
          • 2.2H: ISO 9001
          • 2.2S: Section #2 Summary
        • 2.3: The People in Information Systems
          • 2.3A: Creators
            • 2.3B: System Analyst
            • 2.3C: System Programmer
            • 2.3D: Computer Engineer
          • 2.3E: Operations and Administration
            • 2.3F: Computer Operator
            • 2.3G: Database Administrator
            • 2.3H: Support Desk
            • 2.3I: Trainer
          • 2.3J: Managers
            • 2.3K: CIO
            • 2.3L: Functional Manager
            • 2.3M: ERP Manager
            • 2.3N: Project Managers
            • 2.3O: Info-Sec Officer
            • 2.3P: Emerging Roles
          • 2.3Q: Careers
          • 2.3R: Organization
            • 2.3S: Where are we?
            • 2.3T: New Thoughts
            • 2.3U: Outsourcing
          • 2.3V: Users
          • 2.3W: Section #3 Summary
        • 2.4: Information Systems Development
          • 2.4A: SDLC
          • 2.4B: Rapid App Dev
          • 2.4C: Agile and Lean Methods
          • 2.4D: Programming Languages
            • 2.4E: Language Generations
            • 2.4F: Compiled vs Interpreted
            • 2.4G: Procedural / Object Oriented
          • 2.4H: IDE / CASE
          • 2.4I: Home Grown or Purchased
          • 2.4J: Web Service
          • 2.4K: End User Dev
          • 2.4L: Project Implementation
          • 2.4S: Section #4 Summary
      • 3: Information Systems Beyond the Organization
        • 3.1: Globalization and the Digital Divide
          • 3.1A: Globalization?
            • 3.1B: The World...
          • 3.1C: Going Global
          • 3.1D: Digital Divide
          • 3.1E: OLPC
          • 3.1F: Changing the Divide
          • 3.1S: Section 1 Summary
        • 3.2: The Ethical and Legal Implications of Information Systems
          • 3.2A: Ethics
            • 3.2B: Code of Ethics
          • 3.2C: Acceptable Use
          • 3.2D: Intellectual Property
            • 3.2E: Copyright
              • 3.2F: Copyright details
              • 3.2F: Digital Millennium Copyright
            • 3.2G: Patent
              • 3.2H: Obtain Protection
            • 3.2I: Trademark
          • 3.2J: Privacy
            • 3.2.4.2: Other Privacy Laws
            • 3.2K: Non-Obvious Relationship
          • 3.2S: Section 2 Summary
        • 3.3: Future Trends in Information Systems
          • 3.3A: Global
          • 3.3B: Social and Personal
          • 3.3C: Mobile
          • 3.3D: Wearable
          • 3.3E: Collaborative
          • 3.3F: Findable
          • 3.3G: New Ideas
          • 3.3S: Section 3 Summary
      • Back Matter
    • Introduction to Programming Concepts - Python
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Introduction
        • 1.1: Why should you learn to write programs?
        • 1.2: Creativity and Motivation
        • 1.3: Computer Hardware Architecture
        • 1.4: Understanding Programming
        • 1.5: Words and Sentences
        • 1.6: Conversing with Python
        • 1.7: Terminology - Interpreter and Compiler
        • 1.8: Writing a Program
        • 1.9: What is a program?
        • 1.10: The Building Blocks of Programs
        • 1.11: What could possibly go wrong?
        • 1.12: The Learning Journey
        • 1.13: Introduction (Exercises)
        • 1.14: Introduction (Glossary)
      • 2: Variables, Expressions, and Statements
        • 2.1: Values and Types
        • 2.2: Variables
        • 2.3: Variable names and Keywords
        • 2.4: Statements
        • 2.5: Operators and Operands
        • 2.6: Expressions
        • 2.7: Order of Operations
        • 2.8: Modulus Operator
        • 2.9: String Operations
        • 2.10: Asking the user for input
        • 2.11: Comments
        • 2.12: Choosing Mnemonic Variable Names
        • 2.13: Debugging
        • 2.14: Variables, Expressions, and Statements (Exercises)
        • 2.15: Glossary
      • 3: Conditional Execution
        • 3.1: Boolean Expressions
        • 3.2: Logical Operators
        • 3.3: Conditional Execution
        • 3.4: Alternative Execution
        • 3.5: Chained Conditionals
        • 3.6: Nested Conditionals
        • 3.7: Catching exceptions Using Try and Except
        • 3.8: Short-Circuit Evaluation of Logical Expressions
        • 3.9: Debugging
        • 3.10: Conditional Execution (Exercises)
        • 3.11: Conditional Execution (Glossary)
      • 4: Functions
        • 4.1: Function Calls
        • 4.2: Built-in Functions
        • 4.3: Type Conversion Functions
        • 4.4: Random Numbers
        • 4.5: Math Functions
        • 4.6: Adding New Functions
        • 4.7: Definitions and Uses
        • 4.8: Flow of Execution
        • 4.9: Parameters and Arguments
        • 4.10: Fruitful functions and void functions
        • 4.11: Why functions?
        • 4.12: Debugging
        • 4.13: Functions (Exercises)
        • 4.14: Functions (Glossary)
      • 5: Iterations
        • 5.1: Updating Variables
        • 5.2: The while Statement
        • 5.3: Infinite Loops
        • 5.4: "Infinite loops" and break
        • 5.5: Finishing iterations with continue
        • 5.6: Definite loops using for
        • 5.7: Loop patterns
        • 5.8: Counting and Summing Loops
        • 5.9: Maximum and Minimum Loops
        • 5.10: Debugging
        • 5.11: Iterations (Exercises)
        • 5.12: Iterations (Glossary)
      • 6: Strings
        • 6.1: A string is a sequence
        • 6.2: Getting the length of a string using len
        • 6.3: Traversal through a string with a loop
        • 6.4: String Slices
        • 6.5: Strings are immutable
        • 6.6: Looping and Counting
        • 6.7: The in operator
        • 6.8: String Comparison
        • 6.9: String Methods
        • 6.10: Parsing strings
        • 6.11: Format operator
        • 6.12: Debugging
        • 6.13: Strings (Exercises)
        • 6.14: Strings (Glossary)
      • 7: Files
        • 7.1: Persistence
        • 7.2: Opening Files
        • 7.3: Text files and Lines
        • 7.4: Reading Files
        • 7.5: Searching through a File
        • 7.6: Letting the user choose the file name
        • 7.7: Using try, except, and open
        • 7.8: Writing Files
        • 7.9: Debugging
        • 7.10: Files (Exercises)
        • 7.11: Files (Glossary)
      • 8: Lists
        • 8.1: A list is a sequence
        • 8.2: Lists are mutable
        • 8.3: Traversing a List
        • 8.4: List operations
        • 8.5: List Slices
        • 8.6: List Methods
        • 8.7: Deleting Elements
        • 8.8: Lists and Functions
        • 8.9: Lists and Strings
        • 8.10: Parsing lines
        • 8.11: Objects and Values
        • 8.12: Aliasing
        • 8.13: List arguments
        • 8.14: Debugging
        • 8.15: Lists (Exercises)
        • 8.16: Lists (Glossary)
      • 9: Dictionaries
        • 9.1: Dictionaries
        • 9.2: Dictionary as a Set of Counters
        • 9.3: Dictionaries and Files
        • 9.4: Looping and Dictionaries
        • 9.5: Advanced Text Parsing
        • 9.6: Debugging
        • 9.7: Dictionaries (Exercises)
        • 9.8: Dictionaries (Glossary)
      • 10: Tuples
        • 10.1: Tuples are Immutable
        • 10.2: Comparing Tuples
        • 10.3: Tuple Assignment
        • 10.4: Dictionaries and Tuples
        • 10.5: Multiple assignment with dictionaries
        • 10.6: The most common words
        • 10.7: Using Tuples as Keys in Dictionaries
        • 10.8: Sequences: strings, lists, and tuples - Oh My!
        • 10.9: Debugging
        • 10.10: Tuples (Exercises)
        • 10.11: Tuples (Glossary)
      • 11: Regular Expressions
        • 11.1: Regular Expressions
        • 11.2: Character matching in regular expressions
        • 11.3: Extracting data using regular expressions
        • 11.4: Combining searching and extracting
        • 11.5: Escape Character
        • 11.06: Bonus section for Unix
          • 11.6: Bonus section for Unix / Linux users
        • 11.7: Debugging
        • 11.8: Regular Expressions (Exercises)
        • 11.9: Regular Expressions (Glossary)
        • 11.10: Regular Expressions (Summary)
      • 12: Networked Programs
        • 12.1: HyperText Transfer Protocol - HTTP
        • 12.2: The World's Simplest Web Browser
        • 12.3: Retrieving an image over HTTP
        • 12.4: Retrieving web pages with urllib
        • 12.5: Parsing HTML and scraping the web
        • 12.6: Parsing HTML using regular expressions
        • 12.7: Parsing HTML using BeautifulSoup
        • 12.8: Reading binary files using urllib
        • 12.9: Networked Programs (Exercises)
        • 12.10: Networked Programs (Glossary)
      • 13: Python and Web Services
        • 13.1: eXtensible Markup Language - XML
        • 13.2: Looping through Nodes
        • 13.3: JavaScript Object Notation - JSON
        • 13.4: Parsing JSON
        • 13.5: Application Programming Interfaces
        • 13.6: Google geocoding web service
        • 13.7: Security and API usage
        • 13.8: Python and Web Services (Exercises)
        • 13.9: Python and Web Services (Glossary)
      • 14: Object-Oriented Programming
        • 14.1: Managing Larger Programs
        • 14.2: Getting Started
        • 14.3: Using Objects
        • 14.4: Starting with Programs
        • 14.5: Subdividing a Problem - Encapsulation
        • 14.6: Our First Python Object
        • 14.7: Classes as Types
        • 14.8: Many Instances
        • 14.9: Object Lifecycle
        • 14.10: Inheritance
        • 14.11: Object-Oriented Programming (Glossary)
        • 14.12: Object-Oriented Programming (Summary)
      • 15: Using Databases and SQL
        • 15.1: What is a database?
        • 15.2: Database Concepts
        • 15.3: Database Browser for SQLite
        • 15.4: Creating a database table
        • 15.5: Structured Query Language summary
        • 15.6: Spidering Twitter using a database
        • 15.7: Basic data modeling
        • 15.8: Programming with Multiple Tables
        • 15.9: Constraints in Database Tables
        • 15.10: Retrieve and
          • 15.10: Retrieve and/or insert a record
        • 15.11: Storing the friend relationship
        • 15.12: Three Kinds of Keys
        • 15.13: Using JOIN to retrieve data
        • 15.14: Degugging
        • 15.15: Using Databases and SQL (Glossary)
        • 15.16: Using Databases and SQL (Summary)
      • 16: Visualizing data
        • 16.1: Building a Google map from geocoded data
        • 16.2: Visualizing Networks and Interconnections
        • 16.3: Visualizing mail data
      • Back Matter
    • Book: Introduction to Linux (McClanahan)
      • Back Matter
      • Chapter 1: Introductory Stuff
        • 1.1 Let's Begin
          • 1.1A Debian/Ubuntu Family
          • 1.1B: Arch family
          • 1.1C: Red Hat/Fedora Family
          • 1.1D: Slackware Family
          • 1.1E: Gentoo Family
          • 1.1G: Source Code
        • 1.2: How We Are Going To Do This
      • Chapter 2: Ubuntu Installation
      • Front Matter
  • Folsom Lake College
  • Grossmont College
  • Sacramento City College
  • Riverside City College
  • University of Arkansas Little Rock
    • Introduction to Control Systems (Iqbal)
      • 1: Mathematical Models of Physical Systems
        • 1.1: Model Variables and Element Types
        • 1.2: First-Order ODE Models
        • 1.3: Solving First-Order ODE Models
        • 1.4: Second-Order ODE Models
        • 1.5: Solving Second-Order ODE models
        • 1.6: Obtaining Transfer Function Models
        • 1.7: DC Motor Model
        • 1.8: Industrial Process Models
        • 1.9: State Variable Models
        • 1.10: Linearization of Nonlinear Models
  • University of California Davis
  • University of California San Diego
    • UCSD CENG 176
      • Plate Heat Exchanger
  • Virginia Tech
• Bookshelves
  • Chemical Engineering
    • Supplemental Modules (Chemical Engineering)
      • Chlorosilane Chemistry
        • Elemental Silicon
        • Silicon-Carbon-Chlorine molecules
        • Silicon-Carbon-Oxygen molecules
        • Silicon-Chlorine Bonded Molecules
        • Silicon-Oxygen Bonded Molecules
    • Book: Phase Relations in Reservoir Engineering (Adewumi)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Introduction and Purpose
        • 1.1: Introduction
        • 1.2: Why Study Phase Behavior?
        • 1.3: Summary
        • 1.4: Action Item
      • 2: Phase Diagrams I
        • 2.1: Introduction
        • 2.2: Pure-component Systems
        • 2.3: Action Item
      • 3: Phase Diagrams II
        • 3.1: Vapor Pressure Curve
        • 3.2: PV Diagram for Pure Systems
        • 3.3: Action Item
      • 4: Phase Diagrams III
        • 4.1: Binary Systems
        • 4.2: Retrograde Phenomenon
        • 4.3: Action Item
      • 5: Phase Diagrams IV
        • 5.1: Effect of Composition on Phase Behavior
        • 5.2: Px and Tx Diagrams
        • 5.3: The Lever Rule
        • 5.4: Ternary Systems
        • 5.5: Multicomponent Mixtures
        • 5.6: Action Item
      • 6: PT Behavior and Equations of State (EOS) I
        • 6.1: Introduction
        • 6.2: P-V-T Behavior
        • 6.3: Ideal Behavior
        • 6.4: Real Gases
        • 6.5: Summary
        • 6.6: Action Item
      • 7: PT Behavior and Equations of State (EOS) II
        • 7.1: Z-Factor
        • 7.2: Definition of Equation of State (EOS)
        • 7.3: Purpose and Historical Development
        • 7.4: The van der Waals Equation
        • 7.5: Action Item
      • 8: PT Behavior and Equations of State III
        • 8.1: Principle of Corresponding States (PCS)
        • 8.2: Acentric Factor and Corresponding States
        • 8.3: Action Item
      • 9: Cubic EOS and Their Behavior I
        • 9.1: Introduction
        • 9.2: The Cubic Behavior
        • 9.3: Implications of S-shaped curve (Sub-critical Conditions)
        • 9.4: Action Item
      • 10: Cubic EOS and Their Behavior II
        • 10.1: Multiple Roots and Cubic Behavior
        • 10.2: Modern Cubic EOS
        • 10.3: Redlich-Kwong EOS (1949)
        • 10.4: Soave-Redlich-Kwong EOS (1972)
        • 10.5: Action Item
      • 11: Cubic EOS and Their Behavior III
        • 11.1: Peng-Robinson EOS (1976)
        • 11.2: Comparative Assessment of RK, SRK, and PR EOS
        • 11.3: Critical Compressibility as a Measure of Goodness of an EOS
        • 11.4: Advantages of Using Cubic Equations of State
        • 11.5: Solution Techniques for Cubic Expressions and Root Finding
        • 11.6: Action Item
      • 12: Elementary Vapor-Liquid Equilibrium I
        • 12.1: Introduction
        • 12.2: Types of VLE Problems
        • 12.3: Formulation of the VLE Problem
        • 12.4: Action Item
      • 13: Elementary Vapor-Liquid Equilibrium II
        • 13.1: Analysis of Objective Functions
        • 13.2: Objective Function and Newton-Raphson Procedure
        • 13.3: Do We Really Know Ki
        • 13.4: Action Item
      • 14: Thermodynamic Tools I
        • 14.1: Introduction
        • 14.2: Basic Definitions
        • 14.3: Thermodynamics of Systems of Constant Composition (Closed Systems)
        • 14.4: Functions of State or State Functions
        • 14.5: Mechanics of Manipulating a Function of State
        • 14.6: Computing Property Changes in Closed Systems
        • 14.7: Action Item
      • 15: Thermodynamic Tools II
        • 15.1: Homogeneous Functions, Euler's Theorem and Partial Molar Quantities
        • 15.2: Thermodynamics of Systems of Variable Composition (Open Multicomponent Systems)
        • 15.3: Action Item
      • 16: Thermodynamic Tools III
        • 16.1: The Chemical Potentials
        • 16.2: The Thermodynamic Concept of Equilibrium
        • 16.3: Fugacity
        • 16.4: Expressions for Fugacity Calculation
        • 16.5: Cubic EOS Fugacity Expressions
        • 16.6: Action Item
      • 17: Vapor-Liquid Equilibrium via EOS
        • 17.1: Introduction
        • 17.2: Equilibrium and Equilibrium Ratios (Ki)
        • 17.3: Solution Algorithms for VLE Problems
        • 17.4: Successive Substitution Method (SSM)
        • 17.5: The Accelerated Successive Substitution Method (ASSM)
        • 17.6: The Stability Criteria
        • 17.7: Action Item
      • 18: Properties of Natural Gas and Condensates I
        • 18.1: Molecular Weight
        • 18.2: Density
        • 18.3: Specific Gravity
        • 18.4: API Gravity
        • 18.5: Volumetric Factors (Bo and Bg)
        • 18.6: Isothermal Compressibilities
        • 18.7: Surface Tension
        • 18.8: Action Item
      • 19: Properties of Natural Gas and Condensates II
        • 19.1: Heat Capacities
        • 19.2: Joule-Thomson Coefficient
        • 19.3: Viscosity
        • 19.4: Action Item
      • 20: Engineering Applications I
        • 20.1: Introduction- Phase Behavior as the Quintessential Tool
        • 20.2: Design and Optimization of Separators
        • 20.3: Compositional Modeling of Gas-Condensate Reservoirs-The Zero-dimensional Approach
        • 20.4: Action Item
      • 21: Engineering Applications II
        • 21.1: Natural Gas Pipeline Modeling
        • 21.2: The Hydrate Problem
        • 21.3: Gas Metering
        • 21.4: Action Item
      • Back Matter
    • Map: Fluid Mechanics (Bar-Meir)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Introduction to Fluids
        • 1.1: What is Fluid Mechanics?
        • 1.2: Brief History
        • 1.2: Thermodynamics
        • 1.3: Kinds of Fluids
          • Shear Stress
        • 1.4: Shear Stress
        • 1.5: Viscosity
          • 1.5.1: General Discussion
          • 1.5.2: Non-Newtonian Fluids
            • Kinematic Viscosity
          • 1.5.3: Kinematic Viscosity
            • Administrator Guide
            • Getting Started
            • Knowledge Base
            • Known Issues
          • 1.5.4: Estimation of the Viscosity
        • 1.6: Fluid Properties
          • 1.6.1: Fluid Density
          • 1.6.2: Bulk Modulus
            • 1.6.2.1: Bulk Modulus of Mixtures
            • 1.6.2.2: When the Bulk Modulus is Important? and Hydraulics System
        • 1.7: Surface Tension
          • 1.7.1: Wetting of Surfaces
            • 1.7.1.1: Capillarity
      • 2: Review of Thermodynamics
        • 2.1: Introductory Remarks
        • 2.2: Basic Definitions
        • 2.3: Thermodynamics First Law
        • 2.4: Thermodynamics Second Law
      • 3: Review of Mechanics
        • 3.1: Introductory Remarks
        • 3.2: Kinematics of a Point Body
        • 3.3: Center of Mass
          • 3.3.1: Actual Center of Mass
          • 3.3.2: Aproximate Center of Area
        • 3.4: Moment of Inertia
          • 3.4.1 Moment of Inertia for Mass
          • 3.4.2: Moment of Inertia for Area
            • 3.4.2.1: General Discussion
            • 3.4.2.2: The Parallel Axis Theorem
          • 3.4.3: Examples of Moment of Inertia
          • 3.4.4: Product of Inertia
          • 3.4.5: Principal Axes of Inertia
        • 3.5: Newton's Laws of Motion
        • 3.6: Angular Momentum and Torque
          • 3.6.1: Tables of geometries
      • 4: Fluids Statics
        • 4.1: Introduction
        • 4.2: The Hydrostatic Equation
        • 4.3: Pressure and Density in a Gravitational Field
          • 4.3.1: Constant Density in Gravitational Field
          • 4.3.2: Pressure Management
            • 4.3.2.1: Measuring the Atmospheric Pressure
            • 4.3.2.2: Pressure Measurement
            • 4.3.2.3 Magnified Pressure Measurement
          • 4.3.3 Varying Density in a Gravity Field
            • 4.3.3.1: Gas Phase under Hydrostatic Pressure
            • 4.3.3.2: Liquid Phase Under Hydrostatic Pressure
          • 4.3.4: The Pressure Effects Due To Temperature Variations
            • 4.3.4.1: The Basic Analysis
            • 4.3.4.2 The Stability Analysis
          • 4.3.5: Gravity Variations Effects on Pressure and Density
            • 4.3.5.1: Ideal Gas in Varying Gravity
            • 4.3.5.2: Real Gas in Varying Gravity
            • 4.3.5.3: Liquid Under Varying Gravity
          • 4.3.6 Liquid Phase
        • 4.4: Fluid in an Accelerated System
          • 4.4.1: Fluid in a Linearly Accelerated System
          • 4.4.2 Angular Acceleration Systems: Constant Density
          • 4.4.3: Fluid Statics in Geological System
        • 4.5: Fluid Forces on Surfaces
          • 4.5.1: Fluid Forces on Straight Surfaces
            • 4.5.1.1: Pressure Center
            • 4.5.1.2: Multiply Layers
          • 4.5.2: Forces on Curved Surfaces
        • 4.6: Buoyancy and Stability
          • 4.6.1: Stability
            • 4.6.1.1: Stability of Body with Shifting Mass Centroid
            • 4.6.1.2: Metacentric Height, \(\overline{GM}\), Measurement
            • 4.6.1.3 Stability of Submerged Bodies
            • 4.6.1.4: Stability of None Systematical or ``Strange'' Bodies
            • 4.6.1.5: Neutral frequency of Floating Bodies
          • 4.6.2: Surface Tension
        • 4.7: Rayleigh–Taylor Instability
        • 4.8: Qualitative questions
      • 5: The Control Volume and Mass Conservation
        • 5.1: Introduction
        • 5.2: Control Volume
        • 5.3: Continuity Equation
          • 5.3.1: Non Deformable Control Volume
          • 5.3.2: Constant Density Fluids
            • 5.3.2.1: Non Deformable Control Volume
            • 5.3.2.2: Deformable Control Volume
            • 5.3.2.3: One–Dimensional Control Volume
        • 5.4: Reynolds Transport Theorem
        • 5.5: Examples For Mass Conservation
        • 5.6: The Details Picture – Velocity Area Relationship
        • 5.7: More Examples for Mass Conservation
      • 6: Momentum Conservation for Control Volume
        • 6.1: Momentum Governing Equation
          • 6.1.1: Introduction to Continuous
          • 6.1.2: External Forces
          • 6.1.3: Momentum Governing Equation
          • 6.1.4: Momentum Equation in Acceleration System
          • 6.1.5: Momentum For Steady State and Uniform Flow
            • 6.1.5.1: Momentum for For Constant Pressure and Frictionless Flow
        • 6.2: Momentum Equation Application
          • 6.2.1: Momentum for Unsteady State and Uniform Flow
          • 6.2.2: Momentum Application to Unsteady State
        • 6.3: Conservation Moment Of Momentum
        • 6.4: More Examples on Momentum Conservation
          • 6.4.1: Qualitative Questions
      • 7: Energy Conservation
        • 7.1: The First Law of Thermodynamics
        • 7.2: Limitation of Integral Approach
        • 7.3 Approximation of Energy Equation
          • 7.3.1: Energy Equation in Steady State
          • 7.3.2: Energy Equation in Frictionless Flow and Steady State
        • 7.4: Energy Equation in Accelerated System
          • 7.4.1: Energy in Linear Acceleration Coordinate
          • 7.4.2: Linear Accelerated System
          • 7.4.3: Energy Equation in Rotating Coordinate System
          • 7.4.4: Simplified Energy Equation in Accelerated Coordinate
            • 7.4.4.1: Energy Equation in Accelerated Coordinate with Uniform Flow
          • 7.4.5: Energy Losses in Incompressible Flow
        • 7.5: Examples of Integral Energy Conservation
        • 7.6: Qualitative Questions
      • 8: Differential Analysis
        • 8.1: Introduction
        • 8.2: Mass Conservation
          • 8.2.1 Mass Conservation Examples
        • 8.3: Conservation of General Quantity
          • 8.3.1 Generalization of Mathematical Approach for Derivations
          • 8.3.2 Examples of Several Quantities
            • 8.3.2.1: The General Mass Time Derivative
        • 8.4: Momentum Conservation
        • 8.5: Derivations of the Momentum Equation
        • 8.6: Boundary Conditions and Driving Forces
          • 8.6.1 Boundary Conditions Categories
        • 8.7: Examples for Differential Equation (Navier-Stokes)
          • 8.7.1: Interfacial Instability
      • 9: Dimensional Analysis
        • 9.1 Introductory Remarks
          • 9.1.1: Brief History
          • 9.1.2: Theory Behind Dimensional Analysis
          • 9.1.3: Dimensional Parameters Application for Experimental Study
          • 9.1.4: The Pendulum Class Problem
        • 9.2: Buckingham–π–Theorem
          • 9.2.1: Construction of the Dimensionless Parameters
          • 9.2.2: Basic Units Blocks
          • 9.2.3: Implementation of Construction of Dimensionless Parameters
            • 9.2.3.1: One Shot Method: Constructing Dimensionless Parameters
            • 9.2.3.2: Building Blocks Method: Constructing Dimensional Parameters
            • 9.2.3.3 Mathematical Method: Constructing Dimensional Parameters
          • 9.2.4: Similarity and Similitude
        • 9.3 Nusselt's Technique
        • 9.4 Summary of Dimensionless Numbers
          • 9.4.1: The Significance of these Dimensionless Numbers
          • 9.4.2: Relationship Between Dimensionless Numbers
          • 9.4.3: Examples for Dimensional Analysis
        • 9.5 Summary
      • 10: Inviscid Flow or Potential Flow
        • 10.1 Introduction
          • 10.1.1: Inviscid Momentum Equations
        • 10.2
          • 10.2.1: Streamline and Stream function
          • 10.2.2: Compressible Flow Stream Function
            • 10.2.2.1: Stream Function in a Three Dimensions
          • 10.2.3: The Connection Between the Stream Function and the Potential Function
            • 10.2.3.1: Existences of Stream Functions
        • 10.3 Potential Flow Functions Inventory
          • 10.3.1: Flow Around a Circular Cylinder
            • 10.3.1.1: Adding Circulation to a Cylinder
        • 10.4 Conforming Mapping
          • 10.4.1: Complex Potential and Complex Velocity
        • 10.5 Unsteady State Bernoulli in Accelerated Coordinates
      • 11: Compressible Flow One Dimensional
        • 11.1 What is Compressible Flow?
        • 11.2 Why Compressible Flow is Important?
        • 11.3 Speed of Sound
          • 11.3.1: Introduction
          • 11.3.2: Speed of Sound in Ideal and Perfect Gases
          • 11.3.3: Speed of Sound in Almost Incompressible Liquid
          • 11.3.4: Speed of Sound in Solids
          • 11.3.5: The Dimensional Effect of the Speed of Sound
        • 11.4 Isentropic Flow
          • 11.4.1: Stagnation State for Ideal Gas Model
          • 11.4.2: Isentropic Converging–Diverging Flow in Cross Section
          • 11.4.3: The Properties in the Adiabatic Nozzle
            • 11.4.3.1: The pressure Mach number relationship
            • 11.4.3.2: Relationship Between the Mach Number and Cross Section Area
          • 11.4.4: Isentropic Flow Examples
          • 11.4.5: Mass Flow Rate (Number)
          • 11.4.7: The Impulse Function
        • 11.5 Normal Shock
          • 11.5.1: Solution of the Governing Equations
            • 11.5.1.1: The Star Conditions
          • 11.5.2: Prandtl's Condition
          • 11.5.3: Operating Equations and Analysis
        • 11.6 Qualitative questions
          • 11.7 Isothermal Flow
        • 11.7 Isothermal Flow
          • 11.7.1: The Control Volume Analysis/Governing equations
          • 11.7.2: Dimensionless Representation
          • 11.7.3: The Entrance Limitation of Supersonic Branch
          • 11.7.4: Supersonic Branch
          • 11.7.5: Figures and Tables
          • 11.7.6: Isothermal Flow Examples
        • 11.7: Fanno Flow
          • 11.9.1: Introduction
          • 11.7.5
            • 11.7.5.1: Maximum Length for the Supersonic Flow
          • 11.7.6: Working Conditions
            • 11.7.6.1: Variations of The Tube Length (\(ld\)) Effects
            • 11.7.6.2: Fanno Flow Supersonic Branch
          • 11.7.7
            • 11.7.7.1: Choking explanation for pressure variation/reduction
          • 11.7.9: The Practical Questions and Examples of Subsonic branch
          • 11.7.11: Subsonic Fanno Flow for a Given \(M_1\) and Pressure Ratio
          • 11.7.12: More Examples of Fanno Flow
        • 11.8: The Table for Fanno Flow
        • 11.9: Rayleigh Flow
          • 11.9.1: Introduction
          • 11.9.2: Governing Equations
          • 11.9.3: Rayleigh Flow Tables and Figures
          • 11.9.4: Examples For Rayleigh Flow
      • 12: Compressible Flow 2–Dimensional
        • 12.1: Introduction
          • 12.1.1: Preface to Oblique Shock
            • 12.1.1.1: Introduction to Zero Inclination
        • 12.2: Oblique Shock
          • 12.2.1: Solution of Mach Angle
            • 12.2.1.1: Upstream Mach Number, \(M_1\), and Deflection Angle, \(\delta\)
          • 12.2.2: When No Oblique Shock Exist or the case of \(D>0\)
            • 12.2.2.1: Large deflection angle for given, \(M_1\)
            • 12.2.2.2: The case of \(D\geq 0\) or \(0 \geq\delta\)
            • 12.2.2.3: Upstream Mach Number, \(M_1\), and Shock Angle, \(\theta\)
            • 12.2.2.4: Given Two Angles, \(\delta\) and \(\theta\)
            • 12.2.2.5: Flow in a Semi–2D Shape
            • 12.2.2.6: Close and Far Views of the Oblique Shock
            • 12.2.2.7: Maximum Value of Oblique shock
            • 12.2.2.8: Oblique Shock Examples
          • 12.2.3: Application of Oblique Shock
        • 12.3: Prandtl-Meyer Function
          • 12.3.1: Introduction
          • 12.3.2: Geometrical Explanation
        • 12.4: The Maximum Turning Angle
        • 12.5: The Working Equations for the Prandtl-Meyer Function
        • 12.6: d'Alembert's Paradox
        • 12.7: Flat Body with an Angle of Attack
        • 12.8: Examples For Prandtl–Meyer Function
        • 12.9: Combination of the Oblique Shock and Isentropic Expansion
      • 13: Multi–Phase Flow
        • 13.1: Introduction
        • 13.2: History
        • 13.3: What to Expect From This Chapter
        • 13.4: Kind of Multi-Phase Flow
        • 13.5: Classification of Liquid-Liquid Flow Regimes
          • 13.5.1: Co–Current Flow
            • 13.5.1.1: Horizontal Flow
            • 13.5.1.2: Vertical Flow
            • 13.5.1.3: Vertical Flow Under Micro Gravity
        • 13.6: Multi–Phase Flow Variables Definitions
          • 13.6.1: Multi–Phase Averaged Variables Definitions
        • 13.7: Homogeneous Models
          • 13.7.1: Pressure Loss Components
            • 13.7.1.1: Friction Pressure Loss
            • 13.7.1.2: Acceleration Pressure Loss
            • 13.7.1.3: Gravity Pressure Loss
            • 13.7.1.4: Total Pressure Loss
          • 13.7.2: Lockhart Martinelli Model
        • 13.8: Solid–Liquid Flow
          • 13.8.1: Solid Particles with Heavier Density \(\rho_S>\rho_L\)
          • 13.8.2: Solid With Lighter Density \(\rho_S< \rho\) and With Gravity
        • 13.9: Counter–Current Flow
          • 13.9.1: Horizontal Counter–Current Flow
          • 13.9.2: Flooding and Reversal Flow
        • 13.10: Multi–Phase Conclusion
      • Back Matter
    • Book: Distillation Science (Coleman)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Overview
      • 2: Vapor Pressure
      • 3: Critical Properties and Acentric Factor
      • 4: New Vapor Pressure Equation
      • 5: Equation of State
      • 6: Fugacity
      • 7: Liquid Activity Coefficients
      • 8: VLE Analysis Methods
      • 9: Putting It All Together
      • 10: Convergence Strategy
      • Back Matter
  • Civil Engineering
    • Book: Introduction to Design Equity (Miller)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Introduction
      • 2: Learning to Talk about Racism
      • 3: Why History Matters to Design Equity
      • 4: Health Equity and the Built Environment
      • 5: Transportation Equity
      • 6: Information Equity
      • 7: What is Design Thinking and What does it have to do with Equity?
      • 8: Discipline-Specific Professional Design Processes and Equity
      • Acknowledgements and Dedication
      • Copyright
      • Title Page
      • Back Matter
  • Computer Science
    • Book: Foundations of Computation (Critchlow & Eck)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Logic and Proof
        • 1.1: Propositional Logic
        • 1.2: Boolen Algebra
        • 1.3: Application - Logic Circuits
        • 1.4: Predicates and Quantifiers
        • 1.5: Deduction
        • 1.6: Proof
        • 1.7: Proof by Contradiction
        • 1.8: Mathematical Induction
        • 1.9: Application- Recursion and Induction
        • 1.10: Recursive Definitions
      • 2: Sets, Functions, and Relations
        • 2.1: Basic Concepts
        • 2.2: The Boolean Algebra of Sets
        • 2.3: Application- Programming with Sets
        • 2.4: Functions
        • 2.5: Application- Programming with Functions
        • 2.6: Counting Past Infinity
        • 2.7: Relations
        • 2.8: Relational Databases
      • 3: Regular Expressions and FSA's
        • 3.1: Languages
        • 3.2: Regular Expressions
        • 3.3: Using Regular Expressions
        • 3.4: Finite-State Automata
        • 3.5: Nondeterministic Finite-State Automata
        • 3.6: Finite-State Automata and Regular Lan- guages
        • 3.7: Non-regular Languages
      • 4: Grammars
        • 4.1: Context-free Grammars
        • 4.2: Application - BNF
        • 4.3: Parsing and Parse Trees
        • 4.4: Pushdown Automata
        • 4.5: Non-context-free Languages
        • 4.6: General Grammars
      • 5: Turing Machines and Computability
        • 5.1: Turing Machines
        • 5.2: 5.2 Computability
        • 5.3: 5.3 The Limits of Computation
        • Section 5:
        • Section 6:
      • Back Matter
    • Book: Open Structures (Porin)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Introduction
        • 1.1: The Need for Efficiency
        • 1.2: Interfaces
        • 1.3: Mathematical Background
        • 1.4: The Model of Computation
        • 1.5: Correctness, Time Complexity, and Space Complexity
        • 1.6: Code Samples
        • 1.7: List of Data Structures
        • 1.8: Discussion and Exercises
      • 2: Array-Based Lists
        • 2.1: ArrayStack - Fast Stack Operations Using an Array
        • 2.2: FastArrayStack - An Optimized ArrayStack
        • 2.3: ArrayQueue - An Array-Based Queue
        • 2.4: ArrayDeque - Fast Deque Operations Using an Array
        • 2.5: DualArrayDeque - Building a Deque from Two Stacks
        • 2.6: RootishArrayStack - A Space-Efficient Array Stack
        • 2.7: Discussion and Exercises
      • 3: Linked Lists
        • 3.1: SLList - A Singly-Linked List
        • 3.2: DLList - A Doubly-Linked List
        • 3.3: SEList - A Space-Efficient Linked List
        • 3.4: Discussion and Exercises
      • 4: Skiplists
        • 4.1: The Basic Structure
        • 4.2: SkiplistSSet - An Efficient SSet
        • 4.3: SkiplistList - An Efficient Random-Access List
        • 4.4: Analysis of Skiplists
        • 4.5: Discussion and Exercises
      • 5: Hash Tables
        • 5.1: ChainedHashTable - Hashing with Chaining
        • 5.2: LinearHashTable - Linear Probing
        • 5.3: Hash Codes
        • 5.4: Discussion and Exercises
      • 6: Binary Trees
        • 6.1: BinaryTree - A Basic Binary Tree
        • 6.2: BinarySearchTree - An Unbalanced Binary Search Tree
        • 6.3: Discussion and Exercises
      • 7: Random Binary Search Trees
        • 7.1: Random Binary Search Trees
        • 7.2: Treap - A Randomized Binary Search Tree
        • 7.3: Discussion and Exercises
      • 8: Scapegoat Trees
        • 8.1: ScapegoatTree - A Binary Search Tree with Partial Rebuilding
        • 8.2: Discussion and Exercises
      • 9: Red-Black Trees
        • 9.1: 2-4 Trees
        • 9.2: A Simulated 2-4 Tree
        • 9.3: Summary
        • 9.4: Discussion and Exercises
      • 10: Heaps
        • 10.1: BinaryHeap - An Implicit Binary Tree
        • 10.2: MeldableHeap - A Randomized Meldable Heap
        • 10.3: Discussion and Exercises
      • 11: Sorting Algorithms
        • 11.1: Comparison-Based Sorting
        • 11.2: Counting Sort and Radix Sort
        • 11.3: Discussion and Exercises
      • 12: Graphs
        • 12.1: Representing a Graph by a Matrix
        • 12.2: A Graph as a Collection of Lists
        • 12.3: Graph Traversal
        • 12.4: Discussion and Exercises
      • 13: Data Structures for Integers
        • 13.1: BinaryTrie - A digital search tree
        • 13.2: XFastTrie - Searching in Doubly-Logarithmic Time
        • 13.3: YFastTrie - A Doubly-Logarithmic Time SSet
        • 13.4: Discussion and Exercises
      • 14: External Memory Searching
        • 14.1: The Block Store
        • 14.2: B-Trees
        • 14.3: Discussion and Exercises
      • Back Matter
    • Book: An Introduction to Ontology Engineering (Keet)
      • 1: How to Use the Book
        • 1.1: Aims and Synopsis
        • 1.2: Content at a Glance
        • 1.3: Assessment
      • 2: Introduction to Ontology Engineering
        • 2.1: Prelude to Ontology Engineering
        • 2.2: What Does an Ontology Look Like?
        • 2.3: What is an Ontology?
        • 2.4: What is the Usefulness of an Ontology?
        • 2.5: Outline and Usage of the Book
        • 2.E: Introduction to Ontology Engineering (Exercises)
        • 2.S: Literature and Reference Material
      • 3: First Order Logic and Automated Reasoning in a Nutshell
        • 3.1: First Order Logic Syntax and Semantics
        • 3.2: Reasoning
        • 3.E: First Order Logic and Automated Reasoning in a Nutshell (Excercises)
        • 3.S: First Order Logic and Automated Reasoning in a Nutshell (Summary)
      • 4: Description Logics
        • 4.1: Prelude to Description Logics
        • 4.2: Description Logics Primer
        • 4.3: Important Description Logics
        • 4.4: Reasoning Services
        • 4.5: Literature and Reference Material
        • 4.E: Description Logics (Exercises)
      • 5: The Web Ontology Language OWL 2
        • 5.1: Prelude to the Web Ontology Language
        • 5.2: Standardizing an Ontology Language
        • 5.3: OWL 2
        • 5.4: OWL in Context
        • 5.E: The Web Ontology Language (Exercises)
        • 5.S: Literature and Reference Material
      • 6: Methods and Methodologies
        • 6.1: Methodologies for Ontology Development
        • 6.2: Methods to Improve an Ontology’s Quality
        • 6.3: Exercises
        • 6.4: Literature and Reference Material
      • 7: Top-Down Ontology Development
        • 7.1: Prelude to Top-Down Ontology Development
        • 7.2: Foundational Ontologies
        • 7.3: Part-Whole Relations
        • 7.4: Excercises
        • 7.5: Literature and Reference Material
      • 8: Bottom-up Ontology Development
        • 8.1: Relational Databases and Related ‘legacy’ KR
        • 8.2: From Spreadsheets to OWL
        • 8.3: Thesauri
        • 8.4: Text Processing to Extract Content for Ontologies
        • 8.5: Other Semi-Automated Approaches
        • 8.6: Ontology Design Patterns
        • 8.7: Exercises
        • 8.8: Literature and Reference Material
      • 9: Ontology-Based Data Access
        • 9.1: Introduction- Motivations
        • 9.2: OBDA Design Choices
        • 9.3: An OBDA Architecture
        • 9.4: Principal Components
        • 9.5: Exercises
        • 9.6: Literature and Reference Material
      • 10: Ontologies and Natural Languages
        • 10.1: Toward Multilingual Ontologies
        • 10.2: Ontology Verbalisation
        • 10.3: Exercises
        • 10.4: Literature and Reference Material
      • 11: Advanced Modeling with Additional Language Features
        • 11.1: Uncertainty and Vagueness
        • 11.2: Time and Temporal Ontologies
        • 11.3: Exercises
        • 11.4: Literature and Reference Material
      • 12: Bibliography
        • 12.1: Bibliography
        • 12.2: Books About Ontologies
        • 12.3: Selection of Journals that Publish Papers about Ontologies
        • 12.4: Selection of Conferences that Publish Papers about Ontologies
      • 13: Assignments
        • 13.1: Practical Assignment- Develop a Domain Ontology
        • 13.2: Project Assignment
      • 14: OWL 2 Profiles Features List
      • 15: Complexity Recap
      • 16: About the Author
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • Back Matter
    • Book: A Brief Introduction to Engineering Computation with MATLAB (Beyenir)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Acknowledgements
      • 2: Preface
      • 3: Study Guide
      • 4.1: What is MATLAB?
        • 4.2 Problem Set
      • 5.1: Essentials
        • 5.2 Problem Set
      • 6.1: Plotting in MATLAB
        • 6.2 Problem Set
      • 7.1: Writing Scripts to Solve Problems
        • 7.2 Problem Set
      • 8.1: Interpolation
        • 8.2 Problem Set
      • 9.1: Computing the Area Under a Curve
        • 9.2 Problem Set
      • 10.1: Regression Analysis
        • 10.2 Problem Set
      • 11: Publishing with MATLAB
        • 11.2 Problem Set
      • Back Matter
    • Book: Delftse Foundations of Computation
      • 1: Introduction
        • 1.1: Introduction
      • 2: Logic
        • 2.1: Propositional Logic
          • 2.1.1: 2.1.A Propositions
          • 2.1.2: 2.1.B Logical operators
          • 2.1.3: 2.1.C Precedence rules
          • 2.1.4: 2.1.D Logical equivalence
          • 2.1.5: 2.1.E More logical operaters
          • 2.1.6: 2.1.F Implications in English
          • 2.1.7: 2.1.G More forms of implication
          • 2.1.8: 2.1.H Exclusive or
          • 2.1.9: 2.1.I Universal operators
          • 2.1.10: 2.1.J Classifying propositions
        • 2.2: Boolean Algebra
          • 2.2.1: 2.2.A Basics of Boolean Algebra
          • 2.2.2: 2.2.B Substitution laws
          • 2.2.3: 2.2.C Simplifications
          • 2.2.4: 2.2.D More rules of Boolean algebra
        • 2.3: Logic Circuits
          • 2.3.1: 2.3.A Logic gates
          • 2.3.2: 2.3.B Combining gates to create circuits
          • 2.3.3: 2.3.C From circuits to propositions
          • 2.3.4: 2.3.D Disjunctive Normal Form
          • 2.3.5: 2.3.E Binary addition
        • 2.4: Predicate Logic
          • 2.4.1: 2.4.B Quantifiers
          • 2.4.2: 2.4.C Operators
          • 2.4.3: 2.4.D Tarski’s world and formal structures
          • 2.4.4: 2.4.E Logical equivalence
          • 2.4.4A: Predicates
        • 2.5: 2.5 Deduction
          • 2.5.1: 2.5.B Valid arguments and proofs
          • 2.5.2: 2.5.C Proofs in predicate logic
          • 2.5.5A: Arguments
        • 2.6: Logic
      • 3: Proof
        • 3.1: A Little Historial Background
        • 3.2: 3.2.C Examples
        • 3.3: Mathematical Proof
          • 3.3.1: How to write a proof
          • 3.3.2: Some terminology
        • 3.4: Proof by Contradiction
        • 3.5: Mathematical Induction
          • 3.5.1: How to write a proof by induction
          • 3.5.2: Examples
          • 3.5.3: More examples
        • 3.6: Strong Mathematical Induction
        • 3.7: Application - Recursion and Induction
          • 3.7.1: Recursive factorials
          • 3.7.2: Towers of Hanoi
          • 3.7.3: Binary trees
        • 3.8: Recursive Definitions
        • 3.9: Invariants
      • 4: Sets, Functions, and Relations
        • 4.1: Basic Concepts
          • 4.1.1: Elements of sets
          • 4.1.2: Set-builder notation
          • 4.1.3: Operations on sets
          • 4.1.4: Visualising sets
          • 4.1.5: Sets of sets
          • 4.1.6: Mathematical induction revisited
          • 4.1.7: Structural Induction
        • 4.2: 4.2 The Boolean Algebra of Sets
          • 4.2.1: Set Complement
          • 4.2.2: Link between logic and set theory
        • 4.3: Programming with Sets
          • 4.3.1: Representing sets
          • 4.3.2: Computing with sets
        • 4.4: Functions
          • 4.4.1: Formalizing the notion of functions
          • 4.4.2: Operations on functions
          • 4.4.3: Properties of functions
          • 4.4.4: First-class objects
        • 4.5: Programming with Functions
          • 4.5.1: Functions as first-class objects
        • 4.6: Counting Past Infinity
          • 4.6.1: Cardinality
          • 4.6.2: Counting to infinity
          • 4.6.3: Uncountable sets
          • 4.6.4: A final note on infinities
        • 4.7: Relations
          • 4.7.1: Properties of relations
          • 4.7.2: Equivalence relations
        • 4.8: Relational Databases
      • 5: Looking Beyond
        • 5.1: Further Reading
        • Section 2:
        • Section 3:
        • Section 4:
        • Section 5:
        • Section 6:
    • Book: Programming Fundamentals (Busbee & Braunschweig)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • 1: Introduction to Programming
        • 1.1: Systems Development Life Cycle
        • 1.2: Program Design
        • 1.3: Program Quality
        • 1.4: Pseudocode
        • 1.5: Flowcharts
        • 1.6: Software Testing
        • 1.7: Integrated Development Environment
        • 1.8: Version Control
        • 1.9: Input and Output
        • 1.10: Hello World
        • 1.11: C++ Examples
        • 1.12: C# Examples
        • 1.13: Java Examples
        • 1.14: JavaScript Examples
        • 1.15: Python Examples
        • 1.16: Swift Examples
        • 1.17: Practice- Introduction to Programming
      • 2: Data and Operators
        • 2.1: Constants and Variables
        • 2.2: JavaScript Examples
        • 2.3: Python Examples
        • 2.4: Swift Examples
        • 2.5: Practice- Data and Operators
        • 2.6: Identifier Names
        • 2.7: Data Types
        • 2.8: Integer Data Type
        • 2.9: Floating-Point Data Type
        • 2.10: String Data Type
        • 2.11: Boolean Data Type
        • 2.12: Nothing Data Type
        • 2.13: Order of Operations
        • 2.14: Assignment
        • 2.15: Arithmetic Operators
        • 2.16: Integer Division and Modulus
        • 2.17: Unary Operations
        • 2.18: Lvalue and Rvalue
        • 2.19: Data Type Conversions
        • 2.20: Input-Process-Output Model
        • 2.21: C++ Examples
        • 2.22: C# Examples
        • 2.23: Java Examples
      • 3: Functions
        • 3.1: Modular Programming
        • 3.2: Hierarchy or Structure Chart
        • 3.3: Function Examples
        • 3.4: Parameters and Arguments
        • 3.5: Call by Value vs. Call by Reference
        • 3.6: Return Statement
        • 3.7: Void Data Type
        • 3.8: Scope
        • 3.9: Programming Style
        • 3.10: Standard Libraries
        • 3.11: C++ Examples
        • 3.12: C# Examples
        • 3.13: Java Examples
        • 3.14: JavaScript Examples
        • 3.15: Python Examples
        • 3.16: Swift Examples
        • 3.17: Practice- Functions
      • 4: Conditions
        • 4.1: Structured Programming
        • 4.2: Selection Control Structures
        • 4.3: If Then Else
        • 4.4: Code Blocks
        • 4.5: Relational Operators
        • 4.6: Assignment vs Equality
        • 4.7: Logical Operators
        • 4.8: Nested If Then Else
        • 4.9: Case Control Structure
        • 4.10: Condition Examples
        • 4.11: C++ Examples
        • 4.12: C# Examples
        • 4.13: Java Examples
        • 4.14: JavaScript Examples
        • 4.15: Python Examples
        • 4.16: Swift Examples
        • 4.17: Practice- Conditions
      • 5: Loops
        • 5.1: Iteration Control Structures
        • 5.2: While Loop
        • 5.3: Do While Loop
        • 5.4: Flag Concept
        • 5.5: For Loop
        • 5.6: Branching Statements
        • 5.7: Increment and Decrement Operators
        • 5.8: Integer Overflow
        • 5.9: Nested For Loops
        • 5.10: Loop Examples
        • 5.11: C++ Examples
        • 5.12: C# Examples
        • 5.13: Java Examples
        • 5.14: JavaScript Examples
        • 5.15: Python Examples
        • 5.16: Swift Examples
        • 5.17: Practice- Loops
      • 6: Arrays and Lists
        • 6.1: Arrays and Lists
        • 6.2: Index Notation
        • 6.3: Displaying Array Members
        • 6.4: Arrays and Functions
        • 6.5: Math Statistics with Arrays
        • 6.6: Searching Arrays
        • 6.7: Sorting Arrays
        • 6.8: Parallel Arrays
        • 6.9: Multidimensional Arrays
        • 6.10: Dynamic Arrays
        • 6.11: C++ Examples
        • 6.12: C# Examples
        • 6.13: Java Examples
        • 6.14: JavaScript Examples
        • 6.15: Python Examples
        • 6.16: Swift Examples
        • 6.17: Practice- Arrays and Lists
      • 7: Strings and Files
        • 7.1: Strings
        • 7.2: String Functions
        • 7.3: String Formatting
        • 7.4: File Input and Output
        • 7.5: Loading an Array from a Text File
        • 7.6: C++ Examples
        • 7.7: C# Examples
        • 7.8: Java Examples
        • 7.9: JavaScript Examples
        • 7.10: Python Examples
        • 7.11: Swift Examples
        • 7.12: Practice- Strings and Files
      • 8: Object-Oriented Programming
        • 8.1: Objects and Classes
        • 8.2: Encapsulation
        • 8.3: Inheritance and Polymorphism
        • 8.4: C++ Examples
        • 8.5: C# Examples
        • 8.6: Java Examples
        • 8.7: JavaScript Examples
        • 8.8: Python Examples
        • 8.9: Swift Examples
        • 8.10: Practice
      • Back Matter
    • Book: Programming Fundamentals - A Modular Structured Approach using C++ (Busbee)
      • 1: Introduction, Preface and Syllabus
        • 1.1: Preface
        • 1.2: Author Acknowledgements
        • 1.3: Orientation and Syllabus
        • 1.4: Sharing/Rating Connexions Materials
      • 2: Introduction to Programming
        • 2.1: Systems Development Life Cycle
        • 2.2: Visual Studio Code IDE/MinGW C++ Compiler
        • 2.3: Modularization and C++ Program Layout
        • 2.4: Practice 1 Introduction to Programming
      • 3: Program Planning and Design
        • 3.1: Program Design
        • 3.2: Psuedocode
        • 3.3: Test Data
        • 3.4: Practice 2 Program Planning and Design
      • 4: Data and Operators
        • 4.1: Data Types in C++
        • 4.2: Identifier Names
        • 4.3: Constants and Variables
        • 4.4: Data Manipulation
        • 4.5: Assignment Operator
        • 4.6: Arithmetric Operators
        • 4.7: Data Type Conversions
        • 4.8: Practice 3 Data and Operators
      • 5: Often Used Data Types
        • 5.1: Integer Data Type
        • 5.2: Floating-Point Data Type
        • 5.3: String Data Type
        • 5.4: Arithmetic Assignment Operators
        • 5.5: L Value and R Value
        • 5.6: Interger Division and Modulus
        • 5.7: Practice 4 Often Used Data Types
      • 6: Integrated Development Environment
        • 6.1: Introduction to IDEs
        • 6.2: Standard Input and Output
        • 6.3: Compiler Directives
        • 6.4: Practice 5 Integrated Development Environment
      • 7: Program Control Functions
        • 7.1: Psuedocode Examples for Functions
        • 7.2: Hierarchy or Structure Chart
        • 7.3: Program Control Functions
        • 7.4: Void Data Type
        • 7.5: Documentation and Making Source Code Readable
        • 7.6: Practice 6 Program Control Functions
      • 8: Specific Task Functions
        • 8.1: Specific Task Functions
        • 8.2: Global vs Local Data Storage
        • 8.3: Using a Header File for User Defined Specific Task Functions
        • 8.4: Practice 7 Specific Task Functions
      • 9: Standard Libraries
        • 9.1: Standard Libraries
        • 9.2: Practice 8 Standard Libraries
      • 10: Character Data, Sizeof, Typedef, Sequence
        • 10.1: Character Data Type
        • 10.2: Sizeof Operator
        • 10.3: Typedef - An Alias
        • 10.4: Sequence Operator
        • 10.5: Practice 9 Character Data, Sizeof, Typedef, Sequence
      • 11: Introduction to Structured Programming
        • 11.1: Structure Programming
        • 11.2: Pseudocode Examples for Control Structures
        • 11.3: Flowcharting
        • 11.4: Practice 10 Introduction to Structure Programming
      • 12: Two Way Selection
        • 12.1: If Then Else
        • 12.2: Boolean Data Type
        • 12.3: Relational Operators
        • 12.4: Compound Statement
        • 12.5: Practice 11 Two Way Selection
      • 13: Multiway Selection
        • 13.1: Nested If Then Else
        • 13.2: Logical Operators
        • 13.3: Case Control Structure
        • 13.4: Branching Control Structures
        • 13.5: Practice 12 Multiway Selection
      • 14: Test After Loops
        • 14.1: Do While Loop
        • 14.2: Flag Concept
        • 14.3: Assignment vs Equality within C++
        • 14.4: Repeat Until Loop
        • 14.5: Practice 13 Test After Loops
      • 15: Test Before Loops
        • 15.1: Increment and Decrement Operators
        • 15.2: While Loop
        • 15.3: Practice 14 Test Before Loops
      • 16: Counting Loops
        • 16.1: For Loop
        • 16.2: Circular Nature of the Interger Data Type Family
        • 16.3: Formatting Output
        • 16.4: Nested For Loops
        • 16.5: Practice 15 Counting Loops
      • 17: String Class, Unary Positive and Negative
        • 17.1: String Class within C++
        • 17.2: Unary Positive and Negative Operators
        • 17.3: Practice 16 String Class, Unary Positive and Negative
      • 18: Conditional Operator and Recursion
        • 18.1: Conditional Operator
        • 18.2: Recursion vs Iteration
        • 18.3: Practice 17 Conditional Operator and Recursion
      • 19: Introduction to Arrays
        • 19.1: Array Data Type
        • 19.2: Array Index Operator
        • 19.3: Displaying Array Members
        • 19.4: Practice 18 Introduction to Arrays
      • 20: File I/O and Array Functions
        • 20.1: File Input and Output
        • 20.2: Arrays and Functions
        • 20.3: Loading an Array from a File
        • 20.4: Math Statistics with Arrays
        • 20.5: Practice 19 File I/O and Array Functions
      • 21: More Array Functions
        • 21.1: Finding a Specific Member of an Array
        • 21.2: Sorting an Array
        • 21.3: Practice 20 More Array Functions
      • 22: More on Typedef
        • 22.1: Versatile Code with Typedef
        • 22.2: Practice 21 More on Typedef
      • 23: Pointers
        • 23.1: Address Operator
        • 23.2: Parameter Passing by Reference
        • 23.3: Pointer Data Type
        • 23.4: Indirection Operator
        • 23.5: Practice 22 Pointers
      • 24: More Arrays and Compiler Directives
        • 24.1: Multidimensional Arrays
        • 24.2: Conditional Compilation
        • 24.3: Practice 23 More Arrays and Compiler Directives
      • 25: OOP and HPC
        • 25.1: Object Oriented Programming
        • 25.2: Understanding High Performance Computing
        • 25.3: Practice 24 OOP and HPC
      • 26: Review Materials
        • 26.1: Foundation Topics Group 1-5
        • 26.2: Modular Programming Group 6-9
        • 26.3: Structured Programming Group 10-16
        • 26.4: Intermediate Topics Group 17-21
        • 26.5: Advanced Topics Group 22-24
      • 27: Appendix
        • 27.1: Abbreviated Precedence Chart for C++ Operators
        • 27.2: C++ Reserved Keywords
        • 27.3: ASCII Character Set
        • 27.4: Show Hide File Extensions
        • 27.5: Academic or Scholastic Dishonesty
        • 27.6: Successful Learning Skills
        • 27.7: Study Habits that Build the Brain
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • Back Matter
    • Book: A First Course in Electrical and Computer Engineering (Scharf)
      • Front Matter
        • TitlePage
        • InfoPage
        • Dedication
        • Preface
      • 3: Complex Numbers
        • 3.1: Introdction
        • 3.2: Geometry of Complex Numbers
        • 3.3: Algebra of Complex Numbers
        • 3.4: Roots of Quadratic Equations
        • 3.5: Representing Complex Numbers in Vector Space
        • 3.6: An Electric Field Computation
        • 3.7: Numerical Experiment (Quadratic Roots)
      • 4: The Exponential Functions
        • 4.1: Introduction
        • 4.2: The Function e^x
        • 4.3: The Function e^jθ and the Unit Circle
        • 4.4: The Euler and De Moivre Identities
        • 4.5: Roots of Unity and Related Topics
        • 4.6: Second-Order Differential and Difference Equations
        • 4.7: Numerical Experiment (Approximating e^jθ)
      • 5: Phasors
        • 5.1: Introduction to Phasors
        • 5.2: Phasor Representation of Signals
        • 5.3: Beating between Tones
        • 5.4: Multiphase Power
        • 5.5: Lissajous Figures
        • 5.6: Sinusoidal Steady State and the Series RLC Circuit
        • 5.7: Light Scattering by a Slit
        • 5.8: Numerical Experiment (Interference Patterns)
      • 6: Linear Algebra
        • 6.01: Introduction
        • 6.02: Vectors
        • 6.03: Inner Product and Euclidean Norm
        • 6.04: Direction Cosines
        • 6.05: Projections
        • 6.06: Other Norms
        • 6.07: Matrices
        • 6.08: Solving Linear Systems of Equations
        • 6.09: Circuit Analysis
        • 6.10: Numerical Experiment (Circuit Design)
      • 7: Vector Graphics
        • 7.1: Introduction to Vector Graphics
        • 7.2: Two-Dimensional Image Representation
        • 7.3: Two-Dimensional Image Transformations
        • 7.4: Composition of Transformations
        • 7.5: Homogeneous Coordinates
        • 7.6: Three-Dimensional Homogeneous Coordinates
        • 7.7: Projections
        • 7.8: Numerical Experiment (Star Field)
      • 8: Filtering
        • 8.1: Introduction
        • 8.2: Simple Averages
        • 8.3: Weighted Averages
        • 8.4: Moving Averages
        • 8.5: Exponential Averages and Recursive Filters
        • 8.6: Test Sequences
        • 8.7: Numerical Experiment (Frequency Response of First-Order Filter)
      • 9: Binary Codes
        • 9.1: Introduction
        • 9.2: The Communication Paradigm
        • 9.3: From Symbols to Binary Codes
        • 9.4: Huffman Codes for Source Coding
        • 9.5: Hamming Codes for Channel Coding
        • 9.6: Numerical Experiment (Huffman Codes)
      • 10: An Introduction to MATLAB
        • 10.01: Introduction
        • 10.02: Running MATLAB (Macintosh)
        • 10.03: Running MATLAB (PC)
        • 10.04: Interactive Mode
        • 10.05: Variables
        • 10.06: Complex Variables
        • 10.07: Vectors and Matrices
        • 10.08: The Colon
        • 10.09: Graphics
        • 10.10: Editing Files and Creating Functions (Macintosh)
        • 10.11: Editing Files and Creating Functions (PC)
        • 10.12: Loops and Control
      • 11: The Edix Editor
      • 12: Useful Mathematical Identities
      • Back Matter
    • Book: Think Data Structures - Algorithms and Information Retrieval in Java (Downey)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
        • Preface
        • Prerequisites
      • 1: Interfaces
        • 1.1: Why are there two kinds of List?
        • 1.2: Interfaces in Java
        • 1.3: The List Interface
        • 1.4: Exercise 1
      • 2: Analysis of Algorithms
        • 2.1: Selection Sort
        • 2.2: Big O notation
        • 2.3: Exercise 2
      • 3: ArrayList
        • 3.1: Classifying MyArrayList methods
        • 3.2: Classifying add
        • 3.3: Problem Size
        • 3.4: Linked Data Structures
        • 3.5: Exercise 3
        • 3.6: A note on garbage collection
      • 4: LinkedList
        • 4.1: Classifying MyLinkedList methods
        • 4.2: Comparing MyArrayList and MyLinkedList
        • 4.3: Profiling
        • 4.4: Interpreting results
        • 4.5: Exercise 4
      • 5: Doubly-linked list
        • 5.1: Performance profiling results
        • 5.2: Profiling LinkedList methods
        • 5.3: Adding to the end of a LinkedList
        • 5.4: Doubly-linked list
        • 5.5: Choosing a Structure
      • 6: Tree traversal
        • 6.1: Search engines
        • 6.2: Parsing HTML
        • 6.3: Using jsoup
        • 6.4: Iterating through the DOM
        • 6.5: Depth-first search
        • 6.6: Stacks in Java
        • 6.7: Iterative DFS
      • 7: Getting to Philosophy
        • 7.1: Getting started
        • 7.2: Iterables and Iterators
        • 7.3: WikiFetcher
        • 7.4: Exercise 5
      • 8: Indexer
        • 8.1: Data structure selection
        • 8.2: TermCounter
        • 8.3: Exercise 6
      • 9: The Map interface
        • 9.1: Implementing MyLinearMap
        • 9.2: Exercise 7
        • 9.3: Analyzing MyLinearMap
      • 10: Hashing
        • 10.1: Hashing
        • 10.2: How does hashing work?
        • 10.3: Hashing and mutation
        • 10.4: Exercise 8
      • 11: HashMap
        • 11.1: Exercise 9
        • 11.2: Analyzing MyHashMap
        • 11.3: The tradeoffs
        • 11.4: Profiling MyHashMap
        • 11.5: Fixing MyHashMap
        • 11.6: UML class diagrams
      • 12: TreeMap
        • 12.1: What’s wrong with hashing?
        • 12.2: Binary search tree
        • 12.3: Exercise 10
        • 12.4: Implementing a TreeMap
      • 13: Binary search tree
        • 13.1: A simple MyTreeMap
        • 13.2: Searching for values
        • 13.3: Implementing put
        • 13.4: In-order traversal
        • 13.5: The logarithmic methods
        • 13.6: Self-balancing trees
        • 13.7: One more exercise
      • 14: Persistence
        • 14.1: Redis
        • 14.2: Redis clients and servers
        • 14.3: Making a Redis-backed index
        • 14.4: Redis data types
        • 14.5: Exercise 11
        • 14.6: More suggestions if you want them
        • 14.7: A few design hints
      • 15: Crawling Wikipedia
        • 15.1: The Redis-backed indexer
        • 15.2: Analysis of lookup
        • 15.3: Analysis of indexing
        • 15.4: Graph traversal
        • 15.5: Exercise 12
      • 16: Boolean search
        • 16.1: Crawler solution
        • 16.2: Information retrieval
        • 16.3: Boolean search
        • 16.4: Exercise 13
        • 16.5: Comparable and Comparator
        • 16.6: Extensions
      • 17: Sorting
        • 17.1: Insertion sort
        • 17.2: Exercise 14
        • 17.3: Analysis of merge sort
        • 17.4: Radix sort
        • 17.5: Heap sort
        • 17.6: Bounded heap
        • 17.7: Space complexity
      • Back Matter
    • Book: Eloquent JavaScript (Haverbeke)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
        • Introduction
      • Part 1: Language
        • 1: Values, Types, and Operators
        • 2: Program Structure
        • 3: Functions
        • 4: Objects and Arrays
        • 5: Higher-order Functions
        • 6: The Secret Life of Objects
        • 7: Project - A Robot
        • 8: Bugs and Errors
        • 9: Regular Expressions
        • 10: Modules
        • 11: Asynchronous Programming
        • 12: Project - A Programming Language
      • Part 2: Browser
        • 13: JavaScript and the Browser
        • 14: The Document Object Model
        • 15: Handling Events
        • 16: Project - A Platform Game
        • 17: Drawing on Canvas
        • 18: HTTP and Forms
        • 19: Project - A Pixel Art Editor
      • Part 3: Node
        • 20: Node.js
        • 21: Project - Skill-Sharing Website
    • Book: Python for Everybody (Severance)
      • 1: Introduction
        • 1.1: Why should you learn to write programs?
        • 1.2: Creativity and Motivation
        • 1.3: Computer Hardware Architecture
        • 1.4: Understanding Programming
        • 1.5: Words and Sentences
        • 1.6: Conversing with Python
        • 1.7: Terminology - Interpreter and Compiler
        • 1.8: Writing a Program
        • 1.9: What is a program?
        • 1.E: Introduction (Exercises)
        • 1.G: Introduction (Glossary)
        • 1.10: The Building Blocks of Programs
        • 1.11: What could possibly go wrong?
        • 1.12: The Learning Journey
      • 2: Variables, Expressions, and Statements
        • 2.1: Values and Types
        • 2.2: Variables
        • 2.3: Variable names and Keywords
        • 2.4: Statements
        • 2.5: Operators and Operands
        • 2.6: Expressions
        • 2.7: Order of Operations
        • 2.8: Modulus Operator
        • 2.9: String Operations
        • 2.E: Variables, Expressions, and Statements (Exercises)
        • 2.G: Glossary
        • 2.10: Asking the user for input
        • 2.11: Comments
        • 2.12: Choosing Mnemonic Variable Names
        • 2.13: Debugging
      • 3: Conditional Execution
        • 3.1: Boolean Expressions
        • 3.2: Logical Operators
        • 3.3: Conditional Execution
        • 3.4: Alternative Execution
        • 3.5: Chained Conditionals
        • 3.6: Nested Conditionals
        • 3.7: Catching exceptions Using Try and Except
        • 3.8: Short-Circuit Evaluation of Logical Expressions
        • 3.9: Debugging
        • 3.E: Conditional Execution (Exercises)
        • 3.G: Conditional Execution (Glossary)
      • 4: Functions
        • 4.1: Function Calls
        • 4.2: Built-in Functions
        • 4.3: Type Conversion Functions
        • 4.4: Random Numbers
        • 4.5: Math Functions
        • 4.6: Adding New Functions
        • 4.7: Definitions and Uses
        • 4.8: Flow of Execution
        • 4.9: Parameters and Arguments
        • 4.E: Functions (Exercises)
        • 4.G: Functions (Glossary)
        • 4.10: Fruitful functions and void functions
        • 4.11: Why functions?
        • 4.12: Debugging
      • 5: Iterations
        • 5.1: Updating Variables
        • 5.2: The while Statement
        • 5.3: Infinite Loops
        • 5.4: "Infinite loops" and break
        • 5.5: Finishing iterations with continue
        • 5.6: Definite loops using for
        • 5.7: Loop patterns
        • 5.8: Counting and Summing Loops
        • 5.9: Maximum and Minimum Loops
        • 5.E: Iterations (Exercises)
        • 5.G: Iterations (Glossary)
        • 5.10: Debugging
      • 6: Strings
        • 6.1: A string is a sequence
        • 6.2: Getting the length of a string using len
        • 6.3: Traversal through a string with a loop
        • 6.4: String Slices
        • 6.5: Strings are immutable
        • 6.6: Looping and Counting
        • 6.7: The in operator
        • 6.8: String Comparison
        • 6.9: String Methods
        • 6.E: Strings (Exercises)
        • 6.G: Strings (Glossary)
        • 6.10: Parsing strings
        • 6.11: Format operator
        • 6.12: Debugging
      • 7: Files
        • 7.1: Persistence
        • 7.2: Opening Files
        • 7.3: Text files and Lines
        • 7.4: Reading Files
        • 7.5: Searching through a File
        • 7.6: Letting the user choose the file name
        • 7.7: Using try, except, and open
        • 7.8: Writing Files
        • 7.9: Debugging
        • 7.E: Files (Exercises)
        • 7.G: Files (Glossary)
      • 8: Lists
        • 8.1: A list is a sequence
        • 8.2: Lists are mutable
        • 8.3: Traversing a List
        • 8.4: List operations
        • 8.5: List Slices
        • 8.6: List Methods
        • 8.7: Deleting Elements
        • 8.8: Lists and Functions
        • 8.9: Lists and Strings
        • 8.E: Lists (Exercises)
        • 8.G: Lists (Glossary)
        • 8.10: Parsing lines
        • 8.11: Objects and Values
        • 8.12: Aliasing
        • 8.13: List arguments
        • 8.14: Debugging
      • 9: Dictionaries
        • 9.1: Dictionaries
        • 9.2: Dictionary as a Set of Counters
        • 9.3: Dictionaries and Files
        • 9.4: Looping and Dictionaries
        • 9.5: Advanced Text Parsing
        • 9.6: Debugging
        • 9.E: Dictionaries (Exercises)
        • 9.G: Dictionaries (Glossary)
      • 10: Tuples
        • 10.1: Tuples are Immutable
        • 10.2: Comparing Tuples
        • 10.3: Tuple Assignment
        • 10.4: Dictionaries and Tuples
        • 10.5: Multiple assignment with dictionaries
        • 10.6: The most common words
        • 10.7: Using Tuples as Keys in Dictionaries
        • 10.8: Sequences- strings, lists, and tuples - Oh My!
        • 10.9: Debugging
        • 10.E: Tuples (Exercises)
        • 10.G: Tuples (Glossary)
      • 11: Regular Expressions
        • 11.1: Regular Expressions
        • 11.2: Character matching in regular expressions
        • 11.3: Extracting data using regular expressions
        • 11.4: Combining searching and extracting
        • 11.5: Escape Character
        • 11.6: Bonus section for Unix / Linux users
        • 11.7: Debugging
        • 11.E: Regular Expressions (Exercises)
        • 11.G: Regular Expressions (Glossary)
        • 11.S: Regular Expressions (Summary)
      • 12: Networked Programs
        • 12.1: HyperText Transfer Protocol - HTTP
        • 12.2: The World's Simplest Web Browser
        • 12.3: Retrieving an image over HTTP
        • 12.4: Retrieving web pages with urllib
        • 12.5: Parsing HTML and scraping the web
        • 12.6: Parsing HTML using regular expressions
        • 12.7: Parsing HTML using BeautifulSoup
        • 12.8: Reading binary files using urllib
        • 12.E: Networked Programs (Exercises)
        • 12.G: Networked Programs (Glossary)
      • 13: Python and Web Services
        • 13.1: eXtensible Markup Language - XML
        • 13.2: Looping through Nodes
        • 13.3: JavaScript Object Notation - JSON
        • 13.4: Parsing JSON
        • 13.5: Application Programming Interfaces
        • 13.6: Google geocoding web service
        • 13.7: Security and API usage
        • 13.E: Python and Web Services (Exercises)
        • 13.G: Python and Web Services (Glossary)
      • 14: Object-Oriented Programming
        • 14.1: Managing Larger Programs
        • 14.2: Getting Started
        • 14.3: Using Objects
        • 14.4: Starting with Programs
        • 14.5: Subdividing a Problem - Encapsulation
        • 14.6: Our First Python Object
        • 14.7: Classes as Types
        • 14.8: Many Instances
        • 14.9: Object Lifecycle
        • 14.G: Object-Oriented Programming (Glossary)
        • 14.S: Object-Oriented Programming (Summary)
        • 14.10: Inheritance
      • 15: Using Databases and SQL
        • 15.1: What is a database?
        • 15.2: Database Concepts
        • 15.3: Database Browser for SQLite
        • 15.4: Creating a database table
        • 15.5: Structured Query Language summary
        • 15.6: Spidering Twitter using a database
        • 15.7: Basic data modeling
        • 15.8: Programming with Multiple Tables
        • 15.9: Constraints in Database Tables
        • 15.G: Using Databases and SQL (Glossary)
        • 15.S: Using Databases and SQL (Summary)
        • 15.10: Retrieve and/or insert a record
        • 15.11: Storing the friend relationship
        • 15.12: Three Kinds of Keys
        • 15.13: Using JOIN to retrieve data
        • 15.14: Degugging
      • 16: Visualizing data
        • 16.1: Building a Google map from geocoded data
        • 16.2: Visualizing Networks and Interconnections
        • 16.3: Visualizing mail data
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • Back Matter
    • Book: Making Games with Python and Pygame (Sweigart)
      • Front Matter
      • 0: Introduction
        • 0.1: Who Is This Book For?
        • 0.2: About This Book
      • 1: Installing Python and Pygame
        • 1.01: What You Should Know Before You Begin
        • 1.02: Downloading and Installing Python
        • 1.03: Windows Instructions
        • 1.04: Mac OS X Instructions
        • 1.05: Ubuntu and Linux Instructions
        • 1.06: Starting Python
        • 1.07: Installing Pygame
        • 1.08: How to Use This Book
        • 1.09: The Featured Programs
        • 1.10: Downloading Graphics and Sound Files
        • 1.11: Line Numbers and Spaces
        • 1.12: Text Wrapping in This Book
        • 1.13: Checking Your Code Online
        • 1.14: More Info Links on invpy.com
      • 2: Pygame Basics
        • 2.01: GUI vs. CLI
        • 2.02: Source Code for Hello World with Pygame
        • 2.03: Setting Up a Pygame Program
        • 2.04: Game Loops and Game States
        • 2.05: pygame.event.Event Objects
        • 2.06: The QUIT Event and pygame.quit() Function
        • 2.07: Pixel Coordinates
        • 2.08: A Reminder About Functions, Methods, Constructor Functions, and Functions in Modules (and the Difference Between Them)
        • 2.09: Surface Objects and The Window
        • 2.10: Colors
        • 2.11: Transparent Colors
        • 2.12: pygame.Color Objects
        • 2.13: Rect Objects
        • 2.14: Primitive Drawing Functions
        • 2.15: pygame.PixelArray Objects
        • 2.16: The pygame.display.update() Function
        • 2.17: Animation
        • 2.18: Frames Per Second and pygame.time.Clock Objects
        • 2.19: Drawing Images with pygame.image.load() and blit()
        • 2.20: Fonts
        • 2.21: Anti-Aliasing
        • 2.22: Playing Sounds
        • 2.23: Summary
      • 3: Memory Puzzle
        • 3.01: How to Play Memory Puzzle
        • 3.02: Nested for Loops
        • 3.03: Source Code of Memory Puzzle
        • 3.04: Credits and Imports
        • 3.05: Magic Numbers are Bad
        • 3.06: Sanity Checks with assert Statements
        • 3.07: Telling If a Number is Even or Odd
        • 3.08: Crash Early and Crash Often!
        • 3.09: Making the Source Code Look Pretty
        • 3.10: Using Constant Variables Instead of Strings
        • 3.11: Making Sure We Have Enough Icons
        • 3.12: Tuples vs. Lists, Immutable vs. Mutable
        • 3.13: One Item Tuples Need a Trailing Comma
        • 3.14: Converting Between Lists and Tuples
        • 3.15: The global Statement, and Why Global Variables are Evil
        • 3.16: Data Structures and 2D Lists
        • 3.17: The “Start Game” Animation
        • 3.18: The Game Loop
        • 3.19: The Event Handling Loop
        • 3.20: Checking Which Box The Mouse Cursor is Over
        • 3.21: Handling the First Clicked Box
        • 3.22: Handling a Mismatched Pair of Icons
        • 3.23: Handling If the Player Won
        • 3.24: Drawing the Game State to the Screen
        • 3.25: Creating the “Revealed Boxes” Data Structure
        • 3.26: Creating the Board Data Structure: Step 1 – Get All Possible Icons
        • 3.27: Step 2 – Shuffling and Truncating the List of All Icons
        • 3.28: Step 3 – Placing the Icons on the Board
        • 3.29: Splitting a List into a List of Lists
        • 3.30: Different Coordinate Systems
        • 3.31: Converting from Pixel Coordinates to Box Coordinates
        • 3.32: Drawing the Icon, and Syntactic Sugar
        • 3.33: Syntactic Sugar with Getting a Board Space’s Icon’s Shape and Color
        • 3.34: Drawing the Box Cover
        • 3.35: Handling the Revealing and Covering Animation
        • 3.36: Drawing the Entire Board
        • 3.37: Drawing the Highlight
        • 3.38: The "Start Game" Animation
        • 3.39: Revealing and Covering the Groups of Boxes
        • 3.40: The “Game Won” Animation
        • 3.41: Telling if the Player Has Won
        • 3.42: Why Bother Having a main() Function?
        • 3.43: Why Bother With Readability?
        • 3.44: Summary, and a Hacking Suggestion
      • 4: Slide Puzzle
        • 4.01: How to Play Slide Puzzle
        • 4.02: Source Code to Slide Puzzle
        • 4.03: Second Verse, Same as the First
        • 4.04: Setting Up the Buttons
        • 4.05: Being Smart By Using Stupid Code
        • 4.06: The Main Game Loop
        • 4.07: Clicking on the Buttons
        • 4.08: Sliding Tiles with the Mouse
        • 4.09: Sliding Tiles with the Keyboard
        • 4.10: “Equal To One Of” Trick with the in Operator
        • 4.11: WASD and Arrow Keys
        • 4.12: Actually Performing the Tile Slide
        • 4.13: IDLE and Terminating Pygame Programs
        • 4.14: Checking for a Specific Event, and Posting Events to Pygame’s Event Queue
        • 4.15: Creating the Board Data Structure
        • 4.16: Not Tracking the Blank Position
        • 4.17: Making a Move by Updating the Board Data Structure
        • 4.18: When NOT to Use an Assertion
        • 4.19: Getting a Not-So-Random Move
        • 4.20: Converting Tile Coordinates to Pixel Coordinates
        • 4.21: Converting from Pixel Coordinates to Board Coordinates
        • 4.22: Drawing a Tile
        • 4.23: The Making Text Appear on the Screen
        • 4.24: Drawing the Board
        • 4.25: Drawing the Border of the Board
        • 4.26: Drawing the Buttons
        • 4.27: Animating the Tile Slides
        • 4.28: The copy() Surface Method
        • 4.29: Creating a New Puzzle
        • 4.30: Animating the Board Reset
        • 4.31: Time vs. Memory Tradeoffs
        • 4.32: Nobody Cares About a Few Bytes
        • 4.33: Nobody Cares About a Few Million Nanoseconds
        • 4.34: Summary
      • 5: Simulate
        • 5.01: How to Play Simulate
        • 5.02: Source Code to Simulate
        • 5.03: The Usual Starting Stuff
        • 5.04: Setting Up the Buttons
        • 5.05: The main() Function
        • 5.06: Some Local Variables Used in This Program
        • 5.07: Drawing the Board and Handling Input
        • 5.08: Checking for Mouse Clicks
        • 5.09: Checking for Keyboard Presses
        • 5.10: The Two States of the Game Loop
        • 5.11: Figuring Out if the Player Pressed the Right Buttons
        • 5.12: Epoch Time
        • 5.13: Drawing the Board to the Screen
        • 5.14: Same Old terminate() Function
        • 5.15: Reusing The Constant Variables
        • 5.16: Animating the Button Flash
        • 5.17: Drawing the Buttons
        • 5.18: Animating the Background Change
        • 5.19: The Game Over Animation
        • 5.20: Converting from Pixel Coordinates to Buttons
        • 5.21: Explicit is Better Than Implicit
      • 6: Wormy
        • 6.01: How to Play Wormy
        • 6.02: Source Code to Wormy
        • 6.03: The Grid
        • 6.04: The Setup Code
        • 6.05: The main() Function
        • 6.06: A Separate runGame() Function
        • 6.07: The Event Handling Loop
        • 6.08: Collision Detection
        • 6.09: Detecting Collisions with the Apple
        • 6.10: Moving the Worm
        • 6.11: The insert() List Method
        • 6.12: Drawing the Screen
        • 6.13: Drawing “Press a key” Text to the Screen
        • 6.14: The checkForKeyPress() Function
        • 6.15: The Start Screen
        • 6.16: Rotating the Start Screen Text
        • 6.17: Rotations Are Not Perfect
        • 6.18: Deciding Where the Apple Appears
        • 6.19: Game Over Screens
        • 6.20: Drawing Functions
        • 6.21: Don’t Reuse Variable Names
      • 7: Tetromino
        • 7.01: How to Play Tetromino
        • 7.02: Some Tetromino Nomenclature
        • 7.03: Source Code to Tetromino
        • 7.04: The Usual Setup Code
        • 7.05: Setting up Timing Constants for Holding Down Keys
        • 7.06: More Setup Code
        • 7.07: Setting Up the Piece Templates
        • 7.08: Splitting a “Line of Code” Across Multiple Lines
        • 7.09: The main() Function
        • 7.10: The Start of a New Game
        • 7.11: The Game Loop
        • 7.12: The Event Handling Loop
        • 7.13: Pausing the Game
        • 7.14: Using Movement Variables to Handle User Input
        • 7.15: Checking if a Slide or Rotation is Valid
        • 7.16: Finding the Bottom
        • 7.17: Moving by Holding Down the Key
        • 7.18: Letting the Piece “Naturally” Fall
        • 7.19: Drawing Everything on the Screen
        • 7.20: makeTextObjs(), A Shortcut Function for Making Text
        • 7.21: The Same Old terminate() Function
        • 7.22: Waiting for a Key Press Event with the checkForKeyPress() Function
        • 7.23: showTextScreen(), A Generic Text Screen Function
        • 7.24: The checkForQuit() Function
        • 7.25: The calculateLevelAndFallFreq() Function
        • 7.26: Generating Pieces with the getNewPiece() Function
        • 7.27: Adding Pieces to the Board Data Structure
        • 7.28: Creating a New Board Data Structure
        • 7.29: The isOnBoard() and isValidPosition() Functions
        • 7.30: Checking for, and Removing, Complete Lines
        • 7.31: Convert from Board Coordinates to Pixel Coordinates
        • 7.32: Drawing a Box on the Board or Elsewhere on the Screen
        • 7.33: Drawing Everything to the Screen
        • 7.34: Drawing the Score and Level Text
        • 7.35: Drawing a Piece on the Board or Elsewhere on the Screen
        • 7.36: Drawing the “Next” Piece
        • 7.37: Summary
      • 8: Squirrel Eat Squirrel
        • 8.01: How to Play Squirrel Eat Squirrel
        • 8.02: The Design of Squirrel Eat Squirrel
        • 8.03: Source Code to Squirrel Eat Squirrel
        • 8.04: The Usual Setup Code
        • 8.05: Describing the Data Structures
        • 8.06: The main() Function
        • 8.07: The pygame.transform.flip() Function
        • 8.08: A More Detailed Game State than Usual
        • 8.09: The Usual Text Creation Code
        • 8.10: Cameras
        • 8.11: The “Active Area”
        • 8.12: Keeping Track of the Location of Things in the Game World
        • 8.13: Starting Off with Some Grass
        • 8.14: The Game Loop
        • 8.15: Checking to Disable Invulnerability
        • 8.16: Moving the Enemy Squirrels
        • 8.17: Removing the Far Away Grass and Squirrel Objects
        • 8.18: When Deleting Items in a List, Iterate Over the List in Reverse
        • 8.19: Adding New Grass and Squirrel Objects
        • 8.20: Camera Slack, and Moving the Camera View
        • 8.21: Drawing the Background, Grass, Squirrels, and Health Meter
        • 8.22: The Event Handling Loop
        • 8.23: Moving the Player, and Accounting for Bounce
        • 8.24: Collision Detection: Eat or Be Eaten
        • 8.25: The Game Over Screen
        • 8.26: Winning
        • 8.27: Drawing a Graphical Health Meter
        • 8.28: The Same Old terminate() Function
        • 8.29: The Mathematics of the Sine Function
        • 8.30: Backwards Compatibility with Python Version 2
        • 8.31: The getRandomVelocity() Function
        • 8.32: Finding a Place to Add New Squirrels and Grass
        • 8.33: Creating Enemy Squirrel Data Structures
        • 8.34: Flipping the Squirrel Image
        • 8.35: Creating Grass Data Structures
        • 8.36: Checking if Outside the Active Area
        • 8.37: Summary
      • 9: Star Pusher
        • 9.01: How to Play Star Pusher
        • 9.02: Source Code to Star Pusher
        • 9.03: The Initial Setup
        • 9.04: Data Structures in Star Pusher
        • 9.05: The “Game State” Data Structure
        • 9.06: The “Map” Data Structure
        • 9.07: The “Levels” Data Structure
        • 9.08: Reading and Writing Text Files
        • 9.09: Text Files and Binary Files
        • 9.10: Writing to Files
        • 9.11: Reading from Files
        • 9.12: About the Star Pusher Map File Format
        • 9.13: Recursive Functions
        • 9.14: Stack Overflows
        • 9.15: Preventing Stack Overflows with a Base Case
        • 9.16: The Flood Fill Algorithm
        • 9.17: Drawing the Map
        • 9.18: Checking if the Level is Finished
        • 9.19: Summary
      • 10: Four Extra Games
        • 10.01: Flippy, an “Othello” Clone
        • 10.02: Source Code for Flippy
        • 10.03: Ink Spill, a “Flood It” Clone
        • 10.04: Source Code for Ink Spill
        • 10.05: Four-In-A-Row, a “Connect Four” Clone
        • 10.06: Source Code for Four-In-A-Row
        • 10.07: Gemgem, a “Bejeweled” Clone
        • 10.08: Source Code for Gemgem
        • 10.09: Summary
      • Back Matter
        • About the Author
        • Glossary
    • Book: Web Development and Programming (Mendez)
      • 1: Web Development
        • 1.1: Brief History of the Internet
        • 1.2: Current Trends
        • 1.3: Web Servers
        • 1.4: Network Basics
        • 1.5: Website Design
        • 1.6: Development
        • 1.E: Web Development (Exercises)
      • 2: Document Makeup
        • 2.1: Markup Languages
        • 2.2: Creating HTML Files
        • 2.3: Page Layout
        • 2.4: Text Layout
        • 2.5: Navigation
        • 2.6: Graphics
        • 2.7: Tables
        • 2.8: Forms
        • 2.9: Canvas
        • 2.10: Media Support
        • 2.11: Mobile Device Support
        • 2.12: Tags to Avoid
        • 2.13: Rule Structure
        • 2.14: Layout Formatting
          • 2.14.6: Positioning Demonstration
        • 2.15: Font and Text Decoration
        • 2.16: Responsive Styling
        • 2.E: Document Makeup (Exercise)
      • 3: Scripting Language
        • 3.1: Server-Side and Client-Side Scripting
        • 3.2: Creating PHP Files
        • 3.3: PHP Errors
        • 3.4: PHP Output
        • 3.5: Data Storage
        • 3.6: Data Manipulation
        • 3.7: Email
        • 3.8: File Interaction
        • 3.9: Structures
        • 3.10: Functions
        • 3.11: JavaScript Syntax
        • 3.12: JavaScript Examples
        • 3.13: jQuery
        • 3.E: Scripting Language (Exercises)
      • 4: Persistent Data Storage
        • 4.1: Database Types
        • 4.2: Data Relationships
        • 4.3: MySQL Data Types
        • 4.4: Normalization
        • 4.5: MySQL CRUD Actions
        • 4.6: Advanced Queries
        • 4.E: Persistent Data Storage (Exercises)
      • 5: Tying it Together
        • 5.1: Security
        • 5.2: Integration Examples
        • 5.3: Finishing Touches
        • 5.4: Now What?
      • Glossary of Terms
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • Back Matter
    • Book: Database Design (Watt and Eng)
      • Front Matter
        • TitlePage
        • InfoPage
        • Table of Contents
      • About the Authors
      • About the Book
      • Acknowledgements
      • Appendix A University Registration Data Model Example
      • Appendix B Sample ERD Exercises
      • Appendix C SQL Lab with Solution
      • Chapter 10 ER Modelling
      • Chapter 11 Functional Dependencies
      • Chapter 12 Normalization
      • Chapter 13 Database Development Process
      • Chapter 14 Database Users
      • Chapter 15 SQL Structured Query Language
      • Chapter 16 SQL Data Manipulati