CALCULATORS ON-LINE CENTER COMPUTER ENGINEERING: Com-D

COMPUTER ARCHITECTURE COURSES, LECTURES, TEXTBOOKS, ETC.

Introduction to Computer Architecture Tutorials


COMPUTER ARCHITECTURE TUTORIAL – G.M. Prabhu,
Department of Computer http://www.health-canada-pharmacy.com Science,
College of Liberal Arts & Sciences,
Iowa State University
Multimedia Computer Architecture Tutorial – a supplementary learning tool for students of Com S 321 (Text, Images & Applets).
VERY VERY EXTENSIVE.

Computer Architecture Tutorial

“…introduces undergraduate students to computer architecture concepts
of caches and pipelining. It contains examples, interactive applets
and some problems with solutions to illustrate basic ideas…”

Examples of “Computer Architecture Tutorial” Chapters & Subchapters include

Computer Performance;

Memory Hierarchy Design
“…Principles and Levels;

Block Placement;

Block Identification;

Interaction with Memeory; etc…”

Pipelining

“…Classification of Instruction Sets;

Addressing Modes;

DLX architecture;

Basic Performance Issues in Pipelining;

Pipeline Hazards;

Pipeline with Multicycle Operations; etc…”

For more information see

Gurpur Prabhu’s Home Page;

Gurpur Prabhu’s Faculty Home Page or the

Department of Computer Science

Introduction to Computer Architecture Courses, Textbooks, Lectures, etc.


INTRODUCTION TO COMPUTER ARCHITECTURE – 2015 (18-447) – Department of Electrical and Computer Engineering,
College of Engineering,
Carnegie Mellon University
Multimedia Introduction to Computer Architecture Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Examples from over “29” “Introduction to Computer Architecture” Course PDF, PPT & Video Lectures include

“…Fundamental Concepts and ISA;

ISA Tradeoffs;

Introdution to Microarchitecture: Single-Cycle;

Multi-Cycle and Microprogrammed Microarchitectures;

Pipelining II: Data and Control Dependence Handling;

Precise Exceptions, State Maintenance, State Recovery;

GPUs, VLIW, DAE;

Caches, Caches, Caches;

Memory Management;

Memory Consistency and Cache Coherence; etc…”

For more information see

Introduction to Computer Architecture Course Home Page or the

Department of Electrical and Computer Engineerings


GREAT IDEAS IN COMPUTER AARCHITECTURE – 2015 (CS61C) – K. Asanovi?,
Computer Science Division,
Department of Electrical Engineering and Computer Sciences,
College of Engineering,
University of California, Berkeley
Multimedia Great Ideas in Computer Architecture Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Great Ideas in Computer Architecture” Course Lectures include

“…C Arrays, Strings, Pointers;

MIPS, MIPS Functions;

Compiler, Assembler, Linker, Loader (CALL)S;

MIPS Single-Cycle Control, Pipelining Introduction;

Memory Hierarchy, Fully Associative Caches;

Performance, Floating Point, Tech Trends;

Flynn Taxonomy, Data-Level Parallelism;

Warehouse Scale Computing, MapReduce;

I/O: DMA, Disks, Networking; etc…”

For more information see

Krste Asanovi? Teaching;

Krste Asanovi? Home Page;

Computer Science Division or the

Department of Electrical Engineering and Computer Sciences

Graduate Computer Architecture, Systems Architecture Courses, Textbooks, etc.


GRADUATE COMPUTER ARCHITECTURE – 2014 (CS 252) – K. Asanovi?,
Computer Science Division,
Department of Electrical Engineering and Computer Sciences,
College of Engineering,
University of California, Berkeley
Multimedia Graduate Computer Architecture Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Graduate Computer Architecture” Course Lectures include

“…Pipelining;

Early Out-of-Order Processing;

Modern Out-of-Order Process;

Vector Supercomputers;

VLIW Machines;

Synchronization and Memory models;

Address Translation and Protection; etc…”

For more information see

Krste Asanovi? Teaching;

Krste Asanovi? Home Page;

Computer Science Division or the

Department of Electrical Engineering and Computer Sciences

Fault Tolerant Computer Architecture

FOR FAULT TOLERANT COMPUTING ARCHITECTURE COURSES, TEXTBOOKS, TOOLS, ETC. SEE

FAULT TOLERANT COMPUTING

COMPUTER ARCHITECTURE TOOLS

COMPUTER ARCHITECTURE CALCULATORS, APPLETS, ANIMATIONS & SIMULATIONS


COMPUTER ARCHITECTURE TOOLS – I. Koren,
Department of Electrical and Computer Engineering,
College of Engineering,
University of Massachusetts
VERY VERY VERY…EXTENSIVE.
For more information see

Computer Architecture (ECE568/668) Home Page;

Israel Koren’s Home Page or the

Department of Electrical and Computer Engineering

Examples from over “20” Computer Architecture Calculators include


Multitask Cache Demonstrator

Multitask Cache Calculator

“…provides the capability to model a small sized cache
on a system that supports multitasking. In most of the modern
processors today it is often the case that multiple processes
will need to share the resources of the system. Here we will
simulate a cache on a system that supports multiple processes…”


Virtual Memory Simulator

Virtual Memory Calculator INPUT Values include:

“…Number of Memory References; Percentage of Writes; Page Size;

Main Memory Size; Virtual Memory Size; etc…”


Scoreboarding Algorithm for Dynamic Scheduling

Scoreboarding Algorithm for Dynamic Scheduling Calculator

“…has been developed for students to understand the concepts
of the Scoreboarding algorithm used for Dynamic Scheduling…”


Tomasulo’s Algorithm for Dynamic Scheduling

Tomasulo’s Algorithm for Dynamic Scheduling Calculator

“…has been developed for students to understand the concepts
of the Tomasulo’s algorithm used for Dynamic Scheduling…”


Dynamic Power Management: Disk Power Management Simulator

Dynamic Power Management: Disk Power Management Calculator INPUT Values include:

“…Disk Model (IBM, User Defined); Model; Ps; Pw; Tsd; Esd; Twu; Ewu;

Head Starting Track Number; Disk Access Track Number & Time between Disk Assesses; etc…”

DIGITAL LOGIC & DIGITAL SYSTEMS COURSES, LECTURES, TEXTBOOKS, ETC.

Digital Logic Courses, Lectures, etc.


DIGITAL LOGIC – 2015 (ECE 380) – J. Jackson,
Department of Electrical & Computer Engineering,
College of Engineering,
University of Alabama
Multimedia Digital Logic Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “30” “Digital Logic” Course Lectures include

“…Introduction to Logic Circuits: Synthesis using AND, OR, and NOT gates;

Introduction to Logic Circuits: CAD Tools and VHDL;

Optimized Implementation of Logic Functions: Multiple Output Circuits, NAND and NOR Logic Networks;

Implementation Technology: Buffers, Tri-state gates, Transmission gates;

Number Representation and Arithmetic Circuits: Number Representation and Unsigned Addition;

Combinatorial Circuit Building Blocks: Multiplexers;

Flip-Flops, Registers and Counters: Latches;

Synchronous Sequential Circuits: State Diagrams, State Tables;

VHDL for Sequential Circuits; etc…”

For more information see

Digital Logic Course Home Page;

Jeff Jackson’s Home Page or the

Department of Electrical & Computer Engineering

Digital Systems Design Courses, Lectures, etc.


DIGITAL SYSTEMS DESIGN – 2015 (ECE 480) – J. Jackson,
Department of Electrical & Computer Engineering,
College of Engineering,
University of Alabama
Multimedia Digital Systems Design Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “14” “Digital Systems Design” Course Lectures include

“…Guidelines for VHDL-based Design;

Programmable Device Technologies and Introduction to the Altera Cyclone IV FPGA;

Memory Implementation on Altera CYCLONE IV Devices;

DE2 LCD Display Controller;

Glitch-Free Clock Multiplexer;

In-System Memory Content Editor and SignalTap II Logic Analyze;

Clock Networks and Phase Lock Loops on Altera Cyclone IV Devices; etc…”

For more information see

Digital Systems Design Course Home Page;

Jeff Jackson’s Home Page or the

Department of Electrical & Computer Engineering


DIGITAL SYSTEMS DESIGN – 2013 (ELEC 4200) – C.E. Stroud,
Department of Electrical & Computer Engineering,
Samuel Ginn College of Engineering,
Auburn University
Multimedia Digital Systems Design Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Digital Systems Design” Course Lectures include

“…Flip-flops and Latches;

Programming Technologies and PALs and PLDs;

Overview of Boundary Scan and the Boundary Scan Interface in Spartan-2 FPGAs;

PicoBlaze Overview and PicoBlaze Manual and User’s Guide;

HDLs in the Design Process;

VHDL Names, Signals, and Attributes;

VHDL Hierarchical Modeling;

