Freeform Optimization: A New Capability to Perform Grid by Grid Shape Optimization of Structures
|
|
- Juliet McDowell
- 5 years ago
- Views:
Transcription
1 6 th Chia-Japa-Korea Joit Symposium o Optimizatio of Structural ad Mechaical Systems Jue 22-25, 200, Kyoto, Japa Freeform Optimizatio: A New Capability to Perform Grid by Grid Shape Optimizatio of Structures Jua Pablo Leiva Vaderplaats Research ad Developmet, Ic Gardebrook, Ste. 5 Novi, MI 48375, USA jp@vrad.com Abstract This paper presets a ew capability for performig a special type of shape optimizatio. Traditioal shape optimizatio is ofte performed by usig perturbatio vectors that are liked with grid coordiates ad desig variables which a optimizer ca chage. I this work, these shape perturbatio vectors are split so that each grid, ad/or a set of earby grids, ad/or a set of grids liked by a maufacturig costrait, has its ow desig variable. This split produces great variability i the aswers. I this work, possible distortios that could happe durig a optimizatio ru are preveted with automatically geerated distortio costraits ad/or by mesh smoothig. To distiguish this capability from stadard shape optimizatio, we amed this capability freeform optimizatio. This capability could be see as a geeralizatio of topography optimizatio sice it ca reproduce most of topography results, but it is differet tha topography optimizatio sice it ca be used to desig ay type of structure icludig solids ad trusses whereas topography is mostly used for shell structures. Several examples which show the applicatio of freeform are preseted. Oe example will show the use of freeform optimizatio to fid optimal rib locatios i a solid structure. Other examples will demostrate the use of freeform optimizatio to fid optimal bead locatios i shell structures. Keywords: Freeform, Shape, Topography, Optimizatio. Itroductio Traditioal shape optimizatio has bee successfully utilized to optimize a variety of structures for may years. However, i today s competitive eviromet, where ew desigs are expected to perform better tha previous oes ad at the same time to be more ecoomical, traditioal shape optimizatio has started to be isufficiet. This situatio was similar for sizig optimizatio some years ago. Our respose the, as software developers, was to improve o sizig optimizatio by developig topometry optimizatio []. Topometry optimizatio is essetially a automatically geerated elemet-by-elemet sizig optimizatio. So whe faced with the challege to improve o shape optimizatio, we thought why ot create somethig like a grid-coordiate by grid-coordiate optimizatio? Researchig the literature we ca fid some papers o which each grid-coordiate is desiged. The problem with this approach is that it ca easily distort fiite elemet meshes. I additio, this approach does ot give eough cotrols to be useful. Because of that, we have bee usig topography optimizatio for shell structures ad occasioally for solid structures. Topography optimizatio works by automatically creatig perturbatio vectors which i geeral are ormal to the desigable surface areas [2]. I Geesis, for shells, topography works directly [3]. For solids it eeds to use a exteral shell ski that is used to desig the surface grids of the structure ad mesh smoothig to move the iterior odes. The use of topography optimizatio has give good results but has several limitatios. The good results ca be attributed to the fact that it uses perturbatio vectors which are well defied. The most oticeable limitatios are that: a) topography optimizatio ca easily distort the mesh, b) topography oly works with certai types of elemets ad c) topography ca ot produce beads with variable heights (user cotrolled maximum heights). Recetly, we have developed a method to overcome the first limitatio. The method uses iterally created distortio costraits. Distortio costraits will be discussed later i this paper as they are ew ad very importat to freeform optimizatio. Traditioal shape optimizatio that uses perturbatio vectors does ot have the last two limitatios described. I other words, it is ot limited to ay type of elemets ad perturbatio vectors ca take almost ay shape we wat. It should be metioed here that there are several ways to create perturbatio vectors ad they ca be created either iterally i the software (for example usig the Domai elemets [4]) or usig a desig pre-processor like Desig Studio [5]. A questio arises: Ca we take advatage of the best of topography (each grid has its ow variable) ad the best of shape optimizatio (perturbatio vectors are kow, have cotrolled shape ad work with all elemets)? The implatatio of freeform is a attempt to aswer that questio. The idea behid freeform is the followig: The program takes a existig perturbatio vector ad the breaks it ito idividual perturbatios so that each grid has its ow perturbatio vector ad its correspodig desig variable. Because of this, we ca defie freeform optimizatio capability as a grid-by-grid shape optimizatio capability.
2 2. Approximatio Cocepts Before goig ito the details o how freeform has bee implemeted, a explaatio of how the Geesis program solves a optimizatio problem is preseted ext. I Geesis, a structural optimizatio problem is solved usig the approximatio cocepts approach. I this approach, a approximate aalysis model is created ad optimized at each desig cycle. The desig solutio of the approximate optimizatio is the used to update the fiite elemet model, ad a full system aalysis is performed to create the ext approximate aalysis model. The sequece of desig cycles cotiues util the approximate optimum desig coverges to the actual optimum desig. I the mid-seveties Schmit et al. itroduced approximatio cocepts for traditioal structural optimizatio [5-6]. These cocepts, i the eighties ad early ieties, were refied to improve the quality of approximatios [7-9]. The approximate problem is solved usig either the BIGDOT [] or DOT [0] optimizers. The purpose of usig the approximatio cocepts approach is to reduce the umber of desig cycles to reduce time. With these approximatios a good egieerig aswer ca be typically foud i 0 desig cycles. 3 Shape Optimizatio 3. The Perturbatio Vector Shape optimizatio is used to fid the optimal locatio of grids i a structure. I the Geesis software, shape optimizatio uses perturbatio vectors. The perturbatio vectors dictate how much ad i which directio the coordiates of the grids ca chage whe its correspodig desig variable chages i oe uit. The effect of oe perturbatio vector is show i Fig. below. Figure. Perturbatio Vector The followig figure shows how a perturbatio vector affects the locatio of the grids. A value of 0.0 o the desig variable causes o movemet. A value of.0 causes the structure to move the same as the perturbatio vector. If the desig variables take a value larger tha.0, the the grid movemets are larger tha the perturbatio. I Fig. 2, below, it is show how a shape would look if the desig variable associated to the perturbatio vectors took a value of 5.0. Figure 2. Shape Chages 3.2 Grid Locatio Update Whe there are multiple perturbatio vectors, the grid locatios are updated by addig to the iitial coordiate a liear combiatio of all perturbatio vectors ad its correspodig desig variables. The equatios used i shape optimizatio to iterally calculate the ew locatios of the grids are: X i = X io + DV j * XP ij j () Y i = Y io + DV j * YP ij j Z i = Z io + DV j * ZP ij j I equatios (), X i, Y i ad Z i are the updated coordiates of the grid i. X io, Y io ad Z io are the iitial coordiates of the grid i. XP ij, YP ij ad ZP ij are the compoets of the j th perturbatio vector correspodig to grid i. Fially, DV j is the value of desig variable j. These equatios are also used by topography ad freeform optimizatio.
3 4. Freeform Optimizatio We ca defie freeform optimizatio as a grid-by-grid shape optimizatio capability i which a give perturbatio vector is split to icrease the variability of the aswers. Besides the stadard costraits, three special costraits ca be used to improve the quality of aswers: grid fractio costraits, distortio costraits ad maufacturig costraits. 4. Split Perturbatios The process to split perturbatios is quite simple. For each grid it desigs, a ew perturbatio is created usig the compoets associated with that grid while the other compoets are igored. Figure 3. Perturbatio Split 4.. Split Perturbatio Example The followig example shows a perturbatio vector that is split ito multiple oes. A flat plate is used. Fig. 4(a) shows the iitial perturbatio vector that is used to simultaeously desig 25 grids. Fig. 4(b-d) shows 3 of the 25 perturbatio vectors geerated. I these figures, the color bars represet the magitude of the perturbatios. Red idicates that the grid has moved to its maximum locatio ad blue idicates that the grids have ot moved. (a) Iitial Pert. Vector (b) st Pert. Vector (c) 2d Pert. Vector (d) 25th Pert. Vector Figure 4. Split Perturbatio 4.2 Grid fractio Costraits Grid fractio costraits are used to limit the umber of grids that ca move i the desigable space. These costraits typically create more ecoomical ad clea desigs. There are several optioal expressios to implemet this type of costrait. Here we will oly show oe of them: i= UBgfr gfr( x, K, x) = 0.0 (2) UBgfr where, gfr is the grid fractio costrait, x i is the ith desig variable, is the umber of desig variables i the freeform regio ad UB gfr is the upper boud value of the costrait. Typical values for the grid fractio upper bouds are 0.2, 0.35 ad 0.5. These values are for limitig the umber of grids that move to 20%, 35% ad 50%, respectively. The third example, i sectio 8 of this paper, shows the effect of usig differet grid fractio costraits. 4.3 Distortio Costraits The mai drawback of shape optimizatio ad ay other special case of it such as topography or freeform optimizatio is that the elemets of the mesh ca get distorted. Distorted elemets reduce the accuracy of the fiite elemet results ad produce aswers that are typically stiffer tha the correct aswers. Moreover, distorted elemets might yield to egative or zero jacobias of the stiffess matrices producig either usolvable system of equatios or icorrect aswers. For these x i
4 reasos, it is importat to prevet this problem. The traditioal way to solve this problem is by either usig mesh smoothig where the grids of the mesh are iterally moved to reduce distortio or by simply reducig the scope of the desig variables. The first method is very useful, while the secod method is icoveiet ad limitig because it reduces the chace to improve the desig. I the Geesis program, we added the ability to automatically create a distortio costrait so the problem is attacked directly. Each type of measurable distortio parameters, such as the jacobia of the stiffess matrix, aspect ratio, iterior agle ad warpig, are cosidered. The type of equatio used is the followig: Distortiol ( x, K, x) UBgdl gdl ( x, K, x) = 0.0 (3) UB ad/or LBgdl Distortiol ( x, K, x) gdl ( x,, x) = 0.0 LB gdl K (4) where, gd l is a grid distortio costrait associated to Distortio l, x i is the ith desig variable, is the umber of desig variables i the freeform regio, UB gdl is the upper boud value of the costrait ad LB gdl is the lower boud value of the costrait. The values for the distortio bouds are elemet depedet ad distortio type depedet. These costraits are geerated automatically. These costraits are also used with shape ad topography optimizatio. 4.4 Maufacturig Costraits If there are maufacturig costraits, such as symmetry costraits, the split process is chaged to esure that valid perturbatios are created. Examples of maufacturig costraits are: plaar symmetries, cycle symmetries ad extrusio. Examples i sectios 6 to 9 show the use of maufacturig costraits. 4.5 The Freeform Optimizatio Problem The freeform optimizatio problem with distortio ad grid fractio costraits ca be stated as: Mi F( x, x, K, x ) x i such that : g ( x, x, K, x ) 0; j gfr ( x, x, K, x ) 0; k gd ( x, x, K, x ) 0; l j =, m l =, d xli xi xui; i =, where F is the objective fuctio, g j are the stadard costraits, g frk are the grid fractio costraits, g dl are the distortio costrais, x i is the ith desig variable ad xl i ad xu i are the lower ad upper side costraits. This optimizatio problem is solved usig approximatio cocepts described i sectio Advatages ad Disadvatages of Freeform Optimizatio with respect to Other Optimizatio Types 5. Freeform vs. Shape Optimizatio The mai advatage of freeform over shape optimizatio is that it ca produce more variability tha shape optimizatio. The mai disadvatage of freeform over shape optimizatio is that it has more chaces tha shape optimizatio to distort the fiite elemet meshes. gdl k =, gf 5.2 Freeform vs. Topography Optimizatio The mai advatage of freeform over topography optimizatio is that it works with ay type of elemets. Topography is mostly used with shells ad occasioally with solids. Aother advatage of freeform over topography is that freeform ca geerate beads with variable heights. See sectio 9 of this paper for a example which illustrates this latter metioed advatage. 5.3 Freeform vs. Topology Optimizatio The mai advatage of freeform over topology optimizatio is that it ca add extra material outside the borders. Topology optimizatio ca oly take material away. The mai advatage of topology over freeform is that topology ca produce iterior cavities ad that it ca ot distort meshes. (5)
5 6. Example. Rib Patter Optimizatio of a Solid Structure 6. Descriptio of the Problem This example demostrates the use of freeform optimizatio to fid the optimal locatio of rib patters i a solid structure. The overall dimesios of the structure are 40 mm x 8 mm x.5 mm. The structure is assembled with 8640 hexahedral elemets ad 988 grids. The Youg s modulus is 207,000 MPa ad the Poisso s ratio is 0.3. There are three torsio load cases. I the first load case, oe ed is fixed o its two corers while the other ed is subject to a pair of loads that produce a twist. I the secod load case, the loads ad boudary coditios are reversed from the first load case. I the third load case, the four corers of the structure are costraied while the ceter of the structure is loaded i torsio. The three load cases ca be see i Fig. 5. Figure 5. Load cases A perturbatio vector that ca move the top ad bottom surface grids is applied as show i Fig. 6. The colors i this figure show the magitude of the perturbatio. The red color represets the maximum movemet which is.2 mm, the blue color represets o movemet. I Fig. 6 grids i red are desigable while the grids i blue are ot desigable. Fig. 6 ca show the compoets of the perturbatio vector i the top. The compoets i the bottom are similar to the oes i the top but istead of poitig upward, they poit dowward makig the perturbatio vector symmetric with respect to the midsize x-y plae that passes through the ceter of the structure. Figure 6. Perturbatio Vector The objective fuctio of the problem is to miimize the sum of the ormalized strai eergy of the three torsio load cases. A grid fractio costrait of 0.45 is used to reduce the umber of grids that move. I additio, maufacturig costraits are used to obtai triple symmetry about the ceter of the structure. 6.2 Results Fig. 7 shows four views of the freeform optimizatio results. The fial desig is triple symmetric, as imposed, ad the 45% grid fractio seems to be satisfied. The output file of the program, ot show here, cofirms that. Figure 7. Freeform Results
6 Usig the provided perturbatio vector, show i Fig. 6, freeform optimizatio automatically geerated 608 perturbatio vectors ad 608 correspodig desig variables. These 608 perturbatio vectors cotrolled the desig of 4650 surface grids. A plot of the objective fuctio versus the desig cycle umber ca be see i Fig. 8(a). The objective fuctio was reduced from 3.0 to I other words, the fial structure is early 5 times stiffer tha the origial oe. Fig. 8(b) shows that the ormalized mass chaged approximately 60%. I this case, the optimizatio process took 9 desig cycles to coverge. At the ed of the optimizatio there were o violated costraits. (a) Objective fuctio (b) Normalized Mass Figure 8. Optimizatio History Results 6.3 Validatio of the Problem To validate the freeform optimizatio results of this problem, a topology optimizatio ru is performed o a equivalet problem. Sice topology optimizatio ca ot add material, two layers of elemets are added to the top ad bottom of the structure. The topology model is assembled with 8,368 hexahedral elemets ad 22,228 grids. The topology model uses the same objective fuctio ad maufacturig costraits. I additio, a mass fractio costrait of 0.45 is used. The topology desigable area was limited to the added material area. Figure 9. Freeform Optimizatio vs. Topology Optimizatio Desigs 6.4 Compariso of Freeform ad Topology Optimizatio Results Freeform ad topology optimizatio iitial ad fial desigs are show i Fig. 9. From this figure, it ca be see that both freeform ad topology optimizatio results suggest similar rib patters. This topology optimizatio result validates the freeform results.
7 7. Example. Bead Patter Optimizatio Usig Differet Types of Maufacturig Costraits 7. Descriptio of the Problem This example demostrates the use of freeform optimizatio for fidig the optimal locatio of bead patters usig differet types of maufacturig costraits. The example uses a plate structure. The overall dimesios of the plate are 40 mm by 8 mm. The thickess of the plate is mm. The structure is assembled with 720 quadrilateral elemets ad 779 grids. The Youg s modulus is 207,000 MPa ad the Poisso s ratio is 0.3. The plate has two corers costraied i oe ed ad it is subjected to torsio loads i the other ed, as show i Fig. 0(a), below. A simple perturbatio vector is created usig a uiform patter as show i Fig. 0(b). The objective fuctio of the problem is to miimize the strai eergy to maximize the stiffess of the structure. There are three alterative desigs ad they are described below. (a) Loadig Coditio (b) Perturbatio Vector Figure 0. Iputs to the problem 7.2 Alterative Desig. Symmetrical Desig I this case a maufacturig costrait is used to eforce symmetry with respect to the x-z plae that passes through the ceter of the plate. A bead fractio costrait of 0.33 is used to limit the amout that the grids ca move. I additio, the grids are restricted to move oly upward. (a) Sigle Symmetry Desig (b) Objective ad Max Costrait Violatio History Plots Figure. Freeform Results for Sigle Symmetry Desig For this alterative, freeform optimizatio automatically geerated 35 perturbatio vectors ad 35 correspodig desig variables. Fig. (a) above, shows the fial desig. Fig. (b) shows that it took 2 desig cycles to coverge ad that there are o costrait violatios i the last desig cycle. The strai eergy decreased approximately 35 percet. 7.3 Alterative Desig 2. Double Symmetry Desig I this case, two maufacturig costraits are used to eforce double symmetry with respect to the ceter of the plate. A bead fractio costrait of 0.33 is used to limit the amout that the grids ca move. I additio, the grids are restricted to move oly upward. (a) Double Symmetry Desig (b) Objective ad Max Costrait Violatio History Plots Figure 2. Freeform Results for Double Symmetry Desig
8 For this alterative, freeform optimizatio automatically geerated 80 perturbatio vectors ad 80 correspodig desig variables. Fig. 2(a), above, shows the fial desig. Fig. 2(b) shows that it took 2 desig cycles to coverge ad that there are o costrait violatios i ay desig cycle. The strai eergy decreased approximately 35 percet. 7.4 Alterative Desig 3. Uiform Desig I this case, two maufacturig costraits are used. Oe maufacturig costrait is used to eforce symmetry with respect to the x-z plae ad aother to geerate a uiform profile throughout the x directio. A bead fractio costrait, equal to 0.50, is used to limit the amout that the grids ca move. Here the equality costrait is used to iduce the optimizer to make the aswers more sharp. (a) Simple Symmetry ad Uiform Profile Desig (b) Objective ad Max Costrait Violatio History Plots Figure 3. Freeform Results for Simple Symmetry ad Uiform Profile Desig For this alterative, freeform optimizatio automatically geerated 8 perturbatio vectors ad 8 correspodig desig variables. Fig. 3(a), above, shows the fial desig. Fig. 3(b) shows that it took 2 desig cycles to coverge ad that there are o costrait violatios i the last desig cycle. The strai eergy decreased approximately percet. 7.5 Comparig the Alterative Desigs Alterative desigs ad 2 are similar i a way that both produced beads which are orieted i 45 degrees with respect to the mai directio of the plate. These two results are reasoable as whe there are torsio loads experiece has show, that they ca be carried to the supports more effective with members distributed i 45 degrees. I desig 3, where the beads are forced to be alog the mai directio (x), the results are cosistet with the maufacturig requiremet. The first two alterative desigs are more efficiet to carry torsio loads tha the last desig, they ca improve the objective fuctio more (35% versus % improvemet). 8. Example. Bead Patter Optimizatio of Curve Structure Usig Differet Types of Grid Fractio Costraits 8. Descriptio of the Problem This example demostrates the use of freeform with differet bead fractio costraits. The example uses a curve shell structure assembled with 3200 quadrilateral elemets ad 338 grids. The overall projected-dimesios of the structure are 60 mm by 50 mm by 20 mm. The curvature of the structure is obtaied by makig the height of the structure a quadratic fuctio of x, where x is measured alog its legth. The thickess of the plate is mm. The Youg s modulus is 207,000 MPa ad the Poisso s ratio is 0.3 The shell has two corers costraied i oe of the short sides ad it is subjected to torsio loads applied to the opposite short side. The objective fuctio of the problem is to miimize the strai eergy. Three alterative grid fractio costraits are imposed: 0.5, 0.20 ad These grid fractio costraits are to allow the grids to move up to 5%, 20% ad 25% respectively. (a) Grid fractio=5% (b) Grid fractio=20% (c) Grid fractio=25% Figure 4. Freeform Results Usig Differet Grid Fractio Costrait Values 8.2 Comparig the Alterative Desigs Figures 4 (a-c) show that whe the grid fractio costraits are icreased, the umber of beads icreases. These results are expected as the role of bead fractio is precisely to do that.
9 9. Example. Bead Patter Optimizatio Usig No-Uiform Maximum Height 9. Descriptio of the Problem This example demostrates the use of freeform to obtai bead patters that ca have o-uiform heights. The objective fuctio of the problem is miimizig the strai eergy. There is a grid fractio costrait of 0.3. There are maufacturig costraits: the first oe is to eforce symmetry with respect to the plae x-z that passes through the ceter of the plate ad which divides it i two throughout the legth ad the secod is to obtai logitudial beads. To obtai bead patters that are ot uiform i height, the oly thig to do is geerate a perturbatio vector that represets a upper boud for the desig. The iitial desig is show i Fig. 5(a). The provided o-uiform perturbatio vector is show i Fig. 5(b). (a) Iitial Desig (b) No-Uiform Perturbatio Vector (c) Fial Desig Figure 5. Optimal Locatio of Bead Patters Usig Freeform Optimizatio 9.2 Results The fial desig show i Fig. 5(c) has mirror symmetry, logitudial symmetry ad bead patters with variable height, as required. It is iterestig to metio here that this result ca ot be obtaied with topography optimizatio. 0. Summary ad Coclusios This paper has described freeform optimizatio which is a ew capability to optimize structures. This ew capability ca be defied as a grid-by-grid shape optimizatio capability. Three special costraits that improve the results were discussed: distortio costraits, grid fractio costraits, ad maufacturig costraits. This capability ca be used with ay type of structure but is particularly useful to fid ribs i solid structures ad uiform or o-uiform bead patters i shell structures. Refereces. Leiva, J. P., Topometry Optimizatio: A New Capability to Perform Elemet by Elemet Sizig Optimizatio of Structures, preseted at the 0th AIAA/ISSMO Symposium o Multidiscipliary Aalysis ad Optimizatio, Albay, NY, August 30 - September, Leiva, J.P., Methods for Geeratio Perturbatio Vectors for Topography Optimizatio of Structures 5th World Cogress of Structural ad Multidiscipliary Aalysis ad Optimizatio, Lido di Jesolo, Italy, May 9-23, GENESIS User's Maual, Versio.0, VR&D, Colorado Sprigs, CO, November, Leiva, J.P., ad Watso, B.C., Automatic Geeratio of Basis Vectors for Shape Optimizatio i the Geesis Program, 7th AIAA/USAF/NASA/ ISSMO Symposium o Multidiscipliary Aalysis ad Optimizatio, St. Louis, MO, Sep 2-4, 998, pp Desig Studio for Geesis, Step-by-Step Example Maual, Versio.0. Vaderplaats Research ad Developmet, Ic., Colorado Sprigs, CO, October Schmit, L. A., ad Farshi, B., Some Approximatio Cocepts for Structural Sythesis, AIAA J., Vol. 2(5), 974, pp Schmit, L. A., ad Miura, H., Approximatio Cocepts for Efficiet Structural Sythesis, NASA CR-2552, March Vaderplaats, G.N., ad Salajegheh, E., New Approximatio Method for Stress Costraits i Structural Sythesis, AIAA J., Vol. 27, No. 3, 989, pp Cafield, R. A., High Quality Approximatios of Eigevalues i Structural Optimizatio of Trusses, AIAA J.,Vol 28, No. 6, 990, pp Vaderplaats, G. N., Numerical Optimizatio Techiques for Egieerig Desig; with Applicatios, 3rd Ed., Vaderplaats Research & Developmet, Ic., DOT, Desig Optimizatio Tools User s Maual, Versio 5.0. Vaderplaats Research ad Developmet, Ic., Colorado Sprigs, CO, Jauary Vaderplaats, G., Very Large Scale Optimizatio, preseted at the 8th AIAA/USAF/NASA/ISSMO Symposium at Multidiscipliary Aalysis ad Optimizatio, Log Beach, CA September 6-8, 2000.
Lecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More information2D Isogeometric Shape Optimization considering both control point positions and weights as design variables
1 th World Cogress o tructural ad Multidiscipliary Optimizatio May 19-24, 213, Orlado, Florida, UA 2D Isogeometric hape Optimizatio cosiderig both cotrol poit positios ad weights as desig variables Yeo-Ul
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More information27 Refraction, Dispersion, Internal Reflection
Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More information1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system.
Commo Core Math 3 Notes Uit Day Systems I. Systems of Liear Equatios A system of two liear equatios i two variables is two equatios cosidered together. To solve a system is to fid all the ordered pairs
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationBAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8
BAAN IVc/BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject
More informationNormals. In OpenGL the normal vector is part of the state Set by glnormal*()
Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More information. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.
MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationTerm Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.
CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationChapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS
28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationSecurity of Bluetooth: An overview of Bluetooth Security
Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give
More informationLecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV
Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More information15 UNSUPERVISED LEARNING
15 UNSUPERVISED LEARNING [My father] advised me to sit every few moths i my readig chair for a etire eveig, close my eyes ad try to thik of ew problems to solve. I took his advice very seriously ad have
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationParametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015
Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,
More informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationRecursive Procedures. How can you model the relationship between consecutive terms of a sequence?
6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationWeston Anniversary Fund
Westo Olie Applicatio Guide 2018 1 This guide is desiged to help charities applyig to the Westo to use our olie applicatio form. The Westo is ope to applicatios from 5th Jauary 2018 ad closes o 30th Jue
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationDETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION
Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme
More informationA Resource for Free-standing Mathematics Qualifications
Ope.ls The first sheet is show elow. It is set up to show graphs with equatios of the form = m + c At preset the values of m ad c are oth zero. You ca chage these values usig the scroll ars. Leave the
More informationIMPROVEMENT OF A TAIL-PLANE STRUCTURAL MODEL USING VIBRATION TEST DATA. S. J. Guo
IMPROVEMENT OF A TAIL-PLANE STRUCTURAL MODEL USING VIBRATION TEST DATA S. J. Guo Departmet of Aerospace, Civil ad Mechaical Egieerig, Uiversity of Hertfordshire, Hatfield, Hertfordshire, AL 9AB, U.K. ABSTRACT
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:
CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationFINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)
FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,
More informationIntro to Scientific Computing: Solutions
Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile
More informationn Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis
Overview Chapter 6 Writig a Program Bjare Stroustrup Some thoughts o software developmet The idea of a calculator Usig a grammar Expressio evaluatio Program orgaizatio www.stroustrup.com/programmig 3 Buildig
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationIntroduction to GAMIT/GLOBK Applications of GLOBK. Lecture 11 OVERVIEW
Itroductio to GAMIT/GLOBK Applicatios of GLOBK Lecture 11 GAMIT/GLOBK Lec11 1 OVERVIEW o I this lecture we cover: o Basic types of aalyses with globk l Velocity ad repeatability rus o GLOBK acillary programs
More information