Optimal aeroacoustic shape design using approximation modeling

Size: px
Start display at page:

Download "Optimal aeroacoustic shape design using approximation modeling"

Transcription

1 Center for Turbulence Reserch Annul Reserch Briefs Optiml erocoustic shpe design using pproximtion modeling By Alison L. Mrsden, Meng Wng AND Petros Koumoutskos 1. Introduction Reduction of noise generted by turbulent flow pst triling edge continues to pose chllenge in mny eronuticl nd nvl pplictions. Aerocoustics problems relted to such pplictions necessitte the use of lrge-eddy simultion (LES) or direct numericl simultion in order to cpture wide rnge of turbulence scles which re the source of brodbnd noise. Much previous work hs focused on development of ccurte computtionl methods for the prediction of triling-edge noise. For instnce, erocoustic clcultions of the flow over model irfoil triling edge using LES nd erocoustic theory hve been presented by Wng & Moin (2) nd were shown to gree well with experiments. To mke the simultions more cost-effective, Wng & Moin (22) successfully employed wll models in the triling-edge flow LES, resulting in drstic reduction in computtionl cost with miniml degrdtion of the flow solutions. With the recent progress in simultion cpbilities, the focus cn now move from noise prediction to noise control. The gol of the present work is to pply shpe optimiztion nd control theory to the triling-edge flow previously studied, in order to minimize erodynmic noise. In this work pproximtion modeling techniques re pplied for shpe optimiztion, resulting in significnt noise reduction in severl cses Choice of optimiztion method One generl distinction mong optimiztion techniques is between grdient-bsed methods nd non-grdient-bsed methods. The choice of method for prticulr problem depends on fctors such s the cost of evluting the function, the level of noise in the function, nd the complexity of implementtion. Grdient-bsed methods generlly include djoint solutions nd finite-difference methods. Non-grdient-bsed methods my include pttern-serch methods, pproximtion models, response-surfce methods nd evolutionry lgorithms. In LES-bsed erocoustic shpe design, cost-function evlutions re computtionlly expensive, nd hence the efficiency of the optimiztion routine is crucil. Therefore, key considertion is cost minimiztion when choosing n optimiztion method. One of the difficulties in grdient-bsed optimiztion methods is the clcultion of the grdient of the cost function with respect to the control prmeters. The most widely-used grdient method is to solve n djoint eqution in ddition to the flow equtions, s hs been successfully demonstrted by Jmeson et l. (1998) nd Pironneu (1984). However, djoint methods re difficult to implement for time-ccurte clcultions, nd cn present dt storge issues. Additionlly, djoint solvers re not portble from one flow solver to nother. Becuse of these fctors, the method of incomplete sensitivities ws initilly chosen for the grdient clcultion. This method, suggested by Mohmmdi & Pironneu (21), ignores the effects of geometric chnges on the flow field when computing the

2 22 A. L. Mrsden, M. Wng & P. Koumoutskos grdient of surfce-bsed cost function. This mkes it simple to use, nd fr more costeffective thn solving the full djoint problem. In fct, only smll dditionl cost to the flow computtion is needed for every itertion. Exmples demonstrting the method re given by Mohmmdi & Pironneu (21). Initilly, ppliction of the method of incomplete sensitivities produced seemingly promising results, s presented by Mrsden, Wng & Mohmmdi (21). However, on further study the method ws found to brek down for severl importnt cses. A systemtic evlution of the incomplete-sensitivity method ws crried out by comprisons with the exct grdient in the cse of single control prmeter. It ws found tht the exct nd incomplete grdients do not gree with ech other; furthermore, they do not lwys hve the sme sign, s shown by Mrsden et l. (22). This finding shows tht neglecting the stte contribution to the grdient is not vlid for the problem of triling-edge noise. We thus conclude tht the incomplete sensitivities pproch is not dequte for the present ppliction. In choosing n lternte optimiztion method, we re concerned with identifying method tht hs robust convergence properties nd yet is computtionlly fesible. To this end, the method of pproximtion modeling ws chosen for explortion. Approximtion modeling ws developed for use in engineering optimiztion problems which require the use of expensive numericl codes to obtin cost function vlues. Grdient informtion for these problems is often difficult or impossible to obtin. In ddition, mny optimiztion problems hve ssocited dt sets which hve error, or cost functions which re noisy. For ll of these resons, there hs recently been considerble interest in using pproximtion modeling for optimiztion with lrge engineering simultions Introduction to pproximtion modeling Approximtion modeling is fmily of non-grdient-bsed methods which rely on model, or surrogte, functions to pproximte the ctul function. Optimiztion is performed, not on the expensive ctul function but on the model, which is chep to evlute. The use of pproximtion modeling for expensive functions hs been demonstrted by Booker et l. (1999), Serfini (1998), Chung & Alonso (22) nd others. These surrogtes cn be polynomils, in which cse the models re clled response surfce models, or interpolting functions such s splines or more dvnced functions. As n illustrtion of this method, let us ssume we wish to find minimum of the function y = f(x) within n llowble domin x min x x mx. The bsic procedure using n pproximtion-modeling technique is s follows. First, we begin with set of initil dt points x = [x 1, x 2,..., x n ] where the function vlues re known. We then fit surrogte function through these points to pproximte the ctul function. We express the surrogte function s ŷ = ˆf(x). Becuse the surrogte function is inexpensive to evlute, its minimum (within the llowble rnge of x) cn be esily found using stndrd optimiztion methods. When the minimum is found, the ctul function is evluted t this point, the surrogte fit is updted, nd the process continues itertively until convergence to minimum function vlue. Approximtion-modeling methods hve severl possible vritions. One is the choice of surrogte function. Others include the choice of initil dt distribution, nd the use of merit functions to ensure good distribution of the dt. In this work, results re presented using pproximtion-modeling methodology on the model problem of Mrsden et l. (21). Detils of the optimiztion procedure re discussed in section 3. In section 4, results re presented for one-prmeter cse, for which we compre the performnce of severl surrogte functions. In section 5 we present results of clcultion using two

