COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION

Size: px
Start display at page:

Download "COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION"

Transcription

1 INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 202; 2():47-70 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION S. Shojaee *, a,, M. Mohamadan b and N. Valzadeh a a Department of Cvl Engneerng, Shahd Bahonar Unversty, Kerman, Iran b Cvl Engneerng Department, Ferdows Branch, Islamc Azad Unversty, Ferdows, Iran ABSTRACT In the present paper, an approach s proposed for structural topology optmzaton based on combnaton of Radal Bass Functon (RBF) Level Set Method (LSM) wth Isogeometrc Analyss (IGA). The correspondng combned algorthm s detaled. Frst, n ths approach, the dscrete problem s formulated n Isogeometrc Analyss framework. The objectve functon based on complance of partcular locatons of materals n the structure s used and fnd the optmal dstrbuton of materal n the doman to mnmze the complance of the system under a volume constrant. The refnement s employed for constructon of the physcal mesh to be consstent wth the mesh s used for level set functon. Then a parameterzed level set method wth radal bass functons (RBFs) s used for structural topology optmzaton. Fnally, several numercal examples are provded to confrm the valdty of the method. Receved: 5 January 202; Accepted: 30 March 202 KEY WORDS: sogeometrc analyss; topology optmzaton; shape optmzaton; level set method; radal bass functons. INTRODUCTION An extensve development n structural shape and topology optmzaton has been experenced n recent three decades. Consderable researches and varous topology optmzaton methods such as materal dstrbuton method [-4], Sold Isotropc Materal wth Penalzaton (SIMP) methods [5-8], Bubble method [9] and Evolutonary Structural Optmzaton (ESO) method * Correspondng author: S. Shojaee, Department of Cvl Engneerng, Shahd Bahonar Unversty, Kerman, Iran E-mal address: saeed.shojaee@uk.ac.r

2 48 S. Shojaee, M. Mohamadan and N. Valzadeh [0] have been proposed. In recent years, the level set methods [, 2] have been ncorporated nto structural shape and topology optmzaton feld effectvely. The major strength of level set method s that, t s an mplct method for movng nteror and exteror boundares and durng the process; boundares may jon to each other. Among the frst researchers, Sethan and Wegmann [3] extended the level set method n shape optmzaton. In ther work, equvalent stress crtera update level set functons nstead of solvng equatons. Osher and Santosa [4] also apply the level set method to the topology desgn problem of a two-densty nhomogeneous drum membrane. In addton Allare et al [5] and Wang et al [6] studed the structural topology optmzaton by combnng the shape dervatve [7-9] or senstvty analyss wth the level set model. Recently Wang et al [20] and Luo et al [2] have proposed Radal Bass Functons as a means to parametrze level set method. Shojaee and Mohamadan [22-24] have proposed bnary and pecewse constant level set method and combned wth a Merrman-Bence-Osher scheme to solve a structural shape and topology optmzaton problem. There are generally two phases n the structural optmzaton process, the analyss phase and the boundary evoluton phase. The frst phase s usually performed wth the fnte element method (FEM). One drawback of FEM s that some approxmaton s nvolved n the geometrcal defnton of the boundares of the problem doman. Furthermore, the mposton of the essental boundary condtons on the boundares cannot be exactly accomplshed. Also the adaptablty and refnement of the soluton n the FEM requres several communcatons between the dscretzed geometry and the analyss tool whch s qute costly [25, 26]. Isogeometrc Analyss (IGA) has been developed wth the am of ntegratng Non-Unform Ratonal B-Splnes (NURBS) based fnte element analyss nto the CAD. One man dea n developng sogeometrc analyss has been to prevent tme-consumng data converson between CAD systems and the fnte element analyss (FEA) n engneerng problems. IGA s based on Non-Unform Ratonal B-Splnes (NURBS) bass functon appled for both the soluton feld approxmaton and the geometry descrpton. Therefore, CAD and FEA can be unfed effcently n one package. Ths leads to the ablty of modelng complex geometres accurately. Moreover, smple and systematc refnement strateges, exact representaton of common engneerng shapes, robustness and superor accuracy can be acheved n comparson wth the conventonal fnte element method. Accordng to these features, sogeometrc analyss s expected to become a powerful computatonal approach n the analyss of varous engneerng problems; as t has already been appled to structural problems, flud mechancs, flud-structure nteracton, structural optmzaton [27-30]. Isogeometrc shape optmzaton has been dscussed by Cho et al. [3], Wall et al. [32], Nagy et al. [33], Qan [34], Seoa et al [35] and Shojaee et al [36] recently. The valdty and effcency of the approaches have been verfed n a good manner. The present paper proposes an ntegrated optmzaton approach based on the concept of sogeometrc analyss and Radal Bass Functon (RBF) level set method. The presented sogeometrc analyss framework employs NURBS n the analyss stage. The optmzaton stage performs a RBF s based level set method to optmze topology. The sogeometrc method s naturally assocated wth RBF level set method provdes a very effcent treatment. In the followng sectons, a topology optmzaton problem s formulated based on the RBF level set method, and the method of sogeometrc analyss s explaned. The proposed topology

3 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD optmzaton method s appled to the mnmum mean complance problem. Fnally, to confrm the valdty and utlty of the proposed topology optmzaton method, several numercal examples are provded. 2. LEVEL SET METHOD The level set method s an mplct method for descrbng the evoluton of an nterface between two domans. It makes use of a functonφ, referred to as the level set functon, whch represents the boundary as the zero level set and nonzero n the doman [, 2]. Accordng to the value of the level set functon: φ( xt ()) > 0 : xt () D\ Ω φ( xt ()) = 0 : xt () Ω φ( xt ()) < 0 : xt () Ω\ Ω d where D R s a fxed doman n whch all admssble form of Ω are ncluded (.e. Ω D ). The level set functon s used to defne the nsde and outsde regons of nterface. The boundary or nterface s embedded as the zero level of the level set functon. Durng the optmzaton process, the level set surface may move up and down, and ths causes the embedded boundary to undergo drastc shape or topologcal changes. From begnnng to end, the value of the level set functon on the boundary s constantly kept to be zero Dfferentatng n t yelds, φ( x) = 0.0, x Ω (2) φ + φ.( vx) = 0.0 t () (3) dx where ν (x)= s the velocty vector feld, provded based on senstvty analyss. dt φ Consderng n = and v. φ = ( v n) φ, leads equaton (3) takes the form, φ φ + v n φ =0.0 t The solvng procedure of equaton (4) requres approprate choce of the upwnd schemes, rentalzaton algorthm and extenson velocty method, whch may requre excessve amount of computatonal efforts and thus lmt the utlty of the level set methods []. Therefore, a parameterzed level set method wth radal bass functons (RBFs) s used n the present study for structural topology optmzaton. (4)

