Toxicology studies the injurious effects of chemical and physical agents (including energy) on living organisms, observed as alterations in structure and function. The variety of injurious effects becomes apparent if we examine the major causes of death (Fl .I). Many of these diseases are caused or accelerated by exposure to toxic substances. Toxicity data from various bio-medical sciences document the effects of exposure to natural• or artificial agents.
From the authors, “All in all, we hope that you find Educational Psychology a useful and accessible part of your education. If you are preparing to be a teacher, good luck with your studies and your future! If you are an instructor, good luck with helping your students learn about this subject!”
Purchase print copy $49.95 (365 pages, 12 chapters, see table of contents below)
Nievergelt, “Algorithms and Data Structures – With Applications to Graphics and Geometry” (2011)
An Open Textbook by Jurg Nievergelt and Klaus Hinrichs
“An introductory coverage of algorithms and data structures with application to graphics and geometry.”
This textbook, released under a Creative Commons Share Alike (CC BY SA) license, is presented in its original format with the academic content unchanged. It was authored by Jurg Nievergelt (ETH Zurich) and Klaus Hinrichs (Institut für Informatik) and provided by the University of Georgia’s Global Textbook Project.
Part I: Programming environments for motion, graphics, and geometry
Reducing a task to given primitives: programming motion
A robot car, its capabilities, and the task to be performed
Wall-following algorithm described informally
Algorithm specified in a high-level language
Algorithm programmed in the robot’s language
The robot’s program optimized
Graphics primitives and environments
Turtle graphics: a basic environment
QuickDraw: a graphics toolbox
A graphics frame program
Algorithm animation
Computer-driven visualization: characteristics and techniques
A gallery of algorithm snapshots
Part II: Programming concepts: beyond notation
Algorithms and programs as literature: substance and form
Programming in the large versus programming in the small
Documentation versus literature: is it meant to be read?
Pascal and its dialects: lingua franca of computer science
Divide-and-conquer and recursion
An algorithmic principle
Divide-and-conquer expressed as a diagram: merge sort
Recursively defined trees
Recursive tree traversal
Recursion versus iteration: the Tower of Hanoi
The flag of Alfanumerica: an algorithmic novel on iteration and recursion
Syntax
Syntax and semantics
Grammars and their representation: syntax diagrams and EBNF
An overly simple syntax for simple expressions
Parenthesis-free notation for arithmetic expressions
Syntax analysis
The role of syntax analysis
Syntax analysis of parenthesis-free expressions by counting
Analysis by recursive descent
Turning syntax diagrams into a parser
Part III: Objects, algorithms, programs
Truth values, the data type ‘set’, and bit acrobatics
Bits and boolean functions
Swapping and crossovers: the versatile exclusive-or
The bit sum or “population count”
Ordered sets
Sequential search
Binary search
In-place permutation
Strings
Recognizing a pattern consisting of a single string
Paths in a graph
Boolean matrix multiplication
Warshall’s algorithm
Minimum spanning tree in a graph
Integers
Operations on integers
The Euclidean algorithm
The prime number sieve of Eratosthenes
Large integers
Modular number systems: the poor man’s large integers
Random numbers
Reals
Floating-point numbers
Some dangers
Horner’s method
Bisection
Newton’s method for computing the square root
Straight lines and circles
Intersection
Clipping
Drawing digitized lines
The riddle of the braiding straight lines
Digitized circles
Part IV: Complexity of problems and algorithms
Computability and complexity
Models of computation: the ultimate RISC
Almost nothing is computable
The halting problem is undecidable
Computable, yet unknown
Multiplication of complex numbers
Complexity of matrix multiplication
The mathematics of algorithm analysis
Growth rates and orders of magnitude
Asymptotics
Summation formulas
Recurrence relations
Asymptotic performance of divide-and-conquer algorithms
Permutations
Trees
Sorting and its complexity
What is sorting? How difficult is it?
Types of sorting algorithms
Simple sorting algorithms that work in time T(n)
A lower bound O(n · log n)
Quicksort
Analysis for three cases: best, “typical”, and worst
Is it possible to sort in linear time?
Sorting networks
Part V: Data structures
What is a data structure?
Data structures old and new
The range of data structures studied
Performance criteria and measures
Abstract data types
Concepts: What and why?
Stack
First-in-first-out queue
Priority queue
Dictionary
Implicit data structures
What is an implicit data structure?
Array storage
Implementation of the fixed-length fifo queue as a circular buffer
Implementation of the fixed-length priority queue as a heap
Heapsort
List structures
Lists, memory management, pointer variables
The fifo queue implemented as a one-way list
Tree traversal
Binary search trees
Height-balanced trees
Address computation
Concepts and terminology
The special case of small key domains
The special case of perfect hashing: table contents known a priori
Conventional hash tables: collision resolution
Choice of hash function: randomization
Performance analysis
Extendible hashing
A virtual radix tree: order-preserving extendible hashing
Metric data structures
Organizing the embedding space versus organizing its contents
Radix trees, tries
Quadtrees and octtrees
Spatial data structures: objectives and constraints
The grid file
Simple geometric objects and their parameter spaces
Region queries of arbitrary shape
Evaluating region queries with a grid file
Interaction between query processing and data access
Part VI: Interaction between algorithms and data structures: case studies in geometric computation
Sample problems and algorithms
Geometry and geometric computation
Convex hull: a multitude of algorithms
The uses of convexity: basic operations on polygons
Visibility in the plane: a simple algorithm whose analysis is not
Plane-sweep: a general-purpose algorithm for two-dimensional problems illustrated using line segment intersection
The line segment intersection test
The skeleton: Turning a space dimension into a time dimension
Data structures
Updating the y-table and detecting an intersection
Sweeping across intersections
Degenerate configurations, numerical errors, robustness
The closest pair
The problem
Plane-sweep applied to the closest pair problem
Implementation
Analysis
Sweeping in three or more dimensions
James Feher,”Introduction to Digital Logic” with Laboratory Exercises (2010)
This lab manual provides an introduction to digital logic, starting with simple gates and building up to state machines. Students should have a solid understanding of algebra as well as a rudimentary understanding of basic electricity including voltage, current, resistance, capacitance, inductance and how they relate to direct current circuits.
This textbook is designed as a quick reference for “College Biology” volumes one through three. It contains the “Chapter Summary”, “Art Connection”, “Review”, and “Critical Thinking” Exercises found in each of the three volumes. It also contains the COMPLETE alphabetical listing of the key terms. “College Biology”, intended for capable college students, is adapted from OpenStax College’s open (CC BY) textbook “Biology”. It is Textbook Equity’s derivative to ensure continued free and open access, and to provide low cost print formats. For manageability and economy, Textbook Equity created three volumes from the original that closely match typical semester or quarter biology curriculum. No academic content was changed from the original. See textbookequity.org/tbq_biology This supplement covers all 47 chapters.
Chapter 1: The Study of Life
Chapter 2: The Chemical Foundation of Life
Chapter 3: Biological Macromolecules
Unit 2. The Cell
Chapter 4: Cell Structure
Chapter 5: Structure and Function of Plasma Membranes
Chapter 6: Metabolism
Chapter 7: Cellular Respiration
Chapter 8: Photosynthesis
Chapter 9: Cell Communication
Chapter 10: Cell Reproduction
Unit 3. Genetics
Chapter 11: Meiosis and Sexual Reproduction
Chapter 12: Mendel’s Experiments and Heredity
Chapter 13: Modern Understandings of Inheritance
Chapter 14: DNA Structure and Function
Chapter 15: Genes and Proteins
Chapter 16: Gene Expression
Chapter 17: Biotechnology and Genomics
Advantages of Adopting this Textbook
Price. PDFs are free. Printed books only $39.00*. Funds beyond costs go to the evaluation and creation of additional free and inexpensive printed open textbooks.
Comparable biology textbooks cost $180 – $225.**
Class relevant. Adopt only the volumes you need. Make the textbook yours.
Comprehensive with current content.
Pedagogically enhanced.
Authored and reviewed by the academic community.
Original textbook prepared, published, copyrighted, and released with an open license (CC BY) by Rice University’s Openstax College.
Text is available in various e-formats at Rice University’s Connexions (cnx.org)
Open licensed. Fearlessly copy, print, remix. Add to it. Take away. Rearrange. Create class-specific content. (Textbook Equity can help you with that.)
Advantages of Buying a PRINTED Copy
Easier to read and navigate.
You have the right to give or sell the book to others.
You can mark it, copy pages, tear out pages, and use it for kindling.
It looks more impressive on your bookshelf than a blank, dusty space.
You can read it anytime you wish, even decades later.
There may be a secondary market.
Honestly, you know the benefits of having a ” hard copy.”
Features of All Volumes
Chapter summaries.
Review questions.
Critical thinking questions.
Answer keys.
Key terms by chapter.
Embedded supplemental learning links.
Attributions, credits, and textbook provenance.
*Price at Lulu.com Other sources may be higher.
** For textbook price comparisons see “Anatomy of a Textbook“.
***Printed in high quality grayscale to keep costs low.
Principles of Economics covers the scope and sequence for a two-semester principles of economics course. The text also includes many current examples, including; discussions on the great recession, the controversy among economists over the Affordable Care Act (Obamacare), the recent government shutdown, and the appointment of the United States’ first female Federal Reserve chair, Janet Yellen.
The pedagogical choices, chapter arrangements, and learning objective fulfillment were developed and vetted with feedback from educators dedicated to the project. The outcome is a balanced approach to micro and macro economics, to both Keynesian and classical views, and to the theory and application of economics concepts. Current events are treated in a politically-balanced way, as well.
Table of Contents
Volume 1 Chapter 1 – 23
Welcome to Economics!
Choice in a World of Scarcity
Demand and Supply
Labor and Financial Markets
Elasticity
Consumer Choices
Cost and Industry Structure
Perfect Competition
Monopoly
Monopolistic Competition and Oligopoly
Monopoly and Antitrust Policy
Environmental Protection and Negative Externalities
Positive Externalities and Public Goods
Poverty and Economic Inequality
Issues in Labor Markets: Unions, Discrimination, Immigration
Information, Risk, and Insurance
Financial Markets
Public Choice
The Macroeconomic Perspective
Economic Growth
Unemployment
Inflation
The International Trade and Capital Flows
Volume 2 Chapters 24 – 34 and Appendices
The Aggregate Supply-Aggregate Demand Model
The Keynesian Perspective
The Neoclassical Perspective
Money and Banking
Monetary Policy and Bank Regulation
Exchange Rates and International Capital Flows
Government Budgets and Fiscal Policy
The Macroeconomic Impacts of Government Borrowing
Macroeconomic Policy Around the World
International Trade
Globalization and Protectionism
The Use of Mathematics in Principles of Economics
Demand, Supply, and Efficiency
Indifference Curves
Present Discounted Value
The Expenditure-Output Model
From their website: “Introduction to Sociology is intended for a one-semester introductory sociology course. Conceived of and developed by active sociology instructors,. This online, fully editable and customizable title includes sociology theory and research; real-world applications; simplify and debate features; and learning objectives for each chapter.”
Peer reviewed plus faculty supplements.
Table of Contents
Preface
An Introduction to Sociology
Sociological Research
Culture
Society and Social Interaction
Socialization
Groups and Organization
Deviance, Crime, and Social Control
Media and Technology
Social Stratification in the United States
Global Inequality
Race and Ethnicity
Gender, Sex, and Sexuality
Aging and the Elderly
Marriage and Family
Religion
Education
Government and Politics
Work and the Economy
Health and Medicine
Population, Urbanization, and the Environment
Social Movements and Social Change
This open textbook aims to fill the gap between the open-source implementations and the open-source network specifications by providing a detailed but pedagogical description of the key principles that guide the operation of the Internet. The book is released under a creative commons licence. Such an open-source license is motivated by two reasons. The first is that we hope that this will allow many students to use the book to learn computer networks. The second is that I hope that other teachers will reuse, adapt and improve it. Time will tell if it is possible to build a community of contributors to improve and develop the book further. As a starting point, the first release contains all the material for a one-semester first upper undergraduate or a graduate networking course.
Table of Contents
1 Preface
2 Introduction
2.1 Services and protocols
2.2 The reference models
2.3 Organisation of the book
3 The application Layer
3.1 Principles
3.2 Application-level protocols
3.3 Writing simple networked applications
4 The transport layer
4.1 Principles of a reliable transport protocol
4.2 The User Datagram Protocol
4.3 The Transmission Control Protocol
5 The network layer
5.1 Principles
5.2 Internet Protocol
5.3 Routing in IP networks
6 The datalink layer and the Local Area Networks
6.1 Principles
6.2 Medium Access Control
6.3 Datalink layer technologies
7 Glossary
8 Bibliography
(CC BY) This is an introduction to linear algebra. The main part of the book features row operations and everything is done in terms of the row reduced echelon form and specific algorithms. At the end, the more abstract notions of vector spaces and linear transformations on vector spaces are presented. However, this is intended to be a first course in linear algebra for students who are sophomores or juniors who have had a course in one variable calculus and a reasonable background in college algebra.
Fearlessly Copy, Print, Remix ™ "Barriers to education, whether intentional or not, by policy or price, decays humanity."
“Computer Networking : Principles, Protocols and Practice”