The Droplet Virtual Brush for Chinese Calligraphic Character Modeling

Size: px
Start display at page:

Download "The Droplet Virtual Brush for Chinese Calligraphic Character Modeling"

Transcription

1 The Droplet Virtul Brush for Chinese Clligrphi Chrter Moeling Xiofeng Mi Jie Xu Min Tng Jinxing Dong CAD & CG Stte Key L of Chin, Zhejing University, Hngzhou, Chin Artifiil Intelligene Institute, Zhejing University, Hngzhou, Chin mi_xiofeng@yhoo.om.n, tng_m@zju.eu.n Astrt This pper proposes virtul rush moel se on roplet opertion n its pplition on retrieving hrter outlines n hrter moeling in Chinese lligrphy style. In the propose pproh, virtul rush moel se on roplet opertion is pplie to proue vivi hrter outlines. The roplet moel helps to ompute stroke re with well-efine geometry informtion n les to the fesiility to retrieve the outlines of hrters with well-efine geometry representtion. Further more, the vritions of the moel n express vrious Chinese rush styles, so y using the roplet moel, we suessfully overome the poor expressive ility of the previous urve-offset metho. The omplex evlution of stroke re se on physil soli-moel rush is lso eliminte sine the simpliity of the moel. 1. Introution Numerous lligrphers hve een prouing ountless of msterpiees sine Chinese hrters ppere. The hir ristle rush, whih hs long, strhe nturl ristles nrrowing to pointe tip, is onvenient to use n hs its speil expressive ility. This hs lso impose iffiulties to its simultion n retrieving y omputer. Design of Chinese hrter fonts or omputing the outlines of the hrters in eutiful lligrphy styles hs thus ttrte mny reserhes Relte Works Simultions of Chinese lligrphy n e est esrie in terms of rush sweeps long urve trjetories while the rush shpes hnging ynmilly. Designing lligrphi style Chinese hrters in terms of rush sweeps is quite nturl sine it simultes the wy of humn writing hrters. Vrieties of rush moels hve een uilt y mny reserhes. One of the erliest ttempts is tht of Strssmnn s[1]. He tully simulte the ehvior of rush with wet pint on pper n the propose pproh i not suit for font esign. Wong n Ip [2] simulte the physil proess of rush stroke retion using prmeterize moel whih ptures the writing rush s 3D geometri prmeters, the rush hir properties n the vritions of ink eposition long stroke trjetory. Shmir n Rppoport introue prmetri metho to omptly represent existing outline-se orientl fonts[3]. Wong n Ip evelope frtl-se outline font tehnology whih is le to pture the outline hrteristis of lligrphy writing [4]. A most reent pproh is tht of Xu n Tng s[5]. In this moel, lusters of hirs re represente s soli moels n the imittion of the lligrphy inlues some geometry opertions on the moel. The previous virtul rush moels re ll esigne s some kin of soft rushes n nnot express vrious Chinese lligrphy effets, e.g, the effet of ry rush with stroke forks. In tritionl virtul rush moel, the tngent re etween the rush n the pper is ompute pixel y pixel. Though powerful in simulting the tul ry-rush effet, while pplie in retrieving of hrter outlines, this kin of rush moel is inpproprite euse it s too onerne with etil n the tngent re ompute is lk of geometry informtion. An the pproh in moel [4], inherently n imge reognition pproh, is oun to enounter the ilemm when eling with the ry stroke re. Figure 1 shows suh se Overview of the Droplet Moel By omitting some of the minor etils, the propose prmeterize physil rush moel hs tully enhne the tritionl soft rush moel y introuing novel stroke moel lle roplet. This moel, isusse in etil in setion 2, n proue the stroke ounry with well-efine geometry informtion, Stroke outline: Diffiult to retrieve using Imge reognition tehnique Stroke outline: Imposile to retrieve using Imge reognition tehnique Desire stroke outlines with extr inition urves ing to the viviment. Figure 1. It is iffiult to retrieve the outline of the ry strokes n impossile to get the inition urves s the esire results shown on the right in re.

