Showing posts with label DCCN NSC. Show all posts
Showing posts with label DCCN NSC. Show all posts

Sunday, 25 December 2016

Data Communication & Networks:

Notes on Data Communication & Networks :Part II

Hello Friends!


Data Communication & Networks is one of the important subjects in UGC NET exam on which lots of questions are asked. So, prepare this subject well. The syllabus of the subject is vast, but is one of the easiest subjects to prepare. 

Please read the post and then post your comments/suggestions:

ETHERNET: Ethernet frames must carry a minimum payload of 46 bytes, which ensures that a valid Ethernet frame is 512-bits long (considering bits of header section also). The shortest Ethernet frame is 64 bytes in length, which carry Control messages.

Ethernet frames don't have a way to indicate end-of-frame, but an inter-frame gap (of time required to send 96 bit of data, i.e. 9.6 micro sec.) is used.

Horn antennas are very popular at UHF (300 MHz-3 GHz) and higher frequencies. They have a wide impedance bandwidth, implying that the input impedance is slowly varying over a wide frequency range.
S-parameters describe the input-output relationship between ports (or terminals) in an electrical system. A port can be defined as any place where we can deliver voltage and current.
Waveforms are not made up of a discrete number of frequencies, but rather a continuous range of frequencies (sum of frequencies).
Through modulation the waveforms can be relocated to separate frequency bands. Television is broadcast primarily at 54-216 MHz. FM radio operates between 87.5-108 MHz.
Frequency Band Name
Frequency Range
Wavelength (Meters)
Application
Extremely Low Frequency (ELF)
3-30 Hz
10,000-100,000 km
Underwater Communication
Super Low Frequency (SLF)
30-300 Hz
1,000-10,000 km
AC Power (though not a transmitted wave)
Ultra Low Frequency (ULF)
300-3000 Hz
100-1,000 km
Earth Mode Communications*
Very Low Frequency (VLF)
3-30 kHz
10-100 km
Navigational Beacons
Low Frequency (LF)
30-300 kHz
1-10 km
AM Radio
Medium Frequency (MF)
300-3000 kHz
100-1,000 m
Aviation and AM Radio
High Frequency (HF)
3-30 MHz
10-100 m
Shortwave Radio
Very High Frequency (VHF)
30-300 MHz
1-10 m
FM Radio
Ultra High Frequency (UHF)
300-3000 MHz
10-100 cm
Television, Mobile Phones, GPS
Super High Frequency (SHF)
3-30 GHz
1-10 cm
Satellite Links, Wireless Communication
Extremely High Frequency (EHF)
30-300 GHz
1-10 mm
Astronomy, Remote Sensing
Visible Spectrum
400-790 THz (4*10^14-7.9*10^14)
380-750 nm (nanometers)
Human Eye
* Communications through the ground using conduction fields e.g. military communications.

Slot Time: It is twice the time it takes for an electronic pulse to travel the maximum distance between two nodes. Thus Propagation delay takes half of the time of slot time since it is only the measure of the time required for signal to reach from node A to B. Slot time is used for half-duplex Ethernet network operation. It is 512 bit times for Ethernet networks operating below 1 Gbit/s, and 4096 bit times for Gigabit Ethernet. To reliably detect collisions, the minimum transmission time for a complete frame must be at least one slot time, whereas the round-trip propagation delay must be less than a slot time (half of slot time).

Back-off Algorithm: Once a collision is detected by simultaneous transmitters, they will follow a backoff algorithm, which requires each transmitter to wait an integral number of slot times (51.2 µs) before attempting a new transmission sequence. The integer is determined by the equation:
0<=r<2 power k where k = min (n, 10)
The variable k is actually the number of collisions capped at a maximum of 10. Therefore, r can range from 0 to 1023. The actual value for r is determined by a random process within each Ethernet node. As the number of consecutive collisions increases, the range of possible backoff times increases exponentially. The number of possible retries is max. 16.
There are no collisions with a full-duplex link, where each node is paired with a port on the hub.

Collision Domain - a section of a network where data packets can collide with one another when being sent on a shared medium or through repeaters, in particular.

The 5-4-3 rule: A system can have up to five segments in series, with up to four repeaters and no more than three mixing segments (a segment that may be connected to more than two transceivers).

The FCS field in Ethernet frame provides only bit-level error detection, no error recovery.

UDP is also known as laissez-faire protocol

TCP is used for unicast addresses only, so multicast applications must use the UDP transport protocol.

In asynchronous transmission, the Start bit always has a value of 0 (a Space). The Stop Bit always has a value of 1 (a Mark). This means that there will always be a Mark (1) to Space (0) transition on the line at the start of every word.

Application layer is free to send any size of data, there is no upper limit defined by standards. The lower layers divides the data if needed.
A channel with x bps may not necessarily transmit data at x rate, since protocols, encryption, and other factors can add may overheads.

The asymptotic bandwidth (formally asymptotic throughput) for a network is the measure of maximum throughput for a greedy source (a traffic generator that generates data at the maximum rate possible and at the earliest opportunity possible).

CIDR: Classless Inter-Domain Routing, known as supernetting, is a solution to limited address space problem in a network. It allocates address space to ISPs and end users on any address bit boundary, instead of on 8-bit segments (which is class based addressing). It appends to the IP address a slash character and the decimal number as routing prefix, e.g., "192.168.2.0/24" for IPv4, and 2001:db8::/32 for IPv6. The value after / indicates how many bits are used for the network prefix, leaving the remaining bits to identify the specific host.

CIDR currently uses prefixes anywhere from 13 to 27 bits. This solution fits an organization's specific needs. It helps in reducing number of entries in global routing tables. It is the concept of subnetting within the internet itself.