4 50 S. Shojaee, M. Mohamadan and N. Valzadeh 3. SHAPE AND TOPOLOGY OPTIMIZATION PROBLEM 3.. Statement of optmzaton problem The optmzaton goal s to mnmze the complance (global stran energy) over the structural doman wth a constrant on total materal volume resource. There exst numerous equvalent formulatons of the mnmum complance problem that we use whch was gven n the work of Allare et al. [5]. Let Ω be a smooth bounded open set, and s occuped by a lnear sotropc elastc materal wth Hook s law A n desgn doman. A general objectve functon (complance) can be formulated as, J( Ω ) = fudv. + guds. = Aeu ( ). eudv ( ) (5) Ω ΓN Ω where ΓN s Neumann boundary condton, f, g are body force and surface load respectvely, and u s the dsplacement feld based on the followng lnear elastcty equatons dv( Aeu ( )) = f n Ω u = 0 on ΓD (6) ( Aeu ( )) n = g on ΓN where Γ D s Drchlet boundary condton. The standard noton for mnmum complance desgn problems can be mathematcally defned as follows Mnmze J( Ω ) = fudv. + guds. = Aeu ( ). eudv ( ) Ω ΓN Ω Subjectto: max 0 dv V Ω (7) 3.2. Shape dervatve In order to apply a gradent method to the mnmzaton of (7), we recall a classcal noton of shape dervatve. Murat and Smon [37] ntroduced a technque for constructng shape dervatve by parameterzaton of domans. We use ther approach as follows: Ω θ = ( I+ θ ) Ω (8) Where Ω s a smooth open set doman, I s dentty mappng nr N and, ( N N N θ W R, R ). The shape dervatve of objectve functon J ( Ω) : R R s defned as, the Frechet dervatve n ( N N W R, R ), J(( I+ θ) Ω ) = J( Ω ) + J ( Ω ) θ + O ( θ) (9)

5 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD... 5, where J ( Ω ) s a contnuous lnear form on ( N N W R, R ) gven as the unque soluton to equaton. 7. The senstvty of the mean complance (equaton 7) s gven as follows [5, 7], (. ) ( Ω ) θ gu J = (2[ + Hg. u+ fu. ] Aeu ( ). eu ( )). + ( ). ( ). Γ θ nds Aeu eu θ nds N n (0) ΓD where H = dvn s mean curvature, Ω s the boundary of materal doman. Ω can be decomposed as three parts, Γ,, Γ. Γ s admssble Drchlet boundary condtons D D N O D such that ΓD DD. Γ N = DN ΓOs Neumann boundary condtons where DN supports a non-homogeneous one and ΓO supports homogeneous one. Let us suppose that there s no body force then n (5) f = 0.0, thus the objectve functon s defned as: J( ) guds. () Ω = D N Therefore, the Frechet dervatve of the mean complance and the volume constrant can be reformulated as, J ( Ω ) θ = ( Aeu ( ). eu ( )) θ. nds (2) ΓO Ω = Ω V ( ) θ θ( xnxds ) ( ) (3) In order to solve the optmzaton problem, we use the augmented Lagrangan method. For K a gven penalty parameter ( Λ ) and Lagrange multpler ( λ K ) the augmented problem can be stated as follows, 2 J( Ω ) = J( Ω ) + λ K max + max dv V Ω K 2Λ dv V (4) Ω The Lagrange multpler and penalty parameters are updated as follows at each teraton of the optmzaton process, λ K+ K = λ + Λ dv V K max (5) Ω K+ K Λ = αλ (6) where α (,) 0 s a constant parameter. Usng the shape dervatve of equaton (4) where there s no body force, gves, Ω = Γ J ( ) θ vθ. nds (7) O

6 52 S. Shojaee, M. Mohamadan and N. Valzadeh 2 v= λ + max ( ). ( ) 2Λ dv V Aeu eu Ω (8) To ensure the decrease of the objectve functon n level set method, the normal velocty feld must be chosen approprately. The fast descent or the steepest descent method s used such as proposed n Allare et. al. [5] and Wang et. al.[6], whchθ = vn. The normal velocty feld n equaton (4) s substtuted wth normal component of ths drectonθ. n = v. Φ v Φ =0 (9) t 3.3. The RBFs based level set method The use of explct schemes for solvng level set equaton requres approprate choce of the upwnd schemes, rentalzaton algorthms and extenson velocty methods, whch lmt the applcaton of the standard level set method to shape and topology optmzaton problems. For the sake of overcomng these drawbacks whle retan the topologcal benefts of the mplct representaton, we apply the Radal Bass Functons (RBFs) to represent the mplct level set modelng to reconstruct the shape and topology of an admssble desgn n a parametrc way [6,20]. By usng of ths scheme, the orgnal Partal Dfferental Equaton (PDE) based level set method converts nto a set of much easer Ordnary Dfferental Equaton (ODE) system and makes the level set method more effcent to mplement RBFs mplct modelng Radal bass functons are used to approxmate an admssble desgn wth a sngle functon whch s globally contnuous and dfferentable. RBFs are radally-symmetrc functons centered at partcular ponts whch can be expressed as, ϕ( x) = ϕ( x x ), x D (20) Where ϕ : R + R wth ϕ(0) 0 and x s the poston of the pont or the knot. There are a large number of dfferent radal bass functons whch can be roughly dvded nto two classes. One of these s the globally supported radal bass functons (GSRBFs) such as: thn-plate splne, Sobolev splnes, polyharmonc splnes, multquadrcs (MQ), nverse multquadrcs (IMQ) [39] and so on. The other s the compactly supported radal bass functons (CSRBFs) whch s presented by Wendland [40]. In ths paper the CSRBF wth C2 contnuty s chosen due to ts strctly postve defnteness and the sparsty of collecton matrces. The CSRBF C2 kernel (Fgure -a) s defned as, 4 ( ) ϕ () r = max(0,( r)).(4r + ) (2) where the radus of support r s gven n two dmenson Eucldean spaces as

