Complexity Control in the Topology Optimization of Continuum Structures

Size: px
Start display at page:

Download "Complexity Control in the Topology Optimization of Continuum Structures"

Transcription

1 E. L. Cardoso Grupo de Mecânca Aplcada Departamento de Engenhara Mecânca UFRGS Rua Sarmento Lete, Porto Alegre, RS. Brazl J. S. O. Fonseca Grupo de Mecânca Aplcada Departamento de Engenhara Mecânca UFRGS Rua Sarmento Lete, Porto Alegre, RS. Brazl Complexty Control n the Topology Optmzaton of Contnuum Structures A general mesh ndependent flter as a mean to control the complexty of topology optmzaton desgned structures s dscussed. A new mesh-ndependent flter, appled over the move-lmts of the sequental lnear programmng s proposed, and t s shown that ts use allevates common problems n the contnuum topology optmzaton, lke checkerboardng, mesh dependency, as well as effects assocated to non-structured meshes, lke numercal ansotropy. The structural optmzaton formulaton adopted n ths work s the mnmzaton of a penalzed functon of the volume, wth constrants on the complance of each load case. Aspects of ths penalzed objectve functon are dscussed, and several numercal examples are shown. Keywords: Topology optmzaton, flterng, gradent control, complexty control Introducton The man objectve of ths work s to present a methodology to control the complexty of structures desgned by topology optmzaton. Ths control s attractve because the cost of a mechancal part depends on ts complexty, and therefore, the economy acheved n materal can be easly overrun wth the ncrease of the complexty of the part. Addressng ths ssue, ths work proposes the use of a general gradent control technque (flterng), whch can be used n arbtrary meshes. Also, t s known that restrctng the spatal varaton (gradent) of the densty makes the problem well-posed (Bendsøe, 995), prevents the appearance of the checkerboard and, as the complexty of the topology s related to the number of holes (transton from vod to fll), the gradent control also controls the complexty. Studes about gradent controls (spatal varaton of the desgn varable) have been done to avod the checkerboard and to assure the exstence of solutons (Nordson, 983; Swan and Kosaka, 997; Peterson and Sgmund, 998; Fonseca and Kkuch, 998; Cardoso and Fonseca, 999 and Bourdn, 2). Some references (Díaz and Sgmund, 995 and Jog and Haber, 996) suggested that the checkerboard s assocated to the nterpolaton order of dsplacement and densty felds n the fnte element soluton, lke n the Stokes problem. Due to ths reason, some researchers use hgh order fnte elements wth the usual constant nterpolaton for the densty. Other approaches are the use of gradent controls, lke dgtal magng flterng or the strcter slope control proposed by Nordson, 983, and mplemented for the contnuum problem by Peterson and Sgmund 998 and Cardoso and Fonseca, 999. The man advantages of usng gradent controls over hgh order fnte elements are the complexty control, the fact that the set of the admssble desgns s closed (Bendsøe, 995), and computatonal effcency. The man objectve of the topology optmzaton problem s to fnd a materal dstrbuton that extremzes a gven functonal (objectve functon) subjected to a set of constrants. The evoluton of engneerng lead to the necessty of effcent methodologes to desgn mechancal parts and structures, thus savng materal and tme. Ths s the reason why topology optmzaton s becomng a very mportant research feld. The basc goal of topology optmzaton, the materal dstrbuton, s acheved by a consstent parameterzaton of the materal propertes n each part of the desgn doman. When dealng Paper accepted July, 23. Techncal Edtor: Edgar Nobuo Mamya wth sotropc materals, a natural queston s whether there exsts or not materal n a gven pont, whch leads to a dscrete problem. It s well-known that ths nteger parameterzaton leads to numercal problems, assocated to the non-unqueness of solutons (Ambroso and Buttazzo, 993 and Bendsøe, 995). To relax the nteger parameterzaton of the materal dstrbuton, Bendsøe and Kkuch, 988, ntroduced the parameterzaton of the materal dstrbuton by means of the homogenzaton method (Hassan and Hnton, 998a and 998b), whch enlarges the space of admssble solutons makng the problem well-posed. The homogenzaton method s smple and useful, however t ncreases the number of desgn varables used n the optmzaton problem, as t requres dervng a model for the dependence of the materal propertes wth respect to the geometrcal parameters of the cell. A dfferent approach to the non-unqueness of the soluton to the nteger program s to reduce the admssble set by the ntroducton of permeter constrants, proposed by Ambroso and Buttazzo, 993 and further developed by Beckers, 997. The power-law or SIMP s a smpler approach to relax the space of admssble solutons wthout ncreasng the number of desgn varables (Bendsøe and Sgmund, 999). It has been used as an alternatve to the full homogenzaton, where the materal propertes are parameterzed by p E = ñ E, ρ () where E s the nterpolated fourth order elastc consttutve tensor, ρ s the materal densty or materal fracton, E s the fourth order tensor relatve to the materal propertes of the base materal and p s used to adjust the degree of nonlnearty of ths equaton. Ths approach s a contnuous nterpolaton of the materal propertes wth respect to the densty (amount of materal) n each pont of the desgn doman. Ths contnuous parameterzaton relaxes the orgnal nteger problem, enlargng the desgn space. Recently, Bendsøe and Sgmund, 999, assocated ths parameterzaton to the use of sotropc composte mcrostructures. Wth ths result, t s clear that the use of the SIMP approach enlarges the desgn doman lke the use of the homogenzaton, but t s also clear that the spaces obtaned are dfferent, because the space spanned by non-sotropc mcrostructures s larger than the space spanned by ther sotropc counterparts. Due to ths reason, one can acheve better (extreme) results usng the homogenzaton nstead of SIMP (Park 995 and Bendsøe, 995). When the goal s to obtan a mechancal part made of sotropc materal, the use of contnuous parameterzaton, lke J. of the Braz. Soc. of Mech. Sc. & Eng. Copyrght 23 by ABCM July-September 23, Vol. XXV, No. 3 / 293

