Physical Layer: Outline

Size: px
Start display at page:

Download "Physical Layer: Outline"

Transcription

1 18-: Intrductin t Telecmmunicatin Netwrks Lectures : Physical Layer Peter Steenkiste Spring 01 Physical Layer: Outline Digital Representatin f Infrmatin Characterizatin f Cmmunicatin Channels Fundamental Limits in Digital Transmissin Line Cding Mdems and Digital Mdulatin Prperties f Media and Digital Transmissin Systems Errr Detectin and Crrectin 1 Errr Cntrl Channels intrduce errrs in digital cmmunicatins Applicatins require certain reliability level Data applicatins require errr-free transfer Vice & vide applicatins tlerate sme errrs Errr cntrl may be needed t meet applicatin requirement Errr cntrl ensures a data stream is transmitted t a certain level f accuracy despite errrs Tw basic appraches: Errr detectin & retransmissin (ARQ) Frward errr crrectin (FEC) Key Idea All transmitted data blcks ( cdewrds ) are chsen s that they satisfy a pattern If received blck desn t satisfy pattern, it is in errr Redundancy: Only a subset f all pssible blcks can be valid cdewrds Undetectable Errr: When channel transfrms a cdewrd int anther valid cdewrd User infrmatin All inputs t channel satisfy pattern r cnditin Encder Channel Channel utput Pattern checking Deliver user infrmatin r set errr alarm 1

2 Single Parity Check Eample f Single Parity Cde Append an parity bit t k infrmatin bits Inf Bits: b 1, b, b,, b k Check Bit: b k+1 = b 1 + b + b + + b k mdul Cdewrd: (b 1, b, b,, b k,, b k+1 ) All cdewrds have even # f 1s Receiver checks t see if # f 1s is even All errr patterns that create an dd # f 1 bits are detectable All even-numbered errr patterns are undetectable ASCII cde is precisely such as cde (+1 bits) Infrmatin ( bits): (0, 1, 0, 1, 1, 0, 0) Parity Bit: b 8 = = 1 Cdewrd (8 bits): (0, 1, 0, 1, 1, 0, 0, 1) If single errr in bit : (0, 1, 1, 1, 1, 0, 0, 1) # f 1 s =, dd Errr detected If errrs in bits and : (0, 1, 1, 1, 0, 0, 0, 1) # f 1 s =, even Errr nt detected Parity Checkbits & Errr Detectin Infrmatin bits Calculate check bits k bits Sent check bits n k bits Channel Received check bits Received infrmatin bits Recalculate check bits Cmpare Infrmatin accepted if check bits match Hw gd is the single parity check cde? Redundancy: Single parity check cde adds 1 redundant bit per k infrmatin bits: verhead = 1/(k+1) Cverage: all errr patterns with dd # f errrs can be detected An errr pattern is a binary (k+1)-tuple with 1 s where errrs ccur and 0 s elsewhere Of k+1 binary (k+1)-tuples, ½ are dd, s 0% f errr patterns can be detected Is it pssible t detect mre errrs if we add mre check bits? Yes, with the right cdes 8

3 What if bit errrs are randm? Many transmissin channels intrduce bit errrs at randm, independently f each ther, and with prbability p Sme errr patterns are mre prbable than thers: 8 p P[ ] p(1 p) (1 p) ( ) and 1 p P[ ] p 8 p (1 p) (1 p) ( ) 1 p In any wrthwhile channel p<0., and s (p/(1-p))<1 It fllws that patterns with 1 errr are mre likely than patterns with errrs and s frth What is the prbability that an undetectable errr pattern ccurs? 9 Single parity check cde with randm bit errrs Undetectable errr pattern if even # f bit errrs: P[errr detectin failure] P[undetectable errr pattern] P[errr patterns with even number f 1s] n p (1 p) n p n n (1 p)... Eample: Evaluate abve fr n=, p=10 - P[undetectable errr] (10 ) (1 10 ) 0-9 (10 ) 90(10 (10 ) (1 10 ) 1 ).9(10 Fr this eample, rughly 1 in 000 transmissins will result in an undetectable errr ) 8 10 What is a gd cde? Mst channels will have relatively few bit errrs Errneus cdewrds transmitted ver thse channels will map t nearby n-tuples If valid cdewrds are clse t each ther, then detectin failures may ccur Gd cdes shuld maimize separatin between valid cdewrds = valid cdewrds = nn-cdewrds Pr distance prperties Gd distance prperties 11 Tw-Dimensinal Parity Check Mre parity bits t imprve cverage Arrange infrmatin as clumns Add single parity bit t each clumn Add a final parity clumn Used in early errr cntrl systems Bttm rw cnsists f check bit fr each clumn Last clumn cnsists f check bits fr each rw 1

4 Errr-detecting capability One errr Three errrs Tw errrs Fur errrs ,, r errrs can always be detected; Nt all patterns > errrs can be detected Other Errr Detectin Cdes Many applicatins require very lw errr rate Need cdes that detect mre number f errrs Single parity check cdes d nt detect enugh errrs Tw-dimensinal cdes require t many check bits The fllwing errr detecting cdes are widely used in practice: Internet Check Sums CRC Plynmial Cdes Arrws indicate failed check bits 1 1 Internet Checksum Several Internet prtcls (e.g. IP, TCP, UDP) use check bits t detect errrs in the header A checksum is calculated fr header cntents and included in a special field. Checksum is ptentially recalculated at every ruter, s algrithm selected fr ease f implementatin in sftware Let header cnsist f L, 1-bit wrds, b 0, b 1, b,..., b L-1 The algrithm appends a 1-bit checksum b L Checksum Calculatin The checksum b L is calculated as fllws: Treating each 1-bit wrd as an integer, find = b 0 + b 1 + b b L-1 mdul 1-1 The checksum is then given by: b L = - mdul 1-1 Thus, the headers must satisfy the fllwing pattern at the receiver: 0 = b 0 + b 1 + b b L-1 + b L mdul 1-1 The checksum calculatin is carried ut in sftware using ne s cmplement arithmetic 1 1