The industrial, scientific and medical (ISM) radio bands are radio bands (portions of the radio spectrum) reserved internationally for industrial, scientific and medical purposes other than communications. These are for unlicensed operations. Cordless phones, Bluetooth devices, near field communication (NFC) devices, and wireless computer networks all use frequencies allocated to low power communications as well as ISM.
Hartley's law- "The maximum data rate of a physical communication link is proportional to its bandwidth in hertz, which is sometimes called frequency bandwidth, spectral bandwidth, RF bandwidth, signal bandwidth or analog bandwidth."
A Baud Rate represents the number of bits that are actually being sent over the media, not the amount of data that is actually moved from one DTE device to the other. That means, baud rate decides the actual bit rate. For example, the bit rate is 9600
The Intelligent Network (IN) is the standard network architecture which allows telecom operators to differentiate themselves by providing value-added services in addition to the standard telecom services. The intelligence is provided by network nodes on the service layer (a conceptual layer within a network service provider architecture. It aims at providing middleware that serves third-party value-added services and applications at a higher application layer.)

The Internet protocol suite ( TCP/IP Model), occasionally known as the DoD model due to the foundational influence of the ARPANET. The TCP/IP model and related protocols are maintained by the Internet Engineering Task Force (IETF).

PORT: Each process that wants to communicate with another process identifies itself to the TCP/IP protocol suite by one or more ports. Application Layer talks with Transport layer through ports. A port number helps the transport layer protocols (like TCP) to know the type of content residing inside the packet.
A port is a 16-bit number, used by the host-to-host protocol to identify to which higher level protocol or application program (process) it must deliver incoming messages. There are two types of ports. Well-known port numbers(0-1023) are typically odd, because early systems using the port concept required an odd/even pair of ports for duplex operations.
The well-known ports are controlled and assigned by the Internet Assigned Number Authority (IANA) and on most systems can only be used by system processes or by programs executed by privileged users. Ephemeral ports are opposite to well-known ports. Such port number are used by clients and are contained in the UDP datagrams sent to the server.

Normally, a server will use either TCP or UDP, but there are exceptions. For example, domain name servers use both UDP port 53 and TCP port 53.

SOCKET: A socket is a special type of file handle, which is used by a process to request network services from the operating system. A socket address is the triple: <protocol, local-address, local-process>. For example, in the TCP/IP suite:
<tcp, 193.44.234.3, 12345>
An association is the 5-tuple that completely specifies the two processes that comprise a connection:
<protocol, local-address, local-process, foreign-address, foreign-process>. In the TCP/IP suite, the following could be a valid association:
<tcp, 193.44.234.3, 1500, 193.44.234.5, 21>
Two processes communicate via TCP sockets. The socket model provides a process with a full-duplex byte stream connection to another process.

UDP: UDP is basically an application interface to IP. It adds no reliability, flow-control, or error recovery to IP. It simply serves as a multiplexer/demultiplexer for sending and receiving datagrams, using ports to direct the datagrams. It requires the application to take responsibility for error recovery and so on.
Slow-start is one of the algorithms that TCP uses to control congestion inside the network. It is also known as the exponential growth phase.
Broadband means "having instantaneous bandwidths greater than 1 MHz and supporting data rates greater than about 1.5 Mbit/s." In telecommunication, Broadband refers to a communication bandwidth of at least 256 kbit/s. Each channel is 6 MHz wide.
The additive-increase/multiplicative-decrease (AIMD) algorithm is a feedback control algorithm used by  TCP for Congestion Avoidance. The approach taken is to increase the transmission rate (window size), probing for usable bandwidth, until loss occurs.
IP address classes:
Class
Leftmost bits
Start address
Finish address
A
0xxx
0.0.0.0
127.255.255.255
B
10xx
128.0.0.0
191.255.255.255
C
110x
192.0.0.0
223.255.255.255
D
1110
224.0.0.0
239.255.255.255
E
1111
240.0.0.0
255.255.255.255

IP address range for Intranets (Private Networks):

Class
Private start address
Private finish address
A
10.0.0.0
10.255.255.255
B
172.16.0.0
172.31.255.255
C
192.168.0.0
192.168.255.255

IP packets addressed by them cannot be transmitted onto the public Internet. If such a private network needs to connect to the Internet, it must use either a network address translator (NAT) gateway, or a proxy server.In IPV6, The address block fc00::/7 has been reserved for private networks.
IP officially reserves the entire range from 127.0.0.0 through 127.255.255.255 for loopback purposes.
IPv6 does not use classes. IPv6 supports the following three IP address types: unicast, multicast and anycast. IPv6 does not support broadcast. Multicast addresses in IPv6 start with 'FF' (255) just like IPv4 addresses. Unicast addresses have 3 defined scopes, including link-local, site-local and global; and multicast addresses have 14 scopes.
The number of IPv6 addresses is 1028. There is no ARP in V6. Currently, DHCP, FTP, PPP, RIP, SNMP, VPN, L2TP and Telnet do not support IPv6.
IPv6 does not require NAT. NAT, too, doesn't support V6. Currently, IPv6 packets are not forwarded.
IPv6 reserves just two special addresses: 0:0:0:0:0:0:0:0 and 0:0:0:0:0:0:0:1. IPv6 uses 0:0:0:0:0:0:0:0 internal to the protocol implementation, so nodes cannot use it for their own communication purposes. IPv6 uses 0:0:0:0:0:0:0:1 as its loopback address, equivalent to 127.0.0.1 in IPv4. The minimum size of an IP datagram is 28 bytes, including 20 bytes of header.
BIND and NSD are the most widely used DNS software on the Internet
Anycast is a network addressing and routing methodology in which datagrams from a single sender are routed to the topologically nearest node in a group of potential receivers, though it may be sent to several nodes, all identified by the same destination address. On the Internet, anycast is usually implemented by using BGP.
In denial-of-service attacks, a rogue network host may advertise itself as an anycast server for a vital network service, to provide false information or simply block service.
"6 to 4" is an Internet transition mechanism for migrating from IPv4 to IPv6, a system that allows IPv6 packets to be transmitted over an IPv4 network. 6to4 does not facilitate interoperation between IPv4-only hosts and IPv6-only hosts, but simply a transparent mechanism used as a transport layer between IPv6 nodes.
The network requests supporting DNS lookups run over TCP and UDP, port 53 by default.