2 Complexty Control n the Topology Optmzaton of Contnuum Structures homogenzaton and SIMP, leads to the problem of ntermedate (composte) materals n some regons of the desgn doman. These regons are mportant and, sometmes, cannot be dscarded n a smple threshold post processng procedure. To ths end, one should obtan a pure nteger desgn after relaxng the orgnal problem wth dscrete materal parameterzaton. Usng the SIMP approach, one can start wth a untary exponent n Eq. () and ncrement the exponent as the optmzaton s carred on. Ths process, a contnuaton approach, enlarges the desgn space by usng a contnuous parameterzaton and, after that, reduces ths space usng penalzaton. Ths s a well-known result of the mxture theory, n whch a lnear relaton s an unattanable upper-bound and thus can lead to extreme desgns, lke the one obtaned wth homogenzaton. In fact, the mxture of two materals has a nonlnear relaton between the propertes of each materal and the amount of each materal n the mxture. Startng wth a untary exponent n the SIMP relaton provdes the upper bound and thus we are lookng for a soluton n a larger desgn space. Ths soluton s extreme, but contans large areas wth ntermedate materal. Penalzng the consttutve relaton, the stffness of the ntermedate materal s no longer attractve and, for some value of the exponent, t s possble to acheve an almost black and whte desgn. In ths work, a lnear relaton between the propertes of the base materal and the materal n each pont of the desgn doman s used. The objectve functon used s a penalzed functon of the amount of materal (volume) of the structure. Ths objectve functon s used because we are concerned wth materal reducton for a fxed complance. The objectve functon used s not related to the flterng technque proposed, and can be used wth any other knd of gradent control or constrants. Gradent Controls Gradent controls are used to constran the spatal varaton (gradent) of the desgn varable. As shown by Bendsøe, 995, constranng the spatal gradent of the densty makes the H norm ( ( ) ) /2 2 = + (2) Ω 2 H ρ ρ bounded (H < + ), makng t possble to prove that the problem s well-posed and has (at least) one soluton. Ths control can be acheved usng dgtal magng flterng technques or an addtonal set of constrants n the optmzaton formulaton (strct gradent control). Although the strct gradent control allows a better control over the gradent of the denstes, t s too costly, due to the large number of addtonal constrants mposed to the optmzaton algorthm. Flterng means that an approxmated gradent constrant s beng mposed, usng some procedure related to mage manpulaton, whch s faster, but not so precse. Flterng has been used n dfferent forms, and the results obtaned show that t can control the checkerboard and, n some cases, control the complexty of the topology. In a general form, flterng means applyng a mathematcal operator to some value lke the densty, the gradent of the objectve functon or any other varable. Therefore, f one wants to smooth the spatal varaton of the desgn varable, an operator that prevents fast varatons of the fltered varable should be appled. The smplest operator s the average mean of the value of a gven patch of elements. The expresson for a general flter s (, ) (, ) (, ) g xy = f xy hxy (3) where g s the fltered value of f, due to the cooluton operator h. Flters are classfed by the way the neghbor elements are consdered: fxed grd, where only neghbors that share nodes and/or sdes of the central element are taken nto account, and spatal flters, where neghbors nsde a gven spatal neghborhood are consdered. As the man objectve of the flters s constranng the spatal varaton of the densty (frequency), from now on only lowpass flters are consdered. Avodng frequences hgher than the transton from vod to fll, n the dstance of two elements, makes t possble to avod the checkerboard, and changng the frequency of the flter, t s possble to control the complexty of the topology. For smooth (low frequency) flters, there should be no checkerboards nether tny renforcements. For very weak (hgh frequency) flters, there should be tny renforcements and maybe checkerboards. Therefore, the flter can be used as a complexty control. Recently, Bourdn, 2, studed a modfed verson of the tradtonal mnmum complance formulaton, where the densty feld s regularzed by the applcaton of a cooluton operator. The exstence of solutons and the coergence of the fnte element approxmatons are establshed. Fxed Grd Flters Fxed grd flters are the smplest ones. Bascally, the only dfference among these flters s the way the average value s consdered. Another advantage of ths type of flter s the closed relaton to the mage manpulaton flterng technques, where each element corresponds to a pxel (or a voxel). The man dsadvantage of fxed grd flters s ts dependency on the fnte element dscretzaton, whch lmts ts best performance to structures meshes. The frst attempt to avod the checkerboard was made by Bendsøe and Kkuch (Bendsøe, 995), usng a four elements patch, prevously used for ncompressble problems. It s a fxed grd flter, and t s appled over the densty feld. Other very smple fxed grd flter s the 3x3 neghborhood flter, 2 H = b b b 2 ( b + 2) b b where H s the dscrete cooluton operator. The weghtng factor b can be selected wthn the nterval [, + ], and smaller the b, weaker s the flter. Ths flter s usually appled over the densty feld, over some senstvty feld, wth the form 3 3 G(, j) = F( m, n) H( m+ C, n+ j C), (5) m= n= where C=(c+)/2 s used, c=3 for a 3 x 3 flter and m and n are the (relatve) centrodal postons of each neghbor element. The flter proposed by Fonseca and Kkuch, 998, can be seen as the frst attempt to mplement a strct gradent control n the topology optmzaton of contnuum structures. Ths flter s a fxed grd flter, where the weght factors are evaluated n advance to mpose, approxmately, a gradent constrant. The flter s appled over the upper and the lower move lmts of the SLP, and usng ths flter, one can control the complexty of the result. All of these flters are restrcted to structured meshes made of rectangular fnte elements. One very nterestng fxed grd flter s the one proposed by Swan and Kosaka, 997, where node and sde neghbors are selected. Each class of neghbor has a fxed weght, and the volume of the neghbor s taken nto account n the averagng process. The expresson for ths flter s (4) 294 / Vol. XXV, No. 3, July-September 23 ABCM