3 Optiml erocoustic shpe design 23 Figure 1. Model irfoil used in shpe optimiztion. The right hlf of the upper surfce is llowed to deform. prmeters, nd discuss the effects of the initil dt set on the finl solution. Extension of the method to severl prmeters is lso discussed. Using pproximtion-modeling methods, significnt reduction in cost function is demonstrted for severl one- nd two-prmeter cses. The method is shown to be robust nd computtionlly ffordble. In ddition, the method hs uncovered new irfoil shpe which gives greter reduction in noise thn previously chieved. 2. Formultion nd cost-function definition We begin by formulting the generl optimiztion problem. Given prtil differentil eqution A(U, q, ) = defined on the domin Ω with control vribles, stte vrible U nd design prmeters q, we wish to minimize given cost function J(U, q, ). The control problem cn be stted s min {J(U, q, ) : A(U, q, ) = x Ω, b(u, q, ) = x Ω} (2.1) where b(u, q, ) is the boundry condition of the PDE. In our problem, the stte equtions re the Nvier-Stokes equtions nd the cost function is the coustic source. The ultimte gol of this work is to optimize n irfoil shpe with fully-turbulent flow t the triling edge. Becuse of the cost of LES clcultions, the optimiztion method is first implemented nd vlidted on n unstedy lminr model problem, which is the subject of the present work. The irfoil geometry for the model problem is shown in figure 1 nd is shortened version of the irfoil used in experiments of Blke (1975). The irfoil chord is 1 times its thickness, nd the right hlf of the upper surfce is llowed to deform. The flow is from left to right nd results presented in this work re t chord Reynolds number of Re = 1,. Previously, in Mrsden et l. (21), results were lso presented for Re = 2,, nd it ws shown tht the cost function ws esily reduced to zero. The focus of the present work is therefore on the higher Reynolds number. Before discussion of the optimiztion method, we outline the derivtion of the cost function for the model problem. For unstedy lminr flow pst n irfoil t low Mch number, the coustic wvelength ssocited with the vortex shedding is typiclly long reltive to the irfoil chord. Noise genertion from n cousticlly-compct surfce cn be expressed s follows, using Curle s extension to the Lighthill theory (Curle 1955), ρ M 3 4π x i x 2 Ḋi(t M x ), Ḋ i = t S n j p ij (y, t)d 2 y (2.2) where ρ is the dimensionless coustic density t fr field position x, p ij = pδ ij τ ij is the compressive stress tensor, n j is the direction cosine of the outwrd norml to the irfoil surfce S, M is the free-strem Mch number, nd y is the source-field position vector. All the vribles hve been mde dimensionless, with irfoil chord C s the length scle, free strem velocity U s velocity scle, nd C/U s the time scle. The density nd pressure re normlized by their mbient vlues. Note tht (2.2) implies the three-

4 24 A. L. Mrsden, M. Wng & P. Koumoutskos dimensionl form of Lighthill s theory, which is used here to compute the noise rdited from unit spn of two-dimensionl irfoil. The rdition is of dipole type, cused by the fluctuting lift nd drg forces. The men coustic intensity cn be obtined from (2.2), s I = M 6 16π 2 x 2 ( D 1 cos θ + D 2 sin θ) 2 (2.3) where the overbr denotes time verging, nd θ = tn 1 (x 2 /x 1 ). To minimize the totl rdited power, we need to minimize the integrted quntity 2π I(r, θ)rdθ = M 6 ( ) 2 2 D 1 + D 2. (2.4) 16π x Hence, the cost function is defined s J = ( 2 n j p 1j (y, t)d y) t 2 + S which corresponds exctly to the coustic source function. ( 2 n j p 2j (y, t)d y) t 2 (2.5) S 3. Optimiztion procedure In this section, we outline the steps in the lgorithm used to optimize the irfoil shpe. Our im is to find the minimum of the cost function defined by (2.5). The cost function, J, depends on control prmeters corresponding to the surfce deformtion. To strt the optimiztion process, the cost function is evluted for severl initil points in the prmeter spce. The subsequent steps re s follows: 1. Fit surrogte function through the set of known dt points 2. Estimte the function minimum using the surrogte function 3. Evlute the true function vlue t the estimted minimum 4. Check for convergence 5. Add new dt point to list of known points nd go bck to 1. Itertions continue in this wy until the prmeters hve converged to give finl irfoil shpe. The control prmeters re defined s follows. Ech prmeter corresponds to deformtion point on the irfoil surfce which must be within the deformtion region. The vlue of ech prmeter is defined s the displcement of this point reltive to the originl irfoil shpe, in the direction norml to the surfce. A positive prmeter vlue corresponds to displcement in the outwrd norml direction, nd negtive vlue corresponds to the inwrd norml direction. A spline connects ll the deformtion points to the triling-edge point nd the left side of the deformtion region to give continuous irfoil surfce. Both ends of the spline re fixed. While the surfce must be continuous nd smooth on the left side, the triling-edge ngle is free to chnge. For given set of prmeter vlues, there is unique corresponding irfoil shpe. To clculte the cost-function vlue for given shpe, mesh is generted nd the flow simultion is performed until the solution is sttisticlly converged. Becuse the flow hs unstedy vortex shedding, the cost function is oscilltory. In the optimiztion procedure, the men cost function J (cf. (2.5)) is used, nd is obtined by integrting in time until convergence. An exmple of the oscilltory cost function, nd the time-verged vlue is shown in figure 2. The cse shown corresponds to the originl irfoil shpe.

