On the Virtues of Parameterized Uniform Crossover

Size: px
Start display at page:

Download "On the Virtues of Parameterized Uniform Crossover"

Transcription

1 On the Vrtues of Parameterzed Unform Crossover Wllam M. Spears Naval Research aboratory Washngton, D.C USA Kenneth A. De Jong George Mason Unversty Farfax, VA USA Abstract Tradtonally, genetc algorthms have reled upon and 2-pont crossover operators. Many recent emprcal studes, however, have shown the benefts of hgher numbers of crossover ponts. Some of the most ntrgung recent work has focused on unform crossover, whch nvolves on the average /2 crossover ponts for strngs of length. Theoretcal results suggest that, from the vew of hyperplane samplng dsrupton, unform crossover has few redeemng features. However, a growng body of expermental evdence suggests otherwse. In ths paper, we attempt to reconcle these opposng vews of unform crossover and present a framework for understandng ts vrtues. Introducton One of the unque aspects of the work nvolvng genetc algorthms (GAs) s the mportant role that recombnaton plays. In most GAs, recombnaton s mplemented by means of a crossover operator whch operates on pars of ndvduals (parents) to produce new offsprng by exchangng segments from the parents genetc materal. Tradtonally, the number of crossover ponts (whch determnes how many segments are exchanged) has been fxed at a very low constant value of or 2. Support for ths decson came from early work of both a theoretcal and emprcal nature [Holland, 975; DeJong, 975]. However, there contnue to be ndcatons that there are stuatons n whch havng a hgher number of crossover ponts s benefcal [Syswerda, 989; Eschelman, 989]. Perhaps the most surprsng result (from a tradtonal perspectve) s the effectveness on some problems of unform crossover, an operator whch produces on the average /2 crossngs on strngs of length [Syswerda, 989]. Recent work by [Spears and De Jong, 990] has extended the theoretcal analyss of n-pont and unform crossover wth respect to dsrupton of samplng dstrbutons. However, they ponted out that dsrupton analyss alone s not suffcent n general to predct and/or select optmal forms of crossover. In partcular, they have shown that the populaton sze must also be taken nto account [DeJong and Spears, 990]. Ths paper extends that work by lookng at the propertes of a parameterzed unform crossover operator and by consderng two other aspects of crossover operators, namely, ther recombnaton potental and ther exploratory power. In ths context, a surprsngly postve vew of unform crossover emerges. 2 Dsrupton Analyss Holland provded the ntal formal analyss of the behavor of GAs by showng how they allocate trals n a near optmal way to competng low order hyperplanes f the dsruptve effects of the genetc operators used s not too severe [Holland, 975]. Snce mutaton s typcally run at a very low rate, t s generally gnored as a sgnfcant source of dsrupton. However, crossover s usually appled at a very hgh rate. So, consderable attenton has been gven to estmatng P d, the probablty that a partcular applcaton of crossover wll be dsruptve. Holland s ntal analyss of the samplng dsrupton of -pont crossover [Holland, 975] has been extended to n-pont and unform crossover [DeJong, 975; Spears and DeJong, 990]. These results are n the form of estmates of the lkelhood that the samplng of a kth order hyperplane (H k ) wll be dsrupted by a partcular form of crossover. It turns out to be easer mathematcally to estmate the complement of dsrupton: the lkelhood of a sample survvng crossover (whch we denote as P s ). As one mght expect, the results are a functon of both the order k of the hyperplane and ts defnng length (see the Appendx and [Spears and DeJong, 990] for more precse detals). We provde n Fgure a graphcal summary of a typcal nstance of these results for the case of 3rd order hyperplanes. The non-horzontal curves represent the survval

