# PLANAR GRAPHS. Plane graph (or embedded graph) A graph that is drawn on the plane without edge crossing, is called a Plane graph

Save this PDF as:

Size: px
Start display at page:

Download "PLANAR GRAPHS. Plane graph (or embedded graph) A graph that is drawn on the plane without edge crossing, is called a Plane graph"

## Transcription

1 PLANAR GRAPHS Basc defntons Isomorphc graphs Two graphs G(V,E) and G2(V2,E2) are somorphc f there s a one-to-one correspondence F of ther vertces such that the followng holds: - u,v V, uv E, => F(u)F(v) E2 - x,y V, xy E => F(x)F(y) E2 Plane graph (or embedded graph) A graph that s drawn on the plane wthout edge crossng, s called a Plane graph Planar graph A graph s called Planar, f t s somorphc wth a Plane graph Phases A planar representaton of a graph dvdes the plane n to a number of connected regons, called faces, each bounded by edges of the graph. For every graph G, we denote n(g) the number of vertces, e(g) the number of edges, f(g) the number of faces. Degree We defne the degree of a face d(f), to be the number of edges boundng the face f. s The followng graphs are somorphc to 4 (the complete graph wth 4 vertces) f f2 G2 G f3 f4 f' f3' f2' f4' G3 Fgure : 3 somorphc graphs G2 and G3 are plane graphs, G s not. G s planar, as t s somorphc to G2 and G3. G2 and G3 are called planar embeddngs of K4

2 f, f2 and f3 (exteror phase) are phases of G2, wth degree d(f)=d(f2)=d(f3)=3. Theorem A graph s embeddable n the sphere f and only f t s embeddable n the plane. Proof. We show ths by usng a mappng known as stereographc projecton. Consder a sphercal surface S touchng a plane P at the pont SP (called south pole). The pont NP (called the pont of projecton or north pole) s on S and dametrcally opposte SP. Any pont z on P can be projected unquely onto S at z' by makng NP, z and z' collnear. In ths way any graph embedded n P can be projected onto S. Conversely, we can project any graph embedded n s onto P, choosng NP so as not to le an any vertex or edge of the graph. fgure 2: graph embeddable n sphere Theorem 2 A planar embeddng G' of a graph G can be transformed n to another embeddng such that any specfed face becomes the exteror face. Proof. Any face of G' s defned by the path whch forms ts boundary. Any such path, T, dentfed n a partcular planar representaton P of G, may be made to defne the exteror face of a dfferent planar representaton P' as follows. We form a sphercal embeddng P'' of P. P' s then formed by projectng P'' onto the plane n such a way that the pont of projecton les n the face defned by the mage of T on the sphere. a ) a b f c b c f f2 f3 f3 a f2 f3 f e d e d e d f2 b c fgure 3