5 Internet Checksum Eample Use Mdul Arithmetic Assume -bit wrds Use md -1 (= 1) arithmetic b 0 =1100 = 1 b 1 =1010 = 10 b 0 +b 1 =1+10= md1 b = - = 8 md1 Therefre b =1000 Use Binary Arithmetic Nte 1 =1 md1 S: = 0001 md1 leading bit wraps arund b 0 + b 1 = =10110 = = =0111 = Take 1 s cmplement Plynmial Cdes Plynmials instead f vectrs fr cdewrds Plynmial arithmetic instead f check sums Implemented using shift-register circuits Als called cyclic redundancy check (CRC) Mst data cmmunicatins standards use plynmial cdes fr errr detectin Have very simple hardware implementatins Plynmial cdes als basis fr pwerful errr-crrectin methds b = = Additin: Binary Plynmial Arithmetic Binary vectrs map t plynmials k 1 k 1 ( ik 1, ik,..., i, i1, i0 ) ik 1 ik... i i1 i0 ( 1) ( Multiplicatin: ( 1)( ) (1 1) 1) ( 1 ( since md 1) 1( ) ( 1) 1) 19 Binary Plynmial Divisin Divisin with Decimal Numbers divisr ) Plynmial Divisin divisr qutient dividend remainder Nte: Degree f r() is less than degree f divisr dividend = qutient divisr + remainder ) + 1 = = q() qutient dividend = r() remainder 0

6 i Plynmial Cding k infrmatin bits define plynmial f degree k-1 k 1 k ( ) ik 1 ik... i i1 i0 Cde has binary generating plynmial f degree n-k nk nk 1 g( ) g nk 1... g g1 1 Find remainder plynmial f at mst degree n-k-1 q() g() ) n-k i() n-k i() = q()g() + r() r() Define the cdewrd plynmial f degree n-1 b() = n-k i() + r() n bits k bits n-k bits 1 Plynmial eample: k=, n-k= Generatr plynmial: g()= Infrmatin: (1,1,0,0) i() = + Encding: i() = ) ) Transmitted cdewrd: b() = + + b = (1,1,0,0,0,1,0) 010 The Pattern in Plynmial Cding All cdewrds satisfy the fllwing pattern: b() = n-k i() + r() = q()g() + r() + r() = q()g() All cdewrds are a multiple f g()! Receiver shuld divide received n-tuple by g() and check if remainder is zer If remainder is nn-zer, then received n-tuple is nt a cdewrd Shift-Register Implementatin 1. Accept infrmatin bits i k-1,i k-,,i,i 1,i 0. Append n-k zers t infrmatin bits. Feed sequence t shift-register circuit that perfrms plynmial divisin. After n shifts, the shift register cntains the remainder

7 Feedback-Shift Register Circuit Undetectable errr patterns + Encder fr g ( ) 1 g 0 1 Reg 0 + g 1 1 0,0,0,i 0,i 1,i,i g = 0 Reg 1 Reg Clck Input Reg 0 Reg 1 Reg = i = i = i = i Check bits: r 0 = 0 r 1 = 1 r = 0 r() = g 1 (Transmitter) b() (Channel) + e() (Receiver) Errr plynmial R()=b()+e() e() has 1 s in errr lcatins & 0 s elsewhere Receiver divides the received plynmial R() by g() Undetectable errr: If e() is a multiple f g(), that is, e() is a nn-zer cdewrd, then R() = b() + e() = q()g() + q ()g() The set f undetectable errr plynmials is the set f nnzer cde plynmials Chse the generatr plynmial s that selected errr patterns can be detected. Designing gd plynmial cdes Select generatr plynmial s that likely errr patterns are nt multiples f g() Detecting Single Errrs e() = i fr errr in lcatin i+1 If g() has mre than 1 term, it cannt divide i Detecting Duble Errrs e() = i + j = i ( j-i +1) where j>i If g() has mre than 1 term, it cannt divide i If g() is a primitive plynmial, it cannt divide m +1 fr all m< n-k -1 (Need t keep cdewrd length less than n-k -1) Primitive plynmials can be fund by cnsulting cding thery bks Standard Generatr Plynmials CRC-8: CRC-1: CCITT-1: CCITT-: CRC = cyclic redundancy check 8 1 ATM ( 1)( 1 1) Bisync HDLC, XMODEM, V.1 IEEE 80, DD, V

8 Hamming Cdes Class f errr-crrecting cdes Capable f crrecting all single-errr patterns Fr each m >, there is a Hamming cde f length n= m -1 with n-k=m parity check bits m n= m -1 k=n-m m/n / 1 11 /1 1 /1 / Redundancy 9 m= Hamming Cde Infrmatin bits are b 1, b, b, b Equatins fr parity checks b, b, b b b b b1 + b b 1 b b b b b b There are =1 cdewrds (0,0,0,0,0,0,0) is a cdewrd 0 Hamming (,) cde Infrmatin Cdewrd Weight b 1 b b b b 1 b b b b b b w(b) Minimum distance f any Hamming Cde = Set f n- tuples within distance 1 f b 1 b 1 b Distance Set f n- tuples within distance 1 f b Spheres f distance 1 arund each cdewrd d nt verlap If a single errr ccurs, the resulting n-tuple will be in a unique sphere arund the riginal cdewrd Thus, receiver can crrect errneus receptin back t riginal cdewrd 8

9 Physical Layer: Summary Digital Representatin f Infrmatin Characterizatin f Cmmunicatin Channels Fundamental Limits in Digital Transmissin Line Cding Mdems and Digital Mdulatin Prperties f Media and Digital Transmissin Systems Errr Detectin and Crrectin 9

Chapter 3 Digital Transmission Fundamentals