2 of 3rd order hyperplanes under n-pont crossover (n =...6). The horzontal lne represents the probablty of survval under unform crossover. Fgure hghlghts two mportant ponts. Frst, f we nterpret the area above a partcular curve as a measure of the cumulatve dsrupton potental of ts assocated crossover operator, then these curves suggest that 2-pont crossover s the least dsruptve of the n-pont crossover famly, and less dsruptve than unform crossover. Fnally, unlke n-pont crossover, unform crossover dsrupts all hyperplanes of order k wth equal probablty, regardless of how long or short ther defnng lengths are. 3 A Postve Vew of Crossover Dsrupton A recurrng theme n Holland s work s the mportance of a proper balance between exploraton and explotaton when adaptvely searchng an unknown space for hgh performance solutons [Holland, 975]. The dsrupton analyss of the prevous secton mplctly assumes that dsrupton of the samplng dstrbutons s a bad thng and to be avoded (e.g., a hgh dsrupton may stress exploraton at the expense of explotaton). However, ths s not always the case. There are mportant stuatons n whch mnmzng dsrupton hnders the adaptve search process by overemphaszng explotaton at the expense of needed exploraton. One of the clearest examples of ths s when the populaton sze s too small to provde the necessary samplng accuracy for complex search spaces [DeJong and Spears, 990]. To llustrate ths we have selected a 30 bt problem wth 6 peaks from [DeJong and Spears, 990]. The measure of performance s smply the best ndvdual found by the genetc algorthm. Ths s plotted every 00 evaluatons. Snce we are maxmzng, hgher curves represent better performance. Fgures 2 and 3 llustrate the effect of populaton sze on GA performance. Notce how unform crossover domnates 2-pont crossover on the 6-Peak problem wth a small populaton, but just the opposte s true wth a large populaton. One concluson of these results mght be that we should mantan a portfolo of crossover operators and study the effects of varous combnatons. We have been examnng another approach: achevng a better balance of exploraton and explotaton usng only unform crossover. We are ntrgued by ths possblty for two reasons: ts smplcty (only one crossover form) and ts potental for ncreased robustness because the dsruptve effect of unform crossover s not nfluenced by hyperplane defnng length. unform Evaluatons * 00 Fgure 2: 6-Peak (30 bts) - Populaton 20 P s pt unform / 2 Defnng ength pt Evaluatons * 00 unform Fgure. Survval of 3rd Order Hyperplanes Fgure 3: 6-Peak (30 bts) - Populaton 000 2

3 4 A Closer ook at Unform Crossover It s clear that the level of dsrupton provded by unform crossover s too hgh n many cases (e.g., when large populatons are used). Ths standard form of unform crossover swaps two parents alleles wth a probablty of. Suppose, however, that we parameterze unform crossover, where P 0 denotes the probablty of swappng. We can now consder the effect of decreasng P 0. Fgure 4 llustrates ths for 3rd order hyperplanes. Notce how the dsrupton of unform crossover can be controlled by lowerng P 0, wthout affectng the property that the dsrupton has no defnng length bas. In partcular, note that by smply lowerng P 0 to., unform crossover s less dsruptve (overall) than 2-pont crossover and has no defnng length bas! Ths suggests a much more postve vew of the potental of unform crossover, namely, an unbased recombnaton operator whose dsrupton potental can be easly controlled by a sngle parameter P 0. To test ths hypothess, we have run a number of experments n whch P 0 vared. As expected, we can ncrease and decrease performance on a gven problem wth a fxed populaton sze smply by varyng P 0. Fgure 5 llustrates ths on the 6-Peak problem. Note that n ths partcular case, a value of P 0 = 0.2 produced the best results. Referrng back to Fgures 3 and 4, we can now see why. For the 6-Peak problem, a populaton sze of 000 has suffcent samplng capacty to requre only the dsrupton level provded by 2-pont crossover. Unform crossover wth P 0 = 0.2 provdes approxmately the same level of dsrupton but wthout the length bas. P s pt.5 unform / 2 Defnng ength.0 unform. unform.2 unform pt Fgure 4. Survval of 3rd Order Hyperplanes Note that we do not need to consder the possblty of ncreasng P 0, due to the symmetry of unform crossover..2 unform.0 unform.5 unform Evaluatons * 00 Fgure 5: 6-Peak (30 bts) - Populaton 000 Is ths lack of length bas really mportant? Intutvely, t should help overcome representaton problems n whch mportant hyperplanes happen to have defnng lengths whch are adversely affected by the partcular n-pont crossover operator n use. Syswerda llustrated ths clearly wth hs "sparse -max" problem n whch 270 fake bts were appended to a 30-bt problem [Syswerda, 989]. One can show smlar results wth almost any problem. Fgure 6 llustrates ths on our 6-Peak problem appended wth 270 fake bts and the same evaluaton functon. Notce that, n comparson to the orgnal 30-bt problem shown n Fgure 5, the performance of 2-pont crossover s worse, whle the performance of unform crossover (P 0 =.2) remans essentally unchanged. How do we explan the drop n performance of 2-pont crossover? In ths case, the 30 mportant bts are all.2 unform Evaluatons * 00 Fgure 6: 6-Peak (300 bts) - Populaton 000 3