3 Theorem 3 (Euler's formula) If G s a connected planar graph, for any embeddng G' the followng formula holds: n(g)+f(g) = e(g)+2 Proof. By nducton on f. For f(g) =, G s a tree. For every tree, e(g) = n(g)-, so n(g)+= e(g) + 2 n(g)+f(g) =e(g) +2 and the formula holds. Suppose t holds for all planar graphs wth less than f faces and suppose that G' has f 2 faces. Let (u,v) be an edge of G whch s not a cut-edge. Such an edge must exsts because G' has more than one face. The removal of (u.v) wll cause the two faces separated by (u,v) to combne, formng a sngle face. Hence (G-(u,v))' s a planar embeddng of a connected graph wth one less face than G', hence: f(g - (u,v)) = f(g) - n(g - (u,v) = n(g) e(g = (u,v)) = e(g) - But by the nducton hypothess: n(g- (u,v)) + f(g - (u,v)) = e(g - (u,v)) + 2 and so, by substtuton: n(g) + f(g) = e(g) + 2 Hence, by nducton, Euler's formula holds for all connected planar graphs. Lemma For any embeddng G' of any smple connected planar graph G, d( f ) 2e( G) = Proof. Each edge contrbutes to each face t s a bound, so t contrbutes 2 to the total sum. So the e(g) edges contrbutes 2e(G) to the total sum. Lemma 2 For any smple connected planar graph G, wth e(g) 3, the followng holds: e(g) 3n(G) - 6 Proof. Each face of any embeddng G' of G s bounded by at least three edges, hence: d( f ) 3 f ( G) Form the above lemma, d( f ) 2e( G), hence: 2e(G) 3f(G) => f(g) 3 2 e(g) = From Euler's formula, n(g)+f(g) = e(g)+2, so n(g) e(g) e(g) e(g) n(g) - 2 e(g) 3n(G) - 6 Defntons Bpartte graph A bpartte graph s a graph wth no cycles of odd number of edges. In a bpartte graph, the set of vertces can be parttoned to two dsjont not empty subsets V and V2, so that every edge of V connects a vertex of V wth a vertex of V2. Complete bpartte graph A complete bpartte graph, denoted as Km,n s a bpartte graph where V has m vertces, V2 has n vertces and every vertex of each subset s connected wth all other vertces of the other subset. Km,n haw m+n vertces and m*n edges.

4 Corollary A smple connected planar bpartte graph, has each face wth even degree. Proof. Each face s a cycle and the graph s bpartte, so each face must has even number of vertces. Lemma 3 For any smple connected bpartte graph G, wth e(g) 3. the followng holds: e(g) 2n(G) - 4 Proof. G s bpartte, so each face of every embeddng G' has at least 4 edges, hence d( f ) 4 f ( G) For every smple connected planar graph, d( f ) 2e( G), hence: 2e(G) 4f(G) => f(g) 2 e(g) = From Euler's formula, n(g)+f(g) = e(g)+2, hence n(g) + 2 e(g) e(g) e(g) n(g) - 2 e(g) 2n(G) - 4 s a) K5 s not planar. K5 n(k5) = 5 5 e(k5) = = 0 2 3n(K5) - 6 = 5-6 = 9. fgure 4 e(k5) > 3n(K5) - 6, hence K5 s not planar. b) K3,3 s not planar. K3,3 n(k3,3) = 6 e(k3,3) = 3*3=9 2n(K3,3) - 4 = 2-4 = 8 e(k3,3) > 2n(K3,3) - 4, hence K3,3 s not planar. c) fgure 5 The formula e(g) 3n(G) - 6 does not holds for e(g) < 3. K has n(k)=, e(k)=0 and e(k) >3n(K) - 6 K2 has n(k2)=2, e(k2)= and e(k2) > 3n(K2) - 6 Defntons Genus For any non-negatve nteger g, we can construct a surface n whch t s possble to embed g non-ntersectng closed curves wthout separatng the surface nto two regons. If for the same surface (g+) closed curves always cause a separaton, then the surface s sad to have a genus equal to g. A graph that can be embedded n a surface of genus g, but not on a surface of genus (g-) s called a graph of genus g. Crossng number The Crossng number of a graph s the mnmum number of crossngs of edges for the graph drawn n the plane.

5 Thckness The thckness T (G) of a graph G s the mnmum number of planar sub-graphs of G whose unon s G. Corollary 2 The thckness T of a smple graph G satsfes e( G) T(G) 3n( G) 6 Proof. Each planar sub-graph wll contan at most 3n(G)- edges. s fgure 6: a sphere of genus 0 fgure 7: a sphere wth a handle fgure 8: a torus, are both genus. fgure 9: a sphere wth two handles fgure 0: a double torus, are both genus 2

6 fgure : a graph of genus. Fgure 2: K5 has crossng number. fgure 3: K9 s the unon of three planar graphs, hence T(K9) 3 Theorem 4 If G s a connected graph wth genus g, then: f(g) = e(g) n(g) + 2 2g Proof. By nducton on g. For g=0 the graph s planar and we have f(g) = e(g) n(g) + 2 2g from Euler s formula. We assume that the theorem s true for all graphs wth genus (g-) These graphs may be drawn on a sphercal surface wth (g-) handles and nclude all those graphs obtaned by deletng those edges passng over a sngle handle n any graph of genus g. We construct G wth genus g on a surface o genus g by addng a sngle edge to G, requrng an addtonal handle. Usng prme letters for G, we have by the nducton hypothess: F(G ) = e(g ) n(g ) + 2 2g But e(g)=e(g )+, g = g +, n-n(g ) + Also f(g) = f(g ) because the handle connects two dstnct faces n G makng A sngle face n G. Hence by substtuton: F(G) = e(g) n(g) g. And so by nducton the theorem s proved. Corollary 3 If G s a connected graph wth genus n(g) 4 then g 6 (e(g) 3n(G)) + Proof. From the above theorem we get: g= 2 (e(g) n(g) - f(g)) +