Parameterized RAM Modeling;

VHDL FSM Modelin; etc…”

For more information see

Charles E. Stroud’s Home Page or the

Samuel Ginn College of Engineering

Computation Structures Courses, Lectures, etc.


COMPUTATION STRUCTURES – 2018 (6.004) – S. Ward & C. Terman,
MIT Computer Architecture Group,
MIT Computer Science and Artificial Intelligence Laboratory (CSAIL),
MIT
Multimedia Computation Structures Lectures & includes Videos (Text & Images).
VERY VERY VERY…EXTENSIVE.

Computation Structures

“…is an introductory course about the design and implementation of digital systems,
emphasizing structural principles common to a wide range of technologies…”

Examples of “Computation Structures” Course Chapters include

“…CMOS Technology;

Combinational Logic;

Performance Measures;

Assembly Language;

Procedures & Stacks;

Pipelining the Beta; etc…”

For more information see

Computation Structures;

Computation Structures;

Steve Ward’s Home Page;

MIT Computer Architecture Group Home Page or the

MIT Computer Science and Artificial Intelligence Laboratory (CSAIL)

Complex Digital Systems Courses, Lectures, etc.


COMPLEX DIGITAL SYSTEMS – 2013 (6.375) – Arvind,
MIT Computer Architecture Group,
Computer Science and Artificial Intelligence Laboratory (CSAIL),
MIT
Multimedia Complex Digital Systems: Multi-Million-Gate Hardware Designs Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Complex Digital Systems Course

“…a project-oriented subject teaching a new method for designing multi-million-gate hardware designs using high-level synthesis tools in conjunction with standard commercial EDA tools….”

Examples of “Complex Digital Systems: Multi-Million-Gate Hardware Designs” Course Lectures include

“…Introduction to Bluespec;

Combinational Circuits in Bluespec;

Elastic Pipelines and Basics of Multi-rule Systems;

Elastic Pipelines: Concurrency Issues;

Modular Refinement;

Stmt FSM; etc…”

For more information see the

Complex Digital Systems Course Home Page;

Arvind’s Home Page;

MIT Computer Architecture Group Home Page or the

MIT Computer Science and Artificial Intelligence Laboratory (CSAIL)

Digital Systems Design with VHDL Courses, Lectures, etc.


VHDL MODELS, PACKAGES AND TOOLS – Free Model Foundry
Multimedia VHDL Models, Packages, Tools, etc. (Text & Images).
VERY VERY VERY…EXTENSIVE.

Digital Systems Design Calculators & Applets


DIGITAL SYSTEM DESIGN – HADES DEMONSTRATION APPLETS – Technical Aspects of Multimodal Systems (TAMS),
Department Informatics,
Faculty of Mathematics, Informatics and Natural Sciences,
University of Hamburg,
Hamburg, Germany
VERY VERY VERY…EXTENSIVE.

Hades Demonstration Applets

“…200 simulation models for digital system design are available,
from gate- and RT-level to system-level…”

Examples of “Hades Demonstration Applets” Categores & Applets include

std_logic_1164
“…Interactive Switches Applet;

Basic Gates Applet;

Clock Generator Component Applet; etc…”

Gatelevel Circuits

“…AND and NAND Gates Applet;

OR and NOR Gate Applet;

De Morgan’s Transformation Applet;

AOI and OAI Complex Gates Applet;

Dice LED Decoder Applet; etc…”

Flipflops

Master-slave JK-flipflop with Rese Applet;

Flipflop Components Demonstration Applet;

TTL-series 74273 8-bit D-type Register Applet;

Muller C-Gate Applet;

Micropipeline with C-gates Applet; etc…”

Counters;

Memories;

I/O and displays;

CMOS Circuits (switch-level); etc.

For more information see

Applets;

Technical Aspects of Multimodal Systems (TAMS) or the

Department of Informatics

COMPUTER SCIENCE (INTRODUCTION TO) COURSES, LECTURES, TEXTBOOKS; ETC.

Introduction to Computer Science