Chapter 3 Digital Transmission Fundamentals Chapter 3 Digital Transmissin Fundamentals Errr Detectin and Crrectin Errr Cntrl Digital transmissin systems intrduce errrs, BER ranges frm 10-3 fr wireless t 10-9 fr ptical fiber Applicatins require certain

More information

From Signals to Packets. Outline : Introduction to Telecommunication Networks Lectures 5: Datalink layer. Error Control.

From Signals to Packets. Outline : Introduction to Telecommunication Networks Lectures 5: Datalink layer. Error Control. 8-45: Intrductin t Telecmmunicatin Netwrks Lectures 5: Datalink layer Peter Steenkiste Frm Signals t Packets Analg Signal Digital Signal Bit Stream 0 0 0 0 0 0 Spring 05 www.cs.cmu.edu/~prs/nets-ece Packets

More information

Chapter 3 Digital Transmission Fundamentals

Chapter 3 Digital Transmission Fundamentals Chapter 3 Digital Transmissin Fundamentals Errr Detectin and Crrectin CSE 3213, Winter 2010 Instructr: Frhar Frzan Mdul-2 Arithmetic Mdul 2 arithmetic is perfrmed digit y digit n inary numers. Each digit

More information

ENG2410 Digital Design Arithmetic Circuits

ENG2410 Digital Design Arithmetic Circuits ENG24 Digital Design Arithmetic Circuits Fall 27 S. Areibi Schl f Engineering University f Guelph Recall: Arithmetic -- additin Binary additin is similar t decimal arithmetic N carries + + Remember: +

More information

RECHERCHES Womcodes constructed with projective geometries «Womcodes» construits à partir de géométries projectives Frans MERKX (') École Nationale Su

RECHERCHES Womcodes constructed with projective geometries «Womcodes» construits à partir de géométries projectives Frans MERKX (') École Nationale Su Wmcdes cnstructed with prjective gemetries «Wmcdes» cnstruits à partir de gémétries prjectives Frans MERKX (') Écle Natinale Supérieure de Télécmmunicatins (ENST), 46, rue Barrault, 75013 PARIS Étudiant

More information

Pattern Recognition 2014 Support Vector Machines

Pattern Recognition 2014 Support Vector Machines Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft

More information

, which yields. where z1. and z2

, which yields. where z1. and z2 The Gaussian r Nrmal PDF, Page 1 The Gaussian r Nrmal Prbability Density Functin Authr: Jhn M Cimbala, Penn State University Latest revisin: 11 September 13 The Gaussian r Nrmal Prbability Density Functin

More information

Determining the Accuracy of Modal Parameter Estimation Methods

Determining the Accuracy of Modal Parameter Estimation Methods Determining the Accuracy f Mdal Parameter Estimatin Methds by Michael Lee Ph.D., P.E. & Mar Richardsn Ph.D. Structural Measurement Systems Milpitas, CA Abstract The mst cmmn type f mdal testing system

More information

Medium Scale Integrated (MSI) devices [Sections 2.9 and 2.10]

Medium Scale Integrated (MSI) devices [Sections 2.9 and 2.10] EECS 270, Winter 2017, Lecture 3 Page 1 f 6 Medium Scale Integrated (MSI) devices [Sectins 2.9 and 2.10] As we ve seen, it s smetimes nt reasnable t d all the design wrk at the gate-level smetimes we just

More information

Public Key Cryptography. Tim van der Horst & Kent Seamons

Public Key Cryptography. Tim van der Horst & Kent Seamons Public Key Cryptgraphy Tim van der Hrst & Kent Seamns Last Updated: Oct 5, 2017 Asymmetric Encryptin Why Public Key Crypt is Cl Has a linear slutin t the key distributin prblem Symmetric crypt has an expnential

More information

k-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels

k-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels Mtivating Example Memry-Based Learning Instance-Based Learning K-earest eighbr Inductive Assumptin Similar inputs map t similar utputs If nt true => learning is impssible If true => learning reduces t

More information

ENG2410 Digital Design Sequential Circuits: Part B

ENG2410 Digital Design Sequential Circuits: Part B ENG24 Digital Design Sequential Circuits: Part B Fall 27 S. Areibi Schl f Engineering University f Guelph Analysis f Sequential Circuits Earlier we learned hw t analyze cmbinatinal circuits We will extend

More information

Department of Electrical Engineering, University of Waterloo. Introduction

Department of Electrical Engineering, University of Waterloo. Introduction Sectin 4: Sequential Circuits Majr Tpics Types f sequential circuits Flip-flps Analysis f clcked sequential circuits Mre and Mealy machines Design f clcked sequential circuits State transitin design methd

More information

An Area Efficient (31, 16) BCH Decoder for Three Errors

An Area Efficient (31, 16) BCH Decoder for Three Errors An Area Efficient (31, 16) BCH Decder fr Three Errrs M. Prashanthi 1, P. Samundiswary 2 1 M. Tech, Department f Electrnics Engineering, Pndicherry University, Pndicherry, India 2 Assistant Prfessr, Department

More information

5 th grade Common Core Standards

5 th grade Common Core Standards 5 th grade Cmmn Cre Standards In Grade 5, instructinal time shuld fcus n three critical areas: (1) develping fluency with additin and subtractin f fractins, and develping understanding f the multiplicatin

More information

Support-Vector Machines

Support-Vector Machines Supprt-Vectr Machines Intrductin Supprt vectr machine is a linear machine with sme very nice prperties. Haykin chapter 6. See Alpaydin chapter 13 fr similar cntent. Nte: Part f this lecture drew material

More information

Chapter 3: Cluster Analysis

Chapter 3: Cluster Analysis Chapter 3: Cluster Analysis } 3.1 Basic Cncepts f Clustering 3.1.1 Cluster Analysis 3.1. Clustering Categries } 3. Partitining Methds 3..1 The principle 3.. K-Means Methd 3..3 K-Medids Methd 3..4 CLARA