7 Every face of an embeddng of the graph s bound by at least three edges of whch separates two faces, therefore 3f(G) 2e(G), and so the result follows by substtuton. Defnton Homeomorphc graphs Two graphs are sad to be homeomorphc f one can be made somorphc to the other by the addton or the deleton of vertces of degree two, n the followng manner: By dvdng an edge nto two edges n seres by the nserton of a vertex of degree 2, or by reverse of ths process;. Fgure 4: homeomorphc graphs Theorem 5 (Kuratowsk) A graph s planar f and only f t has no sub-graph homeomorphc to K5 or to K3,3. Proof. The proof s out of the subject of ths course. For a proof you can look at Alan Gbbons book, Algorthmc graph theory, page fgure 5: graphs G, G2 and G3 Graph G s not planar, snce t has a sub-graph (G2) homeomorphc to G3, Whch s somorphc to K3,3 (The partton of G3 vertces s{,8,9} and {2,5,6}) Defntons Colorng A colorng of the vertces of a graph s a mappng of any vertex of the graph to a color such that any vertces connected wth an edge have dfferent colors. The mnmum number of colors requred for a graph colorng s called colorng number of the graph. Theorem 6 (Four Color theorem) A planar graph has colorng number 4 The proof was gven n 976 by Appel and Haken, usng computers and analyzng the problem to 936 dfferent cases.

8 Lemma 4 The four color theorem s equvalent to the followng lemma: The vertces of a planar graph can be parttoned n two sets, V,V2 such that G/V, G/V2 are both bpartte graphs. Proof. a) 4 Color Theorem => Lemma I can get mmedately the two bpartte graphs by choosng 2 of the four colors for one of the bpartte graphs. b) Lemma => 4 Color theorem I can get the two bpartte graphs and put 2 dfferent colors on each graph. Defnton Dual graph. Let G be a planar graph and a planar embeddng G A dual graph G* has a vertex for each face of G and an edge between two faces f and f2 f and only f f and f2 share an edge. Dual graph s not always a smple graph. fgure 6 We can see that the dual of the frst planar representaton of the graph, s not somorphc to the dual of the second representaton. The dual graph refers to of a planar representaton and not to the graph. Lemma 5 A graph s planar f and only f the dual graphs of t s planar embeddngs are planar For a proof you can look at Alan Gbbons book, Algorthmc graph theory, page 83. Corollary 4 Usng dual graphs, w can see that the four color theorem s equvalent to: We can color the faces of a graph such that two faces who share an edge have dfferent color, usng at most four colors. Planarty Testng A sophstcated algorthm gven by Hopcroft and Tarjan, tests planarty n O(n) tme. 3 Here we wll see a smple algorthm that test planarty O( n ) tme.

9 As a frst applcaton of the dvde and conquer prncple, we observe that: A graph s planar f and only f all ts connected components are planar A connected graph s planar f and only f all ts bconnected components are planar Thus, va prelmnary decomposton nto connected and bconnected components, we can restrct our attenton to the problem of testng the planarty of a bconnected graph. Defntons Pece Let G be a bconnected graph. Let C be a cycle n G. A pece s: a) an edge wth vertces on C b) a connected component after removng the edges of C Separatng cycle A cycle C of G s sad to be separatng f t has at least two peaces, and s called nonseparatng f t has one peace. Of course, f G = C, then C has no peces. In any bconnected graph there s a separatng cycle and from any non-separatng cycle, I can always get a separatng cycle. fgure 7: a bconnected graph G and a cycle C. fgure 8: the peces of G wth respect to C

10 Lemma 5 Let G be a bconnected graph and let C be a nonseparatng cycle of G wth pece P.\If P s not a path, then G has a separatng cycle C consstng of a subpath of C plus a path of P between two attachments. Proof. Let u and v be two attachments of P that are consecutve n the crcular orderng, and let g be a subpath of C between u and v that does not contan any attachment of C. Snce P s connected, there s a path p, between u and v. Let C be the cycle obtaned from C by replacng g wth p. We have that g s a pece of G wth respect to C. If P s not a path, let e be an edge of P not n p. There s a peces of C dstnct from g contanng e. Thus, f P s not a path, then C has at least two peces and s thus a separatng cycle of G. fgure 9: a nonseparatng cycle C and a separatng cycle C obtaned from C as shown n the proof of the Lemma. Defnton The nterlacement graph If the graph G s planar, then n any planar drawng of G each peace s drawn ether nsde C or entrely outsde c. We say that two peces of G, wth respect to C, nterlace f they cannot be drawn on the same sde of C wthout volatng planarty. The nterlacement graph of the peces of G, wth respect to C, s the graph whose vertces are the peces of G and whose edges are the pars of peces that nterlace. fgure 20 A planar drawng of the above graph, where peces P, P3 and P6 are drawn nsde cycle C and the other peces are drawn outsde and the nterlacement graph I of the peces of F wth respect to cycle C

