Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky

Size: px
Start display at page:

Download "Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky"

Transcription

1 Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc Fnal Project Sprng 2004 Page 1

2 Abstract Error correctng codes prevent loss of ntegrty n data transmsson. Low Densty Party Check codes are a famly of codes that are specfed by sparse matrces. Usng the Nelder-Mead Downhll Smplex Evoluton to desgn an rregular Low Densty Party Check code, we hope to mprove upon the accuracy of decodng. Introducton Loss of data ntegrty durng transmsson has always been a problem, snce there s no way of guaranteeng accuracy n the bts receved. Error correctng codes are a famly of methods that correct ths problem. In an error-correctng paradgm, extra bts are sent along wth the message. These extra bts are carefully calculated usng varous methods. On the recevng end of the transmsson, there must be a decodng algorthm to analyze all the bts that were receved and try to deduce the bts that were sent. In ths project, we wll look at a specfc type of code the Low Densty Party Check (LDPC) code. We wll try to use the Nelder-Mead optmzaton method to determne an optmal LDPC code, and thereby mprove upon the number of errors that can be corrected usng normal LDPC s. Channels Channels are a representaton of a path that bts (0 s and 1 s) can travel over. Bts wll usually travel n packets or codewords (messages that have been encoded by the encoder of an error correctng algorthm), denoted by the symbol C. Whle n the channel, there s a chance that the bt wll lose some or all of ts ntegrty. A major type of channel s the erasure channel, whch ths project wll deal wth. Ths channel wll be dscussed n the next secton. Page 2

3 The Erasure Channel The erasure channel wth erasure probablty p erases transmtted bts wth probablty p and accurately transmts bts wth probablty 1-p. The chart below detals ths process: Therefore, upon recevng a 0 or a 1 from the channel, there s a probablty of 1 that that s the bt that was sent. If a? s receved, there s a 0.5 probablty of a 1 havng been sent, and a 0.5 probablty of a 0 havng been sent. These propertes wll be mportant n the next secton. The followng chart explans ths: Bt Receved Bt Sent Probablty ? Page 3

4 Error Correctng Codes Error correctng codes provde a way of relably transmttng data over a channel. The general dea of an error correctng code s to add extra bts to the message (the encodng process), based on the message bts themselves, to create a codeword C. Once passed through a channel, a decodng algorthm can be appled to correct ncorrect bts n the receved message. We can defne the rate as the number of message bts per bt sent, so f there are twce as many bts sent as are n the message, the rate s ½. An example of an error correctng code s a Low Densty Party Check code. Regular Low Densty Party Check Codes (LDPC Codes) Regular Low Densty Party Check codes are capable of decodng receved messages wth a consderable number of erasures. In fact, a normal LDPC can decode a message properly even f about 42% of the bts are lost over an erasure channel. These codes are made from graphs of message and party nodes. The message nodes contan the bts of the message from the channel; whle the party nodes ensure that the party of all the message nodes connected to t by the graph are 0. The procedure for ths type of code can be broken down nto three separate stages: generatng a matrx and dual, encodng codewords, and decodng. Generatng a matrx and dual: the matrx tself wll represent a bpartte graph of decodng nodes both party check and message (also known as equalty nodes) that the decodng algorthm wll use. All of the 1 s n the matrx wll represent a mappng from an equalty node (the columns) to a party check node (the rows). Frst, we need to decde on what qualfes a code as normal, and for the purposes of ths paper, a 3-6 graph wll be normal. Ths means that there are 3 edges out of each message node and 6 edges out of each party check node. Gven that each node must connect to only one other node, there must be twce as many message Page 4

5 nodes as party check nodes. Ths can be represented n a sparse matrx. A sparse matrx s a matrx wth few 1 s; ths allows a computer to only store the poston of the 1 s. In a 5000x10000 matrx, ths can save a great deal of memory. To generate a 3-6 sparse matrx, there must be three 1 s per column and sx 1 s per row. These should be placed as randomly as possble. An example of ths s (where every poston represented by the dots would be a zero): M L L L L M M M M M O M M M L The next step s to generate the dual of ths matrx. Ths can be accomplshed wth a C routne that we were provded wth. The dual s what wll be used to encode. Encodng: usng the dual. To encode a 5000-bt message wth a 5000x10000 dual matrx, use multplcaton and multply the message as a vector by the dual matrx. The resultant wll be a bt long codeword vector. Decodng: usng the bpartte node graph. Each message node s connected to three unque party check nodes, whle each party check node s connected to sx unque message nodes. Ths s shown n the followng dagram (though there are only 8 message nodes): M 1 The decodng process over the erasure channel s smplfed, as opposed to over any other channel, because f a bt s receved, t s guaranteed that that bt was sent. To begn decodng, the message from the channel s placed n the equalty nodes: Page 5