7 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD r = 2 2 ( x x) + ( y y) d (22) sp where d sp usually set large enough to guarantee there are enough knots located n the neghborhood of the current knot [39,40]. where Fgure. C2-CSRBF and ts partal dervatve n x drecton The dervatves of these CSRBFs can be easly obtaned by the chan rule, ϕ( xy, ) 3 r = (max(0, r)).( 20 r). x x ϕ( xy, ) 3 r = (max(0, r)).( 20 r). y y r x x = x d. ( x x) + ( y y ) 2 2 sp r y y = y d. ( x x) + ( y y) 2 2 sp (23) (24) The mplct level set functon φ( x) can be approxmated wth radal bass functon N (25) = T φ( x) = αϕ ( x) = ϕ ( x) α where α s the weght, whch s usually called expanson coeffcent RBF-level set optmzaton method As aforementoned, we use RBF-level set method to transform the level set PDE equaton nto

8 54 S. Shojaee, M. Mohamadan and N. Valzadeh a system of frst-order ordnary dfferental equaton (ODE). In ths paper the RBF mplct modelng s used to approxmate φ ( x) by usng CSRBF centered at knots, T φ = φ( xt,) = ϕ ( x) α() t (26) Wth ths parameterzaton the space and tme become separate. Snce the present RBF based nterpolaton scheme s performed under assumpton that all the knots are fxed n the desgn doman thus, unlke the conventonal dscrete level set approach n the RBFs based parametrc way, the desgn varables are the expanson coeffcentsα. Usng equaton (26) and equaton (4) obtan, T dα T ϕ + Vn ϕα= 0 (27) dt To determne n unknown coeffcent, one can use the collocaton method and obtan a system of ODEs as follow dα H + B( α ) = 0 dt (28) Equaton (28) can be solved by several dfferent ODE solvers such as the frst-order forward Euler s method and hgher-order Runge-Kutta, Rung-Kutta-Fehlberg, Adames- Bashforth or Adams-Moulton method. In the present study the forward Euler method s used and an approxmate soluton to equaton (28) can be gven by α t α t th B α t (29) ( n+ ) = ( n) + ( ( n)) where t s the tme step. After obtanng the approxmate soluton n equaton (29) at each tme step, the level set functon can be updated usng equaton (25). 4. ISOGEOMETRIC ANALYSIS The tradtonal Fnte Element formulatons are based on nterpolaton schemes wth Lagrange, Legendre or Hermte polynomals to approxmate geometry, physcal feld and ts dervatves. Ths approach often requres a substantal smplfcaton of the geometry, partcularly for curved boundares of the analyss doman. Generally, adaptve refnement of the dscretzed doman s appled to better approxmate the boundary and to acheve suffcent convergence. The concept of sogeometrc analyss has been proposed by Hughes and coworkers recently [25]. The man dea of the sogeometrc analyss s to apply the same nterpolaton scheme that s used accurately to descrbe the geometry for the approxmaton of the physcal varables. Snce NURBS bass functons have become standard bass for descrbng and modelng the geometry n CAD and computer graphcs, they are used for descrbng both geometry and soluton spaces.

9 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD B-splne and NURBS bass functon NURBS are a generalzaton of pecewse polynomal B-splnes curves. The B-splne bass functons are defned n parametrc space on a knot vector Ξ. A knot vector n one dmenson s a non-decreasng sequence of real numbers: Whereξ s the { ξ ξ ξ 2 } + + Ξ=,,..., n p (30) th knot, s the knot ndex,,2,..., n p = + +, p s the order of the B- splne, and n s the number of bass functons. The half open nterval [, ) ξ ξ + s called the th knot span and t can have zero length snce knots may be repeated more than one, and the nterval ξ, ξ + + n p s called a patch. In the sogeometrc analyss, always open knot vectors are employed. A knot vector s sad to be open f t has p + repeatng knots at the two ends. Wth a certan knot span, the B-splne bass functons are defned recursvely as, and N,0 ( ξ ) + = (3) 0 f ξ ξ ξ otherwse ξ ξ ξ ξ N ( ξ) = N ( ξ) + N ( ξ), p =, 2, 3,. + p+ p,, p +, p ξ+ p ξ ξ+ p+ ξ+ A B-splne curve of order p s defned by n =, p (32) C( ξ) = N ( ξ) P. (33) where N, ( ξ ) s the th B-splne bass functon of order p and P are control ponts, gven n p d-dmensonal space d. -D B-splnes bass functons, that are bult from open knot vectors, are nterpolatory at the ends of parametrc space. Fgure 2 shows the quadratc B-splne bass functons. In two dmensons, B-splne bass functons are nterpolatory at the corners of the patches. The non-unform ratonal B-splne (NURBS) curve of order p s defned as, n C( ξ) = R ( ξ) P (34) = p,