11 Theorem 7 A bconnected graph G wth a cycle C s planar f and only f the followng condtons hold: For each pece P of G wth respect to C, the graph obtaned by addng P to C s planar The nterlacement graph of the peces of G, wth respect to C, s bpartte. Algorthm The correctness of the algorthm s based on the above lemma and theorem and on the fact that the graph P obtaned by addng a pece P to C s bconnected. Input: a bconnected graph, G, wth n vertces and at most 3n-6 edges, and a separatng cycle C of G. Output: and ndcaton of whether G s planar.. Compute the peces of G wth respect to C. 2. for each pece P of G that s not a path (of one or more edges): (a) let P be the graph obtaned by addng P to C (b) let C be the cycle of P obtaned from C by replacng the porton of C between two consecutve attachments wth a path of P between them (c) apply the algorthm recursvely to graph P and cycle C. If P s non planar, return nonplanar 3. Compute the nterlacement graph I of the peces. 4. Test whether I s bpartte. If s not bpartte, return nonplanar 5. Return planar Tme analyss Step : O(n) Step 2: O(n)) 2 Step 3: O( n ) 2 Step 4: O( n ) 2 So a recursve nvocaton of algorthm of planarty testng takes O( n ) tme. We observe that number of recursve nvocatons as O(n) by assocatng wth each nvocaton a dstnct edge of G.. We conclude that the runnng tme of algorthm Planarty Testng s 3 O( n )??µ?t???????d?? 945 G?????? G?a????d?ßa?d?? 960

### Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

### 1 Example 1: Axis-aligned rectangles

COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

### Generalizing the degree sequence problem

Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts

### greatest common divisor

4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no

### The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

### We are now ready to answer the question: What are the possible cardinalities for finite fields?

Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

### Recurrence. 1 Definitions and main statements

Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

### Extending Probabilistic Dynamic Epistemic Logic

Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

### 1 Approximation Algorithms

CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons

### New bounds in Balog-Szemerédi-Gowers theorem

New bounds n Balog-Szemeréd-Gowers theorem By Tomasz Schoen Abstract We prove, n partcular, that every fnte subset A of an abelan group wth the addtve energy κ A 3 contans a set A such that A κ A and A

### n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

### Solutions to the exam in SF2862, June 2009

Solutons to the exam n SF86, June 009 Exercse 1. Ths s a determnstc perodc-revew nventory model. Let n = the number of consdered wees,.e. n = 4 n ths exercse, and r = the demand at wee,.e. r 1 = r = r

### PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

### + + + - - This circuit than can be reduced to a planar circuit

MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

### Ring structure of splines on triangulations

www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

### Formula of Total Probability, Bayes Rule, and Applications

1 Formula of Total Probablty, Bayes Rule, and Applcatons Recall that for any event A, the par of events A and A has an ntersecton that s empty, whereas the unon A A represents the total populaton of nterest.

### BERNSTEIN POLYNOMIALS

On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

### What is Candidate Sampling

What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

### 8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

### z(t) = z 1 (t) + t(z 2 z 1 ) z(t) = 1 + i + t( 2 3i (1 + i)) z(t) = 1 + i + t( 3 4i); 0 t 1

(4.): ontours. Fnd an admssble parametrzaton. (a). the lne segment from z + to z 3. z(t) z (t) + t(z z ) z(t) + + t( 3 ( + )) z(t) + + t( 3 4); t (b). the crcle jz j 4 traversed once clockwse startng at

### How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

### 6. EIGENVALUES AND EIGENVECTORS 3 = 3 2

EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a non-zero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :

### Support Vector Machines

Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

### Embedding lattices in the Kleene degrees

F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded

### 2.4 Bivariate distributions

page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together

### The Magnetic Field. Concepts and Principles. Moving Charges. Permanent Magnets

. The Magnetc Feld Concepts and Prncples Movng Charges All charged partcles create electrc felds, and these felds can be detected by other charged partcles resultng n electrc force. However, a completely

### v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

### Today in Physics 217: the divergence and curl theorems

