Report on On-line Graph Coloring
|
|
- Austen Jefferson
- 5 years ago
- Views:
Transcription
1 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me ( ) Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm s mportant n the real lfe. To nvestgate performance, adversary s added to play wth the algorthm. There are three knds of adversary, and they gve dfferent result for the game. A proper colorng graph s a graph that for each vertex, whch color s not the same as any neghbors colors. Graph colorng s sad to be on-lne f there s no knowledge on future vertces and colored vertces cannot be changed. Ths s useful for some applcatons that share certan resources, but collson (dfferent applcatons usng same porton of the shared resources at the same tme) s not allowed. Performance rato s a measure of on-lne graph colorng. By ths, t shows exstng on-lne graph colorng algorthm cannot acheve a constant performance rato to make t not compettve.
2 Content 1 Introducton General defntons on onlne algorthm Onlne algorthm Determnstc onlne algorthm Randomzed onlne algorthm Adversary Basc Informaton on Graph colorng Defnton Offlne/Optmal Framework Onlne problem Performance rato Applcaton Frst-Ft onlne algorthm Randomzed onlne graph colorng algorthm General dea Algorthm An upper bound proof Performance rato Framework and defntons Adversaral strategy Lower bound of Determnstc algorthm Lower bound of Randomzed algorthm Summary Concluson Reference HKUST CS Dept LO Yuet Me
3 1 Introducton Onlne algorthm s an nterestng research topc because of three reasons.[3] Frst, t s appled naturally n the real world, as the constrants for onlne algorthm are the condtons of the events happenng n the world. Second, many well-studed algorthmc frameworks, such as dynamc algorthms, are well complemented by onlne algorthms. Last, onlne computaton forms an elegant framework for analyzng algorthms wth ncomplete nformaton or access to the nput. Wth the dffcultes n understandng the power of polynomal-tme computablty, t may be worthwhle to study the lmtatons of classes of algorthms defned by ther lmted use of other resources. Graph colorng s exactly used for the algorthms that have lmted resources and so need to share wth each other. Snce sharng may let collson, whch means same resources used by dfferent shared partes at the same tme, graph colorng s the soluton to avod ths phenomenon happens. Ths report s lke a survey or ntroductory on onlne graph colorng. The objectve s to make t as trval as possble so that a reader wth lttle knowledge can understand. Therefore, general defntons on onlne algorthm are frst showed. Secton 2 onwards s the dscusson on onlne graph colorng. 2 General defntons on onlne algorthm 2.1 Onlne algorthm Onlne algorthm s an algorthm wth ncomplete nformaton. Ths means the algorthm s appled wthout any knowledge on future nput. It can be compared wth correspondng optmal algorthm, whch refers to offlne algorthm here. The algorthm used when there s complete nformaton s sad as optmal/offlne algorthm. There s a rato as the result of comparson, and ths s called compettve rato. Therefore, onlne algorthm s also a specal approxmate algorthm. 2.2 Determnstc onlne algorthm Algorthm s determnstc when t makes a predctable choce wth gven nput. For determnstc onlne, t s a seres of functons that gves a fnte set of answer wth a set of request.[1] A set of request, or gven nput, s a sequence of request/nput. 2.3 Randomzed onlne algorthm A randomzed onlne algorthm s a dstrbuton over determnstc onlne HKUST CS Dept LO Yuet Me 1
4 algorthms.[1] It wll make a gven choce wth a predctable probablty wth gven nput. 2.4 Adversary Adversary s a theoretcal agent that uses nformaton about the past moves of an on-lne algorthm to choose nputs that force the worst-case cost of the algorthm.[2] Therefore, we could say t s a two player game between onlne algorthm and adversary. For a formal defnton, t can be wrtten as: An adversary s an ordered par of algorthms (Q, S), such that Q determnes the sequence of requests σ and S serve σ.[1] There are three knds of adversary: oblvous, adaptve offlne and adaptve onlne. Below s ther defnton. [1] Oblvous adversary Adversary cannot see the actons of a randomzed onlne algorthm. Formal defnton: A (Q, S) adversary s oblvous f Q determnes σ only as a functon of a randomzed onlne algorthm. In ths case, S s an optmal offlne algorthm for σ Adaptve offlne adversary It generates requests whle observng the actons of a randomzed onlne algorthm, and whch serves the sequence of requests that generated n an offlne, optmal manner (n hndsght). And there s a theorem stated that adaptve offlne s the same as determnstc. Formal defnton: A (Q, S) adversary s offlne adaptve whenever: Q s a seres of functons q : A 1 A 2 A -1 R {stop}, 0 d Q where R s a set of request and A n s a fnte set of answer. d Q s a constant that depends on the random onlne algorthm, and the product A 1 A 2 A -1 pertans to the answers of the algorthm. Note that each functon q may mplctly consder the requests generated by q 0,, q -1. S s an optmal offlne algorthm for σ Adaptve onlne adversary It generates requests whle observng the actons of a randomzed onlne algorthm, and whch serve the sequence of requests that generated n an onlne manner. HKUST CS Dept LO Yuet Me 2
5 Formal defnton: A (Q, S) adversary s onlne adaptve f: Q s as defned for offlne adaptve adversares. S s a seres of functons P : R A 1 A 2 A -1 A The product A 1 A 2 A -1 pertans to the answers of the randomzed onlne algorthm. 3 Basc Informaton on Graph colorng 3.1 Defnton For a graph, each vertex n the graph must be assgned dfferent color from ts neghbors color. Fgure 1 shows two dentcal graphs that are both proper colorng. The left one used maxmum colors to color the graph. But the graph on the rght used mnmum colors, we cannot use any fewer colors to color the same graph properly. In ths case, the left one s sad as the worst color graph, and the rght one s the optmal. Number of colors s used to measure the soluton. Fgure 1 : Examples of proper colorng graph. Left s the worst. Rght s optmal. 3.2 Offlne/Optmal Framework In an offlne manner, optmal way to color a graph s select hgh degree vertces and then recursvely color ther neghbors. From the example above [Fgure 1], the center vertex s chosen and color from ths vertex recursvely.[5] 3.3 Onlne problem When n onlne mode, nput s a vertex and the edges lnkng ths vertex wth the exstng vertces n the graph. And onlne colorng algorthm s to mmedately color the vertces of a graph wthout lookng ahead or changng colors already assgned. As a result, offlne framework cannot be used. The am for the onlne algorthm s to HKUST CS Dept LO Yuet Me 3
6 acheve mnmum performance rato, whch acts the same as compettve rato, but n many papers talkng onlne graph colorng, performance rato s mentoned nstead. 3.4 Performance rato An onlne algorthm gves varous solutons due to dfference nput sequences. Wth a best sequence of nputs to an onlne algorthm, the soluton s the same as offlne one. Ths cannot gve any measure to the algorthm. Therefore, wth an onlne algorthm A, the maxmum color used among all possble sequence on a graph G, denoted as χ A (G), s found. Ths number s dvded by the optmal/offlne chromatc number of graph G, denoted as χ(g) or smply χ. The formula for performance rato of algorthm A on graph G s χ A (G)/ χ(g). Ths s the measurement of the onlne algorthm. Later, we can see that no performance rato can be bounded by a constant. 4 Applcaton For some applcatons used lmted resources and as a result, share the resources. To avod any collson on the resources, onlne graph colorng s useful. Imagne that there are several networks, and they broadcast to some of the networks mutually and smultaneously. There s a great chance of collson f they use the same frequency/bandwdth. Graph colorng can make sure the usage of network channel s low. Ths s broadcast problem, an example of onlne graph colorng. Another example can be dynamc storage allocaton. Most of partton and allocaton problems are n heart a graph colorng queston. For these problems, there s no fxed resource lke broadcast problem (fxed frequency). So, nterval graph s ntroduced to be the graph appled colorng algorthm. Vertex set of nterval graph s represented by a collecton of closed ntervals V of the real numbers. Two ntervals are allowed to have the same endponts. To say a vertex s adjacent to another vertex j, f and only f, j V, j φ.[6] 5 Frst-Ft onlne algorthm Frst-Ft can gve a very good performance on many types of graph. It s powerful and mportant, but smple. Frst-Ft works by assgnng the smallest possble nteger as color to the current vertex of the graph. Tree s a rather smple structure graph. Below, tree s used to prove that Frst-Ft s the best algorthm for any tree. The frst task s to show the lower bound of chromatc number used by any onlne colorng algorthm on tree. Then prove the upper bound of Frst-Ft on tree s the lower bound just showed. HKUST CS Dept LO Yuet Me 4
7 Theorem 1. For every postve nteger k there exsts a tree T k on 2 k-1 vertces such that for every onlne colorng algorthm A, χ A (T k ) k.[3] 4 th 4 3 rd 2 nd st Fgure 2 : A tree T4 colored by Frst-Ft. To show the dea of the proof, a T 4 tree s used. In Fgure 2, the nput sequence s from the leaves to the root as shown above. If the sequence s reversed, the root vertex s gven frst, then the number colors used s just two, whch s mnmum. But wth the nput sequence shown, by usng Frst-Ft, t used 4 dfferent colors to color T 4. For the thrd nput set, the vertex s lnked to two vertces wth dfferent colors, so a thrd color s assgned. The root s assgned 4 th color due to smlar reason. Usng mathematcal nducton (MI), base step s trval, T 1 has one color only. So, assume T 1 to T k-1 are true,.e. for T where 1 k-1, χ A (T ), and each tree roots are n dfferent color. For an addton vertex that lnked to the root of T 1 to T k-1, then one more s used,.e. χ A (T k ) (k-1)+1. Ths s shown n Fgure 3 below. k T k k-1 T k k-2 T k-1 T 1 T 2 T 1 T k-2 T 1 T k-1 T k-2 Fgure 3 : Wth the roots of T 1 to T k-1 are n k-1 dfferent color, root of T k tree s assgned a new color HKUST CS Dept LO Yuet Me 5
8 Questons may appear from the MI proof s that, why addng one vertex to connect T 1 to T k-1 becomes a T k tree. And how to say each root of T 1 to T k-1 trees are dfferent n colors. Soluton of frst queston s smple. Agan usng MI, assume T k -1 s true,.e. by connectng one addtonal vertex to T 1 to T k-2 trees, t gves T k-1 tree. Imagne that T 1 to T k-1 trees are here, and the addtonal vertex s frst lnked to T 1 to T k-2, a T k-1 tree s obtaned as the assumpton sad. Then there are T k-1 trees. And T k-1 tree has 2 k-2 vertces. By lnkng the roots of the two T k-1 trees, we get T k tree wth 2(2 k-2 ) = 2 k-1 vertces. Look at Fgure 3 to have a clear pcture. For the second queston. As there s assumpton that for T where 1 k-1, χ A (T ), the vertex wth th color can act as the root of T, whch does not change any structure of the tree. Thus, the roots of T 1 to T k-1 trees are all n dfferent color. Theorem 2. For any tree T, χ ol (T) = χ FF (T), where ol stands for optmal onlne algorthm and FF stands for Frst-Ft onlne algorthm.[3] Frst s to prove that for any tree T, f Frst-Ft colors a vertex of v of T wth color k, then T contans a copy of T k wth root v. By MI, the base step s trval, T 1 has only one color. So, assume T k case s true,.e. any tree T usng Frst-Ft to color, a vertex v s color s k, then T contans a copy of T k wth root v. Consder that a vertex u s colored wth k+1 by Frst-Ft, so u must be adjacent to k vertces that all are n dfferent colors,.e. k, v s adjacent to a vertex v that Frst - Ft has colored. And by the assumpton, v s a root of a copy U of T n T v. Dstnct U are n dstnct components of T v, because T s acyclc. Hence, U k U {v} s a copy of T k+1. Wth the above proof, just lookng at T k tree constructed n Theorem 1 can represent any tree. The maxmum degree of T k s k-1. Ths can be observed from the root whch s lnked to k-1 trees/vertces. No mater what s the nput sequence, wth maxmum degree of a graph s k-1, the maxmum chromatc number used by Frst-Ft must be (k-1)+1=k,.e. χ FF (T k ) k. Together wth Theorem 1, χ A (T k ) k for any onlne algorthm A, χ FF (T k ) = k, whch s optmal. If the tree contans n vertces, a T k tree whch has 2 k-1 vertces, so k s then equal to log 2 n + 1,.e. χ FF (T k ) = log 2 n + 1. Chromatc number of offlne algorthm χ s 2. The log n 1 performance rato for Frst-Ft on tree s then equal to 2 +. Ths s not 2 compettve as the performance rato s not bounded by a constant. HKUST CS Dept LO Yuet Me 6
9 6 Randomzed onlne graph colorng algorthm 6.1 General dea In randomzed manner, the technque s to gradually reduce the problem. Then recursvely apply the algorthm to solve the problem. The technque s reles on a crucal property of k-colorable graphs. The property states that f a graph G s k-colorable (can be colored by k number of colors), the neghbor of any node n G s (k-1)-colorable. Fgure 4 below s an example to show the dea. The hghlghted vertex n G s removed to form G. G G 5-colorable 4-colorable Fgure 4 : A 5-colorable graph G reduced to 4-colorable graph G Usng the algorthm, frst assumng that number of vertces n the graph, denoted as n, and the chromatc number χ are know n advance. In each teraton, a lmted number of colors, denoted as s, s used. For the vertces assgned wth the same color are put nto a bn, denoted as B,.e. there are s bns. Snce lmted colors are used, there are vertces cannot be assgned wth any color. These vertces are put nto resdue bn set. To partton these vertces to dfferent resdue bn, frst randomly choose one bn, partton bn, from B where 1 s, say B j. Every vertex n resdue bn set must be adjacent to at least one vertex n B j, otherwse vertex n resdue bn set can be colored wth color j. Therefore, partton the vertces accordng vertex n B j that s frst found adjacent to, say v. Vertces n resdue bn set adjacent to v are put nto R v bn. Each R v bn s k-1 colorable, and so the same algorthm s used to color the vertces nsde R v, whch may also cause further partton. Ths s a recursve algorthm. Fgure 5 has llustrated the dea descrbed above. Termnate the recurson, when the bn s 2-colorable. For 2-colorable graphs usually are bpartte graphs. As mentoned before, Frst-Ft s the best for many knds of graph but not all, bpartte graph s a case. Frst-Ft uses n/2 colors, but there s an algorthm that colors bpartte graphs on n 2 vertces wth at most 2 log 2 n colors (All the log afterwards are base 2). For the detals of ths algorthm and proof, please refer to [8]. If the bn s k-colorable where k>2, Frst-Ft s used (be formal, t s called Partal Frst-Ft, as lmted number colors used). HKUST CS Dept LO Yuet Me 7
10 # of color used = 5 V 1 V 2 V 3 V V 4 7 V 5 V 8 V 6 B 1 B 2 B 3 B 4 B 5 V 1 V 3 V 2 V 4 V 5 V 6 Assume B 1 s randomly selected for partton Resdue bn sets: R v1 R v3 V 7 V 8 Fgure 5 : Randomzed onlne graph colorng 6.2 Algorthm Below s a text-base algorthm.[9] Algorthm Onlne_color(n, χ): 1. If χ 2, then use a bpartte colorng algorthm that uses at most 2 log n colors (mentoned n secton 6.1). 2. Set s to be S(n, χ) = χ (χ-2) / (χ-1) 1/ (χ-1) 2 n (log n). 3. Choose a random nteger r unformly from {1,, s}. 4. Repeat untl there are no more vertces a. Get the next vertex v. b. If v can be colored usng the greedy set of colors 1,, s, color t. For every new vetex colored r nvoke a copy of Onlne_color(s, χ-1). Skp c. c. Now v s n the resdue bn set. Determne whch bn R the vertex falls nto. If the number of vertces n R exceeds s, nvoke a new copy of Onlne_color(s, χ-1). In any case, nput ths vertex to the copy of Onlne_color correspondng to R. Fgure 6 : Onlne_color(n,χ) algorthm HKUST CS Dept LO Yuet Me 8
11 Ths s newer verson of randomzed onlne graph colorng algorthm n pseudo form. K-Color-Onlne(T, v) {Re-entrant procedure.} {Assgn a color to vertex v usng colorng tree T.} {Return success or falure} begn wth T do f (χ 2) then return (BpartteColor(T, v)) f (N n) then T New-Colorng-Tree(2n, χ) N N + 1 for j 1 to s do f (v s non-adjacent to all vertces n B[j]) then Assgn v the color B[j] (or COLOR[v] B[j]) return (Success) {v must now be adjacent to some node n each color class} Non-determnstcally choose a neghbor w of v n parttonng bn B[part] f (R[w] s unntalzed) then R[w] New-Colorng-Tree(1, χ-1) return (K-Color-Onlne(R[w], v)) end New-Colorng-Tree(n 0, χ 0 ) {Create and return a new colorng tree wth capacty n and chromatc upper bound χ} begn wth T do n n 0 end χ χ 0 s S(n, χ) = (2 c ( χ-2)/( χ-1) n / (χ-2)) B[1,, s] a new set of colors part Random nteger between 1 and s N 0 return T Fgure 7 : Pseudo code of an randomzed onlne graph colorng algorthm [6] HKUST CS Dept LO Yuet Me 9
12 S(n, χ ), a functon n both algorthms s to calculate how many colors can be used, denoted as s. Varable N n Fgure 7 means the current number of vertces n the subtree. Other varables represent the same throughout Secton 6. A text-base algorthm n Fgure 6 may not easy to computerzed. 6.3 An upper bound proof Algorthm presented n Fgure 6 s used to have a look of upper bound. To show the upper bound, the maxmum expected number of colors used by the algorthm overall n vertces graphs of chromatc number χ, s denoted as A(n, χ). The depth of recurson s χ-1. Theorem 3. For χ 2, A(n, χ) χ (χ-2) / (χ-1) 1/ (χ-1) χ 2 n (log n).[9] By MI on χ. For χ = 2, A(n, χ) 2 log n n 0 log n = 8 log n. Before dong the nductve step, A(n, χ) must related to A(y, χ) for certan y. Assume the partton bn chosen s B, and the resdue bn set can be parttoned nto R 1,..., R ' n, where n ' = B. Further parttonng of the resdue bns may be needed to lmtng the sze of each bn to s, and at most n/s extra bns are added. Then let the resdue bn set be parttoned nto G 1,..., G ' n, where n n + n/s. Each choce of I from {1,, s} s unformly, so the probablty s all 1/s. Over subsequent rolls of the de, let E[ G j] s denoted as the expected number of colors used by the algorthm to color the graph G j. Also note that G js are χ-1 and the sze of each G s at most s. Hence E[ G ] A(s, χ-1). j 1 s A(n, χ) = s + (E[G ] E[G = 1 s s A(s, χ -1) s + n s A(s, χ -1) s + s = 1 2n s + A(s, χ -1) s s = 1 (n ; j + n/s) s = 1 n ; n 1 Q n ]) For smplcty, let c = Assume A(s, χ-1) s true,.e. n ( (log n). χ 2 and s = s/c = χ-2) / (χ-1) 1/ (χ-1) χ-1 (χ-3) / (χ-2) 1/ (χ-2) A(s, χ -1) (χ -1) 2 s (log s). HKUST CS Dept LO Yuet Me 10
13 A(n, χ) 2n s + A(s, χ -1) s 2n χ-1 s + (χ -1) 2 s s n = s + (χ -1) s s' s + < s + c (χ = s + c (χ = s + c (χ = s + c (χ = s + (χ = χs = χ 2 n (χ -1) c s' χ n -1) n s' -1) n -1) n -1) s' -1) s (χ-2) / (χ-1) (χ-3) / (χ-2) (χ-3) / (χ-2) -1/ (χ-2) 1-1 / (χ-1) (χ-2) / (χ-1) (log n) (χ-3) / (χ-2) (log s) s' (χ-3) / (χ-2) (log n) (log n) (log n) 1/ (χ-1) (log s) 1/ (χ-2) 1/ (χ-2) 1/ (χ-2) -1/ (χ-2)(χ-1) 1/ (χ-1) 1/ (χ-2) (log n) 1/ (χ-2) The upper bound s proved. Ths upper bound of expected number of colors can yeld a Ο (n / log n ) performance guarantee, whch s stated n [5]. 7 Performance rato For the performance rato of randomzed algorthm, one man pont dfferent from the one of determnstc s that the number of colors used by the algorthm s an expected value nstead of a true value. Ths s because the number of colors s a random varable n randomzed manner and only expected value can be determned. 7.1 Framework and defntons In Secton 2.4, t mentoned onlne problem s a two player game between an algorthm, say B, and an adversary, say C. The game s an undetermned number of request and answer transactons. The framework s lke follow: 1. At tme t, C poses a par of vertex v and vertces that adjacent to v and are already n the graph..e. gven par (v t, Adj(v t )) where Adj(v t ) {v 1, v t-1 }. 2. B answers wth an nteger Bn(v t ), a proper colorng of v t. 3. C responds wth an nteger Col(v t ), a proper colorng of v t. Adj(v t ) s the adjacent lst of v t, restrcted to the prevous vertces. A proper colorng s a functon f(v t ) f v j Adj(v t ) then f(v j ) f(v t ). Let have some new defntons. At tme t, bns used by the algorthm s denoted as B t = {b 1, b 2,, b m }. HKUST CS Dept LO Yuet Me 11
14 Each bn b j contans the vertces assgned to that bn, that s b j = {v : Bn(v ) = j}. Defne the hue of a bn to be the set of colors of the vertces n the bn..e. Hue(bj) = {Col(v ) : v b j } The collecton C t of hues s smply {Hue(b j ) : b j B t }. HUECOUNT t hues denote the sum of szes of the bn hues, h C t h. For a vertex v t, ts hue Hue(vt) s the set of colors that are not used by ts neghbors. Snce adjacent vertces cannot be colored wth the same color, the hue represents the choce of colors that the adversary has for that vertex. Number of vertces n the graph s represented by n. Chromatc number of the graph s represented by k. The descrpton above can be pctured t as Fgure 8 shown below. v 1 v 3 v 2 Color by on-lne algorthm b 1 b 2 v 1 v 3 v 2 Hue(v 2 ) v 1 v 2 Hue(b 1 ) Hue(b 2 ) HUECOUNT = Hue(b 1 ) v 3 Color by adversary + Hue(b 2 ) = 3 Fgure 8 : Pcture for algorthm and adversary game. 7.2 Adversaral strategy Adversary has some strateges to base on. To color a vertex v t, adversary must obey the rule: A vertex v t wll be non-adjacent to a prevous vertex v, f and only f the color of v s n the hue selected,.e. Hue(v t ).The goal s to use as many bns as possble. The hue sze of each bn cannot exceed the number of colors n use. And a fact that bn hue must be a subset of the vertex hue, otherwse bn would contan a vertex adjacent to the current vertex v t. Ths mples that at tme t, at least HUECOUNT t / (max <t Hue(v ) ) bns have been used. The objectve s then to ncrease the HUECOUNT wth every new vertex f possble. HKUST CS Dept LO Yuet Me 12
15 7.3 Lower bound of Determnstc algorthm In ths case, adaptve constructon s used as below. Fnd any vertex hue Hue(v t ) not contaned n bn hue collecton C t. Let Adj(v t ) = {v : Col(v ) Hue(v t ) and < t}. Assume the algorthm color v t wth color j,.e. j = Bn(v t ). Let adversary color the vertex wth color s that s not n the bn hue but contans n vertex hue,.e. Col(v t ) be any s Hue(v t ) Hue(b j ). Theorem 4. The performance rato of any determnstc on-lne colorng algorthm s at least 2n / log 2 n (1-o(1)). [4] k Let n = k/2. k/2 k As long as the number of vertces s less than k/2, we can always get a k/2-set k/2 vertex hue not found n any hue collecton C. The vertex s adjacent to k/2 dfferent colors, so there are k/2 dfferent colors left. Hence, the bn the vertex s places n contans fewer than k/2 colors, snce bn hue must be a subset of the vertex hue. Thus, there s a vald color to make the HUECOUNT t+1 = HUECOUNT t + 1, ths acton s sad to make progress. Snce each vertex ncreases the number of colors n some bn,.e. HUECOUNT = n, and each bn contans no more than k/2 colors, the algorthm must use at least n k = bns. And the number of colors used by the adversary s k, or k/2 k/2 log n (1+o(1)), therefore the performance rato s at least 2n/k 2 = 2n / log 2 n (1-o(1)). 7.4 Lower bound of Randomzed algorthm Oblvous constructon s used. Frst assume a functon Random that takes a fnte set and selects one tem wth a unform probablty, and let [k] denote {1, 2,, k}. The constructon s lke below: Randomly choose a vertex hue Hue(v t ). Color the vertex v t wth a random color n Hue(v t ),.e. Col(v t ) = Random(Hue(v t )). If the randomly guessed color s not contaned n the bn hue whch the bn chosen by the algorthm, t makes progress. For all the bn hues contaned n the gven vertex hue are a constant fracton smaller than the vertex hue, then the random color whch makes progress s wth a fxed constant probablty regardless of the algorthm s bn HKUST CS Dept LO Yuet Me 13
16 choce. The probablty s proportonal to the rato of the dfference n the number of avalable colors, Hue(v t ), and the number of colors used by the bn t s placed nto, Hue(b j ), to the number of avalable colors,.e. ( Hue(v t ) - Hue(b j ) ) / k. By usng a relatvely small graph, say n = 2 k/4, one thng can be ensured that the bn hue collecton remans relatvely sparse. Then s to prove dstance property, from a randomly selected k/2-set vertex hue, to an arbtrary collecton of no more than n sets. The am s to show that the expected dstance s large, and the probablty of a short dstance s very low. For a k/2-set vertex hue p, and a collecton C of subsets of [k] bn hues, defne dst(p,c) = mn{ p - h : h C { } and h p}. Lemma 1. Let C be any collecton of subsets of [k] bn hues, and let p be a randomly chosen subset of vertex hues of sze k/2. If C 2 k/4 and k s large enough, then E[dst(p,C)] k/4 and Pr[dst(p,C) k/4] k.[4] Wth the lemma above, we can prove the lower bound of randomzed algorthm. Theorem 5. The performance rato of any randomzed on-lne colorng algorthm s at least n/(16 log 2 n).[4] Let n = 2 k/4. The probablty that makng progress s at least the rato of dst to the number of dst k/4 1 avalable colors, or =. Thus, the expected HUECOUNT s at least n (1/2) p k/2 2 = n/2. Snce each bn can contan only k/2 colors, sze of vertex hue p and what we assumed, the algorthm uses at least expected n/k bns. Snce n = 2 k/4, k = 4 log n. Then the performance rato s at least n/k 2 = n/(16 log 2 n). 7.5 Summary On-lne determnstc On-lne randomzed Upper bounds Ο(n / log*n) [8] Ο (n / log n ) [9] Proved!!! Ο(n / log n) [6] Lower bounds Ω(n / log 2 n) [4] Proved!!! Ω(n / log 2 n) [4] Proved!!! HKUST CS Dept LO Yuet Me 14
17 8 Concluson In the real world, there are many stuatons to share lmted resources. Number of sharng s changng whle tme goes by. To avod a same resource shared wth dfferent users at the same tme, onlne graph colorng s a good soluton. To measure graph colorng algorthm, compettve rato s not used nstead performance rato s called. And n fact, they work n smlar way. Both ratos are comparng the cost of the onlne algorthm and the cost of offlne/optmal algorthm. In determnstc manner, the cost of onlne algorthm s a true value, but f t s n randomzed manner, the cost s then a random varable. There s no way to confrm the true value of the cost, so expected s used for the calculaton. From the varous dscussons above, there s a powerful algorthm used n both determnstc and randomzed manners, Frst-Ft. It gves best performance n many graphs, but stll there are some exceptons, bpartte graph s an example. Ths mples that there should be other algorthm somehow can do better than Frst-Ft, and ths s the motvaton for the researcher to thnk. Randomzed algorthm wll then be benefted. All the proofs above, we assume number of vertces and chromatc number of optmal soluton are known. Chromatc number must be needed n the randomzed algorthms shown to calculate the number of colored used by the Partal Frst-Ft, and n the real lfe, ths s not gong to happen, as we do not know what the graph wll be. From the table n Secton 7.5, an observaton s that all the performance ratos shown are not bounded by a constant, all are related to the number of vertces. Ths phenomenon s called not compettve. It concludes that onlne graph colorng problem s very hard, and ths s also a reason for the researcher to work on graph colorng. HKUST CS Dept LO Yuet Me 15
18 9 Reference [1] Lecture notes of Onlne Algorthms and Compettve Analyss n Technon - Israel Insttute of Technology. {downloaded at: teachng/onlne0102a/l5.ps} [2] Dctonary of Algorthms and Data Structures home page {appear at: dads/html/adversary.html} [3] A. Gyárás and J. Lehel. On-lne and frst-ft colorngs of graphs. Journal of Graph Theory, 12: , [4] M. M. Halldórsson and M. Szegedy. Lower bounds for on-lne graph colorng. Theoret. Comput. Sc. 130: , 1994 [5] M. M. Halldórsson. Improved performance guarantee for randomzed on-lne graph colorng. DIMACS, May [6] M. M. Halldórsson. Parallel and on-lne graph colorng. Journal of Algorthms. 23: , [7] H. A. Kerstead. The lnearty of frst-ft colorng of nterval graphs. SIAM Journal on Dscrete Math, 1: , 1988 [8] L. Lovász, M. Sakes, and W. T. Trotter. An onlne graph colorng algorthm wth sublnear performance rato. Dsrete Mathematcs, 75: , [9] S. Vshwanathan. Randomzed onlne graph colorng. Journal of Algorthms. 13: , Also n Proc. 31 st IEEE Symposum on Foundatons of Computer Scence , HKUST CS Dept LO Yuet Me 16
The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationInsertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array
Inserton Sort Dvde and Conquer Sortng CSE 6 Data Structures Lecture 18 What f frst k elements of array are already sorted? 4, 7, 1, 5, 1, 16 We can shft the tal of the sorted elements lst down and then
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More information1 Dynamic Connectivity
15-850: Advanced Algorthms CMU, Sprng 2017 Lecture #3: Dynamc Graph Connectvty algorthms 01/30/17 Lecturer: Anupam Gupta Scrbe: Hu Han Chn, Jacob Imola Dynamc graph algorthms s the study of standard graph
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationRamsey numbers of cubes versus cliques
Ramsey numbers of cubes versus clques Davd Conlon Jacob Fox Choongbum Lee Benny Sudakov Abstract The cube graph Q n s the skeleton of the n-dmensonal cube. It s an n-regular graph on 2 n vertces. The Ramsey
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationAll-Pairs Shortest Paths. Approximate All-Pairs shortest paths Approximate distance oracles Spanners and Emulators. Uri Zwick Tel Aviv University
Approxmate All-Pars shortest paths Approxmate dstance oracles Spanners and Emulators Ur Zwck Tel Avv Unversty Summer School on Shortest Paths (PATH05 DIKU, Unversty of Copenhagen All-Pars Shortest Paths
More informationSorting. Sorting. Why Sort? Consistent Ordering
Sortng CSE 6 Data Structures Unt 15 Readng: Sectons.1-. Bubble and Insert sort,.5 Heap sort, Secton..6 Radx sort, Secton.6 Mergesort, Secton. Qucksort, Secton.8 Lower bound Sortng Input an array A of data
More informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More informationSorting: The Big Picture. The steps of QuickSort. QuickSort Example. QuickSort Example. QuickSort Example. Recursive Quicksort
Sortng: The Bg Pcture Gven n comparable elements n an array, sort them n an ncreasng (or decreasng) order. Smple algorthms: O(n ) Inserton sort Selecton sort Bubble sort Shell sort Fancer algorthms: O(n
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationShared Running Buffer Based Proxy Caching of Streaming Sessions
Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,
More informationOn Two Segmentation Problems
Journal of Algorthms 33, 173184 Ž 1999. Artcle ID jagm.1999.1024, avalable onlne at http:www.dealbrary.com on On Two Segmentaton Problems Noga Alon* Department of Mathematcs, Raymond and Beerly Sacler
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar
Internatonal Journal of Scentfc & Engneerng Research Volume 7 Issue 5 May-6 34 Some Polygonal Sum Labelng of Bstar DrKAmuthavall SDneshkumar ABSTRACT- A (p q) graph G s sad to admt a polygonal sum labelng
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationb * -Open Sets in Bispaces
Internatonal Journal of Mathematcs and Statstcs Inventon (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 wwwjmsorg Volume 4 Issue 6 August 2016 PP- 39-43 b * -Open Sets n Bspaces Amar Kumar Banerjee 1 and
More informationAlgorithm To Convert A Decimal To A Fraction
Algorthm To Convert A ecmal To A Fracton by John Kennedy Mathematcs epartment Santa Monca College 1900 Pco Blvd. Santa Monca, CA 90405 jrkennedy6@gmal.com Except for ths comment explanng that t s blank
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationGreedy Technique - Definition
Greedy Technque Greedy Technque - Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationNOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING
Journal of Theoretcal and Appled Informaton Technology 27 JATIT. All rghts reserved. www.jatt.org NOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING Fatma A. Newagy, Yasmne A. Fahmy, and
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationOn a Local Protocol for Concurrent File Transfers
On a Local Protocol for Concurrent Fle Transfers MohammadTagh Hajaghay Dep. of Computer Scence Unversty of Maryland College Park, MD hajagha@cs.umd.edu Roht Khandekar IBM T.J. Watson Research Center 19
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More information11. APPROXIMATION ALGORITHMS
Copng wth NP-completeness 11. APPROXIMATION ALGORITHMS load balancng center selecton prcng method: vertex cover LP roundng: vertex cover generalzed load balancng knapsack problem Q. Suppose I need to solve
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationClustering on antimatroids and convex geometries
Clusterng on antmatrods and convex geometres YULIA KEMPNER 1, ILYA MUCNIK 2 1 Department of Computer cence olon Academc Insttute of Technology 52 Golomb tr., P.O. Box 305, olon 58102 IRAEL 2 Department
More informationRandom Variables and Probability Distributions
Random Varables and Probablty Dstrbutons Some Prelmnary Informaton Scales on Measurement IE231 - Lecture Notes 5 Mar 14, 2017 Nomnal scale: These are categorcal values that has no relatonshp of order or
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationA New Exact Algorithm for Traveling Salesman Problem with Time Complexity Interval (O(n^4), O(n^3 2^n))
A New Exact Algorthm for Travelng Salesman roblem wth Tme Complexty Interval (O(n^4), O(n^3 2^n)) 39 YUNENG LI, Southeast Unversty Travelng salesman problem s a N-hard problem. Untl now, researchers have
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More information1 Introducton Effcent and speedy recovery of electrc power networks followng a major outage, caused by a dsaster such as extreme weather or equpment f
Effcent Recovery from Power Outage (Extended Summary) Sudpto Guha Λ Anna Moss y Joseph (Seff) Naor z Baruch Scheber x Abstract We study problems that are motvated by the real-lfe problem of effcent recovery
More informationPriority queues and heaps Professors Clark F. Olson and Carol Zander
Prorty queues and eaps Professors Clark F. Olson and Carol Zander Prorty queues A common abstract data type (ADT) n computer scence s te prorty queue. As you mgt expect from te name, eac tem n te prorty
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More information