CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING

Size: px
Start display at page:

Download "CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING"

Transcription

1 ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May 2006 CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING Sharaf Alkheder, Jun Wang and Jie Shan Geomaics Engineering, School of Civil Engineering, Purdue Universiy 550 Sadium Mall Drive, Wes Lafayee, IN-47907, U.S.A {salkhede, wang31, jshan}@ecn.purdue.edu Commission VII, WG VI/4 KEY WORDS: Urban Growh, Cellular Auomaa, Geneic Algorihm, Dynamic Sysem, Change Deecion ABSTRACT: This paper describes an on-going work on he developmen and implemenaion of cellular auomaa based urban growh modeling using muliemporal saellie imagery. The algorihm is designed o simulae he hisorical growh as a funcion of local neighbourhood srucure of he inpu daa. Transiion rules in he algorihm drive he urban growh over ime. Calibraion is inroduced in he cellular auomaa model. Spaial and emporal calibraion schemes are used o improve he predicion accuracy. Spaially, he model is calibraed on a ownship basis o ake ino accoun he effec of sie specific feaures, while he emporal calibraion is se up o adap he model o he changes in he growh paern over ime. Calibraion provides he opimal values for he ransiion rules o achieve accurae urban growh modeling. The paper discusses a he end a proposed auomaic rule calibraion mehod using geneic algorihm. The aim is o opimize he ransiion rule values. Predicion accuracy is seleced as he finess funcion. A se of srings are used as iniial populaion over which he geneic algorihm runs ill convergence. The cellular auomaa model is esed over ciy Indianapolis, IN, USA o model is urban growh over a period of 30 years. Besides he land use daa derived from he saellie imagery, populaion densiy is used. Resuls indicae good accuracy on a ownship basis for shor erm (5 years) and long erm (11 years) predicion. The model succeeds in adaping o he dynamic growh paern. Geneic algorihm shows promising poenial in he calibraion process. 1. INTRODUCTION Urban growh modeling is geing more aenion as an emerging research area in many disciplines. This comes as a resul of he recen dramaic increase in urban populaion ha increases he pressure on he infrasrucure services. Among all developed urban growh models, cellular auomaa (CA) urban growh models have beer performance in simulaing urban developmen han convenional mahemaical models (Bay and Xie, 1994a). CA simplifies he simulaion of complex sysems (Waldrop, 1992). Is appropriaeness in urban modeling is due o he fac ha he process of urban spread is enirely local in naure (Clarke and Gaydos, 1998). Models based on cellular auomaa are impressive in erms of heir echnological evoluion in connecion o urban applicaions (Yang and Lo, 2003). Developmen of a CA model involves rule definiion and calibraion o produce resuls consisen wih hisorical daa, and fuure predicion wih he same rules (Clarke e al, 1997). Many CA-based urban growh models are repored in he lieraures. Whie and Engelen (1992a; 1992b) CA model involves reducion of space ino square grids. They implemen he defined ransiion rules in recursive form o mach he spaial paern. One of he earlies and mos well-known models in he lieraure is Clarke s e al (1997) CA-based model SLEUTH ha has four major ypes of daa: land cover, slope, ransporaion, and proeced lands. This is rooed in he work of von Neumann (1966), Hagersrand (1967), Tobler (1979) and Wolfram (1994). A se of iniial condiions in SLEUTH is defined by `seed' cells which were deermined by locaing and daing he exen of various selemens idenified from hisorical maps, alases, and oher sources. These seed cells represen he iniial disribuion of urban areas. A se of complex behaviour rules is developed ha involves selecing a locaion randomly, invesigaing he spaial properies of he neighboring cells, and urbanizing he cell based on a se of probabiliies. Despie all he achievemens in CA urban growh modeling, he selecion of he CA ransiion rules remains a research opic (Bay, 1998). CA models are usually designed based on individual preference and applicaion requiremens wih ransiion rules being defined in an ad hoc manner (Li and Yeh, 2003). Furhermore, calibraion of CA models is sill a challenge. Mos of he developed CA models need inensive compuaion o selec he bes parameer values for accurae modeling. The moivaion behind his work is o develop an effecive CAbased urban growh model. Also, developing a calibraion algorihm ha akes ino consideraion spaial and emporal dynamics of urban growh is anoher objecive of his sudy. Geneic algorihm (GA) is inroduced as a heurisic opimizaion echnique for selecing opimal model parameers. 2. STUDY AREA Indianapolis, Indiana, USA is seleced as a case sudy over which he CA model is designed and esed. Indianapolis is locaed in Marion Couny a laiude 39 44' N and longiude of 86 17' W as shown in Figure 1. Represening he main ciy in he sae of Indiana, Indianapolis encouners recognizable acceleraed growh in populaion and urban infrasrucure over he las few decades. The necessiy arises o model he urban growh over ime for beer planning of infrasrucure services. 414

2 ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May 2006 Figure 3. Year 2000 census rac map and populaion densiy The Euclidean disance from each census rac cenroid o he ciy cener is compued. This process is repeaed for all racs so ha a able of populaion densiies versus disance is prepared. Populaion densiies for census racs wihin specified disance from ciy cener are averaged o reduce he variabiliy in daa. For example, an average populaion densiy for all census racs wihin 2 km is calculaed hen anoher average densiy is calculaed for racs wihin 2-4 km and so forh. An exponenial funcion is fied represening populaion densiy as a funcion of disance from he ciy cenre: B* DISTANCE POPULATION DENSITY = Ae (1) Figure 1. Ciy of Indianapolis, Indiana, USA (US Census Bureau) Model parameers A and B are calculaed for year 2000 as shown in Figure 4. This exponenial model is used o calculae he populaion densiy for each pixel in he imagery based on is disance form ciy cener for year DATA PREPARATION This secion describes he inpu daa processing scheme. Five hisorical TM images (1973, 1982, 1987, 1992 and 2003) are colleced over he sudy area (Figure 2). These images are recified and regisered o he same projecion of UTM NAD1983 o fi each oher spaially. Seven classes of ineres are idenified in he images: waer, road, commercial, fores area, residenial areas, pasure and row crops. Residenial and commercial classes represen urban class. The overall classificaion accuracy for all classified images is above 93%. Populaion densiy(1/km2) y = e x R 2 = Disance from ciy cener (KM) Figure 4. Year 2000 populaion densiy Figure 2. Hisorical TM images over Indianapolis Populaion densiy is used as anoher inpu for he CA model algorihm. Populaion census rac maps for year 1990 and 2000 over Indianapolis are colleced. The populaion densiies are compued for all census racs by dividing heir populaions by he rac areas. Figure 3 shows he census rac map (lef) and he calculaed populaion densiy for each census rac (righ). To model he populaion, he cenroid (Xc,Yc) for each census rac is calculaed. The same procedure is repeaed for year 1990 o find is exponenial populaion model wih A and B parameers. The change in model parameers over he 10 years (from 1990 o 2000) is used o calculae he yearly rae of change in A and B parameers. The updaed parameers (A and B values ha changed year by year) are used o calculae populaion densiy grids for each year from 1973 o 2003 maching he same size of he inpu imagery. These grids are used as CA daa inpus for he purpose of running he model over hisorical growh period. 4. CELLULAR AUTMATA URBAN MODELING This secion discusses in deail he design of he CA urban growh modeling. The design phases include: ransiion rule definiion, calibraion mehod and evaluaion sraegy for he model. Calibraion modules for accurae modeling over he hisorical saellie imagery o adap he urban paern are discussed in deails. 415

3 ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May CA Algorihm Design The design of he CA algorihm consiss of defining he ransiion rules ha conrol he urban growh, calibraing hese rules, and evaluaing he resuls for predicion purpose. Figure 5 presens a flowchar ha describes he CA algorihm srucure. CA ransiion rules driving he urban growh are programmed in ArcGIS hrough Visual Basic for Applicaions (VBA). The oldes hisorical classified TM image (1973) is used as inpu o he CA model over which he ransiion rules are applied o model he urban growh saring from his ime epoch. A polygon shapefile represening he ownships in he sudy area is overlaid over he inpu image (Figure 6). A oal of 24 ownships in he area are idenified. Figure 6. Township map of Indianapolis Figure 5. Flowchar of CA algorihm design Transiion rules definiion is he mos imporan phase in CA model design since hey ranslae he effec of inpu daa on he urban process simulaion. So an accurae and realisic definiion of he rules is needed. The CA algorihm design sars wih defining he ransiion rules ha drive he urban growh over ime. They are designed as a funcion of land use effec on urban process, growh consrains and populaion densiy. The ransiion rules are defined over he 3x3 neighbourhood of a pixel o minimize he number of inpu variables o he model. The rules idenify he neighbourhood needed for he esed cell o urbanize. The growh consrains should reflec he conservaion sraegy adoped in he sudy area for cerain land uses. For example, conservaion of cerain species of naural resources can be aken ino consideraion hrough rules definiion sage. Waer resources proecion hrough discouraging urban growh nearby hese sies o reserve hem over ime is anoher example of consrained rules design. The fuure sae of a pixel (Equaion 2) a ime (+1) from saring ime () depends on hree facors: - Curren sae of he es pixel. - Curren saes of is neighbourhood pixels - Transiion rules ha drive he urban growh over ime. +1 S ( ) = ( f S ( ), S ( ), ransiion _ rules) α α τ (2) where S +1 ( α ) = es pixel fuure sae a ime epoch +1. S ( α ) = es pixel curren sae a ime epoch. S ( τ ) = neighbourhood pixels saes se. Dividing he sudy area on a ownship basis will ake ino consideraion he effec of sie specific feaures in each ownship on he urban growh. The same CA ransiion rules are defined for each ownship, however, wih differen rule values. Calibraion in he nex secion will discuss finding he opimal rule values for each ownship. 4.2 CA Model Calibraion Once he CA ransiion rules are idenified and iniialized for each ownship, he model runs from 1973 ill The year 1982 image represens he firs ground ruh being used for calibraion. For each ownship, he modeling accuracy is calculaed as a raio beween he simulaed and real urban growh daa (Equaion 3) for simulaed 1982 image. Over/underesimaion concep is inroduced o represen how comparable is he simulaed resul o he real one. This indicaes how ransiion rules defined on a ownship basis succeed in modeling he real amoun of urban growh given he predefined condiions. Calibraion in his work is mean o find he bes se of rule values specific o each ownship for realisic urban growh modeling. Simulaed urban class Accurracy = 100% (3) real urban class Calibraion aims o define he bes se of CA rules based on which he model run o mach as close as possible he simulaed resuls wih he ground ruh images. To achieve his purpose, wo calibraion schemes are inroduced in his algorihm: spaial and emporal calibraions. In spaial calibraion module, he CA ransiion rules a a given ime (=1982 in our case) are 416

4 ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May 2006 modified spaially over he 2D grid space. This is done hrough uning he values of each rule se on a ownship basis o mach he urban dynamics for each ownship wih is sie specific feaures. This allows he model o ake he variabiliy in he spaial urban growh paern ino accouns for realisic modeling. If he ownship rules resul in higher growh levels (overesimaed), hey are modified o reduce he urban growh a his ownship. For he underesimaion case, he rule values of he ownship under consideraion are uned o increase he amoun of urban growh o mach he real one. So, he spaial calibraion aims o find he bes se of rule values ha fi a given ownship k according o is geographical locaion: X(k), inpu daa parameers: C(k) and is over/underesimaion case: OAE (k) as shown in Equaion 4. Townships close o each oher in erm of geographical locaion and having similar urban growh characerisics (e.g. same developmen level over ime) are associaed wih he same rule values. The overall calibraion over he enire es image a ime epoch is obained hrough performing he same spaial calibraion by aking he average of all ownships as shown in Equaion 5. Once he rule values are modified spaially, he model runs again from 1973 o 1982, he modeling accuracy is evaluaed for each ownship and rules are calibraed once again as illusraed above. This loop coninues ill he defined convergence crierion is me (Equaion 6). In our work convergence crierion of 100%±10% accuracy is used. The rule values afer convergence will be used for he nex ime period modeling. The model will be calibraed a he nex ground ruh image o ake ino consideraion he emporal effec. where SC epoch, = f ( X ( k), C( k), OAE( k)) (4) 24 epoch, = epoch, l= 1 OC SC ( l) FC { Converge( Loop( OCepoch ) } epoch,, (5) = (6) SC = spaial calibraion a ime epoch. epoch, OC = over all calibraion a ime epoch. epoch, FC = final calibraion a ime epoch. epoch, The final calibraed rules a 1982 are used o run he model ill he nex ground ruh image 1987 o perform emporal calibraion. The goal behind he emporal calibraion is o recalibrae he model so ha he model can adap he urban growh paern over ime (Equaion 7). This way any growh variaion over ime relaed o new policy or new infrasrucure plans can be learned by he model and he modeling resuls become more realisic. The emporal calibraion module is a funcion of changes in spaial calibraion resuls beween wo epochs and +1, growh change, and accuracy. TC = (,, ) (, 1) f FC + (, + 1) UG Accuracy where (7) TC = emporal calibraion beween epochs (, + 1) and +1. FC = changes in spaial calibraion resuls (, + 1) beween epochs and +1. UG = urban growh change beween and +1. The same spaial calibraion process a 1982 is repeaed a 1987 ground ruh ill convergence. The final calibraed rule values a 1987 are used o predic he urban growh a 1992 for shor erm predicion of 5 years (Figure 7a). The firs es image a 1992 is used o validae he model hrough evaluaing he predicion resuls a 1992 on a ownship basis. Table 1 summarizes he predicion resuls accuracies for year The rules are calibraed spaially again a 1992 o perform long erm predicion of 11 years from 1992 ill 2003 (Figure 7b) ha are validaed using he es image a Table 1 shows he predicion accuracy for prediced image a Resuls and Discussion The predicion resuls of 1992 and 2003 show good accuracy on he ownship basis and on he average scale. Accuracy for shor erm predicion (1992) is higher as comparing wih long erm predicion inerval (2003). The improvemen in he accuracy over space for each ownship is noiceable as a resul of he spaial calibraion module. Temporal calibraion also helps improve he predicion accuracy resuls over ime. The spaial calibraion a specific ime epoch succeeds in reducing he variabiliy in modeling accuracy beween ownships hrough maching each ownship ransiion rules wih is sie specific feaures. Spaial and emporal calibraions succeed in capuring he urban growh paern over space and ime based on real growh facors. Hisorical saellie imagery fis he spaial and emporal naure of he developed CA urban growh model. I provides imporan informaion inpu o he model. 4.4 Evaluaion and Analysis Predicion accuracy for each ownship is used as a basis for rule calibraion. Over/under esimaion principle is implemened. If a se of rules for a paricular ownship produces underesimaed resuls, his mean he growh rae is small and hence he rules are modified o increase he urban growh. For overesimaion, he rules are modified o reduce he urban growh amoun. The ransiion rules for a ownship are repeaedly calibraed ill he convergence crierion is me. The ground ruh imagery provides he reference for calibraion process. Table 1 resuls indicae good spaial predicion accuracy ranging for year 1992 beween 78.32% (underesimae) for ownship 17 up o % (overesimae) for ownship 1. The range for year 2003 is beween 67.78% and %. The average accuracies for 1992 and 2003 are 98.35% and 94.57%, respecively. Higher accuracies achieved for shor erm predicion (1992) as compared o long erm (2003). The spaial variabiliy beween ownships predicion resuls afer calibraion is small for boh (1992 and 2003) predicions. This indicaes he effec of spaial calibraion in maching each ownship wih is realisic urban growh paern hrough calibraing is rules o fi such paern. Visually, calibraion on a ownship basis succeeds in preserving he urban paern over space where emporal calibraion preserves is dynamical changes over ime. Rule values resuls a he end of he calibraion process indicae some similariy beween ownships. These ownships are close o each oher geographically and wih similar urban growh characerisics. 5. TRANSITION RULE CALIBRATION This secion inroduces briefly an ongoing sudy on using geneics algorihm (GA) o auomae he spaial and emporal rule calibraions. GA as a heurisic opimizaion echnique can work over he search space o find he mos suiable soluion. GA improves he efficiency of rule calibraion o selec he bes se of rule values for accurae modeling. GA is firs inroduced by Holland (1975) as compuer programs o mimic he evoluionary processes in naure. GA manipulaes a se of feasible soluions o find an opimal soluion. 417

5 ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May 2006 Table 1. Year 1992 and 2003 predicion resuls Township# Accuracy(%), Accuracy(%), a. Resul of year 1992 predicion (5 years) Average Sd. Dev Sep 3: GA selecion operaion Rank selecion procedure is used in his work. All he srings are ordered based on heir finess values in descending order and he sring wih highes finess value is given rank 30 hen he second one 29 ill lowes finess value wih rank 1. Rank is divided by he summaion of all he ranks and he probabiliy of selecion for each sring in nex generaion is idenified. b. Resul of year 2003 predicion (11 years) Figure 7. Cellular auomaa predicion resuls Sep 4: GA crossover and muaion parameers design The crossover probabiliy is seleced o be 80%, 24 srings are seleced for crossover, while he oher 6 (he bes 6 in erms of finess values) are copied direcly o he new generaion (his process is known in GA as Eliism). Eliism can rapidly increase he performance of GA, because i prevens a loss of he bes soluion. A muaion rae of 1% is used. Once he crossover and muaion is done, he new generaion of 30 srings is already produced. The nex sep is o run he CA model using he new srings o evaluae heir new finess values. GA s is able o find he global opimum soluion. The following seps describe he design of he proposed GA-based ransiion rule calibraion. Sep 1: Iniial GA populaion generaion In his sep, 30 ses of rule values are randomly generaed as an iniial populaion for each ownship over which GA module will work. Each rule value se is coded as a binary sring. A sring is designed as a combinaion of he rule values. Three rules are idenified o be opimized using GA: Sep 5: Running he GA-CA model All he seps from 1 o 4 are repeaed ill convergence. GA model works again over he newly creaed 30 srings and a new generaion of 30 srings is produced and he loop coninues. This coninues unil he convergence crierion is me. The final oupu is he opimized CA rule values for each ownship ha model he emporal urban growh. The model is run over he images from 1973 ill 1982 o calibrae is ransiion rules. The final resuls (Figure 8 and Table 2) indicae saisfacory resuls as compared o he crisp CA mehod. Rule1: The number of neighbourhood residenial pixels, in he possible range of [0-8] ineger values or in corresponding binary coding [0000 o 1000]. Rule2: The number of neighbourhood commercial pixels, in he possible range of [0-8] ineger values or in corresponding binary coding [0000 o 1000]. Rule3: The populaion densiy hreshold, coninuous values represening he cu-off of populaion densiy a a pixel. This rule is scaled by muliplying is value by 10 in he range of [020] possible values or in binary coding [00000 o 10100]. All he rules are combined o form one binary sring. 6. CONCLUDING REMARKS This work explores he poenial of implemening he cellular auomaa o model he hisorical urban growh over Indianapolis. The main goal is o design he model as a funcion Sep 2: Finess funcion idenificaion Finess funcion evaluaes he performance of each sring. The predicion accuracy is used as he finess funcion. 418

6 ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May 2006 of local neighbourhood srucure o minimize he inpu daa o he model. Saellie imagery represens he medium over which he model works. One imporan issue our model akes ino accoun is he calibraion process. Two modules are inroduced namely, spaial and emporal calibraions. Spaial calibraion fis he model on a ownship basis o is sie specific feaure while he emporal calibraion adaps i o he urban growh dynamic change over ime. This shows a noiceable effec on producing a good spaial mach beween he real and simulaed image daa. On he oher hand, geneic algorihm is inroduced o enhance he CA calibraion process. GA makes he calibraion process more efficien hrough manipulaing a se of feasible soluions in he search space o find an opimal soluion. This will reduce he search space for he opimal rules values on a ownship basis. REFERENCES Bay, M., and Xie, Y., 1994a. From cells o ciies. Environmen and Planning, B21, pp Bay, M., Urban evoluion on he deskop: simulaion wih he use of exended cellular auomaa. Environmen and Planning A, 30, pp Clarke, K. C., Hoppen, S., and Gaydos, L., A selfmodifying cellular auomaon model of hisorical urbanizaion in he San Francisco Bay area. Environmen and planning B, 24, pp Clarke, K. C., and Gaydos, L. J., Loose-coupling a cellular auomaon model and GIS: long-erm urban growh predicion for San Francisco and Washingon/Balimore. Inernaional Journal of Geographical Informaion Sciences, 12, pp Hagersrand, T., Innovaion Diffusion as a Spaial Process (Universiy of Chicago Press, Chicago, IL). Holland, J.H., Adapaion in Naural and Arificial Sysems, Univ. of Michigan Press, Ann Arbor, MI. Li, X., and Yeh, A. G. O., Error propagaion and model uncerainies of cellular auomaa in urban simulaion wih GIS. In: 7h Inernaional Conference on GeoCompuaion, 8-10 Sepember 2003, Universiy of Souhampon, Souhampon, UK (GeoCompuaion CD-ROM). Figure 8. GA-CA calibraed image for year 1982 Table 2. GA-CA calibraed resuls for year 1982 Township# Urban Pixel # Accuracy(%) % % % % % % % % % % % % % % % % % % % % % % % % Average 87.63% Sd. Dev 13.73% Tobler, W., Cellular geography, in Philosophy. In: Geography Eds S Gale, G Olsson (D Reidel, Dordrech), pp von Neumann, J., Theory of Self-Reproducing Auomaa. Universiy of Illinois Press, Illinois. Edied and compleed by A. W. Burks. Waldrop, M., Complexiy: The Emerging Science a he Edge of Order and Chaos (New York: Simon and Schuser). Wolfram, S., Cellular auomaa. In: Cellular Auomaa and Complexiy: Colleced Papers (Addison Wesley, Seven Wolfram, Reading, MA). Yang, X., and Lo, C. P., Modelling urban growh and landscape changes in he Alana meropolian area. Inernaional Journal of Geographical Informaion Science, 17, pp

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology

More information

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy

More information

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,

More information

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he

More information

Particle Swarm Optimization

Particle Swarm Optimization Paricle Swarm Opimizaion Speaker: Jeng-Shyang Pan Deparmen of Elecronic Engineering, Kaohsiung Universiy of Applied Science, Taiwan Email: jspan@cc.kuas.edu.w 7/26/2004 ppso 1 Wha is he Paricle Swarm Opimizaion

More information

AN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION

AN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION The Inernaional Archives of he Phoogrammery, Remoe Sensing and Spaial Informaion Sciences, Vol. 38, Par II AN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION

More information

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS 1 MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS INTRODUCTION Mos real world opimizaion problems involve complexiies like discree, coninuous or mixed variables, muliple conflicing objecives, non-lineariy,

More information

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid

More information

Shiva Akhtarian MSc Student, Department of Computer Engineering and Information Technology, Payame Noor University, Iran

Shiva Akhtarian MSc Student, Department of Computer Engineering and Information Technology, Payame Noor University, Iran Curren Trends in Technology and Science ISSN : 79-055 8hSASTech 04 Symposium on Advances in Science & Technology-Commission-IV Mashhad, Iran A New for Sofware Reliabiliy Evaluaion Based on NHPP wih Imperfec

More information

Single-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems

Single-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems Single-Pass-Based Heurisic Algorihms for Group Flexible Flow-shop Scheduling Problems PEI-YING HUANG, TZUNG-PEI HONG 2 and CHENG-YAN KAO, 3 Deparmen of Compuer Science and Informaion Engineering Naional

More information

20. Applications of the Genetic-Drift Model

20. Applications of the Genetic-Drift Model 0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0

More information

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous

More information

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Space

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Space Inernaional Journal of Indusrial and Manufacuring Engineering Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Space Vichai Rungreunganaun and Chirawa Woarawichai

More information

Recent Developments In Evolutionary Data Assimilation And Model Uncertainty Estimation For Hydrologic Forecasting Hamid Moradkhani

Recent Developments In Evolutionary Data Assimilation And Model Uncertainty Estimation For Hydrologic Forecasting Hamid Moradkhani Feb 6-8, 208 Recen Developmens In Evoluionary Daa Assimilaion And Model Uncerainy Esimaion For Hydrologic Forecasing Hamid Moradkhani Cener for Complex Hydrosysems Research Deparmen of Civil, Consrucion

More information

Object tracking: Using HMMs to estimate the geographical location of fish

Object tracking: Using HMMs to estimate the geographical location of fish Objec racking: Using HMMs o esimae he geographical locaion of fish 02433 - Hidden Markov Models Marin Wæver Pedersen, Henrik Madsen Course week 13 MWP, compiled June 8, 2011 Objecive: Locae fish from agging

More information

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix

More information

STATE-SPACE MODELLING. A mass balance across the tank gives:

STATE-SPACE MODELLING. A mass balance across the tank gives: B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing

More information

10. State Space Methods

10. State Space Methods . Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he

More information

Air Quality Index Prediction Using Error Back Propagation Algorithm and Improved Particle Swarm Optimization

Air Quality Index Prediction Using Error Back Propagation Algorithm and Improved Particle Swarm Optimization Air Qualiy Index Predicion Using Error Back Propagaion Algorihm and Improved Paricle Swarm Opimizaion Jia Xu ( ) and Lang Pei College of Compuer Science, Wuhan Qinchuan Universiy, Wuhan, China 461406563@qq.com

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION SUPPLEMENTARY INFORMATION DOI: 0.038/NCLIMATE893 Temporal resoluion and DICE * Supplemenal Informaion Alex L. Maren and Sephen C. Newbold Naional Cener for Environmenal Economics, US Environmenal Proecion

More information

RC, RL and RLC circuits

RC, RL and RLC circuits Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

Lab 10: RC, RL, and RLC Circuits

Lab 10: RC, RL, and RLC Circuits Lab 10: RC, RL, and RLC Circuis In his experimen, we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors. We will sudy he way volages and currens change in

More information

Content-Based Shape Retrieval Using Different Shape Descriptors: A Comparative Study Dengsheng Zhang and Guojun Lu

Content-Based Shape Retrieval Using Different Shape Descriptors: A Comparative Study Dengsheng Zhang and Guojun Lu Conen-Based Shape Rerieval Using Differen Shape Descripors: A Comparaive Sudy Dengsheng Zhang and Guojun Lu Gippsland School of Compuing and Informaion Technology Monash Universiy Churchill, Vicoria 3842

More information

) were both constant and we brought them from under the integral.

) were both constant and we brought them from under the integral. YIELD-PER-RECRUIT (coninued The yield-per-recrui model applies o a cohor, bu we saw in he Age Disribuions lecure ha he properies of a cohor do no apply in general o a collecion of cohors, which is wha

More information

The average rate of change between two points on a function is d t

The average rate of change between two points on a function is d t SM Dae: Secion: Objecive: The average rae of change beween wo poins on a funcion is d. For example, if he funcion ( ) represens he disance in miles ha a car has raveled afer hours, hen finding he slope

More information

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED 0.1 MAXIMUM LIKELIHOOD ESTIMATIO EXPLAIED Maximum likelihood esimaion is a bes-fi saisical mehod for he esimaion of he values of he parameers of a sysem, based on a se of observaions of a random variable

More information

A Framework for Efficient Document Ranking Using Order and Non Order Based Fitness Function

A Framework for Efficient Document Ranking Using Order and Non Order Based Fitness Function A Framework for Efficien Documen Ranking Using Order and Non Order Based Finess Funcion Hazra Imran, Adii Sharan Absrac One cenral problem of informaion rerieval is o deermine he relevance of documens

More information

A car following model for traffic flow simulation

A car following model for traffic flow simulation Inernaional Journal of Applied Mahemaical Sciences ISSN 0973-076 Volume 9, Number (206), pp. -9 Research India Publicaions hp://www.ripublicaion.com A car following model for raffic flow simulaion Doudou

More information

An introduction to the theory of SDDP algorithm

An introduction to the theory of SDDP algorithm An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking

More information

Article from. Predictive Analytics and Futurism. July 2016 Issue 13

Article from. Predictive Analytics and Futurism. July 2016 Issue 13 Aricle from Predicive Analyics and Fuurism July 6 Issue An Inroducion o Incremenal Learning By Qiang Wu and Dave Snell Machine learning provides useful ools for predicive analyics The ypical machine learning

More information

Online Appendix to Solution Methods for Models with Rare Disasters

Online Appendix to Solution Methods for Models with Rare Disasters Online Appendix o Soluion Mehods for Models wih Rare Disasers Jesús Fernández-Villaverde and Oren Levinal In his Online Appendix, we presen he Euler condiions of he model, we develop he pricing Calvo block,

More information

6.2 Transforms of Derivatives and Integrals.

6.2 Transforms of Derivatives and Integrals. SEC. 6.2 Transforms of Derivaives and Inegrals. ODEs 2 3 33 39 23. Change of scale. If l( f ()) F(s) and c is any 33 45 APPLICATION OF s-shifting posiive consan, show ha l( f (c)) F(s>c)>c (Hin: In Probs.

More information

A Hop Constrained Min-Sum Arborescence with Outage Costs

A Hop Constrained Min-Sum Arborescence with Outage Costs A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN 56001 Email: Kawara@mnsu.edu Absrac The hop consrained min-sum arborescence wih ouage coss problem

More information

Sub Module 2.6. Measurement of transient temperature

Sub Module 2.6. Measurement of transient temperature Mechanical Measuremens Prof. S.P.Venkaeshan Sub Module 2.6 Measuremen of ransien emperaure Many processes of engineering relevance involve variaions wih respec o ime. The sysem properies like emperaure,

More information

Structural Break Detection in Time Series Models

Structural Break Detection in Time Series Models Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by an IBM faculy

More information

Kriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds

Kriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Kriging Models Predicing Arazine Concenraions in Surface Waer Draining Agriculural Waersheds Paul L. Mosquin, Jeremy Aldworh, Wenlin Chen Supplemenal Maerial Number

More information

Structural Break Detection in Time Series Models

Structural Break Detection in Time Series Models Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by: Naional

More information

Scheduling of Crude Oil Movements at Refinery Front-end

Scheduling of Crude Oil Movements at Refinery Front-end Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,

More information

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),

More information

Analytical Solutions of an Economic Model by the Homotopy Analysis Method

Analytical Solutions of an Economic Model by the Homotopy Analysis Method Applied Mahemaical Sciences, Vol., 26, no. 5, 2483-249 HIKARI Ld, www.m-hikari.com hp://dx.doi.org/.2988/ams.26.6688 Analyical Soluions of an Economic Model by he Homoopy Analysis Mehod Jorge Duare ISEL-Engineering

More information

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon 3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of

More information

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3 and d = c b - b c c d = c b - b c c This process is coninued unil he nh row has been compleed. The complee array of coefficiens is riangular. Noe ha in developing he array an enire row may be divided or

More information

Air Traffic Forecast Empirical Research Based on the MCMC Method

Air Traffic Forecast Empirical Research Based on the MCMC Method Compuer and Informaion Science; Vol. 5, No. 5; 0 ISSN 93-8989 E-ISSN 93-8997 Published by Canadian Cener of Science and Educaion Air Traffic Forecas Empirical Research Based on he MCMC Mehod Jian-bo Wang,

More information

( ) ( ) ( ) + W aa. ( t) n t ( ) ( )

( ) ( ) ( ) + W aa. ( t) n t ( ) ( ) Supplemenary maerial o: Princeon Universiy Press, all righs reserved From: Chaper 3: Deriving Classic Models in Ecology and Evoluionary Biology A Biologis s Guide o Mahemaical Modeling in Ecology and Evoluion

More information

Tracking. Announcements

Tracking. Announcements Tracking Tuesday, Nov 24 Krisen Grauman UT Ausin Announcemens Pse 5 ou onigh, due 12/4 Shorer assignmen Auo exension il 12/8 I will no hold office hours omorrow 5 6 pm due o Thanksgiving 1 Las ime: Moion

More information

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance

More information

Notes on Kalman Filtering

Notes on Kalman Filtering Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren

More information

Developing a Cellular Automaton Model of Urban Growth Incorporating Fuzzy Set Approaches

Developing a Cellular Automaton Model of Urban Growth Incorporating Fuzzy Set Approaches Developing a Cellular Auomaon Model of Urban Growh Incorporaing Fuzzy Se Approaches Yan Liu Faculy of Engineering and Surveying, The Universiy of Souhern Queensland yanliu@usq.edu.au Suar R. Phinn School

More information

Numerical Dispersion

Numerical Dispersion eview of Linear Numerical Sabiliy Numerical Dispersion n he previous lecure, we considered he linear numerical sabiliy of boh advecion and diffusion erms when approimaed wih several spaial and emporal

More information

A Genetic Algorithm Solution to the Unit Commitment Problem Based on Real-Coded Chromosomes and Fuzzy Optimization

A Genetic Algorithm Solution to the Unit Commitment Problem Based on Real-Coded Chromosomes and Fuzzy Optimization A Geneic Algorihm Soluion o he Uni Commimen Problem Based on Real-Coded Chromosomes and Fuzzy Opimizaion Alma Ademovic #1, Smajo Bisanovic #, Mensur Hajro #3 Faculy for Elecrical Engineering Universiy

More information

Module 2 F c i k c s la l w a s o s f dif di fusi s o i n

Module 2 F c i k c s la l w a s o s f dif di fusi s o i n Module Fick s laws of diffusion Fick s laws of diffusion and hin film soluion Adolf Fick (1855) proposed: d J α d d d J (mole/m s) flu (m /s) diffusion coefficien and (mole/m 3 ) concenraion of ions, aoms

More information

Inventory Control of Perishable Items in a Two-Echelon Supply Chain

Inventory Control of Perishable Items in a Two-Echelon Supply Chain Journal of Indusrial Engineering, Universiy of ehran, Special Issue,, PP. 69-77 69 Invenory Conrol of Perishable Iems in a wo-echelon Supply Chain Fariborz Jolai *, Elmira Gheisariha and Farnaz Nojavan

More information

Modeling the Dynamics of an Ice Tank Carriage

Modeling the Dynamics of an Ice Tank Carriage Modeling he Dynamics of an Ice Tank Carriage The challenge: To model he dynamics of an Ice Tank Carriage and idenify a mechanism o alleviae he backlash inheren in he design of he gearbox. Maplesof, a division

More information

On-line Adaptive Optimal Timing Control of Switched Systems

On-line Adaptive Optimal Timing Control of Switched Systems On-line Adapive Opimal Timing Conrol of Swiched Sysems X.C. Ding, Y. Wardi and M. Egersed Absrac In his paper we consider he problem of opimizing over he swiching imes for a muli-modal dynamic sysem when

More information

The equation to any straight line can be expressed in the form:

The equation to any straight line can be expressed in the form: Sring Graphs Par 1 Answers 1 TI-Nspire Invesigaion Suden min Aims Deermine a series of equaions of sraigh lines o form a paern similar o ha formed by he cables on he Jerusalem Chords Bridge. Deermine he

More information

EECS 141: FALL 00 MIDTERM 2

EECS 141: FALL 00 MIDTERM 2 Universiy of California College of Engineering Deparmen of Elecrical Engineering and Compuer Science J. M. Rabaey TuTh9:30-11am ee141@eecs EECS 141: FALL 00 MIDTERM 2 For all problems, you can assume he

More information

Analyze patterns and relationships. 3. Generate two numerical patterns using AC

Analyze patterns and relationships. 3. Generate two numerical patterns using AC envision ah 2.0 5h Grade ah Curriculum Quarer 1 Quarer 2 Quarer 3 Quarer 4 andards: =ajor =upporing =Addiional Firs 30 Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 andards: Operaions and Algebraic Thinking

More information

The Production-Distribution Problem in the Supply Chain Network using Genetic Algorithm

The Production-Distribution Problem in the Supply Chain Network using Genetic Algorithm Inernaional Journal o Applied Engineering Research ISSN 0973-4562 Volume 12, Number 23 (2017) pp. 13570-13581 Research India Publicaions. hp://www.ripublicaion.com The Producion-Disribuion Problem in he

More information

3.1 More on model selection

3.1 More on model selection 3. More on Model selecion 3. Comparing models AIC, BIC, Adjused R squared. 3. Over Fiing problem. 3.3 Sample spliing. 3. More on model selecion crieria Ofen afer model fiing you are lef wih a handful of

More information

5.2. The Natural Logarithm. Solution

5.2. The Natural Logarithm. Solution 5.2 The Naural Logarihm The number e is an irraional number, similar in naure o π. Is non-erminaing, non-repeaing value is e 2.718 281 828 59. Like π, e also occurs frequenly in naural phenomena. In fac,

More information

Appendix to Creating Work Breaks From Available Idleness

Appendix to Creating Work Breaks From Available Idleness Appendix o Creaing Work Breaks From Available Idleness Xu Sun and Ward Whi Deparmen of Indusrial Engineering and Operaions Research, Columbia Universiy, New York, NY, 127; {xs2235,ww24}@columbia.edu Sepember

More information

Chapter 2. First Order Scalar Equations

Chapter 2. First Order Scalar Equations Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.

More information

Testing for a Single Factor Model in the Multivariate State Space Framework

Testing for a Single Factor Model in the Multivariate State Space Framework esing for a Single Facor Model in he Mulivariae Sae Space Framework Chen C.-Y. M. Chiba and M. Kobayashi Inernaional Graduae School of Social Sciences Yokohama Naional Universiy Japan Faculy of Economics

More information

Task-based Configuration Optimization of Modular and Reconfigurable Robots using a Multi-solution Inverse Kinematics Solver

Task-based Configuration Optimization of Modular and Reconfigurable Robots using a Multi-solution Inverse Kinematics Solver CARV 2007 Task-based Configuraion Opimizaion of Modular and Reconfigurable Robos using a Muli-soluion Inverse Kinemaics Solver S. Tabandeh 1, C. Clark 2, W. Melek 3 Absrac: Modular and Reconfigurable Robos

More information

Planning in POMDPs. Dominik Schoenberger Abstract

Planning in POMDPs. Dominik Schoenberger Abstract Planning in POMDPs Dominik Schoenberger d.schoenberger@sud.u-darmsad.de Absrac This documen briefly explains wha a Parially Observable Markov Decision Process is. Furhermore i inroduces he differen approaches

More information

On Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature

On Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature On Measuring Pro-Poor Growh 1. On Various Ways of Measuring Pro-Poor Growh: A Shor eview of he Lieraure During he pas en years or so here have been various suggesions concerning he way one should check

More information

Structural Break Detection in Time Series Models

Structural Break Detection in Time Series Models Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by an IBM faculy

More information

Some Basic Information about M-S-D Systems

Some Basic Information about M-S-D Systems Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,

More information

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017 Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and

More information

Random Walk with Anti-Correlated Steps

Random Walk with Anti-Correlated Steps Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and

More information

CHAPTER 12 DIRECT CURRENT CIRCUITS

CHAPTER 12 DIRECT CURRENT CIRCUITS CHAPTER 12 DIRECT CURRENT CIUITS DIRECT CURRENT CIUITS 257 12.1 RESISTORS IN SERIES AND IN PARALLEL When wo resisors are conneced ogeher as shown in Figure 12.1 we said ha hey are conneced in series. As

More information

Retrieval Models. Boolean and Vector Space Retrieval Models. Common Preprocessing Steps. Boolean Model. Boolean Retrieval Model

Retrieval Models. Boolean and Vector Space Retrieval Models. Common Preprocessing Steps. Boolean Model. Boolean Retrieval Model 1 Boolean and Vecor Space Rerieval Models Many slides in his secion are adaped from Prof. Joydeep Ghosh (UT ECE) who in urn adaped hem from Prof. Dik Lee (Univ. of Science and Tech, Hong Kong) Rerieval

More information

Learning Objectives: Practice designing and simulating digital circuits including flip flops Experience state machine design procedure

Learning Objectives: Practice designing and simulating digital circuits including flip flops Experience state machine design procedure Lab 4: Synchronous Sae Machine Design Summary: Design and implemen synchronous sae machine circuis and es hem wih simulaions in Cadence Viruoso. Learning Objecives: Pracice designing and simulaing digial

More information

Robust estimation based on the first- and third-moment restrictions of the power transformation model

Robust estimation based on the first- and third-moment restrictions of the power transformation model h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,

More information

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2 Daa-driven modelling. Par. Daa-driven Arificial di Neural modelling. Newors Par Dimiri Solomaine Arificial neural newors D.P. Solomaine. Daa-driven modelling par. 1 Arificial neural newors ANN: main pes

More information

An recursive analytical technique to estimate time dependent physical parameters in the presence of noise processes

An recursive analytical technique to estimate time dependent physical parameters in the presence of noise processes WHAT IS A KALMAN FILTER An recursive analyical echnique o esimae ime dependen physical parameers in he presence of noise processes Example of a ime and frequency applicaion: Offse beween wo clocks PREDICTORS,

More information

Class Meeting # 10: Introduction to the Wave Equation

Class Meeting # 10: Introduction to the Wave Equation MATH 8.5 COURSE NOTES - CLASS MEETING # 0 8.5 Inroducion o PDEs, Fall 0 Professor: Jared Speck Class Meeing # 0: Inroducion o he Wave Equaion. Wha is he wave equaion? The sandard wave equaion for a funcion

More information

Recursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems

Recursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems 8 Froniers in Signal Processing, Vol. 1, No. 1, July 217 hps://dx.doi.org/1.2266/fsp.217.112 Recursive Leas-Squares Fixed-Inerval Smooher Using Covariance Informaion based on Innovaion Approach in Linear

More information

Keywords Digital Infinite-Impulse Response (IIR) filter, Digital Finite-Impulse Response (FIR) filter, DE, exploratory move

Keywords Digital Infinite-Impulse Response (IIR) filter, Digital Finite-Impulse Response (FIR) filter, DE, exploratory move Volume 5, Issue 7, July 2015 ISSN: 2277 128X Inernaional Journal of Advanced Research in Compuer Science and Sofware Engineering Research Paper Available online a: www.ijarcsse.com A Hybrid Differenial

More information

A Local Regret in Nonconvex Online Learning

A Local Regret in Nonconvex Online Learning Sergul Aydore Lee Dicker Dean Foser Absrac We consider an online learning process o forecas a sequence of oucomes for nonconvex models. A ypical measure o evaluae online learning policies is regre bu such

More information

Navneet Saini, Mayank Goyal, Vishal Bansal (2013); Term Project AML310; Indian Institute of Technology Delhi

Navneet Saini, Mayank Goyal, Vishal Bansal (2013); Term Project AML310; Indian Institute of Technology Delhi Creep in Viscoelasic Subsances Numerical mehods o calculae he coefficiens of he Prony equaion using creep es daa and Herediary Inegrals Mehod Navnee Saini, Mayank Goyal, Vishal Bansal (23); Term Projec

More information

Authors. Introduction. Introduction

Authors. Introduction. Introduction Auhors Hidden Applied in Agriculural Crops Classificaion Caholic Universiy of Rio de Janeiro (PUC-Rio Paula B. C. Leie Raul Q. Feiosa Gilson A. O. P. Cosa Hidden Applied in Agriculural Crops Classificaion

More information

Ordinary Differential Equations

Ordinary Differential Equations Lecure 22 Ordinary Differenial Equaions Course Coordinaor: Dr. Suresh A. Karha, Associae Professor, Deparmen of Civil Engineering, IIT Guwahai. In naure, mos of he phenomena ha can be mahemaically described

More information

Speaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis

Speaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis Speaker Adapaion Techniques For Coninuous Speech Using Medium and Small Adapaion Daa Ses Consaninos Boulis Ouline of he Presenaion Inroducion o he speaker adapaion problem Maximum Likelihood Sochasic Transformaions

More information

5.1 - Logarithms and Their Properties

5.1 - Logarithms and Their Properties Chaper 5 Logarihmic Funcions 5.1 - Logarihms and Their Properies Suppose ha a populaion grows according o he formula P 10, where P is he colony size a ime, in hours. When will he populaion be 2500? We

More information

A Global Convergence Proof for a Class of Genetic Algorithms

A Global Convergence Proof for a Class of Genetic Algorithms A Global Convergence Proof for a Class of Geneic Algorihms Richard F. Harl * Absrac: In his paper a varian of a geneic algorihm is invesigaed which combines he advanages of geneic algorihms and of simulaed

More information

Section 4.4 Logarithmic Properties

Section 4.4 Logarithmic Properties Secion. Logarihmic Properies 5 Secion. Logarihmic Properies In he previous secion, we derived wo imporan properies of arihms, which allowed us o solve some asic eponenial and arihmic equaions. Properies

More information

The field of mathematics has made tremendous impact on the study of

The field of mathematics has made tremendous impact on the study of A Populaion Firing Rae Model of Reverberaory Aciviy in Neuronal Neworks Zofia Koscielniak Carnegie Mellon Universiy Menor: Dr. G. Bard Ermenrou Universiy of Pisburgh Inroducion: The field of mahemaics

More information

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important on-parameric echniques Insance Based Learning AKA: neares neighbor mehods, non-parameric, lazy, memorybased, or case-based learning Copyrigh 2005 by David Helmbold 1 Do no fi a model (as do LDA, logisic

More information

Removing Useless Productions of a Context Free Grammar through Petri Net

Removing Useless Productions of a Context Free Grammar through Petri Net Journal of Compuer Science 3 (7): 494-498, 2007 ISSN 1549-3636 2007 Science Publicaions Removing Useless Producions of a Conex Free Grammar hrough Peri Ne Mansoor Al-A'ali and Ali A Khan Deparmen of Compuer

More information

Ensemble Confidence Estimates Posterior Probability

Ensemble Confidence Estimates Posterior Probability Ensemble Esimaes Poserior Probabiliy Michael Muhlbaier, Aposolos Topalis, and Robi Polikar Rowan Universiy, Elecrical and Compuer Engineering, Mullica Hill Rd., Glassboro, NJ 88, USA {muhlba6, opali5}@sudens.rowan.edu

More information

Stability and Bifurcation in a Neural Network Model with Two Delays

Stability and Bifurcation in a Neural Network Model with Two Delays Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy

More information

Section 4.4 Logarithmic Properties

Section 4.4 Logarithmic Properties Secion. Logarihmic Properies 59 Secion. Logarihmic Properies In he previous secion, we derived wo imporan properies of arihms, which allowed us o solve some asic eponenial and arihmic equaions. Properies

More information

Block Diagram of a DCS in 411

Block Diagram of a DCS in 411 Informaion source Forma A/D From oher sources Pulse modu. Muliplex Bandpass modu. X M h: channel impulse response m i g i s i Digial inpu Digial oupu iming and synchronizaion Digial baseband/ bandpass

More information

A Reinforcement Learning Approach for Collaborative Filtering

A Reinforcement Learning Approach for Collaborative Filtering A Reinforcemen Learning Approach for Collaboraive Filering Jungkyu Lee, Byonghwa Oh 2, Jihoon Yang 2, and Sungyong Park 2 Cyram Inc, Seoul, Korea jklee@cyram.com 2 Sogang Universiy, Seoul, Korea {mrfive,yangjh,parksy}@sogang.ac.kr

More information

Stable block Toeplitz matrix for the processing of multichannel seismic data

Stable block Toeplitz matrix for the processing of multichannel seismic data Indian Journal of Marine Sciences Vol. 33(3), Sepember 2004, pp. 215-219 Sable block Toepliz marix for he processing of mulichannel seismic daa Kiri Srivasava* & V P Dimri Naional Geophysical Research

More information

Structural Break Detection for a Class of Nonlinear Time Series Models

Structural Break Detection for a Class of Nonlinear Time Series Models Srucural Break Deecion for a Class of Nonlinear Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored

More information