2 Rel Moels D2 D3 Droplet Moels D1 1 Initil(Humiity) 2 Initil(Norml) 3 Splitte hirs without losing the power of expressing the ry rush effet whih is rther iffiult for the previous rush moels. When pplie to retrieving lligrphi hrter outlines, the rush prmeters re etermine oring to the lligrphy imge n regenertion of the lligrphy with our moel is just the retrieve result. 4 Lyere hirs 5 Begin to seprte 6 Seprte roplets Figure 2. Vritions of the roplet moels to simulte rel tngent re etween rush n pper tion. 6. Tip iretion V tip. Exept those in the funmentl rush moel prmeter set, ll the prmeters of the rush moel re normlize for the ske of simpliity, tht is, their omins ll lie in the intervl (0, 1). 2. rmeterize Brush Moel The rush moel propose in this pper is prmeterize one. First, we efine set of intertive tions to simulte tul lligrphy/pinting tions, n then we efine series of rush prmeters, n isuss how these tions ffet the vrition of the prmeters n how the prmeters etermine the finl stroke moel Bsi Ations There re four kins of si intertions efine in our moel. Dipping rush is the initil tion n this tion will reset the prmeters into initil vlues; Lift n press the rush is the tion of moifying the pressure the rush imposes to the pper; rush movement srthes the rush on the pper n proues strokes; Rotte rush-holer, the forth tion type, is often performe y the lligrphers when they wnt to hnge the iretion of the hir rush tip Normlize rush prmeters Bsi tions eie the moifition of properties of the rush. The most importnt prmeters re liste s follows: 1. Funmentl rush prmeters. This set inlues rush length L, imeter D n hir numer. 2. Brush veloity V. This prmeter enotes the spee of rush movement n it is etete y the system in user intertion. 3. Humiity of the rush, H. 4. Thikness of pigment T. This prmeter enotes the proportion of the mount of ink or Chinese tritionl pinting pigment to the mount of wter. 5. Brush pressure is eie y the lift n press rush 2.3. Stroke Are Moels In our pproh, we use the roplet moel to simulte the tngent re etween the rush n the pper euse this kin of moel resemles rel moel etter thn previous ones[3, 4, 7]. There re ifferent vritions of the roplet moel esies the stnr roplet shown in figure 2-1. All the roplet moels pply the sme rules in omputing the result n the rules of trnsformtion mong roplets uner the riven of tions re erive from tul rush wieling experiene. The roplet moel is kin of 2D moel. As just mentione, the stnr roplet is the region enlose y two irles, with imeter D 1 n D 2 respetively, n the two ommon tngent lines of them. Both the stnr roplet moel n the vrition 2 ll ontin single roplet, wheres the reminer my onsists of more thn one. The stnr moel n the vrition 2 re two roplets use s the initil moel when the rush is roppe. In ft, vrition 2 is speil form of the stnr moel with D 2 equls 0. The vlue of D 2 is eie y the rush humiity n the funmentl rush prmeters, inluing rush length n imeter. The vrition 4 of the roplet moels is lle lyere roplet. When wieling rush, the frition of the INIT 1 2 H H Rot t e At i on F F = V tip_1 V tip_1 6 Figure 3. Ation-riven moel trnsformtion 3 5 4