Today n Physcs 217: the dvergence and curl theorems Flux and dvergence: proof of the dvergence theorem, à lá Purcell. rculaton and curl: proof of tokes theorem, also followng Purcell. ee Purcell, chapter

### The OC Curve of Attribute Acceptance Plans

The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

### When is a graph planar?

When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,

### NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6

PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has

### Rotation Kinematics, Moment of Inertia, and Torque

Rotaton Knematcs, Moment of Inerta, and Torque Mathematcally, rotaton of a rgd body about a fxed axs s analogous to a lnear moton n one dmenson. Although the physcal quanttes nvolved n rotaton are qute

### On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### 8 Algorithm for Binary Searching in Trees

8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

### Communication Networks II Contents

8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

### SCALAR A physical quantity that is completely characterized by a real number (or by its numerical value) is called a scalar. In other words, a scalar

SCALAR A phscal quantt that s completel charactered b a real number (or b ts numercal value) s called a scalar. In other words, a scalar possesses onl a magntude. Mass, denst, volume, temperature, tme,

### GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM BARRIOT Jean-Perre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jean-perre.barrot@cnes.fr 1/Introducton The

### Finite Math Chapter 10: Study Guide and Solution to Problems

Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount

### Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

### 1. Measuring association using correlation and regression

How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a

### General Auction Mechanism for Search Advertising

General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an

### Implementation of Deutsch's Algorithm Using Mathcad

Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"

### Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set

### QUANTUM MECHANICS, BRAS AND KETS

PH575 SPRING QUANTUM MECHANICS, BRAS AND KETS The followng summares the man relatons and defntons from quantum mechancs that we wll be usng. State of a phscal sstem: The state of a phscal sstem s represented

### Section 5.4 Annuities, Present Value, and Amortization

Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

### Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications

CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary

### 1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1.

HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher

### FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan

### Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

### REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of

### Fast degree elevation and knot insertion for B-spline curves

Computer Aded Geometrc Desgn 22 (2005) 183 197 www.elsever.com/locate/cagd Fast degree elevaton and knot nserton for B-splne curves Q-Xng Huang a,sh-mnhu a,, Ralph R. Martn b a Department of Computer Scence

### Level Annuities with Payments Less Frequent than Each Interest Period

Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach

### Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process

Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer

### Calculation of Sampling Weights

Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

### Practical Issues and Algorithms for Analyzing Terrorist Networks 1

Practcal Issues and Algorthms for Analyzng Terror Networks 1 Tam Carpenter, George Karakoas, and Davd Shallcross Telcorda Technologes 445 South Street Morrown, NJ 07960 Keywords: socal network analyss,

### STANDING WAVE TUBE TECHNIQUES FOR MEASURING THE NORMAL INCIDENCE ABSORPTION COEFFICIENT: COMPARISON OF DIFFERENT EXPERIMENTAL SETUPS.

STADIG WAVE TUBE TECHIQUES FOR MEASURIG THE ORMAL ICIDECE ABSORPTIO COEFFICIET: COMPARISO OF DIFFERET EXPERIMETAL SETUPS. Angelo Farna (*), Patrzo Faust (**) (*) Dpart. d Ing. Industrale, Unverstà d Parma,

### The descriptive complexity of the family of Banach spaces with the π-property

Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014

### Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

### A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

### The circuit shown on Figure 1 is called the common emitter amplifier circuit. The important subsystems of this circuit are:

polar Juncton Transstor rcuts Voltage and Power Amplfer rcuts ommon mtter Amplfer The crcut shown on Fgure 1 s called the common emtter amplfer crcut. The mportant subsystems of ths crcut are: 1. The basng

### Today s class. Chapter 13. Sources of uncertainty. Decision making with uncertainty

Today s class Probablty theory Bayesan nference From the ont dstrbuton Usng ndependence/factorng From sources of evdence Chapter 13 1 2 Sources of uncertanty Uncertan nputs Mssng data Nosy data Uncertan

### benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

### Period and Deadline Selection for Schedulability in Real-Time Systems

Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng

Introducton Faraday's Law o Inducton In ths lab, you wll study Faraday's Law o nducton usng a wand wth col whch swngs through a magnetc eld. You wll also examne converson o mechanc energy nto electrc energy

### INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton

### Simple Interest Loans (Section 5.1) :

Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part

### x f(x) 1 0.25 1 0.75 x 1 0 1 1 0.04 0.01 0.20 1 0.12 0.03 0.60