INTRODUCTION TO COMPUTER SCIENCE COURSES – 2015 – Stanford Engineering Everywhere (SEE),
School of Engineering,
Stanford University
Multimedia Introduction to Computer Science Courses (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Introduction to Computer Science Video Courses include

Programming Methodology Video Course
“…Topics focus on the introduction to the engineering of computer
applications emphasizing modern software engineering principles:
object-oriented design, decomposition, encapsulation, abstraction,
and testing…”

Programming Abstractions Video Course

“…Abstraction and its relation to programming. Software engineering principles
of data abstraction and modularity. Object-oriented programming, fundamental
data structures (such as stacks, queues, sets) and data-directed design…”

Programming Paradigms Video Course

“…Advanced memory management features of C and C++; the differences
between imperative and object-oriented paradigms. The functional
paradigm (using LISP) and concurrent programming…”

For more information see

Stanford Engineering Everywhere (SEE) or the

School of Engineering


MODELS OF COMPUTATION (CS 1010) – J. Savage,
Department of Computer Science,
Brown University
Multimedia Models of Computation Course Home Page Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “34” “Models of Computation” Course Lectures include

“…Computational Models;

Nondeterministic Computation;

Design of Logic Circuits;

Introduction to Complexity Classes;

Proving a Language NP-Complete;

Equivalence of the DFSM and FSM;

The Chomsky Language Hierarchy;

Properties of Context-Free Languages;

Limits to Language Recognition; etc…”

For more information see

Models of Computation Course Home Page;

John Savage’s Faculty Home Page;

Computer Science Courses or the

Department of Computer Science

GAME THEORY & ALGORITHMIC GAME THEORY – JOURNALS, COURSES, ETC.

Computer Science & Game Theory e-Prints


COMPUTER SCIENCE AND GAME THEORY E-PRINTS – arXiv.org
Multimedia Computer Science and Game Theory e-prints (Text & Images).
For more information see the

arXiv.org

Game Theory Journals


INTERNATIONAL JOURNAL OF GAME THEORY – Game Theory Society
Multimedia Game Theory Journal (Text & Images).
For more information see the

Game Theory Society


GAMES AND ECONOMIC BEHAVIOR – Publisher: Elsevier B.V.
Multimedia Games and Economic Behavior Journal (Text & Images).

Game Theory Courses, Lectures, etc.


GAME THEORY (ECON 159) – Ben Polak,
Department of Economics,
School of Management,
Yale University
Multimedia Game Theory Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Game Theory Course

“…is an introduction to game theory and strategic thinking. Ideas such as dominance,
backward induction, Nash equilibrium, evolutionary stability, commitment, credibility,
asymmetric information, adverse selection, and signaling are discussed and…”

Examples from over “20” “Game Theory” Course Video Lectures include

“…Nash Equilibrium: Bad Fashion and Bank Runs Video Lecture;

Nash Equilibrium: Location, Segregation and Randomization Video Lecture;

Mixed Strategies in Baseball, Dating and Paying Your Taxes Video Lecture;

Evolutionary Stability: Social Convention, Aggression, and Cycles Video Lecture;

Backward Induction: Commitment, Spies, and First-Mover Advantages Video Lecture;

Backward Induction: Ultimatums and Bargaining Video Lecture;

Subgame Perfect Equilibrium: Wars of Attrition Video Lecture; etc…”

For more information see

Open Yale Courses;

Ben Polak’s Home Page;

Department of Economics or the

Department of Economics


GAME THEORY – M.O. Jackson (Department of Economics) & Yoav Shoham (Department of Computer Science),
Stanford University
Multimedia Game Theory Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Free but Registration Required for full 9 Week Course.

Click on Preview Lectures for 1st 7 Week Lectures of the full course of 9 Weeks.

Examples of “Game Theory” Course Video Lectures include

“…Mixed Strategies and Nash Equilibrium;

Computing Mixed Nash Equilibrium;

Hardness Beyond 2×2 Games;

Strictly Dominated Strategies & Iterative Removal;

Maxmin Strategies;

Formalizing Perfect Information Extensive Form Games;

Subgame Perfection;

Subgame Perfect Application: Ultimatum Bargaining;

Imperfect Information Extensive Form: Definition, Strategies;

Bayesian Games: First Definition;

Bayesian Games: Second Definition;

Coalitional Game Theory: Definitions; etc…”

For more information see

Game Theory (Coursera);

Game Theory (Online Stanford);

Courses;

Stanford Online;

Department of Economics or the

Department of Computer Science

Algorithmic Game Theory Courses, Lectures, etc.


ALGORITHMIC GAME THEORY (CS364A) – T. Roughgarden,
Department Computer Science,
School of Engineering,
Stanford University
Multimedia Algorithmic Game Theory Course (Text, Images, Videos/Movies & Audio/Sound).

Examples from over “18” Algorithmic Game Theory Course Video Lectures include

“…Myerson’s Lemma Video Lecture;

Algorithmic Mechanism Design Video Lecture;

Simple Near-Optimal Auctions Video Lecture;

Spectrum Auctions Video Lecture;

Kidney Exchange, Stable Matching Video Lecture;

Network Over-Provisioning Video Lecture;

Hierarchy of Equilibrium Concepts Video Lecture;

Best-Case and Strong Nash Equilibria Video Lecture;

No-Regret Dynamics Video Lecture; etc…”

For more information see

Tim Roughgarden’s Home Page;

Algorithmic Game Theory Faculty;

Stanford Theory Group or the

Department of Computer Science


ALGORITHMIC GAME THEORY – 2017 (CS6840) – É. Tardos,
Department of Computer Science,
Cornell University
Multimedia Algorithmic Game Theory Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Algorithmic Game Theory” Course Lectures include

“…Hedge Algorithm for Prediction;

non-atomic congestion games and the price of anarchy;

Atomic Congestion Games and the Price of Anarchy;

Price of Stability of Cost Sharing Game;

Bayesian Nash Equilibrium and First Price Auction;

Smooth Auctions and the Price of Anarchy in Auction Games;

Price of Anarchy for GSP;

Walrasian Pricing Equilibrium;

Arrow-Debreu Market Equilibrium; etc…”

For more information see

Algorithmic Game Theory Home Page;

Éva Tardos’ Home Page or the

Department of Computer Science;

SOFTWARE ENGINEERING – SOFTWARE ENGINEERING COURSES, LECTURES, TEXTBOOKS, ETC.

SOFTWARE ENGINEERING – 2014 (CS 5150) – W.Y. Arms,
Department of Computer Science,
Cornell University
Multimedia Software Engineering Course – PDF & Videos (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Examples of “Software Engineering” Course Sections & Lectures include

Software development processes
“…Steps in the software development process;

Three types of software process; etc…”

Design

“…System architecture;

Security;

Object oriented program design;

Reuse and legacy systems;

Design patterns; etc…”

Testing and reliability; etc.

For more information see

Software Engineering Home Page or the

Department of Computer Science


INTRODUCTION TO EMBEDDED SYSTEMS – 2014 (EECS 149) – Authors: E.A. Lee & S.A. Seshia;
Department of Electrical Engineering and Computer Sciences,
College of Engineering,
University of California, Berkeley
Multimedia Introduction to Embedded Systems Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Examples of “Introduction to Embedded Systems” Course Lectures include

“…Modeling Modal Behavior;

Composition of State Machines;

Hierarchical State Machines;

Multitasking;

Operating Systems, Microkernels, and Scheduling;

Specification; Temporal Logic;

Comparing State Machines;

Execution Time Analysis;

Synchronous/Reactive Models; etc…”

For more information see

Edward A. Lee’s Home Page;

Sanjit A. Seshia’s Home Page or the

Department of Electrical Engineering and Computer Sciences

OPERATING SYSTEMS AND SYSTEMS PROGRAMMING COURSES, LECTURES, ETC.

OPERATING SYSTEMS AND SYSTEMS PROGRAMMING – 2015 (CS 162) – John Kubiatowicz,
Computer Science Division,
Department of Electrical Engineering and Computer Science,
College of Engineering,
University of California, Berkeley
Multimedia Operating Systems and Systems Programming Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Operating Systems and Systems Programming

“…The purpose of this course is to teach the design of operating systems and
operating systems concepts that appear in other advanced systems. Topics we will cover
include concepts of operating systems, systems programming, networked and distributed systems,
and storage systems, including multiple-program systems…”

Examples from over “15” “Operating Systems and Systems Programming” Course Lectures include

“…Processes, Fork, I/O, Files;

I/O Continued, Sockets, Networking;

Cooperating threads, Synchronization;

Semaphores, Condition Variables, Readers/Writers;

Deadlock, Address Translation, Virtual Memory;

Input/Output, I/O Layers, Storage DevicesI/O Performance and Low-level Optimization;

FileSystems (finished), MMAP and Reliability: ACID, 2PC; etc…”

For more information see

EECS Course WEB Sites;

John Kubiatowicz’s Home Page or the

Computer Science Division


OPERATING SYSTEMS – 2015 (CS 416) – P. Krzyzanowski,
Department of Computer Science,
School of Arts and Sciences,
Rutgers, The State University of New Jersey
Multimedia Operating Systems Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “20” “Operating Systems” Course Lectures include

“…Process states, context switching, programming processes;

Process scheduling, real-time scheduling;

Memory management: working sets, paging algorithms;

Kernel memory management;

Network protocols;

Sockets architecture;

Virtualization, Virtual machines; etc…”

For more information see

Operating Systems Course Home Page;

Paul Krzyzanowski’s Home Page or the

Department of Computer Science

CODING THEORY & ERROR CORRECTING CODES COURSES & TEXTBOOKS

CODING THEORY – 2015 – J.I. Hall,
Department of Mathematics,
Michigan State University
Multimedia Coding Theory Course (Text & Images).

Examples of “Coding Theory” Course Lectures include

Sphere Packing and Shannon’s Theorem;

Linear Codes;

Hamming Codes;

Generalized Reed-Solomon Codes;

Codes over Subfields;

Weight and Distance Enumeration; etc.

For more information see

Jonathan I. Hall’s Home Page;

Jonathan I. Hall’s Faculty Home Page or the
/
Department of Mathematics

HOW TO WRITE FAST CODE COURSES, LECTURES, TEXTBOOKS, ETC.

HOW TO WRITE FAST NUMERICAL CODE – 2015 – M. Püschel,
Department of Computer Science,
ETH Zurich,
Zurich, Switzerland
Multimedia How to Write Fast Numerical Code Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “20” “How to Write Fast Numerical Code” Course Lectures include

“…Compiler limitations;

Roofline model;

Compiler limitations;

Linear algebra, BLAS, MMM optimizations using models;

MMM optimizations related to virtual memory;

LGen: Program generator for basic linear algebra;

SIMD vector extensions continued: compiler vectorization;

Linear transforms, fast algorithms, discrete Fourier transform (DFT);

Linear algebra, BLAS, MMM optimizations using models;

Memory bound computation: Sparse linear algebra;

Optimizing Cooley-Tukey FFT, FFTW; etc…”

For more information see

Markus Püschel’s Home Page;

Markus Püschel’s Faculty Home Page or the

Department of Computer Science

A TYPEFACE DESIGNED FOR SOURCE CODE

HACK: A TYPEFACE DESIGNED FOR SOURCE CODE – Chris Simpkins


About Hack v2.010 – Chris Simpkins @ github


Open-source typeface “Hack” brings design to source code – Ars Technica – 8/20/2015

“…The days of coders being shackled to Monaco or Courier New ends now. At SourceFoundry.org
this week, programmer Chris Simpkins debuted the 2.0 version of Hack, an open-source typeface
designed specifically for use in source code…”

“…Hack has been released as a free and open source project (available via SourceFoundry and GitHub)
that is free to modify, to use in commercial situations, and to download for print,
desktop, or Web…”

COMPUTER PROGRAMMING LANGUAGES COURSES, LECTURES, TEXTBOOKS, ETC.

Computer Programming Languages, etc. Open Source Software


LIST OF PROGRAMMING LANGUAGES – Wikipedia
Multimedia List of Programming Languages – Database (Text & Images).
VERY VERY VERY…EXTENSIVE.


SOURCEFORGE – SourceForge.net
VERY VERY VERY…EXTENSIVE.

SourceForge.net

“…is the world’s largest Open Source software development web site.
SourceForge.net provides free hosting to Open Source software development
projects with a centralized resource for managing projects, issues,
communications, and code…”

INTERNET TECHNOLOGY & DISTRIBUTED SYSTEMS COURSES, LECTURES, TEXTBOOKS, ETC.

DISTRIBUTED SYSTEMS – 2014 (CS 417) – P. Krzyzanowski,
Department of Computer Science,
School of Arts and Sciences,
Rutgers, The State University of New Jersey
Multimedia Distributed Systems Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “20” “Distributed Systems” Course Lectures include

“…Sockets programming;

Synchronization: logical clocks, vector clocks, clock synchronization;

Group communication: message ordering and message delivery, IP multicasting;

Distributed transactions: two phase commit, three-phase commit, ACID/BASE models;

Distributed file systems: Dropbox, Chubby, Google FS (GFS), Hadoop Distributed FS (HDFS);

Clustering: scalable performance, load balancing, and availability;

Distributed authentication: protocols, digital certificates, Kerberos, SSL; etc…”

For more information see

Distributed Systems Course Home Page;

Paul Krzyzanowski’s Home Page or the

Department of Computer Science

COMPUTER AND NETWORK SECURITY COURSES, LECTURES, TEXTBOOKS, ETC.

FOR RELATED CENTERS SEE CRYPTOGRAPHY, STEGANOGRAPHY, ETC. COURSES, TEXTBOOKS, ETC.

Computer and Network Security Courses, Lectures, etc.


LAGBACORE’S OPEN SECURITY TRAINING – Corey Kallenberg and Xeno Kovah,
Legbacore
Multimedia Open Security Training Courses (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Open Security Training

“…Free Classes on x86 assembly & architecture, binary executable formats,
stealth malware, and exploits…”

For more information see

Legbacore


PYTHON FOR SECURITY PROFESSIONALS – Joe Perry, Cybrary
Multimedia Python for Security Professionals Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY EXTENSIVE.

Python for Security Professionals Course

“…Python for Security Professionals is a class that is designed to teach you the
functions of Python that play a role in a penetration testing career…”

“…This course will take you from basic concepts to advanced scripts in just over 10 hours
of material, with a focus on networking and security. Students will learn about
networking protocols, fuzzing, and information gathering automation in a simple,
easy-to-understand format…”

Examples of ” Python for Security Professionals” Course Modules include

“…Apprentice Python Module;

Journeyman Python Module;

Advanced Python Module;

Packet Analyzer Module; etc..”


COMPUTER AND NETWORK SECURITY – 2015 – A.C. Kak,
Purdue Robot Vision Laboratory,
School of Electrical and Computer Engineering,
College of Engineering,
Purdue University
Multimedia Computer and Network Security Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “31” “Computer and Network Security” Course Lectures include

“…Classical Encryption Techniques;

Block Ciphers and the Data Encryption Standard;

Finite Fields (Part 1, 2, 3 & 4);

Key Distribution for Symmetric Key Cryptography and Generating Random Numbers;

Public-Key Cryptography and the RSA Algorithm;

Certificates, Certificate Authorities, and Digital Signatures;

Elliptic Curve Cryptography and Digital Rights Management;

DNS and the DNS Cache Poisoning Attack;

PGP, IPSec, SSL/TLS, and Tor Protocols;

Malware: Viruses and Worms;

Port and Vulnerability Scanning, Packet Sniffing, Intrusion Detection, and Penetration Testing;

Web Security: PHP Exploits and the SQL Injection Attack;

Bots and Botnets;

Mounting Targeted Attacks with Trojans and Social Engineering; etc…”

For more information see

Avinash Kak’s Home Page;

Avinash Kak’s Faculty Home Page;

Purdue Robot Vision Laboratory;

Computer Engineering or the

School of Electrical and Computer Engineering


ADVANCED INFORMATION ASSURANCE – 2015 (CMPSCI660) – A. Houmansadr,
College of Information and Computer Sciences,
University of Massachusetts Amherst,
Amherst,
Massachusetts
Multimedia Advanced Information Assurance Graduate Course (Text & Images).

Advanced Information Assurance

“…provides an in-depth examination of the fundamental principles of information assurance.
While the companion course for undergraduates is focused on practical issues, the syllabus of
this course is influenced strictly by the latest research. We will cover a range of topics,
including authentication, integrity, confidentiality of distributed systems,
network security, malware, privacy…”

Examples of Advanced Information Assurance Graduate Course Lectures include

“…Information Hiding: Watermarking and Steganography;

Information Hiding: Covert Channels;

Information Leakage: Side Channels;

Censorship Resistance: Parrots;

Privacy-preserving Services: Social Networks;

Security and Privacy of Future Internet Architectures: Named-Data Networking;

Hardware Security: Trusted Platform Module;

Online Tracking;

Traffic Analysis: Flow Correlation; etc…”

For more information see

Advanced Information Assurance Home Page;

Amir Houmansadr Home Page;

Amir Houmansadr Faculty Home Page or the

College of Information and Computer Sciences


NETWORK SECURITY – 2014 (20-CS-6053) – J. Franco,
Computer Science Theory and Algorithms,
Department of Electrical Engineering and Computing Systems,
College of Engineering and Applied Science,
University of Cincinnati,
Cincinnati, Ohio
Multimedia Network Security Course (Text, Images, Vidoes/Movies, Audio/Sound & Java Applets).
VERY VERY VERY…EXTENSIVE.

Examples of “Network Security” Course Lecture Notes (PDF) include

Security, Network Basics and Firewalls
“…Merkle-Hellman encryption;

Merkle-Hellman Demonstration (Java Applet);

Mod arithmetic; etc…”

Some Odd Ciphers (Java Applets);

Block Ciphers and Secret Key Cryptosystems

“…Sending Sequence of Encrypted Blocks;

DES, IDEA, AES;

AES code; etc…”

Message Digest – Auth, Integ, Encrypt

“…Hashing;

SHA-xxx Description;

SHA-1 Broken;

Hash Collisions;

Karn Symmetric Key Algorithm; etc…”

Public Key Cryptosystems

“…Diffie-Hellman Key Exchange;

RSA;

DSS; etc…”

Stream Ciphers and Authentication Protocols; etc.

For more information see

Network Security Course Home Page;

John Franco’s Home Page or the

Department of Electrical Engineering and Computing Systems


COMPUTER AND NETWORK SECURITY – 2014 (CS155) – D. Boneh,
Applied Crypto Group,
Security Lab,
Department of Computer Science,
Stanford University
Multimedia Computer and Network Security Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “17” “Computer and Network Security” Course Lectures include

“…Control hijacking attacks: exploits and defenses;

Dealing with legacy code: sandboxing and isolation;

Tools for writing robust application code;

Exploitation techniques and fuzzing;

Web application security;

Session management and user authentication;

Security issues in Internet protocols: TCP, DNS, and routing;

Malware: Computer viruses, Spyware, and key-loggers;

Mobile platform security models: Android and iOS;

Mobile threats and malware; etc…”

For more information see

Computer and Network Security Home Page;

Dan Boneh’s Home Page;

Applied Crypto Group;

Security Lab or the

Department of Computer Science

Blackhat Technical White Paper Presentations


BLACK HAT USA 2014 BRIEFINGS – Black Hat
Multimedia Black Hat USA 2014 Briefings – Technical White Papers (Text & Images).
VERY VERY VERY…EXTENSIVE.
For more information see

Black Hat USA 2014 or

Black Hat

WIRELESS AND MOBILE NETWORKING & SECURITY COURSES, LECTURES, TEXTBOOKS, ETC.

Undergraduate Courses, Lectures, etc.


WIRELESS COMMUNICATION – 2014 (EE 359) – A. Goldsmith,
Wireless System Lab,
Department of Electrical Engineering,
School of Engineering,
Stanford University
Multimedia Wireless Communication Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Wireless Communication” Course Lectures include

“…Signal Propagation and Path Loss Models;

Shadowing, Combined Path Loss/Shadowing, Coverage Area, Model Parameters;

Statistical Fading Models: Narrowband Fading;

Fading Distributions and Duration. Markov Model. Wideband Fading. Doppler and Delay Spread;

Capacity of Flat and FS Fading Channels Linear Modulation;

ISI and doppler effects, Diversity;

ractical constraints in adaptive modulation, MIMO and space/time communications;

MIMO systems, Capacity, Beamforming, Diversity;

Multicarrier modulation, OFDM; etc…”

For more information see

Wireless Communication Home Page;

Courses;

Andrea Goldsmith’s Wireless System Lab;

Andrea Goldsmith’s Home Page or the

Department of Electrical Engineering

Graduate Courses, Lectures, etc.


MULTIUSER WIRELESS SYSTEMS AND NETWORKS – 2014 (EE 360) – A. Goldsmith,
Wireless System Lab,
Department of Electrical Engineering,
School of Engineering,
Stanford University
Multimedia Multiuser Wireless Systems And Networks Graduate Course (Text & Images).
VERY VERY VERY…EXTENSIVE.
For more information see

Multiuser Wireless Systems And Networks Home Page;

Courses;

Andrea Goldsmith’s Wireless System Lab or the

Department of Electrical Engineering


MOBILE WIRELESS NETWORKING – 2014 (ECEN 621-600) – Xi Zhang,
Department of Electrical & Computer Engineering,
Dwight Look College of Engineering,
Texas A&M; University
Multimedia Mobile Wireless Networking Graduate Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Mobile Wireless Networking Graduate Course

“…provides an in-depth study of principles, architectures, protocols, and modeling techniques
for mobile wireless networks. The course aims at equipping graduate students with not only a
solid foundation and the state-of-the-art knowledge in a wide spectrum of wireless communications
techniques and protocols…”

Examples from over “13” “Mobile Wireless Networking” Course Lectures include

“…Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks;

Characterizations and Modeling of the Wireless Channel;

Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks; etc…”

For more information see

Xi Zhang’s Home Page or the

Department of Electrical & Computer Engineering

ALGROITHMS & DATA STRUCTURES COURSES, LECTURES, TEXTBOOKS, DATABASES, ETC.

Algorithms & Data Structures Dictionaries


DICTIONARY OF ALGORITHMS AND DATA STRUCTURES – P.E. Black,
Software Programs/Projects in ITL,
Information Technology Laboratory,
National Institute of Standards and Technology (NIST)
Multimedia Algorithms & Data Structures Dictionary (Text & Images).

Algorithms & Data Structures Dictionary is a

“…dictionary of algorithms, algorithmic techniques,
data structures, archetypical problems, and related definitions…”

For more information see

NIST SRD Catalog or the

Information Technology Laboratory

Undergraduate Algorithms & Data Structures Courses, Lectures, etc.


DESIGN AND ANALYSIS OF ALGORITHMS (CS 161) – T. Roughgarden,
Department Computer Science,
School of Engineering,
Stanford University
Multimedia Design and Analysis of Algorithms Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Design and Analysis of Algorithms

“…Introduction to fundamental techniques for designing and analyzing algorithms,
including asymptotic analysis; divide-and-conquer algorithms and recurrences; greedy algorithms;
data structures; dynamic programming; graph algorithms; and randomized algorithms…”

Examples from over “171” Design and Analysis of Algorithms Course Video Lectures include

“…Integer Multiplication Revisited Video Lecture;

Algorithmic Mechanism Design Video Lecture;

A Generic Selection Algorithm Video Lecture;

Representing Graphs: Adjacency Matrices and Lists Video Lecture;

Dijkstra’s Algorithm Video Lecture;

Correctness of Algorithm Video Lecture;

Two Greedy Algorithms Video Lecture;

Prim’s Algorithm Video Lecture;

Kruskal’s Algorithm Video Lecture; etc…”

For more information see

Tim Roughgarden’s Home Page;

Algorithmic Game Theory Faculty;

Stanford Theory Group or the

Department of Computer Science


THE MODERN ALGORITHMIC TOOLBOX – 2015 (CS 168) – T. Roughgarden,
Department Computer Science,
School of Engineering,
Stanford University
Multimedia Design and Analysis of Algorithms Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

The Modern Algorithmic Toolbox

“…This course will provide a rigorous and hands-on introduction to the central ideas and
algorithms that constitute the core of the modern algorithms toolkit. Emphasis will be on
understanding the high-level theoretical intuitions and principles underlying the
algorithms we discuss, as well asndeveloping a concrete understanding of when and…”

Examples of “Modern Algorithmic Toolbox” Lectures include

“…Modern Hashing Lectures;

LSH and Nearest Neighbor Lectures;

Sampling and Estimation Lectures;

Linear-Algebraic Techniques Lectures;

Mathematical Programming and Sparse Vector/Matrix Recovery Lectures; etc…”

For more information see

Tim Roughgarden’s Home Page;

Algorithmic Game Theory Faculty;

Stanford Theory Group or the

Department of Computer Science


ALGORITHMS AND MODELS OF COMPUTATION – 2014 (CS 374) – J. Erickson,
Department of Computer Science,
College of Engineering,
University of Illinois,
Urbana-Champaign, Illinois
Multimedia Algorithms and Models of Computation Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Algorithms and Models of Computation

“…covers fundamental tools and techniques from theoretical computer science,
including design and analysis of algorithms, formal languages and automata,
computability, and complexity…”

Examples of “Algorithms and Models of Computation” Subject Categories & Lectures include

“…Nondeterminism: intuition, examples, NFA definitions, ?-transitions, equivalence with DFAs…”

Context-free grammars;

Reductions, Recursion, Divide and Conquer, Sorting;

Backtracking, Intro to Dynamic Programming: Fibonacci;

Dynamic Programming: Longest Increasing Subsequence, Interval Scheduling;

Greedy Algorithms: techniques, examples;

Minimum spanning tree algorithms; etc…”

For more information see

Teaching;

Jeff Erickson’s Home Page or the

Department of Computer Science


INTRODUCTION TO ALGORITHMS – 2013 (CAS CS 330) – J.W. Byers,
Department of Computer Science,
College of Arts & Sciences,
Boston University
Multimedia Introduction to Algorithms Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “22” “Introduction to Algorithms” Course Lectures include

“…Greedy Algorithms;

Fast Integer Multiplication;

“…More advanced dynamic programs involving internal sequences: RNA Secondary Structure…”

“…Sequence Alignment problem. Bellman-Ford shortest path algorithm…”

Proof of the max-flow, min-cut theorem; etc…”

For more information see

Teaching;

John Byers Home Page;

John Byers Faculty Home Page or the

Department of Computer Science


COMBINATORIAL ALGORITHMS AND DATA STRUCTURES – 2013 (CS 270) – S. Rao,
Computer Science Division,
Department of Electrical Engineering and Computer Science,
College of Engineering,
University of California, Berkeley
Multimedia Combinatorial Algorithms and Data Structures Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples from over “26” “Combinatorial Algorithms and Data Structures” Course Lectures include

“…Max Weight Matching/Multiplicative Weights;

Adaboost; Toll/Congestion. Slides. Handout/slides;

Review of Duals. Complementary Slackness. Facility Location;

Lagrange. Convex Bodies. Farkas. Strong Duality;

Semidefinite Programming. MaxCut;

Streaming;

Power of Two;

More cheeger, isoperimetric;

Cheeger, mixing for partial orders;

Linear time linear systems; …”

For more information see

Satish Rao’s Home Page or the

Computer Science Division


ALGORITHMS FOR BIG-DATA MANAGEMENT – 2013 (CompSci 590.02) – A. Machanavajjhala,
Department of Computer Science,
Duke University
Multimedia Algorithms for Big-Data Management Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Algorithms for Big-Data Management

“…will provide an introduction to algorithm design on such
large datasets, with a specific focus on integrating information
from multiple datasets. In this context, we will cover parallel
algorithms (which partition computation across many machines),
streaming algorithms…”

Examples of “Algorithms for Big-Data Management” Course Lectures include

“…Monte Carlo Estimation, DNF counting;

Coupling and Mixing Times;

Streaming Algorithms: Filtering & Estimating the number of distinct objects;

Streaming Algorithms: Online Aggregation;

Parallel Architechtures: Asynchronous Processing;

Parallel Architechtures: Feed Following;

Clustering & Deduplication: Correlation Clustering;

Clustering & Deduplication: Collective Entity Resolution & Scalability; etc…”

For more information see

Ashwin Machanavajjhala’s Home Page or the

Department of Computer Science


AN INTRODUCTION TO THE ANALYSIS OF ALGORITHMS – 2017 – R. Sedgewick & P. Flajolet,
Department of Computer Science,
School of Engineering and Applied Science,
Princeton University
Multimedia An Introduction to the Analysis of Algorithms Textbook (Text & Images).
VERY VERY VERY…EXTENSIVE.

An Introduction to the Analysis of Algorithms Textbook

“…overviews the primary techniques used in the mathematical analysis
of algorithms. The material covered draws from classical mathematical topics,
including discrete mathematics, elementary real analysis,…”

An Introduction to the Analysis of Algorithms Lectures (Slides)

“…These slides are for the first half of an undergraduate course taught
at Princeton, developed to provide an overview of An Introduction to the
Analysis of Algorithms and Analytic Combinatorics…”

Examples of “An Introduction to the Analysis of Algorithms” Lectures include

“…Analysis of algorithms;

Generating functions;

Analytic combinatorics;

Permutations;

Strings and Tries; etc…”

For more information see

An Introduction to the Analysis of Algorithms Course Home Page;

Robert Sedgewick’s Faculty Home Page or the

Department of Computer Science

Undergraduate Computer Arithmetic Algorithms Calculators


COMPUTER ARITHMETIC ALGORITHMS SIMULATOR – I. Koren,
Department of Electrical and Computer Engineering,
College of Engineering,
University of Massachusetts
VERY VERY VERY…EXTENSIVE.

Examples of “Computer Arithmetic Algorithms” Calculators Subject Categories include

“…Addition Computer Arithmetic Algorithms Calculators;

Multiplication Computer Arithmetic Algorithms Calculators;

Division Computer Arithmetic Algorithms Calculators;

Square Root Computer Arithmetic Algorithms Calculators;


Floating-Point Arithmetic Computer Arithmetic Algorithms Calculators;

Elementary Functions Computer Arithmetic Algorithms Calculators;


Unconventional Number Systems Computer Arithmetic Algorithms Calculators; etc…”

For more information see

Israel Koren’s Home Page or the

Department of Electrical and Computer Engineering

Examples from over “40” “Computer Arithmetic Algorithms” Calculators include


Addition Algorithms: Ripple Carry Adder Calculator

Ripple Carry Adder Calculator INPUT Values include:

“…A; B; Binary or Decimal; Number of Bits; Signal Delays…”


Multiplication Algorithms: 2’s Complement Array Multiplier with Timing Calculator

2’s Complement Array Multiplier with Timing Calculator INPUT Values include:

“…A; X; Binary or Decimal; Number of Bits (>2); Signal Delays…”


Division Algorithms: Division using overlapping SRT stages Calculator

Division using overlapping SRT stages Calculator INPUT Values include:

“…X; D; Binary or Decimal; Number of Bits (odd);


Type of divider to use (srt-4 comprised of 2 srt-2; srt-8 comprised of 3 srt-2;
srt-16 comprised of 4 srt-2; etc.);

Signal Delays (CSA; 3 input Mux; 7 input Mux; etc.)…”


Square Root Algorithms: Nonrestoring Square Root Calculator

Nonrestoring Square Root Calculator INPUT Values include:

“…X (must be between 0 and 1); Binary or Decimal; Number of Bits…”


Floating-Point Arithmetic Algorithms: Floating Point Demonstration of FAR and CLOSE cases Calculator

Floating Point Demonstration of FAR and CLOSE cases Calculator INPUT Values include:

“…A; B; Hexadecimal or Decimal; single or double;

Signal Delays (Pred. Exponent; Pred. Leading Zeroes; Simple 2 to 1 Mux; etc.)…”


Elementary Functions Algorithms: Trigonometric Functions Calculator

Trigonometric Functions Calculator INPUT Values include:

“…C; Hexadecimal or Decimal; Number of Bits…”


Unconventional Number Systems Algorithms: Residue Addition and Multiplication Calculator

Residue Addition and Multiplication Calculator INPUT Values include:

“…Moduli; Add, Subtract or Multiply; Input A; Input B…”


Miscellaneous Algorithms: Wallace Carry-Save Tree Calculator

Wallace Tree Simulations Calculator INPUT Values include:

“…Binary or Decimal; Sum Delay; Carry Delay; Input Operand 1, 2, 3, etc…”

Graduate Algorithms & Data Structures Courses, Lectures, etc.


ANALYSIS OF ALGORITHMS – 2015 (CSE 548-01) – R.A. Chowdhury,
Theoretical and Experimental Algorithmics (TEA) Group,
Department of Computer Science,
College of Engineering and Applied Sciences, & the
Institute for Advanced Computational Sciences (IACS),
Stony Brook University
Multimedia Analysis of Algorithms Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Analysis of Algorithms

“…explore techniques for designing and analysing efficient algorithms, including recurrence
relations and divide-and-conquer algorithms, dynamic programming, graph algorithms (e.g., network flow),
amortized analysis, cache-efficient and external-memory algorithms, high probability bounds and…”

Examples from over “26” “Analysis of Algorithms” Course Lectures include

“…Matrix Multiplication & Strassen’s Algorithm;

Polynomial Multiplication & the Fast Fourier Transform;

Akra-Bazzi Recurrences;

Linear Recurrences with Constant Coefficients Generating Functions;

Binomial Heaps;

Dijkstra’s SSSP & Fibonacci Heaps;

Analyzing Parallel Algorithms;

Analyzing I/O and Cache Performance; etc…”

For more information see

Rezaul A. Chowdhury’s Home Page or the

Department of Computer Science


THEORY OF ALGORITHMS – 2013 (CS 5114) – T.M. Murali,
Department of Computer Science,
College of Engineering,
Virginia Tech
Multimedia Theory of Algorithms Graduate Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Theory of Algorithms” Course Lectures include

“…Greedy Graph Algorithms;

Applications of MSTs;

Divide and Conquer Algorithms;

Dynamic Programming;

NP and Computational Intractability;

NP-Complete Problems; etc…”

For more information see

T.M. Murali’s Home Page or the

Department of Computer Science


DESIGN AND ANALYSIS OF ALGORITHMS – 2013 (CSCI 5454) – Aaron Clauset,
Department of Computer Science,
the BioFrontiers Institute,
University of Colorado,
Boulder, Colorado,
and an External Faculty Member of the Santa Fe Institute (SFI)
Multimedia Design and Analysis of Algorithms Graduate Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Design and Analysis of Algorithms

“…will cover topics related to algorithm design and analysis.
Topics will include divide and conquer algorithms, greedy algorithms,
graph algorithms, algorithms for social networks, computational biology,
optimization algorithms,…”

Example of “Design and Analysis of Algorithms” Course Lectures include

“…Greedy algorithms;

Graph algorithms;

Network flow;

Phylogenetic trees;

Optimization;

Graph Clustering;

Crowd-source: Knapsack problems & Sequence Alignments;

Crowd-source: NP-hard problem & Approximation Algorithms; etc…”

For more information see

Teaching;

Aaron Clauset’s Home Page;

Department of Computer Science or

External Faculty, Santa Fe Institute (SFI)

ANALYTICS & DATA MINING COURSES, LECTURES, TEXTBOOKS, ETC.

Graduate Analytics & Data Mining Courses, Lectures, etc.


DATA MINING AND PREDICTIVE ANALYTICS – 2015 (CSE 255) – C. Elkan,
Department of Computer Science and Engineering,
Jacobs School of Engineering,
University of California San Diego (UCSD)
Multimedia Data Mining and Predictive Analytics Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Data Mining and Predictive Analytics

“…graduate-level lecture course devoted to current methods for
data mining and predictive analytics…”

Examples of “Data Mining and Predictive Analytics” Course Lectures include

“…Supervised Learning: Classification;

Graphical Models & Interdependent Variables;

Text Mining;

Network Analysis;

Modeling Temporal and Sequence Data; etc…”

For more information see

Charles Elkan’s Home Page or the

Charles Elkan’s Home Page

Data Mining Software (Examples)


DATA MINING WITH WEKA – Machine Learning Group,
Department of Computer Science,
University of Waikato,
New Zealand
Multimedia Weka: Data Mining Software in Java (Text & Images).
VERY VERY VERY…EXTENSIVE.

Weka: Data Mining Software in Java

“…a collection of machine learning algorithms for data mining tasks. The algorithms
can either be applied directly to a dataset or called from your own Java code.
Weka contains tools for data pre-processing, classification, regression,
clustering, association rules, and visualization…”

For more information see

Data Mining with Weka courses;

Machine Learning Group or the

Department of Computer Science


KNIME – KNIME.com AG,
Zurich,
Switzerland
Multimedia KNIME – Professional Open-Source Software (Text & Images).
VERY VERY VERY…EXTENSIVE.

KNIME [naim]

“…is a user-friendly graphical workbench
for the entire analysis process: data access, data transformation,
initial investigation, powerful predictive analytics,
visualisation and reporting…”


RAPIDMINER – RapidMiner Headquarters,
Cambridge, Massachusetts &
RapidMiner Germany,
Dortmund, Germany
Multimedia RapidMiner Software (Text & Images).
VERY VERY VERY…EXTENSIVE.

RapidMiner

“…includes hundreds of methods for data integration, data transformation,
data modeling, and data visualization — with access to data sources
like Excel, Access, Oracle, IBM DB2, Microsoft SQL, Sybase,
Ingres, MySQL, Postgres, SPSS, dBase, Text files,…”


RATTLE: A GRAPHICAL USER INTERFACE FOR DATA MINING USING R – Togaware Pty Ltd.,
Australia
Multimedia Rattle: A Graphical User Interface for Data Mining using R (Text & Images).
VERY VERY VERY…EXTENSIVE.

Rattle: A Graphical User Interface for Data Mining using R

“…presents statistical and visual summaries of data,
transforms data into forms that can be readily modelled, builds both
unsupervised and supervised models from the data, presents the
performance of models graphically, and scores new datasets…”

MACHINE LEARNING & DEEP LEARNING COURSES, LECTURES, TEXTBOOKS, ETC.

TensorFlow – Open Source Software Library for Machine Intelligences


TensorFlow: an Open Source Software Library for Machine Intelligence – Google


Relational Learning with TensorFlow – Brian Jones, FireEye


Relational Learning Tutorial – Brian Jones, FireEye – 3/8/2016

Undergraduate Machine Learning & Deep Learning Courses, Lectures, etc.


DEEP LEARNING TUTORIAL – Department of Computer Science, Stanford University
Multimedia Deep Learning Tutorial (Text & Images).
VERY VERY EXTENSIVE.

“…This tutorial will teach you the main ideas of Unsupervised Feature Learning and
Deep Learning. By working through it, you will also get to implement several feature
learning/deep learning algorithms, get to see them work for yourself, and learn how
to apply/adapt these ideas to new problems…”


MACHINE LEARNING – 2015 (CS 229) – Andrew Ng,
Department of Computer Science,
School of Engineering,
Stanford University
Multimedia Machine Learning Course (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Examples of “Machine Learning” Course Video Lectures include

Linear Regression with One Variable Video Lectures;

Linear Regression with with Multiple Variables Video Lectures;

Regularization Video Lectures;

Neural Networks: Representation Video Lectures;

Machine Learning System Design Video Lectures;

Dimensionality Reduction Video Lectures;

Anomaly Detection Video Lectures; etc…”

For more information see

Machine Learning Home Page at Coursera;

Andrew Ng’s Courses;

Andrew Ng’s Home Page or the

Department of Computer Science


FOUNDATIONS OF MACHINE LEARNING – 2017 (CSCI-GA.2566-001) – Mehryar Mohri,
Department of Computer Science,
Courant Institute of Mathematical Sciences,
New York University
Multimedia Foundations of Machine Learning (Text & Images). VERY VERY VERY…EXTENSIVE.

Examples of Foundations of Machine Learning” Lectures include

“…Rademacher complexity, VC-dimension, learning bounds for infinite hypothesis sets, model selection;

Kernel methods;

Boosting;

Regression;

Ranking;

Learning Languages; etc…”

For more information see

Courses;

Mehryar Mohri’s Home Page or the

Department of Computer Science

Graduate Machine Learning & Deep Learning Courses, Lectures, etc.


ADVANCED MACHINE LEARNING – 2015 (CS 6780) – T. Joachims,
Department of Computer Science,
College of Engineering,
Cornell University
Multimedia Machine Learning Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Advanced Machine Learning

“…gives a graduate-level introduction to machine learning and statistical pattern recognition
and in-depth coverage of new and advanced methods in machine learning, as well as their
underlying theory. It emphasizes approaches…”

Examples from over “18” “Advanced Machine Learning” Course Lectures include

“…Empirical Risk Minimization;

Statistical Learning Theory: Error Bounds and VC-Dimension;

Support Vector Machines: Duality and Leave-one-out;

Generative Models for Classification;

Modeling Sequence Data: HMMs and Viterbi;

Structured Output Prediction: Discriminative Learning; etc…”

For more information see

Thorsten Joachims Home Page or the

Department of Computer Science


A TUTORIAL SURVEY OF ARCHITECTURES, ALGORITHMS, AND APPLICATIONS FOR DEEP LEARNING – Author: Li Deng,
Principal Research Manager of the Deep Learning Technology Center, Research, Micorsoft;
Publication: APSIPA Transactions on Signal and Information Processing,
Publication Date: Revised & Updated – 2014;
Cambridge Journals Online,
Cambridge University Press,
Cambridge University;
Hosted by Microsoft Research,
Redmond, Washington
Multimedia “A Tutorial Survey of Architectures, Algorithms, and Applications for Deep Learning” Publication – PDF, 29 Pages (Text & Images).

Deep Learning

“…Deep learning refers to a class of machine learning techniques, developed largely since 2006,
where many stages of nonlinear information processing in hierarchical architectures are exploited for
pattern classification and for feature learning. In the more recent literature, it is also connected
to representation learning, which involves a hierarchy of features or concepts where higher-level
concepts are defined from lower-level ones and where the same lower-level concepts help to define
higher-level ones…”

For more information see

A Tutorial Survey of Architectures, Algorithms, and Applications for Deep Learning (APSIPA Transactions on Signal and Information Processing),

APSIPA Transactions on Signal and Information Processing;

A Tutorial Survey of Architectures, Algorithms, and Applications for Deep Learning Home Page (Research, Microsoft) or

Li Deng’s Home Page


STATISTICAL METHODS FOR MACHINE LEARING AND DATA MINING – 2014 (STA 4273H) – R. Salakhutdinov,
Machine Learning at UofT,
Department of Computer Science and the
Department of Statistical Sciences,
Faculty of Arts & Science,
University of Toronto,
Toronto, Ontario,
Canada
Multimedia Statistical Methods for Machine Learning and Data Mining Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Statistical Methods for Machine Learning and Data Mining” Course Lectures include

“…Regression;

Regression;

Gaussian Processes;

Latent Variable Models, etc…”

For more information see

Statistical Methods for Machine Learning and Data Mining Home Page;

Ruslan (Russ) Salakhutdinov’s Home Page;

Machine Learning Courses;

Machine Learning at UofT or the

Department of Computer Science


MACHINE LEARNING FOR BIG DATA (CSE 599)/STATISTICS FOR BIG DATA (STAT 592) – C. Guestrin (Department of Computer Science & Engineering) &
E.B Fox (Department of Statistics),
Machine Learning Center,
Department of Computer Science & Engineering,
College of Engineering,
& the Department of Statistics,
College of Arts & Sciences,
University of Washington
Multimedia Machine Learning for Big Data/Statistics for Big Data Graduate Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Machine Learning for Big Data/Statistics for Big Data” Courses Sections & Lectures include

Estimating Click Probabilities
“…Perceptron, kernel trick, kernelized Perceptron;

Kernel trick continued, stochastic gradient descent (SGD); etc…”

Document Retrieval

“…Document retrieval task, k-NN, tf-idf, fast k-NN (exact = KD-trees);

Clustering: GMM, EM;

LDA, Gibbs sampling for LDA;

Variational methods and online variational for LDA; etc…”

fMRI Prediction

“…fMRI task, zero-shot learning, ridge regression;

LARS, fused LASSO, Shotgun, stochastic coordinate descent (SCD), averaging methods; etc…”

Collaborative Filtering

“…Alternating least squares, SGD for matrix factorization, nonnegative matrix factorization;

Cold-start problem, feature-based collaborative filtering. Graph-parallel problems; etc…”

For more information see

Machine Learning for Big Data (CSE 599)/Statistics for Big Data (STAT 592) Course Home Page;

Carlos Guestrin’s Home Page;

Emily Fox’s Home Page;

Machine Learning Courses;

Machine Learning Center;

Department of Statistics or the

Department of Computer Science & Engineering

Machine Learning and Artificial Intelligence Index of Courses, Lectures, etc.


METACADEMY – Community-driven, Open-source Platform
Multimedia Machine Learning and Artificial Intelligence Index of Courses, Lectures, etc. (Text, Images, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

Metacademy

“…specializes in machine learning and artificial intelligence topics…”

CLOUD COMPUTING COURSES, LECTURES, TEXTBOOKS, ETC.

CLOUD COMPUTING – 2015 (CS5412) – K.P. Birman,
Department of Computer Science,
Cornelll University
Multimedia Cloud Computing Course (Text & Images).
VERY VERY VERY…EXTENSIVE.

Examples of “Cloud Computing” Course Lectures include

“…How cloud client systems work;

Network Routing;

First and Second Tier Cloud Services;

Adaptive Overlays for the Tier 2 Cloud;

Consistency and time. Logical and Vector clocks. Consistent cuts;

Consensus and the FLP theorem;

Atomic multicast with Virtual Synchrony guarantees;

Atomic multicast tradeoffs;

STransactional model, ACID; etc…”

For more information see

Cloud Computing Home Page;

K.P. Birman’s Home Page or the

Department of Computer Science

INTERVAL ARITHMETIC OPERATIONS CALCULATORS & APPLETS

INTERVAL ARITHMETIC CALCULATORS – T.J. Hickey,
Department of Computer Science,
Brandeis University
VERY VERY EXTENSIVE.

Examples of “Interval Arithmetic” Calculators include

IA-Solver “…a solver for non-linear constraints….”

IA-Eval “…a simple Interval Arithmetic Evaluator…”

GIA-Eval “…A General Interval Arithmetic Evaluator…”

For more information see

JScheme Applications;

JScheme or

Timothy J. Hickey’s Home Page

IMAGE PROCESSING, COMPUTER VISION, SHPERICAL HARMONICS COURSES, LECTURES, APPLETS, ETC.

Computer Vision


BOOFCV APPLETS, MOVIES, ETC. – Peter Abeles
Multimedia Real-time Computer Vision and Robotics Applications (Text, Images, Applets, Videos/Movies & Audio/Sound).
VERY VERY VERY…EXTENSIVE.

BoofCV

“…an open source Java library for real-time computer vision and
robotics applications…”

Examples of “BoofCV” Applet Categories on the “Home Page” include

“…Image Processing Applets;

Feature Applets;

Geometric Applets…”

Examples of “BoofCV” Applet Categories in the “List of Applets” include

“…Low Level Image Processing Applets;

Image Feature Intensity Applets;

Detected Image Features Applets;

Associating Image Features Applets;

Image Transforms Applets;

Camera Calibration Applets;

3D Computer Vision Applets, etc…”

Spherical Harmonics


IMPORTANCE SAMPLING SPHERICAL HARMONICS (SH) – W.Jarosz, N.S. Carr & H.W. Jensen,
Eurographics, Volume 28 (2009), Number 2,
The Eurographics Association and Blackwell Publishing Ltd.;
Department of Computer Science,
Dartmouth University &
Disney Research, Zürich,
The Walt Disney Company (Switzerland) GmbH,
The Walt Disney Company
Multimedia Importance Sampling Spherical Harmonics (Text & Images).
VERY VERY EXTENSIVE.

Importance Sampling Spherical Harmonics

“…we present the first practical method for importance sampling functions
represented as spherical harmonics (SH). Given a spherical probability density
function (PDF) represented as a vector of SH coefficients, our method warps
an input point set to match the target PDF using hierarchical sample warping…”

For more information see

Wojciech Jarosz’s Home Page at the Department of Computer Science, Dartmouth University;

Disney Labs: Zürich;

Disney Research or the

The Walt Disney Company


THE SCIENCE OF SPHERICAL HARMONICS AT WETA DIGITAL – M. Seymour,
Weta Digital Ltd.,
Wellington,
New Zealand;
Hosted by fxguide.com
Multimedia The Science of Spherical Harmonics at Weta Digital (Text & Images).
VERY VERY EXTENSIVE.

The Science of Spherical Harmonics at Weta Digital

“…the SH [Spherical Harmonics] data transformation has been allowing
incredible images to be produced in a fraction of the time and with
massive data sets – that only a few years ago seemed impossible.
We explain SH and the amazing way Weta Digital in particular is
pushing their use in production rendering…”

For more information see

fxguide or
For more information see

Weta Digital


SPHERICAL HARMONICS Y_LM EXPLORER – Martin Kraus;
Department of Architecture, Design and Media Technology,
Aalborg University,
Denmark;
Hosted by the Institut für Visualisierung und Interaktive Systeme (VIS),
University of Stuttgart,
Germany
VERY EXTENSIVE.

Examples of “Spherical Harmonics Y_LM Explorer” Input Values include

“…(rank) L;

(component) M;
R
polar resolution; etc…”



For more information see

Martin Kraus Home Page

TWO-D GRAPHICS CALCULATORS, APPLETS, ANIMATIONS & SIMULATIONS

TWO-D GRAPHICS AND ANIMATION – D. Eck, Department of Mathematics & Computer Science,
Hobart and William Smith Colleges, Geneva, N.Y.
VERY EXTENSIVE.

Two-D Graphics and Animation Applet

“…create two-dimensional geometric models and simple animations. In the process, you will learn about various two-dimensional geometrical transformations…”

For more information see

Labs & Applets for the Most Complex Machine or

David J. Eck’s Home Page

A GRAPHICS TOOL FOR LINDERMAYER SYSTEMS

LGRAMMAR: A GRAPHICS TOOL FOR LINDERMAYER SYSTEMS (JAVA APPLET) – T. Bräunl,
School of Electrical, Electronic and Computer Engineering,
University of Western Australia,
Perth, Australia
VERY EXTENSIVE.

LGrammar

“…implements a two-dimensional and a three-dimensional graphics
tool for evaluating Lindenmayer grammars…”

For more information see

Robotics and Automation Laboratory – Thomas Bräunl’s Home Page or the

School of Electrical, Electronic and Computer Engineering

MEASUREMENT & CONTROL COURSES, LESSONS, ETC. WITH CALCULATORS & APPLETS

MEASUREMENT & CONTROL TECHNICAL REFERENCE – Omega Engineering Inc.
Multimedia Measurement and Control of: Temperature; Pressure, Strain & Force;
Flow & Level; pH & Conductivity; Electric Heaters and Data Aquisition
Lessons, Glossaries, Databases, Calculators, etc. (Text, Images, Animations & Simulations).
VERY VERY VERY…EXTENSIVE.

Examples of “Measurement and Control” Lessons, Databases & Calculators include:

Transactions in Measurement & Control Series:
“…Non-Contact Temperature Measurement; Data Acquistion;

Force Related Measurements; etc….”

Temperature:

“…Introduction to Thermocouples; Thermocouple Wire;

Wire Color Codes and Limits of Error;

Introduction to Temperature Controllers;

Introduction to Temperature Measurement; etc…”

Pressure, Strain and Force:

“…Introduction to Accelerometers; Introduction to Load Cells;

Introduction to Pressure Transducers; etc…”

Flow and Level:

“…Introduction to Rotameters; Introduction to Flow Meters;

Liquid Flowmeters; etc…”

Data Acquisition:

“…Data Acquisition Knowledge Base;

Introduction to Data Acquisition Systems;


Introduction to Data Logging Systems; etc…”

For more information see

Omega Engineering Inc.

CONTROL SYSTEMS DESIGN CALCULATORS & APPLETS

STEEL INDUSTRY CONTROL SYSTEMS DESIGN CALCULATORS & APPLETS


STEELUNIVERSITY – An initiative of
World Steel Association
Multimedia Steeluniversity Course (Text, Images, Animations,
Simulations, Applets, Videos/Movies).
VERY VERY VERY…EXTENSIVE.

Registration Required but Free.

Steeluniversity

“…The steeluniversity learning+ website is intended for use by undergraduate
and graduate students along with steel company employees and people within the
steel industry supply chain. Professors, instructors, teachers and trainers will
also benefit from the use of steeluniversity learning+ to organise and supplement
instruction for their students…”

Examples of “Steeluniversity” Course Modules include

“…Steel Manufacturing (12 Hours);

Ferrous Metallurgy (6 Hours);

Blast Furnace (2 Hours);

Basic Oxygen Steelmaking (2 Hours);


Electric Arc Steelmaking (2 Hours);

Thermodynamics and Kinetics (2 Hours);

Mechanical Properties (1 Hour); etc…”

For more information see

Steeluniversity


CONTROL SYSTEMS DESIGN INTERACTIVE SIMULATIONS (JAVA APPLETS) – G.C. Goodwin, S.F. Graebe & M.E. Salgado,
Department of Electrical & Computer Engineering,
University of Newcastle, Australia
Multimedia Control Systems Design for
Continuous Casting and Rolling Mills
from the Steel Industry Course (Text, Images, Simulations & Applets).
VERY VERY EXTENSIVE.

Examples of “Control Systems Design for Continuous Casting and Rolling Mills” Course Chapters include

“…Continuous Casting;

Inverted Pendulum;

Rolling Mill;


Tank Level Control;

Ball and Plate;

Shape Control;


Distillation Columns; etc…”

For more information see

Control Systems Designs

Examples of “Control Systems Design for Continuous Casting and Rolling Mills” Simulations include

Continuous Casting Simulation


Rolling Mill Simulation


Rolling Mill Shape Control Simulation

DATA STRUCTURE CALCULATORS, APPLETS, ANIMATIONS & SIMULATIONS

GEOMETRIC ALGORITHM APPLETS, GRAPH ALGORITHM APPLETS,

PARALLEL ALGORITHM APPLETS, SORTING ALGORITHM APPLETS

TREE ALGORITHM CALCULATORS & APPLETS

DATA STRUCTURE APPLETS WITH COURSES


DATA STRUCTURES: ALGORITHM APPLETS – R.K. Ghosh,
Department of Computer Science and Engineering,
Indian Institute of Technocology, Kanpur, India
VERY VERY VERY…EXTENSIVE.

Algorithm Applets include:

“…Sorting Applets; Graph Algorithms Applets;

String Matching Applets; Stack and Queue Applets;

Binary Search Tree Applets; Heap/Priority Queue Applets;


Red Black Tree Applets; AVL Tree Applets; etc…”

For more information see

CS210: Data Structures;

R.K. Ghosh’s Home Page;

Department of Computer Science and Engineering or the

Indian Institute of Technocology

Some examples from over “25” Data Structures & Algorithm Applets include


Sorting Applets

Sorting Applets include

“…Insertion Sort Applets; Counting Sort Applets;


Postman Sort Applets; Two-way Selection Sort Applets; etc…”


String Matching Applets

String Matching Applets include

“…Naive String Matching Algorithm Applet;


Boyer Moore String Matching Algorithm Applet;

Knuth Morris Pratt String Matching Algorithm Applet;


Robin-Karp String Matching Algorithm Applet…”


WORKSHOP APPLETS BY LAFORE – D. Xu, Department of Computer Science,
Bryn Mawr College
VERY VERY VERY…EXTENSIVE.

Data Structures and Algorithms Applets include:

Array Applets; Simple Sorting Applets; Stacks & Queues Applets;

Linked Lists Applets; Recursion Applets; Advanced Sorting Applets;

Binary Tree Applets; Red-black Tree Applets; 2-3-4 Tree Applets;


Hash Table Applets; Heap Applets; Graphs Applets;


Weighted Graphs Applets…”

For more information see

CS2O6: Data Structures;

Dianna Xu’s Home Page or the

Department of Computer Science

Some examples from over “28” Data Structures and Algorithms Applets


Lafore’s Ordered Array Applet


Lafore’s Shell Sort Applet


Lafore’s Separate-Chaining Hash Table Applet