Short-Term Electrical Load Forecasting Using a Fuzzy ARTMAP Neural Network

Size: px
Start display at page:

Download "Short-Term Electrical Load Forecasting Using a Fuzzy ARTMAP Neural Network"

Transcription

1 Short-Term Electricl Lod Forecsting Using Fuzzy ARTMAP Neurl Network Stefn E. Skrmn, Michel Georgiopoulos, nd Avelino J. Gonzlez Deprtment of Electricl nd Computer Engineering, College of Engineering, University of Centrl Florid, Orlndo, FL, ABSTRACT Accurte electricl lod forecsting is necessry prt of resource mngement for power generting compnies. The better the hourly lod forecst, the more closely the power generting ssets of the compny cn be configured to minimize the cost. Automtion of this process is profitble gol nd neurl networks hve shown promising results in chieving this gol. The most often used neurl network to solve the electric lod forecsting problem is the bck-propgtion neurl network rchitecture. Although the performnce of the bck-propgtion neurl network rchitecture hs been encourging, it is worth noting tht it suffers from the slow convergence problem nd the difficulty of interpreting the nswers tht the rchitecture provides. A neurl network rchitecture tht does not suffer from the bove mentioned drwbcks is the Fuzzy ARTMAP neurl network, developed by Crpenter, Grossberg, nd their collegues t Boston University. In this work we pplied the Fuzzy ARTMAP neurl network to the electric lod forecsting problem. We performed numerous experiments to forecst the electricl lod. The experiments showed tht the Fuzzy ARTMAP rchitecture yields s ccurte electricl lod forecsts s bckpropgtion neurl network with trining time smll frction of the trining time required by the bckpropgtion neurl network. 1. INTRODUCTION AND BACKGROUND Short-term lod forecsting is n essentil function in plnning the opertion of n electricl power system. The better the forecst, the more closely the power genertion ssets of the compny cn be configured to minimize the cost. If the forecst lod is higher thn the ctul lod, power generting units will be needlessly ctivted. If, on the other hnd, the forecst is too low, the deficit hs to be mde up through the opertion of "pekers," smll stndby power units tht cn be brought online reltively quickly. The drwbck with pekers is tht they re expensive to run compred to lrge generting units. However, lrge generting units tke more thn dy to go online from cold stte. Therefore, they cnnot be used to respond to sudden lod chnges in rel time. Florid Power Corportion (FPC), the power compny whose lod forecsting requirements nd dt were used s the bsis for this study, nd other power generting utilities generlly employ humn to perform the electricl lod forecsting function. The forecster typiclly predicts the lod t lest once every work dy. Since the forecster typiclly does not work during the weekends, the forecst for Sturdy, Sundy, nd Mondy re mde on Fridys. Forecsters typiclly receive five-dy wether forecst every dy. A wether forecst becomes more inccurte the further in dvnce it is mde becuse of the difficulty in mking such predictions. The lod forecster fces the sme problem, but the results become even worse becuse of the inccurcy of the wether forecsts tht hve to be used to mke the lod forecst. The forecster typiclly hs t his/her disposl severl yers of wether nd lod dt vilble in printout form. The old vlues re used to find dys of the sme type (e.g., weekdys, weekends, holidys) nd with similr wether conditions s the dy whose lod is to be forecst. The historicl lod profiles, the forecst wether prmeters, nd the type of dy re then used in the determintion of the forecst, bsed on their reltive importnce. The min objective of short-term electricl lod forecsting is to predict the hourly lods one dy or even up to one week hed of time. This is necessry for the opertionl plnning of power system. Since the electricl lod demnd is function of wether vribles nd humn socil ctivities, time series models [3,4], regression models [5,6], nd expert systems [7] hve been proposed to solve this problem. Time series models employ historicl lod dt for extrpoltion to obtin future hourly lods. These models ssume tht the lod trend is sttionry, nd