6 These nodes then transmt ther messages through all of ther outgong edges: Next, the party check nodes try to determne the value of any? messages n the followng way: If, at a party check node, there s one queston mark and all other bts are known, then the? bt s equal to the sum (mod 2) of all the other bts. If there s more than one?, then nothng can be determned. Followng ths stage, the newly known bts are sent back to the equalty nodes: Ths process then repeats untl all bts are known, or no new bts are learned on any gven teraton (and therefore errors cannot be corrected): Page 6

7 At termnaton, the corrected message wll appear n the equalty nodes. Ths entre process can be represented n the followng way: Irregular LDPC s (and ther specfcaton) In general, LDPC s can be mproved by changng the arrangement of the edges between the equalty nodes and the party check nodes. Ths mprovement can allow upwards of 49% of the bts to get erased by the channel, yet decodng wll stll be feasble. To begn thnkng about changng the number of edges from each node, some notaton must be ntroduced. We can defne λ to be the fracton of edges that are connected to equalty nodes wth degree. We wll also defne ρ to be the fracton of Page 7

8 edges that are connected to party check nodes wth degree. The followng dagram shows an example of an rregular LDPC graph: In ths graph, λ 1 s equal to 3/5 because 3 out of the 5 edges are extng equalty nodes wth degree one; λ 2 s equal to 2/5. All other λ s are equal to 0 because there are no equalty nodes of degree hgher than 2. Smlarly, ρ 2 s equal to 2/5 and ρ 3 s 3/5, whle all the other ρ 2 s are 0. Ths also mples that for a typcal 3-6 LDPC, the followng condtons hold: λ =0 for 3, λ 3 =1, ρ =0 for 6, and ρ 6 =1. It s mportant to determne how many of the lambda s and rho s are free to change. We must ntroduce some constrants for two reasons. Frstly, they ensure that the lambda s and rho s wll generate feasble graphs capable of decodng. Secondly, they wll lower the number of free varables, makng optmzaton easer. We wll start off wth L + R free varables, where L s the hghest degree of the lambda s and R s the hghest degree of the rho s. The frst two smple constrants are: λ = 1 and = 1, where n s an arbtrarly chosen number representng the hghest allowed node degree. These ensure that the probabltes add to 1. In addton, n = 0 n ρ = 0, λ, ρ 0. Ths must be true so that there are no negatve values of the lambda s or rho s; f there were, you could not construct a graph from them. Obvously, the number of edges out of the equalty nodes must equal the number of edges nto the party check nodes, whch s gven by ρ = β λ, where β s equal to 1 mnus the rate of the code. We also must assure that λ 1 =0 and ρ 1 =0, because f ths s not true, then the code may not work properly, or at all. Ths lowers the number of free varables to L + R 2. We can remove two more free Page 8

9 varables by defnng one of the lambda s and one of the rho s n terms of all the other ones, snce ther sums must be one: λ = 1 λ, ρ = ρ ; ths lowers the free varables to L + R 4. To lower the number of free varables to L + R 5, you can combne these prevous relatons wth R L = 3 ρ = β R = 3 λ to determne that. 5 + ρ L 1 = 3.5 λ β = 3 λ L =. For smplcty, we can set L = R and determne that n 1.5 L terms of D, the total number of dmensons or free varables n the problem, L and R are equal to (D + 5)/2. A fnal constrant that must be satsfed s the followng nequalty 1 δj : f ( λ, ρ k, δ ; x j ) :: = δλ(1 ρ(1 x j )) < x j, x j =, j = 1,..., N, where N s the N number of equdstant, dscrete ponts on the nterval (0,δ]. Accordng to the Effcent Erasure Correctng Codes paper, f at most a δ-fracton of the codeword C s erased, ndependently and at random, there s a hgh probablty that the decodng algorthm wll termnate successfully. Usng varous methods, radcally dfferent λ s and ρ s can be arrved at. Methods suggested by prevously wrtten papers nclude dfferental evoluton, an algorthm that produces very good results. It has been suggested that the Nelder-Mead method mght produce reasonable results, so ths s the method that we are usng. 1 Desgn of Effcent Erasure Codes, equaton 5 Page 9