4 wthn a dstance of /0 of each other (where s the length of the strng). If we examne Fgure 4, we note that 2-pont crossover s less dsruptve wthn that range (0 to /0) of defnng lengths. In other words, the addton of 270 addtonal bts effectvely decreases the dsrupton of the mportant hyperplanes under 2-pont crossover. Ths effect s most obvous towards the end of the runs (see Fgure 6), where dsrupton s ncreasngly useful (due to the ncreasng homogenety of the populaton). Unform crossover s not nfluenced by the added 270 bts, snce t s nsenstve to defnng length. In summary, we see two mportant vrtues of unform crossover. The frst s the ease wth whch the dsruptve effect of unform crossover can be controlled by varyng P 0. Ths s useful n achevng the proper balance between exploraton and explotaton. The second vrtue s that the dsruptve potental of unform crossover does not depend on the defnng length of hyperplanes. Ths allows unform crossover to perform equally well, regardless of the dstrbuton of mportant alleles. 5 Recombnaton Potental Another possble vrtue of unform crossover that has been dscussed n the lterature s ts recombnaton potental. In comparng unform, and 2-pont crossover, Syswerda felt that unform crossover ganed sgnfcant advantage from ts ablty to combne small buldng blocks nto larger ones [Syswerda, 989]. He defned recombnaton potental as the ablty of crossover to create hgher order hyperplanes when the parents contan the necessary lower order hyperplanes. He provded an analyss showng unform crossover (P 0 =.5) to have a hgher recombnaton potental than and 2-pont crossover. Syswerda ponted out that recombnaton can be consdered to be a specalzed form of survval, n whch two lower order hyperplanes survve onto the same strng, resultng n a hgher order hyperplane. Ths observaton allowed Syswerda to construct a recombnaton analyss from hs survval analyss. However, snce hs survval analyss was lmted to and 2-pont crossover, and to unform crossover wth a P 0 of.5, hs recombnaton analyss was smlarly lmted. Ths motvated us to create a new recombnaton analyss n a smlar ven, snce our survval analyss ncludes all of n-pont crossover and a parameterzed unform crossover. In [Spears and DeJong, 990], we developed a survval analyss for n-pont crossover and a parameterzed (P 0 ) unform crossover. Detals of ths analyss, and our recombnaton analyss, are presented n the Appendx. Fgure 7 llustrates the relatonshps of the crossover operators n terms of ther recombnaton potental (we denote P r as the probablty of recombnaton). Note specfcally that there s evdence to support the clam that unform crossover (P 0 =.5) has a hgher P r.5 unform / 2 Defnng ength. unform.0 unform Fgure 7: 3rd Order Hyperplane Recombnaton pt recombnaton potental than the other crossover operators. However, t s even more nterestng to note that these relatonshps are qualtatvely dentcal to those shown n Fgure 4. In other words, f one operator s better than another for survval, t s worse for recombnaton (and vce versa). Ths observaton appears to hold for all k, and suggests very strongly that the recombnaton analyss tells us nothng new about crossover. 6 Exploraton Power It has also been ponted out that dsrupton does not necessarly mean useful exploraton. Crossover dsrupton smply mples that a hyperplane sample has been modfed by crossover n some way so as to no longer be a member of that hyperplane, wthout any ndcaton as to the possble forms that change mght take. The potental number of ways n whch a crossover operator can effect a change has been called ts exploratory power. It has been ponted out that unform crossover has the addtonal property that t has more exploratory power than n-pont crossover [Eschelman, 989]. To see that ths s true, consder the extreme case n whch one parent s a strng of all 0s and the other all s. Clearly unform crossover can produce offsprng anywhere n the space whle and 2-pont crossover are restrcted to rather small subsets. In general, unform crossover s much more lkely to dstrbute ts dsruptve trals n an unbased manner over larger portons of the space. The dffculty comes n analyzng whether ths exploratory power s a vrtue. If we thnk of explotaton as the based component of the adaptve search process, t makes sense to balance ths wth unbased exploraton. Clearly, ths exploratory power can help n the early generatons, partcularly wth smaller populaton szes, to make sure the whole space s well sampled. At the same 4