More information

This section is primarily focused on tools to aid us in finding roots/zeros/ -intercepts of polynomials. Essentially, our focus turns to solving.

This section is primarily focused on tools to aid us in finding roots/zeros/ -intercepts of polynomials. Essentially, our focus turns to solving. Sectin 3.2: Many f yu WILL need t watch the crrespnding vides fr this sectin n MyOpenMath! This sectin is primarily fcused n tls t aid us in finding rts/zers/ -intercepts f plynmials. Essentially, ur fcus

More information

/ / Chemistry. Chapter 1 Chemical Foundations

/ / Chemistry. Chapter 1 Chemical Foundations Name Chapter 1 Chemical Fundatins Advanced Chemistry / / Metric Cnversins All measurements in chemistry are made using the metric system. In using the metric system yu must be able t cnvert between ne

More information

Interference is when two (or more) sets of waves meet and combine to produce a new pattern.

Interference is when two (or more) sets of waves meet and combine to produce a new pattern. Interference Interference is when tw (r mre) sets f waves meet and cmbine t prduce a new pattern. This pattern can vary depending n the riginal wave directin, wavelength, amplitude, etc. The tw mst extreme

More information

CS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007

CS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007 CS 477/677 Analysis f Algrithms Fall 2007 Dr. Gerge Bebis Curse Prject Due Date: 11/29/2007 Part1: Cmparisn f Srting Algrithms (70% f the prject grade) The bjective f the first part f the assignment is

More information

Source Coding Fundamentals

Source Coding Fundamentals Surce Cding Fundamentals Surce Cding Fundamentals Thmas Wiegand Digital Image Cmmunicatin 1 / 54 Surce Cding Fundamentals Outline Intrductin Lssless Cding Huffman Cding Elias and Arithmetic Cding Rate-Distrtin

More information

Multiple Source Multiple. using Network Coding

Multiple Source Multiple. using Network Coding Multiple Surce Multiple Destinatin Tplgy Inference using Netwrk Cding Pegah Sattari EECS, UC Irvine Jint wrk with Athina Markpulu, at UCI, Christina Fraguli, at EPFL, Lausanne Outline Netwrk Tmgraphy Gal,

More information

T Algorithmic methods for data mining. Slide set 6: dimensionality reduction

T Algorithmic methods for data mining. Slide set 6: dimensionality reduction T-61.5060 Algrithmic methds fr data mining Slide set 6: dimensinality reductin reading assignment LRU bk: 11.1 11.3 PCA tutrial in mycurses (ptinal) ptinal: An Elementary Prf f a Therem f Jhnsn and Lindenstrauss,

More information

initially lcated away frm the data set never win the cmpetitin, resulting in a nnptimal nal cdebk, [2] [3] [4] and [5]. Khnen's Self Organizing Featur

initially lcated away frm the data set never win the cmpetitin, resulting in a nnptimal nal cdebk, [2] [3] [4] and [5]. Khnen's Self Organizing Featur Cdewrd Distributin fr Frequency Sensitive Cmpetitive Learning with One Dimensinal Input Data Aristides S. Galanpuls and Stanley C. Ahalt Department f Electrical Engineering The Ohi State University Abstract

More information

ENG2410 Digital Design Sequential Circuits: Part A

ENG2410 Digital Design Sequential Circuits: Part A ENG2410 Digital Design Sequential Circuits: Part A Fall 2017 S. Areibi Schl f Engineering University f Guelph Week #6 Tpics Sequential Circuit Definitins Latches Flip-Flps Delays in Sequential Circuits

More information

Turing Machines. Human-aware Robotics. 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Announcement:

Turing Machines. Human-aware Robotics. 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Announcement: Turing Machines Human-aware Rbtics 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Annuncement: q q q q Slides fr this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse355/lectures/tm-ii.pdf

More information

Computational modeling techniques

Computational modeling techniques Cmputatinal mdeling techniques Lecture 4: Mdel checing fr ODE mdels In Petre Department f IT, Åb Aademi http://www.users.ab.fi/ipetre/cmpmd/ Cntent Stichimetric matrix Calculating the mass cnservatin relatins

More information

The blessing of dimensionality for kernel methods

The blessing of dimensionality for kernel methods fr kernel methds Building classifiers in high dimensinal space Pierre Dupnt Pierre.Dupnt@ucluvain.be Classifiers define decisin surfaces in sme feature space where the data is either initially represented

More information

ENG2410 Digital Design Sequencing and Control

ENG2410 Digital Design Sequencing and Control ENG24 igital esign equencing and ntrl atapath cnsists f: Parts f PU Registers, Multiplers, dders, ubtractrs and lgic t perfrm peratins n data (mb Lgic) ntrl unit Generates signals t cntrl data-path ccepts

More information

SOME CONSTRUCTIONS OF OPTIMAL BINARY LINEAR UNEQUAL ERROR PROTECTION CODES

SOME CONSTRUCTIONS OF OPTIMAL BINARY LINEAR UNEQUAL ERROR PROTECTION CODES Philips J. Res. 39, 293-304,1984 R 1097 SOME CONSTRUCTIONS OF OPTIMAL BINARY LINEAR UNEQUAL ERROR PROTECTION CODES by W. J. VAN OILS Philips Research Labratries, 5600 JA Eindhven, The Netherlands Abstract

More information

Video Encoder Control

Video Encoder Control Vide Encder Cntrl Thmas Wiegand Digital Image Cmmunicatin 1 / 41 Outline Intrductin Encder Cntrl using Lagrange multipliers Lagrangian ptimizatin Lagrangian bit allcatin Lagrangian Optimizatin in Hybrid

More information

Name AP CHEM / / Chapter 1 Chemical Foundations

Name AP CHEM / / Chapter 1 Chemical Foundations Name AP CHEM / / Chapter 1 Chemical Fundatins Metric Cnversins All measurements in chemistry are made using the metric system. In using the metric system yu must be able t cnvert between ne value and anther.