5 Optiml erocoustic shpe design J t Figure 2. Cost function (gry) nd men cost function (solid blck) vs. time. Oscilltory cost function is time-verged until the men converges. The cse shown is for the originl irfoil shpe. 4. One-prmeter results Results using single prmeter,, re presented for severl surrogte function choices. With polynomil surrogte function, t lest three initil dt points re needed. In ll one prmeter cses presented here, the llowble rnge of is.5.2. The thickness of the irfoil is.1, nd the chord length is unity. Figure 3 shows the evolution of the response surfce using third-order polynomil s the surrogte function. The upper left plot shows the three initil points, nd following plots show three itertions on the vlue of corresponding to the minimum. With ech itertion, the surrogte function evolves to include ll known cumultive dt. Convergence is reched when the function minimum does not chnge from one itertion to the next. A lest-squres fit of the polynomil is used, so the polynomil does not go exctly through the dt points. A totl of six function evlutions is required to rech convergence, nd 19% reduction in cost function is chieved. As expected, n improvement in the function fit is obtined by using fourth order polynomil, s shown in figure 4. The optimiztion procedure is the sme s for the third order cse. A more significnt reduction in cost function, 26%, is chieved. However, there is trde-off in computtionl cost, since the higher-order polynomil picks up more detil in the function but requires eight function evlutions. Figure 5 shows results for single prmeter cse using cubic spline s the surrogte function. The optimum irfoil shpe corresponding to the minimum cost-function vlue chieved with the spline fit is shown in figure 6. It is qulittively similr to the shpes obtined using the polynomil surrogtes nd these re not shown. Becuse the surrogte spline is piecewise nd fits exctly through the dt points, it cptures more detil in the function thn either polynomil cse for the present problem. Similr to the fourth-order polynomil cse, the cost function reduction is 27% with 12 function evlutions. Using only one prmeter, we hve demonstrted tht the pproximtion modeling

6 26 A. L. Mrsden, M. Wng & P. Koumoutskos J Figure 3. Third-order polynomil response surfce for one-prmeter cse. Ech plot shows men cost function J vs. shpe prmeter where = corresponds to the originl shpe. Line is surrogte function fit, dots re known function vlues J Figure 4. Fourth-order polynomil response surfce for one prmeter cse. Ech plot shows men cost function J vs. shpe prmeter where = corresponds to the originl shpe. Line is surrogte function fit, dots re known function vlues. method is robust nd converges to minimum with modest number of function evlutions. A significnt reduction in cost function hs been chieved nd the results for ll surrogte functions were qulittively similr. Comprtively, the spline surrogte function resulted in the gretest cost-function reduction. The cses using polynomils emphsize tht it is undesirble to use low-order polynomils s globl models, since they re unble to cpture detils of the function such s multiple locl minim. However, there is lso dnger in incresing the order of the polynomil, due to oscilltions between the dt points known s the Runge phenomenon. To void these problems, one my wish to use trust region method, in which the polynomil model is restricted to region ner the minimum, where the function is pproximtely qudrtic.

7 Optiml erocoustic shpe design J Figure 5. One-prmeter cse with cubic spline s surrogte function. Ech plot shows men cost function J vs. shpe prmeter, where = corresponds to the originl shpe. Line is surrogte function fit, dots re known function vlues. Figure 6. Initil (blck) nd finl (gry) irfoil shpes using one prmeter with spline s surrogte function. 5. Two prmeters Although the results using one prmeter re very promising, the true test is whether the computtionl cost remins resonble when the method is extended to more prmeters. In this section, results re presented using two prmeters, nd b, for which bihrmonic spline ws the surrogte function. The deformtion points for prmeters nd b re evenly spced in the deformtion region of the irfoil surfce. A spline is chosen s the surrogte function, bsed on the results for the one-prmeter test cse, nd the optimiztion procedure is the sme s in the one-prmeter cse. We lso study the effect of choice of initil dt on the finl solution. Three sets of initil dt were used, which we cll A, B nd C. For ll cses, the prmeters re limited by.5.2 nd.35 b.2. The lower limit corresponds to stright line connecting the left edge of the deformtion region nd the triling edge. The left side of figure 7 shows the initil dt points used for the two-prmeter cse with dt set A. Contours of the men cost function vlue, J, re shown with prmeters nd b plotted on the xes. In this cse, the initil dt points re not chosen to lie in prticulr pttern. The finl surrogte-function fit is shown on the right side of figure 7. The cluster of points ner the minimum shows the convergence of the solution, nd the surfce hs one minimum vlley. The cost-function reduction for this cse ws

