Matrix-Matrix Multiplication Using Systolic Array Architecture in Bluespec

Size: px
Start display at page:

Download "Matrix-Matrix Multiplication Using Systolic Array Architecture in Bluespec"

Transcription

1 Matrx-Matrx Multplaton Usng Systol Array Arhteture n Bluespe Team SegFault Chatanya Peddawad (EEB096), Aman Goel (EEB087), heera B (EEB090) Ot. 25, 205 Theoretal Bakground. Matrx-Matrx Multplaton on Hardware Computng matrx produts s oth a entral operaton n many numeral algorthms and potentally tme onsumng, makng t one of the most well-studed prolems n numeral omputng. Varous algorthms have een devsed for omputng C = AB, espeally for large matres. Mappng suh algorthms to ustom or general purpose hardware arhteture s always a hallengng task. By havng a ustom or ASIC hardware, the matrx-matrx multplaton an e mplemented usng least resoures and an e aelerated to a large extent. Mappng the same algorthms on general purpose hardware, for example, mplementng on general purpose Xlnx FPGA oard always has nherent trade-offs suh as area (power), tme (maxmum operatng lok frequeny), lateny, hardware utlzaton effeny and so on. The realst way to ompare two solutons would e to assgn weghts to eah of these fators and hoose a soluton among multple possle pareto optmal solutons..2 Systol Array Arhteture Systol arhtetures (also referred to as systol arrays) represent a network of proessng elements (s) that rhythmally ompute and pass data through the system. These s regularly pump data n and out suh that a regular flow of data s mantaned [], [2]. As a result, systol systems feature two mportant propertes for VLSI desgn: Modularty: Varous funtonal loks whh make up the larger system have well-defned funtons and nterfaes. Hene, the onept of modularty enales the parallelsaton of the desgn proess. Regularty: Herarhal deomposton of a large system results n not only smple, ut also smlar loks, as muh as possle. The systol array may e used as a oproessor n omnaton wth a host omputer where the data samples reeved from the host omputer pass through the s and the fnal result s returned to the host omputer (see Fg. ). Ths operaton s analogous to the flow of lood through the heart, thus the name systol. Typally, all the s n a systol array are unform and fully ppelned,.e., all ommunatng edges among the s ontan delay elements, and the whole system usually ontans only loal nteronnetons [3]. However, some relaxatons have een ntrodued to nrease the utlty of systol arrays. These relaxatons nlude use of not only loal ut also neghor (near, ut not nearest) nteronnetons, use of data roadast operatons, and use of dfferent s n the system, espeally at the oundares. Wth these relaxatons, a famly of modular, regular, and effent data-drven array arhtetures an e desgned for SP applatons, one of whh s matrx-matrx multplaton.