BIVARIATE DISTRIBUTIONS Let be a varable that assumes the values { 1,,..., n }. Then, a functon that epresses the relatve frequenc of these values s called a unvarate frequenc functon. It must be true

### Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

### HALL EFFECT SENSORS AND COMMUTATION

OEM770 5 Hall Effect ensors H P T E R 5 Hall Effect ensors The OEM770 works wth three-phase brushless motors equpped wth Hall effect sensors or equvalent feedback sgnals. In ths chapter we wll explan how

### HÜCKEL MOLECULAR ORBITAL THEORY

1 HÜCKEL MOLECULAR ORBITAL THEORY In general, the vast maorty polyatomc molecules can be thought of as consstng of a collecton of two electron bonds between pars of atoms. So the qualtatve pcture of σ

### PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

### 1E6 Electrical Engineering AC Circuit Analysis and Power Lecture 12: Parallel Resonant Circuits

E6 Electrcal Engneerng A rcut Analyss and Power ecture : Parallel esonant rcuts. Introducton There are equvalent crcuts to the seres combnatons examned whch exst n parallel confguratons. The ssues surroundng

### Traffic State Estimation in the Traffic Management Center of Berlin

Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

### Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

### Inter-Ing 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007.

Inter-Ing 2007 INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007. UNCERTAINTY REGION SIMULATION FOR A SERIAL ROBOT STRUCTURE MARIUS SEBASTIAN

### Section C2: BJT Structure and Operational Modes

Secton 2: JT Structure and Operatonal Modes Recall that the semconductor dode s smply a pn juncton. Dependng on how the juncton s based, current may easly flow between the dode termnals (forward bas, v

### Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces

### RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.

ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract

### arxiv:1012.0560v2 [math.qa] 30 Aug 2011

TURAEV-VIRO INVARIANTS AS AN EXTENDED TQFT III arxv:1012.0560v2 [math.qa] 30 Aug 2011 BENJAMIN BALSAM Abstract. In the thrd paper n ths seres, we examne the Reshetkhn- Turaev and Turaev-Vro TQFTs at the

### 1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

### Mean Value Coordinates for Closed Triangular Meshes

Mean Value Coordnates for Closed Trangular Meshes Tao Ju, Scott Schaefer, Joe Warren Rce Unversty (a) (b) (c) (d) Fgure : Orgnal horse model wth enclosng trangle control mesh shown n black (a). Several

### Lecture 7 March 20, 2002

MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng

### = (2) T a,2 a,2. T a,3 a,3. T a,1 a,1

A set of tools for buldng PostgreSQL dstrbuted databases n bomedcal envronment. M. Cavaller, R. Prudentno, U. Pozzol, G. Ren IRCCS E. Medea, Bosso Parn (LC), Italy. E-mal: gren@bp.lnf.t Abstract PostgreSQL

### To Fill or not to Fill: The Gas Station Problem

To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.

### Gibbs Free Energy and Chemical Equilibrium (or how to predict chemical reactions without doing experiments)

Gbbs Free Energy and Chemcal Equlbrum (or how to predct chemcal reactons wthout dong experments) OCN 623 Chemcal Oceanography Readng: Frst half of Chapter 3, Snoeynk and Jenkns (1980) Introducton We want

### Using Series to Analyze Financial Situations: Present Value

2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated

### Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton

### FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals

FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant

### Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

### Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.

### ErrorPropagation.nb 1. Error Propagation

ErrorPropagaton.nb Error Propagaton Suppose that we make observatons of a quantty x that s subject to random fluctuatons or measurement errors. Our best estmate of the true value for ths quantty s then

### 21 Vectors: The Cross Product & Torque

21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl

### SIMPLE LINEAR CORRELATION

SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.

### A machine vision approach for detecting and inspecting circular parts

A machne vson approach for detectng and nspectng crcular parts Du-Mng Tsa Machne Vson Lab. Department of Industral Engneerng and Management Yuan-Ze Unversty, Chung-L, Tawan, R.O.C. E-mal: edmtsa@saturn.yzu.edu.tw

### Nordea G10 Alpha Carry Index

Nordea G10 Alpha Carry Index Index Rules v1.1 Verson as of 10/10/2013 1 (6) Page 1 Index Descrpton The G10 Alpha Carry Index, the Index, follows the development of a rule based strategy whch nvests and

### Series Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3

Royal Holloway Unversty of London Department of Physs Seres Solutons of ODEs the Frobenus method Introduton to the Methodology The smple seres expanson method works for dfferental equatons whose solutons