More information

ENSC Discrete Time Systems. Project Outline. Semester

ENSC Discrete Time Systems. Project Outline. Semester ENSC 49 - iscrete Time Systems Prject Outline Semester 006-1. Objectives The gal f the prject is t design a channel fading simulatr. Upn successful cmpletin f the prject, yu will reinfrce yur understanding

More information

MODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards:

MODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards: MODULE FOUR This mdule addresses functins SC Academic Standards: EA-3.1 Classify a relatinship as being either a functin r nt a functin when given data as a table, set f rdered pairs, r graph. EA-3.2 Use

More information

Resampling Methods. Cross-validation, Bootstrapping. Marek Petrik 2/21/2017

Resampling Methods. Cross-validation, Bootstrapping. Marek Petrik 2/21/2017 Resampling Methds Crss-validatin, Btstrapping Marek Petrik 2/21/2017 Sme f the figures in this presentatin are taken frm An Intrductin t Statistical Learning, with applicatins in R (Springer, 2013) with

More information

Homology groups of disks with holes

Homology groups of disks with holes Hmlgy grups f disks with hles THEOREM. Let p 1,, p k } be a sequence f distinct pints in the interir unit disk D n where n 2, and suppse that fr all j the sets E j Int D n are clsed, pairwise disjint subdisks.

More information

the results to larger systems due to prop'erties of the projection algorithm. First, the number of hidden nodes must

the results to larger systems due to prop'erties of the projection algorithm. First, the number of hidden nodes must M.E. Aggune, M.J. Dambrg, M.A. El-Sharkawi, R.J. Marks II and L.E. Atlas, "Dynamic and static security assessment f pwer systems using artificial neural netwrks", Prceedings f the NSF Wrkshp n Applicatins

More information

Biochemistry Summer Packet

Biochemistry Summer Packet Bichemistry Summer Packet Science Basics Metric Cnversins All measurements in chemistry are made using the metric system. In using the metric system yu must be able t cnvert between ne value and anther.

More information

NUMBERS, MATHEMATICS AND EQUATIONS

NUMBERS, MATHEMATICS AND EQUATIONS AUSTRALIAN CURRICULUM PHYSICS GETTING STARTED WITH PHYSICS NUMBERS, MATHEMATICS AND EQUATIONS An integral part t the understanding f ur physical wrld is the use f mathematical mdels which can be used t

More information

^YawataR&D Laboratory, Nippon Steel Corporation, Tobata, Kitakyushu, Japan

^YawataR&D Laboratory, Nippon Steel Corporation, Tobata, Kitakyushu, Japan Detectin f fatigue crack initiatin frm a ntch under a randm lad C. Makabe," S. Nishida^C. Urashima,' H. Kaneshir* "Department f Mechanical Systems Engineering, University f the Ryukyus, Nishihara, kinawa,

More information

o o IMPORTANT REMINDERS Reports will be graded largely on their ability to clearly communicate results and important conclusions.