3 pper ginst the ottom prt of the rush hirs my e inonsistent with the tip iretion of the upper prt of rush hirs, thus the lyere roplet moel is opte. Exept for the funmentl rush prmeters, ll other prmeters re etermine oring to the rush tions n thus the trnsformtions etween vritions of the moel re riven. The stte mhine is hieve from experiene. The possile trnsformtions etween roplet moel vritions re shown in figure Computtion of Stroke Are Following previous reserhes, the entire stroke re is ssume s the tril the roplets hve swept. The omputtion of the roplet moel n e ivie into two steps: evluting the roplets in its lol oorintion system n then trnsforming it to pper oorintion system. Given the lotion of the rush n the tip orienttion, it is simple to get the trnsformtion T n the sequent work is strightforwr. So in this setion we fous on the evlution of the roplet in its lol oorintion system. Beuse most of the rush prmeters re normlize, we o not intent to n n not lulte the physil moel of the rush preisely. The evlution of the stnr roplet moel is quite simple. D 1 = D pressure, n it mens tht the size of the tngent stroke re vries oring to the vrition of the pressure the lligrpher imposes on the pper. The rnge of D 1 is (0, D). D 2 = D 1 kh, k lies in the intervl (0, 1) n is speifie y the user t the initil time. A reltive igger k mens tht the virtul lligrpher tilts his rush holer to the sie of the rush tip. h = L pressure. See figure 4-. ressure erese h R 1 R 2 Humiity erese (1-s)R 1 The figure 4- shows how the vrition moel 1 or vrition moel 2 trnsforms to vrition 3 or 4. Here, we introue rnom numer s. The irle with rius R on either en of the roplet is ivie into two irles with rius (1-s)R 1 n sr 1 respetively. Figure n in figure 4 shows the roplets when pressure erese. We n see from the figure tht, when the rush is lifte, the roplet vrition 3 or 4 trnsforms to the vrition 6 ultimtely. Note tht in figure 4, ll Rs re hlf the vlue of the sr 1 Figure 4. Evlution of roplets h (1-s)R 1 sr 2 orresponing Ds mentione; R stns for rius n D for imeter. The reunion n merging of the roplets re inverses of roplet seprting n splitting. When the prmeters of the rush moel re moifie, the roplets moel must e reevlute. However, the rush moves ontinuously in rel lligrphy, ut this is impossile in omputer. In our moel, we simply evlute roplets perioilly n use the hull of the two sequentilly evlute roplet moels to pproximte the stroke uring this time. Before further isussion, we first efine some terms. We ll tht eh of the roplet retrieve in the sme evlution re siling roplets with one nother. When evluting roplets moel, eh roplet n e erive y one of the three ses: inheritor from previous roplet, merge one from severl roplets or otherwise one of the resulting roplets from split. In ny se, the previous roplet(s) is(re) the prent(s) of the result roplet n the ltter is lle esennt of the former. After sorting the roplets in roplet moel y the y oorinte vlue in the roplet moel s lol oorintion system, some roplets re lle neighoring ones if there re no other roplets etween them in the sorte sequene. The evlution of the hull is not so strightforwr euse there my e se tht the two roplet moels re topologilly inonsistent. On ourrene of suh inonsistene my e uring the time when roplet moel 1 or 2 trnsforms to moel 3. To voi extreme omplexity, we hol two ssumptions: Assumption 1: Only neighoring siling roplets n e merge into one new roplet n tht the roplets orer of one evlution keeps the sme s the orer of the roplets prents in the previous evlution. For exmple, suppose rop k-1, rop k n rop k+1 re three neighoring roplets, in the next evlution of the roplet moel, the roplet(s) trnsforme from rop k is oun to lies etween the roplets trnsforme from rop k-1 n rop k+1. Assumption 2: In two sequentilly evlute roplets, single roplet n not oth split into severl n in the sme time prt of them merge with other roplets. Now we give the hull rule: eh of the esennts or the prents of roplet prtiiptes to the evlution of the hull with this roplet. the roplets n the hull rule the resulting stoke re Figure 5. Hull rule. The hull of seprte roplets elegntly expresses the ry rush effet.