2 CS6230: CA for VLSI Systol Array & Bluespe Host Proessor The Systol Array Fgure : Bas prnple of a systol system.3 Systol Array esgn Methodology We use the systol arhteture desgn methodology where many systol arhtetures an e desgned for any gven regular teratve algorthm usng lnear mappng or proeton tehnques. The dependeny graph (G) orresponds to a spae representaton where no tme nstane s assgned to any omputaton. Typally ths orresponds to a t = 0 plane. The mappng tehnque transforms a spae representaton to a spae-tme representaton where eah node s mapped to a ertan proessng element and s sheduled to a ertan tme nstane. The systol desgn methodology that we are adoptng here maps a 3-dmensonal G to a or 2 systol arhteture. Now we defne the as vetors nvolved n the systol array desgn: [ ] d Proeton vetor (also alled teraton vetor), d = : Two nodes that are dsplaed y d or d 2 multples of d are exeuted y the same proessor ] Proessor spae vetor, p T = [p p 2 : Any node wth the ndex I T = ] [ y proessor p T I = p Shedulng vetor, s T = p 2 ] [ [ ] would e exeuted [s s 2 ] : Any node wth ndex I would e exeuted at tme s T I. Hardware Utlzaton Effeny, HU E = / s T d : Ths s eause two tasks exeuted y the same proessor are spaed s T d tme unts apart. These aforementoned vetors must satsfy the feaslty onstrants stated elow: Proessor spae vetor and the proeton vetor must e orthogonal to eah other. If ponts A and B dffer y the proeton vetor,.e., I A I B s same as d, then they must e exeuted y the same proessor. In other words, p T I A = p T I B. Ths leads to p T (I A I B ) = 0 = p T d = 0. If A and B are mapped to the same proessor, then they annot e exeuted at the same tme,.e., s T I A s T I B,.e., s T d 0. Edge mappng: If an edge e exsts n the spae representaton or G, then an edge p T e s ntrodued n the systol array wth s T e delays. Gven 2 matres A and B, we an denote ther produt as C = AB, where A, B and C are n n matres. For n = 2, we have [ ] [ ] [ ] 2 a = a a 2 a

3 CS6230: CA for VLSI Systol Array & Bluespe = a + a = a 2 + a = a 2 + a = a a These equatons an e represented n a spae representaton as shown n Fg a 2 a 22 2 k a 0 a 2 Fgure 2: Systol array arhteture of the matrx produt omputaton From the spae dagram, we an wrte the teraton n standard output regular teratve algorthm (RIA) form as follows: a(,, k) = a(,, k) (,, k) = (,, k) (,, k) = (,, k ) + a(,, k)(,, k) Wth lnear mappng, ths 3 spae representaton s mapped onto 2 spae to desgn 2 systol arrays for matrx-matrx multplaton. Wth dfferent hoe of proessor vetor (d), proeton vetor (p T ) and shedulng vetor (s T ) that satsfy the shedulng onstrants, we get dfferent edge mappng hene dfferent systol array arhteture. Some of dfferent possle solutons are derved n Ta.. Systol array arhteture, Arh and Arh 2 usng general proessor elements are drawn n Fg. 3. Tale : fferent solutons to systol array arhteture Vetor Arh Arh 2 Arh 3 Arh 4 ] [ ] [ ] [ ] s [ T [ ] [ ] [ ] [ ] p T [ ] T [ ] T [ ] T [ ] T d e p T e s T e p T e s T e p T e s T e p T e s T e a(0,, 0) (0 ) (0 ) (0 ) (0 ) (, 0, 0) ( 0) ( 0) ( 0) ( 0) (0, 0, ) (0 0) ( ) ( 0) ( ) 3

4 CS6230: CA for VLSI Systol Array & Bluespe a a a a a a (a) Arh () Arh 2 Fgure 3: Two-dmensonal systol array for matrx-matrx multplaton 2 Our Implementaton: esgn & Evaluaton of fferent Arhtetures We mplemented 4 dfferent solutons for matrx-matrx multplaton, rght from mplementng on one proessor element to mplementng on 2 array of proessor elements. The desgn supports mulple matrx-matrx multplatons n a sngle streth n ontnuous fashon. We oded and smulated all four solutons n Bluespe to verfy the auray of eah of the solutons. We further syntheszed the solutons to ompare dfferent trade-offs on hardware mplementaton eah of them faed n terms of maxmum operatng lok frequeny (hange of rtal path), area (hardware utlzaton) and theoretal throughput. The solutons are stated elow: Soluton : Perform matrx-matrx multplaton usng 2 systol array of proessor elements. Soluton 2: Perform matrx-matrx multplaton usng lnear array of proessor elements. Soluton 3: Perform matrx-matrx multplaton usng sngle proessor element. Soluton 4: Perform matrx-matrx multplaton usng lnear dretonal 2 systol array of proessor elements. Note that the matrx-matrx multplaton synthess results were otaned for the 5 5 matres wth performng 4 suh multplatons one after other n a sngle run. 2. Soluton Ths soluton s mplemented usng 2 systol array of proessor elements, whh s nothng ut systol array of sequental multply and aumulate (MAC) unts. In one step, K 2 MAC unts performs K 2 multplatons of two numers a k and k and aumulaton f applale. But, sne the outputs propagate form one to another, for multplaton of two K K matres to omplete, the numer of steps requred s 3K 2. The arhteture s shown n Fg. 4. Synthess Results Sle log utlzaton: Numer of sle regsters: 508/26800 = 4% Numer of sle LUTs: 5632/63400 = 8% Numer used as log: 5632/26800 = 8% Mnmum perod : ns ( Maxmum frequeny: MHz). 4

5 CS6230: CA for VLSI Systol Array & Bluespe Crtal path: From matnum 6 (FF) to out 66 (FF) elay = ns Levels of log = 23 a a a MAC unt a n- n MAC unt: n = n- + a () Operaton of MAC unt (a) Soluton Fgure 4: Arhteture for soluton : K = Soluton 2 Ths soluton s mplemented usng lnear array of K proessor elements, whh s nothng ut array of sequental multply and aumulate (MAC) unts. In one step, K MAC unts performs K multplatons of two numers a k and k and aumulaton f applale. Hene, for multplaton of two K K matres, the numer of steps requred s K 2. The arhteture s shown n Fg. 5. MAC unt a Fgure 5: Arhteture for soluton 2: K = 3 Synthess Results Sle log utlzaton: Numer of sle regsters: 3689/26800 = 2% Numer of sle LUTs: 6986/63400 = 26% Numer used as log: 6986/26800 = 26% Mnmum perod : ns ( Maxmum frequeny: MHz). Crtal path: From matnum 6 (FF) to out 0 (FF) elay = ns Levels of log = 5

6 CS6230: CA for VLSI Systol Array & Bluespe 2.3 Soluton 3 Ths soluton s mplemented usng only one proessor element, whh s nothng ut sequental multply and aumulate (MAC) unt. In one step, the MAC unt performs sngle multplaton of two numers a k and k and aumulaton f applale. Hene, for multplaton of two K K matres, the numer of steps requred s K 3. The arhteture s shown n Fg. 6. a MAC Fgure 6: Arhteture for soluton 3 Synthess Results Sle log utlzaton: Numer of sle regsters: 3333/26800 = 2% Numer of sle LUTs: 4798/63400 = 7% Numer used as log: 4798/26800 = 7% Mnmum perod : ns ( Maxmum frequeny: MHz). Crtal path: From matnum 6 (FF) to out 0 (FF) elay = ns Levels of log = Soluton 4 Ths soluton s mplemented usng K Bdretonal Lnear Systol Arrays (BLSA) of omnatonal s that takes 3 nput a, and and produes output + a, desred n [4]. Note that omnatonal s are used for the mplementaton and performane omparson aganst the sequental ounterpart that has een mplemented and used n frst 3 solutons. It an e shown that for multplaton of two K K matres to omplete, the numer of steps requred s 3K 2. Note that K olumns of the output matrx are omputed smultaneously, where one lnear array omputes one olumn eah. Hene K BLSA strutures are repeated regularly and work ndependent of eah other. The arhteture s shown n Fg. 7. a 23 a 22 a 3 a 33 a 2 a 0 0 a 2 a 32 a n Fgure 7: Arhteture for soluton 4: K = 3 a out = n + a out 6

7 CS6230: CA for VLSI Systol Array & Bluespe Synthess Results Sle log utlzaton: Numer of sle regsters: 207/26800 = 0.95% Numer of sle LUTs: 647/63400 = % Numer used as log: 647/26800 = % Mnmum perod : ns ( Maxmum frequeny: MHz). Crtal path: From mas 0 /Mmult ans a MUL ans elay = ns Levels of log = 8 d (SP) to reg 0 3 (FF) 2.5 Pareto Curve: Fae-off Between Solutons Arhteture Sle Reg. Utlzaton Log LUTs Utlzaton Clok Frequeny Throughput Soluton 4% 8% MHz 3K 2 Soluton 2 2% 26% MHz K 2 Soluton 3 2% 7% 9.42 MHz K 3 Soluton % % MHz 3K 2 Tale 2: Trade-offs n dfferent solutons (K = 5) The trade-offs are lear from the Ta. 2. Note that soluton uses ustom sequental MAC unts whle soluton 4 uses default omnatonal proessor elements, hene sgnfant dfferene n hardware utlzaton and the lok perod. Solutons -3 use sequental s hene are nluded n pareto urve where we evaluate the solutons ased on trade-off etween hardware utlzaton and throughput, or etween lok freqeuny and throughput. Ether way, all three are pareto optmal. The pareto urve s drawn n Fg. 8. Clok Frequeny (MHz) sol n :3 sol n :2 sol n : Throughput ( no. of steps ) for K = 5 Fgure 8: Pareto Curve (not to sale) 3 Conluson We have explored four dfferent solutons to mplement matrx-matrx multplaton. Seleton of a soluton to one partular applaton depends on several fators suh as dmensons of matrx, onstrants on throughput, resoure utlzaton and makespan as demanded y the applaton. On a general perepton we an say that for smaller matres wth strngent hardware utlzaton onstrant, soluton 3 performs 7

8 CS6230: CA for VLSI Systol Array & Bluespe good. On the other hand to get etter throughput at the ost of extra hardware, soluton wll e more optmal ompared to soluton 3. Soluton 2 assumes a mddle ground etween soluton and soluton 3. However we an see that the est results are otaned when the proessng element s mplemented usng omnatonal log as n soluton 4. Smlar results an also e otaned from soluton f the as s omnatonal. Whle soluton 4 demands more omplated shedulng of the nputs, soluton requres a smple sequenng of nputs and an thus lead to nterestng results f the as of soluton s mplemented usng omnatonal log. Referenes [] H. T. Kung and C. E. Leserson, Systol arrays (for VLSI), Sparse Matrx Symposum, SIAM, pp , 978. [2] H. T. Kung, Why systol arhtetures? IEEE Computers Magazne, vol. 5, pp , Jan [3] S. Y. Kung, VLSI Array Proessors, Prente Hall, 988. [4] E. I. Mlovanov et. al, Matrx Multplaton on Lnear Bdretonal Systol Arrays, Ser. A: Appl. Math. Inform. and Meh, vol. 2, no., pp. 20,

Microprocessors and Microsystems

Microprocessors and Microsystems Mroproessors and Mrosystems 36 (2012) 96 109 Contents lsts avalable at SeneDret Mroproessors and Mrosystems journal homepage: www.elsever.om/loate/mpro Hardware aelerator arhteture for smultaneous short-read

More information

Bit-level Arithmetic Optimization for Carry-Save Additions

Bit-level Arithmetic Optimization for Carry-Save Additions Bt-leel Arthmet Optmzaton for Carry-Sae s Ke-Yong Khoo, Zhan Yu and Alan N. Wllson, Jr. Integrated Cruts and Systems Laboratory Unersty of Calforna, Los Angeles, CA 995 khoo, zhanyu, wllson @sl.ula.edu

More information

Connectivity in Fuzzy Soft graph and its Complement

Connectivity in Fuzzy Soft graph and its Complement IOSR Journal of Mathemats (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1 Issue 5 Ver. IV (Sep. - Ot.2016), PP 95-99 www.osrjournals.org Connetvty n Fuzzy Soft graph and ts Complement Shashkala

More information

Session 4.2. Switching planning. Switching/Routing planning

Session 4.2. Switching planning. Switching/Routing planning ITU Semnar Warsaw Poland 6-0 Otober 2003 Sesson 4.2 Swthng/Routng plannng Network Plannng Strategy for evolvng Network Arhtetures Sesson 4.2- Swthng plannng Loaton problem : Optmal plaement of exhanges

More information

Cluster ( Vehicle Example. Cluster analysis ( Terminology. Vehicle Clusters. Why cluster?

Cluster (  Vehicle Example. Cluster analysis (  Terminology. Vehicle Clusters. Why cluster? Why luster? referene funton R R Although R and R both somewhat orrelated wth the referene funton, they are unorrelated wth eah other Cluster (www.m-w.om) A number of smlar ndvduals that our together as

More information

Interval uncertain optimization of structures using Chebyshev meta-models

Interval uncertain optimization of structures using Chebyshev meta-models 0 th World Congress on Strutural and Multdsplnary Optmzaton May 9-24, 203, Orlando, Florda, USA Interval unertan optmzaton of strutures usng Chebyshev meta-models Jngla Wu, Zhen Luo, Nong Zhang (Tmes New

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

Implementing Lattice Boltzmann Computation on Graphics Hardware

Implementing Lattice Boltzmann Computation on Graphics Hardware To appear n The Vsual omputer Implementng Latte oltzmann omputaton on Graphs Hardware We L, Xaomng We, and re Kaufman enter for Vsual omputng (V) and epartment of omputer Sene State Unversty of New York

More information

Semi-analytic Evaluation of Quality of Service Parameters in Multihop Networks

Semi-analytic Evaluation of Quality of Service Parameters in Multihop Networks U J.T. (4): -4 (pr. 8) Sem-analyt Evaluaton of Qualty of Serve arameters n Multhop etworks Dobr tanassov Batovsk Faulty of Sene and Tehnology, ssumpton Unversty, Bangkok, Thaland bstrat

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

Measurement and Calibration of High Accuracy Spherical Joints

Measurement and Calibration of High Accuracy Spherical Joints 1. Introduton easurement and Calbraton of Hgh Auray Spheral Jonts Ale Robertson, Adam Rzepnewsk, Alexander Sloum assahusetts Insttute of Tehnolog Cambrdge, A Hgh auray robot manpulators are requred for

More information

A Fast Way to Produce Optimal Fixed-Depth Decision Trees

A Fast Way to Produce Optimal Fixed-Depth Decision Trees A Fast Way to Produe Optmal Fxed-Depth Deson Trees Alreza Farhangfar, Russell Grener and Martn Znkevh Dept of Computng Sene Unversty of Alberta Edmonton, Alberta T6G 2E8 Canada {farhang, grener, maz}@s.ualberta.a

More information

Bilateral Mesh Denoising

Bilateral Mesh Denoising Outlne Blateral Meh Denong S. Flehman, I. Dror,, D. Cohen-Or Tel Avv Unverty Preented by Derek Bradley Motvaton Prevou ork Blateral Meh Denong Image Proeng Bakground Blateral Image Flterng Tranformng from

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

Design Level Performance Modeling of Component-based Applications. Yan Liu, Alan Fekete School of Information Technologies University of Sydney

Design Level Performance Modeling of Component-based Applications. Yan Liu, Alan Fekete School of Information Technologies University of Sydney Desgn Level Performane Modelng of Component-based Applatons Tehnal Report umber 543 ovember, 003 Yan Lu, Alan Fekete Shool of Informaton Tehnologes Unversty of Sydney Ian Gorton Paf orthwest atonal Laboratory

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

Optimal shape and location of piezoelectric materials for topology optimization of flextensional actuators

Optimal shape and location of piezoelectric materials for topology optimization of flextensional actuators Optmal shape and loaton of pezoeletr materals for topology optmzaton of flextensonal atuators ng L 1 Xueme Xn 2 Noboru Kkuh 1 Kazuhro Satou 1 1 Department of Mehanal Engneerng, Unversty of Mhgan, Ann Arbor,

More information

Boosting Weighted Linear Discriminant Analysis

Boosting Weighted Linear Discriminant Analysis . Okada et al. / Internatonal Journal of Advaned Statsts and I&C for Eonoms and Lfe Senes Boostng Weghted Lnear Dsrmnant Analyss azunor Okada, Arturo Flores 2, Marus George Lnguraru 3 Computer Sene Department,

More information

Performance Evaluation of TreeQ and LVQ Classifiers for Music Information Retrieval

Performance Evaluation of TreeQ and LVQ Classifiers for Music Information Retrieval Performane Evaluaton of TreeQ and LVQ Classfers for Mus Informaton Retreval Matna Charam, Ram Halloush, Sofa Tsekerdou Athens Informaton Tehnology (AIT) 0.8 km Markopoulo Ave. GR - 19002 Peana, Athens,

More information

Progressive scan conversion based on edge-dependent interpolation using fuzzy logic

Progressive scan conversion based on edge-dependent interpolation using fuzzy logic Progressve san onverson based on edge-dependent nterpolaton usng fuzzy log P. Brox brox@mse.nm.es I. Baturone lum@mse.nm.es Insttuto de Mroeletróna de Sevlla, Centro Naonal de Mroeletróna Avda. Rena Meredes

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

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Clustering Data. Clustering Methods. The clustering problem: Given a set of objects, find groups of similar objects

Clustering Data. Clustering Methods. The clustering problem: Given a set of objects, find groups of similar objects Clusterng Data The lusterng problem: Gven a set of obets, fnd groups of smlar obets Cluster: a olleton of data obets Smlar to one another wthn the same luster Dssmlar to the obets n other lusters What

More information

Time Synchronization in WSN: A survey Vikram Singh, Satyendra Sharma, Dr. T. P. Sharma NIT Hamirpur, India

Time Synchronization in WSN: A survey Vikram Singh, Satyendra Sharma, Dr. T. P. Sharma NIT Hamirpur, India Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: 2319-7463 Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: www.erpublatons.om Tme Synhronzaton n WSN: A survey Vkram

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

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

Adaptive Class Preserving Representation for Image Classification

Adaptive Class Preserving Representation for Image Classification Adaptve Class Preservng Representaton for Image Classfaton Jan-Xun M,, Qankun Fu,, Wesheng L, Chongqng Key Laboratory of Computatonal Intellgene, Chongqng Unversty of Posts and eleommunatons, Chongqng,

More information

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references

More information

A New Tool: Solution Boxes of Inequality

A New Tool: Solution Boxes of Inequality J. Software Engneerng & Applatons 00 3 737-745 do:0.436/jsea.00.38085 Publshed Onlne August 00 (http://www.srp.org/journal/jsea) 737 A New Tool: Soluton Boxes of Inequalty Feren Kálovs Analyss Department

More information

Multiscale Heterogeneous Modeling with Surfacelets

Multiscale Heterogeneous Modeling with Surfacelets 759 Multsale Heterogeneous Modelng wth Surfaelets Yan Wang 1 and Davd W. Rosen 2 1 Georga Insttute of Tehnology, yan.wang@me.gateh.edu 2 Georga Insttute of Tehnology, davd.rosen@me.gateh.edu ABSTRACT Computatonal

More information

Evaluation of Segmentation in Magnetic Resonance Images Using k-means and Fuzzy c-means Clustering Algorithms

Evaluation of Segmentation in Magnetic Resonance Images Using k-means and Fuzzy c-means Clustering Algorithms ELEKTROTEHIŠKI VESTIK 79(3): 129-134, 2011 EGLISH EDITIO Evaluaton of Segmentaton n Magnet Resonane Images Usng k-means and Fuzzy -Means Clusterng Algorthms Tomaž Fnkšt Unverza v Lublan, Fakulteta za stronštvo,

More information

Color Texture Classification using Modified Local Binary Patterns based on Intensity and Color Information

Color Texture Classification using Modified Local Binary Patterns based on Intensity and Color Information Color Texture Classfaton usng Modfed Loal Bnary Patterns based on Intensty and Color Informaton Shvashankar S. Department of Computer Sene Karnatak Unversty, Dharwad-580003 Karnataka,Inda shvashankars@kud.a.n

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

THE low-density parity-check (LDPC) code is getting

THE low-density parity-check (LDPC) code is getting Implementng the NASA Deep Space LDPC Codes for Defense Applcatons Wley H. Zhao, Jeffrey P. Long 1 Abstract Selected codes from, and extended from, the NASA s deep space low-densty party-check (LDPC) codes

More information

Performance Analysis of Hybrid (supervised and unsupervised) method for multiclass data set

Performance Analysis of Hybrid (supervised and unsupervised) method for multiclass data set IOSR Journal of Computer Engneerng (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 4, Ver. III (Jul Aug. 2014), PP 93-99 www.osrjournals.org Performane Analyss of Hybrd (supervsed and

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

Storage Binding in RTL synthesis

Storage Binding in RTL synthesis Storage Bndng n RTL synthess Pe Zhang Danel D. Gajsk Techncal Report ICS-0-37 August 0th, 200 Center for Embedded Computer Systems Department of Informaton and Computer Scence Unersty of Calforna, Irne

More information

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to: 4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://e-tellgentnternetmarketng.com/webste/frustrated-computer-user-2/

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

International Journal of Pharma and Bio Sciences HYBRID CLUSTERING ALGORITHM USING POSSIBILISTIC ROUGH C-MEANS ABSTRACT

International Journal of Pharma and Bio Sciences HYBRID CLUSTERING ALGORITHM USING POSSIBILISTIC ROUGH C-MEANS ABSTRACT Int J Pharm Bo S 205 Ot; 6(4): (B) 799-80 Researh Artle Botehnology Internatonal Journal of Pharma and Bo Senes ISSN 0975-6299 HYBRID CLUSTERING ALGORITHM USING POSSIBILISTIC ROUGH C-MEANS *ANURADHA J,

More information

Multilabel Classification with Meta-level Features

Multilabel Classification with Meta-level Features Multlabel Classfaton wth Meta-level Features Sddharth Gopal Carnege Mellon Unversty Pttsburgh PA 523 sgopal@andrew.mu.edu Ymng Yang Carnege Mellon Unversty Pttsburgh PA 523 ymng@s.mu.edu ABSTRACT Effetve

More information

This fact makes it difficult to evaluate the cost function to be minimized

This fact makes it difficult to evaluate the cost function to be minimized RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess

More information

ABHELSINKI UNIVERSITY OF TECHNOLOGY Networking Laboratory

ABHELSINKI UNIVERSITY OF TECHNOLOGY Networking Laboratory ABHELSINKI UNIVERSITY OF TECHNOLOGY Networkng Laboratory Load Balanng n Cellular Networks Usng Frst Poly Iteraton Johan an Leeuwaarden Samul Aalto & Jorma Vrtamo Networkng Laboratory Helsnk Unersty of

More information

Steganalysis of DCT-Embedding Based Adaptive Steganography and YASS

Steganalysis of DCT-Embedding Based Adaptive Steganography and YASS Steganalyss of DCT-Embeddng Based Adaptve Steganography and YASS Qngzhong Lu Department of Computer Sene Sam Houston State Unversty Huntsvlle, TX 77341, U.S.A. lu@shsu.edu ABSTRACT Reently well-desgned

More information

Avatar Face Recognition using Wavelet Transform and Hierarchical Multi-scale LBP

Avatar Face Recognition using Wavelet Transform and Hierarchical Multi-scale LBP 2011 10th Internatonal Conferene on Mahne Learnng and Applatons Avatar Fae Reognton usng Wavelet Transform and Herarhal Mult-sale LBP Abdallah A. Mohamed, Darryl D Souza, Naouel Bal and Roman V. Yampolsky

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

A Novel Dynamic and Scalable Caching Algorithm of Proxy Server for Multimedia Objects

A Novel Dynamic and Scalable Caching Algorithm of Proxy Server for Multimedia Objects Journal of VLSI Sgnal Proessng 2007 * 2007 Sprnger Sene + Busness Meda, LLC. Manufatured n The Unted States. DOI: 10.1007/s11265-006-0024-7 A Novel Dynam and Salable Cahng Algorthm of Proxy Server for

More information

Minimize Congestion for Random-Walks in Networks via Local Adaptive Congestion Control

Minimize Congestion for Random-Walks in Networks via Local Adaptive Congestion Control Journal of Communatons Vol. 11, No. 6, June 2016 Mnmze Congeston for Random-Walks n Networks va Loal Adaptve Congeston Control Yang Lu, Y Shen, and Le Dng College of Informaton Sene and Tehnology, Nanjng

More information

Pattern Classification: An Improvement Using Combination of VQ and PCA Based Techniques

Pattern Classification: An Improvement Using Combination of VQ and PCA Based Techniques Ameran Journal of Appled Senes (0): 445-455, 005 ISSN 546-939 005 Sene Publatons Pattern Classfaton: An Improvement Usng Combnaton of VQ and PCA Based Tehnques Alok Sharma, Kuldp K. Palwal and Godfrey

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

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

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 Toolbox for Easily Calibrating Omnidirectional Cameras

A Toolbox for Easily Calibrating Omnidirectional Cameras A oolbox for Easly Calbratng Omndretonal Cameras Davde Saramuzza, Agostno Martnell, Roland Segwart Autonomous Systems ab Swss Federal Insttute of ehnology Zurh EH) CH-89, Zurh, Swtzerland {davdesaramuzza,

More information

Scalable Parametric Runtime Monitoring

Scalable Parametric Runtime Monitoring Salable Parametr Runtme Montorng Dongyun Jn Patrk O Nel Meredth Grgore Roşu Department of Computer Sene Unversty of Illnos at Urbana Champagn Urbana, IL, U.S.A. {djn3, pmeredt, grosu}@s.llnos.edu Abstrat

More information

A MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams

A MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams A MPAA-Based Iteratve Clusterng Algorthm Augmented by Nearest Neghbors Searh for Tme-Seres Data Streams Jessa Ln 1, Mha Vlahos 1, Eamonn Keogh 1, Dmtros Gunopulos 1, Janwe Lu 2, Shouan Yu 2, and Jan Le

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

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

The stream cipher MICKEY-128 (version 1) Algorithm specification issue 1.0

The stream cipher MICKEY-128 (version 1) Algorithm specification issue 1.0 The stream cpher MICKEY-128 (verson 1 Algorthm specfcaton ssue 1. Steve Babbage Vodafone Group R&D, Newbury, UK steve.babbage@vodafone.com Matthew Dodd Independent consultant matthew@mdodd.net www.mdodd.net

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

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

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

OSSM Ordered Sequence Set Mining for Maximal Length Frequent Sequences A Hybrid Bottom-Up-Down Approach

OSSM Ordered Sequence Set Mining for Maximal Length Frequent Sequences A Hybrid Bottom-Up-Down Approach Global Journal of Computer Sene and Tehnology Volume 12 Issue 7 Verson 1.0 Aprl 2012 Type: Double Blnd Peer Revewed Internatonal Researh Journal Publsher: Global Journals In. (USA) Onlne ISSN: 0975-4172

More information

Efficient automatic correction and segmentation based 3D visualization of magnetic resonance images

Efficient automatic correction and segmentation based 3D visualization of magnetic resonance images Lousana State Unverst LSU Dgtal Commons LSU Dotoral Dssertatons Graduate Shool 5 Effent automat orreton and segmentaton based 3D vsualzaton of magnet resonane mages Mkhal V. Mlhenko Lousana State Unverst

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

A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks

A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks A Real-Tme Detetng Algorthm for Trakng Communty Struture of Dynam Networks Jaxng Shang*, Lanhen Lu*, Feng Xe, Zhen Chen, Jaa Mao, Xueln Fang, Cheng Wu* Department of Automaton, Tsnghua Unversty, Beng,,

More information

A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES

A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens

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

LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION

LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION IEEE-Internatonal Conferene on Reent Trends n Informaton Tehnology, ICRTIT 211 MIT, Anna Unversty, Chenna. June 3-5, 211 LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION K.Meena #1, Dr.A.Suruland

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

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

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

Research on Neural Network Model Based on Subtraction Clustering and Its Applications

Research on Neural Network Model Based on Subtraction Clustering and Its Applications Avalable onlne at www.senedret.om Physs Proeda 5 (01 ) 164 1647 01 Internatonal Conferene on Sold State Deves and Materals Sene Researh on Neural Networ Model Based on Subtraton Clusterng and Its Applatons

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

EXPRESSION OF DUAL EULER PARAMETERS USING THE DUAL RODRIGUES PARAMETERS AND THEIR APPLICATION TO THE SCREW TRANSFORMATION

EXPRESSION OF DUAL EULER PARAMETERS USING THE DUAL RODRIGUES PARAMETERS AND THEIR APPLICATION TO THE SCREW TRANSFORMATION Mathematal and Computatonal Applatons, Vol. 6, No., pp. 68-689,. Assoaton for Sentf Researh EXPRESSION OF DUAL EULER PARAMETERS USING THE DUAL RODRIGUES PARAMETERS AND THEIR APPLICATION TO THE SCREW TRANSFORMATION

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

Outline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011

Outline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011 9/8/2 2 Outlne Appendx C: The Bascs of Logc Desgn TDT4255 Computer Desgn Case Study: TDT4255 Communcaton Module Lecture 2 Magnus Jahre 3 4 Dgtal Systems C.2: Gates, Truth Tables and Logc Equatons All sgnals

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

Loop Transformations, Dependences, and Parallelization

Loop Transformations, Dependences, and Parallelization Loop Transformatons, Dependences, and Parallelzaton Announcements Mdterm s Frday from 3-4:15 n ths room Today Semester long project Data dependence recap Parallelsm and storage tradeoff Scalar expanson

More information

A GENETIC APPROACH FOR THE AUTOMATIC ADAPTATION OF SEGMENTATION PARAMETERS

A GENETIC APPROACH FOR THE AUTOMATIC ADAPTATION OF SEGMENTATION PARAMETERS A GENETIC APPROACH FOR THE AUTOMATIC ADAPTATION OF SEGMENTATION PARAMETERS R. Q. Fetosa a, *, G. A. O. P. Costa a, T. B. Cazes a, B. Fejo b a Dept. of Eletral Engneerng, b Dept of Informats, Cathol Unversty

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

The Simulation of Electromagnetic Suspension System Based on the Finite Element Analysis

The Simulation of Electromagnetic Suspension System Based on the Finite Element Analysis 308 JOURNAL OF COMPUTERS, VOL. 8, NO., FEBRUARY 03 The Smulaton of Suspenson System Based on the Fnte Element Analyss Zhengfeng Mng Shool of Eletron & Mahanal Engneerng, Xdan Unversty, X an, Chna Emal:

More information

Pairwise Identity Verification via Linear Concentrative Metric Learning

Pairwise Identity Verification via Linear Concentrative Metric Learning Parwse Identty Verfaton va Lnear Conentratve Metr Learnng Lle Zheng, Stefan Duffner, Khald Idrss, Chrstophe Gara, Atlla Baskurt To te ths verson: Lle Zheng, Stefan Duffner, Khald Idrss, Chrstophe Gara,

More information

Swarm intelligence based dynamic obstacle avoidance for mobile robots under unknown environment using WSN

Swarm intelligence based dynamic obstacle avoidance for mobile robots under unknown environment using WSN J. Cent. South Un. Tehnol. (008) 15: 860 868 DI: 10.1007/s11771 008 0158 9 Swarm ntellgene based dynam obstale aodane for moble robots under unnown enronment usng WSN XUE Han( 薛晗 ), MA Hong-xu( 马宏绪 ) (College

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

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

AVideoStabilizationMethodbasedonInterFrameImageMatchingScore

AVideoStabilizationMethodbasedonInterFrameImageMatchingScore Global Journal of Computer Sene and Tehnology: F Graphs & vson Volume 7 Issue Verson.0 Year 207 Type: Double Blnd Peer Revewed Internatonal Researh Journal Publsher: Global Journals In. (USA) Onlne ISSN:

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

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

Computing Cloud Cover Fraction in Satellite Images using Deep Extreme Learning Machine

Computing Cloud Cover Fraction in Satellite Images using Deep Extreme Learning Machine Computng Cloud Cover Fraton n Satellte Images usng Deep Extreme Learnng Mahne L-guo WENG, We-bn KONG, Mn XIA College of Informaton and Control, Nanjng Unversty of Informaton Sene & Tehnology, Nanjng Jangsu

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

Multi-scale and Discriminative Part Detectors Based Features for Multi-label Image Classification

Multi-scale and Discriminative Part Detectors Based Features for Multi-label Image Classification Proeedngs of the wenty-seventh Internatonal Jont Conferene on Artfal Intellgene (IJCAI-8) Mult-sale and Dsrmnatve Part Detetors Based Features for Mult-lael Image Classfaton Gong Cheng, Deheng Gao, Yang

More information

FUZZY SEGMENTATION IN IMAGE PROCESSING

FUZZY SEGMENTATION IN IMAGE PROCESSING FUZZY SEGMENTATION IN IMAGE PROESSING uevas J. Er,, Zaldívar N. Danel,, Roas Raúl Free Unverstät Berln, Insttut für Inforat Tausstr. 9, D-495 Berln, Gerany. Tel. 0049-030-8385485, Fax. 0049-030-8387509

More information

arxiv: v3 [cs.cv] 31 Oct 2016

arxiv: v3 [cs.cv] 31 Oct 2016 Unversal Correspondene Network Chrstopher B. Choy Stanford Unversty hrshoy@a.stanford.edu JunYoung Gwak Stanford Unversty jgwak@a.stanford.edu Slvo Savarese Stanford Unversty sslvo@stanford.edu arxv:1606.03558v3

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

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

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:

More information