5 tme, some of ths exploratory power can be acheved over several generatons va repeated applcatons of and 2-pont crossover. Unfortunately, our current analyss tools do not allow us to make comparsons of propertes whch span generatons and are strongly affected by selecton. Hopefully we wll develop such tools and resolve questons of ths type n the near future. 7 Conclusons and Further Work The extensons to the analyss of n-pont and unform crossover presented n ths paper open up an nterestng and postve vew of the usefulness of unform crossover. There appear to be three potentally mportant vrtues of unform crossover. Frst, the dsrupton of hyperplane samplng under unform crossover does not depend on the defnng length of the hyperplanes. Ths reduces the possblty of representaton effects, snce there s no defnng length bas. Second, the dsrupton potental s easly controlled va a sngle parameter P 0. Ths suggests the need for only one crossover form (unform crossover), whch s adapted to dfferent stuatons by adjustng P 0. Fnally, when a dsrupton does occur, unform crossover results n a mnmally based exploraton of the space beng searched. The frst two vrtues have been confrmed both theoretcally and expermentally. At the same tme, t should be emphaszed that the emprcal studes presented are lmted to a carefully controlled expermental settng. The authors are currently workng on expandng these experments and on developng an exploraton theory for recombnaton operators. Our goal s to understand these nteractons well enough so that GAs can be desgned to be self-selectng wth respect to such decsons as optmal populaton sze and level of dsrupton. Acknowledgements We would lke to thank Dana Gordon for pontng out flaws n our prelmnary recombnaton analyss. References De Jong, Kenneth A. (975). An Analyss of the Behavor of a Class of Genetc Adaptve Systems, Doctoral Thess, Department of Computer and Communcaton Scences, Unversty of Mchgan, Ann Arbor. De Jong, K. A. & Spears, W. (990). An Analyss of of the Interactng Roles of Populaton Sze and Crossover n Genetc Algorthms, Proceedngs of the Frst Int l Conf. on Parallel Problem Solvng from Nature, Dortmund, Germany, October 990. Eschelman,., Caruana, R. & Schaffer, D. (989). Bases n the Crossover andscape, Proc. 3rd Int l Conference on Genetc Algorthms, Morgan Kaufman Publshng. Holland, John H. (975). Adaptaton n Natural and Artfcal Systems, The Unversty of Mchgan Press. Spears, W. & De Jong, K. A. (990). An Analyss of Mult-pont Crossover, Proceedngs of the Foundatons of Genetc Algorthms Workshop, Indana, July 990. Syswerda, Glbert. (989). Unform Crossover n Genetc Algorthms, Proc. 3rd Int l Conference on Genetc Algorthms, Morgan Kaufman Publshng. Appendx Summary of the Survval Analyss For n-pont crossover, P s s expressed n the order dependent form (P k,s ): P 2,s ( n,, ) = and Σ n n = 0 P k,s ( n,,,..., k ) = Σ n n = 0 n C s n P k,s (,,..., k ) Note that the survval of a kth order hyperplane under n- pont crossover s recursvely defned n terms of the survval of lower order hyperplanes. refers to the length of the ndvduals. The... k refer to the defnng lengths between the defnng postons of the kth order hyperplane. The effect of the recurson and summaton s to consder every possble placement of n crossover ponts wthn the kth order hyperplane. The correcton factor C s computes the probablty that the hyperplane wll survve, based on that placement of crossover ponts. Suppose that crossover results n x of the k defnng postons beng exchanged. Then the hyperplane wll survve f: ) the parents match on all x postons beng exchanged, or 2) f they match on all k x postons not beng exchanged, or 3) they match on all k defnng postons. Hence, the general form of the correcton s: C s = P eq x + P eq k x P eq k where P eq s the probablty of two parents sharng an allele at each locus, and the P k eq reflects an overlap wthn the 3 possbltes (and hence must be subtracted). 5