Saturday, 14 February 2015

Data Communications and networking 


Instructor: EL Zarki
Textbook: Data Communications and networking Fourth Edition Forouzan
Download Slides from here

ch1_v1.ppt

ch2_v1.ppt

ch3_1_v1.ppt

ch3_2_v1.ppt

ch3_3_v1.ppt

ch3_4_v1.ppt

ch3_5_v1.ppt

ch4_1_v1.ppt

ch4_2_v1.ppt

ch5_1_v1.ppt

ch5_2_v1.ppt

ch6_1_v1.ppt

ch6_2_v1.ppt

ch7_1_v1.ppt

ch10_1_v1.ppt

ch10_2_v1.ppt

courses.html

hw.html

outline.html

Cryptography and Network Security

Instructor : Mahalingam Ramkumar 

Overview  :Computer networks are vital infrastructures needed for our day to day lives. Our increasing reliance on computers and networks of computers calls for robust measures to secure this infrastructure from malicious intents.

Present day networks face continuous threats from hackers. An understanding of the potential perils, and the strengths and  limitations of existing solutions to this problem is relevant not only for students specializing in
security, but for every person for whom a computer is an indispensable part of life.

Cryptography, once considered to be solely restricted to the realm of spies and secret service agencies, is an increasingly important building block for realizing computer and network security. An understanding of the principles of cryptography is therefore essential for comprehending approaches to realize secure networks.

The course will introduce private and public key encryption, key distribution (Kerberos, public key infrastructure), cryptographic hash functions, digital signatures, IP Security, Secure Socket Layer, WEP (Wired Equivalent Privacy
for wireless networks),  intrusion detection, Firewalls, denial of service, spam, email viruses, phishing, and an overview of many attacks that the Internet has experienced, especially in the last decade.

Text : Cryptography and Network Security, Third Edition, by William Stallings, Prentice Hall, 2003

Additional References

  1. Cryptography, Theory and Practice, Douglas R. Stinson, 2nd Edition, CRC Press.
  2. A Course in Number Theory and Cryptography, Neal Koblitz
  3. Supplemental material that will be provided by the instructor in electronic form - usually in pdf format.
Download slides here :

Lecture Slides (PDF), Introduction

Lecture Slides (PDF), Symmetric Cryptography

Lecture Slides (PDF), Asymmetric Cryptography

Lecture Slides (PDF), Key Distribution

Kerberos (PDF)

Lecture Slides (PDF), Network Security

Lecture Slides (PDF), PGP

Lecture Slides (PDF), PGP

Lecture Slides (PDF), Web Security

Lecture Slides (PDF), IPsec

Lecture Slides (PDF), Wily Hacker

Lecture Slides (PDF), Intrusion Detection

Lecture Slides (PDF), Firewalls

Lecture Slides (PDF), Wireless Security

Cryptography Review

 

Computer Networks

Textbook: Computer Networks by Andrew Tanenbaum, 4th
Course Slides

Chapter 1: Introduction (slides)
Chapter 2: Physical Layer (slides)
Chapter 3: Datalink Layer (slides)
Chapter 4: MAC (part1part2)
Chapter 5: Network Layer (slides)

Text books required: Computer Networking: A top-down approach featuring the Internet, Kurose and Ross, 4th edition, Addison Wesley, 2008. (This year, 3rd edition is OK, too.)

Objectives:
Using the Internet as a vehicle, this course introduces the underlying concepts and principles of modern computer networks, with emphasis on protocols, architectures, and implementation issues. Students will first learn how to implement network applications (e.g., e-mail, ftp) using the existing network protocols and architectures. Students then study how/why these protocols and architectures work by using the layered organization of the Internet in a top-down fashion: Application, Transport, Network, Data Link and Physical layers. The course will also cover advance topics including quality-of-service (QoS), wireless networking.

Course Topics:
  • Introduction (Ch 1)
  • Application Layer (Ch 2)
  • Transport Layer (Ch 3)
  • Network Layer and Routing (Ch 4)
  • Physical Layer (Ch 5)
  • Wireless and Mobile Networks (Ch 6)
  • QoS and Multimedia Networking (Ch 7)

Class Notes

!! You need Microsoft PowerPoint to read/print slides. !! Thanks to Kurose and Ross for the slides
Chapter 2: (socket programming part is also available in C ch2-C.ppt)
Complete implementation of socket programming examples using TCP and using UDP in C.
·         Chapter 3: ch3.ppt
·         Chapter 4: ch4.ppt     
·         Chapter 5: ch5.ppt     
·         Chapter 6: ch6.ppt     
·         Chapter 7: ch7.ppt 

 

Principles, Techniques, & Tools of Compiler Design 



Instructor: R Sekhar
Textbook: Compilers: Principles, Techniques, and Tools, Second Edition by Aho, Sethi, and Ullman.
Download Slides from here

Lecture Notes:


  • Course Introduction PDF

  • Overview of Compiler PDF

  • Lexical Analysis PDF

  • Add'l Lexical Analysis Notes PDF

  • Context-Free Grammars and Parsing PDF

  • Syntax-directed translation PDF

  • Types PDF

  • Type Checking PDF TXT

  • Evaluation and Runtime Environments PDF

    • Variables, bindings, storage allocation TXT

    • Symbol Table PDF TXT

    • Expression evaluation and basic control-flow TXT

    • Parameter passing TXT

    • Object-oriented languages TXT


  • Exceptions, memory management PDF

  • Intermediate code generation PDF

  • Optimization and Program analysis PDF

  • Machine code generation PDF

  • Review/Summary PDF

 
COMPUTER CRYPTOGRAPHY

Lecture Slides
Here are links to the PDF, PowerPoint for the lecture slides.