10 The Nelder-Mead Method 2 The Nelder-Mead method wll allow us to try to fnd an deal λ and ρ to decode and fx as many errors as possble. The Nelder-Mead method s typcally appled to problems that are unconstraned, but n ths case, there are all the constrants that were dscussed n the prevous secton. To use Nelder-Mead, we wll try to maxmze the value of δ (or, snce Nelder- Mead s a mnmzer, we wll mnmze the value of -δ) n f ( λ, ρ, δ ; x ) < 0 whle tryng to avod volatng any of the constrants. To deal wth the constrants, we are gong to use a penalty functon for all solutons that are n volaton of the constrants. Ths was a constant on the order of a bllon, thereby almost never allowng nfeasble ponts. Another consderaton s the startng values, because for Nelder-Mead to operate, there must be N+1 startng ponts where N s the number of dmensons. In our case, ths wll be the value of L + R 5. The ponts create a smplex (an n dmensonal object wth segments connectng all ponts and faces between all segments). The 2-dmensonal smplex s a trangle; the 3-dmensonal one s a tetrahedron. The way that we created our startng smplex s as follows Create an ntal feasble (vald) pont usng the followng procedure 3 : o Set λ 3 through λ L-1 equal to o Set sl equal to.5 1 L L = L 1 k j o Set sr equal to o Defne ρ R to be R 1 1 R 2 = 2 sl sr. 1 sr R 1. 2 C code for ths method, and a descrpton were suppled n Numercal Recpes n C 3 Suggested by Prof. Dan Spelman Page 10

11 1 ρ R o Set ρ 3 through ρ L-1 equal to. R 2 o Compute λ 2, λ L, and ρ 2 usng the constrants. o Ths pont corrects about a 30-35% bt erasure rate. Pck a random drecton n the space, and travel from the ntal feasble pont n that drecton untl an nfeasble pont s reached. Add the last feasble pont that was transversed to the smplex. Repeat the prevous step untl the smplex s completed (there are N+1 ponts n t). At each teraton, one of the followng four thngs happens (generalzed to 3 dmensons so t can be vsualzed). The startng stage mght look lke ths: In ths case, hgh represents the worst pont, based on the mnmzaton, and low s the best. The frst possblty s that the hgh pont s reflected through all the other ponts n the smplex resultng n: A second alternatve s for the hgh pont to be reflected and expanded through the smplex: The thrd opton s a contracton away from the hgh pont: Page 11

12 The fnal choce s a contracton around the lowest pont by all other ponts: The opton that s chosen s whchever gves the lowest value of the functon that s tryng to be mnmzed. The method termnates when none of the choces mprove the value of the functon by more than a tolerance value that we set. At the end of an ndvdual Nelder-Mead run, the results that are produced are not very good. A reason for ths could be that the method tself took an anomalous step at some pont n the run. Our way of solvng ths was as follows: Upon completon of a Nelder-Mead run, we took the best pont n the smplex to be our new startng pont. We then perturbed ths pont nto a new startng smplex, and ran the Nelder-Mead method agan. Ths process was repeated untl the optmzaton mproved the functon by less than a second tolerance value. To contnue to mprove the percentage of erasures that our code could cope wth, we repeated ths entre process for as long as we had tme. Our program dsplays (va a System.out) the current value of delta, whch represents the percentage of erasures that can be corrected wth the current polynomals. Page 12

13 Results and Data To standardze our results wth the lterature, our lambda and rho values wll be shown as polynomals gven by the generatng functons: L λ ( x ) = λ x = 2 1 and R ρ( x) = ρ x = 2 1. The frst stage n producng hgh δ values was an overnght run. Durng ths run, the dmensons of the smplexes were randomly chosen from the odd ntegers between 33 and 55. (They were chosen to be odd so that the formula L = R = (D + 5)/2 held wth nteger values of L and R.) Results of ths frst stage ranged from δ = to δ = The hghest value of delta was for a 49-dmesonal run. Ths frst stage allowed weak codes to be weeded out manually. The second stage of my procedure was takng the polynomal for the best δ value and usng t as a new startng pont. I elmnated all the other polynomals that I had generated. After each run of the Nelder-Mead algorthm, the new best δ valued polynomal was taken to restart the method. In ths way, the algorthm can be run ndefntely, begnnng wth an excellent polynomal, though wth the mprovement decayng somewhat per run. The followng s the best polynomal that we generated after stage two t s n 49 dmensons, therefore, L = R = 27. Ths means that our code would correct errors on a message where over 49.12% of the bts were erased: Polynomal coeffcents λ(x) = x x x x x x x x x x x x x x x x x E-6x x E-6x E-5x E-4x 22 + δ-value Page 13