6 As an example, consder Fgure 8. The two parents are denoted by P and P2. In ths fgure, we represent the survval of a 4th order hyperplane. The hyperplane defnng postons are depcted wth crcles. Snce of the defnng postons wll be exchanged (under the 2-pont crossover shown), the probablty of survval s: P: P2: C s = P eq + P eq 3 P eq 4 Fgure 8: 4th Order Hyperplane Survval of the k defnng postons survvng n the same ndvdual (.e., x s a subset of the m + n defnng postons), then recombnaton wll occur f: ) the parents match on all of the x postons, or 2) f they match on all k x postons, or 3) they match on all k defnng postons. Hence, the general form of the recombnaton correcton C r s: C r = P eq x + P eq k x P eq k Note the smlarty n descrpton wth the survval correcton factor C s (the only dfference s n how x s defned). In other words, gven a kth order hyperplane, and two hyperplanes of order n and m, P k,r s smply P k,s wth the correcton factor redefned as above. As an example, consder Fgure 9. In ths fgure, we represent the recombnaton of 2 2nd order hyperplanes. One hyperplane s depcted wth crcles, and the other wth rectangles. Snce 3 of the defnng postons wll survve onto the same ndvdual (under the 2-pont crossover shown), the probablty of survval s: C r = P eq 3 + P eq P eq 4 For parameterzed unform crossover, P s s also expressed n an order dependent form (P k,s ): P k,s (H k ) = P: Σ k!" k#$ (P 0 ) ( P 0 ) k (P k eq + P eq P k eq ) = 0 where P 0 s the probablty of swappng two parents alleles at each locus. A graphcal representaton of these equatons has been shown prevously n Fgure 4. Recombnaton Analyss for N-Pont Crossover In our defnton of survval, t s possble for a hyperplane to survve n ether chld. Recombnaton can be consdered a restrcted form of survval, n whch two lower order hyperplanes survve to form a hgher order hyperplane. The dfference s that the two lower order hyperplanes (each of whch exsts n one parent) must survve n the same ndvdual, n order for recombnaton to occur. In the remanng dscusson we wll consder the creaton of a kth order hyperplane from two hyperplanes of order m and n. We wll restrct the stuaton such that the two lower order hyperplanes are non-overlappng, and k = m + n. Each lower order hyperplane s n a dfferent parent. We denote the probablty that the kth order hyperplane wll be recombned from the two hyperplanes as P k,r. An analyss of recombnaton under n-pont crossover s smple f one consders the correcton factor C s defned earler for the survval analyss. Recall that recombnaton wll occur f both lower order hyperplanes survve n the same ndvdual. If an n-pont crossover results n x P2: Fgure 9: 2nd Order Hyperplane Recombnaton Recombnaton Analyss for Unform Crossover The analyss of recombnaton under unform crossover also nvolves the analyss of the orgnal survval equaton. Note that, due to the ndependence of the operator (each allele s swapped wth probablty P 0 ), the survval equaton can be dvded nto three parts. The frst part expresses the probablty that a hyperplane wll survve n the orgnal strng: P k,s,org (H k ) = Σ k %& k'( (P 0 ) ( P 0 ) k k (P eq ) = 0 The second part expresses the probablty that a hyperplane wll survve n the other strng: P k,s,other (H k ) = Σ k )* k+, (P 0 ) ( P 0 ) k (P eq ) = 0 The fnal part expresses the probablty that a hyperplane wll exst n both strngs: 6

7 P k,s,both (H k ) = Σ k -. k/0 (P 0 ) ( P 0 ) k (P k k eq ) = P eq = 0 Then: P k,s (H k ) = P k,s,org (H k ) + P k,s,other (H k ) P k,s,both (H k ) Note, however, that ths formulaton allows us to express recombnaton under unform crossover. Agan, assumng the recombnaton of two non-overlappng hyperplanes of order n and m nto a hyperplane of order k: P k,r (H k ) = P m,s,org (H m ) P n,s,other (H n ) + P m,s,other (H m ) P n,s,org (H n ) P m,s,both (H m ) P n,s,both (H n ) Ths equaton reflects the decomposton of recombnaton nto two ndependent survval events. The frst term s the probablty that H m wll survve on the orgnal strng, whle H n swtches (.e., both hyperplanes survve on one parent). The second term s the probablty that both hyperplanes survve on the other parent. The thrd term reflects the jont probablty that both hyperplanes survve on both strngs, and must be subtracted. Fnally, t s nterestng to note that the last term s equvalent to P m n eq P eq = P k eq. 7

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For 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 information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

Complex 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. 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 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 information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.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 information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki 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 information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Problem Set 3 Solutions

Problem 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

Lecture 5: Multilayer Perceptrons

Lecture 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 information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User 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 information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent 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 information

Support Vector Machines

Support 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 information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

S1 Note. Basis functions.

S1 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 information

Array transposition in CUDA shared memory

Array 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 information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

X- Chart Using ANOM Approach

X- 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 information

Performance Evaluation of Information Retrieval Systems

Performance 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 information

Comparing High-Order Boolean Features

Comparing High-Order Boolean Features Brgham Young Unversty BYU cholarsarchve All Faculty Publcatons 2005-07-0 Comparng Hgh-Order Boolean Features Adam Drake adam_drake@yahoo.com Dan A. Ventura ventura@cs.byu.edu Follow ths and addtonal works

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