Title
PDF
PowerPoint
Josh Benaloh: Practical Aspects of Modern Cryptography
PDF
John Manferdelli: Symmetric Key Ciphers and Hashes
Josh Benaloh: Public Key Ciphers
Homework 2 Solutions
Brian LaMacchia: Protocols, Part 1
Homework 3 Solutions
Brian LaMacchia: Protocols, Part 2
Homework 4 Solutions
John Manferdelli: Analysis of Block Ciphers
Homework 5 Solutions
John Manferdelli: AES and Attacks on Cryptographic Hashes
Homework 6 Solutions
Brian LaMacchia: Certificates, Trust & PKI
Homework 7 Solutions
Josh Benaloh: Public Key Crypto
Homework 8 Solutions
John Manferdelli: Digital Rights Management
Brian LaMacchia: The Politics of Crypto
Josh Benaloh: Attacks

C PROGRAMMING INSTRUCTOR: Dr. KHAMIS OMAR


 SLIDES :
  1. Introduction to C Programming
  2. Structured Program Development
  3. C++ Stream Input/Output
  4. Java Multimedia: Images, Animation, Audio and Video

    Computer Graphics


Instructor: R.J Renka
Textbook:introduction to Computer Graphics
Download slides from here
Introduction.pdf
Redbook Chapter 1
Redbook Chapter 2
Linear Algebra Basics
OpenGL Transformations
Transformation Algebra
Line Clipping
Light and Color
Reflection and Shading
Polygonal Surfaces
Quaternions
Fractals
Curve Fitting
INSTRUCTOR:Greg Humphreys

Description :
This course teaches the fundamental mathematics, algorithms, techniques, and programming skills for 2D and 3D graphics. Students will be well prepared to take any of our advanced courses in computer graphics.
This is not a course in the use of graphics software such as Photoshop or Maya. Rather, the course will teach the underpinnings of those programs. Although students will use OpenGL in this course, the focus will be on the underlying mechanisms of OpenGL rather than its sophisticated use.

SLIDES:

Introduction
1 9/7 Raster Graphics and Color
2 9/9 Image Processing and Sampling Warmup due
3 9/14 Image Warping, Compositing, and Morphing
4 9/16 3D Rendering
5 9/21 Ray Casting
6 9/23 Local Illumination Image Processing due
7 9/28 Transformations
8 9/30 Viewing, 3D Graphics Pipeline
9 10/5 Clipping
10 10/7 Scan Conversion: Lines, Circles, Fractals Raytracer due

COMPUTER ARCHITECTURE Instructor: Professor Sin-Min Lee




Lecture
Slides
Introduction
Discussion: Binary-Decimal Conversion
Number Systems and Boolean Algebra
Boolean Algebra and Karnaugh Maps
Karnaugh Maps
LogicWorks Tutorial
K-Maps and Circuit Analysis
Circuit Design [updated Feb 17]
Review
pdf 6-up ppt
Decoders
Multiplexers
Review
Addition and Multiplication
Subtraction
Midterm 1 Review
ALU
Review
Latches
Flip Flops
Review
Sequential Circuit Analysis
Sequential Circuit Design
Review
Counters
Registers
Review
RAM: Static Memory
Dynamic Memory, ROMs, and PLAs
Review
Midterm 2 Review
Midterm 2 (in class)

Datapath
Review
ppt
Instruction Set Architecture
Instruction Encoding
Review
Control Unit Introduction and Design
Microprogramming
Review
Other ISAs
Hamming Codes


Computer Communication Networks











 

COMPUTER LITERACY Instructor: Elaine Rich

                         Introduction

·         Computational Thinking
·         Python
·         Powerpoint
·         Notes
·         Binary Values
·         Encodings
·         Boolean Logic
·         Computer Organization
·         Algorithms
·         Part I
·         Part II
·         Easy, Hard, Impossible
·         Networks
·         Computer Security
·         Artificial Intelligence
·         Robots
·         Technology and the Future

 

COMPUTER ARCHITECTURE AND ENGINEERING

Instructor: Prof John Kubiatowicz

Expanded Description:

This course will give you an in-depth understanding of the inner-workings of modern digital computer systems and tradeoffs present at the hardware-software interface. You will get an understanding of the design process in the context of a complex hardware system and practical experience with computer-aided design tools. Topics include: Instruction set design, computer arithmetic, controller and datapath design, memory systems, input-output systems, networks interrupts and exceptions, pipelining, performance and cost analysis, computer architecture history, and a survey of advanced architectures. There will be a computer design project requiring 100+ hours. We will implement a major subset of the MIPS architecture to the gate level.

book:  We will be using the second edition of Patterson and Hennessy's Computer Organization and Design book. 
The "MIPS RISC Architecture" book will be essential for the project. 
"Computer Architecture: A Quantitative Approach" is an excellent reference, but is not required for the course.


Lec
No.
Lecture Topic
Click on lecture for WEB cast
Notes


1
Introduction, 5 components of a computer

2
Review of MIPS ISA, Performance

3
Logic Design, Technology & Delay Modeling


First Sections



Prerequisite Quiz: 
In class 


4
Performance and the Design process





5
High-Level design and FPGA

6
Verilog (finished), Multiplication