o o IMPORTANT REMINDERS Reports will be graded largely on their ability to clearly communicate results and important conclusions. BASD High Schl Frmal Lab Reprt GENERAL INFORMATION 12 pt Times New Rman fnt Duble-spaced, if required by yur teacher 1 inch margins n all sides (tp, bttm, left, and right) Always write in third persn (avid

More information

Experiment #3. Graphing with Excel

Experiment #3. Graphing with Excel Experiment #3. Graphing with Excel Study the "Graphing with Excel" instructins that have been prvided. Additinal help with learning t use Excel can be fund n several web sites, including http://www.ncsu.edu/labwrite/res/gt/gt-

More information

Section 6-2: Simplex Method: Maximization with Problem Constraints of the Form ~

Section 6-2: Simplex Method: Maximization with Problem Constraints of the Form ~ Sectin 6-2: Simplex Methd: Maximizatin with Prblem Cnstraints f the Frm ~ Nte: This methd was develped by Gerge B. Dantzig in 1947 while n assignment t the U.S. Department f the Air Frce. Definitin: Standard

More information

ECE 2100 Circuit Analysis

ECE 2100 Circuit Analysis ECE 2100 Circuit Analysis Lessn 25 Chapter 9 & App B: Passive circuit elements in the phasr representatin Daniel M. Litynski, Ph.D. http://hmepages.wmich.edu/~dlitynsk/ ECE 2100 Circuit Analysis Lessn

More information

Copyright Paul Tobin 63

Copyright Paul Tobin 63 DT, Kevin t. lectric Circuit Thery DT87/ Tw-Prt netwrk parameters ummary We have seen previusly that a tw-prt netwrk has a pair f input terminals and a pair f utput terminals figure. These circuits were

More information

On small defining sets for some SBIBD(4t - 1, 2t - 1, t - 1)

On small defining sets for some SBIBD(4t - 1, 2t - 1, t - 1) University f Wllngng Research Online Faculty f Infrmatics - Papers (Archive) Faculty f Engineering and Infrmatin Sciences 992 On small defining sets fr sme SBIBD(4t -, 2t -, t - ) Jennifer Seberry University

More information

MATHEMATICS SYLLABUS SECONDARY 5th YEAR

MATHEMATICS SYLLABUS SECONDARY 5th YEAR Eurpean Schls Office f the Secretary-General Pedaggical Develpment Unit Ref. : 011-01-D-8-en- Orig. : EN MATHEMATICS SYLLABUS SECONDARY 5th YEAR 6 perid/week curse APPROVED BY THE JOINT TEACHING COMMITTEE

More information

B. Definition of an exponential

B. Definition of an exponential Expnents and Lgarithms Chapter IV - Expnents and Lgarithms A. Intrductin Starting with additin and defining the ntatins fr subtractin, multiplicatin and divisin, we discvered negative numbers and fractins.

More information

5 th Grade Goal Sheet

5 th Grade Goal Sheet 5 th Grade Gal Sheet Week f Nvember 26 th, 2018 Frm Ms. Simmns: Upcming dates: 11/26 Thanksgiving Break Packets are due 12/4 Prgress Reprts fr 2 nd Quarter 12/5 12/7 Benchmark Testing 12/11- Parent Partnership

More information

Purpose: Use this reference guide to effectively communicate the new process customers will use for creating a TWC ID. Mobile Manager Call History

Purpose: Use this reference guide to effectively communicate the new process customers will use for creating a TWC ID. Mobile Manager Call History Purpse: Use this reference guide t effectively cmmunicate the new prcess custmers will use fr creating a TWC ID. Overview Beginning n January 28, 2014 (Refer t yur Knwledge Management System fr specific

More information

Sections 15.1 to 15.12, 16.1 and 16.2 of the textbook (Robbins-Miller) cover the materials required for this topic.

Sections 15.1 to 15.12, 16.1 and 16.2 of the textbook (Robbins-Miller) cover the materials required for this topic. Tpic : AC Fundamentals, Sinusidal Wavefrm, and Phasrs Sectins 5. t 5., 6. and 6. f the textbk (Rbbins-Miller) cver the materials required fr this tpic.. Wavefrms in electrical systems are current r vltage

More information

Chapter 3 Kinematics in Two Dimensions; Vectors

Chapter 3 Kinematics in Two Dimensions; Vectors Chapter 3 Kinematics in Tw Dimensins; Vectrs Vectrs and Scalars Additin f Vectrs Graphical Methds (One and Tw- Dimensin) Multiplicatin f a Vectr b a Scalar Subtractin f Vectrs Graphical Methds Adding Vectrs

More information

DEFENSE OCCUPATIONAL AND ENVIRONMENTAL HEALTH READINESS SYSTEM (DOEHRS) ENVIRONMENTAL HEALTH SAMPLING ELECTRONIC DATA DELIVERABLE (EDD) GUIDE

DEFENSE OCCUPATIONAL AND ENVIRONMENTAL HEALTH READINESS SYSTEM (DOEHRS) ENVIRONMENTAL HEALTH SAMPLING ELECTRONIC DATA DELIVERABLE (EDD) GUIDE DEFENSE OCCUPATIOL AND ENVIRONMENTAL HEALTH READINESS SYSTEM (DOEHRS) ENVIRONMENTAL HEALTH SAMPLING ELECTRONIC DATA DELIVERABLE (EDD) GUIDE 20 JUNE 2017 V1.0 i TABLE OF CONTENTS 1 INTRODUCTION... 1 2 CONCEPT

More information

Chemistry 20 Lesson 11 Electronegativity, Polarity and Shapes

Chemistry 20 Lesson 11 Electronegativity, Polarity and Shapes Chemistry 20 Lessn 11 Electrnegativity, Plarity and Shapes In ur previus wrk we learned why atms frm cvalent bnds and hw t draw the resulting rganizatin f atms. In this lessn we will learn (a) hw the cmbinatin

More information

You need to be able to define the following terms and answer basic questions about them:

You need to be able to define the following terms and answer basic questions about them: CS440/ECE448 Sectin Q Fall 2017 Midterm Review Yu need t be able t define the fllwing terms and answer basic questins abut them: Intr t AI, agents and envirnments Pssible definitins f AI, prs and cns f

More information

(2) Even if such a value of k was possible, the neutrons multiply

(2) Even if such a value of k was possible, the neutrons multiply CHANGE OF REACTOR Nuclear Thery - Curse 227 POWER WTH REACTVTY CHANGE n this lessn, we will cnsider hw neutrn density, neutrn flux and reactr pwer change when the multiplicatin factr, k, r the reactivity,

More information

[COLLEGE ALGEBRA EXAM I REVIEW TOPICS] ( u s e t h i s t o m a k e s u r e y o u a r e r e a d y )

[COLLEGE ALGEBRA EXAM I REVIEW TOPICS] ( u s e t h i s t o m a k e s u r e y o u a r e r e a d y ) (Abut the final) [COLLEGE ALGEBRA EXAM I REVIEW TOPICS] ( u s e t h i s t m a k e s u r e y u a r e r e a d y ) The department writes the final exam s I dn't really knw what's n it and I can't very well

More information

1 The limitations of Hartree Fock approximation

1 The limitations of Hartree Fock approximation Chapter: Pst-Hartree Fck Methds - I The limitatins f Hartree Fck apprximatin The n electrn single determinant Hartree Fck wave functin is the variatinal best amng all pssible n electrn single determinants

More information

IAML: Support Vector Machines

IAML: Support Vector Machines 1 / 22 IAML: Supprt Vectr Machines Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester 1 2 / 22 Outline Separating hyperplane with maimum margin Nn-separable training data Epanding the input int

More information

Time, Synchronization, and Wireless Sensor Networks

Time, Synchronization, and Wireless Sensor Networks Time, Synchrnizatin, and Wireless Sensr Netwrks Part II Ted Herman University f Iwa Ted Herman/March 2005 1 Presentatin: Part II metrics and techniques single-hp beacns reginal time znes ruting-structure

More information

CHM112 Lab Graphing with Excel Grading Rubric

CHM112 Lab Graphing with Excel Grading Rubric Name CHM112 Lab Graphing with Excel Grading Rubric Criteria Pints pssible Pints earned Graphs crrectly pltted and adhere t all guidelines (including descriptive title, prperly frmatted axes, trendline

More information

ECE 545 Project Deliverables

ECE 545 Project Deliverables ECE 545 Prject Deliverables Tp-level flder: _ Secnd-level flders: 1_assumptins 2_blck_diagrams 3_interface 4_ASM_charts 5_surce_cde 6_verificatin 7_timing_analysis 8_results

More information

Finite Automata. Human-aware Robo.cs. 2017/08/22 Chapter 1.1 in Sipser

Finite Automata. Human-aware Robo.cs. 2017/08/22 Chapter 1.1 in Sipser Finite Autmata 2017/08/22 Chapter 1.1 in Sipser 1 Last time Thery f cmputatin Autmata Thery Cmputability Thery Cmplexity Thery Finite autmata Pushdwn autmata Turing machines 2 Outline fr tday Finite autmata

More information

Application Of Mealy Machine And Recurrence Relations In Cryptography

Application Of Mealy Machine And Recurrence Relations In Cryptography Applicatin Of Mealy Machine And Recurrence Relatins In Cryptgraphy P. A. Jytirmie 1, A. Chandra Sekhar 2, S. Uma Devi 3 1 Department f Engineering Mathematics, Andhra University, Visakhapatnam, IDIA 2

More information

Tree Structured Classifier

Tree Structured Classifier Tree Structured Classifier Reference: Classificatin and Regressin Trees by L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stne, Chapman & Hall, 98. A Medical Eample (CART): Predict high risk patients

More information

Physics 2010 Motion with Constant Acceleration Experiment 1

Physics 2010 Motion with Constant Acceleration Experiment 1 . Physics 00 Mtin with Cnstant Acceleratin Experiment In this lab, we will study the mtin f a glider as it accelerates dwnhill n a tilted air track. The glider is supprted ver the air track by a cushin

More information

Activity Guide Loops and Random Numbers

Activity Guide Loops and Random Numbers Unit 3 Lessn 7 Name(s) Perid Date Activity Guide Lps and Randm Numbers CS Cntent Lps are a relatively straightfrward idea in prgramming - yu want a certain chunk f cde t run repeatedly - but it takes a

More information

1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp

1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp THE POWER AND LIMIT OF NEURAL NETWORKS T. Y. Lin Department f Mathematics and Cmputer Science San Jse State University San Jse, Califrnia 959-003 tylin@cs.ssu.edu and Bereley Initiative in Sft Cmputing*

More information

The standards are taught in the following sequence.

The standards are taught in the following sequence. B L U E V A L L E Y D I S T R I C T C U R R I C U L U M MATHEMATICS Third Grade In grade 3, instructinal time shuld fcus n fur critical areas: (1) develping understanding f multiplicatin and divisin and

More information

READING STATECHART DIAGRAMS

READING STATECHART DIAGRAMS READING STATECHART DIAGRAMS Figure 4.48 A Statechart diagram with events The diagram in Figure 4.48 shws all states that the bject plane can be in during the curse f its life. Furthermre, it shws the pssible

More information

x 1 Outline IAML: Logistic Regression Decision Boundaries Example Data

x 1 Outline IAML: Logistic Regression Decision Boundaries Example Data Outline IAML: Lgistic Regressin Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester Lgistic functin Lgistic regressin Learning lgistic regressin Optimizatin The pwer f nn-linear basis functins Least-squares

More information

2004 AP CHEMISTRY FREE-RESPONSE QUESTIONS

2004 AP CHEMISTRY FREE-RESPONSE QUESTIONS 2004 AP CHEMISTRY FREE-RESPONSE QUESTIONS 6. An electrchemical cell is cnstructed with an pen switch, as shwn in the diagram abve. A strip f Sn and a strip f an unknwn metal, X, are used as electrdes.

More information

Thermodynamics and Equilibrium

Thermodynamics and Equilibrium Thermdynamics and Equilibrium Thermdynamics Thermdynamics is the study f the relatinship between heat and ther frms f energy in a chemical r physical prcess. We intrduced the thermdynamic prperty f enthalpy,

More information

Engineering Decision Methods

Engineering Decision Methods GSOE9210 vicj@cse.unsw.edu.au www.cse.unsw.edu.au/~gs9210 Maximin and minimax regret 1 2 Indifference; equal preference 3 Graphing decisin prblems 4 Dminance The Maximin principle Maximin and minimax Regret

More information

Basics. Primary School learning about place value is often forgotten and can be reinforced at home.

Basics. Primary School learning about place value is often forgotten and can be reinforced at home. Basics When pupils cme t secndary schl they start a lt f different subjects and have a lt f new interests but it is still imprtant that they practise their basic number wrk which may nt be reinfrced as

More information

COMP 551 Applied Machine Learning Lecture 11: Support Vector Machines

COMP 551 Applied Machine Learning Lecture 11: Support Vector Machines COMP 551 Applied Machine Learning Lecture 11: Supprt Vectr Machines Instructr: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted fr this curse

More information

COMP 551 Applied Machine Learning Lecture 5: Generative models for linear classification

COMP 551 Applied Machine Learning Lecture 5: Generative models for linear classification COMP 551 Applied Machine Learning Lecture 5: Generative mdels fr linear classificatin Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Jelle Pineau Class web page: www.cs.mcgill.ca/~hvanh2/cmp551

More information

QUANTUM SECURE DIRECT COMMUNICATION USING ENTANGLEMENT AND SUPER DENSE CODING

QUANTUM SECURE DIRECT COMMUNICATION USING ENTANGLEMENT AND SUPER DENSE CODING QANTM SECRE DIRECT COMMNICATION SING ENTANGLEMENT AND SPER DENSE CODING Ola M. Hegazy, Ayman M. Bahaa Eldin and Yasser H. Dakrury Cmputer and Systems Eng. Department, Ain Shams niversity, Cair, Egypt la_hegazy@yah.cm,

More information

Part 3 Introduction to statistical classification techniques

Part 3 Introduction to statistical classification techniques Part 3 Intrductin t statistical classificatin techniques Machine Learning, Part 3, March 07 Fabi Rli Preamble ØIn Part we have seen that if we knw: Psterir prbabilities P(ω i / ) Or the equivalent terms

More information

TP1 - Introduction to ArcGIS

TP1 - Introduction to ArcGIS TP1 - Intrductin t ArcGIS During this practical, we will use ArcGIS (ArcMap and ArcCatalg) t create maps f predictrs that culd explain the bserved bird richness in Switzerland. ArcMap is principally used

More information

Bicycle Generator Dump Load Control Circuit: An Op Amp Comparator with Hysteresis

Bicycle Generator Dump Load Control Circuit: An Op Amp Comparator with Hysteresis Bicycle Generatr Dump Lad Cntrl Circuit: An Op Amp Cmparatr with Hysteresis Sustainable Technlgy Educatin Prject University f Waterl http://www.step.uwaterl.ca December 1, 2009 1 Summary This dcument describes

More information

CHAPTER 2 Algebraic Expressions and Fundamental Operations

CHAPTER 2 Algebraic Expressions and Fundamental Operations CHAPTER Algebraic Expressins and Fundamental Operatins OBJECTIVES: 1. Algebraic Expressins. Terms. Degree. Gruping 5. Additin 6. Subtractin 7. Multiplicatin 8. Divisin Algebraic Expressin An algebraic

More information

A New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation

A New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.

More information

COMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d)

COMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d) COMP 551 Applied Machine Learning Lecture 9: Supprt Vectr Machines (cnt d) Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Class web page: www.cs.mcgill.ca/~hvanh2/cmp551 Unless therwise

More information

INSTRUMENTAL VARIABLES

INSTRUMENTAL VARIABLES INSTRUMENTAL VARIABLES Technical Track Sessin IV Sergi Urzua University f Maryland Instrumental Variables and IE Tw main uses f IV in impact evaluatin: 1. Crrect fr difference between assignment f treatment

More information

Biplots in Practice MICHAEL GREENACRE. Professor of Statistics at the Pompeu Fabra University. Chapter 13 Offprint

Biplots in Practice MICHAEL GREENACRE. Professor of Statistics at the Pompeu Fabra University. Chapter 13 Offprint Biplts in Practice MICHAEL GREENACRE Prfessr f Statistics at the Pmpeu Fabra University Chapter 13 Offprint CASE STUDY BIOMEDICINE Cmparing Cancer Types Accrding t Gene Epressin Arrays First published:

More information

Bootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >

Bootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) > Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);

