Proceedings - 5th IMA Conference on Mathematics in Defence 23 November 2017, The Royal Military Academy Sandhurst, Camberley, UK

Size: px
Start display at page:

Download "Proceedings - 5th IMA Conference on Mathematics in Defence 23 November 2017, The Royal Military Academy Sandhurst, Camberley, UK"

Transcription

1 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK Eteral Fake Costraits Iterpolatio: the ed of Ruge pheomeo with high degree polyomials relyig o equispaced odes Applicatio to aerial robotics motio plaig By Nicolas Belager Airbus, Iovatio Departmet, Marigae, Frace Abstract The preset paper itroduces a ew approimatio method that suppresses the Ruge pheomeo with high degree polyomials relyig o equispaced odes. The priciple cosists i usig eteral costraits of the type P ()= eterally to the iterpolatio iterval. As those costraits do ot have ay validity regardig the Ruge fuctio behavior we call them Eteral Fake Costraits (EFC). We demostrate that the EFC method ca be of greater accuracy tha Splie iterpolatio. We the apply the EFC priciple to a simple aerial robotics motio plaig problem ad demostrate the iterest for liear system optimizatio uder kiematics costraits ad preset the associated results. We the ope the door to directios to improve ad formalize EFC method ad propose other applicatios i aerial robotics motio plaig.. Itroductio For more tha a cetury, the Ruge pheomeo [] has fasciated geeratios of approimatio theory mathematicias. Major advaces have bee made through the last two decades by researchers like J.P. Boyd [3] [4] [5] or Rodrigo Platte [6] [7] to deeply uderstad ad defeatig this couter ituitive pheomeo. Nevertheless, the geeral spread idea is that high order polyomial iterpolatio with equispaced odes is ot suitable to approimate the Ruge fuctio as demostrated by Trefethe []. To mitigate the Ruge problem, it is commo to use the Chebyshev odes for Lagrage iterpolatio which are kow as the best solutio to iterpolate the fuctio with polyomials while atteuatig largely the wild oscillatios occurrig ear the limits of the iterpolatio iterval. This solutio ca be satisfyig for mathematicias, but a lot of operatioal problems require the eeds of equidistat odes which is ot the case with Chebyshev odes. Thus, i order to overcome the Ruge pheomeo while keepig the iterest of polyomials i the solutio, Dechao & al [8] eplored piecewise fuctios such as splies. The results preseted i this study are very accurate ad ca serve as a very good referece for the method that we aim to itroduce. The authors measured the efficiecy of differet splies methods such as : atural cubic splies, parabolically termied cubic splies, etrapolated cubic splies. Usig the least squares error idicator : E K k K ( y ˆ k k y k ) The results obtaied i [8] are recpitualed i the Table with + equidistat odes:

2 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK Natural Cubic Splie Etrapolated cubic splie Parabolically termiated cubic splie PseudoIverse Cubic splie (PCS) TABLE. Results obtaied with splies iterpolatio i De Chao ad al. [8] Aother recet work [9] based o a Immuity Geetic Algorithm (IGA) applied to a parametric curve has demostrated that it was possible to solve the Ruge pheome by learig methods. The results preseted with the IGA method state of E error of for equidistat samples. The recet results obtaied with the PseudoIverse Cubic Splie (PCS) iterpolatio [8] ad with the IGA [9] will serve as a referece for our approach. I the preset paper we itroduce a ew method which approimate the Ruge fuctio f()=/(+5 ) withi [-;] by the meas of a sigle high order degree polyomial with equispaced odes. The iterest of the method goes beyod the pure mathematical eercise as we demostrate the added value that it brigs for optimizatio problems. We illustrate it through a case of path plaig optimizatio for a aerial mobile robot.. Eteral Fake Costraits Iterpolatio Cosiderig the Ruge pheomeo ad the wild oscillatios that occur ear the edpoits of the iterpolatio iterval, we propose a ew approach. Our idea is to artificially icrease the degree of the iitial Lagrage iterpolatio polyomial relyig o equispaced odes. To do so, we eted the liear system represeted by k equatios used to build the Lagrage iterpolatio polyomial with equispaced odes. These equatios which ca be see as Lagrage iterpolatio cotributors i our system are of the type: a a. a f ( ) (where f is the Ruge fuctio). Li Li Li Where the are the equidistat k odes (k is a odd umber) i the iterval [-:] L i To those k equatios we add m equatios (m is a eve umber ad k + m = + ) that we use to stabilize the Ruge pheomeo oscillatios. Those m equatios impose to the polyom P EFC () that we wat to fid, the costraits that its secod derivative is equal to i m/ poits located withi a small iterval ]--; -] ad m/ equatios of the same type located eterally ad symmetrically o the iterval [; +[ where >. We call those costraits Eteral Fake Costraits (EFC) because regardig the behaviour of the secod derivative of the Ruge fuctio which equatio is 5 5 f Ruge "( ) is ever equal to 3 (5 ) (5 ) withi the small itervals ]--; -] ad [; +[as it ca be see o Figure : FIGURE. Distributio of secod derivative of the Ruge fuctio

3 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK The EFC equatios brought ito the liear system guaratee that there will be o ew oscillatios geerated by the icrease of the iterpolatio polyomial degree. Ideed, itroducig additioal costraits o the secod order derivative of the polyomial guaratee that the ew oscillatios due to the degree icrease will be geerated eterally to the iterval [-;]. So those kid of costraits are iterestig because they ca perform stabilizatio of the iteral wild oscillatios due to Ruge pheomeo while ecludig of the iterpolatio iterval potetial additioal oscillatios itroduced by the polyomial degree icrease. Thus the global liear system that we build with the k+m equatios has the followig form: 3 L L Lk.( )..( )..( ). EFC EFC EFC m L L Lk ( ).( ). ( ).( ). ( ).( ). 3 EFC 3 EFC 3 EFC m L L EFC EFC EFC m L L Lk a f ( L ) a f ( L ) f ( L ) k. a a The challege is the to determiig m the efficiet umber of Eteral Fake Costraits ad S the set of abscissa positios of the fake costraits : S={ } ;; EFC EFCm The work that we performed has ot yet led to a formal determiatio of those variables. However the study has a empirical feature at this stage, the results we have bee able to provide are of iterest for future optimizatio problems.the liear system that we have formed is ill coditioed which does ot facilitate the research of the best iterpolatio polyomial. We have ot eplored a large rage of EFC sizes ad we have ot eplored all the possibilities i terms of EFC i distributio over the adjacet itervals as well. That is why we thik that the EFC priciple still holds a big potetial of improvemet. We preset i the followig sectio, the results that we obtaied for 5 equidistat iterpolatio odes ad 46 EFC poits: FIGURE. Compariso of the Ruge fuctio ad EFC Iterpolatio for 5 equidistat odes The results obtaied o Fig. with oly 5 equidistat odes which would correspod to a degree 4 for the iterpolatio polyomial are quite impressive. Ideed the method allows us to reach a accuracy of which is ot that far from the results obtaied by Dechao & al. [8] with the splie iterpolatio with 9 equidistat poits. It has to be oticed that the EFC method ca geerate implicit crossigs betwee the iterpolatio curve ad the Ruge fuctio. This is the case at the abscissas -.9 ad.9 which are ot iterpolatio odes. Aother remarkable poit is the etreme sesitivity of the approimatio to the space betwee

4 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK the EFC abscissas. I the preseted case, the local miimum foud has a icrease of te times accuracy for a etremely small variatio ( - ) betwee the abscissa where we apply the EFC: the distace betwee the EFC abscissa is called the EFC space. 4 The results obtaied for 9 equidistat odes o Fig.3 still improve i the way of beig better tha the splie results as we foud a local miimum at.6-4 compare to for the splie study. We did very few attempts of varyig the umber of EFC so there is certaily potetial to improve the accuracy of the results i the future. It has to be metioed that the implicit EFC crossigs still remai as for the 5 equidistat odes iterpolatio, but the implicit crossigs have lightly moved to the abscissas.3 ad -.3. FIGURE 3. Compariso of the Ruge fuctio ad EFC Iterpolatio for 9 equidistat odes The results we obtaied for equidistat odes ad 6 EFC o Fig.4 : are lightly less accurate tha those obtaied by [8] i the splie study (5.6-5 ). The eplaatio certaily comes from the limited tests we had with differet umber of EFC sets. A larger eploratio of EFC sizes ad their associated spaces betwee fid better local miima. EFC i should have bee doe to FIGURE 4. Compariso of the Ruge fuctio ad EFC Iterpolatio for equidistat odes At least, for equidistat odes ad 5 EFC we obtai oce agai a better result tha the oe obtaied with the splie approimatio. Our approimatio reaches (see Figure 5.) where the splie method obtais for the same equidistat poits. The origiality of the result we obtaied comes from the offset of the first two EFC i which are ot positioed o the boud of the iterpolatio iterval but slightly moved away to abscissas : ad This result highlights aother ais of improvemet which deals with the potetial of o costat EFC space (whe the distace betwee EFC abscissa is ot costat).

5 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK 5 FIGURE 5. Compariso of the Ruge fuctio ad EFC Iterpolatio for equidistat odes Last but ot least we had a attempt for the same problem with equidistat odes, to d P( ) itegrate few Fake Costraits of the same type but iterally to the iterpolatio d iterval [-;]. With itroducig those 6 iteral fake costraits we obtaied a accuracy of times superior to splie method : The list of abscissas used for the fake costraits is provided i Table. List of abscissas used for Eteral Fake Costraits ad 6 Iteral Fake Costraits (i bold),7,4,,88,75,6,49,36,3,,97,84,7,58,45,3,9,6,993,98,967 -,7 -,4 -, -,88 -,75 -,6 -,49 -,36 -,3 -, -,97 -,84 -,7 -,58 -,45 -,3 -,9 -,6 -,993 -,98 -,967 - TABLE. equidistat odes 44 EFC 6 IFC This prelimiary work demostrates the iterest of maagig the variatios of a polyomial o a domai by the use of eteral costraits. The iterest of this priciple has bee validated o a famous eample : the Ruge pheomeo which has bee fied. We illustrate the iterest of the method for motio plaig applicatios i aerial robotics. 3. Applicatio of Eteral Fake Costraits to aerial mobile robotics for motio plaig optimizatio We itroduce here a simple aerial robotics motio plaig problem. The idea is to geerate a lateral chage i a horizotal plae with a small UAV. The trajectory geeratio is performed by the use of a polyomial P(). The costraits imposed at the poit M s start of the trajectory ad at M f ed of the trajectory are simple, they are epressed i a referetial liked to the iitial positio ad directio. The liear system to be solved is the followig: P( s )= P( f )=y f P ( s )= P ( f )= () P ( s )= P ( f )= (curvature=)

6 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK Regardig the kiematics model that we established for the UAV, at a costat speed of km/h we limit the curvature of the trajectory at K ma <7-3 m -, calculated from : y"( ) K( ), the maimum derivative of the curvature at 3 ( y' ( )) dk <6.5-3 m - s - dk ad () <5-3 at the begiig of the trajectory. dt ma dt With 6 costraits to fulfil, it is required a 5 degree polyomial: 6 P()=a a a a + a +a Ad with coordiates for the edig poit M f (;4), solvig the liear system () brigs up the followig solutio : a 5 =7.5 - ; a 4 = ; a 3 =5-5 ; a =; a =; a = We show o the Figure 6 the correspodig trajectory ad its curvature distributio o Figure 7. FIGURE 6. 5 degree polyomial trajectory FIGURE 7. Curvature distributio for 5 degree polyomial This is a simple solutio to the problem. But with a 5 degree polyomial ad 6 costraits we have o latitude to optimize the trajectory. Icreasig the polyomial degree to itroduce ew costraits o the trajectory to optimize it i a better way ivolves some additioal oscillatios risk. That is why people geerally prefer piecewise methods as Splie to get rid of the oscillatios problem of a sigle polyomial (see with [8] to solve the Ruge pheomeo). But the iterest of the sigle polyomial is that the trajectory is deeply cotiuous. Let s ow itroduce two Eteral Fake Costraits of the type : P ( EFC )= symetrically outside of the trajectory iterval. The first iterest of those costraits is that they guaratee the additioal oscillatios ivolved by the icrease of the polyomial degree will be remaied eterally to the domai of iterest, i our case : [;]. Eplaatio : As oscillatios are due to a chage of cocavity which occurs whe f ()=, imposig oly costraits of this type guaratee that o additioal oscillatios will be geerated withi the bouds of the iterpolatio iterval The secod iterest of itroducig two EFC i the liear system is that we brig some additioal latitude to optimize the trajectory i the way that positioig the EFC at differet abscissa will modify the behaviour of the polyomial withi the bouds that defie the trajectory problem. To be coviced about this assertio we propose to solve the liear system

7 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK correspodig to 6 trajectory cotraits formed i the system () plus two EFC. The trajectory polyomial becomes of degree 7 ad the correspodig system to be solved is the: P( s )= P( f )=y f P ( s )= P ( f )= P ( s )= P ( f )= P ( EFC )= P ( EFC )= () We the solve the above system with 3 differet combiatios of EFC to show their direct ifluece o the trajectory. EFC =-. EFC =. Polyomial coefficiets: a 7= ; a 6 = ; a 5 = a 4 = ; a 3 = EFC =- EFC = Polyomial coefficiets: Polyomial coefficiets: a 7= ; a 6 = ; a 5 = ; a 4 = ; a 3 = EFC =- EFC =4 Polyomial coefficiets: a 7 = ; a 6 = ; a 5 = ; a 4 = ; a 3 = Those three 7 degree polyomials are plotted o the Figure 8. It is show the ifluece of the EFC positioig i the trajectory geeratio. We ca observe o the graph that positioig the EFC et to the bouds of the trajectory iterval (cya curve) slows dow the begiig ad the ed of the curve to capture imposed coditios i M f. O the other side, positioig the EFC far from the bouds of the trajectory iterval brigs the 7 degree polyomial (red curve) et to the 5 degree polyomial. 7 FIGURE 8. 7 degree polyomials with differet EFC FIGURE 9. Curvature distributio for 7 degree polyomials We ca aalyse the matchig of the trajectory costraits o the Figure 9 where the curvature distributio is plotted for the three curves. This graph shows that whe the EFC are close to

8 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK dk the bouds (cya curve) the derivative of the curvature () is close to ad the d maimum of the curvature is the highest of the three curves; i the preset problem this costrait is slightly eceeded (>7. -3 m - ). At the same time the derivative of the curvature eceeds the maimum authorized (> m - s - ). It comes that we caot select this curve as a possible curve to fulfil the costraits o the trajectory. I the Table 3. We metio the other mai variables for the differet EFC polyomials ad the 5 degree polyomial. The derivative of the curvature is calculated aalytically followig the below equatio: dk dk d dk dk v cos v cos( Ata( y'( )) dt d dt d d EFC -; 4 EFC -; EFC -.;. Poly. Deg 5 K ma dk dt ma dk () dt ds 5.6 m 5.96 m 6.3 m 5.57 m TABLE 3. Values of differet mai variables for EFC polyomials As we ca see i the Table 3, 5 degree polyomial ad 7 degree polyomial with EFC (- ;4) largely eceed the costraits o the derivative of the curvature especially at the begiig of the trajectory. I our case the oly possible solutio is the 7 degree polyomial with EFC (-;) despite oe of the costraits are saturated. For sure the above solutios are close oe to the other (see close curviliear abscissas values ds) but our goal was to poit out the fact that motio plaig ca be maaged differetly by the use of EFC which is somethig ew. Icreasig the umber of EFC is possible ad offers ew possibilities to fulfill the costraits imposed to the trajectory. We ca imagie etedig the priciple to parametric curves by imposig costraits to egative time t< or time over the limit of trajectory t>t limit to maage the motio plaig i a better way providig more fleibility to the optimizatio Coclusio We itroduced i the preset work a ew approimatio method based o Eteral Fake Costraits ad high degree polyomial iterpolatio to solve the famous Ruge pheomeo raised i 9 by the mathematicia. The EFC used i our work imposed secod derivative of the polyomials to be. the We compared our EFC method with Splie piecewise method. It has demostrated that we were able to reach very good approimatio with few equispaced odes (5 poits) which was ot feasible with Splie iterpolatio. Util equispaced odes we had globally better results tha the Splie method. Settig up few iteral fake costraits immediately icrease the accuracy of the method by times o the computatios doe for equispaced odes ( -8 accuracy) ad this result ca be discussed. Ayway there is a lot of work ahead to establish a real formal EFC iterpolatio method as several questios have to be ivestigated: ifluece of the umber of EFC, space betwee EFC odes to be aalyzed ad mastered: costat or variable EFC space, other types of EFC like direct eteral costraits of C or C types which is possible but their domai of use has to be formalized aalytically to avoid udesirable oscillatios, miig up EFC ad IFC of C types. Last but ot least, the system is strogly ill-coditioed ad this umerical istability is certaily a major difficulty if ot a limitatio to approimatig comple fuctios. But this priciple ca have a rich rage of applicatios like: umerical itegratio, polyomial regressio, Splie approimatio methods improvemet ad motio plaig optimizatio. O this last

9 3 November 7, The Royal Military Academy Sadhurst, Camberley, UK applicatio, we demostrated o a simple case how the EFC ca help to optimize the trajectory i terms of costraits fulfilmet. A particular domai of iterest for EFC method is certaily motio plaig problems usig approaches with parametric curves havig polyomial curvature like of the form: k( s) as a s a a 9 REFERENCES [] C. Ruge, Uber empirische Fuktioe ad die Iterpolatio zwische aquidistate Ordiate. Z. Math. Phys. 46:4 43, 9 [] L. N. Trefethe, Joural of approimatio theory 65, 47-6, 99 [3] J. P. Boyd, J. R. Og, Epoetially-coverget strategies for defeatig the Ruge pheomeo for the approimatio of o-periodic fuctios, part I: sigle-iterval schemes, Commu. Comput. Phys., vol. 5, o. -4, pp , 9. [4] J. P. Boyd, Defeatig the Ruge pheomeo for equispaced polyomial iterpolatio via Tikhoov regularizatio, Appl. Math. Lett., vol.5, o. 6, pp , 99. [5] J. P. Boyd, Luis F. Alfaro, Hermite fuctio iterpolatio o a fiite uiform grid: Defeatig the Ruge pheomeo ad replacig radial basis fuctios Appl. Mat. Lett., vol. 6, o., pp , 3. [6] Be Adcock ad Rodrigo B. Platte, A Mapped Polyomial Method for High-Accuracy Approimatios o Arbitrary Grids, SIAM Joural o Numerical Aalysis > Volume 54, Issue 4, (6 pages), 6 [7] Platte R., Driscoll T., Polyomials ad potetial theory for Gaussia radial basis fuctios iterpolatio. SIAM J. Numer. Aal. 43, pages , 5 [8] Dechao Che, Tiajia Qiao, Hogzhou Ta, Migmig Li ad Yuog Zhag, IEEE 7 th Iteratioal Coferece o Computatioal Sciece ad Egieerig, 4 [9] Hogwei Li, Lijie Su, Searchig globally optimal parameter sequece for defeatig Ruge pheomeo by immuity geetic algorithm, Applied Mathematics ad Computatio 64 (5) 85 98, Elsevier, 5

Cubic Polynomial Curves with a Shape Parameter

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

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

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

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

Ones Assignment Method for Solving Traveling Salesman Problem

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

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

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

Section 7.2: Direction Fields and Euler s Methods

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

. Written in factored form it is easy to see that the roots are 2, 2, i,

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

Pattern Recognition Systems Lab 1 Least Mean Squares

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

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

The isoperimetric problem on the hypercube

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

New Results on Energy of Graphs of Small Order

New 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

3D Model Retrieval Method Based on Sample Prediction

3D 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 information

Convex hull ( 凸殻 ) property

Convex hull ( 凸殻 ) property Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull

More information

Image Segmentation EEE 508

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

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

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

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

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

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

CS 683: Advanced Design and Analysis of Algorithms

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

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

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

How do we evaluate algorithms?

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

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

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

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

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

An Efficient Algorithm for Graph Bisection of Triangularizations

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

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Designing a learning system

Designing a learning system CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please

More information

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute

More information

Lecture 28: Data Link Layer

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

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

Chapter 3 Classification of FFT Processor Algorithms

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

Intermediate Statistics

Intermediate Statistics Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet

More information

Force Network Analysis using Complementary Energy

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

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

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

Lecture 18. Optimization in n dimensions

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 information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

More information

Intro to Scientific Computing: Solutions

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

Octahedral Graph Scaling

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

Optimal Mapped Mesh on the Circle

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

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

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

An Efficient Algorithm for Graph Bisection of Triangularizations

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

Civil Engineering Computation

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

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Improving Template Based Spike Detection

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

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

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

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

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

condition w i B i S maximum u i

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

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

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

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

On Computing the Fuzzy Weighted Average Using the KM Algorithms

On Computing the Fuzzy Weighted Average Using the KM Algorithms O Computig the Fuzzy Weighted Average Usig the KM Algorithms Feilog iu ad Jerry M Medel Sigal ad Image Processig Istitute, Departmet of Electrical Egieerig Uiversity of Souther Califoria, 3740 McClitock

More information

Project 2.5 Improved Euler Implementation

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

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

BASED ON ITERATIVE ERROR-CORRECTION

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

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

Improved triangular subdivision schemes 1

Improved triangular subdivision schemes 1 Improved triagular subdivisio schemes Hartmut Prautzsch 2 Georg Umlauf 3 Faultät für Iformati, Uiversität Karlsruhe, D-762 Karlsruhe, Germay E-mail: 2 prau@ira.ua.de 3 umlauf@ira.ua.de Abstract I this

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

A General Framework for Accurate Statistical Timing Analysis Considering Correlations A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.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

1.2 Binomial Coefficients and Subsets

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

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

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

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

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

Alpha Individual Solutions MAΘ National Convention 2013

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

It just came to me that I 8.2 GRAPHS AND CONVERGENCE

It just came to me that I 8.2 GRAPHS AND CONVERGENCE 44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot

More information

Orientation. Orientation 10/28/15

Orientation. Orientation 10/28/15 Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy

More information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An Estimation of Distribution Algorithm for solving the Knapsack problem Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

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

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

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

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

Arithmetic Sequences

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

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables

2D 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 information

35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD

35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 3 35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD Noah J. DeMoes, Gabriel T. Ba, Bryce D. Wilkis, Theodore

More information

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More information

The Graphs of Polynomial Functions

The Graphs of Polynomial Functions Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where

More information

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

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

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem

More information

Neural Networks A Model of Boolean Functions

Neural Networks A Model of Boolean Functions Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de

More information

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9. Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for

More information

Examples and Applications of Binary Search

Examples and Applications of Binary Search Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We

More information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

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

A Resource for Free-standing Mathematics Qualifications

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

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

Accuracy Improvement in Camera Calibration

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

A Note on Least-norm Solution of Global WireWarping

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

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY BACHMANN-LANDAU NOTATIONS Lecturer: Dr. Jomar F. Rabajate IMSP, UPLB MATH 174: Numerical Aalysis I 1 st Sem AY 018-019 RANKING OF FUNCTIONS Name Big-Oh Eamples Costat O(1 10 Logarithmic O(log log, log(

More information

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Lecturers: 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 information