8 28 A. L. Mrsden, M. Wng & P. Koumoutskos b.1 5 b Figure 7. Cse A: Contours of men cost function, J, vs. prmeters nd b for two-prmeter cse with bihrmonic spline s surrogte. Dt points mrked with. Initil dt points re shown on left, finl converged solution is shown on right. 5 5 Figure 8. Initil (blck) nd finl (gry) irfoil shpes using two prmeters with bihrmonic spline s surrogte function, dt set A. 29% which is slight improvement over the best one-prmeter cse. As expected, the two-prmeter cse requires more function evlutions; 17 evlutions were required for cse A. Figure 8 shows the initil nd finl irfoil shpes for this cse. Contours of the initil surrogte-function fit using dt set B re shown on the left of figure 9. In this cse, the initil dt were chosen in smll str pttern centered round the origin. Like cse A, the finl surrogte fit, shown in the right of figure 9, hs one minimum vlley. However, it gives solution qulittively very different from cse A, suggesting tht the ctul function hs t lest two locl minim. The optimum irfoil shpe for cse B is shown in figure 1. In contrst to cse A (Fig. 8), the triling-edge ngle in cse B hs incresed insted of decresed. Although the mgnitude of the shpe deformtion is reltively smll, the reduction in cost function is significnt t 52%. This solution ws not previously expected. Cses A nd B show tht the initil dt set cn drmticlly impct the finl solution, cusing the solutions to converge to two distinct locl minim. In both cses vible irfoil shpe ws found which resulted in significnt cost-function reduction. However, idelly, we desire the solution to converge to the globl minimum, nd to give the sme result independent of the initil dt choice. It is, of course, impossible to gurntee convergence to the globl minimum, nd the cost-function reduction is lwys limited by the prmeter spce. However, there re wys to increse our chnces of converging to globl minimum nd improve robustness. For instnce, by choosing n initil dt set which covers the entire llowble rnge of nd b, the solution is not bised towrd minimum in prticulr re. To demonstrte this, initil dt set C is chosen s

9 1 Optiml erocoustic shpe design b.1 b Figure 9. Cse B: Contours of men cost function, J, vs. prmeters nd b for two-prmeter cse with bihrmonic spline s surrogte. Dt points mrked with. Initil dt points re shown on left, finl converged solution is shown on right. Figure 1. Initil (blck) nd finl (gry) irfoil shpes using two prmeters with bihrmonic spline s surrogte function, dt set B. lrge str pttern centered round the origin nd shown by the surrogte fit in the left of figure 11. The finl surrogte fit is shown on the right of figure 11 nd this solution gives cost function reduction of 45%. We notice tht the finl fit of cse C cptures two locl minim. The finl irfoil shpe is qulittively similr to tht of cse B but the minimum is locted in slightly different position, suggesting tht solutions B nd C my not be well converged. The totl number of function evlutions hs been reduced drmticlly, from 23 evlutions required for cse B to 9 evlutions required in cse C. By introducing second prmeter to the problem, it hs been demonstrted tht results improve drmticlly nd the cost of the optimiztion problem remins mngeble. A second prmeter lso gve the flexibility to find new solutions, s in cses B nd C, which re not dmissible in the one-prmeter spce. The importnce of choosing n initil dt set which spns the prmeter spce hs lso been confirmed. It cn increse the chnce of finding the globl minimum nd reduce the number of itertions. The physicl resons for the reduction in cost function cn be explined by the vortexshedding chrcteristics nd ssocited unstedy forcing on the irfoil. Figure 12 compres vortex-shedding chrcteristics for the originl shpe nd the finl shpes of cses A nd C in terms of the instntneous stremwise velocity. We see tht the vortex shedding strength hs decresed for both cses A nd C compred to the originl. As result, the mplitude of lift fluctutions, which dominte the coustic dipole source, hs been reduced by 12% for cse A nd 24% for cse C. The lrger decrese in lift mplitude

10 21 A. L. Mrsden, M. Wng & P. Koumoutskos b b vs. prmeters nd b for two-prmeter Figure 11. Cse C: Contours of men cost function, J, cse with bihrmonic spline s surrogte. Dt points mrked with. Initil dt points re shown on left, finl converged solution is shown on right. Figure 12. Instntneous stremwise velocity contours for originl (top), cse C (middle) nd cse A (lower). Contour levels re the sme for ll cses, between < u < 1.53 for cse C explins why the reduction in cost function is greter for cses B nd C thn for cse A. The shedding frequencies for ll cses re similr. The optiml shpe found in cse A lso shows n increse in men lift of 4% over the originl vlue, wheres in cse C slight 3% decrese in men lift is observed. In prcticl ppliction it is often necessry to ensure tht the men lift is not reduced by the shpe optimiztion. To this end, erodynmic properties will need to be included using multi-objective optimiztion methods, which my slightly compromise the lrge reduction in cost function found in cse C. To extend the method to severl prmeters, it will be desirble to use surrogte function which is esy to implement nd hs good behvior in high dimensions. Mny model functions exhibit undesirble behvior such s excessive wiggles between dt