3 nen nen av + W av + W a V aˆ, j j 2 j j j= j= = nen nen V + WV j+ W2Vj j= j= where a s the varable beng fltered, â s the fltered value, W and W 2 are weghtng factors and V s the volume of an element of the mesh. Usng ths flter, one can have dfferent fnte elements n the same mesh, whch s a great advance when compared to other fxed grd flters. Swan and Kosaka flter s nadequate to mpose strct bounds on the spatal varaton of the densty feld; however t s effectve n preventng checkerboards and keepng some control on the complexty of the desgn. Spatal Flters A serous drawback of fxed grd flters, as the one proposed by Swan and Kosaka, s that ts area of nfluence s spanned by fnte elements neghborhood. Thus, refnng the mesh reduces the spatal area of nfluence of the flter, and leads to more complex desgns. Therefore, t s necessary to ntroduce spatal flters to avod mesh dependency. Another advantage of the spatal flters over most of the fxed grd flters s that controllng the area of nfluence of the spatal flter, t s possble to control the complexty of the topology. Ths control s not a very strct control. The mesh dependency s allevated wth the use of these flters, as for a constant area of nfluence, refnng the mesh ncreases the number of elements consdered, avodng renforcements smaller than some scale. Fgure llustrates the concept of spatal flter. In ths fgure, the element beng fltered has a neghborhood, selected by the radus of the flter. Elements wth centrods nsde the area of nfluence of the flter (crcle) are consdered n the averagng process. (6) where s the number of neghbors. As can be seen n the prevous equatons, ths flter does not take nto account the sze of the neghbors, makng t adequate to be used wth regular meshes. Sgmund, 997, uses a spatal flter on the gradents of the optmzaton problem. The flter proposed by Sgmund has the followng form ˆ f f = Wjρ j. ρ ρ k j = ρ kwj j = As dscussed before, ths flter s mesh ndependent, but does not take nto account the sze of the neghbors. In order to use a spatal flter wth any knd of mesh t s proposed a spatal verson of the flter proposed by Swan and Kosaka. In ths flter, the weghts are evaluated by the relatve poston of the neghbor to the central element. So, there are two possbltes, usng an average weght or usng ndvdual weghts for each neghbor. From these two possbltes, two flter defntons are proposed: the frst flter wll be referenced as AWSF (average weght spatal flter) where av + W a V j j j = aˆ =, V + WVj j = W R R j (9) () max j Rmax = () j = and the second formulaton as IWSF (ndvdual weght spatal flter) av + j j j j= aˆ =, V + WaV W V j j j = (2) where Fgure. Concept of spatal flter. The central element (darker) has an area of nfluence (crcle) whch spans the elements wth centrod nsde the crcle (gray). by The smplest spatal flter s the lnear flter, wth weghts gven { max } W = R R, j CV, CV = j I R R (7) max j j where R max s the radus of the flter, R j s the dstance between the centrods of elements and element j and CV s the set contanng the neghbors of the element. The average value s gven by W R R. max j j = (3) Rmax In the above equatons, a s the value of the varable beng fltered, â s the fltered value, V s the volume of the element, W s a weghtng factor, W s an averaged value of the weghtng factors and s the number of elements n CV. Ths flter can be appled to any varable, lke densty feld or the gradent feld. In ths work, the flter s appled over the upper and lower move lmt felds of the SLP. Dong ths, the densty feld and gradent felds are not dsturbed n an artfcal way. The only functon of the flter t to gude the possble values obtaned by the SLP at each teraton. j j j = aˆ =, j = Wa W j (8) Strct Gradent Controls Strct gradent controls have been used snce Nordson, 983. The approach proposed by Nordson was n the opposte drecton of the soluton proposed by Cheng and others. Whle Cheng, 98, relaxed the set of possble solutons, usng mcrostructures, J. of the Braz. Soc. of Mech. Sc. & Eng. Copyrght 23 by ABCM July-September 23, Vol. XXV, No. 3 / 295