More information

BASD HIGH SCHOOL FORMAL LAB REPORT

BASD HIGH SCHOOL FORMAL LAB REPORT BASD HIGH SCHOOL FORMAL LAB REPORT *WARNING: After an explanatin f what t include in each sectin, there is an example f hw the sectin might lk using a sample experiment Keep in mind, the sample lab used

More information

Distributions, spatial statistics and a Bayesian perspective

Distributions, spatial statistics and a Bayesian perspective Distributins, spatial statistics and a Bayesian perspective Dug Nychka Natinal Center fr Atmspheric Research Distributins and densities Cnditinal distributins and Bayes Thm Bivariate nrmal Spatial statistics

More information

Source Coding and Compression

Source Coding and Compression Surce Cding and Cmpressin Heik Schwarz Cntact: Dr.-Ing. Heik Schwarz heik.schwarz@hhi.fraunhfer.de Heik Schwarz Surce Cding and Cmpressin September 22, 2013 1 / 60 PartI: Surce Cding Fundamentals Heik

More information

5 th Grade Goal Sheet

5 th Grade Goal Sheet 5 th Grade Gal Sheet Week f Nvember 19 th, 2018 Upcming dates: 11/19 Franklin Institute Field Trip: Pack a Lunch 11/22 and 11/23 Schl Clsed fr the Thanksgiving Break. Frm Ms. Simmns: Dear 5 th Grade Students,