7
[Homework quiz #2 at beginning of lecture]
Single-Cycle Processor





8
Instruction Decode/Multicycle Processor

9
Multiprogramming/Exceptions
[ppt,ps,pdf]
handout:[ps,pdf]





10
Exceptions (continued), Pipelining
[ppt,ps,pdf

11
[Homework quiz #3 at beginning of lecture]
Pipelining (Continued)





12
Pipelining Control










13
Static Scheduling and compiler optimizations

14
Compiler Optimizations (continued), Dynamic Scheduling











15
Tomasulo Scheduling





16
[Homework quiz #4 at beginning of lecture]

Dynamic Scheduling (Con't), Speculation
[ppt,ps,pdf





17
 Speculation (Con't)
[ppt,ps,pdf]

18
Speculation (Finished), Memory Technology
[ppt,ps,pdf]


  


19
Memory Technology
[ppt,ps,pdf] 

20
Caches
[ppt,ps,pdf]

     
 
  

21
Virtual Memory
[ppt,ps,pdf]

22
Buses and I/O
[ppt,ps,pdf]





23
[Homework quiz #5 at beginning of lecture]

I/O and Queueing theory
[ppt,ps,pdf





24
Queueing Theory, I/O arrays
[ppt,ps,pdf





25
Low Power Design, Intel Processors






26
Quantum computing + Wrap-up Lecture: Look at all you have learned!





Computer and Programming

Lecture Slide (By Dr. Anan Pholperm )

Computational Geometry

Introduction and Objective

Introduction to data structures, algorithms, and analysis techniques for computational problems that involve geometry. Line segment intersection. Polygon triangulation and visibility problems. Linear programming. Range queries. Point location. Arrangements and duality. Voronoi diagrams and Delaunay triangulations. Convex hulls. Other selected topics. Programming assignments..
Textbook
M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Computational Geometry (2nd edition). Springer-Verlag, 2000. ISBN: 3-540-65620-0.
The book is accompanied by a website http://www.cs.uu.nl/geobook/ which provides additional material such as pointers to software and research papers. For general background on algorithms, you can consult the following.
J. Kleinberg and E. Tardos, Algorithm Design, Addison-Wesley, 2005; ISBN 0-321- 29535-8.

T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, Second Edition MIT Press, 2001; ISBN 0-262-03293-7
Slides download here.


Date Topic
Jan 12 Geometric Basics
Convex Hulls
Jan 14 Line Segment Intersection
Jan 19 Doubly-Connected Edge List
Overlay of Two Subdivisions
Jan 21 The Art Gallery Problem
(Graphs, BFS, DFS )
Jan 26 Triangulation
Jan 28 Half-Plane Intersection
Mar 23 Duality
Mar 25 Arrangement of Lines

 

Computational Complexity



Instructor : Andrej Bogdanov
Textbook : Computational complexity A conceptual perspective. Oded Goldreich
Download slides from here

Topicreading
Computational problems. P and NP. Hierarchy theorems.[pdf]
Circuits.[pdf]
Constant depth circuits. Lower bounds.[pdf]
Logarithmic space. Barrington and Immerman-Szelepcsényi theorems.[pdf]
Randomized computation.[pdf]
Pseudorandomness. The Nisan-Wigderson generator.[pdf]
Random walks and eigenvalues.[pdf]
Expanders. Undirected connectivity in log-space.[pdf]
The polynomial-time hierarchy. Oracles.[pdf]
Counting problems. Toda's theorem.[pdf]
Interactive proofs.
Guest lecture by Shengyu Zhang
[pdf]
Probabilistically checkable proofs.[pdf]
Proof of the PCP theorem.[pdf]

 

COMBINATORIAL AND GRAPH THEORY
INSTRUCTOR: Dr. CAR LEE

Course Information

Assignments

Other Resources

Interesting Websites


 Community Police  

To find your notes quickly please see the contents on the right hand side of this page which is alphabetically arranged and right click on it. After clicking immediately you find all the notes ppt / pdf / html / video of your searching subjects.

It is better to search your subject notes by clicking on search button which is present at middle of right side of this web page. Then enter your subject and press enter key then you can find all of your lectures notes and click on it.
Thank you for visiting our site.

Click here to download the files:-


     Chapter 1
     Chapter 2
     Chapter 3
     Chapter 4
     Chapter 6
     Chapter 7
     Chapter 8
     Chapter 9
     Chapter 10
     Chapter 11
     Chapter 12
     Chapter 13
     Chapter 14
     Chapter 15
   Chapter 16
   Chapter 20 

 

Computer System Security 

Instructor: R . Sekar
Textbook: Matt Bishop, Introduction to Computer Security, Addison Wesley
Download Slides from here


Description/Reading


Slides


Notes

Introduction: Overview of Security Threats
Emerging threats and research directions



Cryptography Basics
Reading: Who is guarding the guardians, or how secure are the CAs




Identification and Authentication
Reading: Lamport's One-Time Password Scheme
Reading: How anonymous hacked into a security firm




Discretionary Access Control
Reading: Revisiting "Setuid Demystified"




Capabilities, Mandatory Access Control
Reading: The Confused Deputy (or why capabilities might have been invented)



DTE and SELinux. POSIX Capabilities. Commercial Security Policies
Reading: Confining Root Programs with Domain and Type Enforcement



OS Security, UNIX Security, Database Security
Reading: Linux capabilities (alternative link)
Reading: SELinux




Principles and practices for secure system design
Reading: The Protection of Information in Computer Systems




Background: Runtime memory organization
TXT
Stack-smashing, Heap overflows and Format string attacks
Reading: Smashing the stack for fun and profit




Integer overflows
Memory corruption defenses: guarding, ASR, DSR, ...
Reading: Memory exploitation defenses in Windows
Optional Reading: (Not so) Recent advances in exploiting buffer overruns
Optional Reading: Basic Integer Overflows



Memory-error detection: Bounds-checking, etc.


Injection Attacks, Taint-tracking
Taint-enhanced policies
Reading: Taint-Enhanced Policy Enforcement




Race conditions and other Software vulnerabilities
Reading: Top 25 Software Vulnerabilities


PDF
Malware
Evasion, obfuscation, Software tamper-resistance
A very short article from 2011 on specific malware trends.




Securing Untrusted Code: System-call interception,
Inline-reference monitoring




Securing Untrusted Code: Inline-reference monitoring,
Software-based fault isolation, Control-flow integrity



Binary analysis and transformation: Disassembly, static binary rewriting
Dynamic translation




Untrusted Code: Java, Javascript and Web security



Untrusted Code: Virtual Machines


Intrusion detection overview
Host-based/Application layer Intrusion detection
Intrusion detection models
Reading: A sense of self for Unix processes




Vulnerability analysis: Program analysis overview,
Model-checking
Abstract interpretation



Course summary



Computer Networks and Internet 


Instructor: Hossam S. Hassanein
Textbook: Computer Networking: A Top-Down Approach, 6th edition. Addison-Wesley.
Download Slides from here

NLP Natural Language Processing 

Instructor: Rada Mihalcea
Textbook: Speech and Language Processing
Download slides from here
Lecture
Course overview [ppt]
Short Perl tutorial (I) [ppt]
Short Perl tutorial (II) [ppt]
Linguistics Essentials [ppt]
Language Models [ppt]
Language Models [ppt]
Language Models [ppt]
Collocations [ppt]
Morphological Processing [ppt]
Word classes and part of speech tagging ppt]
Word classes and part of speech tagging ppt]
HMM Tagging. Viterbi Algorithm. [ppt]
Context Free Grammars [ppt]
Parsing with Context Free Grammars [ppt]
Probabilistic Parsing [ppt]
Word Sense Disambiguation (1) [ppt]
Word Sense Disambiguation (2) [ppt]
Word Sense Disambiguation (3) [ppt]
Text semantic similarity [ppt]
Special topics: Subjectivity and sentiment analysis [ppt]
Special topics: Subjectivity and sentiment analysis [ppt]
Special topics. Logic form transformation [ppt]

Information Retrival 

IInstructor: Rada Mihalcea
Textbook:Introduction to Information Retrival ,Christopher D. Manning, Prabhakar Raghavan and Hinrich Schutze
Download slides from here
Lecture
Course overview (ppt)
Introduction to IR models and methods [ppt]
Short Perl tutorial [ppt]
Short Perl tutorial [ppt]
Short Perl tutorial [ppt]
Text processing [ppt]
Text processing [ppt]
Text properties [ppt]
Web Spidering [ppt]
Practical problems in web spidering [ppt]
Boolean model and extensions [ppt]
Vector space model [ppt]
Vector space model [ppt]
Term weighting schemes
Alternative IR models. [ppt]
IR evaluation and IR test collections. [ppt]
Relevance feedback. [ppt]
Relevance feedback. [ppt]
Text classification [ppt]
Text classification [ppt]
Link analysis. HITS. PageRank. [ppt]
Topic Sensitive PageRank
Question Answering [ppt]
Question Answering [ppt]
Cross language Information Retrieval (ppt)
Keyword Extraction (ppt)

 

Chemical Principles I

CHEM 110 (GN) Chemical Principles I (3) Basic concepts and quantitative relations
CHEM 110 is the first semester of a two-semester, comprehensive general chemistry course that introduces the students to the basic principles of chemistry with an emphasis on the relationships between the microscopic structure and macroscopic properties of matter. Principles are illustrated with a wide variety of examples from the sciences, engineering and technology, and from everyday life. The course covers the following topics: matter and measurement, molecules and molecular compounds, ions and ionic compounds, chemical reaction types, atomic and molecular weights, the mole, quantitative calculations with chemical reactions, the periodic table, nomenclature, aqueous reactions and solution stoichiometry, thermochemical, electronic structure of atoms, periodic properties of the elements, chemical bonding, molecular geometry, the gaseous, liquid, and solid states of matter, properties of solutions, some basic aspects of chemical equilibrium, and applications to the real world including environmental chemistry.  GN credit for CHEM 110 requires that CHEM 111 also be completed.
lectures :
Fall 2009 :

Lecture notes for Dr. Bojan's sections of Chemistry 110 will be posted here for viewing or downloading as each set of lecture notes becomes available.  To view a set of notes from a campus computer lab simply double click on any one of the underlined lectures.  From other computers see the notes provided below.


NOTE: these are not complete notes. Sections are intentionally left blank.

Lecture #1- Monday Aug, 24
Introduction and Chapter 1 
Lecture 4 Aug. 31 
Energy Light and Matter: Spectroscopy
 
Chapter 6 part 1

                      
Bohr Equation
Lecture 5 and 6- Sept. 1 and 3 
Chapter 6 part 2
Electronic Structure of Atoms (Electron Configurations)
Lecture #7- Sept. 9 
Chapter 7
Periodic Properties of atoms
Lecture #8  to 11- Sept. 11, 14, 16 and 18
Chapter 8
 
Ionic Bonding, Electronegativity and Lewis Structures
Lecture 12 Sept 22 Review
Lecture 13 and 14- Sept. 23 and 25
Chapt. 3 Sect. 3-5
Composition of molecules and Intro to Organic
 
                   
Lecture 15 Sept. 28
Organic Molecules
 
 Extra notes on
 fats
Lecture 17 Oct. 2 Chapter 9 part 2 

Molecular Geometry II: Polarity
Lecture 18 Oct. 5 
Hybrid Orbitals and Bonding
                     
Lecture #20 - Oct. 9 Intermolecular Forces
Lecture 21 Oct 12 Review for Exam 2
Lectures 22 & 23, Oct. 15 & 17
Chapter 10 part 1
Gases part 2
Lecture # 24- Oct. 19 
Non-Ideal Gases
Lecture #25 - Oct. 21 Chapter 18, 1-4
Atmospheric Chemistry
Lecture #26, 27- Oct. 23 and 26
Chapter 11 Liquids
Lecture #29 and 30- Oct. 28 and 30
Solutions I Chapter 4 electrolytes
Lecture #31 and 32 - Nov. 2, 4 and 6 
Solutions II
Solution Applications
Lecture #33 - Nov. 10 Exam 3 Review
Lecture #34 -37 -  Nov. 11, 13, 16, and 18
Chapter 3 and 4 Reactions and Stoichiometry
Template for Problem Solving 
Chapters 4 and 10 Reactions and stoichiometry
 
Lecture #37, 38- Nov. 18 and 20
Chapter 5
 Thermodynamics
Lecture # 39-  Nov. 30 
Chapter 5 Thermochemistry (Enthalpy)

Sample Problem 1 
if time allows
Sample Problem 2
Lecture #28 - Dec. 7 and 9 Equilibrium II
Concept Final
Read the instructions and try to have this done before the final Chem 110 lecture.
 

Calculus Lecture Notes

To view the following notes, you must have Adobe Reader .
Mac, DOS, Windows and SUN versions are available for download from Adobe 

 Gold Notes 

  1. Mathematical Sign Language
  2. Induction
  3. Polynomials and Rational Functions
  4. The Mean Value Theorem for Rational Functions
  5. Approximation of Rational Functions
  6. Solving Polynomial Equations
  7. Asymptotic Behaviour of Rational Functions
  8. Taylor Approximation
  9. Complex Numbers
  10. Gold Problems

 Redbook Notes 

  1. Review Notes
  2. Functions
  3. Limits and Continuity
  4. Techniques of Differentiation
  5. Related Rates
  6. Rolle's Theorem, the Mean Value Theorem, and L'Hopital's Rule
  7. Graph Sketching
  8. Estimating Functions
  9. Applications of Maxima and Minima
  10. Newton's Method
  11. The Definite Integral
  12. Techniques of Integration
  13. Applications of the Definite Integral
  14. Numerical Integration
  15. Taylor's Theorem
  16. Differential Equations

 Calculus Class Notes 

Copies of the classnotes are on the internet in PDF and Postscript formats as given below. I have included versions with both color figures and black and white figures (the "black and white" files are roughly 1/3 the size of the "color" files).

Chapter 1: Limits and Continuity.
  • Section 1-1: Rates of Change and Limits. PDF. PS.
  • Section 1-2: Finding Limits and One-Sided Limits. PDF. PS.
  • Section 1-3: Limits Involving Infinity. PDF. PS.
  • Section 1-4: Continuity. PDF. PS.
  • Section 1-5: Tangent Lines. PDF. PS.
  • Study Guide. PDF. PS.

Chapter 2: Derivatives.
  • Section 2-1: The Derivative as a Function. PDF. PS.
  • Section 2-2: The Derivative as a Rate of Change. PDF. PS.
  • Section 2-3: Derivatives of Products, Quotients, and Negative Powers. PDF. PS.
  • Section 2-4: Derivatives of Trigonometric Functions. PDF. PS.
  • Section 2-5: The Chain Rule and Parametric Equations. PDF. PS.
  • Section 2-6: Implicit Differentiation. PDF. PS.
  • Section 2-7: Related Rates. PDF. PS.
  • Study Guide. PDF. PS.

Chapter 3: Applications of Derivatives.
  • Section 3-1: Extreme Values of Functions. PDF. PS.
  • Section 3-2: The Mean Value Theorem and Differential Equations. PDF. PS.
  • Section 3-3: The Shape of a Graph. PDF. PS.
  • Section 3-4: Graphical Solutions of Autonomous Differential Equations. PDF. PS.
  • Section 3-5: Modeling and Optimization. PDF. PS.
  • Section 3-6: Linearization and Differentials. PDF. PS.
  • Section 3-7: Newton's Method. PDF. PS.
  • Study GuidePDF. PS.
Chapter 4: Integration.
  • Section 4-1: Indefinite Integrals, Differential Equations and Modeling. PDF. PS.
  • Section 4-2: Integral Rules; Integration by Substitution. PDF. PS.
  • Section 4-3: Estimating with Finite Sums. PDF. PS.
  • Section 4-4: Riemann Sums and Definite Integrals. PDF. PS.
  • Section 4-5: The Mean Value and Fundamental Theorems. PDF. PS.
  • Section 4-6: Substitution in Definite Integrals. PDF. PS.
  • Section 4-7: Numerical Integration. PDF. PS.
  • Study GuidePDF. PS.
Chapter 5: Applications of Integrals.
  • Section 5-1: Volumes by Slicing and Rotation About an Axis. PDF. PS.
  • Section 5-2: Modeling Using Cylindrical Shells. PDF. PS.
  • Section 5-3: Lengths of Plane Curves. PDF. PS.
  • Study GuidePDF. PS.
Chapter 5: Applications of Integrals.
  • Section 5.4: Springs, Pumping, and Lifting. PDF. PS.
  • Section 5.5: Fluid Forces. PDF. PS.
  • Section 5.6: Moments and Centers of Mass. PDF. PS.

Chapter 6: Transcendental Functions and Differential Equations.
  • Section 6.1: Logarithms. PDF. PS.
  • Section 6.2: Exponential Functions. PDF. PS.
  • Section 6.3: Derivatives of Inverse Trigonometric Functions; Integrals. PDF. PS.
  • Section 6.4: First-Order Seperable Differential Equations. PDF. PS.
  • Section 6.5: Linear First-Order Differential Equations. PDF. PS.
  • Section 6.6: Euler's Method: Population Models. PDF. PS.
  • Section 6.7: Hyperbolic Functions. PDF. PS.

Chapter 7: Integration Techniques, L'Hopital's Rule, and Improper Integrals.
  • Section 7.1: Basic Integration Formulas. PDF. PS.
  • Section 7.2: Integration by Parts. PDF. PS.
  • Section 7.3: Partial Fractions. PDF. PS.
  • Section 7.4: Trigonometric Substitution. PDF. PS.
  • Section 7.5: Integral Tables, Computer Algebra Systems, and Monte Carlo Integration. PDF. PS.
  • Section 7.6: L'Hopital's Rule. PDF. PS.
  • Section 7.7: Improper Integrals. PDF. PS.

Chapter 8: Infinite Series.
  • Section 8.1: Limits of Sequences of Numbers. PDF. PS.
  • Section 8.2: Subsequences, Bounded Sequences, and Picard's Method. PDF. PS.
  • Section 8.3: Infinite Series. PDF. PS.
  • Section 8.4: Series of Nonnegative Terms. PDF. PS.
  • Section 8.5: Alternating Series, Absolute and Conditional Convergence. PDF. PS.
  • Section 8.6: Power Series. PDF. PS.
  • Section 8.7: Taylor and Maclaurin Series. PDF. PS.
  • Section 8.8: Applications of Power Series. PDF. PS.
  • Section 8.9: Fourier Series. PDF. PS.
  • Section 8.10: Fourier Cosine and Sine Series. PDF. PS.

Files with Color
Figures Chapter1: Limits and Continuity.
  • Section 1-1: Rates of Change and Limits. PDF. PS.
  • Section 1-2: Finding Limits and One-Sided Limits. PDF. PS.
  • Section 1-3: Limits Involving Infinity. PDF. PS.
  • Section 1-4: Continuity. PDF. PS.
  • Section 1-5: Tangent Lines. PDF. PS.

Chapter 3: Applications of Derivatives.
  • Section 3-2: The Mean Value Theorem and Differential Equations. PDF. PS.
  • Section 3-7: Newton's Method. PDF. PS.
Chapter 4: Integration.
  • Section 4-4: Riemann Sums and Definite Integrals. PDF. PS.
  • Section 4-5: The Mean Value and Fundamental Theorems. PDF. PS.
  • Section 4-6: Substitution in Definite Integrals. PDF. PS.
  • Section 4-7: Numerical Integration. PDF. PS.
Chapter 5: Applications of Integrals.
  • Section 5-1: Volumes by Slicing and Rotation About an Axis. PDF. PS.
  • Section 5-2: Modeling Using Cylindrical Shells. PDF. PS.
  • Section 5-3: Lengths of Plane Curves. PDF. PS.
Chapter 5: Applications of Integrals.
  • Section 5.5: Fluid Forces. PDF. PS.
  • Section 5.6: Moments and Centers of Mass. PDF. PS.
Chapter 6: Transcendental Functions and Differential Equations.
  • Section 6.1: Logarithms. PDF. PS.
  • Section 6.2: Exponential Functions. PDF. PS.
  • Section 6.3: Derivatives of Inverse Trigonometric Functions; Integrals. PDF. PS.
  • Section 6.5: Linear First-Order Differential Equations. PDF. PS.
  • Section 6.6: Euler's Method: Population Models. PDF. PS.
  • Section 6.7: Hyperbolic Functions. PDF. PS.
Chapter 7: Integration Techniques, L'Hopital's Rule, and Improper Integrals.
  • Section 7.2: Integration by Parts. PDF. PS.
  • Section 7.5: Integral Tables, Computer Algebra Systems, and Monte Carlo Integration. PDF. PS.
  • Section 7.7: Improper Integrals. PDF. PS.
Chapter 8: Infinite Series.
  • Section 8.1: Limits of Sequences of Numbers. PDF. PS.
  • Section 8.2: Subsequences, Bounded Sequences, and Picard's Method. PDF. PS.
  • Section 8.4: Series of Nonnegative Terms. PDF. PS.
  • Section 8.5: Alternating Series, Absolute and Conditional Convergence. PDF. PS.
  • Section 8.7: Taylor and Maclaurin Series. PDF. PS.
  • Section 8.9: Fourier Series. PDF. PS.

Cell Physiology

Instructor:  Dr. Malgosia Wilk, M.D., Ph.D.  (M.A. Wilk-Blaszczak)
Course Prerequisites:   BIOL 1441, 1442. CHEM 2181 and BIOL 3315 are recommended.
Required Textbook:     Cell Biology by T.D. Pollard and W.C. Earnshaw

Student learning outcomes:
1.   Understand the fundamental physiological mechanisms of cell function.
2.   Know the scientific methods that are currently being used to explore cell physiology.

Download lectures slides :


Lecture Topic
Text
First Class
1

1

2

2,4

6

Exam I

Census Date
Exam review


7

10

8

10

9

10

17,18

19

20
End of first drop
20

21, 22

23

24

Exam II


Exam review

Midsemester
Overview of signaling
25
Spring Break



26

27




28

29
Last Drop
29

29

30,31

TBD


32

33

34

35, 36

37

38

Exam III


39

40, 41

42

Q and A




Comprehensive Final Wed May 9th 8-10:30 am

 

Process Dynamics and Control


Instructor: Seborg
Textbook:Process Dynamics and Control third Edition ,Seborg,Edgar,Mellichamp,doyle
Download Slides from here


Slides

Topics
Chapter 1Introduction
Feedback control
Chapter 2Mathematical modeling
Dynamic responses
Chapter 3Laplace transforms
Chapter 4Transfer functions
First order systems
Chapter 5Second order systems
Chapter 6Complex processes
Chapter 7Fitting models to data
Fitting models to data
Chapter 8PID controllers
Chapter 9Instrumentation and valves
Chapter 10
Chapter 11Closed loop transfer function
Block diagrams, Stability
Chapter 12Control loop analysis
 Chapter 13Overview of control system
Chapter 14Frequency response
Chapter 15Ratio control
Feedforward control
Air Heater Demonstration
Chapter 16Advanced control strategies
 Chapter 17Advanced control strategies
Chapter 18Multivariable control
Multivariable control
Chapter 19Real-time optimization
Chapter 20Modeel predictive Control
 Chapter 21Process monitoring
Chapter 22Batch Processing
Chapter 23Biosystem control design
Chapter 24Dynamics and Control of Biological system
Appendix A
AMD process control
Air Liquide Slides

Basic Software's for Academics


  1. C language Software
  2.  Java Beans BDK 1.1
  3. Turboc2
  4. Edit_Plus with Registration Key 
  5. jdk-1_5_0_02-windows-i586-p.exe.html
  6. apache-tomcat-5.5.17.exe.html
  7. FlashMX.rar.html