4 Complexty Control n the Topology Optmzaton of Contnuum Structures Nordson restrcted ths set, restrctng the possble varaton of the thckness, and also solved the ll-posed problem of thckness optmzaton of a plate. After that, Bendsøe, 995, studed ths restrcton, assocatng t to bounds on the H norm. Therefore, even f the goal of usng a flter s to control the checkerboard, t also controls the spatal varaton of the densty, boundng ts norm. Usng ths nformaton, Fonseca and Kkuch, 998, proposed a fxed grd flter whose weghts are evaluated to restrct the spatal varaton of the densty. Dong ths, one can restrct the set of admssble solutons (by boundng the norm), and also control the complexty of the soluton. Petersson and Sgmund, 998, proposed a strct gradent control, where the varatons of the denstes are constraned drectly n the SLP problem, as a new set of constrants. Ths gradent control s very expensve, but allows a very strct constrant on the H norm, controllng the checkerboard and the complexty of the topology. Ths gradent control was mplemented for regular meshes. Cardoso and Fonseca, 999, proposed a more general mplementaton for ths gradent control, allowng ts use wth non regular meshes. The large number of constrants ntroduced to bound the varaton of the densty fled from each element to ts neghbors make ths approach too expensve for practcal applcatons. Also, the use of flterng technques s much cheaper and leads to smlar results Volume Mnmzaton wth Complance Constrant Clearly the effects of a strct gradent control and the effect of flterng are the same: constran the spatal varaton of the desgn varable. Controllng the varaton of the densty feld s actually a control on the spatal varaton of the materal propertes. Therefore t makes no sense to adopt a nonlnear relaton of the materal propertes wth respect to the densty. For example, usng a strct gradent control does not allow - desgns, so "gray" areas are always created (areas wth ntermedary denstes). To further penalze the appearance of gray areas, Petterson and Sgmund, 998, ncreased the penalty exponent of the consttutve relaton up to 5. Dong ths, the result s not related to the spatal varaton of the base materal, especally for a very smooth spatal varaton of the densty. It s practcally mpossble to buld a part wth large areas of ntermedate materal, even though t s possble to assocate ths SIMP "gray" materal to a partcular sotropc mcrostructure. Consequently, one can use a slghtly dfferent approach. Instead of penalzng the materal propertes, one can penalze the cost (objectve) functon. Therefore, f one wants to mnmze the amount of materal used n a partcular desgn, constranng the complance of the part, the followng formulaton can be used Mn Volume T S. t. f u F k =.. nlc (4) k k lmk where F lmk s the maxmum complance for a partcular load case k, and nlc s the number of load cases. Consderng the followng relaton between the volume and the desgn varable V ( ρ) = ρdω, (5) Ω the objectve functon and the set of constrants are coex, so the soluton may be unque, dependng on the materal nterpolaton. If a lnear relaton (upper bound) between the effectve propertes and the base materal s used, ths problem s coex and has a unque soluton. As ths parameterzaton represents an upper bound for the parameterzed materal propertes, the result usually has large extents of gray areas, due to the artfcally hgh stffness of the ntermedate materal. For ths reason, some researches penalze the stffness of ntermedate denstes usng a nonlnear relaton (SIMP). If nstead of penalzng the materal propertes, the cost of the ntermedate denstes s penalzed, we also avod large areas of ntermedate denstes n the result. The followng relaton n ( ρ, ) = ρ Ω, = (,] V n d n (6) Ω also penalzes the ntermedate denstes. Ths relaton makes the cost (volume) larger for ntermedate denstes, so the optmzer tres to avod ntermedate denstes. As can be seen, ths new objectve functon s non-coex, so usng n dfferent than one makes the problem non-coex, lke when penalzng the consttutve relaton. Therefore, a contnuaton approach can be used. The orgnal coex problem (no penalzaton) s taken as the startng pont. Once n the global mnma (t depends on the optmzer) of the desgn set (whch also depends on the gradent control) the problem s penalzed, changng the objectve functon. Ths new objectve functon s noncoex, so the problem wll coerge to some local mnma, whch contans fewer ntermedate denstes, as the penalzaton prevents t. If the coex formulaton s changed drectly to a hghly noncoex problem, the change n the result can be dramatc, so t s a good dea changng slghtly the non coexty of the objectve functon. Dong ths, t s also possble to estgate the nfluence of the non-coexty of the objectve functon n the complexty of the result. Ths s the same behavor encountered n the modfcaton of the consttutve relaton, where the exponent of the consttutve relaton can be related to some specal knd of mcrostructure and the penalzaton of the objectve functon can be related to some economc features, lke the prce of the ntermedate denstes (so constructng the sotropc mcrostructure can be related to an ncrease n the cost of the process). An addtonal penalzaton term can be consdered n Eq. (6), lke the one used by Fernandes, Guedes and Rodrges, 999, resultng n n ( ρ, ) = ρ Ω+ β ρ( ρ), = (, ], β (7) V n d n Ω Ω whch can be used to further penalze the desgn. The algorthm starts wth a coex objectve functon (n= and β =), changes to a non-coex objectve functon (n< and β =) and, f needed, makes t even more non-coex ( β >). Ths process can be automatc, changng the parameters after the coergence of each level. The need for addtonal penalzaton appears when the gradent of the desgn varable s constraned, so large gray areas, correspondng to the transtons from fll to vod, can be reduced. Mathematcal Programmng Among several optmzers, the sequental lnear programmng was chosen, due to ts smplcty and because the relable publc doman SLATEC lbrary s freely avalable (Hanson and Hrbert, 98). The lnear approxmaton for the proposed problem s Mn ne dv V ( ρ) + ( ρ ρ ) d ρ = St.. ne df df ρ Flm F ( ) k k ρ + ρ dρ = dρ (8) max α, α ρ ρ mn α, α ρ ( ( ) ) ( ) + ( ) mn max 296 / Vol. XXV, No. 3, July-September 23 ABCM