2 regrd ny bnorml dt s bd dt. Regression models nlyze the reltionship between lod, wether, nd socil ctivities. The disdvntge with regression models is tht they require complex modeling techniques nd hevy computtions to produce ccurte results. Expert systems use n expert forecster s experience nd heuristics to cpture the reltionship between socil ctivities, wether, nd future lods. However, to cpture the expert s experience nd knowledge, trnsforming the knowledge into IF-THEN rules tht cn be used in computer progrm is not n esy tsk. The problem with the described models is tht they lck the desired ccurcy nd they hve difficulty producing ccurte forecsts in the cse of rpid wether chnges [8]. Other reported problems [9] re tht model developed for one utility cnnot esily be modified for use t nother utility nd tht instlltion of the model t new site is often complex nd time-consuming procedure. During the lst severl yers, rtificil neurl networks (ANN`s) hve been pplied to the Short-Term Lod Forecsting (STLF) problem with considerble success. A problem reported by Gerber [2] is tht very long trining time is required for trining of the most commonly used ANN rchitecture (the Bck-Prop. NN). The excessive Bck-Prop trining time prevented Gerber [2] from doing extensive experimenttion with the vilble dt. The power generting compnies need system tht cn mke forecst up to seven dys hed of time. However, this would require even longer trining time thn wht is needed to trin system to mke n hourly forecst 24 hours hed of time. The hypothesis of this pper ws to pply the Fuzzy ARTMAP neurl network to the lod forecsting problem. The short trining time of the Fuzzy ARTMAP NN llowed us to conduct more experiments in order to identify n optimum input prmeter set, nd led eventully to more ccurte forecsts. Another problem with the Bck- Prop. NN is the difficulty to interpret its nswers. The opertion of the Fuzzy ARTMAP rchitecture is better understood nd the nswers derived by the rchitecture cn be logiclly explined. Therefore, it should be possible to determine why certin dys re more difficult to forecst thn others, nd hence wht to do to improve the forecst ccurcy for those dys. In section 2, the Fuzzy ARTMAP NN lgorithm is described. Section 3 describes the experiments nd presents the results chieved in this reserch. Section 4 summrizes nd describes the conclusions drwn from this work. 2. FUZZY ARTMAP NEURAL NETWORK The Fuzzy ARTMAP neurl network is n rchitecture tht cn lern rbitrry mppings from nlog or digitl inputs of ny dimensionlity to nlog or digitl outputs of ny dimensionlity. The rchitecture pplies incrementl supervised lerning of recognition ctegories nd multidimensionl mps in response to rbitrry sequences of nlog or binry input vectors, which my represent fuzzy or crisp set of fetures. [10]. The Fuzzy ARTMAP NN consists of two Fuzzy ART modules designted s Fuzzy ART nd Fuzzy ART b, s well s n inter Fuzzy ART module, s shown in Figure 1. Inputs re presented t the Fuzzy ART module, while the outputs re presented t the Fuzzy ART b module. The Inter-Fuzzy ART module includes MAP field, whose purpose is to determine whether the mpping between the presented input nd output is the desired one. The F 0 lyer receives the input vector nd produces the complement encoded input vector I. The complement encoded vector I is creted s: I = (, c ) = ( 1,, M, 1 c,, M c ) (1) i c = 1 - i, 1 i M, where M is the dimensionlity of the input vector (2) Hence, the F 0 lyer cts s preprocessor to the Fuzzy ART rchitecture. The vector I is subsequently pplied t the F 1 lyer. In most cses the complement encoding is not necessry for the output vector O. F 2 nd F 2 b re the lyers where compressed representtions of the input ptterns nd the output ptterns re estblished respectively.

3 Inter-Fuzzy ART module F b Fuzzy ART module W j Fuzzy ARTb module Rho F 2 F 2 b w j W j Reset w k b W k b Reset F 1 F 1 b I = (, c ) F 0 Rho_ O Rho_b Figure 1 - Block digrm of the Fuzzy ARTMAP rchitecture. Index i is used to designte the nodes in the F 1 lyer, index j is used to designte nodes in the F 2 lyer, index k is used to designte nodes in the Fuzzy MAP lyer (F b ) nd the F 2 b lyer, index l is used to designte nodes in the F 1 b lyer. Hence W j = (W 1j,, W (2M)j ) is the vector of bottom-up weights emnting from node i in the F 1 lyer to node j in the F 2 lyer. The vector of top-down weights emnting from node j to node i is denoted s w j = (w j1,, w j(2m) ). Also, W k b = (W 1k b,, W (Mb)k b ) is the vector of bottom-up weights converging to node k in F 2 b. Furthermore, w k b = (w k1 b,, w k (M b ) b ) is the vector of top-down weights converging to node l from node k in F 2 b. Finlly, w j = (w j1, w jnb ) is the vector of weights emnting from node j in F 2 nd converging to the nodes of the MAP lyer F b. A vector whose components re the top-down weights emnting from single node in F 2 /F 2 b is clled templte of the Fuzzy ART /b module. An uncommitted templte is defined to be the vector of top-down weights ssocited with node in F 2 /F 2 b which hs not yet been chosen to represent n input/output pttern. Ech of the components of n uncommitted templte is equl to one. The vigilnce prmeters, ρ /b (designted s Rho_/b in Figure 1) constrints the mximum size of the compressed representtions of the input/output ptterns. The rnge of the vigilnce prmeter is the intervl [0,1]. Smll vlues of the vigilnce prmeter results in corse clustering of the ptterns, while lrge vlues led to fine clustering. The choice prmeters β /b ffect the choice of node. The rnge of the choice prmeter is the intervl (0, ). Relisticlly, the vlue should not exceed vlue tht is proportionl to the numbers M nd M b respectively.

4 3. RESULTS 3.1 Network prmeter evlution The Fuzzy ARTMAP network performnce depends on the vlues of the prmeters β /b nd ρ /b. In order to identify n optiml set of network prmeter vlues for the problem t hnd, we conducted number of experiments. The network prmeter evlution ws performed using one dy hed, one hour forecst, predicting Wednesdys lod t 7:00 m. The trining exmples used for prmeter evlution consist of ll norml Wednesdys (Wednesdys tht re not holidys) from 1993 nd 1994, up to 10/12/93 nd 10/12/94 respectively. Wednesdys fter 10/12 re not used for trining due to the fct tht 1995 dt (used for testing) includes dt only up to 10/12/95. The test exmples used consist of ll norml Wednesdys from 1995, up to 10/12/95. The trining exmples correspond to 94 dys nd the test exmples correspond to 40 dys. A bsic trining set (the sme trining set s used by Gerber [2]) ws used for the network prmeter evlution. This trining set included 27 tempertures nd 6 lods. The 27 tempertures were spred over three dy period; the dy to forecst, the current dy (the dy before the dy to forecst), nd the previous dy (the dy two dys before the dy to forecst). For ech dy, the hour to forecst nd the two preceding hours were used s inputs. The temperture dt is vilble for Orlndo, St. Petersburg, nd Tllhssee. This yields 27 temperture inputs (3 cities * 3 hours* 3 dys = 27). The six lods used for the input were spred over two dy period, the current dy, nd the previous dy. For ech dy the hour to forecst nd the two preceding hours were used for the lod inputs. This yields six lod inputs (2 dys*3 hours = 6). For ech experiment, the ρ ws chosen s 0, 0.3, 0.6, or 0.9, while the ρ b ws chosen s 0.95, 0.99, 0.995, 1.0, nd β = β b used vlues of 0.01, 1, 5, 10. Tble 1 shows the network prmeter evlution results by choosing specific ρ vlue nd obtining the network performnce for ll possible combintions of the other network prmeters. The MAPE (Men Absolute Percentge Error) vlue is clculted s the verge APE (Absolute Percentge Error) vlue for ll test Wednesdys, where APE = Actul lod Pr edicted lod Actul lod 100 (3) The best result chieved ws MAPE = 7.4% for ρ = 0.0, β = β b = 10, nd ρ b = These prmeter vlues creted firly smll network with 17 nodes in F 2 nd 7 nodes in F 2 b. The corresponding result obtined by Gerber [2] ws MAPE = 6.8%, using the sme trining exmples nd the sme test set. However, the trining time required to trin the Fuzzy ARTMAP neurl network ws very short ( few minutes) compred to hours of trining for the Bck-Propgtion neurl network used by Gerber. The order of trining pttern presenttion to Fuzzy ARTMAP ffects its performnce. Therefore by trining 10 networks with the sme trining set, but with different orders of pttern presenttion nd tking the predicted lod to be the verge of the outputs from the 10 networks, we expected performnce improvement. Tble 2 show the results for the ten network pproch. The best result ws MAPE = 7.3%. This result is only 0.1% points better thn the one network pproch. The minor performnce improvement, the incresed trining time (fctor 10), nd incresed weight storge (fctor 10) of the ten network pproch llows us to conclude tht for this experiment the ten network pproch is inferior to the one network pproch.

5 Tble 1 - MAPE using 1 neurl network to forecst the lod for Wednesdys t 7:00 m. Rho_b Rho_b Tble 1.1,MAPE, rho_ = 0.0 Tble 1.2, MAPE, rho_ = 0.3 Rho_b Rho_b Tble 1.3, MAPE, rho_ = 0.6 Tble 1.4, MAPE, rho_ = 0.9 Tble 2 - MAPE using 10 neurl network to forecst the lod for Wednesdys t 7:00 m. Rho_b Rho_b Tble 2.1, MAPE, rho_ = 0.0 Tble 2.2, MAPE, rho_=0.3 Rho_b Rho_b Tble 2.3, MAPE, rho_=0.6 Tble 2.4, MAPE, rho_ = hour forecst for Wednesdys The forecst ws mde one dy hed of time for ll 24 hours of Wednesdys in 1995, up to 10/12/95, for the sme resons mentioned in section 3.1. Every hour is predicted with one nd ten seprte networks, using the prmeter vlues tht yielded the best performnce during the network prmeter evlution phse (ρ = 0.0, ρ b = 0.95, β = β b = 10). The bsic trining set using 27 tempertures nd 6 lods ws used for trining nd testing. The network ws trined using dt from 1993 nd 1994 (Wednesdys only, 94 dys) nd tested using dt from 1995 (Wednesdys only, 40 dys). Tbles 3 nd 4 show the performnce when one nd ten networks were used to forecst ech hour, respectively. MAPE denotes the verge performnce for ll test dys. MAX is the mximum error for ll test dys. MIN is the minimum error for ll testing dys. For this experiment there is significnt improvement by using 10 networks, the MAPE decreses by 1.2% points, however, the MAPE vlue is still high.

6 Tble 3 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for one dy hed, 24 hour forecst (Wednesdys) using 1 NN. MAPE = 7.7% MAX = 25.4% MIN = 3.0% Std dev = 4.5% MAPE (Dys bove 10% excluded (7 dys)) = 6.0% Tble 4 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for one dy hed, 24 hour forecst (Wednesdys) using 10 NNs. MAPE = 6.5% MAX = 25.5% MIN = 1.9% Std dev = 4.5% MAPE (Dys bove 10% excluded (7 dys)) = 5.2% 3.3 Grouping of dys According to Hsu nd Yng [11], severl dys of the week hve similr lod profiles nd cn therefore be lumped into the sme group. According to Hsu nd Yng, Mondys nd dys fter holidys hve similr lod profile, Tuesdys through Fridys hve similr lod profile, Sturdys nd dys before holidys hve similr lod profile, nd finlly Sundys nd holidys hve similr lod profile. One possible method to decrese the reltively high MAPE chieved so fr, is to increse the number of trining exmples. Therefore, the method of grouping dys together ws tried. The trining/testing set described in previous sections were used for this group of experiments. The network prmeter set derived in section 3.1 ws used. Two sets of experiments were mde: 1. Identicl to n experiment evluted by Gerber [2], where the forecst ws mde one dy hed of time, predicting the lod t 7:00 m. 2. Lod forecst one dy hed of time,predicting ll 24 hours, where ech hour is predicted with one nd ten networks, respectively. Tble 5 shows the performnce for the one dy hed forecst, predicting the lod t 7:00 m. The MAPE for the forecst of Wednesdys t 7:00 m used in the grouping of Tuesdys trough Fridys is equl to 5.2%, the corresponding MAPE when Wednesdys lone were used for trining is 7.4% (Tble 1). The grouping of dys significntly improves the performnce, the MAPE decresed by 2.2% points nd the stndrd devition decresed by 3.1% points. The corresponding MAPE reported by Gerber [2] is 4.4%, 0.8% points better thn the result chieved here. The reson tht the Bck-Propgtion neurl network yields better results thn the Fuzzy ARTMAP lgorithm is most likely due to the fct tht the Bck-Prop. NN provides s nswers to test inputs interpoltions of the nswers to trining inputs. The Fuzzy ARTMAP, fter trining, provides s nswers to test inputs only the nswers provided to trining inputs in the trining phse. Tbles 6 nd 7 show the result for the 24 hour forecst. The MAPE for the 24 hour forecst of Wednesdys used in the grouping of Tuesdys trough Fridys is equl to 6.3% (Tble 6), the corresponding MAPE when Wednesdys lone were used for trining is 7.7% (Tble 3). The result for the Wednesdys used in the grouping of dys is 1.4% points better thn when only those Wednesdys were used for trining. The result for the 10 network pproch is MAPE = 5.8%, 0.5% points better thn the one network pproch. Once gin, it is demonstrted tht the performnce when severl networks re used to forecst ech hour is better thn the performnce when single network is used to forecst ech hour.

7 The grouping of dys hd positive effect on the verge MAPE for Wednesdys. Since the results for the other groups of dys (see [1]) re close to the result for the Tuesdys-Fridys group, one cn conclude tht n incresed number of trining exmples hs positive effect on the performnce of the network. Tble 5 - MAPE, Mx MAPE, Min MAPE, nd Stndrd devition of MAPE for one dy hed forecst (forecst for Tuesdys-Fridys t 7:00m). MAPE = 5.4% MAX = 28.8% MIN = 0.05% Std dev = 4.9% MAPE (Dys bove 10% excluded) = 3.9% MAPE (Wednesdy's only) = 5.2% Tble 6 - MAPE, Mx MAPE, Min MAPE, nd Stndrd devition of MAPE for one dy hed 24 hour forecst using 1NN(forecst for Tuesdys-Fridys). MAPE = 6.3% MAX = 20.1% MIN = 2.9 Std dev = 2.8% MAPE (Wednesdy's only) = 6.3% Tble 7 - MAPE, Mx MAPE, Min MAPE, nd Stndrd devition of MAPE for one dy hed 24 hour forecst using 10 NNs (forecst for Tuesdys-Fridys). MAPE = 5.8% MAX = 20.1% MIN = 2.3 Std dev = 2.8% MAPE (Wednesdy's only) = 6.4% 3.4 Sesonl influence The lod profile for dys belonging to certin group chnges s the seson chnges. To tke the sesonl effect into considertion, 24 hour forecst ws produced using networks trined with dt from June, July, August of 1993, nd 1994 nd tested with dt from June, July, nd August of A 24 hour forecst ws lso performed using networks tht re trined with dt from Jnury, nd Februry of 1993, nd 1994 nd tested with dt from Jnury, nd Februry of The bsic trining set used included 27 tempertures nd 6 lods. The sme network prmeter set tht yielded the best results during the prmeter evlution section ws used. Both trining nd testing were performed on the Tuesdys to Fridys group (100 trining exmples nd 43 testing exmples for the June-August group, 64 trining exmples nd 28 testing exmples for the Jnury-Februry group). As shown in Tbles 8 nd 9 (the left columns show the performnce with sesonl influence nd the right columns shows the performnce without sesonl influence). There is smll improvement by using sesonl dt for trining, since the verge MAPE decresed by 0.3% points nd 0.1% points respectively. An importnt dvntge is tht the mximum error for most dys is lower when the sesonl effect is tken into considertion. For certin dys the mximum error decresed significntly (e.g. from 21.6% to 8.3% for 6/20/95) for the June-August period. The Jnury-Februry period shows similr behvior, for certin dys the mximum error decresed significntly (e.g. from 28% to 10% for 2/7/95).

8 Using sesonl dt for trining hs the dvntge tht for certin dys it decresed the mximum APE. This implies tht the sesonl trining is worthwhile procedure, despite the fct tht the verge MAPE does not decrese significntly. Tble 8 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for one dy hed, 24 hour forecst for Tuesdys-Fridys, with nd without sesonl influence (June, July, August). MAPE MAX MIN Std dev Tble 9 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for one dy hed, 24 hour forecst for Tuesdys-Fridys, with nd without sesonl influence (Jnury, Februry). MAPE MAX MIN Std dev Dily forecst using 1 neurl network In previous sections, one or ten seprte neurl networks hve been used to predict the lod for every single hour of the dy. In this section, one network is used to predict the lod for ll 24 hours of the next dy. The one dy hed, 24 hour forecst ws performed using networks trined with dt from June, July, nd August of 1993, nd 1994 nd tested with dt from June, July, nd August of 1995 (100 trining exmples nd 43 testing exmples). Also, one dy hed, 24 hour forecst using networks trined with dt from Jnury, nd Februry of 1993, nd 1994, nd tested with dt from Jnury, nd Februry of 1995 ws performed (64 trining exmples nd 28 testing exmples). The trining/testing uses yesterdys ctul tempertures nd lods, plus the forecst tempertures for the dy to forecst. This result in 168 input prmeters (24 tempertures for 3 cities for 2 dys = 144 inputs + 24 lods = 168). Both trining nd testing ws performed on the Tuesdys to Fridys group. The left column of Tble 10 shows the performnce for the June-August group. The results re resonble with MAPE = 6.3%. The Jnury-Februry group yield slightly worse results with MAPE = 7.6% (left column of Tble 11). In both cses, the shpe of the lod curves ws correctly predicted for ll the test dtes. However, both predictions underestimte, in most instnces, the ctul lod. Therefore, n effort to correct the underestimtion ws undertken. The lod consumption hs incresed from yer to yer over the time period covered in this reserch. Since the forecst vlue in lmost every test cse ws found to be lower thn the ctul vlue, the simple pproch to increse the forecst vlue by certin percentge ws evluted in this section. Experiments hve showed tht by incresing the forecst lod by 4% yielded the gretest performnce improvement. The verge performnce improved by 1.2% points for the June-August group (compre the left column of Tble 10 to the right column of Tble 10) nd by 1.1% points for the Jnury-Februry group (compre the left column of Tble 11 to the right column of Tble 11). As shown by Tble 10 the MAPE decreses but the mximum nd the minimum APE vlue increses for the June-August group. The reson for this is becuse the forecst lod for some dys is lredy higher thn the ctul lod before the increment of the forecst is pplied. However, this type of dys re uncommon compred to the number of dys tht hve forecst vlue tht is lower thn the ctul vlue. On the other hnd, for the Jnury-Februry group (Tble 11) the MAPE, the Mx, nd the Min decreses when the forecst vlue is incresed. The reson for this is due to the fct tht the forecst vlue is more often lower thn the ctul vlue for the Jnury-Februry group thn for the June-August group.

9 Tble 10 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for one dy hed, dily forecst, using 1NN without nd with incremented prediction (June-August). MAPE MAX MIN Std dev Tble 11 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for one dy hed, dily forecst, using 1NN without nd with incremented prediction (Jnury-Februry). MAPE MAX MIN Std dev Input prmeter set evlution The input prmeter set used in previous sections hs been bsic trining set including few tempertures nd lods s inputs. The reson the bsic input prmeter set hs been used ws to fcilitte fir comprisons with the results obtined by Gerber [2]. However, since different neurl network rchitecture is used in this reserch, different input prmeter set might improve the performnce. The input prmeter sets evluted in this section ws: Bsic: 27 tempertures (tempertures for the hour to forecst plus the two preceding hours for yesterdy, tody nd the dy to forecst for Orlndo, St. Petersburg, nd Tllhssee) nd 6 lods (electricl lod for the hour to forecst plus the two preceding hours for yesterdy nd tody), re used in this dt set. 6h: 54 tempertures (tempertures for the hour to forecst plus the five preceding hours for yesterdy, tody nd the dy to forecst for Orlndo, St. Petersburg, nd Tllhssee) nd 12 lods (electricl lod for the hour to forecst plus the five preceding hours for yesterdy nd tody), re used in this dt set. 12h: 36 tempertures (tempertures for the hour to forecst plus the eleven preceding hours) nd 11 lods (electricl lod for the eleven hours preceding the hour to forecst), re used in this dt set. Averge: 9 tempertures (tempertures for the hour to forecst plus the two preceding hours for yesterdy, tody nd the dy to forecst; the temperture is set to be the verge temperture of Orlndo, St. Petersburg, nd Tllhssee) nd 6 lods (electricl lod for the hour to forecst plus the two preceding hours for yesterdy nd tody), re used in this dt set. The trining/testing exmples used were from the Tuesdy-Thursdy group (100 trining exmples nd 43 testing exmples for the June-August group, nd 64 trining exmples nd 28 testing exmples for the Jnury-Februry group). Tble 12 shows the results for ρ b = The top hlf of Tble 12 shows the results for the Jnury-Februry group nd the bottom hlf shows the results for the June-August group. Similrly, Tble 13 shows the results for ρ b = The bsic input prmeter set yields n APE of 5.1% with stndrd devition of 3.4% for ρ b = for the June- August group. Both the 6h nd the 12h input prmeters set yield better results. This mkes sense, since more informtion is used in the input pttern. In prticulr the 12h input prmeters set, yields the most promising results. This lso mkes sense since dt from the hour to forecst plus the eleven preceding hours re used for the input, for both lod nd temperture. The gretest improvement is noticed for the Jnury-Februry group where the 12h input prmeters set is 4.2% points better thn the 6h input prmeter set nd 4.5% points better thn the bsic input prmeter set (Tble 12). The comprison between the 12h input prmeter set nd the other input sets is not totlly fir becuse during this test ctul vlues were used for both tempertures nd lods in the 12h input

10 prmeters set. However, during rel execution of the system this would not be possible if the forecst is to be mde t lest one dy hed of time. Therefore, the 12h input prmeters set should be evluted using forecst vlues. The use of verge temperture shows smll performnce improvement compred to the bsic input prmeters set for the June-August group. For the Jnury-Februry group, however, the result for the input prmeter set with verge temperture is the worst with APE = 13.2% nd stndrd devition = 10.9%. The reson for this behvior is due to the fct tht there re lrge temperture differences between the three cities during the winter months. On the other hnd, during the summer months, the tempertures in the three cities re not significntly different from ech other, nd hence the verge temperture ide works. When the verge temperture ide is used to forecst the lod for the winter months, lot of temperture informtion is lost nd therefore, worse forecst is produced. Tble 12 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for four prmeter sets, ρ b = Bsic 6h 12h Averge MAPE MAX MIN Std dev MAPE MAX MIN Std dev Tble 13 - MAPE, Mx MAPE, Min MAPE, nd stndrd devition of MAPE for four prmeter sets, ρ b = Bsic 6h 12h Averge MAPE MAX MIN Std dev MAPE MAX MIN Std dev REVIEW AND CONCLUSIONS In n erlier work, Gerber [2] used the Bck-Prop. NN to forecst the electricl lod for the Florid Power dt. Gerber reported excessive trining time to trin the Bck-Prop. NN. Therefore, we pplied the Fuzzy ARTMAP NN to the electricl lod forecsting problem nd conducted identicl experiments s the ones crried out by Gerber. The forecsting results chieved with the Fuzzy ARTMAP NN were slightly worse thn wht Gerber chieved with the Bck-Prop. NN. The reson for this is tht the Bck-Prop. NN hs better interpolting bility thn Fuzzy ARTMAP. However, the trining time required by the Fuzzy ARTMAP NN is only smll frction of wht the Bck-Prop. NN requires to solve the sme problem. Experiments hve showed tht by using 10 networks to forecst ech hour nd use the verge output from the 10 networks s the forecst vlue, the network s performnce is significntly improved compred to single network s performnce. Especilly the fluctutions in the forecst lod profile experienced with the one network pproch is significntly decresed. The grouping of dys hd positive effect on the network s

11 performnce. By grouping dys with similr lod profiles together, nd thereby incresing the number of trining exmples, the performnce improved by s much s 2.2 % points. The seson hd n effect on the extremely high APE vlues tht occurred for certin dys. When the seson ws tken into considertion, the APE vlue for some hours decresed with s much s 18% points. Since historicl dt re used for trining nd the fct tht the lod demnd increses over the covered time period, it is expected tht the forecst lod should be lower thn the ctul lod. This observtion is especilly true when one network is used to forecst ll 24 hours of the next dy. The input prmeter set hs significnt effect on the network s performnce. Experiments showed 6.1% points difference between the best nd the worst input prmeter set. More reserch hs to be done to find Fuzzy ARTMAP s optimum input prmeter set for the short term electricl lod forecsting problem. ACKNOWLEDGEMENTS The uthors re grteful to the Florid Power Corportion s Energy Control Center, St. Petersburg, Florid for the dt provided for this reserch. REFERENCES [1] Stefn E. Skrmn, Short-Term Electricl Lod Forecsting Using Fuzzy ARTMAP Neurl Network, Mster s thesis, University of Centrl Florid, Orlndo, [2] Willim J. Gerber, Prmetric nlysis of electricl lod forecsting using rtificil neurl networks, Mster s Thesis, University of Centrl Florid, Nov [3] W. Christinse, Short-term lod forecsting using generl exponentil smoothing, IEEE Trnsctions on Power Apprtus nd Systems. vol. PAS-90, April, 1971, pp [4] D. W. Bunn nd E. D. Frmer, Comprtive models for electricl lod forecsting. New York: John Wiley & Son, [5] C. Asbury, Wether lod model for electricl demnd energy forecsting, IEEE Trnsctions on Power Apprtus nd Systems, vol. PAS-94, no. 4, 1975, pp [6] A. D. Pplexopoulos nd T. C. Hesterberg, A regression bsed pproch to short-term system lod IEEE Trnsctions on Power Systems, vol. 5, Nov. 1990, pp [7] S. Rhmn nd R. Bhtngr, An expert system bsed pproch for short-term lod forecst, IEEE Trnsctions on Power Systems, vol. 3, No. 2, My 1988, pp [8] A. Khtonzd, R-C. Hwng, A. Abye, nd D. Mrtukulm, An dptive modulr rtificil neurl network hourly lod forecster nd its implementtion t electric utilities, IEEE-PES Winter Meeting [9] Shin-Tzo Chen, Dvid C. Yu, nd A. R. Moghddmjo, Whether sensitive short-term lod forecsting using non-fully connected rtificil neurl networks, IEEE Trnsctions on Power Systems, vol. 7, no. 3, Aug [10] G. A Crpenter, S. Grossberg, N. Mrkuzon, H. Reynolds, nd D. B Rosen, Fuzzy ARTMAP: A neurl network rchitecture for incrementl supervised lerning of nlog multidimensionl mps, IEEE Trnsctions on Neurl Networks, vol. 3, no. 5, Sept. 1992, pp [11] Y-Y. Hsu, nd C-C. Yng, Electricl lod forecsting, Aln F. Murry, Applictions of Neurl Networks, Kluwer Acdemic Publishers, 1995, pp

Online Short Term Load Forecasting by Fuzzy ARTMAP Neural Network

Online Short Term Load Forecasting by Fuzzy ARTMAP Neural Network Online Short Term Lod Forecsting by Fuzzy ARTMAP Neurl Network SHAHRAM JAVADI Electricl Engineering Deprtment AZAD University Tehrn Centrl Brnch Moshnir Power Electric Compny IRAN Abstrct: This pper presents

More information

APPROXIMATE INTEGRATION

APPROXIMATE INTEGRATION APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be

More information

Acceptance Sampling by Attributes

Acceptance Sampling by Attributes Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

Lecture 14: Quadrature

Lecture 14: Quadrature Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl

More information

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

More information

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by. NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with

More information

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below. Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we

More information

Numerical Integration

Numerical Integration Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the

More information

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7 CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

Measuring Electron Work Function in Metal

Measuring Electron Work Function in Metal n experiment of the Electron topic Mesuring Electron Work Function in Metl Instructor: 梁生 Office: 7-318 Emil: shling@bjtu.edu.cn Purposes 1. To understnd the concept of electron work function in metl nd

More information

Predict Global Earth Temperature using Linier Regression

Predict Global Earth Temperature using Linier Regression Predict Globl Erth Temperture using Linier Regression Edwin Swndi Sijbt (23516012) Progrm Studi Mgister Informtik Sekolh Teknik Elektro dn Informtik ITB Jl. Gnesh 10 Bndung 40132, Indonesi 23516012@std.stei.itb.c.id

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil

More information

Numerical integration

Numerical integration 2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter

More information

CBE 291b - Computation And Optimization For Engineers

CBE 291b - Computation And Optimization For Engineers The University of Western Ontrio Fculty of Engineering Science Deprtment of Chemicl nd Biochemicl Engineering CBE 9b - Computtion And Optimiztion For Engineers Mtlb Project Introduction Prof. A. Jutn Jn

More information

5.7 Improper Integrals

5.7 Improper Integrals 458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the

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

2008 Mathematical Methods (CAS) GA 3: Examination 2

2008 Mathematical Methods (CAS) GA 3: Examination 2 Mthemticl Methods (CAS) GA : Exmintion GENERAL COMMENTS There were 406 students who st the Mthemticl Methods (CAS) exmintion in. Mrks rnged from to 79 out of possible score of 80. Student responses showed

More information

1 Probability Density Functions

1 Probability Density Functions Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

Tests for the Ratio of Two Poisson Rates

Tests for the Ratio of Two Poisson Rates Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

More information

Week 10: Line Integrals

Week 10: Line Integrals Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.

More information

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses

More information

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d Interntionl Industril Informtics nd Computer Engineering Conference (IIICEC 15) Driving Cycle Construction of City Rod for Hybrid Bus Bsed on Mrkov Process Deng Pn1,, Fengchun Sun1,b*, Hongwen He1, c,

More information

Vyacheslav Telnin. Search for New Numbers.

Vyacheslav Telnin. Search for New Numbers. Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which

More information

Shear and torsion interaction of hollow core slabs

Shear and torsion interaction of hollow core slabs Competitive nd Sustinble Growth Contrct Nº G6RD-CT--6 Sher nd torsion interction of hollow core slbs HOLCOTORS Technicl Report, Rev. Anlyses of hollow core floors December The content of the present publiction

More information

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response

More information

Non-Linear & Logistic Regression

Non-Linear & Logistic Regression Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find

More information

ADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS

ADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS ADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS F. Tkeo 1 nd M. Sk 1 Hchinohe Ntionl College of Technology, Hchinohe, Jpn; Tohoku University, Sendi, Jpn Abstrct:

More information

Multiscale Fourier Descriptor for Shape Classification

Multiscale Fourier Descriptor for Shape Classification Multiscle Fourier Descriptor for Shpe Clssifiction Iivri Kunttu, een epistö, Juhni Ruhm 2, nd Ari Vis Tmpere University of Technology Institute of Signl Processing P. O. Box 553, FI-330 Tmpere, Finlnd

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses Chpter 9: Inferences bsed on Two smples: Confidence intervls nd tests of hypotheses 9.1 The trget prmeter : difference between two popultion mens : difference between two popultion proportions : rtio of

More information

Chapter 14. Matrix Representations of Linear Transformations

Chapter 14. Matrix Representations of Linear Transformations Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn

More information

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1 Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann is the Mann! (But Lebesgue may besgue to differ.) Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

More information

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b. Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn

More information

13: Diffusion in 2 Energy Groups

13: Diffusion in 2 Energy Groups 3: Diffusion in Energy Groups B. Rouben McMster University Course EP 4D3/6D3 Nucler Rector Anlysis (Rector Physics) 5 Sept.-Dec. 5 September Contents We study the diffusion eqution in two energy groups

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Math& 152 Section Integration by Parts

Math& 152 Section Integration by Parts Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible

More information

Lecture 20: Numerical Integration III

Lecture 20: Numerical Integration III cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed

More information

CS 188: Artificial Intelligence Spring 2007

CS 188: Artificial Intelligence Spring 2007 CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment

More information

MAA 4212 Improper Integrals

MAA 4212 Improper Integrals Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which

More information

Data Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading

Data Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading Dt Assimiltion Aln O Neill Dt Assimiltion Reserch Centre University of Reding Contents Motivtion Univrite sclr dt ssimiltion Multivrite vector dt ssimiltion Optiml Interpoltion BLUE 3d-Vritionl Method

More information

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between

More information

4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve

4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve Dte: 3/14/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: Use your clcultor to solve 4 7x =250; 5 3x =500; HW Requests: Properties of Log Equtions

More information

Discrete Least-squares Approximations

Discrete Least-squares Approximations Discrete Lest-squres Approximtions Given set of dt points (x, y ), (x, y ),, (x m, y m ), norml nd useful prctice in mny pplictions in sttistics, engineering nd other pplied sciences is to construct curve

More information

The steps of the hypothesis test

The steps of the hypothesis test ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of

More information

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007 A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus

More information

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (

More information

For the percentage of full time students at RCC the symbols would be:

For the percentage of full time students at RCC the symbols would be: Mth 17/171 Chpter 7- ypothesis Testing with One Smple This chpter is s simple s the previous one, except it is more interesting In this chpter we will test clims concerning the sme prmeters tht we worked

More information

Math 31S. Rumbos Fall Solutions to Assignment #16

Math 31S. Rumbos Fall Solutions to Assignment #16 Mth 31S. Rumbos Fll 2016 1 Solutions to Assignment #16 1. Logistic Growth 1. Suppose tht the growth of certin niml popultion is governed by the differentil eqution 1000 dn N dt = 100 N, (1) where N(t)

More information

x = b a N. (13-1) The set of points used to subdivide the range [a, b] (see Fig. 13.1) is

x = b a N. (13-1) The set of points used to subdivide the range [a, b] (see Fig. 13.1) is Jnury 28, 2002 13. The Integrl The concept of integrtion, nd the motivtion for developing this concept, were described in the previous chpter. Now we must define the integrl, crefully nd completely. According

More information

Read section 3.3, 3.4 Announcements:

Read section 3.3, 3.4 Announcements: Dte: 3/1/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: 1. f x = 3x 6, find the inverse, f 1 x., Using your grphing clcultor, Grph 1. f x,f

More information

Numerical Analysis: Trapezoidal and Simpson s Rule

Numerical Analysis: Trapezoidal and Simpson s Rule nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =

More information

New data structures to reduce data size and search time

New data structures to reduce data size and search time New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute

More information

Math 131. Numerical Integration Larson Section 4.6

Math 131. Numerical Integration Larson Section 4.6 Mth. Numericl Integrtion Lrson Section. This section looks t couple of methods for pproimting definite integrls numericlly. The gol is to get good pproimtion of the definite integrl in problems where n

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

Section 6: Area, Volume, and Average Value

Section 6: Area, Volume, and Average Value Chpter The Integrl Applied Clculus Section 6: Are, Volume, nd Averge Vlue Are We hve lredy used integrls to find the re etween the grph of function nd the horizontl xis. Integrls cn lso e used to find

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed

More information

Monte Carlo method in solving numerical integration and differential equation

Monte Carlo method in solving numerical integration and differential equation Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The

More information

Scientific notation is a way of expressing really big numbers or really small numbers.

Scientific notation is a way of expressing really big numbers or really small numbers. Scientific Nottion (Stndrd form) Scientific nottion is wy of expressing relly big numbers or relly smll numbers. It is most often used in scientific clcultions where the nlysis must be very precise. Scientific

More information

8.2 ESTIMATING DETENTION VOLUMES

8.2 ESTIMATING DETENTION VOLUMES 8.. Plnning versus Design number of detention bsin plnning methods hve been proposed in the professionl literture. These provide estimtes of the reuired volume of detention storge. The outlet structure

More information

Best Approximation. Chapter The General Case

Best Approximation. Chapter The General Case Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given

More information

Section 5.1 #7, 10, 16, 21, 25; Section 5.2 #8, 9, 15, 20, 27, 30; Section 5.3 #4, 6, 9, 13, 16, 28, 31; Section 5.4 #7, 18, 21, 23, 25, 29, 40

Section 5.1 #7, 10, 16, 21, 25; Section 5.2 #8, 9, 15, 20, 27, 30; Section 5.3 #4, 6, 9, 13, 16, 28, 31; Section 5.4 #7, 18, 21, 23, 25, 29, 40 Mth B Prof. Audrey Terrs HW # Solutions by Alex Eustis Due Tuesdy, Oct. 9 Section 5. #7,, 6,, 5; Section 5. #8, 9, 5,, 7, 3; Section 5.3 #4, 6, 9, 3, 6, 8, 3; Section 5.4 #7, 8,, 3, 5, 9, 4 5..7 Since

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

Generalized Fano and non-fano networks

Generalized Fano and non-fano networks Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in

More information

An approximation to the arithmetic-geometric mean. G.J.O. Jameson, Math. Gazette 98 (2014), 85 95

An approximation to the arithmetic-geometric mean. G.J.O. Jameson, Math. Gazette 98 (2014), 85 95 An pproximtion to the rithmetic-geometric men G.J.O. Jmeson, Mth. Gzette 98 (4), 85 95 Given positive numbers > b, consider the itertion given by =, b = b nd n+ = ( n + b n ), b n+ = ( n b n ) /. At ech

More information

THERMAL EXPANSION COEFFICIENT OF WATER FOR VOLUMETRIC CALIBRATION

THERMAL EXPANSION COEFFICIENT OF WATER FOR VOLUMETRIC CALIBRATION XX IMEKO World Congress Metrology for Green Growth September 9,, Busn, Republic of Kore THERMAL EXPANSION COEFFICIENT OF WATER FOR OLUMETRIC CALIBRATION Nieves Medin Hed of Mss Division, CEM, Spin, mnmedin@mityc.es

More information

Math 113 Fall Final Exam Review. 2. Applications of Integration Chapter 6 including sections and section 6.8

Math 113 Fall Final Exam Review. 2. Applications of Integration Chapter 6 including sections and section 6.8 Mth 3 Fll 0 The scope of the finl exm will include: Finl Exm Review. Integrls Chpter 5 including sections 5. 5.7, 5.0. Applictions of Integrtion Chpter 6 including sections 6. 6.5 nd section 6.8 3. Infinite

More information

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0) 1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this

More information

Continuous Random Variables

Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Lerning Tom Mitchell, Mchine Lerning, chpter 13 Outline Introduction Comprison with inductive lerning Mrkov Decision Processes: the model Optiml policy: The tsk Q Lerning: Q function Algorithm

More information

A. Limits - L Hopital s Rule ( ) How to find it: Try and find limits by traditional methods (plugging in). If you get 0 0 or!!, apply C.! 1 6 C.

A. Limits - L Hopital s Rule ( ) How to find it: Try and find limits by traditional methods (plugging in). If you get 0 0 or!!, apply C.! 1 6 C. A. Limits - L Hopitl s Rule Wht you re finding: L Hopitl s Rule is used to find limits of the form f ( x) lim where lim f x x! c g x ( ) = or lim f ( x) = limg( x) = ". ( ) x! c limg( x) = 0 x! c x! c

More information

1 Module for Year 10 Secondary School Student Logarithm

1 Module for Year 10 Secondary School Student Logarithm 1 Erthquke Intensity Mesurement (The Richter Scle) Dr Chrles Richter showed tht the lrger the energy of n erthquke hs, the lrger mplitude of ground motion t given distnce. The simple model of Richter

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils

More information

Reinforcement learning II

Reinforcement learning II CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic

More information

5.2 Exponent Properties Involving Quotients

5.2 Exponent Properties Involving Quotients 5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use

More information

Review of basic calculus

Review of basic calculus Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Applicable Analysis and Discrete Mathematics available online at

Applicable Analysis and Discrete Mathematics available online at Applicble Anlysis nd Discrete Mthemtics vilble online t http://pefmth.etf.rs Appl. Anl. Discrete Mth. 4 (2010), 23 31. doi:10.2298/aadm100201012k NUMERICAL ANALYSIS MEETS NUMBER THEORY: USING ROOTFINDING

More information

Estimation of Global Solar Radiation at Onitsha with Regression Analysis and Artificial Neural Network Models

Estimation of Global Solar Radiation at Onitsha with Regression Analysis and Artificial Neural Network Models eserch Journl of ecent Sciences ISSN 77-5 es.j.ecent Sci. Estimtion of Globl Solr dition t Onitsh with egression Anlysis nd Artificil Neurl Network Models Abstrct Agbo G.A., Ibeh G.F. *nd Ekpe J.E. Fculty

More information

Further integration. x n nx n 1 sinh x cosh x log x 1/x cosh x sinh x e x e x tan x sec 2 x sin x cos x tan 1 x 1/(1 + x 2 ) cos x sin x

Further integration. x n nx n 1 sinh x cosh x log x 1/x cosh x sinh x e x e x tan x sec 2 x sin x cos x tan 1 x 1/(1 + x 2 ) cos x sin x Further integrtion Stndrd derivtives nd integrls The following cn be thought of s list of derivtives or eqully (red bckwrds) s list of integrls. Mke sure you know them! There ren t very mny. f(x) f (x)

More information

A signalling model of school grades: centralized versus decentralized examinations

A signalling model of school grades: centralized versus decentralized examinations A signlling model of school grdes: centrlized versus decentrlized exmintions Mri De Pol nd Vincenzo Scopp Diprtimento di Economi e Sttistic, Università dell Clbri m.depol@unicl.it; v.scopp@unicl.it 1 The

More information

A New Grey-rough Set Model Based on Interval-Valued Grey Sets

A New Grey-rough Set Model Based on Interval-Valued Grey Sets Proceedings of the 009 IEEE Interntionl Conference on Systems Mn nd Cybernetics Sn ntonio TX US - October 009 New Grey-rough Set Model sed on Intervl-Vlued Grey Sets Wu Shunxing Deprtment of utomtion Ximen

More information

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ), 1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on

More information