More information

Multimedia Systems WS 2010/2011

Multimedia Systems WS 2010/2011 Multimedia Systems WS 2010/2011 15.11.2010 M. Rahamatullah Khondoker (Room # 36/410 ) University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de

More information

CPM plans: the short, the medium and the long

CPM plans: the short, the medium and the long plans: the shrt, the medium and the lng Summary f recent prgress Next steps New Test sftware/firmware Slice test/beam test requirements Hw can we use current s? D we need mre new s? rductin testing requirements

More information

Last Updated: Oct 14, 2017

Last Updated: Oct 14, 2017 RSA Last Updated: Oct 14, 2017 Recap Number thery What is a prime number? What is prime factrizatin? What is a GCD? What des relatively prime mean? What des c-prime mean? What des cngruence mean? What

More information

Lab #3: Pendulum Period and Proportionalities

Lab #3: Pendulum Period and Proportionalities Physics 144 Chwdary Hw Things Wrk Spring 2006 Name: Partners Name(s): Intrductin Lab #3: Pendulum Perid and Prprtinalities Smetimes, it is useful t knw the dependence f ne quantity n anther, like hw the

More information

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 11 (3/11/04) Neutron Diffusion

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 11 (3/11/04) Neutron Diffusion .54 Neutrn Interactins and Applicatins (Spring 004) Chapter (3//04) Neutrn Diffusin References -- J. R. Lamarsh, Intrductin t Nuclear Reactr Thery (Addisn-Wesley, Reading, 966) T study neutrn diffusin

More information

ROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS

ROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS Particle Acceleratrs, 1986, Vl. 19, pp. 99-105 0031-2460/86/1904-0099/$15.00/0 1986 Grdn and Breach, Science Publishers, S.A. Printed in the United States f America ROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS

More information

Modelling of Clock Behaviour. Don Percival. Applied Physics Laboratory University of Washington Seattle, Washington, USA

Modelling of Clock Behaviour. Don Percival. Applied Physics Laboratory University of Washington Seattle, Washington, USA Mdelling f Clck Behaviur Dn Percival Applied Physics Labratry University f Washingtn Seattle, Washingtn, USA verheads and paper fr talk available at http://faculty.washingtn.edu/dbp/talks.html 1 Overview

More information