5 where ρ s the actual densty value for element, F k s the complance of load case k, α mn and α max are the mnmum and maxmum values for the move lmts and α s the move lmt offset factor. Ths local approxmaton of the objectve functon and constrants requres some frst order senstvtes wth respect to the desgn varables. The objectve functon n Eq. (7) s an explct functon of the desgn varable, so the senstvty s very easy to obtan: dv n ( 2 ) V. d n ρ ρ β ρ = + (9) The flexblty constrant s an mplct functon of the desgn varable, so the senstvty wth respect to the densty s more olved, but has a closed form. Dfferentatng the defnton of flexblty, T df df T du = u+ f (2) dρ dρ dρ where the senstvty of the dsplacements can be obtaned drectly from the equlbrum equaton, gves T df df T dk = 2 u u u. (2) dρ dρ dρ The last set of constrants n Eq. (8) are known as move lmts. They are added to keep the lnear approxmaton vald at the current pont. The move lmt strategy s crucal to the success of an SLP mplementaton and many researches have proposed dfferent strateges (Wujek and Renaud, 998a and 998b; Chen, 993). One of the smplest strateges s avodng the zgzag (Bazaraa and Shetty, 979), whch means that, f n the last two teratons the sgn of the change n one desgn varable changes, the move lmt of ths desgn varable s decreased by a factor of (-α ) and f there s no change n the sgn then the move lmt of ths varable s ncreased by a factor of (+α ). However ths scheme tends to be unstable n ths applcaton and was modfed to consder the last three teratons. After the evaluaton of the movng lmts, one of the proposed flters s appled separately, on the upper and on the lower movng lmts. Ths assures that the possble range of densty for each desgn varable s related to the surroundng elements. After the LP, elements denstes cannot dffer much from ts neghbors, avodng the checkerboard. As dscussed before, as the number of elements used n the averagng process ncreases, smpler s the topology. One drawback of the LP method, as ponted by Bruns and Tortorell, 2, s the loss of symmetry, due to the nature of the LP approxmaton. It was observed that the use of the flters proposed n ths work also allevate ths effect. Soluton of the Equlbrum Equatons Usng the strong form of the equlbrum equatons of the elastcty, ó + b =, (22) where ó s the Cauchy stress tensor and b s the body force vector, and consderng a lnear relaton between the stress tensor and the stran tensor t s possble to express Eq. (22) usng the materal propertes and the contnuum materal parameterzaton of Eq. (), wth p=, whch gves ( ρ ( )) EL u + b =. (24) Here the small dsplacement stran tensor s used T Lu ( ) = ( u + u ), (25) 2 so the results are vald only for small dsplacements (t s mportant to emphasze that both the flterng technque and the objectve functon can be used n non-lnear problems). The weak form of Eq. (22) s ( ) ρ ( ) dω= dω+ dγ, vlu ELuu b v tv (26) Ω Ω Γ where v s an arbtrary test functon. In ths work, the equlbrum problem s solved usng the fnte element method. The desgn doman s dvded n ne fnte elements, and t s assumed a local nterpolaton of the dsplacements and denstes. Usng the usual fnte element procedures used (Bathe, 996), the well known element stffness matrx s obtaned T ( ρ ) ρ K = B : E : B dω (27) Ω where a constant nterpolaton for the desgn varables s used for all elements n the mesh. Ths result s very mportant, because the densty s a smple scalng factor for the usual stffness matrx. The procedure to obtan the global stffness matrx s the subject of any fnte element book (Bathe, 996). The non conformng four nodes element (Kasper and Taylor, 2a and 2b), the 3D non conformng eght nodes element, and the GT9 trangular element wth drllng degrees of freedom (Yuqun and Yn, 994) are used n ths work. These are low order elements, so the checkerboard nstablty s not avoded. The use of these elements, however, mples n a better dsplacement soluton n the equlbrum problem, wth a small ncrease n the computatonal tme. The nonconformng formulaton allevates the parastc shear, so the fnal result s not corrupted by ths knd of fnte element error, especally n tny renforcements n bendng, so usual n topology optmzaton. The GT9 has a behavor between the 6 node trangular element and the constant stran trangle, wth a small ncrease n the computatonal tme when compared to the latter. Another advantage of the ncompatble elements s the stress recovery, allowng a better descrpton of the stress feld when the stress s of nterest (especally n non-lnear problems). Results In the followng, some results obtaned wth the use of the proposed formulaton are shown. The non-conformng bdmensonal four node element and the non-conformng three dmensonal eght node are used. The trangular element consdered s the GT9. For all examples, the materal s assumed as sotropc and elastc, wth E=* 7 Pa and Posson's rato equal to.3. All the appled loads have a value of N. In all fgures, a gray scale s used to represent the densty feld, where whte means vod ( ρ =* -3 ) and black means base materal. ( ) ó= ρelu, (23) J. of the Braz. Soc. of Mech. Sc. & Eng. Copyrght 23 by ABCM July-September 23, Vol. XXV, No. 3 / 297

6 Complexty Control n the Topology Optmzaton of Contnuum Structures Influence of the Penalzaton As explaned before, nstead of penalzng the consttutve relaton, one can penalze the objectve functon. To show the nfluence of the penalty exponent n Eq. (6) t s used the tradtonal 8 x 5 short cantlever beam (See Bendøe, 995, for ths and other standard problems) dscretzed by 26 (6 x 36) fnte elements. The lmt complance s equvalent to 2% of the complance obtaned for % of volume. Four dfferent values of the penalzaton exponent are used:, /2, /6 and /8, and the volume fractons obtaned for those exponents are 62.3%, 62.95%, 64.53% and 64.6%, respectvely. When the exponent s equal to one, there s no penalzaton, so the result contans large areas wth ntermedate denstes. As the exponent s decreased, the relaton becomes non-coex, penalzng ntermedate denstes. Fgure 2 shows the topology obtaned wth these exponents. Smaller the exponent, fewer the gray areas. Ths s a good feature, but the noncoexty also makes the dscrete soluton non-unque. To avod ths dependency wth respect to the ntal densty dstrbuton, we used a contnuaton approach. Frst, the lnear problem s solved untl coergence. After that, the exponent n s decreased and the problem contnues untl the new coergence s reached. Ths approach needs more teratons, but t s effectve and we also observed that t s more stable than startng wth a noncoex problem. For the same problem of the Fg. 3, the same soluton for the random and homogeneous ntal densty dstrbuton s obtaned, as shown n Fg. 4. No assumpton on the ntal denstes dstrbuton was made, so t can be an nfeasble pont. Table 2 shows the volume fractons obtaned wth ths procedure. Two volume fractons are shown: the frst corresponds to the coerged coex soluton and the second to the coerged penalzed soluton. As n the prevous example, the second column n Fg. 4 s obtaned wth the use of the IWSF flter and the thrd wth the used of the AWSF flter. Table 2. Volume fractons obtaned wth the contnuaton approach, Fg. 4. Flter / Intal densty dstrbuton Volume fracton n = / n = 8(%) IWSF / Homogeneous / IWSF / Random / 6. AWSF / Homogeneous / AWSF / Random / 59.6 Table 3. Volume fractons obtaned for topologes n Fg 5. Fgure 2. Influence of the penalzaton n equaton Eq. (6). The penalzaton s ncreased from top left to bottom left, clockwse (n=, 2, 6 and 8). To show the effects of the non-coexty of the penalzed objectve functon, the prevous example s consdered agan, but wth a mesh of 3525 (75 x 47) fnte elements. The lmt complance s set to 25% of the complance obtaned for % of volume fracton and the penalzaton exponent s set to /8. The two flters proposed are used, wth a radus of.66* - m, (equvalent to select eght neghbors for each element). Two dfferent ntal densty dstrbutons are used, as shown n Fg. 3 (frst column), a homogeneous wth ρ =.5 and a random dstrbuton. The second column n Fg. 3 shows the results obtaned wth the use of the IWSF flter and the thrd wth the use of the AWSF flter. Flter / Intal densty dstrbuton Volume fracton for n=8 (%) IWSF / Homogeneous IWSF / Random AWSF / Homogeneous 25.3 AWSF / Random Fgure 4. Results obtaned wth the contnuaton approach. The frst column shows the ntal densty dstrbutons, the second row shows the results obtaned wth the IWSF flter and the thrd column shows the results obtaned wth the AWSF flter. Fgure 3. Non coexty of the objectve functon, Eq. (6), for exponent /8 and dfferent ntal densty dstrbutons. The fnal volume fractons are shown n Tab.. Table. Volume fractons obtaned for the second example, Fg. 3. Flter / Intal densty dstrbuton Volume Fracton (%) IWSF / Homogeneous 59,74 IWSF / Random 6,4 AWSF / Homogeneous 59,52 AWSF / Random 59,78 Fgure 5 shows the soluton of another common problem n the lterature, wth the use of the contnuaton method. The doman s a untary square and the lmt complance s set to 3% of the complance obtaned wth a volume fracton of %. In ths example, 8 (3 x 6) fnte elements are used and the radus of the flters s 2.6* -2 m (equvalent to 8 neghbors). The thrd row n Fg. 5 s obtaned wth the use of the AWSF flter and the fourth wth the use of the IWSF flter. Table 3 shows the volume fractons obtaned for ths example. 298 / Vol. XXV, No. 3, July-September 23 ABCM