10 56 S. Shojaee, M. Mohamadan and N. Valzadeh Here R, p Fgure 2. Quadratc bass functons for an open knot vector Ξ= { 0,0,0,0.2,0.4,0.6,0.8,,,} R p, ( ξ ) = N ( ξ ) w p, n Np, ( ξ ) w (35) = s the NURBS bass functons, P s the control pont and w s the th weght that must be non-negatve. In the two dmensonal parametrc space[ ] 2 0,, NURBS surfaces are constructed by tensor product through knot vectors { ξ, ξ2,..., ξ n + p + } Ψ= { ψ, ψ2,..., ψ m + q + }. It yelds to, n m = j= pq,, j, j Ξ= and S( ξψ, ) = R ( ξψ, ) P (36) where, j P s the (, ) j -th of n mcontrol ponts, also called the control mesh. The nterval ξ, ξ + + n p ψ, ψ + + ξ, ξ + ψ j, ψ j + s a knot span. NURBS bass functon n two dmensonal space, m q s a patch and [ ) ) R ξη s the pq,, j(, ) and R pq,, j N ( ξ) M ( ψ) w ( ξψ, ) = W ( ξψ, ) p, jq,, j, j n m, j = p, jq,, j = j= W ( ξψ, ) N ( ξ) M ( ψ) w (37) (38) p, q The dervatve of R ( ξ, ) and W, ( ξψ, ) wth respect to ξ s derved by smply, j η j

11 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD applyng the quotent rule to (37) and (38), and R W ( ξψ, ) N ( ξ) M ( ψ) ww ( ξψ, ) N ( ξ) M ( ψ) w, j pq, p, jq,, j, j p, jq,, j, j( ξψ, ) ξ = 2 ξ ( W, j( ξψ, )) W ( ξψ, ) (39) n m, j = N p, ( ξ ) M jq, w (40), j ξ = j= The doman of problem s dvded nto patches and each patch s dvded nto knot spans or elements. Patches play the role of sub-domans wthn whch element types and materal models are assumed to be unform [25]. Nevertheless, many complcated domans can be represented by a sngle patch NURBS based sogeometrc analyss formulaton Consderng a 2-D lnear elastcty problem wth the presence of body force b and tracton force t. Implementng the vrtual dsplacement method, the followng weak form equaton s obtaned, T T T δεσdω δ d δ d 0 Ω ub Ω Γ= Ω u t Γt (4) where σ s the stress tensor and ε s the stran tensor. In sogeometrc approach, the dscretzaton s based on NURBS. Hence, the geometry and soluton feld are approxmated as, x( ξη, ) = RP ξη, Ωpatch (42) h u ( ξη, ) = Rd ξη, Ω where Ω = {( ξη, ) ξ ξ, ξ + +, η η, η + + } patch (43) patch n p m q. The matrx-form of R, jand P, jcan be changed nto vector-form by mappng from, j subscrpts to k by: k = + ( j ) n, wth k =,2,..., nm. (44) So, the control ponts are defned as, P= ( P, P, P, P,..., P ) x y x y y T,, 2, 2, nm, (45) The values of soluton feld at the control ponts, also called control varables, n the present IGA formulaton are dsplacements and can be arranged smlar to the control ponts n a

12 58 vector-form, S. Shojaee, M. Mohamadan and N. Valzadeh d = ( d, d, d, d,..., d ) (46) x y x y y T,, 2, 2, nm, The matrx R s obtaned from NURBS bass functons, R, 0 R2, 0... Rnm, 0 R = 0 R, 0 R2,... 0 Rnm, Next, the stffness matrx for a sngle patch s computed as, (47) T K = t B ( ξη, ) DB( ξη, ) J d Ω% patch Ω% (48) where t s the thckness, Ω % s the parametrc space, B ( ξη, ) s the stran-dsplacement matrx, and Js the jacoban matrx whch maps the parametrc space to the physcal space. D s the elastc materal property matrx for plane stress. The force vector on a sngle patch n the presence of body forces b and tracton forces t s obtaned as, f RbJ % R tj % T T = d Ω+ dγ b b Ω% Γ% where Γ % s the tracton boundary n the parametrc space, R s the NURBS bass functon b evaluated on the tracton boundary and J s the Jacoban that maps the tracton boundary nto b a part of physcal space boundary. The control varables can then be solved by the followng dscretzed equlbrum equaton, (49) Kd =f (50) The soluton feld at each pont of the physcal space can be approxmated by equaton (50). For numercal ntegraton, the standard Gauss-quadrature s used over each element (knot span). The number of quadrature ponts depends on the NURBS order. The detals of spaces, mappng and ntegraton n sogeometrc analyss are shown n Fgure 3. Note that the physcal mesh s only an mage of knot spans on the physcal space H-refnement or knot nserton There are three types of refnement n sogeometrc analyss: h-refnement or knot nserton, p- refnement or order elevaton and k-refnement [25]. In ths paper, we employed only the h- refnement. Knot nserton s a procedure that arbtrary new knots are added to a knot vector wthout any change n the shape of the B-splne curve. If there are m=n+p+ knots n the knot vector of the B-splne curve, where n s the number of control ponts and p s the order of B-splne

13 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD curve, by addng a new knot, a new control pont must be added. Also, some current control ponts must be redefned. Consder a knot vector Ξ= { ξ, ξ2,..., ξ m = n + p + } wth n control ponts P, P 2,..., P n and the order of p. Let ξˆ [ ξk, ξ k + ] be a desred new knot. The knot nserton procedure has the followng 3 steps [3],. Fnd k such thatξˆ belongs to [, ] ξk ξ k Fnd p + control ponts P k p, P k p+,..., P k. 3. Compute p new control pontsq from the above p + control ponts usng equaton (27). Q = ( α) P + αp (5) where α s obtaned from, α ξˆ ξ = for k p + k ξ ξ + p (52) Fgure 3. Physcal space Ω s mapped nto the parametrc space ~ Ω usng NURBS bass functons. For numercal ntegraton n the parametrc space, each knot span s mapped to the parent element, where the ntegraton s performed on By performng the above procedure, the new knot vector and control ponts are obtaned as,

