CS 6800



Presentations


[ home ] [ syllabus ] [ classpolicy ] [ references ] [ projects ] [ presentations ] [ assignments ]




Presentations 2016

02/01 (M) Artificial Neural Networks
02/03 (W) Cryptography - RSA Algorithm
02/03 (W) Applications of State Machines in Computational Biology
02/10 (M) Computer Security: Hackers and Viruses
02/12 (W) Topics in Context-Free Grammars
02/12 (W) Markov Chains
02/15 (M) Swarm Intelligence
02/17 (W) Hidden Markov Models
02/17 (W) Data Classification by using Artificial Neural Networks
02/22 (M) Quantum Computing: An Introduction
03/21 (M) Turing Machine - Simulating Simulator
03/23 (W) DNA Sequences Analysis
03/28 (M) DNA Sequence Analysis using DFA
03/28 (M) The CYK Algorithm Implementation
04/04 (M) An Implementation for Alternating Bit Protocol (ABP) as an Application of Theory (of Computation) in Networking
04/06 (W) Turing Machine Simulator
04/06 (W) Two-Stack PDA

Presentations 2014

01/31 (F) Normal Forms
02/10 (F) Markov Models
02/10 (F) Hidden Markov Models
02/17 (F) Statistical Learning Models
02/19 (W) CYK Algorithm
02/24 (F) RSA Algorithm
03/10 (M) Equivalent Formalisms for TM
03/12 (W) Markov Algorithms
03/17 (M) Computer Security - Hackers and Viruses
03/19 (M) Covert Timing Channels
03/26 (W) Probabilistic Turing Machines
03/31 (M) Simulating a Modern Computer by a Turing Machine and Vice-Versa
04/02 (W) Complexity classes - Space Complexity
04/07 (M) NP-Hard
04/09 (W) Deterministic Context-Free Languages
04/09 (W) Computational Biology
04/14 (M) LR(k) Grammars
04/14 (M) Agent Privacy/Security
04/16 (W)

Presentations 2012

10/29 (M) Markov Models
10/31 (W) Hidden Markov Models (HMM)
11/02 (F) Hidden Markov Models in Bioinformatics
11/05 (M) Myhill-Nerode Theorem
11/07 (W) Hybrid genetic Algorithm for Solving TSP
11/09 (F) Computational biology, Algorithm complexity
11/12 (M) LL(k), LR(k) grammars
11/14 (W) Modeling Networks/Graphs
11/16 (F) Hackers and Viruses

Presentations 2009

5/18 (M)                                                                                               6/8 (M)
Jeremy - The NP-Hard Complexity Class                                      David - LR(k) Grammars
Thap - Natural computing                                                                Jeremy - DFA Minimization
5/20 (W)                                                                                               6/10 (M)
David - The CYK algorithm                                                              Hector - PCP, MPCP, Semi-Thue Systems
                                                                                                                Thap - Cellular Automata
5/22 (F)                                                                                                 6/12 (M)
Keith - Quantum Computing                                                            Mutaz - Genetic Algorithms
Ahmad - Artificial Neural Networks                                              Ahmad - Multi-Core Computing
5/27 (W)                                                                                               6/15 (M)
Hector - Chomsky & Greibach Normal Forms                              Keith - Shor's Factorization Algorithm
Mutaz - Restricted Satisfyability (SAT) Problem

Presentations 2007

 1.

   Closure properties of context-free languages (H.,M.&U. 7.3)
   Complements of languages in NP (H.,M.&U. 11.1)
   Quantum computing
   Shor's algorithm
   Multi-core computers/computation

 2.

   DCFLs, LR(0), LR(1), LR(k) grammars (H.&U. 10.6,7,8)
   Restricted Satisfiability (SAT) Problem (H.,M.&U. 10.3)
   Probabilistic Turing machines
   Ant colonies and swarms

 3.

   Finite state automata variants
   The classes P and NP
   NP-complete problems (H.,M.&U. 10.4)
   Tree automata
   Artificial Neural Networks (ANNs)

 4.

   Normal forms for CFGs (H.&U. 4.5,4.6)
   P, NP and NPS
   Restricted Turing machines (H.&U. 7.8)
   Genetic algorithms
   Evolutionary algorithms

 5.

  Decision problems of regular sets, Myhill-Nerode theorem (H.&U. 3.3,3.4)
  Decision problems of CFLs, CYK algorithm (H.&U. 6.3)
  Properties of context-free languages (H.&U Ch.VII)
  Closure properties of families of languages (H.,M.&U. Ch.XI)

 6.

  Church, Turing, Tarski and others (from GOEDEL, ESCHER, BACH: an Eternal Golden Braid,   Ch.XVII)
  (Lectures on) Undecidability and Rice's theorems (H.&U. Ch.VIII)
   Self-replicating Turing machines and computer viruses
   A survey of quantum computing and automata

 

 

 

 

 

 

 

[ home ] [ syllabus ] [ classpolicy ] [ references ] [ projects ] [ presentations ] [ assignments ]