7 Fgure 5. Results obtaned wth the contnuaton approach. The frst column shows the geometry and boundary condtons for ths example. The second column shows the ntal densty dstrbuton, the thrd column the results obtaned wth the AWSF flter and the fourth column the results obtaned wth the use of the IWSF flter. Influence of the Flter The results shown above were obtaned wth flterng otherwse checkerboard would have been present. For the same problem and dscretzaton, t s possble to vary the radus of the flter to obtan a smpler topology or to obtan a more complex one. If one chooses a very small radus, checkerboard can appear, so there s a lower lmt on the value of the radus. For a coarse mesh, the flter can blur the result and many levels of penalzaton would be requred, so there s a mnmum resoluton to apply the flter, as observed before by Fonseca and Kkuch, 998. Ths s not a problem, because the fnte element soluton requres a mesh good enough to represent the problem and one can thnk n the fnte element soluton and n the optmzaton problem when dong the mesh. Fgure 6 shows the nfluence of the sze of the flter for a fxed mesh. As the radus of the flter s ncreased, thn renforcements are no longer present n the topology. Ths s very mportant, because the number of holes usually ncreases the cost of the part. Another mportant thng s that the fnte element soluton for these thn renforcements can be naccurate because they are usually one or two elements wde, especally when low order fnte elements are used n bendng. Therefore, wth the use of the flter, one can assure a mnmum mesh sze for some parts of the topology. Ths s not a strct control, but as shown t works and wth some experence the desgner can estmate the radus of the flter to ft the characterstcs of the desgn. For the short clamped beam, wth a mesh of 63 fnte elements, we changed the radus of the flter, to show ts nfluence n the complexty of the topology. Fgure 6 shows the topology obtaned for ncreasng values of the radus of the flter. The values correspond to a maxmum number of 4, 8 and 2 neghbors. It s clear that the larger the number of elements nsde the radus of the flter, smpler s the topology. patterns are shown n the frst column of the Fg. 7. The second column shows the solutons obtaned wthout flterng. It s clear that the mesh pattern changes the checkerboard, showng how strong the effects of the mesh qualty n the topology optmzaton are. When usng the flter, the same result s obtaned, ndependent of the mesh pattern (thrd column). The flter used n ths example s the IWSF and the radus s fxed for the three meshes (2* - m). It must be observed that the meshes n Fg. 7 have a dfferent number of fnte elements. The volume fractons obtaned for ths example are 63.36% for the frst pattern, 63.3% for the second pattern and 65.57% for the last pattern. Multple load cases The proposed formulaton can be used for multple load cases. As shown n Eq. (4), each load case represents one constrant. The computatonal cost assocated to each constrant s very low and t s possble to use as many load cases as needed. To exemplfy the soluton of multple load cases problems, t s consdered the two load cases short beam (Bendsøe et al., 995), dscretzed wth 64 fnte elements. The contnuaton method s used, wth fnal exponent equal to /8. Fgure 8 shows the results obtaned usng the IWSF flter and Fg. 9 shows the results obtaned usng the AWSF for the same value (8.8* -2 m) of the radus. Table 4 shows the volume fractons obtaned for ths example. Table 4. Volume fractons obtaned for the two-load cases example. Flter / Intal densty dstrbuton Volume fracton for n=8 (%) IWSF / Homogeneous IWSF / Random AWSF / Homogeneous AWSF / Random Fgure 7. Influence of the mesh pattern. The frst column shows the mesh patterns, the second column shows the results obtaned wthout flterng and the thrd column shows the results obtaned wth flterng. The proposed flter technque allevates the mesh nfluence. Fgure 6. Results obtaned for three dfferent flter raduses. The radus s ncreased from left to rght. The proposed flters can also mnmze the nfluence of the mesh pattern on the topology. It s well known that the way the fnte elements are dsposed n the mesh can nfluence the result. Ths s known as numercal ansotropy. Most of the papers dealng wth topology optmzaton use a regular quadrlateral mesh, so the mesh qualty s not consdered. To show the nfluence of the proposed flterng technque, the short clamped beam s used. The lmt complance s set to 2% of the complance obtaned for % volume fracton and dfferent mesh patterns are used. The mesh Fgure 8. Short clamped beam wth two load cases. The frst column shows the ntal densty dstrbutons and the second column shows the results obtaned wth the IWSF flter. J. of the Braz. Soc. of Mech. Sc. & Eng. Copyrght 23 by ABCM July-September 23, Vol. XXV, No. 3 / 299