14 60 S. Shojaee, M. Mohamadan and N. Valzadeh { ξ, ξ ˆ 2,..., ξk, ξξ, k+,..., ξm } { P, P2,..., Pk p, Qk p+, Qk p+ 2,..., Qk, Pk, Pk+,..., Pn} Now, ths knot nserton algorthm s extended to a NURBS curve. For ths purpose, a gven NURBS curve n d-dmensonal space s converted nto a B-splne curve n (d+)- dmensonal space, then by applyng the knot nserton algorthm n ths B-splne curve, the new control ponts are obtaned. These new control ponts should then be projected to d- dmensonal space to obtan the new control ponts of the NURBS curve. Consder control ponts P = ( x, y) wth the weghts w. By convertng these control ponts to 3-dmensonal w space, P = ( wx, wy, w), the new control ponts are then computed from equaton (27), Q = ( α ) P + α P w w w The locaton of control ponts n 2D are obtaned by the followng projecton technque: and the weghts are: Q (53) (54) w w ( α) P + αp = ( α ) w + α w (55) w = ( α ) w + αw Q 5. ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION In proposed approach, the dscrete problem s formulated n sogeometrc analyss framework. The general optmzaton problem stated n (5) s specfed for an sogeometrc dscretzaton. We apply objectve functons based on complance of partcular locatons of the structure. In geometry constructon, we construct the geometry by performng knot nserton algorthm on the ntal geometry model s shown n Fgure 4. The ntal geometry s modeled as a NURBS surface of b-quadratc order wth 6 4 control ponts. The open knot vectors n ξ drecton s {0,0,0,0.25,0.5,0.75,,,} and n ψ drecton s {0,0,0,0.5,,,}, whch yelds 4 2 knot spans. By dvdng each knot span n ξ and ψ drecton nto 0 equal parts, the physcal mesh wth equal knot spans and the control mesh wth control ponts s obtaned that s shown n fgure 5. Note that the locaton of the control ponts n the ntal geometry model plays an mportant role n reachng the desred analyss model. We used the local support property of NURBS bass functon,.e., there are only( p+ ) ( q+ ) number of nonzero bass functons wthn each knot span, where p and q are the orders of NURBS. We know that each NURBS bass functon has a correspondng control pont. So, we can assgn to each knot span, ( p+ ) ( q+ ) control ponts. In ths work, p= q= 2 and we have 3 3 control ponts for each knot span, as shown n Fgure 5. (56)

15 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD... 6 (a) Fgure 4. Intal geometry model. (a) Control mesh. (b) Physcal mesh (a) (c) (b) (d) Fgure 5. Geometry representaton for the analyss model. (a) Physcal mesh that s an mage of knot spans. (b) Control mesh that s consstng of control ponts. (c) Local vew of the left top corner of physcal mesh, shows elements a, b and c. (d) Control ponts have supported on elements a, b and c (b) 6. NUMERICAL IMPLEMENTATION The objectve of ths secton s to descrbe the numercal mplementaton of the proposed method. These mplementatons are developed to mprove the performance of the proposed method. 6.. Flterng As mentoned before, shape dervatve causes the level set functon to have non- unform value at ponts n desgn doman and can lead to numercal errors. To avod quck changes and suppress the non smooth varaton a flterng technque orgnally developed n mage processng s used. One of the flterng approaches may be employed n structural topology optmzaton problems s convoluton technque. In convoluton based methods the densty of each pxel s changed accordng to nformaton from ts neghborhood. The convoluton

16 62 S. Shojaee, M. Mohamadan and N. Valzadeh process can be formulated as, n n c (, j) = hkl (, ) A ( + m k, j+ m l ) (57) k= l= where hkl (,) s the densty of the pxel located n the k th th row and l column of the mage and c s the fltered densty of the pxel. The so called mpulse response matrx A (, j ) s a n n square matrx that has to be chosen accordng to the purpose of the flter. The varable m= ( n+ )/ 2, where n s the number of pxel n each sde of the flter wndow. It should be noted that by mplementng ths method, the orgnal optmzaton problem s changed and as result of seekng clear mages, suboptmal results for the value of the objectve functon are obtaned Ersatz materal approach A challenge to structural topology optmzaton s the fact that the sogeometrc mesh wll become dstorted after the shape and topology change. Under these crcumstances, the structure doman must be remeshed. However, remeshng s a complcatng and tme consumng task, and wll brng down the effcency of optmzaton. Instead, n ths paper, the so-called ersatz materal approach [5] whch has been wdely used n senstvty analyss of the complance optmzaton problem. In ths approach the vod doman s assumed to be replaced by a type of weak materal, whose Young s modulus s very low. More precsely, we defne a Young s modulus E 0 as, E = ce 0 (58) Where E s the Young s modulus of the sold materal of the structure and c s a coeffcent. The amount of ths coeffcent s selected as c = for sold materal and c = for vod doman. Note that c cannot be too small, otherwse the stffness matrx wll be sngular. Moreover, for the elements ntersected by the boundary, Young s modulus s calculated accordng to the fracton of sold materal. For example, n one element, f the volume of sold takes one half of the volume of the element, then the Young s modulus of ths element s set to E 0 = 0.5E. 7. NUMERICAL EXAMPLES In ths secton, two wdely studed examples n structural topology optmzaton are used to llustrate the potentals of the proposed method. The optmzaton problem s consdered as the complance mnmzaton subjected to volume constrant. The unts of all the parameters can be defned flexbly, but they should reman unchanged durng all dfferent stages. All numercal examples have the followng data, Young s modulus of real materal s assumed, ersatz materal 0-3, Posson rato for two materal s assumed 0.3 and the order of NURBS bass functons n each drecton s 2. In ths method, the level set functon s ntally

