Enhanced Advancing Front Technique with Extension Cases for Initial Triangular Mesh Generation

Size: px
Start display at page:

Download "Enhanced Advancing Front Technique with Extension Cases for Initial Triangular Mesh Generation"

Transcription

1 , July 6-8, 2011, London, U.K. Enhanced Advancng Front Technque wth Extenson Cases for Intal Trangular Mesh Generaton Z. Abal Abas and S. Salleh Abstract Durng the element creaton procedure of ntal mesh generaton usng the standard advancng front technque (SAFT), there s a possblty where a conflct of undecded element occurs whch do not follow the normal cases. We proposed a drect approach to tackle ths knd of problem by extendng the two normal cases n SAFT to the total number of fve cases of consderaton durng the element creaton procedure n ntal mesh generaton. The approach s called as Enhanced Advancng Front Technque-1 (EAFT-1). The am of the work s to mprove the SAFT n order to tackle drectly such problem of sudden nvald trangular element wthout havng to re-order back the Front lst and wthout erasng the exstng element n the ntal mesh generaton. A smulaton of ths approach has been done and the qualty of the mesh s examned usng a number of defned measurements n Gambt software. The resulted mesh s appled for modelng the radaton heat transfer problem usng Dscrete Ordnate method. Index Terms Intal mesh, Enhanced Advancng Front Technque, extended cases and radaton. S I. INTRODUCTION TRUCTURED or unstructured trangular mesh formaton s an mportant step for approxmatng solutons to boundary value problems. Recently, unstructured grd has been predomnant because of ts ablty of modelng complex geometres, besdes ts natural envronment for adaptvty [1]-[3]. Trangular element s chosen n ths work snce t s reported that these type of element are the most flexble for automatc mesh generaton partcularly when mesh gradng s requred [1], [2]. Among the famous method of generatng unstructured mesh s Delaunay trangulaton and Advancng front technque (AFT). The AFT s guaranteed to preserves boundary ntegrty as well as t has the capacty to create trangular elements wth hgh aspect rato n boundary-layer regon [2]. In the present paper, we extend the work done n [2] and the ssue rased n [4] by llustratng two dfferent condtons Manuscrpt receved Jan 13, 2011; revsed Feb 5, Ths work was supported by Mnstry of Hgher Educaton, Malaysa under SLAB scholarshp. Z. Abal Abas s now wth Department of Mathematcs, Faculty of Scence, Unverst Teknolog Malaysa, Skuda, Johor, Malaysa, currently on study leave from Unverst Teknkal Malaysa Melaka. (e-mal: {zuradaa@utem.edu.my). S. Salleh s wth the Department of Mathematcs, Faculty of Scence, Unverst Teknolog Malaysa, Skuda, Johor, Malaysa. (emal: ss@utm.my). of undecded element creaton durng the teraton, regarded as conflct durng element creaton procedure usng the Standard Advancng Front Technque (SAFT) whch wll be descrbed n detal n secton II. A bref concept of SAFT and numercal method s descrbed n secton III. We present our drect approach of encounterng ths specfc problem by ncorporatng the fve extended cases of consderaton durng the element creaton procedure. The approach s called Enhanced Advancng Front Technques-1 (EAFT-1) where each of the cases wll be explaned n Secton IV. At the end of the paper, we apply the unstructured mesh for modelng the radatve heat transfer problem usng Dscrete Ordnate method for a smple two dmensonal doman. II. PROBLEM STATEMENT In general, the followng cases are possble durng the procedure of element creaton: (1) A new node (deal pont) s created and been selected as a vertex to form the new trangle element where ths new node satsfes certan condton lsted n the SAFT. (2) The already exstng front node and actve edges are selected to form the new trangle element where ths exstng node satsfes certan condton lsted n the SAFT. However, there are also condtons whch do not belong to any of the above cases. Ths ssue has been rased n [4] where an effcent mesh generaton algorthm should be able to tackle such problem when nether the normal case lsted above occurs durng the element creaton. Before llustratng the problem n detal, a few terms need to be defned. We denote an edge as (a,b) whch means that the edge s formed by node a and node b. The current selected edges beng consdered s called as base edge. Front s a lst or a set of actve edges whch s currently avalable for element trangulaton. It must be noted that all the edges belong to the current Front wll be consdered as actve edges whle edges that had been drop from the current Front lst wll be consdered as passve edges. At the same tme, any nodes whch compose the actve edges n the current poston of the Front lst are also known as actve node. In the creaton of the trangular element, once base edge has been dentfed, the poston of deal pont (IP) on the perpendcular bsector of the base edge s computed n such a way that an equlateral trangle s formed wth IP as vertex.

2 , July 6-8, 2011, London, U.K. III. STANDARD ADVANCING FRONT TECHNIQUE AND THE NUMERICAL METHOD A. The general basc step of standard Advancng Front Technque wth background grd Fg. 1. Edge (7,9) as the base edge. The IP s out of the boundary and no pont le wthn the crcle Fgure 1 llustrates the frst condton that does not belong to nether of the normal case. The boundary curve has been dscretsed nto a set of boundary edges where edge (7,8) s a part of the boundary. The procedure of the trangular element creaton s conducted smoothly as outlned n the SAFT for the frst sx elements but when t comes to create the next trangular element, wth (7,9) as the base edge, the problem occur when the IP constructed as n Fgure 1 s out of the boundary curve and at the same tme there s no actve node le wthn the crcle whch s approprate to replace the IP. Approprate here means the node needs to be nsde the boundary as well as the node do not les wthn other exstng trangular element. Another condton that mght occur n whch we classfed as the second problem s llustrated n Fgure 2 where the base edge beng consdered s (a,b). There s also a possblty that the IP created s stll nsde the boundary, but t s too close to the exstng element, and one cannot connect the base edge drectly to the IP because the sde of the new element wll ntersect the exstng sde of the trangle element. Furthermore, no actve nodes whch can replace the IP approprately le wthn the crcle. These second condton also leads to conflcts or undecded element creaton procedure durng the element creaton. Fg 2. The second problem where the base edge s (a,b) and t cannot connect to the IP drectly. Accordng to the algorthm of SAFT n [2], f these happen, one needs to re-order the Front and take the second shortest actve edge and repeat the trangulaton process agan. At some later stage, the same condton may occur and agan, one needs to re-order the Front agan and select the next actve edge. Imagne f we have thousand of edges n a bgger computatonal doman, ths procedure mght be complcated and may take longer tme to complete the task. Other author n [4] suggests that one mght consder to erase a few exstng elements f ths problem occurs. Therefore, ths scenaro shows that the algorthm s not suffcent to cover all condtons, hence an mprovement need to be done to tackle the problem drectly. Our work focus on how to mprove the algorthm of SAFT n order to tackle such problem descrbe above drectly wthout havng to re-order back the Front lst and wthout erasng the exstng element n the ntal mesh generaton. The approach nvolves studyng all types of enttes or objects that fall nto the crcle for further consderaton so that the trangular element can be generated drectly. The followng basc steps of SAFT n ths secton are based on [2]. The boundary curves are dscretzed by dvdng the boundary curves nto straght lne segments and hence, nodes are placed on each of the segment. The man approach of controllng the grd n terms of sze and shape of the trangular element nvolves the defnton of the requred grd-cell characterstc through background grd generaton [1]-[7]. The grd-cell characterstcs or known as grd cell parameters are the sze parameter, the stretchng s and fnally the orentaton of the cells. These parameters are requred to be defned at each node formng the background grd. Grd cell parameters for all nodes n the Front are nterpolated usng the value defned at the background grd. The edge wth shortest length l n the Front s selected as a departure zone, n order to create the trangular element. In order to obtan for the next step of calculaton, the nterpolated values of correspondng to the two nodes of the edges s averagng. The poston of IP on the perpendcular bsector of the sde s computed and the emprcal formula s used to obtan the radus, r. A crcle wth centre at IP s constructed wth the followng emprcal formula for the radus, r 08. *, where 0. 55* l; 0. 55* l ; 0. 55* l 2. 0* l 2. 0* l; 2. 0* l Actve nodes that le wthn the crcle are searched (f any) and ther dstances from IP are lsted. The best canddate for the thrd vertex of the trangular element would be the closest one to the IP. The equlateral trangle wll be formed f there are no such actve nodes les wthn the crcle. However, the valdty of the IP becomng the vertex must be check n whch t need to satsfy the followng condtons: (1) The coordnate of IP do not le nsde another exstng trangular element. (2) There s no ntersecton between the sde of the new trangular element and any exstng sdes of the actve front. Generally, n a marchng process, the Front moved nto the nteror of the doman, n whch new nodes and edges are created and at the same tme old related edges are deleted from the Front lst n order to produce trangular element. The new trangular element s constructed by two nodes of a segment of a Front and another node ether a newly created or already been exsted n the Front. The Front wll be updated every tme an element s constructed. If the above step of creatng the trangular element faled, then one needs to re-order the Front and then select the second shortest actve edges as the departure zone for element creaton procedure. Ths process wll be contnued untl there are no (1)

3 , July 6-8, 2011, London, U.K. longer actve edges n the Front or the whole computatonal doman has been trangulated completely. The general scheme for SAFT s llustrated n Fgure 3. B. The concept of radaton and Dscrete Ordnate method Radaton wll be emtted more at hgher temperature materals. Emssve power E s a rate of heat flow per unt surface area emtted by a radatng surface. For a black body emssve power, E s gven by Eb 4 b T (2) 8 Where s Stefan-Boltzmann s constant and T s absolute temperature. The ntensty I s the rate of heat flow receved per unt area perpendcular to the rays and per unt sold angle. The formula for ntensty of the black body, I s b No No Fg. 3. The general scheme of SAFT 4 Ib E b / T / (3) Equaton (3) s used to compute the emtted radaton ntensty from the surfaces and fluds. When combuston occurs, there exst large amount of carbon doxde and water vapor where these combuston products are both strong absorbers/emtters n the nfrared part of the spectrum and ths flud s termed as partcpatng medum [8], [9]. The nteracton between partcpatng flud medum and radaton can be measured n terms of absorpton coeffcent and ts scatterng coeffcent where the sum of these two propertes s called s Defne grd cell parameter at background grd and dscretsed boundary curve. Select shortest edge n the Front Construct element based on 2 normal cases Element created successfully Yes Update the Front lst Empty front Yes END extncton coeffcent s [9]. The general relatonshp that governs the changes n radaton ntensty at a pont along a radaton ray due to emsson, absorpton and non-scatterng n a flud medum s as follows [10] di r,s ds I b I r r,s (4) I r,s s the ntensty of radaton at locaton ndcated by poston vector r, n drecton s. The frst and second terms n the rght-hand sde equaton are the emtted ntensty and the absorbed ntensty respectvely. Equaton (4) s ntegrated over each trangular element n the mesh obtaned. It s also subject to the boundary condton as follows [10] 1 I r w,s Ib rw I dω 2 r w,s n.s (5) rw s a poston vector for a pont on a dffusvely emttng and reflectng opaque surface and s surface emssvty. I s ncdent ntensty and n s outward surface normal. Usng Dscrete Ordnate method, equaton (4) s solved for a set of n varous drectons s, 12,,...n. A numercal quadrature replaces the ntegral over drecton, or [10] 4 Where n 2 f ( s )d w f ( s ) (6) w s the quadrature weght assocated wth drecton s. Therefore, the approxmaton of equaton (4) s done by a set of n equatons [10], di r,s Ib r Ir,s (7) ds Wth 12,,...n subject to the boundary condtons [10] 1 r n w w w b w j w j j j1 I r,s r I r w I r,s n.s IV. THE EAFT-1 WITH THE EXTENSION CASES Our contrbuton n ths paper s to ntroduce fve extended cases whch wll be used as a gudance to decde the element creaton drectly. The frst two cases are the normal cases as n SAFT whle the thrd, fourth and ffth cases are newly created one. These drect approach nvolved n the consderaton of trangular element creaton procedure depends on the condton of objects le wthn the crcle or at the crcum crcle. The objects here mean any actve nodes or actve edges. Ths s where the constructon of the trangular element wll be based on. Case 1: The frst case (Case 1) s the smplest one. Let say the current base edge beng consdered s (a,b), as shown n Fgure 4a. A crcle at centre IP wth radus followng the emprcal rule s constructed. If there s no object lyng wthn the crcle, the IP wll turn out to be the thrd vertex for the trangular element constructon. The base edge wll be the sde of the trangle. The new second and thrd sdes wll be (a,c) and (a,b). Snce all three sdes have equal length, the trangular element formed wll be an equlateral trangle element as llustrated n Fgure 4b. (8)

4 , July 6-8, 2011, London, U.K. Fg. 4a. No object le wthn the crcle Fg. 4b. An equlateral trangle s constructed Case 2: Let say the base edge beng consdered s (a,b) as shown n Fgure 5a to descrbe the constructon of a trangular element based on Case 2. A crcle at center IP wth radus followng the emprcal rule s constructed agan. There are two types of objects that le wthn the crcle. Frst s node d and the second type of object s two actve edges ntersected wth the crcle whch are edge (c,d) and edge (d,e). Among nodes and edges, ths category of extenson cases gves prorty to nodes when t comes to the selecton f both objects occur smultaneously wthn the crcle. If there are multple actve nodes n the crcle, calculate all the dstance of every actve node to the IP. The node whch s closest one to IP s selected as the thrd vertex for trangular element. As llustrated n Fgure 5b, node d s selected as the vertex, therefore, a trangular element s constructed wth edge (a,b), edge (a,d) and edge (d,b) as the three sdes. Fg. 5a. Two types of object le wthn the crcle whch are actve nodes and edges Fg. 5b. Node d s selected as the thrd vertex for trangular element Case 3: At the same tme, there s another trangular element beng constructed automatcally snce the three edges are connected to themselves. Ths condton belongs to Case 3. As llustrated n Fgure 5b, a trangular element s constructed automatcally when edge (b,d) s formed. The three edges (b,c), (c,d) and (b,d) are connected to themselves, and they become the sdes of the second trangular element. Case 4: Fgures 6a and 6b show the constructon of trangulaton element followng the fourth case (Case 4). Let say the base edge beng consdered s (a,b) where a crcle wth radus followng the emprcal rule and at centre IP had been constructed. Based on the fgure, t can be seen that the only object nvolved s an actve edge whch s ntersected wth the crcle. The actve edge ntersected wth the crcle s (b,c) as llustrated n Fgure 6a. The ntersecton pont of the crcum crcle wth the actve edge (b,c) has been marked as ponts p1 and p2. Based on the algorthm of EAFT, we need to determne the length between the ntersecton ponts. In other words, f referrng to Fgure 6a, we need to determne the length between pont p1 and pont p2. If the length s less than the radus of the crcle, therefore, the ntersected actve edge s dsregarded. Instead, the IP wll become the thrd vertex of the trangular element. Based on Fgure 6b, the IP has become node d n whch a trangle element s formed wth edges (a,b), (a,d) and (b,d) as the three sdes of the trangular element. Fg. 6a. An actve edge ntersected wth the crcle Fg. 6b. The IP become the new actve node for trangular element Case 5: Slghtly dfferent from Case 4, f the length between the ntersecton pont p1 and p2 s more than the length of the radus, the actve edge ntersected wth the crcle wll be consdered n whch the node of the actve edge wll be selected as the thrd vertex. In other words, referrng to Fgure 7a, snce the length of pont p1 and pont p2 s more than the length of the radus, therefore, node c, whch s the node assocated wth actve edge (b,c) wll be the vertex to form trangle element as llustrated n Fgure 7b. Ths condton belongs to Case 5. However, f there are multple edges ntersected wth the crcle and they are all satsfyng the condton of Case 5, therefore, the assocated node whch s the closest to IP wll be selected as the thrd vertex. Fg. 7a. The ntersected actve edge s (b,c). The length of ntersecton pont p1 and p2 wth the crcle s more than the length of radus Fg. 7b. The trangular element s constructed by connectng the node assocated wth the ntersected actve edge wth the base edge

5 , July 6-8, 2011, London, U.K. The general scheme of EAFT-1s demonstrated as n Fgure 8. It must be noted that most of the basc steps n EAFT-1 s stll followng the SAFT except that the constructon of the element s now based on fve extended cases. No Defne grd cell parameter at background grd and dscretsed boundary curve. Select shortest edge n the Front Construct element based on 5 cases Update the Front lst Empty front V. RESULTS Yes Fg. 8. The general scheme of Enhanced Advancng Front Technque -1. END Our approach s appled at a rectangular computatonal doman as llustrated n Fgure 9 wth ts boundary segment dscretzed nto a set of boundary edges. We use the default value for the sze parameter whch s fve percent from the length of the dagonal of the background grd. The grd generaton parameters on the background grd are specfed to be and s 1 at each pont of the background grd. The result of ntal unstructured mesh wth EAFT-1 s llustrated n Fgure 10. No re-order Front or erasng a few exstng element are needed durng the element creaton procedure snce our extenson cases offer a drect approach of decdng element creaton when the problem descrbe n secton II occur. The total number of element generated usng our approach s 72 and each of the trangular elements has been numbered from 1 to 72. In order to examne the qualty of the mesh, the EquSze Skew, Q whch s the measure of skewness s used where t s defned as [11] Q S eq S S eq In the above equaton, S s the area of the mesh elements, S s the maxmum area of equlateral trangle the eq crcumscrbng radus of whch s dentcal to that of the mesh element. The value of the examned qualty based on ths equaton provded by [11] s n the range of 0 1 where Q 0 f the element s equlateral Q EAS trangle and Q 1f the trangular element s degenerate (poorly shape). It must be noted that generally, hgh-qualty meshes poses average value of Q 01. for two dmensonal doman [11]. Fgure 11a-11c llustrate the correspondng trangular element n the mesh wth the range of the qualty examned. It can be seen that 83.33% of the elements are n the range of 0 Q 0. 1 whch can be consdered as a hgh qualty meshes. Therefore, the trangular elements generated usng our approach of extendng the normal cases to fve cases n the standard AFT for element generaton procedure prove to work well when there s not normal condtons occur as descrbed n secton II. In order to prove that the trangular mesh work well and s approprate for computatonal analyss, the governng equaton of radatve heat transfer has been ncorporated wth the mesh. Usng FLUENT verson 6.0, smulaton had been conducted to solve the radatve heat transfer by usng the Dscrete Ordnate Methods. Snce ths s a conceptual model, we mposed the value of the wall temperature (K) so that t can be used as boundary values n the calculaton. The smulaton s conducted untl convergence s reached. Fgure 12 shows the flue gas temperature dstrbuton contours between the walls respectvely. As shown n the smulaton result, the temperature dstrbuton of the flue gas s nonunform, whch wll further nfluence the heat transfer between the walls. (9) Fg. 9. Rectangular computatonal doman wth a set of boundary edges Fg. 11a. Element wth qualty 0 Q 0. 1 Fg. 10. The resulted unstructured trangular mesh.

6 , July 6-8, 2011, London, U.K. ACKNOWLEDGMENT The authors thanks the Mnstry of Hgher Educaton, Malaysa and Unverst Teknkal Malaysa Melaka (UTeM) for sponsorng the research work REFERENCES Fg. 11b. Element wth qualty 0. 2 Q 0. 3 Fg. 11c. Element wth qualty 0. 4 Q 0. 5 [1] P. R. M. Lyra and D. K. Carvalho, "A computatonal methodology for automatc two-dmensonal ansotropc mesh generaton and adaptaton," Journal of the Brazlan Socety of Mechancal Scences and Engneerng, vol. 28, 2006, pp [2] M. Farrashkhalvat and J. P. Mles, Basc structured grd generaton wth an ntroducton to unstructured grd generaton: Butterworth Henemann, 2003, ch.8. [3] R. Lohner, "Progress n Grd Generaton va the Advancng Front Technque," Engneerng wth Computers, 1996, pp [4] N. Kovac, S. Gotovac, and D. Poljak, "A New Front Updatng Soluton Appled to Some Engneerng Problems," Archves of Computatonal Methods n Engneerng, vol. 9, 2002, pp [5] J. Zhu, T. Blacker, and R. Smth, "Background overlay grd sze functons," n Proceedngs of the 11th nternatonal meshng roundtable, 2002, pp [6] E. Seveno, "Towards an adaptve advancng front method," n 6th Internatonal Meshng Roundtable, 1997, pp [7] J. Perare, J. Pero, and K. Morgan, "Advancng front grd generaton," n Handbook of Grd Generaton, N. P. Weatherll, B. K. Son, and J. F. Thompson, Eds.: CRC Press LLC, [8] G. Stefands, B. Merc, G. Heynderckx, and G. Marn, "Gray/nongray gas radaton modelng n steam cracker CFD calculatons," AIChE Journal, vol. 53, 2007, pp [9] H. K. Versteeg and W. Malalasekera, An Introducton to Computatonal Flud Dynamcs. England: Pearson Educaton, 2007, ch. 13. [10] M. F. Modest, Radatve Heat Transfer, 2 ed.: Academc Press, [11] "Gambt 2.3 Documentaton - Gambt User Gude." vol. 2010: FLUENT Incorporated. Fg. 12. The contour of flue gas temperature dstrbuton between walls. VI. CONCLUSION In the present work of ntal unstructured trangular mesh generaton usng EAFT-1, the algorthm stll uses SAFT method of specfyng the grd cell parameter at the background mesh n order to control the mesh sze as well as stll usng the emprcal rule to construct the crcle for element consderaton. The only dfferent s that we proposed the normal case n the SAFT to be extended to fve cases n order to encounter the problem of conflct or undecded element creaton durng the mesh generaton procedure. Our EAFT-1 approach of ncorporatng the extended cases of element creaton s able to tackle the problem of element creaton drectly by consderng the enttes that le wthn the crcle constructed. The examned results of ntal mesh proved that the approach s able to produce hgh qualty meshes. The smulaton results obtaned from the FLUENT also support our fndngs n EAFT-1 for effectvely approxmatng the radaton ntensty and temperature values n the two dmensonal doman. Zurada Abal Abas was born n Perak, Malaysa n She receved the BSc n Industral Mathematcs wth frst class honors from Unverst Teknolog Malaysa, Malaysa n 2002 and MSc n Operatonal Research from London School of Economcs, UK n Her current research nterests nclude mesh generaton, numercal methods and operatonal research technques. Shaharuddn Salleh receved the BA n Mathematcs from Calforna State Unversty, MSc. n Mathematcs from Portland State Unversty, Oregon and Ph.D n Computatonal Mathematcs from UTM. He s currently a Professor at Faculty of Scence, Unverst Teknolog Malaysa. Hs current research nterests nclude numercal modelngs and smulatons, graph theoretcal applcatons, moble computng and parallel algorthms. Hs has wrtten four books whch nclude three at the nternatonal level. There are also 65 techncal papers n varous journals and conferences at the natonal and nternatonal levels.

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

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Kiran Joy, International Journal of Advanced Engineering Technology E-ISSN

Kiran Joy, International Journal of Advanced Engineering Technology E-ISSN Kran oy, nternatonal ournal of Advanced Engneerng Technology E-SS 0976-3945 nt Adv Engg Tech/Vol. V/ssue /Aprl-une,04/9-95 Research Paper DETERMATO O RADATVE VEW ACTOR WTOUT COSDERG TE SADOWG EECT Kran

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

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

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

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

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

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

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

More information

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

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

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

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Obstacle-Aware Routing Problem in. a Rectangular Mesh Network

Obstacle-Aware Routing Problem in. a Rectangular Mesh Network Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department

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

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

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

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

TN348: Openlab Module - Colocalization

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

More information

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

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

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

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

More information

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

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More 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

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

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

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

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

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

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

More information

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons

More information

Related-Mode Attacks on CTR Encryption Mode

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

More information

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

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell

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

Cell Count Method on a Network with SANET

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

More information

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

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

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

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

More information

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,

More information

Lecture #15 Lecture Notes

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

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

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

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

Simulation of a Ship with Partially Filled Tanks Rolling in Waves by Applying Moving Particle Semi-Implicit Method

Simulation of a Ship with Partially Filled Tanks Rolling in Waves by Applying Moving Particle Semi-Implicit Method Smulaton of a Shp wth Partally Flled Tanks Rollng n Waves by Applyng Movng Partcle Sem-Implct Method Jen-Shang Kouh Department of Engneerng Scence and Ocean Engneerng, Natonal Tawan Unversty, Tape, Tawan,

More information

Cordial and 3-Equitable Labeling for Some Star Related Graphs

Cordial and 3-Equitable Labeling for Some Star Related Graphs Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,

More information

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

USING GRAPHING SKILLS

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

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

The Codesign Challenge

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

More information

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

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

More information

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

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

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

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

More information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

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

More information

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

F Geometric Mean Graphs

F Geometric Mean Graphs Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.

More information

Structured Grid Generation Via Constraint on Displacement of Internal Nodes

Structured Grid Generation Via Constraint on Displacement of Internal Nodes Internatonal Journal of Basc & Appled Scences IJBAS-IJENS Vol: 11 No: 4 79 Structured Grd Generaton Va Constrant on Dsplacement of Internal Nodes Al Ashrafzadeh, Razeh Jalalabad Abstract Structured grd

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

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

An adaptive gradient smoothing method (GSM) for fluid dynamics problems

An adaptive gradient smoothing method (GSM) for fluid dynamics problems INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS Int. J. Numer. Meth. Fluds 2010; 62:499 529 Publshed onlne 17 March 2009 n Wley InterScence (www.nterscence.wley.com)..2032 An adaptve gradent smoothng

More information

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

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

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

Intra-Parametric Analysis of a Fuzzy MOLP

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

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

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

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

More information

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

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

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

Optimal Quadrilateral Finite Elements on Polygonal Domains

Optimal Quadrilateral Finite Elements on Polygonal Domains J Sc Comput (2017) 70:60 84 DOI 10.1007/s10915-016-0242-5 Optmal Quadrlateral Fnte Elements on Polygonal Domans Hengguang L 1 Qnghu Zhang 2 Receved: 30 January 2015 / Revsed: 21 January 2016 / Accepted:

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

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

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

Accessibility Analysis for the Automatic Contact and Non-contact Inspection on Coordinate Measuring Machines

Accessibility Analysis for the Automatic Contact and Non-contact Inspection on Coordinate Measuring Machines Proceedngs of the World Congress on Engneerng 008 Vol I Accessblty Analyss for the Automatc Contact and Non-contact Inspecton on Coordnate Measurng Machnes B. J. Álvarez, P. Fernández, J. C. Rco and G.

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

More information

2-Dimensional Image Representation. Using Beta-Spline

2-Dimensional Image Representation. Using Beta-Spline Appled Mathematcal cences, Vol. 7, 03, no. 9, 4559-4569 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.988/ams.03.3359 -Dmensonal Image Representaton Usng Beta-plne Norm Abdul Had Faculty of Computer and

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Query Clustering Using a Hybrid Query Similarity Measure

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

More information

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

ANSYS FLUENT 12.1 in Workbench User s Guide

ANSYS FLUENT 12.1 in Workbench User s Guide ANSYS FLUENT 12.1 n Workbench User s Gude October 2009 Copyrght c 2009 by ANSYS, Inc. All Rghts Reserved. No part of ths document may be reproduced or otherwse used n any form wthout express wrtten permsson

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

THREE-DIMENSIONAL UNSTRUCTURED GRID GENERATION FOR FINITE-VOLUME SOLUTION OF EULER EQUATIONS

THREE-DIMENSIONAL UNSTRUCTURED GRID GENERATION FOR FINITE-VOLUME SOLUTION OF EULER EQUATIONS ICAS 2000 CONGRESS THREE-DIMENSIONAL UNSTRUCTURED GRID GENERATION FOR FINITE-VOLUME SOLUTION OF EULER EQUATIONS Karm Mazaher, Shahram Bodaghabad Sharf Unversty of Technology Keywords: Unstructured grd

More information

Cubic Spline Interpolation for. Petroleum Engineering Data

Cubic Spline Interpolation for. Petroleum Engineering Data Appled Mathematcal Scences, Vol. 8, 014, no. 10, 5083-5098 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.014.4484 Cubc Splne Interpolaton for Petroleum Engneerng Data * Samsul Arffn Abdul Karm

More information

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces 7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr

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