8 Complexty Control n the Topology Optmzaton of Contnuum Structures The results obtaned are very close to the results obtaned n references where a permeter constrant s used (Fernandes, Guedes and Rodrges, 999). It s very nterestng verfyng that smpler topologes, obtaned wth flterng, have smaller permeter than the complex ones, as predcted by the permeter control theory. Although dfferent, these approaches lead to smlar results n terms of complexty. Fgure 9. Short clamped beam wth two load cases. The frst column shows the ntal densty dstrbutons and the second column shows the results obtaned wth the AWSF flter. Three-dmensonal Results The proposed formulaton can be appled to three-dmensonal problems, wth no modfcatons. To llustrate three-dmensonal results, t s used as desgn doman a untary cube, clamped n one face. In the frst example, a pont load s appled n the bottom of the opposte face. The result s shown n Fg.. Due to the symmetry of the problem, only half doman s dscretzed wth 4 elements. The AWSF flter s used wth a radus equvalent to take nto account each edge neghbor of each element. The lmt complance s set to 2.6* -5 Nm. Fgure. Three dmensonal short clamped beam. Just half of the result s shown due to the symmetry of the problem. Fgure llustrates the result obtaned for the same geometry, but wth the load appled n the center of the opposte face. The same mesh s used and the lmt complance s 5.5* -6 Nm (4% of the complance for % volume fracton). Both results where obtaned wth the contnuaton method, wth a penalzaton exponent of /8. The results where exported to the ANSYS format, usng a threshold value of.9 (no element wth densty less than.9 s consdered). The complance evaluated by ANSYS dffers less than % for all examples. Fgure. Three dmensonal short clamped beam. Just half result s shown due to the symmetry of the problem. Conclusons A new spatal flter was proposed, together wth a penalzed verson of the tradtonal formulaton for volume mnmzaton. The spatal flter (n two dfferent formulatons) can prevent the checkerboard nstablty and also controls the complexty (number of holes) of the topology. It s shown that usng ths flter, mesh nfluence can be allevated. Ths s mportant, due to the mnmum requrements of mesh qualty to ensure a good fnte element approxmaton for the response of the structure. Low order elements have a poor behavor n bendng, so t s advsable to use mproved formulatons, lke some nonconformng and subntegrated fnte elements n structural optmzaton, especally when desgnng low fracton or very flexble structures. The objectve functon used n ths work allows reducng gray areas, ncreasng the cost of the ntermedate denstes, whch are expensve to buld. A contnuaton method was used to further penalze the ntermedate denstes, when t s coenent. Some results wth multple load cases and some 3D results were shown ndcatng that ths formulaton s very general and can be used wth any knd of mesh or fnte element. Lke other formulatons based on mathematcal programmng methods, other types of constrants, lke dsplacement constrants, can be added wth lttle effort. As shown n some examples the use of non-regular meshes can nduce very strong nfluence of the fnte element soluton on the fnal topology. In these cases, the use of mesh ndependent flters can allevate ths nfluence and also control the complexty of the topology. It s mportant to notce that the ntroducton of the flter restrcts the possble solutons, because the set of admssble solutons s modfed by the flter. Therefore, t s pontless to compare the results obtaned wth dfferent flterng technques, because they may not belong to the same set of admssble solutons. Features to be compared are the mesh ndependence, checkerboard control and complexty control. Acknowledgements The authors gratefully acknowledge the support of ths research by CAPES and the computatonal facltes of CESUP-UFRGS. References Ambroso, L., Buttazzo, G., 993, An optmal desgn Problem wth Permeter Penalzaton, Calc. Var.,, pp Bathe, K., 996, Fnte Element Procedures, Prentce-Hall. Bazaraa, M. S., Shetty, C. M., 979, Nonlnear Programmng - Theory and Algorthms, John Wley & Sons, New York. Beckers, M., 997, Optmsaton de Structures en Varables Dscretes, Uerste de lege, Collecton des Publcatons de la faculté des Scence Applquées, No. 8. Bendsøe, M. P., 995, Optmzaton of Structural Topology, Shape and Materal, Sprnger-Verlag, New York. Bendsøe, M. P., Díaz, A. R., Lpton, R., Taylor, J., E., 995, Optmal Desgn of Materal Propertes and Materal Dstrbuton for Multple Loadng Condtons, Internatonal Journal of Numercal Methods n Engneerng, Vol. 38, pp Bendsøe, M. P., Kkuch N., 988, Generatng Optmal Topologes n Structural Desgn Usng Homogenzaton Method, Computer Methods n Appled Mechancs and Engneerng, Vol. 7, No. 2, pp / Vol. XXV, No. 3, July-September 23 ABCM