4 Figure 5 shows n exmple of pplying the hull rule to evlute the stoke re of sh stroke, inluing the se of topologilly ifferene. 3. Clligrphy Reonstrution n Moeling Reonstrution of lligrphi hrters n the moeling-purpose outline lultion n e ivie into two steps: retrieving the rush prmeters from the input lligrphy imge n then regenerting the lligrphy using the virtul rush with the lulte prmeter set Brush rmeters Determintion From figure 3, we n see tht humiity of the roplet virtul rush will rive roplet from vrition 1 or 2 to vrition 3, so, we must etermine the vlue of H long the stroke. Nturlly, we use the vlue of rk-pixel numer ivie y the soure imge y numer of pixels the orresponing roplet overs s the mesurement of stroke humiity. The stroke pth is speifie y user intertively (s the she line in the left sie of figure 6). Drop 2 Drop 1 Drop 31, Drop 32 Drop 4 Drop 5 Drop 6 Drop 71, Drop 72, Drop 73 Drop 81, Drop 82, Drop 83, Drop 84 Totl Drk Rtio D % D % D % D % D % D % D % D % D /0% D % Figure 6. ixel smpling from soure imge to etet roplet ink eposit mount Figure 7. lligrphy reonstrution n moeling of the one shown in figure 6. Figure 6 lso shows the rk-pixel rtio of some lulte roplets. We n see from the t liste on the right tle tht when the rk rio of roplet rops, it my e ivie into severl smller ones. Given stroke imge, the lgorithm of the roplet omputing n e s follows: Input: I: Clligrphy imge soure S: Stroke pth v1,v2: two vlve humiity vlue, 1 v2>v1 0 Initiliztion: i = 0 ; // the strt point of S D = stroke_with ( i );V = stroke_tngent ( i ); lulte_roplets(d, i, V) {Drop ij }; A lulte roplets to finl roplet set Itertion: for eh lulte Drop ij, o egin if rk_rtio(rop ij ) < v1 erese rop size of Drop ij ; else if rk_rtio(rop ij )>v2 set Drop ij mergle; else split Drop ij ; en Merge mergle roplets; Inrese size of remining merle roplets; i = mrh_on(s, i ) // go to next segment of S; D = stroke_with ( i );V = stroke_tngent ( i ); roplet_just(d, V, Drop ij ); roplet hull with the prents using hull rule if(one) exit; else go to Itertion. The roplet vlve humiity vlues, v1 n v2, re etermine intertively. If v1 is lose to 0 n v2 lose to 1, then no roplet splitting or merging will our Stroke Regenertion n Exmples After the roplets long the stroke pth re retrieve, ifferent use of the roplets n get ifferent results. One pplition tht n e one on the roplets is simply to hth eh of the roplets with proper lligrphy texture oring to the ink-eposit mount of the given roplet. Unlike the tngent re ompute vi tritionl virtul rush moel, the tngent re in our moel hs ontine omplete geometry informtion, whih mkes geometry opertion on them possile. By union of the roplets retrieve, my lso generte in virtul lligrphy, we n retrieve profiles of rt hrters in lligrphy or sript style with extr outlines to inite the stroke forks or ry rush effets. Figure 7- is the retrieve roplets n is the result imge fter texturiztion of them. The figure in is the union of the roplets. After the profiles re ompute, the genertion of 3D hrter moel is strightforwr. A simple extrue lgorithm works quite well. Figure 7- is the extrue soli moel using the profile in with mrle texture, whih n e use in virtul relity.

5 Figure 8- shows two Chinese hrters (mens orient ) generte y our pinting system, shows the ompute roplets n the profile in is the union of them. Sine the lulte outlines re not smooth, we use ui uniform B-spline to pproximte eh loop of the generte stroke outlines. Figure gives the result. We n see tht the merge roplets in figure 8 express the stoke forks, most importnt spet of ry-rush effet orretly n elegntly. Figure 10. is the extrue soli moel of the lligrphy shown in, is the virtul lligrphy using the roplet rush moel 4. Referene Figure 8. The lultion of the stroke outlines As isusse in previous setions, our rush moel is prmeterize one, so y justing the funmentl rush prmeters we n get vritions of sme font. Figure 9 [1] S. Strssmnn, Hiry rush. roeeing of SIGGRAH 1986, , [2] H.T.F. Wong n H.H.S. Ip, Virtul rush: moel-se synthesis of Chinese lligrphy, Computers & Grphis, 24(1):99 113, [3] R. Shmir n A. Rppoport, Qulity enhnements of igitl outline fonts, Computers & Grphis, 21(6): , [4] H.H.S. Ip, H.T.F. Wong, Frtl oing of Chinese slle lligrphi fonts, Computers & Grphis, 18(3): , [5] Songhu Xu, Min Tng, Frnis Lu n Yunhe n, A Soli Moel Bse Virtul Hiry Brush, roeeings of Eurogrphis Figure 9. thin n ol version of shows suh n exmple. The tehnique esrie hs vrious pplitions. Beuse urves of the hrter profiles n e preisely retrieve, we n exports NC oes n signifintly enhne the ility of existing lettering mhine, whih urrently n only el with preefine set of true type hrters. This tehnique lso introues new prigm of 3D hrter moeling, n my e pplie in vrious CAD systems. Figure 10- shows nother exmple, whih is soli moel of the lligrphy in. Dry rush effet is wiely use in this piee of work n outlines lulte from tritionl soft rush nnot work well for suh kin of lligrphy, however, our metho is quite ompetent.

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

Internet Routing. Reminder: Routing. CPSC Network Programming

Internet Routing. Reminder: Routing. CPSC Network Programming PS 360 - Network Progrmming Internet Routing Mihele Weigle eprtment of omputer Siene lemson University mweigle@s.lemson.eu pril, 00 http://www.s.lemson.eu/~mweigle/ourses/ps360 Reminer: Routing Internet

More information

Table-driven look-ahead lexical analysis

Table-driven look-ahead lexical analysis Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