17 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD embedded as a sgned dstance functon, but no further rentalzaton s appled n the rest of teratons. Also, the present algorthm s termnated when the relatve dfference between four 4 successve objectve functon values s less than 0 or when the gven maxmum number of teratons has been reached. 7.. Cantlever beam Fgure 6 shows the desgn doman of a cantlever beam wth a sze of L =. The boundary of the left sde s fxed, and a vertcal concentrated force F=N s appled at the center pont of the rght sde boundary. The specfed materal volume fracton s 50%. In ths example, we use Wendland C2-CSRBF and the knot ponts are dstrbuted unformly n the desgn doman. L 2L Desgn Doman Fgure 6. A cantlever beam For comparson purpose, frst, we apply fnte element method as an analyzer when the level set mesh concdes wth the fnte element mesh. The desgn doman s dscretzed wth fnte elements and the ntal desgn s completely sold. It s clearly observed that the results of IGA by 800 elements agree well wth FEA by 3200 elements. Ths IGA feature smplfes usng of relatvely coarse meshes n the topology optmzaton procedure. Other parameters that are used for solvng ths example are ds=5, λ =0, Λ = 20, α = Fgure 7 dsplays the evoluton process of the cantlever beam at dfferent stages. These fgures show that the proposed level set method can handle shape fdelty and topologcal changes smultaneously by retanng a smooth boundary. In ths method the ntal level set surface s embedded as a sgned dstance functon and we do not apply rentalzaton at the rest of the topology optmzaton procedure. Also, because the Hamlton-Jacob partal dfferental equaton s converted to an ordnary dfferental equaton, we do not need to meet the CFL condton for tme step, thus we choseτ = 0 as a tme step. These crcumstances caused the nucleaton of holes n desgn doman durng the optmzaton process. F (a) Intal desgn (b) Step 0 (c) Step 5

18 64 S. Shojaee, M. Mohamadan and N. Valzadeh (d) Step 20 (e) Step 25 (f) Fnal desgn Fgure 7. The evoluton of optmal topology of the cantlever beam usng FEA Also, Fgure 8 shows the stran energy and the volume fracton n dfferent teratons. Fgure 8. The Hstory of objectve functon and volume In second step, we optmzed ths example when the sogeometrc analyss s appled. Here, the sogeometrc mesh does not correspond wth the level set mesh. More precously, the desgn doman s dvded wth level set mesh and sogeometrc mesh. The accuracy of the analyss when we apply sogeometrc method wth coarse mesh s partally the same as we use the fnte element mesh wth fne sze. Fgure 9 llustrate the desgns n dfferent stages of the optmzaton process, when we use the sogeometrc method for analyzng. As shown n ths fgure, one can fnd that the two dfferent schemes can lead to the smlar desgns. But, because n later scheme we use a coarse mesh for dvdng the desgn doman, the total tme of the optmzaton process when we apply the sogeometrc method s much better than we use fnte element method as an analyzer. The results obtaned wth the two dfferent schemes are lsted n Table. Fgure 0 shows that the convergent curves of the objectve functon and the volume rato. (a) Intal desgn (b) Step 0 (c) Step 5

19 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD (d) Step 20 (e) Step 30 (f) Fnal desgn Fgure 9. The evoluton of optmal topology of the cantlever beam usng IGA Fgure 0. The Hstory of objectve functon and volume rato Table. Comparson of the FEA and IGA Analyzer J(Ω) (objectve) T(s) (total tme) N (teratons) FEA IGA (a) Wth 2 holes (b) Wth 33 holes

20 66 S. Shojaee, M. Mohamadan and N. Valzadeh (c) Wth 44 holes Fgure. The effect of the ntal desgn of the cantlever beam We also nvestgate the nfluence of dfferent number of ntal holes on the fnal desgn. Fgure a, b and c show that the dentcal optmal structures are obtaned regardless of number of ntal holes n the desgn doman and the complexty of the fnal topologes do not change obvously wth the dfferent number of ntal holes. In table 2 the results of these dfferent ntal desgns are lsted. Intal desgn Table 2. Results of dfferent desgns of the cantlever beam J(Ω) (objectve) T(s) (total tme) N (teratons) Fgure 3.a wth 2 holes Fgure 3.b wth 33 holes Fgure 3.c wth 44 holes 7.2. A MBB beam The desgn doman of a MBB beam s shown n Fgure 2. A load F=300 s appled at the center of the top edge. Its left corner at the bottom s fxed and the rght corner s supported as a roller. We also consder L= and the desgn doman s dscretzed wth 20 30elements. For ths example, The IGA mesh s correspondng wth level set mesh. The volume fracton s 40% and the other parameters, usng for solvng ths problem, are ds = 5, λ = 0, Λ= 30, α = 0.9. In Fgure 3, the evoluton of optmal topology s dsplayed by use of the present method L F 2L L Desgn Doman Fgure 2. A MBB beam

21 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD (a) Intal desgn (b) Step 5 (c) Step 5 (d) Step 20 (e) Step 25 (f) Fnal desgn Fgure 3. The evoluton of optmal topology of the MBB beam 8. CONCLUSION In the present study, the composton of RBF level set method wth sogeometrc analyss has been successfully appled to the structural shape and topology optmzaton. In ths method, the dscrete problem s formulated n sogeometrc analyss framework. A parameterzed level set method wth RBFs s used for structural topology optmzaton. The proposed sogeometrc based topology optmzaton method has several advantages compared to the fnte element based method. Unlke the standard FEM-based desgn optmzaton, the computatonal tme can be reduced by usng ths analyzer, whle obtanng the same optmal topology. Due to the desrable characterstcs of NURBS n IGA, t does not have any destructve effect on the qualty of dscretzaton. Furthermore, the proposed method n ths paper has ts strength on the capacty of dealng wth the desgn dependent load problem or stress optmzaton problem. REFERENCES. Allare G, Kohn RV. Optmal bounds on the effectve behavor of a mxture of two wellordered elastc materals, Quat Appl Math, 993; 5: Allare G, Bonneter E, Francfort G, Jouve F. Shape optmzaton by the homogenzaton method, Numer Math, 997; 76: Suzuk K, Kkuch N. A homogenzaton method for shape and topology optmzaton, Comp Meth Appl Mech Eng, 99; 93: Bendsøe M.P, Kkuch N. Generatng optmal topology n structural desgn usng a homogenzaton method, Comput Meth Appl Mech, 988; 7(2): Bendsøe M.P, Optmal shape desgn as a materal dstrbuton problem, Struct Optm,