9 Bendsøe, M. P., Sgmund, O., 999, Materal Interpolaton Schemes n Topology Optmzaton, Archve of Appled Mechancs, Vol. 69, pp Bourdn, B., Flters n topology optmzaton, In. J. Numer. Meth. Engng, 2: 5: Bruns, T. E., Tortorell D. A., Topology optmzaton of non-lnear elastc structures and complant mechansms, Comput, Methods Appl. Mech. Engrg., 9 (2) Cardoso, E. L., Fonseca, J., S., O., 999c, Spatal Gradent Control n the Structural Topology Optmzaton, Frst ASMO UK/ISSMO Conference on Engneerng Desgn Optmzaton, Ilkley, West Yorkshre, UK. Chen, T. 993, Calculaton of the Move Lmts for The Sequental Lnear Programmng Method, Internatonal Journal of Numercal Methods n Engneerng, Vol. 36, pp Cheng, K.T, 98, On Non-Smoothness n Optmal Desgn of Sold, Elastc Plates, Int. J. Solds Structures, Vol. 7,pp Díaz, A., Sgmund, O., 995, Checkerboard Patterns n Layout Optmzaton, Structural Optmzaton, Vol., No., pp Fernandes, P., Guedes, J., M., Rodrgues, H., 999, Topology Optmzaton of Three-Dmensonal Lnear Elastc Structures wth a Constrant on Permeter, Computers & Structures, Vol. 73, No. 6, pp Fonseca, J. S. O., Kkuch, N., 998, Dgtal Imagng Flterng n Topology Optmzaton, Computatonal Mechancs New Trends and Applcatons, CIMNE, Span. Hanson, R. J., Hrbert, K., L., 98, A sparse Lnear Programmng Subprogram, Report SAND8-297, Sanda Natonal Laboratores. Hassan, B., Hnton, E., 998a, A Revew of Homogenzaton and Topology I - Homogenzaton Theory for Meda Wth Perodc Structure, Computer and Structures, Vol. 69, pp Hassan, B., Hnton, E., 998b, A Revew of Homogenzaton and Topology II- Analtycal and Numercal Soluton of Homogenzaton Equatons, Computer and Structures, Vol. 69, pp Jog, C., Haber, R. B., 996, Stablty of Fnte Element Models for Dstrbuted-Parameter Optmzaton and Topology Desgn, Computer Methods n Appled Mechancs and Engneerng, Vol. 3, pp Kasper, E. P., Taylor R. L., 2a, A mxed-enhanced stran method Part I: Geometrcally lnear problems, Computers & Structures, 75, pp Kasper, E. P., Taylor R. L., 2b, A mxed-enhanced stran method Part II: Geometrcally nonlnear problems, Computers & Structures, 75, pp Nordson, F. I., 983, Optmal Desgn of Plates wth a Constrant on the Slope of the Thckness Functon, Int. J. Solds Structures, Vol. 9, pp Park, Y. K., 995, Extensons of Optmal Layout Desgn Usng the Homogenzaton Method, PhD theses, Uersty of Mchgan. Petersson, J., Sgmund, O., 998, Slope constraned Topology Optmzaton, Internatonal Journal of Numercal Methods n Engneerng, Vol. 4, pp Sgmund, O. 997, On the desgn of complant mechansms usng topology optmzaton, Mechancs of Structures and Machnes, 25(4), pp , 997. Swan, C. C., Kosaka, I., 997, Vogt-Reuss Topology Optmzaton for Structures wth Lnear Elastc Materal Behavor, Internatonal Journal of Numercal Methods n Engneerng, Vol. 4, No., pp Wujek, B. A., Renaud, J., E., 998a, New Adaptatve Move-Lmt Management Strategy for Approxmate Optmzaton, Part, AIAA Journal, Vol. 36, No., pp Wujek, B. A., Renaud, J., E., 998b, New Adaptatve Move-Lmt Management Strategy for Approxmate Optmzaton, Part 2, AIAA Journal, Vol. 36, No., pp Yuqun, L., Yn, X., 994, Generalzed Conformng Trangular Membrane Element wth Rgd Rotatonal Freedoms, Fnte Elements n Analyss and Desgn, Vol. 7, pp J. of the Braz. Soc. of Mech. Sc. & Eng. Copyrght 23 by ABCM July-September 23, Vol. XXV, No. 3 / 3

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

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

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

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

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

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

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

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

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

More information

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

More information

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

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

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

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

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

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

SENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION.

SENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION. SENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION. P. Duysnx, W.H. Zhang, C. Fleury. Aerospace Laboratory, LTAS, Unversty of Lège B-4000 LIEGE, BELGIUM. ABSTRACT.

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

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

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

陳申岳 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

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

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

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

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

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

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

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

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

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

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

A unified library of nonlinear solution schemes

A unified library of nonlinear solution schemes A unfed lbrary of nonlnear soluton schemes Sofe E. Leon, Glauco H. Paulno, Anderson Perera, Ivan F. M. Menezes, Eduardo N. Lages 7/27/2011 Motvaton Nonlnear problems are prevalent n structural, flud, contnuum,

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

Electrical analysis of light-weight, triangular weave reflector antennas

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

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

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

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

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

A 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

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2011; 3:485-494 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH S. Gholzadeh *,, A. Barzegar and Ch. Gheyratmand

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

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

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

More information

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

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

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

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

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

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

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

More information

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

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

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

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

More information

Lecture #15 Lecture Notes

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

More information

Related-Mode Attacks on CTR Encryption Mode

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

More information

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

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

CS246: Mining Massive Datasets Jure Leskovec, Stanford University CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd

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

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 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 information

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

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

More information

Simplification of 3D Meshes

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

The Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples

The Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples Xanpng Huang, Qng Tan, Janfe Mao, L Jang, Ronghua Lang The Theory and Applcaton of an Adaptve Movng Least Squares for Non-unform Samples Xanpng Huang, Qng Tan, Janfe Mao*, L Jang, Ronghua Lang College

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

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

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

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

More information

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

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

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