WORKSHOP 9 HEX MESH USING SWEEP VECTOR

WORKSHOP 9 HEX MESH USING SWEEP VECTOR WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re

More information

Using Red-Eye to improve face detection in low quality video images

Using Red-Eye to improve face detection in low quality video images Using Re-Eye to improve fe etetion in low qulity vieo imges Rihr Youmrn Shool of Informtion Tehnology University of Ottw, Cn youmrn@site.uottw. Any Aler Shool of Informtion Tehnology University of Ottw,

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-

More information

A decision support system prototype for fuzzy multiple objective optimization

A decision support system prototype for fuzzy multiple objective optimization EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $ Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti

More information

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator. COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering

More information

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414 Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro

More information

WORKSHOP 8A TENSION COUPON

WORKSHOP 8A TENSION COUPON WORKSHOP 8A TENSION COUPON WS8A-2 Workshop Ojetives Buil the tension oupon geometry Control the mesh y using tehniques isusse in lss Compre FEA stress results to theoretil results From Stress Conentrtion

More information

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks oopertive Routing in Multi-Soure Multi-estintion Multi-hop Wireless Networks Jin Zhng Qin Zhng eprtment of omputer Siene n ngineering Hong Kong University of Siene n Tehnology, HongKong {zjzj, qinzh}@se.ust.hk

More information

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco Roust internl multiple preition lgorithm Zhiming Jmes Wu, Sonik, Bill Drgoset*, WesternGeo Summry Multiple ttenution is n importnt t proessing step for oth mrine n ln t. Tehniques for surfe- rpily in the

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull Convex Hull in The rolem: Given set P of oints in, omute their onvex hull onvex hulls Comuttionl Geometry [si 3250] Lur Tom Bowoin College onvex olyheron 1 2 3 olygon olyheron onvex olyheron 4 5 6 Polyheron

More information

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front

More information

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that Setion 2.3 Funtions Definition: Let n e sets. funtion (mpping, mp) f from to, enote f :, is suset of suh tht x[x y[y < x, y > f ]] n [< x, y 1 > f < x, y 2 > f ] y 1 = y 2 Note: f ssoites with eh x in

More information

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model. Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions

More information

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA: In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

PROBLEM OF APOLLONIUS

PROBLEM OF APOLLONIUS PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents Hsh-bse Subgrph Query Proessing Metho for Grph-struture XML Douments Hongzhi Wng Hrbin Institute of Teh. wngzh@hit.eu.n Jinzhong Li Hrbin Institute of Teh. lijzh@hit.eu.n Jizhou Luo Hrbin Institute of

More information

Solids. Solids. Curriculum Ready.

Solids. Solids. Curriculum Ready. Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #

More information

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register

More information

WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS

WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS WS6-1 WS6-2 Workshop Ojetives Crete finite element moel (meshes; onnet jent elements; pply e los, operting los, n grvity los; onstrin noes) for intermeitely iffiult

More information

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

Generating Editors for Direct Manipulation of Diagrams

Generating Editors for Direct Manipulation of Diagrams Generting Eitors for Diret Mnipultion of Digrms Gerhr Viehstet n Mrk Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny E-mil: fviehste,minsg@informtik.uni-erlngen.e

More information

Adaptive Pixel Interpolation for Spatial Error Concealment

Adaptive Pixel Interpolation for Spatial Error Concealment J Sign Proess Syst (2010) 60:291 303 DOI 10.1007/s11265-009-0367-y Aptive Pixel Interpoltion for Sptil Error Conelment Li Song & Xin M Reeive: 9 Novemer 2008 / Revise: 23 Mrh 2009 /Aepte: 30 Mrh 2009 /Pulishe

More information

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

WORKSHOP 8B TENSION COUPON

WORKSHOP 8B TENSION COUPON WORKSHOP 8B TENSION COUPON WS8B-2 Workshop Ojetives Prtie reting n eiting geometry Prtie mesh seeing n iso meshing tehniques. WS8B-3 Suggeste Exerise Steps 1. Crete new tse. 2. Crete geometry moel of the

More information

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services Slle Sptio-temporl Continuous uery Proessing for Lotion-wre Servies iopeng iong Mohme F. Mokel Wli G. Aref Susnne E. Hmrush Sunil Prhkr Deprtment of Computer Sienes, Purue University, West Lfyette, IN

More information