22 68 S. Shojaee, M. Mohamadan and N. Valzadeh 989; : Zhou M, Rozvany GIN. The COC algorthm, Part II: topologcal, geometry and generalzed shape optmzaton, Comput Meth Appl Mech, 99; 89: Hassan B, Hnton E. A revew of homogenzaton and topology optmzaton III-topology optmzaton usng optmalty crtera, Comput Struct, 998; 69: Bendsøe M.P, Sgmund O. Topology Optmzaton: Theory, Methods, and Applcatons, Sprnger, Berln Hedelberg Eschenauer HA, Kobelev VV, Schumacher A. Bubble method for topology and shape optmzaton of structures, Struct Optm, 993; 8: Xe YM, Steven GP. A smple evolutonary procedure for structural optmzaton. Comput Struct, 993; Osher S, Sethan J.A. Front propagatng wth curvature dependent speed: algorthms based on Hamlton Jacob formulatons, J Comput Phys, 988; 78: Sethan J. Level set methods and fast marchng methods: evolvng nterfaces n computatonal geometry, flud mechancs, computer verson and materal scence, Cambrdge Monograph on Appled and Computatonal Mathematcs, Cambrdge Unversty Press, UK Sethan JA, Wegmann A. Structural boundary desgn va level set and mmersed nterface methods, J Comput Phys, 2000; 63(2): Osher S, Santosa F. Level-set methods for optmzaton problem nvolvng geometry and constrants: I. Frequences of a two-densty nhomogeneous drum, J Comput Phys, 200; 7: Allare G, Jouve F, Toader A.M. Structural optmzaton usng senstvty analyss and a level-set method, J Comput Phys, 2004; 94: Wang MY, Wang XM, Guo DM. A level set method for structural topology optmzaton, Comput Meth Appl Mech, 2003; 92: Haug EJ, Cho KK, Komkov V. Desgn Senstvty Analyss of Structural Systems, Academc Press, Orlando, Sokolowsk J, Zoleso JP. Introducton to Shape Optmzaton: Shape Senstvty Analyss, Sprnger, Berln, Garreau S, Gullaume P, Masmoud M. The topologcal asymptotc for PDE systems: the elastcty case. SIAM J. Control Optm, 200; 39(6): Wang SY, Wang MY. Radal bass functons and level set method for structural topology optmzaton. Int J Numer Methods Eng, 2006; 65: Luo Z, Tong LY, Kang Z. A level set method for structural shape and topology optmzaton usng radal bass functons. Comput Struct, 2009; 87: Shojaee S, Mohamadan M, A Bnary Level Set Method for Structural Topology Optmzaton, Int J Optm Cvl Eng, 20; (): Mohamadan M, Shojaee S. Bnary level set method for structural topology optmzaton wth MBO type of projecton, Int J Numer Meth Engng, 202; 89(5): Shojaee S, Mohamadan M. Pecewse constant level set method for structural topology optmzaton wth Mbo type of projecton, Struct Multdsc Optm, 20; 44(4): Hughes TJR, Cottrell J, Bazlevs Y. Isogeometrc analyss: CAD, fnte elements, NURBS, exact geometry and mesh refnement. Comput Method Appl Mech, 2005; 94:

23 COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD Cottrell J, Hughes TJR, Bazlevs Y. Isogeometrc Analyss: Toward Integraton of CAD and FEA, John Wley & Sons, Bazlevs Y, Berao L, Vega Da, Cottrell J, Hughes TJR, Sangall G. Isogeometrc analyss: approxmaton, stablty and error estmates for h-refned meshes, MATH Mod Meth Appl S, 2006; 6: Cottrell J, Hughes TJR, Real A. Studes of refnement and contnuty n sogeometrc structural analyss. Comput Method Appl Mech, 2007; 96: Bazlevs Y, Calo VM, Cottrell J, Evans J, Hughes TJR, Lpton S, Scott MA, and Sederberg T. Isogeometrc analyss usng T-splnes. Comput Method Appl Mech, 200; 99(5 8): Hughes TJR, Real A, Sangall G. Effcent quadrature for NURBS-based sogeometrc analyss. Comput Method Appl Mech, 200; 99: Cho S, Ha SH. Isogeometrc shape desgn optmzaton: exact geometry and enhanced senstvty, Struct Multdscp Optm, 2009; 38: Wall WA, Frenzel MA, Cyron C. Isogeometrc structural shape optmzaton, Comput Method Appl Mech, 2008; 97: Nagy AP, Abdalla M, Gurdal Z. Isogeometrc szng and shape optmzaton of beam structures, Comput Method Appl Mech, 200; 99: Qan X. Full analytcal senstvtes n NURBS based sogeometrc shape optmzaton, Comput Method Appl Mech, 200; 99: Seoa Yu-Deok, Kma Hyun-Jung, Youn Sung-Ke. Shape optmzaton and ts extenson to topologcal desgn based on sogeometrc analyss. Int J Solds Struct, 200; 47: Shojaee S, Valzadeh N, Arjomand M. Isogeometrc structural shape optmzaton usng partcle swarm algorthm, Int J Optm Cvl Eng, 20; (4): Murat F, Smon S. Etudes de problems d optmal desgn, Lecture Notes n Computer Scence, 976; vol. 4, Sprnger-Verlag, Berln Buhmann MD. Radal Bass Functon: Theory and Implementatons. Cambrdge Unversty Press, New York, NY Wendland H. Pecewse polynomal, postve defnte and compactly supported radal functons of mnmal degree. Adv Comput Math, 995; 4(): Wendland H. Computatonal aspects of radal bass functon approxmaton.in: Jetter K et al., edtors. Topcs n Multvarate Approxmaton and Interpolaton, vols Elsever BV, 2005.

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method An Improved Isogeometrc Analyss Usng the Lagrange Mltpler Method N. Valzadeh 1, S. Sh. Ghorash 2, S. Mohammad 3, S. Shojaee 1, H. Ghasemzadeh 2 1 Department of Cvl Engneerng, Unversty of Kerman, Kerman,

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

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

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

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

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

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

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

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

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

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

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

More information

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

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

More information

Topology optimization considering the requirements of deep-drawn sheet metals