11 Optiml erocoustic shpe design 211 points when extended to high order. An lterntive is the use of kriging functions, type of interpolting model first introduced in the geosttistics community by South Africn geologist D. G. Krige. Kriging is bsed on sttistics nd rndom-function theory, nd is esy to implement in n rbitrry number of dimensions. The underlying ide is to use weighted liner combintion of vlues t the smpled dt loctions to interpolte the function. The best liner estimtor is then found by minimizing the error of the estimtion. A detiled derivtion of the method cn be found in Isks & Srivstv (1989) nd Guint (22). Kriging hs since been dopted by the optimiztion community nd is now used in mny engineering problems. 6. Discussion nd future work A summry of results using severl surrogte functions with one nd two prmeters is presented in tble 1. The tble clerly shows n improved reduction in cost function with the ddition of second shpe prmeter. Generlly, the cses with greter cost function reduction lso require more function evlutions, lthough judicious selection of the initil dt points cn speed up convergence drmticlly. It is dvntgeous to chose initil dt which spn the entire prmeter spce. Results using pproximtion modeling re nerly two-fold improvement over the results of previous methods presented in Mrsden et l. (21). In future work, the use of kriging functions with severl optimiztion prmeters will be explored. Extension to multiple prmeters will determine the sclbility of this method in terms of the number of function evlutions. It will lso determine whether further reductions in cost function re possible, nd if the trde-off in computtionl cost is significnt. Additionlly, there re severl vritions on the method used here which could improve convergence nd robustness. As shown by Booker et l. (1999) nd Serfini (1998), the use of polling step in the lgorithm rigorously gurntees convergence to locl minimum. The use of merit functions, s discussed in Torczon & Trosset (1998), to ensure good dt distribution will be explored. With this method, weighting function is employed to determine whether the dt points re well distributed throughout the domin. If the dt points re clustered together, dditionl points my be evluted to improve the surrogte function fit in res lcking dt. To speed up the optimiztion process, it my be desirble to evlute the minimum point in prllel with severl other points which improve the function fit. These vritions of the method will explore the possible cost trde-off between fst convergence to locl minimum nd incresed chnce of reching globl minimum. The use of multi-objective optimiztion to include erodynmic properties (lift nd drg) nd thickness will lso be required in the design of prcticl triling-edge shpes. Once confidence hs been gined in the specifics of the pproximtion-modeling method, optimiztion of the turbulent triling-edge flow will be performed. In the turbulent cse, the irfoil is not cousticlly compct for ll the frequencies of interest, nd the cost function my need to be reconsidered. Alterntively, n pproximtion of the cost function cn be used so long s it is well correlted with the true coustic source function. The choice of cost function will be influenced to some degree by whether the objective is to reduce noise in bnd of frequencies of primry interest, or to reduce the totl rdited power.

12 212 A. L. Mrsden, M. Wng & P. Koumoutskos surrogte function prmeters Jorig Joptimum % reduction function evlutions 3 rd order polynomil % 4 4 th order polynomil % 8 cubic spline % 12 bihrmonic spline, set A % 17 bihrmonic spline, set B % 23 bihrmonic spline, set C % 9 Tble 1. Summry of results for severl surrogte functions choices with one nd two prmeters. Cost function reduction nd number of function evlutions needed for convergence re compred for ll cses. Acknowledgments This work ws supported by the Office of Nvl Reserch under grnt No. N Computer time ws provided by NAS t NASA Ames Reserch Center nd the DoD s HPCMP through ARL/MSRC nd NRL-DC. REFERENCES Blke, W. K A sttisticl description of pressure nd velocity fields t the triling edge of flt strut.report 4241, Dvid Tylor NSRDC, Bethesd, MM. Booker, A. J., Dennis, J. E., Frnk, P. D., Serfini, D. B., Torczon, V. nd Trosset, M. W A rigorous frmework for optimiztion of expensive functions by surrogtes. Structurl Optimiztion, 17, Chung, H. nd Alonso, J. 22 Design of low-boom supersonic business jet using cokriging pproximtion models. AIAA Pper Curle, N The influence of solid boundry upon erodynmic sound. Proc. Roy. Soc. Lond. A 231, guint, A. 22 Use of dt smpling, surrogte models, nd numericl optimiztion in engineering design. AIAA Pper Isks, E. H. & Srivstv, M An Introduction to Applied Geosttistics, Oxford University Press. Jmeson, A., Mrtinelli, L. & Pierce, N. A Optimum erodynmic design using the Nvier-Stokes equtions. Theoret. Comp. Fluid Dynmics 1, Mrsden, A. L., Wng, M. & Mohmmdi, B. 21 Shpe optimiztion for erodynmic noise control. Annul Reserch Briefs, Center for Turbulence Reserch, NASA Ames/Stnford Univ., Mrsden, A. L., Wng, M., Mohmmdi, B. & Moin, P. 22 Shpe optimiztion for triling edge noise control. Workshop on Geometry, Dynmics nd Mechnics in Honour of the 6th Birthdy of J.E. Mrsden, Toronto, Cnd, August 7, Mohmmdi, B. & Pironneu, O. 21 Applied Shpe Optimiztion for Fluids, Oxford University Press.