A new way to evaluate steel sheet surfaces

A new way to evaluate steel sheet surfaces A new wy to evlute steel sheet surfes L. Blunt X. ing W. Zeng T. Asim Centre for Preision Tehnologies (CPT) University of Huersfiel Queensgte Huersfiel UK HD1 3DH Tel.: + 44-1484-473634 E-mil: x.ing@hu..uk

More information

Math 227 Problem Set V Solutions. f ds =

Math 227 Problem Set V Solutions. f ds = Mth 7 Problem Set V Solutions If is urve with prmetriztion r(t), t b, then we define the line integrl f ds b f ( r(t) ) dr dt (t) dt. Evlute the line integrl f(x,y,z)ds for () f(x,y,z) xosz, the urve with

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil

More information

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs. Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Comparing Hierarchical Data in External Memory

Comparing Hierarchical Data in External Memory Compring Hierrhil Dt in Externl Memory Surshn S. Chwthe Deprtment of Computer Siene University of Mryln College Prk, MD 090 hw@s.um.eu Astrt We present n externl-memory lgorithm for omputing minimum-ost

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information

Midterm Exam CSC October 2001

Midterm Exam CSC October 2001 Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not

More information

Declarative Routing: Extensible Routing with Declarative Queries

Declarative Routing: Extensible Routing with Declarative Queries elrtive Routing: Extensile Routing with elrtive Queries Boon Thu Loo 1 Joseph M. Hellerstein 1,2, Ion toi 1, Rghu Rmkrishnn3, 1 University of Cliforni t Berkeley, 2 Intel Reserh Berkeley, 3 University

More information

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions Distne Computtion etween Non-onvex Polyhedr t Short Rnge Bsed on Disrete Voronoi Regions Ktsuki Kwhi nd Hiroms Suzuki Deprtment of Preision Mhinery Engineering, The University of Tokyo 7-3-1 Hongo, Bunkyo-ku,

More information

Kinetic Collision Detection: Algorithms and Experiments

Kinetic Collision Detection: Algorithms and Experiments Kineti Collision Detetion: Algorithms n Experiments Leonis J. Guis Feng Xie Li Zhng Computer Siene Deprtment, Stnfor University Astrt Effiient ollision etetion is importnt in mny rooti tsks, from high-level

More information

XML and Databases. Outline. XPath. Outline - Lectures. XPath Data Model. Outline - Assignments. XPath. Sebastian Maneth NICTA and UNSW

XML and Databases. Outline. XPath. Outline - Lectures. XPath Data Model. Outline - Assignments. XPath. Sebastian Maneth NICTA and UNSW Outline XML n Dtses Leture 6 Noe Seleting Queries: XPth 1.0 1. XPth Dt Moel: 7 types of noes 2. Simple Exmples 3. Lotion Steps n Pths 4. Vlue Comprison, n Other Funtions Sestin Mneth NICTA n UNSW CSE@UNSW

More information

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted

More information

Right Angled Trigonometry. Objective: To know and be able to use trigonometric ratios in rightangled

Right Angled Trigonometry. Objective: To know and be able to use trigonometric ratios in rightangled C2 Right Angled Trigonometry Ojetive: To know nd e le to use trigonometri rtios in rightngled tringles opposite C Definition Trigonometry ws developed s method of mesuring ngles without ngulr units suh

More information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it. 6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted

More information

5 ANGLES AND POLYGONS

5 ANGLES AND POLYGONS 5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.

More information

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string. CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over

More information

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page. 6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,

More information

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The

More information

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs Byesin Networks: Direte Mrkov Properties (Cont ) n Mrkov Equivlent DAGs Huizhen Yu jney.yu@s.helsinki.fi Dept. Computer Siene, Univ. of Helsinki Proilisti Moels, Spring, 2010 Huizhen Yu (U.H.) Byesin Networks:

More information

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,

More information

Graph theory Route problems

Graph theory Route problems Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re

More information

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression

More information

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures An Effiient Algorithm for the Physil Mpping of Clustere Tsk Grphs onto Multiproessor Arhitetures Netrios Koziris Pnyiotis Tsnks Mihel Romesis George Ppkonstntinou Ntionl Tehnil University of Athens Dept.