Topology optimization considering the requirements of deep-drawn sheet metals th World Congress on Structural and Multdscplnary Optmsaton 7 th - th, June 5, Sydney Australa Topology optmzaton consderng the requrements of deep-drawn sheet metals Robert Denemann, Axel Schumacher,

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

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

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

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

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

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

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

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Active Contours/Snakes

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

More information

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

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

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

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

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

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

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

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

Classification / Regression Support Vector Machines

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

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Plate/shell topological optimization subjected to linear buckling constraints by adopting composite exponential filtering function

Plate/shell topological optimization subjected to linear buckling constraints by adopting composite exponential filtering function Acta Mech. Sn. 2016) 324):649 658 DOI 10.1007/s10409-015-0531-5 RESEARCH PAPER Plate/shell topologcal optmzaton subjected to lnear bucklng constrants by adoptng composte exponental flterng functon Hong-Lng

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

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

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

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

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

Adaptive Fairing of Surface Meshes by Geometric Diffusion

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

Structural Optimization Using OPTIMIZER Program

Structural Optimization Using OPTIMIZER Program SprngerLnk - Book Chapter http://www.sprngerlnk.com/content/m28478j4372qh274/?prnt=true ق.ظ 1 of 2 2009/03/12 11:30 Book Chapter large verson Structural Optmzaton Usng OPTIMIZER Program Book III European

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

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

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

Feature Reduction and Selection

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

Investigations of Topology and Shape of Multi-material Optimum Design of Structures

Investigations of Topology and Shape of Multi-material Optimum Design of Structures Advanced Scence and Tecnology Letters Vol.141 (GST 2016), pp.241-245 ttp://dx.do.org/10.14257/astl.2016.141.52 Investgatons of Topology and Sape of Mult-materal Optmum Desgn of Structures Quoc Hoan Doan

More information

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves

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

Review of approximation techniques

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

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

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

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

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Fitting: Deformable contours April 26 th, 2018

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

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

Study of key algorithms in topology optimization

Study of key algorithms in topology optimization Int J Adv Manuf Technol (2007) 32: 787 796 DOI 101007/s00170-005-0387-0 ORIGINAL ARTICLE Kong-Tan Zuo L-Png Chen Yun-Qng Zhang Jngzhou Yang Study of key algorthms n topology optmzaton Receved: 30 Aprl

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

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

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

A Geometric Approach for Multi-Degree Spline

A Geometric Approach for Multi-Degree Spline L X, Huang ZJ, Lu Z. A geometrc approach for mult-degree splne. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(4): 84 850 July 202. DOI 0.007/s390-02-268-2 A Geometrc Approach for Mult-Degree Splne Xn L

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

LECTURE : MANIFOLD LEARNING

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

More information

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

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

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

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

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

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

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law) Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes

More information

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

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm 01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc

More information

Modeling and Solving Nontraditional Optimization Problems Session 2a: Conic Constraints

Modeling and Solving Nontraditional Optimization Problems Session 2a: Conic Constraints Modelng and Solvng Nontradtonal Optmzaton Problems Sesson 2a: Conc Constrants Robert Fourer Industral Engneerng & Management Scences Northwestern Unversty AMPL Optmzaton LLC 4er@northwestern.edu 4er@ampl.com

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

UC Berkeley Working Papers

UC Berkeley Working Papers UC Berkeley Workng Papers Ttle Dscretzaton and Valdaton of the Contnuum Approxmaton Scheme for Termnal System Desgn Permalnk https://escholarshp.org/uc/tem/9dm7v0cn Authors Ouyang, Yanfeng Daganzo, Carlos

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

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

An accelerated value/policy iteration scheme for the solution of DP equations

An accelerated value/policy iteration scheme for the solution of DP equations An accelerated value/polcy teraton scheme for the soluton of DP equatons Alessandro Alla 1, Maurzo Falcone 2, and Dante Kalse 3 1 SAPIENZA - Unversty of Rome, Ple. Aldo Moro 2, Rome, Italy alla@mat.unroma1.t

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

Discontinuous Galerkin methods for flow and transport problems in porous media

Discontinuous Galerkin methods for flow and transport problems in porous media T COMMUNICATIONS IN NUMERICA METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2; :1 6 [Verson: 2/3/22 v1.] Dscontnuous Galerkn methods for flow and transport problems n porous meda Béatrve Rvère and Mary

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

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

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

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

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

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence 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

Springback Reduction in Stamping of Front Side Member with a Response Surface Method

Springback Reduction in Stamping of Front Side Member with a Response Surface Method Sprngback Reducton n Stampng of Front Sde Member wth a Response Surface Method Jung-Han Song *, Hoon Huh *, Se-Ho Km **, Sung-Ho Park *** * Department of Mechancal Engneerng, Korea Advanced Insttute of

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

A 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

Adaptive Weighted Sum Method for Bi-objective Optimization

Adaptive Weighted Sum Method for Bi-objective Optimization 45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamcs & Materals Conference 19-22 Aprl 2004, Palm Sprngs, Calforna AIAA 2004-1680 Adaptve Weghted Sum Method for B-objectve Optmzaton Olver de Weck

More information

Using Radial Basis Functions to Solve Geodesics Equations for Body Measurements *

Using Radial Basis Functions to Solve Geodesics Equations for Body Measurements * 7659, England, UK Journal of Informaton and Computng Scence Vol. 2, No. 2, 2007, pp. 119-126 Usng Radal Bass Functons to Solve Geodescs Equatons for Body Measurements * R. Ng 1+, G.T.Y. Pong 2 and M. Wong

More information

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde

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

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

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

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

陳申岳 S-Y. Chen, 2007, Gradient-Based Structural and CFD Global Shape Optimization with SmartDO and the Response Smoothing Technology, Proceeding of

陳申岳 S-Y. Chen, 2007, Gradient-Based Structural and CFD Global Shape Optimization with SmartDO and the Response Smoothing Technology, Proceeding of 陳申岳 S-Y. Chen, 2007, Gradent-Based Structural and CFD Global Shape Optmzaton wth SmartDO and the Response Smoothng Technology, Proceedng of the 7 th World Congress of Structural and Multdscplnary Optmzaton

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