13 Optiml erocoustic shpe design 213 Pironneu, O Optiml Shpe Design for Elliptic Systems, Springer-Verlg, New York. Serfini, D A Frmework for Mnging Models in Nonliner Optimiztion of Computtionlly Expensive Functions. Ph.D. Thesis, Rice University. citeseer.nj.nec.com/serfini99frmework.html Torczon, V. & Trosset, M. W Using pproximtions to ccelerte engineering design optimiztion. ICASE TR NASA Lngley Reserch Center. Wng, M. & Moin, P. 2 Computtion of triling-edge flow nd noise using lrgeeddy simultion. AIAA J. 38, Wng, M. & Moin, P. 22 Dynmic wll modeling for lrge-eddy simultion of complex turbulent flows. Phys. Fluids 14,

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

Computing offsets of freeform curves using quadratic trigonometric splines

Computing offsets of freeform curves using quadratic trigonometric splines Computing offsets of freeform curves using qudrtic trigonometric splines JIULONG GU, JAE-DEUK YUN, YOONG-HO JUNG*, TAE-GYEONG KIM,JEONG-WOON LEE, BONG-JUN KIM School of Mechnicl Engineering Pusn Ntionl

More information

Fluid-structure interaction analysis of deformation of sail of 30-foot yacht

Fluid-structure interaction analysis of deformation of sail of 30-foot yacht csnak, 2013 Int. J. Nvl Archit. Ocen Eng. (2013) 5:263~276 http://dx.doi.org/10.3744/jnaoe.2013.5.2.263 Fluid-structure interction nlysis of deformtion of sil of 30-foot ycht Ser Bk, Jehoon Yoo nd Chng

More information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 2 Sensitivity Analysis: Differential Calculus of Models Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

Explicit Decoupled Group Iterative Method for the Triangle Element Solution of 2D Helmholtz Equations

Explicit Decoupled Group Iterative Method for the Triangle Element Solution of 2D Helmholtz Equations Interntionl Mthemticl Forum, Vol. 12, 2017, no. 16, 771-779 HIKARI Ltd, www.m-hikri.com https://doi.org/10.12988/imf.2017.7654 Explicit Decoupled Group Itertive Method for the Tringle Element Solution

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

CHAPTER 5 Spline Approximation of Functions and Data

CHAPTER 5 Spline Approximation of Functions and Data CHAPTER 5 Spline Approximtion of Functions nd Dt This chpter introduces number of methods for obtining spline pproximtions to given functions, or more precisely, to dt obtined by smpling function. In Section

More information

Accelerating 3D convolution using streaming architectures on FPGAs

Accelerating 3D convolution using streaming architectures on FPGAs Accelerting 3D convolution using streming rchitectures on FPGAs Hohun Fu, Robert G. Clpp, Oskr Mencer, nd Oliver Pell ABSTRACT We investigte FPGA rchitectures for ccelerting pplictions whose dominnt cost

More information

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants A Heuristic Approch for Discovering Reference Models by Mining Process Model Vrints Chen Li 1, Mnfred Reichert 2, nd Andres Wombcher 3 1 Informtion System Group, University of Twente, The Netherlnds lic@cs.utwente.nl

More information

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es

More information

Optimization of Air Bearing Slider Design

Optimization of Air Bearing Slider Design Proceedings of TC2005 orld Tribology Congress III Proceedings of TC2005 September 2-6, orld 2005, Tribology shington, Congress D.C., III SA September 2-6, 2005, shington, D.C., SA Optimiztion of Air Bering

More information

Approximation by NURBS with free knots

Approximation by NURBS with free knots pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

Chapter Spline Method of Interpolation More Examples Electrical Engineering

Chapter Spline Method of Interpolation More Examples Electrical Engineering Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.

More information

Parallel Square and Cube Computations

Parallel Square and Cube Computations Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl

More information

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing

More information

Math 35 Review Sheet, Spring 2014

Math 35 Review Sheet, Spring 2014 Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided

More information

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS S. H. Jongsm E. T. A. vn de Weide H. W. M. Hoeijmkers Overset symposium 10-18-2012 Deprtment of mechnicl engineering

More information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING HOUGH TRANSFORM IN LINE EXTRACTION Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-Sensing with Kionix MEMS Accelerometers Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to

More information

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed

More information

Digital Design. Chapter 6: Optimizations and Tradeoffs

Digital Design. Chapter 6: Optimizations and Tradeoffs Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Tree Structured Symmetrical Systems of Linear Equations and their Graphical Solution

Tree Structured Symmetrical Systems of Linear Equations and their Graphical Solution Proceedings of the World Congress on Engineering nd Computer Science 4 Vol I WCECS 4, -4 October, 4, Sn Frncisco, USA Tree Structured Symmetricl Systems of Liner Equtions nd their Grphicl Solution Jime

More information

CHAPTER 8 Quasi-interpolation methods

CHAPTER 8 Quasi-interpolation methods CHAPTER 8 Qusi-interpoltion methods In Chpter 5 we considered number of methods for computing spline pproximtions. The strting point for the pproximtion methods is dt set tht is usully discrete nd in the

More information

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve. Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the

More information

Solutions to Math 41 Final Exam December 12, 2011

Solutions to Math 41 Final Exam December 12, 2011 Solutions to Mth Finl Em December,. ( points) Find ech of the following its, with justifiction. If there is n infinite it, then eplin whether it is or. ( ) / ln() () (5 points) First we compute the it:

More information

The Distributed Data Access Schemes in Lambda Grid Networks