14 E-6x E-8x E-5x x 26 ρ(x) = E-9x E-9x E-7x x x x x x x E-4x E-4x E-4x E-4x E-4x x x E-4x x E-4x x E-4x x x E-4x x x 26 The next secton wll be devoted to the analyss of ths above polynomal. After the frst stage, the above polynomals had the followng values: Polynomal coeffcents λ(x) = x x x x x x x x x x x x x x x x x x x x x x x x x x 26 δ-value ρ(x) = E-9x E-7x x x x x x x x E-6x x x E-5x E-7x E-4x x E-4x E-4x x x x x x E-4x x x 26 For comparson, the followng are the polynomals for the second best delta value before the weedng process (ths s n 43 dmensons): Page 14

15 Polynomal coeffcents λ(x) = x x x x x x x x x x x x x E-6x E-5x E-4x x x x x x x x 23 δ-value ρ(x) = E-7x E-8x E-4x x x x x x x x x x x E-4x x E-4x E-6x x x x E-4x E-4x x 23 Gven tme, ths polynomal could have had stage two appled to t; n whch case, the delta value could have been consderably hgher. Analyss There are two man ways for us to analyze our λ s and ρ s. 1. Theoretcally a. To determne whether a codeword s capable of beng decoded after havng passed through the erasure channel wth probablty of erasure p 0, 1 we need to make sure that the plot of ρ ( x) = ρ (1 (1 x) ) les Page 15

16 1 above the plot of λ ( y) = p λ at all ponts 4. These two formulas 0 have been derved for us n Lecture Notes for lecture 17. Ths s an extremely accurate way of determnng whether all the errors can be corrected. 2. Expermentally a. Ths can be done smply, by usng our λ s and ρ s to create a random encodng matrx. Usng ths matrx, we can encode some codewords to send over the erasure channel wth varous probabltes of erasure. Upon runnng the decodng algorthm, t would not be hard to tell f the decoder was capable of decodng at a gven probablty of erasure. For the sake of ths paper, I shall test the polynomals usng the frst method. In addton, I wll make use of the program s outputted value of delta. Ths should be the frst probablty where the lnes cross. The polynomal that we generated can correct messages wth up to a 49.12% erasure rate, as outputted by the program. Here s the graph of λ(x) and ρ(x) at p =.42, the value where a normal LDPC begns to fal: y 4 Lecture Notes: Lecture #17 Page 16

17 Here s the graph at p =.48 (zoomed n on the closest pont): Page 17

18 Here s the graph at p =.49 (agan zoomed n, ths tme even further), a successful value, yet somewhat close to the falure pont: Fnally, here s the graph at p =.495, a value at whch correcton wll fal; the lnes cross: Page 18

19 Concluson Gven an ample amount of tme to run the algorthm, I beleve that the Nelder- Mead method wll produce extremely good polynomals for Low Densty Party Check codng. At the tme that I had to stop the algorthm to comple the results, delta was stll ncreasng by a few thousandths of a percent per teraton. The polynomals that our program dd generate are capable of correctng more than a 49.12% bt erasure rate. Ths value s better than the lnear programmng approach that was used n the Desgn of Effcent Erasure Codes wth Dfferental Evoluton paper; none of these codes had a delta greater than 48.86%. Our codes do not appear to be as good as those that used dfferental evoluton. Ths may not be the case, as the dfferental evoluton codes were run on the order of 2,000,000 teratons, whle ours only ran a few hundred thousand teratons. Ths s especally true because the Nelder-Mead Page 19

20 method s known to be one of the slowest optmzaton methods 5. Another way for us to mprove our codes would be allowng nfeasble ponts durng the teratons, and then flterng them out before outputtng the polynomals. Fnally, a dfferent algorthm for determnng the startng smplex could gve drastcally dfferent results. Our startng smplex, though n the mddle of the dmensonal space, could only correct n the md 30% s erasure rate. References Luby, Mtzenmacher, Shokrollah, Spelman. Effcent Erasure Correctng Codes. IEEE Transactons on Informaton Theory, Vol 47, No 2. February Press, et al. Numercal Recpes n C. Cambrdge Press Shokrollah, Storn. Desgn of Effcent Erasure Codes wth Dfferental Evoluton. Spelman Error Correctng Codes Lecture Notes. Appendx: Java Code Our Java program s source code s attached. 5 Numercal Recpes n C Page 20

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

NOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING

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

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

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

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

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

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

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

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 information

5 The Primal-Dual Method

5 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 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