More information

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms Using SIMD Registers n Instrutions to Enle Instrution-Level Prllelism in Sorting Algorithms Timothy Furtk furtk@s.ulert. José Nelson Amrl mrl@s.ulert. Roert Niewiomski niewio@s.ulert. Deprtment of Computing

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED OLTAGE WAESHAPES M.H.J. Bollen, L.D. Zhng Dept. Eletri Power Engineering Chlmers University of Tehnology, Gothenurg, Sweden Astrt:

More information

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5 CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,

More information

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees. 428 T FOU 4.3 Blned Trees T BT GOIT IN T VIOU setion work well for wide vriety of pplitions, ut they hve poor worst-se performne. s we hve noted, files lredy in order, files in reverse order, files with

More information

Introduction. Example

Introduction. Example OMS0 Introution isjoint sets n minimum spnning trees In this leture we will strt by isussing t struture use for mintining isjoint subsets of some bigger set. This hs number of pplitions, inluing to mintining

More information

Definition of Regular Expression

Definition of Regular Expression Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll

More information

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut

More information

Asurveyofpractical algorithms for suffix tree construction in external memory

Asurveyofpractical algorithms for suffix tree construction in external memory Asurveyofprtil lgorithms for suffix tree onstrution in externl memory M. Brsky,, U. Stege n A. Thomo University of Vitori, PO Box, STN CSC Vitori, BC, VW P, Cn SUMMAY The onstrution of suffix trees in

More information

Inter-domain Routing

Inter-domain Routing COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit

More information

Graph Contraction and Connectivity

Graph Contraction and Connectivity Chpter 14 Grph Contrtion n Connetivity So fr we hve mostly overe tehniques for solving problems on grphs tht were evelope in the ontext of sequentil lgorithms. Some of them re esy to prllelize while others

More information

Approximate computations

Approximate computations Living with floting-point numers Stndrd normlized representtion (sign + frction + exponent): Approximte computtions Rnges of vlues: Representtions for:, +, +0, 0, NN (not numer) Jordi Cortdell Deprtment

More information

COSC 6374 Parallel Computation. Dense Matrix Operations

COSC 6374 Parallel Computation. Dense Matrix Operations COSC 6374 Prllel Computtion Dense Mtrix Opertions Edgr Griel Fll Edgr Griel Prllel Computtion Edgr Griel erminology Dense Mtrix: ll elements of the mtrix ontin relevnt vlues ypilly stored s 2-D rry, (e.g.

More information

CICS Application Design

CICS Application Design CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the

More information

SAS Event Stream Processing 5.1: Using SAS Event Stream Processing Studio

SAS Event Stream Processing 5.1: Using SAS Event Stream Processing Studio SAS Event Strem Proessing 5.1: Using SAS Event Strem Proessing Stuio Overview to SAS Event Strem Proessing Stuio Overview SAS Event Strem Proessing Stuio is we-se lient tht enles you to rete, eit, uplo,

More information

Tiling Triangular Meshes

Tiling Triangular Meshes Tiling Tringulr Meshes Ming-Yee Iu EPFL I&C 1 Introdution Astrt When modelling lrge grphis senes, rtists re not epeted to model minute nd repetitive fetures suh s grss or snd with individul piees of geometry

More information

Lecture 12 : Topological Spaces

Lecture 12 : Topological Spaces Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

Geometric Algorithms. Geometric Algorithms. Warning: Intuition May Mislead. Geometric Primitives

Geometric Algorithms. Geometric Algorithms. Warning: Intuition May Mislead. Geometric Primitives Geometri Algorithms Geometri Algorithms Convex hull Geometri primitives Closest pir of points Voronoi Applitions. Dt mining. VLSI design. Computer vision. Mthemtil models. Astronomil simultion. Geogrphi

More information

Neo-Flex Slide-out Keyboard Tray Wall Mount

Neo-Flex Slide-out Keyboard Tray Wall Mount User's Guie Neo-Flex Slie-out Keyor Try Wll Mount For the ltest User Instlltion Guie plese visit: www.ergotron.om User's Guie - English Guí el usurio - Espñol Mnuel e l utilisteur - Frnçis Geruikersgis

More information

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems Amerin Journl of Intelligent Systems. 0; (): -5 DOI: 0. 593/j.jis.000.0 Cellulr-se Popultion to Enhne Geneti Algorithm for Assignment Prolems Hossein Rjlipour Cheshmehgz *, Hiollh Hron, Mohmm Rez Myoi

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion

More information

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,

More information

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition

More information