CS 534: Computer Vision Model Fitting

CS 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 information

3D vector computer graphics

3D 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 information

Brave New World Pseudocode Reference

Brave 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 information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential 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 information

Optimal Workload-based Weighted Wavelet Synopses

Optimal 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 information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 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 information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum 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 information

Intro. Iterators. 1. Access

Intro. 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 information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Load Balancing for Hex-Cell Interconnection Network

Load 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 information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis 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 information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Parallel matrix-vector multiplication

Parallel 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 information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite 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 information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A 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 information

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization Suppresson for Lumnance Dfference of Stereo Image-Par Based on Improved Hstogram Equalzaton Zhao Llng,, Zheng Yuhu 3, Sun Quansen, Xa Deshen School of Computer Scence and Technology, NJUST, Nanjng, Chna.School

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More information

Analysis of Malaysian Wind Direction Data Using ORIANA

Analysis of Malaysian Wind Direction Data Using ORIANA Modern Appled Scence March, 29 Analyss of Malaysan Wnd Drecton Data Usng ORIANA St Fatmah Hassan (Correspondng author) Centre for Foundaton Studes n Scence Unversty of Malaya, 63 Kuala Lumpur, Malaysa

More information

Cell Count Method on a Network with SANET

Cell Count Method on a Network with SANET CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

A Clustering Algorithm for Chinese Adjectives and Nouns 1

A Clustering Algorithm for Chinese Adjectives and Nouns 1 Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,

More information

Cluster Analysis of Electrical Behavior

Cluster 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 information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

CE 221 Data Structures and Algorithms

CE 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 information

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany

More information

Module Management Tool in Software Development Organizations

Module 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 information

Machine Learning: Algorithms and Applications

Machine 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 information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On 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 information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

A Topology-aware Random Walk

A 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 information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

A Serial and Parallel Genetic Based Learning Algorithm for Bayesian Classifier to Predict Metabolic Syndrome

A Serial and Parallel Genetic Based Learning Algorithm for Bayesian Classifier to Predict Metabolic Syndrome A Seral and Parallel Genetc Based Learnng Algorthm for Bayesan Classfer to Predct Metabolc Syndrome S. Dehur Department of Informaton and Communcaton Technology Fakr Mohan Unversty, Vyasa Vhar Balasore-756019,

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,

More information

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law) Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member

More information

NGPM -- A NSGA-II Program in Matlab

NGPM -- 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 information

Private Information Retrieval (PIR)

Private 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 information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 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 information

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Complexity Analysis of Problem-Dimension Using PSO

Complexity Analysis of Problem-Dimension Using PSO Proceedngs of the 7th WSEAS Internatonal Conference on Evolutonary Computng, Cavtat, Croata, June -4, 6 (pp45-5) Complexty Analyss of Problem-Dmenson Usng PSO BUTHAINAH S. AL-KAZEMI AND SAMI J. HABIB,

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

GSLM Operations Research II Fall 13/14

GSLM 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 information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r

More information

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An 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 information

Learning Non-Linearly Separable Boolean Functions With Linear Threshold Unit Trees and Madaline-Style Networks

Learning Non-Linearly Separable Boolean Functions With Linear Threshold Unit Trees and Madaline-Style Networks In AAAI-93: Proceedngs of the 11th Natonal Conference on Artfcal Intellgence, 33-1. Menlo Park, CA: AAAI Press. Learnng Non-Lnearly Separable Boolean Functons Wth Lnear Threshold Unt Trees and Madalne-Style

More information

CHAPTER 4 OPTIMIZATION TECHNIQUES

CHAPTER 4 OPTIMIZATION TECHNIQUES 48 CHAPTER 4 OPTIMIZATION TECHNIQUES 4.1 INTRODUCTION Unfortunately no sngle optmzaton algorthm exsts that can be appled effcently to all types of problems. The method chosen for any partcular case wll

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON 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 information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

Modeling Pointing at Targets of Arbitrary Shapes

Modeling Pointing at Targets of Arbitrary Shapes Modelng Pontng at Targets of Arbtrary Shapes Tov Grossman, Ncholas Kong, Ravn Balakrshnan Department of Computer Scence Unversty of Toronto www.dgp.toronto.edu {tov, kongn, ravn}@dgp.toronto.edu ABSTRACT

More information

Hierarchical clustering for gene expression data analysis

Hierarchical 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 information