Solving two-person zero-sum game by Matlab

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

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

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

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

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

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

Biostatistics 615/815

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

K-means and Hierarchical Clustering

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

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting 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 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

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course 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 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

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

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

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

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

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

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

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2 Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal

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

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

Programming in Fortran 90 : 2017/2018

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

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)

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

Multiple optimum values

Multiple optimum values 1.204 Lecture 22 Unconstraned nonlnear optmzaton: Amoeba BFGS Lnear programmng: Glpk Multple optmum values A B C G E Z X F Y D X 1 X 2 Fgure by MIT OpenCourseWare. Heurstcs to deal wth multple optma: Start

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 5 Luca Trevisan September 7, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 5 Luca Trevisan September 7, 2017 U.C. Bereley CS294: Beyond Worst-Case Analyss Handout 5 Luca Trevsan September 7, 207 Scrbed by Haars Khan Last modfed 0/3/207 Lecture 5 In whch we study the SDP relaxaton of Max Cut n random graphs. Quc

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

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

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

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

Smoothing Spline ANOVA for variable screening

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

A New Approach For the Ranking of Fuzzy Sets With Different Heights

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

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

LP Decoding. Martin J. Wainwright. Electrical Engineering and Computer Science UC Berkeley, CA,

LP Decoding. Martin J. Wainwright. Electrical Engineering and Computer Science UC Berkeley, CA, Jon Feldman LP Decodng Industral Engneerng and Operatons Research Columba Unversty, New York, NY, 10027 jonfeld@eor.columba.edu Martn J. Wanwrght Electrcal Engneerng and Computer Scence UC Berkeley, CA,

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

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

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

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

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

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Outline. Midterm Review. Declaring Variables. Main Variable Data Types. Symbolic Constants. Arithmetic Operators. Midterm Review March 24, 2014

Outline. Midterm Review. Declaring Variables. Main Variable Data Types. Symbolic Constants. Arithmetic Operators. Midterm Review March 24, 2014 Mdterm Revew March 4, 4 Mdterm Revew Larry Caretto Mechancal Engneerng 9 Numercal Analyss of Engneerng Systems March 4, 4 Outlne VBA and MATLAB codng Varable types Control structures (Loopng and Choce)

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

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

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Greedy Technique - Definition

Greedy 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 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

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

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

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

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

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

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

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

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

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

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

Spatially Coupled Repeat-Accumulate Coded Cooperation

Spatially Coupled Repeat-Accumulate Coded Cooperation Spatally Coupled Repeat-Accumulate Coded Cooperaton Naok Takesh and Ko Ishbash Advanced Wreless Communcaton Research Center (AWCC) The Unversty of Electro-Communcatons, 1-5-1 Chofugaoka, Chofu-sh, Tokyo

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

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

Loop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation

Loop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation Loop Transformatons for Parallelsm & Localty Last week Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Scalar expanson for removng false dependences Loop nterchange Loop

More information

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont) Loop Transformatons for Parallelsm & Localty Prevously Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Loop nterchange Loop transformatons and transformaton frameworks

More information

Notes on Organizing Java Code: Packages, Visibility, and Scope

Notes on Organizing Java Code: Packages, Visibility, and Scope Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

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

Today Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints

Today Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints Fourer Motzkn Elmnaton Logstcs HW10 due Frday Aprl 27 th Today Usng Fourer-Motzkn elmnaton for code generaton Usng Fourer-Motzkn elmnaton for determnng schedule constrants Unversty Fourer-Motzkn Elmnaton

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016 Inverse Knematcs (part 2) CSE169: Computer Anmaton Instructor: Steve Rotenberg UCSD, Sprng 2016 Forward Knematcs We wll use the vector: Φ... 1 2 M to represent the array of M jont DOF values We wll also

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

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

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design for Reliability: Case Studies in Manufacturing Process Synthesis Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng

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

Algorithm To Convert A Decimal To A Fraction

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

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

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

Conditional Speculative Decimal Addition*

Conditional Speculative Decimal Addition* Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant

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

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

Dynamic Programming. Example - multi-stage graph. sink. source. Data Structures &Algorithms II

Dynamic Programming. Example - multi-stage graph. sink. source. Data Structures &Algorithms II Dynamc Programmng Example - mult-stage graph 1 source 9 7 3 2 2 3 4 5 7 11 4 11 8 2 2 1 6 7 8 4 6 3 5 6 5 9 10 11 2 4 5 12 snk Data Structures &Algorthms II A labeled, drected graph Vertces can be parttoned

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

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

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

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

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

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

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