The Distributed Data Access Schemes in Lambda Grid Networks The Distributed Dt Access Schemes in Lmbd Grid Networks Ryot Usui, Hiroyuki Miygi, Yutk Arkw, Storu Okmoto, nd Noki Ymnk Grdute School of Science for Open nd Environmentl Systems, Keio University, Jpn

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

MATH 25 CLASS 5 NOTES, SEP

MATH 25 CLASS 5 NOTES, SEP MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Supplementry Figure y (m) x (m) prllel perpendiculr Distnce (m) Bird Stndrd devition for distnce (m) c 6 prllel perpendiculr 4 doi:.8/nture99 SUPPLEMENTARY FIGURE Confirmtion tht movement within the flock

More information

On Computation and Resource Management in Networked Embedded Systems

On Computation and Resource Management in Networked Embedded Systems On Computtion nd Resource Mngement in Networed Embedded Systems Soheil Ghisi Krlene Nguyen Elheh Bozorgzdeh Mjid Srrfzdeh Computer Science Deprtment University of Cliforni, Los Angeles, CA 90095 soheil,

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.

More information

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of

More information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric

More information

Integration. October 25, 2016

Integration. October 25, 2016 Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve

More information

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Query optimization. DBMS Architecture. Query optimizer. Query optimizer.

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Query optimization. DBMS Architecture. Query optimizer. Query optimizer. DBMS Architecture SQL INSTRUCTION OPTIMIZER Dtbse Mngement Systems MANAGEMENT OF ACCESS METHODS BUFFER MANAGER CONCURRENCY CONTROL RELIABILITY MANAGEMENT Index Files Dt Files System Ctlog DATABASE 2 Query

More information

Midterm 2 Sample solution

Midterm 2 Sample solution Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the

More information

12-B FRACTIONS AND DECIMALS

12-B FRACTIONS AND DECIMALS -B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

International Journal of Fatigue

International Journal of Fatigue Interntionl Journl of Ftigue 43 (2012) 150 159 Contents lists vilble t SciVerse ScienceDirect Interntionl Journl of Ftigue journl homepge: www.elsevier.com/locte/ijftigue Enbling high-order integrtion

More information

Pointwise convergence need not behave well with respect to standard properties such as continuity.

Pointwise convergence need not behave well with respect to standard properties such as continuity. Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

9 Graph Cutting Procedures

9 Graph Cutting Procedures 9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric

More information

Transparent neutral-element elimination in MPI reduction operations

Transparent neutral-element elimination in MPI reduction operations Trnsprent neutrl-element elimintion in MPI reduction opertions Jesper Lrsson Träff Deprtment of Scientific Computing University of Vienn Disclimer Exploiting repetition nd sprsity in input for reducing

More information

Improper Integrals. October 4, 2017

Improper Integrals. October 4, 2017 Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

HOPC: A NOVEL SIMILARITY METRIC BASED ON GEOMETRIC STRUCTURAL PROPERTIES FOR MULTI-MODAL REMOTE SENSING IMAGE MATCHING

HOPC: A NOVEL SIMILARITY METRIC BASED ON GEOMETRIC STRUCTURAL PROPERTIES FOR MULTI-MODAL REMOTE SENSING IMAGE MATCHING ISPRS Annls of the Photogrmmetry, Remote Sensing nd Sptil Informtion Sciences, Volume III-1, 216 XXIII ISPRS Congress, 12 19 July 216, Prgue, Czech Republic : A NOVEL SILARITY METRIC BASED ON GEOMETRIC

More information

Illumination and Shading

Illumination and Shading Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht

More information

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho IMAGE QUALITY OPTIMIZATIO BASED O WAVELET FILTER DESIG AD WAVELET DECOMPOSITIO I JPEG2000 Do Qun nd Yo-Sung Ho School of Informtion & Mechtronics Gwngju Institute of Science nd Technology (GIST) 26 Cheomdn-gwgiro

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

Statistical classification of spatial relationships among mathematical symbols

Statistical classification of spatial relationships among mathematical symbols 2009 10th Interntionl Conference on Document Anlysis nd Recognition Sttisticl clssifiction of sptil reltionships mong mthemticl symbols Wl Aly, Seiichi Uchid Deprtment of Intelligent Systems, Kyushu University

More information

x )Scales are the reciprocal of each other. e

x )Scales are the reciprocal of each other. e 9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.

More information

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012 Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

Algorithm Design (5) Text Search

Algorithm Design (5) Text Search Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:

More information

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

1 Quad-Edge Construction Operators

1 Quad-Edge Construction Operators CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike

More information

Smoothed Particle Hydrodynamics: Applications within DSTO

Smoothed Particle Hydrodynamics: Applications within DSTO Smoothed Prticle Hydrodynmics: Applictions within DSTO D.A. Jones nd D. Belton Mritime Pltforms Division Defence Science nd Technology Orgnistion DSTO-TR-1922 ABSTRACT Smoothed Prticle Hydrodynmics (SPH)

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December ISSN Interntionl Journl of Scientific & Engineering Reserch, Volume 4, Issue 1, December-1 ISSN 9-18 Generlised Gussin Qudrture over Sphere K. T. Shivrm Abstrct This pper presents Generlised Gussin qudrture

More information

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction

More information

Expected Worst-case Performance of Hash Files

