Support Vector Machines
|
|
- Ruby Pierce
- 5 years ago
- Views:
Transcription
1 Suppo Veco Machine CSL 3 ARIFICIAL INELLIGENCE SPRING 4
2 Suppo Veco Machine O, Kenel Machine Diciminan-baed mehod olean cla boundaie Suppo veco coni of eample cloe o bounday Kenel compue imilaiy beeen eample omap inance pace o a highe-dimenional pace hee (hopefully) linea model uffice Chooing he igh kenel i cucial Kenel machine among be-pefoming leane CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR
3 Suppo Veco Machine O = uppo veco magin CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 3
4 Opimal Sepaaing Hypeplane X, find and hee uch ha if if C C fo hich can be fo eien a Noe e an +, no Wan inance ome diance fom hypeplane CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 4
5 Magin Diance fom inance o hypeplane + ( ) o Diance fom hypeplane o cloe inance i he magin magin CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 5
6 Opimal Sepaaing Hypeplane min ubjec o, Quadaic opimizaion poblem ih compleiy polynomial in d (#feaue) Kenel ill evenually map d-dimenional pace o highe-dimenional pace Pefe compleiy no baed on #dimenion CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 7
7 Opimal Sepaaing Hypeplane Conve opimizaion poblem o depend on numbe of aining eample N (no d) osill polynomial in N Bu opimizaion ill depend only on cloe eample (uppo veco) oypically N CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 8
8 Lagange Muliplie Reie quadaic opimizaion poblem uing Lagange muliplie α, N CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 9 N N N p L, ubjec o min
9 Lagange Muliplie Equivalenly, e can maimize L p ubjec o he conain: Plugging hee ino L p CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR N p N p L L
10 Lagange Muliplie Maimize L d ih epec o α only CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR and o ubjec L d,
11 Suppo Veco Machine Mo α = oi.e., ( + ) > ( lie ouide magin) Suppo veco: uch ha α > oi.e., ( + ) = ( lie on magin) = Σ α = fo any uppo veco oypically aveage ove all uppo veco Reuling diciminan i called he uppo veco machine (SVM) CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR
12 Sof Eo magin O = uppo veco CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 3
13 Sof Magin Hypeplane Daa no linealy epaable Find hypeplane ih lea eo Define lack vaiable ξ oing deviaion fom he magin CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 4
14 Sof Eo Coecly claified eample fa fom magin (ξ = ) Coecly claified eample, bu inide he magin ( < ξ < ) Incoecly claified eample (ξ ) Sof eo = CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 5
15 Sof Magin Hypeplane Lagangian equaion ih lack vaiable C i penaly faco μ, ne e of Lagange muliplie Wan o minimize L p CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 6 p C L
16 Sof Magin Hypeplane L d ubjec o C i a egulaizaion paamee ohigh C high penaly fo non-epaable eample (ovefi) olo C le penaly (undefi) odeemine uing validaion e (C= ypical) and C, CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 9
17 Kenel o ue peviou appoache, daa mu be nea linealy epaable If no, pehap a anfomaion φ() ill help φ() ae bai funcion φ CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR
18 Kenel anfom d-dimenional pace o k- dimenional z pace uing bai funcion φ() z=φ() hee z j = φ j (), j=,,k Inead of, aume z = φ () CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR k j j j g g ) ( ) ( ) ( ) ( φ z z
19 Sof Magin ih Kenel Replace inne poduc of bai funcion φ( ) φ( ) ih kenel funcion K(, ) CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR p C L ) ( φ, and ubjec o ) ( C L d φ φ d K L ), (
20 Kenel Funcion Kenel K(, ) compue z-pace poduc φ( ) φ( ) in -pace Mai of kenel value K, hee K = K(, ), called he Gam mai K hould be ymmeic and poiive emidefinie CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 3 K g g φ φ φ φ z,
21 Kenel Funcion Polynomial kenel of degee q If q=, hen ue oiginal feaue Fo eample, hen q= and d= CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 4 q K, y y y y y y y y K,,,,,, y y
22 Kenel Funcion Polynomial kenel of degee magin O = uppo veco CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 5
23 Kenel Funcion Radial bai funcion (Gauian kenel) K, ep i he cene i he adiu Lage implie moohe boundaie CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 6
24 Kenel Funcion: Radial Bai Funcion CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 7
25 K> Clae Lean K diffeen kenel machine g i () oeach ue one cla a poiive, emaining clae a negaive ochooe cla i uch ha i=agma j g j () obe appoach in pacice CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 3
26 K> Clae Lean K(K-)/ kenel machine oeach ue one cla a poiive and anohe cla a negaive oeaie (fae) leaning pe kenel machine CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 3
27 Summay: Kenel Machine Seek opimal epaaing hypeplane Suppo veco machine (SVM) find hypeplane uing only cloe eample Kenel funcion allo SVM o opeae in highe dimenion Chooing coec kenel i cucial Kenel machine among be-pefoming leane CSL 3 ARIFICIAL INELLIGENCE, INDIAN INSIUE OF ECHNOLOGY ROPAR 33
Sections 3.1 and 3.4 Exponential Functions (Growth and Decay)
Secions 3.1 and 3.4 Eponenial Funcions (Gowh and Decay) Chape 3. Secions 1 and 4 Page 1 of 5 Wha Would You Rahe Have... $1million, o double you money evey day fo 31 days saing wih 1cen? Day Cens Day Cens
More information, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max
ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen
More informationMolecular Evolution and Phylogeny. Based on: Durbin et al Chapter 8
Molecula Evoluion and hylogeny Baed on: Dubin e al Chape 8. hylogeneic Tee umpion banch inenal node leaf Topology T : bifucaing Leave - N Inenal node N+ N- Lengh { i } fo each banch hylogeneic ee Topology
More information[ ] 0. = (2) = a q dimensional vector of observable instrumental variables that are in the information set m constituents of u
Genealized Mehods of Momens he genealized mehod momens (GMM) appoach of Hansen (98) can be hough of a geneal pocedue fo esing economics and financial models. he GMM is especially appopiae fo models ha
More informationRepresenting Knowledge. CS 188: Artificial Intelligence Fall Properties of BNs. Independence? Reachability (the Bayes Ball) Example
C 188: Aificial Inelligence Fall 2007 epesening Knowledge ecue 17: ayes Nes III 10/25/2007 an Klein UC ekeley Popeies of Ns Independence? ayes nes: pecify complex join disibuions using simple local condiional
More informationCptS 570 Machine Learning School of EECS Washington State University. CptS Machine Learning 1
ps 57 Machne Leann School of EES Washnon Sae Unves ps 57 - Machne Leann Assume nsances of classes ae lneal sepaable Esmae paamees of lnea dscmnan If ( - -) > hen + Else - ps 57 - Machne Leann lassfcaon
More informationLecture 26: Leapers and Creepers
Lecue 6: Leape and Ceepe Scibe: Geain Jone (and Main Z. Bazan) Depamen of Economic, MIT May, 5 Inoducion Thi lecue conide he analyi of he non-epaable CTRW in which he diibuion of ep ize and ime beween
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationLecture 17: Kinetics of Phase Growth in a Two-component System:
Lecue 17: Kineics of Phase Gowh in a Two-componen Sysem: descipion of diffusion flux acoss he α/ ineface Today s opics Majo asks of oday s Lecue: how o deive he diffusion flux of aoms. Once an incipien
More informationLecture 18: Kinetics of Phase Growth in a Two-component System: general kinetics analysis based on the dilute-solution approximation
Lecue 8: Kineics of Phase Gowh in a Two-componen Sysem: geneal kineics analysis based on he dilue-soluion appoximaion Today s opics: In he las Lecues, we leaned hee diffeen ways o descibe he diffusion
More informationCHAPTER 10: LINEAR DISCRIMINATION
HAPER : LINEAR DISRIMINAION Dscmnan-based lassfcaon 3 In classfcaon h K classes ( k ) We defned dsmnan funcon g () = K hen gven an es eample e chose (pedced) s class label as f g () as he mamum among g
More informationMULTILAYER PERCEPTRONS
Last updated: Nov 26, 2012 MULTILAYER PERCEPTRONS Outline 2 Combining Linea Classifies Leaning Paametes Outline 3 Combining Linea Classifies Leaning Paametes Implementing Logical Relations 4 AND and OR
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More information7 Wave Equation in Higher Dimensions
7 Wave Equaion in Highe Dimensions We now conside he iniial-value poblem fo he wave equaion in n dimensions, u c u x R n u(x, φ(x u (x, ψ(x whee u n i u x i x i. (7. 7. Mehod of Spheical Means Ref: Evans,
More informationOn Control Problem Described by Infinite System of First-Order Differential Equations
Ausalian Jounal of Basic and Applied Sciences 5(): 736-74 ISS 99-878 On Conol Poblem Descibed by Infinie Sysem of Fis-Ode Diffeenial Equaions Gafujan Ibagimov and Abbas Badaaya J'afau Insiue fo Mahemaical
More information1 Adjusted Parameters
1 Adjued Parameer Here, we li he exac calculaion we made o arrive a our adjued parameer Thee adjumen are made for each ieraion of he Gibb ampler, for each chain of he MCMC The regional memberhip of each
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More informationExponential and Logarithmic Equations and Properties of Logarithms. Properties. Properties. log. Exponential. Logarithmic.
Eponenial and Logaihmic Equaions and Popeies of Logaihms Popeies Eponenial a a s = a +s a /a s = a -s (a ) s = a s a b = (ab) Logaihmic log s = log + logs log/s = log - logs log s = s log log a b = loga
More informationLow-complexity Algorithms for MIMO Multiplexing Systems
Low-complexiy Algoihms fo MIMO Muliplexing Sysems Ouline Inoducion QRD-M M algoihm Algoihm I: : o educe he numbe of suviving pahs. Algoihm II: : o educe he numbe of candidaes fo each ansmied signal. :
More informationAdditional Methods for Solving DSGE Models
Addiional Mehod for Solving DSGE Model Karel Meren, Cornell Univeriy Reference King, R. G., Ploer, C. I. & Rebelo, S. T. (1988), Producion, growh and buine cycle: I. he baic neoclaical model, Journal of
More informationToday - Lecture 13. Today s lecture continue with rotations, torque, Note that chapters 11, 12, 13 all involve rotations
Today - Lecue 13 Today s lecue coninue wih oaions, oque, Noe ha chapes 11, 1, 13 all inole oaions slide 1 eiew Roaions Chapes 11 & 1 Viewed fom aboe (+z) Roaional, o angula elociy, gies angenial elociy
More informationAn Automatic Door Sensor Using Image Processing
An Auomaic Doo Senso Using Image Pocessing Depamen o Elecical and Eleconic Engineeing Faculy o Engineeing Tooi Univesiy MENDEL 2004 -Insiue o Auomaion and Compue Science- in BRNO CZECH REPUBLIC 1. Inoducion
More informationEstimation and Confidence Intervals: Additional Topics
Chapte 8 Etimation and Confidence Inteval: Additional Topic Thi chapte imply follow the method in Chapte 7 fo foming confidence inteval The text i a bit dioganized hee o hopefully we can implify Etimation:
More informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationCSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it
CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy
More informationMEEN 617 Handout #11 MODAL ANALYSIS OF MDOF Systems with VISCOUS DAMPING
MEEN 67 Handou # MODAL ANALYSIS OF MDOF Sysems wih VISCOS DAMPING ^ Symmeic Moion of a n-dof linea sysem is descibed by he second ode diffeenial equaions M+C+K=F whee () and F () ae n ows vecos of displacemens
More informationLaplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)
Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful
More informationL. Yaroslavsky. Image data fusion. Processing system. Input scene. Output images
L. Yaolavk Image daa fuion Poceing em Inpu cene Oupu image Muli componen imaging and eoaion model Conide an M componen imaging em and aume ha each image of M componen can be decibed in a domain of a ceain
More informationGravity. David Barwacz 7778 Thornapple Bayou SE, Grand Rapids, MI David Barwacz 12/03/2003
avity David Bawacz 7778 Thonapple Bayou, and Rapid, MI 495 David Bawacz /3/3 http://membe.titon.net/daveb Uing the concept dicued in the peceding pape ( http://membe.titon.net/daveb ), I will now deive
More informationCS 188: Artificial Intelligence Fall Probabilistic Models
CS 188: Aificial Inelligence Fall 2007 Lecue 15: Bayes Nes 10/18/2007 Dan Klein UC Bekeley Pobabilisic Models A pobabilisic model is a join disibuion ove a se of vaiables Given a join disibuion, we can
More informationThe sudden release of a large amount of energy E into a background fluid of density
10 Poin explosion The sudden elease of a lage amoun of enegy E ino a backgound fluid of densiy ceaes a song explosion, chaaceized by a song shock wave (a blas wave ) emanaing fom he poin whee he enegy
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationOnline Ranking by Projecting
LETTER Communicaed by Edwad Haingon Online Ranking by Pojecing Koby Camme kobics@cs.huji.ac.il Yoam Singe singe@cs.huji.ac.il School of Compue Science and Engineeing, Hebew Univesiy, Jeusalem 91904, Isael
More informationMain Reference: Sections in CLRS.
Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp
More informationPHYS GENERAL RELATIVITY AND COSMOLOGY PROBLEM SET 7 - SOLUTIONS
PHYS 54 - GENERAL RELATIVITY AND COSMOLOGY - 07 - PROBLEM SET 7 - SOLUTIONS TA: Jeome Quinin Mach, 07 Noe ha houghou hee oluion, we wok in uni whee c, and we chooe he meic ignaue (,,, ) a ou convenion..
More information18 Extensions of Maximum Flow
Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I
More informationMaximum Flow in Planar Graphs
Maximum Flow in Planar Graph Planar Graph and i Dual Dualiy i defined for direced planar graph a well Minimum - cu in undireced planar graph An - cu (undireced graph) An - cu The dual o he cu Cu/Cycle
More informationMacroeconomics 1. Ali Shourideh. Final Exam
4780 - Macroeconomic 1 Ali Shourideh Final Exam Problem 1. A Model of On-he-Job Search Conider he following verion of he McCall earch model ha allow for on-he-job-earch. In paricular, uppoe ha ime i coninuou
More informationLinear Algebra Math 221
Linea Algeba Math Open Book Eam Open Notes Sept Calculatos Pemitted Sho all ok (ecept #). ( pts) Gien the sstem of equations a) ( pts) Epess this sstem as an augmented mati. b) ( pts) Bing this mati to
More informationToday: Max Flow Proofs
Today: Max Flow Proof COSC 58, Algorihm March 4, 04 Many of hee lide are adaped from everal online ource Reading Aignmen Today cla: Chaper 6 Reading aignmen for nex cla: Chaper 7 (Amorized analyi) In-Cla
More informationENGI 4430 Advanced Calculus for Engineering Faculty of Engineering and Applied Science Problem Set 9 Solutions [Theorems of Gauss and Stokes]
ENGI 44 Avance alculus fo Engineeing Faculy of Engineeing an Applie cience Poblem e 9 oluions [Theoems of Gauss an okes]. A fla aea A is boune by he iangle whose veices ae he poins P(,, ), Q(,, ) an R(,,
More informationKalman Filter: an instance of Bayes Filter. Kalman Filter: an instance of Bayes Filter. Kalman Filter. Linear dynamics with Gaussian noise
COM47 Inoducion o Roboics and Inelligen ysems he alman File alman File: an insance of Bayes File alman File: an insance of Bayes File Linea dynamics wih Gaussian noise alman File Linea dynamics wih Gaussian
More informationu(t) Figure 1. Open loop control system
Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference
More informationEcon 201: Problem Set 2 Answers
Econ 0: Poblem Set Anses Instucto: Alexande Sollaci T.A.: Ryan Hughes Winte 08 Question (a) The fixed cost is F C = 4 and the total vaiable costs ae T CV (y) = 4y. (b) To anse this question, let x = (x,...,
More informationCircular Motion. Radians. One revolution is equivalent to which is also equivalent to 2π radians. Therefore we can.
1 Cicula Moion Radians One evoluion is equivalen o 360 0 which is also equivalen o 2π adians. Theefoe we can say ha 360 = 2π adians, 180 = π adians, 90 = π 2 adians. Hence 1 adian = 360 2π Convesions Rule
More informationAlgorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)
Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find
More informationOrthotropic Materials
Kapiel 2 Ohoopic Maeials 2. Elasic Sain maix Elasic sains ae elaed o sesses by Hooke's law, as saed below. The sesssain elaionship is in each maeial poin fomulaed in he local caesian coodinae sysem. ε
More informationLecture 5. Chapter 3. Electromagnetic Theory, Photons, and Light
Lecue 5 Chape 3 lecomagneic Theo, Phoons, and Ligh Gauss s Gauss s Faada s Ampèe- Mawell s + Loen foce: S C ds ds S C F dl dl q Mawell equaions d d qv A q A J ds ds In mae fields ae defined hough ineacion
More informationCptS 570 Machine Learning School of EECS Washington State University. CptS Machine Learning 1
CpS 570 Machine Learning School of EECS Washingon Sae Universiy CpS 570 - Machine Learning 1 Form of underlying disribuions unknown Bu sill wan o perform classificaion and regression Semi-parameric esimaion
More informationReinforcement learning
Lecue 3 Reinfocemen leaning Milos Hauskech milos@cs.pi.edu 539 Senno Squae Reinfocemen leaning We wan o lean he conol policy: : X A We see examples of x (bu oupus a ae no given) Insead of a we ge a feedback
More informationInference for A One Way Factorial Experiment. By Ed Stanek and Elaine Puleo
Infeence fo A One Way Factoial Expeiment By Ed Stanek and Elaine Puleo. Intoduction We develop etimating equation fo Facto Level mean in a completely andomized one way factoial expeiment. Thi development
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationFI 2201 Electromagnetism
FI Electomagnetim Aleande A. Ikanda, Ph.D. Phyic of Magnetim and Photonic Reeach Goup ecto Analyi CURILINEAR COORDINAES, DIRAC DELA FUNCION AND HEORY OF ECOR FIELDS Cuvilinea Coodinate Sytem Cateian coodinate:
More informationx 1 b 1 Consider the midpoint x 0 = 1 2
1 chapte 2 : oot-finding def : Given a function f(), a oot is a numbe satisfying f() = 0. e : f() = 2 3 = ± 3 question : How can we find the oots of a geneal function f()? 2.1 bisection method idea : Find
More informationThe Production of Well-Being: Conventional Goods, Relational Goods and Status Goods
The Poducion of Well-Bein: Convenional Good, Relaional Good and Sau Good Aloy Pinz Iniue of Public Economic II Univeiy of Müne, Gemany New Diecion in Welfae II, OECD Pai July 06 08, 2011 Conen 1. Inoducion
More informationNumerical Integration
MCEN 473/573 Chapte 0 Numeical Integation Fall, 2006 Textbook, 0.4 and 0.5 Isopaametic Fomula Numeical Integation [] e [ ] T k = h B [ D][ B] e B Jdsdt In pactice, the element stiffness is calculated numeically.
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationDiscussion Session 2 Constant Acceleration/Relative Motion Week 03
PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll
More informationThe k-filtering Applied to Wave Electric and Magnetic Field Measurements from Cluster
The -fileing pplied o Wave lecic and Magneic Field Measuemens fom Cluse Jean-Louis PINÇON and ndes TJULIN LPC-CNRS 3 av. de la Recheche Scienifique 4507 Oléans Fance jlpincon@cns-oleans.f OUTLINS The -fileing
More informationr P + '% 2 r v(r) End pressures P 1 (high) and P 2 (low) P 1 , which must be independent of z, so # dz dz = P 2 " P 1 = " #P L L,
Lecue 36 Pipe Flow and Low-eynolds numbe hydodynamics 36.1 eading fo Lecues 34-35: PKT Chape 12. Will y fo Monday?: new daa shee and daf fomula shee fo final exam. Ou saing poin fo hydodynamics ae wo equaions:
More information2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V
ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationDegree of Approximation of a Class of Function by (C, 1) (E, q) Means of Fourier Series
IAENG Inenaional Jounal of Applied Mahemaic, 4:, IJAM_4 7 Degee of Appoximaion of a Cla of Funcion by C, E, q Mean of Fouie Seie Hae Kihna Nigam and Kuum Shama Abac In hi pape, fo he fi ime, we inoduce
More informationMax/Min Word Problems (Additional Review) Solutions. =, for 2 x 5 1 x 1 x ( 1) 1+ ( ) ( ) ( ) 2 ( ) x = 1 + (2) 3 1 (2) (5) (5) 4 2
. a) Given Ma/Min Wod Poblems (Additional Review) Solutions + f, fo 5 ( ) + f (i) f 0 no solution ( ) (ii) f is undefined when (not pat of domain) Check endpoints: + () f () () + (5) 6 f (5) (5) 4 (min.
More informationThey were originally developed for network problem [Dantzig, Ford, Fulkerson 1956]
6. Inroducion... 6. The primal-dual algorihmn... 6 6. Remark on he primal-dual algorihmn... 7 6. A primal-dual algorihmn for he hore pah problem... 8... 9 6.6 A primal-dual algorihmn for he weighed maching
More informationFlow networks, flow, maximum flow. Some definitions. Edmonton. Saskatoon Winnipeg. Vancouver Regina. Calgary. 12/12 a.
Flow nework, flow, maximum flow Can inerpre direced graph a flow nework. Maerial coure hrough ome yem from ome ource o ome ink. Source produce maerial a ome eady rae, ink conume a ame rae. Example: waer
More informationComputer Propagation Analysis Tools
Compue Popagaion Analysis Tools. Compue Popagaion Analysis Tools Inoducion By now you ae pobably geing he idea ha pedicing eceived signal sengh is a eally impoan as in he design of a wieless communicaion
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationEE202 Circuit Theory II
EE202 Circui Theory II 2017-2018, Spring Dr. Yılmaz KALKAN I. Inroducion & eview of Fir Order Circui (Chaper 7 of Nilon - 3 Hr. Inroducion, C and L Circui, Naural and Sep epone of Serie and Parallel L/C
More informationNetwork Flow. Data Structures and Algorithms Andrei Bulatov
Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow
More informationMeasures the linear dependence or the correlation between r t and r t-p. (summarizes serial dependence)
. Definiions Saionay Time Seies- A ime seies is saionay if he popeies of he pocess such as he mean and vaiance ae consan houghou ime. i. If he auocoelaion dies ou quickly he seies should be consideed saionay
More information156 There are 9 books stacked on a shelf. The thickness of each book is either 1 inch or 2
156 Thee ae 9 books sacked on a shelf. The hickness of each book is eihe 1 inch o 2 F inches. The heigh of he sack of 9 books is 14 inches. Which sysem of equaions can be used o deemine x, he numbe of
More informationStress Analysis of Infinite Plate with Elliptical Hole
Sess Analysis of Infinie Plae ih Ellipical Hole Mohansing R Padeshi*, D. P. K. Shaa* * ( P.G.Suden, Depaen of Mechanical Engg, NRI s Insiue of Infoaion Science & Technology, Bhopal, India) * ( Head of,
More information4/12/12. Applications of the Maxflow Problem 7.5 Bipartite Matching. Bipartite Matching. Bipartite Matching. Bipartite matching: the flow network
// Applicaion of he Maxflow Problem. Biparie Maching Biparie Maching Biparie maching. Inpu: undireced, biparie graph = (, E). M E i a maching if each node appear in a mo one edge in M. Max maching: find
More informationAdd the transfer payments and subtract the total taxes from (1): Using these definitions, the above becomes: The Saving and Investment Equation:
San Fanio Sae Univei Mihael Ba ECON 30 Fall 06 Poblem e 5 Conumpion-Saving Deiion and Riadian Equivalene. (0 poin. Saving and Invemen equaion. a. Deive he aving and invemen equaion. The fomula fo GDP uing
More informationAdaptive Regularization of Weight Vectors
Adapive Regulaizaion of Weigh Vecos Koby Camme Depamen of Elecical Engineing he echnion Haifa, 32000 Isael koby@ee.echnion.ac.il Alex Kulesza Depamen of Compue and Infomaion Science Univesiy of Pennsylvania
More informationLecture 13. Rotational motion Moment of inertia
Lectue 13 Rotational motion Moment of inetia EXAM 2 Tuesday Mach 6, 2018 8:15 PM 9:45 PM Today s Topics: Rotational Motion and Angula Displacement Angula Velocity and Acceleation Rotational Kinematics
More informationWhy Reduce Dimensionality? Feature Selection vs Extraction. Subset Selection
Dimenionality Reduction Why Reduce Dimenionality? Olive lide: Alpaydin Numbeed blue lide: Haykin, Neual Netwok: A Compehenive Foundation, Second edition, Pentice-Hall, Uppe Saddle Rive:NJ,. Black lide:
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 6: The Simplex Method II
15081J/6251J Intoduction to Mathematical Pogamming ectue 6: The Simplex Method II 1 Outline Revised Simplex method Slide 1 The full tableau implementation Anticycling 2 Revised Simplex Initial data: A,
More informationHomework 7 Solutions
Homewok 7 olutions Phys 4 Octobe 3, 208. Let s talk about a space monkey. As the space monkey is oiginally obiting in a cicula obit and is massive, its tajectoy satisfies m mon 2 G m mon + L 2 2m mon 2
More informationValue Prediction with FA. Chapter 8: Generalization and Function Approximation. Adapt Supervised Learning Algorithms. Backups as Training Examples [ ]
Chapte 8: Genealization and Function Appoximation Objectives of this chapte:! Look at how expeience with a limited pat of the state set be used to poduce good behavio ove a much lage pat.! Oveview of function
More information1 Motivation and Basic Definitions
CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider
More informationMonochromatic Wave over One and Two Bars
Applied Mahemaical Sciences, Vol. 8, 204, no. 6, 307-3025 HIKARI Ld, www.m-hikai.com hp://dx.doi.og/0.2988/ams.204.44245 Monochomaic Wave ove One and Two Bas L.H. Wiyano Faculy of Mahemaics and Naual Sciences,
More informationChapter 8: Generalization and Function Approximation
Chapte 8: Genealization and Function Appoximation Objectives of this chapte: Look at how expeience with a limited pat of the state set be used to poduce good behavio ove a much lage pat. Oveview of function
More information, on the power of the transmitter P t fed to it, and on the distance R between the antenna and the observation point as. r r t
Lecue 6: Fiis Tansmission Equaion and Rada Range Equaion (Fiis equaion. Maximum ange of a wieless link. Rada coss secion. Rada equaion. Maximum ange of a ada. 1. Fiis ansmission equaion Fiis ansmission
More informationINTRODUCTION TO MACHINE LEARNING 3RD EDITION
ETHEM ALPAYDIN The MIT Press, 2014 Lecure Slides for INTRODUCTION TO MACHINE LEARNING 3RD EDITION alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/i2ml3e CHAPTER 2: SUPERVISED LEARNING Learning a Class
More information5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method
ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,
More informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More information( ) [ ] [ ] [ ] δf φ = F φ+δφ F. xdx.
9. LAGRANGIAN OF THE ELECTROMAGNETIC FIELD In the pevious section the Lagangian and Hamiltonian of an ensemble of point paticles was developed. This appoach is based on a qt. This discete fomulation can
More information2 x 8 2 x 2 SKILLS Determine whether the given value is a solution of the. equation. (a) x 2 (b) x 4. (a) x 2 (b) x 4 (a) x 4 (b) x 8
5 CHAPTER Fundamentals When solving equations that involve absolute values, we usually take cases. EXAMPLE An Absolute Value Equation Solve the equation 0 x 5 0 3. SOLUTION By the definition of absolute
More informationSimulation of Spatially Correlated Large-Scale Parameters and Obtaining Model Parameters from Measurements
Simulation of Spatially Coelated Lage-Scale Paamete and Obtaining Model Paamete fom PER ZETTERBERG Stockholm Septembe 8 TRITA EE 8:49 Simulation of Spatially Coelated Lage-Scale Paamete and Obtaining Model
More informationAN EVOLUTIONARY APPROACH FOR SOLVING DIFFERENTIAL EQUATIONS
AN EVOLUTIONARY APPROACH FOR SOLVING DIFFERENTIAL EQUATIONS M. KAMESWAR RAO AND K.P. RAVINDRAN Depamen of Mechanical Engineeing, Calicu Regional Engineeing College, Keala-67 6, INDIA. Absac:- We eploe
More informationFlow Networks. Ma/CS 6a. Class 14: Flow Exercises
0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow
More informationResearch Article On Double Summability of Double Conjugate Fourier Series
Inernaional Journal of Mahemaic and Mahemaical Science Volume 22, Aricle ID 4592, 5 page doi:.55/22/4592 Reearch Aricle On Double Summabiliy of Double Conjugae Fourier Serie H. K. Nigam and Kuum Sharma
More informationMotion In One Dimension. Graphing Constant Speed
Moion In One Dimenion PLATO AND ARISTOTLE GALILEO GALILEI LEANING TOWER OF PISA Graphing Conan Speed Diance v. Time for Toy Car (0-5 ec.) be-fi line (from TI calculaor) d = 207.7 12.6 Diance (cm) 1000
More informationFinal Exam. Tuesday, December hours, 30 minutes
an Faniso ae Univesi Mihael Ba ECON 30 Fall 04 Final Exam Tuesda, Deembe 6 hous, 30 minues Name: Insuions. This is losed book, losed noes exam.. No alulaos of an kind ae allowed. 3. how all he alulaions.
More informationFractional Ornstein-Uhlenbeck Bridge
WDS'1 Proceeding of Conribued Paper, Par I, 21 26, 21. ISBN 978-8-7378-139-2 MATFYZPRESS Fracional Ornein-Uhlenbeck Bridge J. Janák Charle Univeriy, Faculy of Mahemaic and Phyic, Prague, Czech Republic.
More information4. Some Applications of first order linear differential
August 30, 2011 4-1 4. Some Applications of fist ode linea diffeential Equations The modeling poblem Thee ae seveal steps equied fo modeling scientific phenomena 1. Data collection (expeimentation) Given
More informationElementary Statistics and Inference. Elementary Statistics and Inference. 11. Regression (cont.) 22S:025 or 7P:025. Lecture 14.
Elementay tatistics and Infeence :05 o 7P:05 Lectue 14 1 Elementay tatistics and Infeence :05 o 7P:05 Chapte 10 (cont.) D. Two Regession Lines uppose two vaiables, and ae obtained on 100 students, with
More information