Geometric Error Estimation
|
|
- Mervyn Palmer
- 5 years ago
- Views:
Transcription
1 Geometrc Error Estmaton Houman Borouchak Project-team GAMMA 3 UTT Troyes, France Emal: houman.borouchak@utt.fr Patrck Laug Project-team GAMMA 3 INRIA Pars - Rocquencourt, France Emal: patrck.laug@nra.fr Abstract An essental prerequste for the numercal fnte element smulaton of physcal problems expressed n terms of PDEs s the constructon of an adequate mesh of the doman. Ths frst stage, whch usually nvolves a fully automatc mesh generaton method, s then followed by a computatonal step. One can show that the qualty of the soluton strongly depends on the shape qualty of the mesh of the doman. At the second stage, the numercal soluton obtaned wth the ntal mesh s generally analyzed usng an approprate a posteror error estmator whch, based on the qualty of the soluton, ndcates whether or not the soluton s accurate. The qualty of the soluton s closely related to how well the mesh corresponds to the underlyng physcal phenomenon, whch can be quantfed by the element szes of the mesh. An a posteror error estmaton based on the nterpolaton error dependng on the Hessan of the soluton seems to be well adapted to the purpose of adaptve meshng. In ths paper, we propose a new nterpolaton error estmaton based on the local deformaton of the Cartesan surface representng the soluton. Ths methodology s generally used n the context of surface meshng. In our example, the proposed methodology s appled to mnmze the nterpolaton error on an mage whose grey level s consdered as beng the soluton. eywords-a posteror error estmaton; nterpolaton error; mesh adaptaton; surface curvature. I. INTRODUCTION Dfferent knds of estmators are avalable to a posteror control the error made on a fnte element soluton []. Usng such an estmator, t s possble to control the mesh by h- adaptaton so that the correspondng soluton of the PDE problem has a gven accuracy. Some of these estmators are based on the nterpolaton error and, n ths sense, are purely geometrc snce they gnore the nature of the operator consdered. Ths knd of estmators has been studed by many authors [2] [5]. However, most of these studes le on the fact that a parameter h, representng the sze of the elements, s small or tends to zero, and thereby they are asymptotc studes. The estmator s thus based on approprate Taylor expansons, and gves n ths manner some ndcatons on the admssble sze h. Nevertheless, as ths sze s not necessarly small, we propose a novel approach whch, although closely related to the prevous ones, does not assume any partcular hypothess on ths parameter, and therefore s probably more justfed. Our approach s besdes rather smlar, n ts sprt, to certan solutons used n a dfferent doman, namely the mesh generaton of parametrc patches [6] [8]. Secton 2 gves the mathematcal formulaton of the problem and revews the related works. Secton 3 ntroduces a new class of measures to quantfy the nterpolaton error dependng on the local deformaton or curvature of the Cartesan surface correspondng to the soluton. A numercal example s llustrated n Secton 4 and fnally, the last secton provdes a bref concluson. II. DEFINITION OF THE PROBLEM AND STATE OF THE ART Let Ω be a doman of R d wth d =, 2 or 3 and let T be a smplcal mesh of Ω composed of lnear smplces P or quadratc smplces P 2. We suppose that, n order to solve a problem gven n terms of PDEs on Ω, we have made a fnte element computaton on Ω usng T, and we have obtaned the scalar soluton u T. Denotng by u the exact soluton, the problem frstly conssts n evaluatng the gap e T = u u T between u and u T representng the error nvolved by the fnte element soluton, and secondly deducng n general by boundng ths gap another mesh T such that the estmated gap between u and the soluton u T usng mesh T s bounded by a gven threshold. Several ponts must be more precsely explaned: how to quantfy the gap e T between u and u T? how to use the latter nformaton for buldng a new mesh on whch the gap between the correspondng fnte element soluton and the exact soluton s bounded by a gven threshold? The soluton u T obtaned by the fnte element method s not nterpolatng.e. the soluton obtaned at the nodes of T does not concde wth the exact value of u at these nodes. Moreover, for each element of the mesh, t cannot be guaranteed that the soluton u T concde wth the exact value of u at one pont at least of the element. Then, t seems dffcult to explctly quantfy the gap e T. However, the drect study of ths gap has been dealt n several works [9]. But, n the general case, ts quantfcaton remans an open problem. Consequently, other ndrect approaches have been proposed to quantfy or rather bound ths gap. Let us denote by ũ T the functon nterpolatng u on the mesh T
2 whch s a pecewse lnear or quadratc functon, dependng on the degree of the elements of T and by ẽ T the gap u ũ T between u and ũ T, called the nterpolaton error on u along mesh T. To be able to quantfy the gap e T, we suppose the followng relaton holds Céa s lemma: e T C ẽ T where. denotes a norm and C s a constant not dependng on T. In other words, we suppose that the fnte element error s bounded by the nterpolaton error. The orgnal problem s then smplfed by consderng the followng problem: gven an nterpolaton ũ T of u along a mesh T, how to buld another mesh T for whch the nterpolaton error s bounded by a gven threshold? As ũ T can be seen as a dscrete representaton of u, the problem now reduces to a characterzaton of meshes for whch the nterpolaton error s bounded by ths threshold. Ths problem has been the subject of several studes see for nstance [5] and, n most of them, the examnaton of a measure of the nterpolaton error provdes some constrants assocated wth the mesh elements. In the context of mesh adaptaton methods, h- methods or sze adaptaton are partcularly relevant, and the constrants are specfed n terms of element szes. In the followng, some classcal measures of ths error are recalled, as well as resultng constrants on the mesh elements. To quantfy the nterpolaton error, two knds of measures can be consdered: contnuous or dscrete. A classcal contnuous measure of ths error s the square of the L 2 norm of ẽ T : ẽ T 2 L = ẽ 2 2 T dω = ẽ 2 L 2 T T wth ẽ 2 L = ẽ 2 2 dω, where ẽ s the nterpolaton error on each element of T, and dω s an elementary volume of R d. In two dmensons, consderng lnear elements and assumng that the Hessan H u of u restrcted to the elements s constant, Nadler [0] gves an analytcal expresson of the measure of the nterpolaton error ẽ 2 L on as a functon of 2 the area A of and the quanttes d = 2 at H u a second drectonal dervatves along the edges where a s the vector jonng vertces and + of : ẽ 2 dx dy = A 80 2 d + d 2. Berzns [] extends ths result n three dmensons for lnear elements and shows stll assumng that the Hessan H u of u s constant n element that: 2 e 2 T dx dy dz = V d + d d d 4 d 2 d 5 d 3 d 6 where V s the volume of and quanttes d are smlar to the 2D case. Berzns deduces from ths expresson a measure of the qualty of the elements, and thus characterzes the mesh. However, t s unclear to nterpret ths nformaton n terms of element sze. The extenson of these results to the case of an arbtrary Hessan H u remans open. An alternatve measure, well suted to problem solvng by the fnte element method, conssts n consderng Sobolev norms of ẽ, n partcular the H norm whose square s defned by: ẽ 2 H = ẽ2 + ẽ 2 dω, where represents the gradent and. s the usual Eucldan norm. In two dmensons and consderng lnear elements, Zlamal [2], as also Babuska and Azz [2], ndependently propose an upper bound of ẽ 2 H by the semnorm u 2 of the Sobolev space H 2 whose square s defned by: u 2 2 = 2 2 u x u L x y u 2 L y 2. 2 L 2 Indeed, they show that: ẽ 2 H Γθ u 2, where Γθ s a functon dependng on the dameter of and ts nternal angles. An extenson n three dmensons of ths relaton has been proposed by rzek [3]. Agan, t seems dffcult to establsh a constrant n terms of element sze for ths norm. Another measure, whch s smpler, conssts n consderng the L 2 norm of the gradent of ẽ. It s gven by: ẽ 2 L = ẽ 2 2 dω. An explct expresson of ths error measure related to lnear elements has been proposed by Bank and Smth [4] n two dmensons n the case where the Hessan H u s constant n. An approxmaton of ths expresson s gven by: a 2 d 2 ẽ 2 L A They use ths measure for relocatng the nodes of the mesh n order to mnmze the error. Among the dscrete measures, one can menton the L norm of the nterpolaton error, whch s defned by: ẽ L = max x ẽ x,,
3 where pont x sweeps element. Smlarly, assumng that Hessan H u s constant on each element, Manz et al. [5] propose an approxmaton of the measure ẽ L from an expresson of error e gven by D Azevedo and Smpson [3] for lnear elements n two dmensons: ẽ L δ 6 deth u A 2, where δ = a T H u a, H u beng the absolute value of the Hessan of u. Usng ths approxmaton, they show that f the sze h of along all drectons verfes h T H u h 3 ε then ẽ L ε. Ths sze constrant proves well-suted to h-methods and the results obtaned by the authors show the smplcty and the effcency of ths method. In the context of surface trangulaton by lnear elements, Anglada et al. [7] propose, n the general case where the Hessan of u s arbtrary, an upper bound of ẽ L gven by: ẽ L 2 9 sup pq T H u x pq, x where pont x sweeps element, p s the vertex of such that the barycentrc coordnate of x n wth respect to p s maxmal, and q the ntersecton pont of the straght lne p x wth the edge of opposte to p. They nfer that the nterpolaton error s bounded by a threshold f element les n regons defned and centered at the vertces of. Therefore, these regons can be defned at every ponts of the doman and then consttute constrants for the element szes. Accordng to the above descrpton of dfferent works on the subject although ths lst s far from beng exhaustve, a dscrete measure lnkng error bound and mesh element sze seems more approprate n the scope of error estmaton for mesh adaptaton. The followng secton detals ths ssue. III. A NOVEL APPROACH BASED ON SURFACE GEOMETRY In ths secton, we recall the approach proposed by [6] whch consders soluton u as a Cartesan surface, and we gve a new error estmaton n the case of ansotropc geometrc surface meshng. Let Ω be the computatonal doman, T Ω a mesh of Ω, and uω the physcal soluton obtaned on Ω usng the mesh T Ω. The couple T Ω, uω defnes a Cartesan surface Σ u T. Gven Σ u T, the problem of mnmzng the nterpolaton error conssts n defnng an optmal mesh T opt Ω of Ω for whch surface Σ u T opt would be as smooth as possble. For ths purpose, we propose to locally characterze the surface n the neghborhood of a vertex. Two methods are ntroduced: the frst one, based on local deformaton, can be appled for an sotropc adaptaton whle the second one, based on local curvature, s sutable to an ansotropc adaptaton. A. Local deformaton of a surface The man dea conssts n locally characterzng the devaton of order 0 of a surface mesh Σ u T n the neghborhood of a vertex wth respect to a reference plane, n partcular the tangent plane to the surface at ths vertex. Ths devaton can be quantfed by consderng the Hessan along the normal to the surface.e. the second fundamental form of the surface. Let P be a vertex of the soluton surface Σ u T. Locally, n the neghborhood of P, ths surface admts a parametrc representaton σu, v, u, v beng the parameters, wth P = σ0, 0. The Taylor expanson at order 2 to σ n the neghborhood of P gves: σu, v = σ0, 0 + σ u u + σ v v + 2 σ uu u σ uv u v + σ vv v 2 + ou 2 + v 2 e, where e =,,. If νp denotes the normal to the surface at P, then the quantty νp, σu, v σ0, 0.,. denotng the dot product representng the gap between pont σu, v and the tangent plane at P, expressed by: νp, σ 2 uu u νp, σ uv u v + νp, σ vv v 2 + ou 2 + v 2, s therefore proportonal to the second fundamental form of the surface for u 2 + v 2 small enough. The local deformaton of the surface at P s defned as the maxmum gap between vertces adjacent to P and the tangent plane to the surface at P. If P denotes these vertces, then the local deformaton εp of the surface at P s gven by: εp = max νp, P P. Consequently, the optmal mesh of Ω for Σ u T s a mesh whose sze at each node p s nversely proportonal to εp where P = p, up. More formally, the optmal sze h opt p assocated wth a node p reads: h opt = hp ε εp, where ε denotes the mposed devaton threshold and hp the element sze n the neghborhood of p n mesh T Ω. It can be notced that the local deformaton s a very smple characterzaton of the local devaton of the surface, whch does not requre the explct computaton of the Hessan of the soluton. The only dsadvantage of ths measure s that the resultng adaptve meshes can only be sotropc. In the same context local devaton mnmzaton, the noton of curvature provdes a more precse and ansotropc analyss of ths devaton.
4 B. Local curvature of a surface The analyss of the local geometrc curvature of the surface representng the soluton can be used to mnmze also the devaton of order between the tangent planes of the nterpolatng soluton and those of the exact soluton. Indeed, n the context of sotropc surface mesh generaton, we show [8] that the two devatons of order 0 and of the surface are bounded by a gven threshold f, at any pont of the surface, the sze of the surface elements s proportonal to the mnmal radus of curvature. Let P = p, up be a vertex of Σ u T, let ρ P and ρ 2 P wth ρ P ρ 2 P be the two prncpal rad of curvature at P, and let e P, e 2 P be the two unt vectors n the correspondng prncpal drectons. The deal sze for a surface mesh element at P s [8]: h Σ optp = γ ρ P, where γ s a coeffcent dependng on the mposed devaton threshold. Ths sze s defned n the tangent plane to the surface at P. In the reference system P, e P, e 2 P of ths plane, the deal sze n a gven drecton s a vector v P = h Σ e P + h Σ 2 e 2 P whose components h Σ and satsfy the followng relaton: h Σ 2 h Σ h Σ 2 I 2 γ 2 ρ 2 P h Σ h Σ 2 =. Ths expresson, where I 2 denotes the 2 2 dentty matrx, represents the equaton of a crcle wth center P and radus γ ρ P n the tangent plane to the surface at P. By an orthogonal projecton of ths crcle n the plane of Ω, the sze constrant at p s obtaned. If v p and v 2 p are the respectve orthogonal projectons of e P and e 2 P n the plane of Ω, then ths sze constrant n the reference system p,, j =, 0 and j = 0, s gven by: h h 2 P T I 2 γ 2 ρ 2 P where P = v p v2 p P h h 2 =, and h, h 2 are the coordnates n the reference system p,, j of the projecton of the deal sze vector v P n the plane of Ω. Ths relaton defnes, among others, a metrc generally ansotropc at p. Ths metrc may produce an mportant number of elements owng to the sotropc feature of surface elements. To mnmze ths number of elements, and n the context of ansotropc geometrc surface meshng, we have establshed [7] a relaton whch s smlar to the sotropc case and depends on both prncpal rad of curvature. Now, the deal sze of the surface elements s gven by a metrc, called geometrc, whch can be expressed at a vertex P of Σ u T : h Σ h Σ γ 2 2 ρ 2 P 0 h Σ =, 0 η 2 ρ 2 2 P h Σ 2 where γ = 2 ε 2 ε, η = 2 ε ρ P ρ 2 P 2 ε ρ P ρ 2 P, n whch ε s the prescrbed gap n drecton e P. Ths relaton generally represents an ellpse n the tangent plane to the surface at P whch contaned a crcle n the sotropc case. Agan, by projectng ths ellpse n the plane of Ω, the correspondng metrc at p n ths plane s obtaned. Ths measures also provde a means to control the nterpolaton error n H norm boundng the error on the soluton but also on ts dervatves, and thereby seams more adequate compared to an sotropc measure. In practce, to compute the local curvature, several steps are necessary. Frst, at each vertex of the surface mesh, the normal hence the gradent s determned by a weghted average of unt normals to the adjacent elements. Then, n the local reference system composed of the tangent plane and the normal assocated wth each vertex, a quadrc centered at ths vertex and approachng at best the adjacent vertces s bult. Afterwards, the Hessan s locally approxmated by the Hessan to ths quadrc. nowng the gradent and the Hessan of the soluton at the nodes of T Ω, the curvatures and prncpal drectons at each vertex of surface Σ u T are obtaned. IV. NUMERICAL EXAMPLE To llustrate the proposed method, we consder an mage of pxels and the feld of ts grey levels. Fgure shows the orgnal color mage, a reproducton of The Adoraton of the Mag crca 500. Its author was the North Italan Renassance panter Andrea Mantegna, whose early career was shaped by mpressons of Florentne works. The mage s frstly represented by a regular grd of quadrlaterals, defnng ts ntal mesh. The analyss of the local geometrc curvature of the Cartesan surface representng the feld leads to the determnaton of an ansotropc geometrc sze map assocated wth the ntal mesh, n order to bound the nterpolaton error here ε = 0.. Fgure 2 general vew and 3 close-up show the adapted ansotropc mesh. Ths mesh contans 227,557 vertces and 453,265 trangles. It has been realzed usng the ansotropc adaptve mesh generator BL2D [8]. The resultng nterpolaton error s n average. V. CONCLUSION A novel approach connectng the problem of a posteror error estmaton and some technques of surface meshng has been ntroduced. It consttutes an alternatve method to classcal approaches usng the Hessan of the soluton.
5 Fgure. Orgnal color mage pantng by Andrea Mantegna, crca 500. To llustrate our methodology, a numercal example has been presented. The proposed a posteror error estmaton can be used n any computatonal problem where a statc feld must be calculated. In the case of dynamc felds, the adaptve computaton s consttuted by a calculaton loop: at each teraton, begnnng at the same global ntal tme and endng at a dfferent tme, a combnaton of the current metrc and the prevous metrcs s appled. REFERENCES [] M. Fortn, Estmaton a posteror et adaptaton de mallages, Rev. Europ. des Éléments Fns, vol. 9, n o 4, [2] I. Babuska and. Azz, On the angle condton n the fnte element method, Sam J. Numer. Anal., vol. 3, n o 2, 976, pp [3] E.F. D Azevedo and B. Smpson, On optmal trangular meshes for mnmzng the gradent error, Numer. Math., vol. 59, 99, pp [4] S. Rppa, Long and thn trangles can be good for lnear nterpolaton, Sam J. Numer. Anal., vol. 29, n o, 992, pp [5] M. Berzns, Mesh Qualty : a Functon of Geometry, Error Estmates or Both?, Eng. wth Comp., vol. 5, 999, pp [6] X. Sheng and B.E. Hrsch, Trangulaton of trmmed surfaces n parametrc space, Comp. Ad. Des., vol. 24, n o 8, 992, pp [7] M.V. Anglada, N.P. Garca, and P.B. Crosa, Drectonal adaptve surface trangulaton, Comp. Ad. Des., vol. 6, 999, pp [8] H. Borouchak, P. Laug, and P.L. George, Parametrc Surface Meshng Usng a Combned Advancng-Front Generalzed-Delaunay Approach, Int. Journal for Numercal Methods n Engneerng, vol. 49, 2000, pp [9] R. Verfürth, A Revew of A Posteror Error Estmaton and Adaptve Mesh-Refnement Technques, Wley & Teubner, 996. [0] E.J. Nadler, Pecewse lnear best l 2 approxmaton on trangles, Approxmaton Theory V : Proc. Ffth Inter. Symposum on Approx. Theory, Academc Press, New York, 986, pp [] M. Berzns, Soluton-based Mesh Qualty for Trangular and Tetrahedral Meshes, Proc. 6th Internatonal Meshng Roundtable, Sanda Lab., 997, pp [2] M. Zlamal, On the fnte element method, Numer. Math., vol. 2, pp , 968. [3] M. rzek, On the maxmum angle condton for lnear tetrahedral elements, Sam J. Numer. Anal., vol. 29, n o 2, 992, pp [4] R.E. Bank and R.. Smth, Mesh smoothng usng a posteror error estmates, Sam J. Numer. Anal., vol. 34, n o 3, 997, pp [5] C. Manz, F. Rapett, and L. Formagga, Functon approxmaton on trangular grds : some numercal results usng adaptve technques, Appl. Numer. Math., vol. 32, n o 4, 2000, pp [6] P.J. Frey and H. Borouchak, Surface meshng usng a geometrc error estmate, Int. Journal for Numercal Methods n Engneerng, vol. 58, 2003, pp [7] P. Laug and H. Borouchak, Interpolatng and Meshng 3-D Surface Grds, Int. Journal for Numercal Methods n Engneerng, vol. 58, 2003, pp [8] P. Laug and H. Borouchak, The BL2D Mesh Generator Begnner s Gude, User s and Programmer s Manual, INRIA Techncal Report RT-094, July 996.
6 Fgure 2. Adapted mesh correspondng to the nterpolaton error ε = 0.. Fgure 3. Enlargement of a selected regon.
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 information2x 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 informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationSupport 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 informationSimplification of 3D Meshes
Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng
More informationHigh-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 informationA 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 informationAn 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 informationHarmonic Coordinates for Character Articulation PIXAR
Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationAnalysis 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 informationVery simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)
Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes
More informationProper 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 informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationR 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 informationS1 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 informationLecture 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 informationQuality 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 informationAccounting 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 informationMathematics 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 informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationImprovement 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 informationF 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 informationContent 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 informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationNUMERICAL 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 informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationCluster 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 informationProgramming 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 informationA 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 informationMultiblock 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 informationA Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves
A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017
More informationAn 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 informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationKinematics 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 informationS.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 informationParameterization of Quadrilateral Meshes
Parameterzaton of Quadrlateral Meshes L Lu 1, CaMng Zhang 1,, and Frank Cheng 3 1 School of Computer Scence and Technology, Shandong Unversty, Jnan, Chna Department of Computer Scence and Technology, Shandong
More informationLecture #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 informationModule 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 informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationInterpolation 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 information6.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 informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationAn 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 informationModeling, 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 informationParallelism 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 informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationCompiler 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 information3D 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 informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationBarycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.
Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space
More informationSLAM 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 informationFor 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 informationAn 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 informationHermite 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 informationElectrical 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 informationOptimal 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 informationDiscrete Schemes for Gaussian Curvature and Their Convergence
Dscrete Schemes for Gaussan Curvature and Ther Convergence Zhqang Xu Guolang Xu Insttute of Computatonal Math. and Sc. and Eng. Computng, Academy of Mathematcs and System Scences, Chnese Academy of Scences,
More informationUNIT 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 informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
More informationComputers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence
Computers and Mathematcs wth Applcatons 57 (009) 87 95 Contents lsts avalable at ScenceDrect Computers and Mathematcs wth Applcatons journal homepage: www.elsever.com/locate/camwa Dscrete schemes for Gaussan
More informationStructured 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 informationIn the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline,
Dscrete Farng of Curves and Surfaces Based on Lnear Curvature Dstrbuton R. Schneder and L. Kobbelt Abstract. In the planar case, one possblty to create a hgh qualty curve that nterpolates a gven set of
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar
Internatonal Journal of Scentfc & Engneerng Research Volume 7 Issue 5 May-6 34 Some Polygonal Sum Labelng of Bstar DrKAmuthavall SDneshkumar ABSTRACT- A (p q) graph G s sad to admt a polygonal sum labelng
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationDiscretization of Functionally Based Heterogeneous Objects
Dscretzaton of Functonally Based Heterogeneous Objects Elena Kartasheva Insttute for Mathematcal Modelng Russan Academy of Scence Moscow, Russa ekart@mamod.ru Oleg Fryaznov Insttute for Mathematcal Modelng
More informationA Unified, Integral Construction For Coordinates Over Closed Curves
A Unfed, Integral Constructon For Coordnates Over Closed Curves Schaefer S., Ju T. and Warren J. Abstract We propose a smple generalzaton of Shephard s nterpolaton to pecewse smooth, convex closed curves
More informationResearch Article Quasi-Bézier Curves with Shape Parameters
Hndaw Publshng Corporaton Appled Mathematcs Volume 3, Artcle ID 739, 9 pages http://dxdoorg/55/3/739 Research Artcle Quas-Bézer Curves wth Shape Parameters Jun Chen Faculty of Scence, Nngbo Unversty of
More informationSnakes-based approach for extraction of building roof contours from digital aerial images
Snakes-based approach for extracton of buldng roof contours from dgtal aeral mages Alur P. Dal Poz and Antono J. Fazan São Paulo State Unversty Dept. of Cartography, R. Roberto Smonsen 305 19060-900 Presdente
More information3D 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 informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationLoop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation
Loop Transformatons for Parallelsm & Localty Last week Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Scalar expanson for removng false dependences Loop nterchange Loop
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationAn 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 informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationEnhanced Advancing Front Technique with Extension Cases for Initial Triangular Mesh Generation
, 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
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationSome Tutorial about the Project. Computer Graphics
Some Tutoral about the Project Lecture 6 Rastersaton, Antalasng, Texture Mappng, I have already covered all the topcs needed to fnsh the 1 st practcal Today, I wll brefly explan how to start workng on
More informationModeling of the Absorption of the Electromagnetic Wave Energy in the Human Head Induced by Cell Phone
Journal of Appled Mathematcs and Physcs, 14,, 179-184 Publshed Onlne November 14 n ScRes. http://www.scrp.org/ournal/amp http://dx.do.org/1.436/amp.14.114 Modelng of the Absorpton of the Electromagnetc
More informationAmnon Shashua Shai Avidan Michael Werman. The Hebrew University, objects.
Trajectory Trangulaton over Conc Sectons Amnon Shashua Sha Avdan Mchael Werman Insttute of Computer Scence, The Hebrew Unversty, Jerusalem 91904, Israel e-mal: fshashua,avdan,wermang@cs.huj.ac.l Abstract
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationAn 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 informationJournal of Computational Physics
Journal of Computatonal Physcs 230 (2011) 2540 2561 Contents lsts avalable at ScenceDrect Journal of Computatonal Physcs journal homepage: www.elsever.com/locate/jcp A grd based partcle method for solvng
More informationInverse-Polar Ray Projection for Recovering Projective Transformations
nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced
More informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationFeature-Preserving Mesh Denoising via Bilateral Normal Filtering
Feature-Preservng Mesh Denosng va Blateral Normal Flterng Ka-Wah Lee, Wen-Png Wang Computer Graphcs Group Department of Computer Scence, The Unversty of Hong Kong kwlee@cs.hku.hk, wenpng@cs.hku.hk Abstract
More informationCable optimization of a long span cable stayed bridge in La Coruña (Spain)
Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span
More informationType-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 informationModule 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 informationInjective Shape Deformations Using Cube-Like Cages
309 Injectve Shape Deformatons Usng Cube-Lke Cages Jr Kosnka 1 and Mchael Barton 2 1 Unversty of Oslo, jr.kosnka@cma.uo.no 2 Technon, barton@cs.technon.ac.l ABSTRACT The present paper nvestgates an applcaton
More informationAdaptive Fairing of Surface Meshes by Geometric Diffusion
Adaptve Farng of Surface Meshes by Geometrc Dffuson Chandrajt L. Bajaj Department of Computer Scences, Unversty of Texas, Austn, TX 78712 Emal: bajaj@cs.utexas.edu Guolang Xu State Key Lab. of Scentfc
More informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationAPPLICATION 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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More information