Expected Worst-case Performance of Hash Files Expected Worst-cse Performnce of Hsh Files Per-Ake Lrson Deprtment of Informtion Processing, Abo Akdemi, Fnriksgtn, SF-00 ABO 0, Finlnd The following problem is studied: consider hshfilend the longest

More information

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2 A TRIANGLAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Atti Mous nd Eng. Slh M. Teh ABSTRACT In the present pper the strin-bsed pproch is pplied to develop new tringulr finite element

More information

A Fast Imaging Algorithm for Near Field SAR

A Fast Imaging Algorithm for Near Field SAR Journl of Computing nd Electronic Informtion Mngement ISSN: 2413-1660 A Fst Imging Algorithm for Ner Field SAR Guoping Chen, Lin Zhng, * College of Optoelectronic Engineering, Chongqing University of Posts

More information

Efficient Rerouting Algorithms for Congestion Mitigation

Efficient Rerouting Algorithms for Congestion Mitigation 2009 IEEE Computer Society Annul Symposium on VLSI Efficient Rerouting Algorithms for Congestion Mitigtion M. A. R. Chudhry*, Z. Asd, A. Sprintson, nd J. Hu Deprtment of Electricl nd Computer Engineering

More information

Ray surface intersections

Ray surface intersections Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive

More information

Spectral Super-Resolution of Hyperspectral Imagery Using Reweighted l 1 Spatial Filtering

Spectral Super-Resolution of Hyperspectral Imagery Using Reweighted l 1 Spatial Filtering 1 Spectrl Super-Resolution of Hyperspectrl Imgery Using Reweighted l 1 Sptil Filtering Adm S. Chrles, Student Member, IEEE, nd Christopher J. Rozell, Senior Member, IEEE Abstrct Sprsity-bsed models hve

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 2530: WORKSHEET 7. x 2 y dz dy dx = MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl

More information

Math 17 - Review. Review for Chapter 12

Math 17 - Review. Review for Chapter 12 Mth 17 - eview Ying Wu eview for hpter 12 1. Given prmetric plnr curve x = f(t), y = g(t), where t b, how to eliminte the prmeter? (Use substitutions, or use trigonometry identities, etc). How to prmeterize

More information

Introduction. Chapter 4: Complex Integration. Introduction (Cont d)

Introduction. Chapter 4: Complex Integration. Introduction (Cont d) Introduction Chpter 4: Complex Integrtion Li, Yongzho Stte Key Lbortory of Integrted Services Networks, Xidin University October 10, 2010 The two-dimensionl nture of the complex plne required us to generlize

More information

DQL: A New Updating Strategy for Reinforcement Learning Based on Q-Learning

DQL: A New Updating Strategy for Reinforcement Learning Based on Q-Learning DQL: A New Updting Strtegy for Reinforcement Lerning Bsed on Q-Lerning Crlos E. Mrino 1 nd Edurdo F. Morles 2 1 Instituto Mexicno de Tecnologí del Agu, Pseo Cuhunáhuc 8532, Jiutepec, Morelos, 6255, MEXICO

More information

A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS

A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS Ji-Eun Roh (), Te-Eog Lee (b) (),(b) Deprtment of Industril nd Systems Engineering, Kore Advnced Institute

More information

Integration. September 28, 2017

Integration. September 28, 2017 Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my

More information

arxiv: v2 [math.ho] 4 Jun 2012

arxiv: v2 [math.ho] 4 Jun 2012 Volumes of olids of Revolution. Unified pproch Jorge Mrtín-Morles nd ntonio M. Oller-Mrcén jorge@unizr.es, oller@unizr.es rxiv:5.v [mth.ho] Jun Centro Universitrio de l Defens - IUM. cdemi Generl Militr,

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association

9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association 9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl

More information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION TO SIMPLICIAL COMPLEXES INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min

More information

Heuristics for Optimising the Calculation of Hypervolume for Multi-objective Optimisation Problems

Heuristics for Optimising the Calculation of Hypervolume for Multi-objective Optimisation Problems Edith Cown University Reserch Online ECU Publictions Pre. 2011 2005 Heuristics for Optimising the Clcultion of Hypervolume for Multi-objective Optimistion Problems Lyndon While University of Western Austrli

More information

Surfaces. Differential Geometry Lia Vas

Surfaces. Differential Geometry Lia Vas Differentil Geometry Li Vs Surfces When studying curves, we studied how the curve twisted nd turned in spce. We now turn to surfces, two-dimensionl objects in three-dimensionl spce nd exmine how the concept

More information

CSEP 573 Artificial Intelligence Winter 2016

CSEP 573 Artificial Intelligence Winter 2016 CSEP 573 Artificil Intelligence Winter 2016 Luke Zettlemoyer Problem Spces nd Serch slides from Dn Klein, Sturt Russell, Andrew Moore, Dn Weld, Pieter Abbeel, Ali Frhdi Outline Agents tht Pln Ahed Serch

More information

Memory-Optimized Software Synthesis from Dataflow Program Graphs withlargesizedatasamples

Memory-Optimized Software Synthesis from Dataflow Program Graphs withlargesizedatasamples EURSIP Journl on pplied Signl Processing 2003:6, 54 529 c 2003 Hindwi Publishing orportion Memory-Optimized Softwre Synthesis from tflow Progrm Grphs withlrgesizetsmples Hyunok Oh The School of Electricl

More information