Fuzzy cellular model of signal controlled traffic stream

Size: px
Start display at page:

Download "Fuzzy cellular model of signal controlled traffic stream"

Transcription

1 Fuzzy cellular model of sgnal conrolled raffc sream Barłomej Płaczek Faculy of Transpor, Slesan Unversy of Technology, Krasńskego 8, Kaowce, Poland Absrac: Mcroscopc raffc models have recenly ganed consderable mporance as a mean of opmsng raffc conrol sraeges. Compuaonally effcen and suffcenly accurae mcroscopc raffc models have been developed based on he cellular auomaa heory. However, he real-me applcaon of he avalable cellular auomaa models n raffc conrol sysems s a dffcul ask due o her dscree and sochasc naure. Ths paper nroduces a novel mehod of raffc sreams modellng, whch combnes cellular auomaa and fuzzy calculus. The nroduced fuzzy cellular raffc model elmnaes man drawbacks of he cellular auomaa approach.e. necessy of mulple Mone Carlo smulaons and calbraon ssues. Expermenal resuls show ha he evoluon of a smulaed raffc sream n he proposed fuzzy cellular model s conssen wh ha observed for sochasc cellular auomaa. The comparson of boh mehods confrms ha he compuaonal cos of raffc smulaon s consderably lower for he proposed model. The model s suable for real-me applcaons n raffc conrol sysems. Keywords: road raffc modellng, fuzzy numbers, cellular auomaa, raffc sgnal conrol 1. Inroducon The developmen of adequae raffc models for applcaons n he road raffc conrol s a challengng ssue. Such models should presen a well-balanced rade-off beween accuracy and compuaonal complexy o enable on-lne processng of measuremen daa and raffc sae esmaon. The sae-of-he-ar raffc conrol mehods use macroscopc and mesoscopc models ha descrbe queues or groups of vehcles [1, 2, 3]. However, he ndvdual feaures relaed o vehcles are mporan from he raffc conrol pon of vew, as hey have a sgnfcan nfluence on he raffc performance. Modern sensng plaforms (e.g. vson-based monorng sysems [4, 5] and vehcular sensor neworks [6]) offer raffc daa concernng he parameers of parcular vehcles (poson, velocy, acceleraon, drecon, ec.). The vehcles can be used as sources of nformaon o deermne dealed raffc sream characerscs. Emergng echnologes n he road raffc monorng enable wreless communcaon beween sensng devces nsalled n vehcles (moble sensors) and he road envronmen for dynamc ransfers of measuremen daa [7]. These daa canno be fully ulsed for raffc conrol purposes when usng macroscopc or mesoscopc models. Mcro-smulaon as a mean of conrollng raffc sysems has recenly ganed he consderable mporance [8]. Compuaonally effcen and suffcenly accurae mcroscopc raffc models have been developed based on he cellular auomaa heory [9]. However, applcaon of he avalable cellular auomaa models n raffc conrol sysems s a dffcul ask due o her sochasc characer. Sochasc parameers n he cellular auomaa are necessary o represen model unceranes and o enable a model calbraon. Unforunaely, he raffc smulaon wh sochasc cellular auomaa requres he me consumng Mone Carlo mehod o be used. Long compuaonal me of he Mone Carlo smulaon s a crcal

2 dsadvanage for raffc conrol applcaons ha requre he resuls of smulaon o be obaned n a srcly lmed me-frames. In hs paper a new mcroscopc raffc model s nroduced, whch does no nvolve he Mone Carlo echnque and enables a realsc smulaon of sgnal conrolled raffc sreams. The model was formulaed as a hybrd sysem combnng a fuzzy calculus wh he cellular auomaa approach. The orgnal feaure dsngushng hs model from he oher cellular models s ha vehcle poson, s velocy and oher parameers are modelled by fuzzy numbers. Moreover, he rule of model ranson from one me sep o he nex s also based on fuzzy defnons of basc arhmec operaons. The applcaon of fuzzy calculus helps o deal wh mprecse raffc daa and o descrbe uncerany of he smulaon resuls. In fac, s mpossble o predc unambguously he effec of an applcaon of a specfc raffc conrol sraegy. Moreover, he curren raffc sae also canno be usually denfed precsely on he bass of he avalable measuremen daa. Therefore, he fuzzy numbers are used n a raffc model o descrbe he uncerany and precson of he smulaon npus and oupus. The model allows a sngle smulaon o ake no accoun many poenal scenaros (raffc sae evoluons) [10]. These facs along wh low compuaonal complexy make he model suable for real-me applcaons n raffc conrol sysems. The res of he paper s organsed as follows: Relaed works are revewed and analysed n Secon 2. Secon 3 addresses lmaons regardng he use of cellular auomaa for modellng he raffc a sgnalsed nersecons. Secon 4 nroduces he fuzzy cellular model of sgnalsed raffc sream and descrbes he raffc smulaon algorhm n deals. A comparson of smulaon resuls for he fuzzy cellular model and he Nagel-Schreckenberg sochasc cellular auomaa s presened n Secon 5. Fnally, conclusons are gven n Secon Relaed works Cellular auomaa have become a frequenly used ool for mcroscopc modellng of road raffc processes. Ther man advanages are hgh compuaonal effcency and fas performance when used n compuer smulaons. The cellular auomaa raffc models are dynamcal sysems wh dscree me, space and sae varables. Despe lmed accuracy on a mcroscopc scale, hey allow real raffc phenomena o be smulaed wh suffcen precson. A comprehensve and dealed revew of he cellular auomaa raffc models can be found n [11, 12]. Among many applcaons n he feld of road raffc modellng, he cellular auomaa were also used for smulaon and opmsaon of sgnal raffc conrol. In [13] a raffc smulaon ool for urban road neworks was proposed whch s based on Nagel- Schreckenberg (NaSch) sochasc cellular auomaa [14]. An nersecon model was consdered n hs work ncludng raffc regulaons (prory rules, sgns, and sgnalsaon). I was also suggesed ha for approprae seng of a deceleraon probably parameer he model yelds realsc me headways beween vehcles crossng sop lne a a sgnalsed nersecon. A modfed NaSch model for raffc flow conrolled by a raffc sgnal was proposed n [15]. Accordng o he nroduced modfcaon, he deceleraon probably for each vehcle s deermned as a funcon of free space n fron of he vehcle. The model was appled n order o smulae a sgnal conrolled raffc flow on a sngle-lane road. Several models of hs ype ha are based on he NaSch cellular auomaa can be found n he leraure (e.g.: model wh urnng-deceleraon rule [16], model wh ancpaon of change n raffc lghs [17]).

3 Schadschneder e al. [18] have presened a cellular auomaa model of vehcular raffc n sgnalsed urban neworks by combnng deas borrowed from Bham-Mddleon-Levne model of cy raffc [19] and he NaSch model of sngle lane raffc sream. The smlar model was adoped o calculae opmal parameers of raffc sgnal coordnaon plan ha maxmse a flow n a road nework [20]. In [21] a model of cy raffc was nroduced, whch s based on deermnsc elemenary cellular auomaa. Each cell n an elemenary cellular auomaon has only wo possble saes (0 and 1). Moreover, he sae of a cell depends only on he presen saes of s neares neghbours. The smplcy of hs model allows for he smulaon of large road neworks wh many nersecons. The emphass n hs approach was pu on he smplcy and scalably of he model raher han on realsm of he raffc smulaon. A cellular auomaa raffc model was also ulsed as an evaluaon ool n a genec algorhm for he raffc sgnals opmsaon [9]. The fness funcon n hs algorhm s evaluaed on he bass of raffc smulaon resuls. The opmsaon was performed for a road nework wh 20 sgnalsed nersecons. The resuls were compared for a sochasc and a deermnsc verson of he cellular auomaa model. I was observed ha he obaned populaon fness rankng s smlar for boh versons. However, he deermnsc cellular auomaa have enabled a remarkable speed-up of he genec algorhm execuon. The relaonshps beween parameers of he cellular auomaa models and sauraon flow raes a smulaed nersecon were analysed n [22]. The raffc models were nvesgaed n hs work o denfy he possbly of reproducng any desred value of he sauraon flow. Ths analyss was performed for boh he deermnsc and sochasc cellular auomaa. I was concluded ha he sochasc verson allows any value of he sauraon flow o be obaned by adjusng a deceleraon probably parameer. Varous arfcal nellgence echnques have been used n he feld of raffc modellng [23, 24]. In hs paper a cellular auomaa model of road raffc s combned wh fuzzy arhmec. Hybrd arfcal nellgence sysems ha combne he cellular auomaa and fuzzy ses are ypcally referred o as fuzzy cellular auomaa (FCA) [25]. FCA-based models have found many applcaons n he feld of complex sysems smulaon e.g. [26, 27]. A road raffc model of hs knd has been proposed n [28]. In such models, he local updae rule of classcal cellular auomaa s usually replaced by a fuzzy logc sysem conssng of fuzzy rules, fuzzfcaon, nference, and defuzzfcaon mechansms. A dfferen approach s used n hs paper: curren saes of he cells are deermned by fuzzy ses and a calculus wh fuzzy numbers s nvolved n he updae operaon. The nnovave feaures of he proposed mehodology are he elmnaon of nformaon loss caused by defuzzfcaon and he ncorporaon of uncerany n smulaon resuls. 3. Lmaons of cellular auomaa models Cellular auomaa models of road raffc descrbe veloces and posons of vehcles n dscree me seps. Poson x ndcaes a cell, whch s occuped by vehcle a me sep. Velocy v s expressed n cells per me sep and deermnes how many cells he vehcle advance a me sep. The dscree posons and veloces are updaed a each me sep accordng o he rule of he cellular auomaa. In order o compue velocy, he rule akes no accoun prevous velocy values, a maxmal velocy v max and number of free cells n fron of he vehcle a me sep (so-called gap) g. Realsc smulaon of he sgnalsed nersecon requres a raffc model, whch can be appropraely calbraed o reflec real values of he measured sauraon flow.e. he maxmum hourly vehcle flow rae, a whch he raffc s as dense as could reasonably be

4 expeced, passng an nersecon under prevalng roadway, raffc, and conrol condons. For cellular auomaa raffc models he calbraon s no a rval ask due o her dscree formulaon and lmed se of parameers Deermnsc cellular auomaa In case of deermnsc cellular auomaa models he sauraon flow rae can be evaluaed by he analyss of queue dscharge behavour. To hs end a raffc sream have o be modelled, whch consss of vehcles leavng a queue afer end of red sgnal. In such raffc sream a unform gap g exss beween vehcles ha reached he maxmal velocy v max. Every vehcle occupes one cell, hus he gap g corresponds o he raffc densy of 1/(g + 1) vehcles per cell. On hs bass he sauraon flow s can be calculaed n vehcles per me sep: vmax s. (1) g 1 Accordng o he above equaon, he sauraon flow n a deermnsc cellular auomaa model can be adjused n wo ways: by changng he maxmal velocy or changng he gap ha occurs beween vehcles movng wh maxmal velocy. The laer requres a modfcaon of he cellular auomaa rule. In pracce, s no possble o oban an arbrary sauraon flow rae because v max and g akes only neger values and a se of applcable rules ha reproduce he real-lfe raffc behavour s very lmed. In order o llusrae he ssue of deermnsc model calbraon, sauraon flow rae wll be analysed akng no accoun hree dfferen cellular auomaa rules. Fg. 1 compares he queue dscharge behavour for he hree consdered rules. In hs example, he maxmal velocy s wo cells per me sep. Numbers n Fg. 1 denoe veloces of vehcles and ndcae her posons (occuped cells), he symbol X represens a red sgnal for vehcles, whch s acve only a he frs me sep of he smulaon. The frs rule (R1) s smlar o he rule ha was proposed by Takayasu and Takayasu [29]. Accordng o hs model a sopped vehcle sars o move only f he gap n fron of g s wder han one cell: 0, v 1 0 g 1, v, (2) mn( v 1 1, g, vmax ), else, x v x 1. When applyng he above formulas, he resulng gap g beween vehcles n sauraed raffc sream s of 2 v max cells (Fg. 1 a). A smaller gap g s obaned for rule R2, whch skps he updae of a vehcle poson f he vehcle s sopped and s curren gap g s of one cell: v mn( v 1, g, ), (3) 1 vmax x, v 1 0 g 1, x x v, else. Usng rule R2 a sauraed raffc sream s formed wh wo gap wdhs: g = v max + 1 for vehcles wh even ndexes and g = 2 v max 1 for vehcles wh odd ndexes. Noe ha he average gap s 1.5 v max and boh above values are equal f v max = 2 (Fg. 1 b). The hrd analysed rule (R3) corresponds o he deermnsc case of he Nagel- Schreckenberg model [14] wh slowdown probably parameer p = 0: v mn( v 1, g, ), (4) 1 vmax x 1 x, v.

5 For hs rule he gap g has wdh of v max cells (Fg. 1 c). Gaps g and he resulng sauraon flow raes for all above rules are summarsed n Tab. 1. The sauraon flow raes s n vehcles per hour of green me were calculaed assumng ha v max = 2 and one me sep corresponds o one second. a) b) c) Fg. 1. Queue dscharge behavour for deermnsc cellular auomaa rules R1-R3 Tab. 1. Sauraon flow raes for deermnsc cellular auomaa rules R1-R3 Rule g [cells] s [vehs per me sep] s [vehs per hour] vmax R1 2v max 1440 v 1 R2 R3 1.5v v max max 2 max vmax 1.5vmax 1 vmax v 1 max The presened examples show ha s possble o oban only a lmed se of sauraon flow raes by manpulang parameers and rules of he deermnsc cellular auomaa models. Moreover, mnmal model modfcaons resul n sgnfcan changes of he sauraon flow. Thus, he deermnsc cellular auomaa models are no suffcen for he realsc raffc smulaon a sgnalsed nersecons Sochasc cellular auomaa Sochasc cellular auomaa models nclude some addonal probably parameers ha conrol he random aspecs of raffc smulaon. As was dscussed n [22], he probably

6 parameers have a drec nfluence on sauraon flow raes of he smulaed raffc sream. However, he modfcaon of he probably parameer for cellular auomaa model resuls no only n change of he average (expeced) value of he sauraon flow raes, bu also n change of her spread. Ths effec s llusraed n Fgs. 2 and 3 for he NaSch model. The NaSch model was used o smulae raffc a a sgnalsed nersecon. Durng he expermen he deceleraon probably parameer p was changed beween 0 and 0.8 wh ncremens of The smulaon of one hour perod was repeaed fve hundred mes for every value of he probably p. Sauraon flow rae was calculaed n each smulaon run. On hs bass a dsrbuon of he sauraon flow raes was deermned for every value of parameer p n he analysed range. The plo n Fg. 2 shows medans, 5-h, and 95-h percenles of he obaned sauraon flow dsrbuons. An example of he dsrbuon hsogram for p = 0.2 s presened n Fg. 6. The spread of he sauraon flow raes was evaluaed as a dfference beween 95-h and 5-h percenle (Fg. 3). Fg. 2. Sauraon flow rae vs. probably parameer p for NaSch model Fg. 3. Spread of sauraon flow values vs. probably parameer p for NaSch model

7 From he resuls n Fgs. 2 and 3 may be concluded ha an ncrease of probably p causes boh lower sauraon flow raes and hgher spread of s values. Thus, for he NaSch model s mpossble o ndependenly change he average value and he range of he sauraon flow raes. Anoher ssue s relaed o he dependency beween free-flow velocy v f and probably parameer: v f = v max p, whch s a well-known characersc of he NaSch cellular auomaa [11]. Due o hs dependency, any modfcaon of he probably parameer resuls also n he change of he free-flow raffc velocy. The aforemenoned muual dependences beween parameers n he sochasc cellular auomaa serously mpede he use of he probably parameer for raffc model calbraon. Applcaon of sochasc cellular auomaa for he evaluaon of raffc performance a a sgnalsed nersecon requres he Mone Carlo mehod o be used for esmaon of performance measures [9]. A number of raffc smulaon runs s necessary o esablsh a meanngful esmae. Therefore he applcably of he sochasc cellular auomaa s lmed due o he long compuaonal me of he Mone Carlo smulaon. Ths dsadvanage s crcal n raffc conrol applcaons, where he resuls have o be obaned faser han he real duraon me of he smulaed process. 4. Fuzzy cellular model A fuzzy cellular model of road raffc was developed o overcome he lmaons of cellular auomaa models ha were dscussed n prevous secon. The nroduced model combnes he man advanages of cellular auomaa models wh a possbly of realsc raffc smulaon a sgnalsed nersecons. The proposed mehod allows he raffc model o be calbraed n order o reflec real values and unceranes of measured sauraon flows. A raffc lane n he fuzzy cellular model s dvded no cells ha correspond o he road segmens of equal lengh. The raffc sae s descrbed n dscree me seps. These wo basc assumpons are conssen wh hose of he Nagel-Schreckenberg cellular auomaa model. Thus, he mehods presened n [11] are also applcable here for he deermnaon of cell lengh and vehcles properes. A novel feaure n hs approach s ha vehcle parameers are modelled usng ordered fuzzy numbers [30]. Moreover, he model ranson from one me sep () o he nex ( + 1) s based on fuzzy defnons of basc arhmec operaons. The road raffc sream s represened n he fuzzy cellular model as a se of vehcles. Each vehcle () s descrbed by s poson X (defned on he se of cells ndexes) and velocy V (n cells per me sep). Maxmal velocy V max s a parameer, whch s assgned o he raffc sream (a se of vehcles). In order o enable approprae modellng of sgnalsed nersecons, he sauraon flow S (n vehcles per hour of green me) was also aken no accoun as a parameer of he raffc sream. All he above quanes are expressed by rangular ordered fuzzy numbers Ordered fuzzy numbers The concep of ordered fuzzy numbers was nroduced n [30]. Accordng o he orgnal defnon, an ordered fuzzy number (A) s represened by an ordered par of connuous real funcons defned on he nerval [0; 1] (Fg. 4): A f, h,, :[0;1] R A A f A ha. (5) The correspondence beween he ordered fuzzy numbers and he classcal heory of convex fuzzy numbers was dscussed n [31]. I was shown ha f some specfc condons are sasfed by he par of funcons f A, h A hen can be ransformed no he membershp funcon µ(x), x R, whch represens a convex fuzzy number n he classcal sense.

8 The model of ordered fuzzy numbers provdes a que smple represenaon of nonprecse nformaon and also smple arhmec operaons. The man advanage of usng he ordered fuzzy numbers s he fac ha hs approach elmnaes several ssues relaed o he classcal fuzzy arhmec, whch s based on he so-called exenson prncple. In he classcal approach, boh he addon and subracon operaons ncrease fuzzness of he calculaed resul. In case of performng he sequences of operaons repeaedly, he applcaon of exenson prncple yelds resuls wh an overesmaed fuzzness (mprecson) ha have lle poenal o be useful. Ths fac was found o be a major obsacle mpedng he consrucon of a fuzzy verson of cellular auomaa model for he raffc smulaon. The ordered fuzzy numbers allow he mulple operaons o be performed whou an excessve ncrease of he fuzzness. I was assumed ha only rangular fuzzy numbers wll be used n he consrucon of a road raffc model, hus f A and h A wll be affne funcons. To be n agreemen wh he classcal denoaon of fuzzy ses (numbers), he ndependen varable of boh funcons wll be denoed by µ: (1) (2) (1) ( ) a ( a a ). (6) f A (3) (3) (2) h A ( ) a ( a a ). In he presened approach, he defnon of he ordered fuzzy number was modfed by (0) (4) nroducng an nerval I A [ a ; a ] o deermne range (codoman) of he funcons f A and h A : A f A, ha, I A, f A, ha :[0;1] I A. (7) Ths modfcaon was made o enable a concse descrpon of dependences beween fuzzy numbers represenng dfferen physcal quanes, whch values can vary n sgnfcanly dfferen ranges. For furher presenaon of he proposed model, wll be convenen o normalse he codoman of funcons f A and h A no he un nerval [0; 1]. Thus, he followng range-normalsed form of he ordered fuzzy number wll be used: A f, h, I, f, :[0;1] [0;1]. (8) A A A where: (0) (0) f A( ) a ha( ) a f A( ), ha( ). (9) I A I A are he range-normalsed counerpars of funcons f A and h A (Fg. 4). A h A Fg. 4. Trangular ordered fuzzy number and s range-normalsed counerpar

9 Herenafer, all he ordered fuzzy numbers are represened by 5-uples. The followng noaon s used o refer o her sandard and range-normalsed form respecvely: (0) (1) (2) (3) (4) (0) (1) (2) (3) (4) A ( a, a, a, a, a ), A ( a, a, a, a, a ). (10) A defnon of basc operaons on rangular ordered fuzzy numbers can be now formulaed usng he above represenaon: op( A, B) C c op( a, b ), m 0,...,4, (11) where A, B, C are ordered fuzzy numbers and op sands for a parcular operaon: addon, subracon, mulplcaon, mnmum or maxmum. Ths se of operaons s suffcen for consrucng a fuzzy raffc model based on he cellular auomaa approach Traffc smulaon algorhm In hs secon a raffc smulaon algorhm s nroduced. The mos mporan componens of hs algorhm are updae operaons ha enable he veloces and posons of vehcles o be compued a each me sep of he smulaon. The desgn of he updae operaons has a drec mpac on he resulng sauraon flow of he smulaed raffc sream. The proposed algorhm allows he raffc smulaon o be adjused n order o f a predeermned level of sauraon flow, whch s represened by a fuzzy number S. The proposed raffc smulaon algorhm (Algorhm 1) ulses a par of deermnsc rules (RL, RH) for updang he fuzzy cellular model. The rules RL and RH are used o (0) (4) compue posons x and x respecvely, where denoes curren me sep of he 1 1 smulaon. For he compuaon of x, (1) 1 x and (2) 1 x one of he avalable rules (RL or RH) s seleced a each me sep. The nroduced operaon of rules selecon allows he smulaed raffc sream o reach he assumed level of sauraon flow (S). (3) 1 Algorhm 1. Traffc smulaon wh fuzzy cellular model For = 1 o T do Updae raffc sgnals. For all vehcles ( = 1 o N) do Compue v 0) (0) and x usng rule RL. ( 1 For m = 1 o 3 do f x hen compue else compue Compue v 4) and ( v (4) 1 and 1 v and x usng rule RH, 1 x usng rule RL. x usng rule RH. As was dscussed n Secon 3.1, each deermnsc rule of cellular auomaa corresponds o a sngle value of he sauraon flow. The value of sauraon flow s deermned by wo parameers: maxmal velocy v max and gap g beween vehcles passng hrough an nersecon wh he maxmal velocy. We wll denoe he maxmal velocy for (0) (4) rules RL and RH as vmax and v max respecvely. Smlarly, he gaps for rules RL and RH wll be represened by g (0) and g (4). The correspondng sauraon flow values can be calculaed by usng Eq. (1). In he proposed algorhm he sauraon flow level s (0), acheved for rule RL, has o be lower han he sauraon flow level s (4) for he second rule (RH). The par of deermnsc rules RL, RH allows us o compue an nerval (0) (4) I [ x ; x ] represenng possble posons of -h vehcle ha correspond o he assumed X (0) (4) nerval of sauraon flow values I S [ s ; s ]. Upper char n Fg. 5 shows posons of sx

10 vehcles, deermned for he sauraon flow values from nerval I S. Black dos represen wo exreme confguraons of he raffc model ha are obaned by usng he wo dfferen (m) m deermnsc cellular auomaa rules. For each poson x, such ha x ( ) I X he followng equaly s sasfed: x vmax g. (12) I should be noed here ha he me ndces of varables x were omed for he sake of smplcy. On he bass of (12) we can deermne he maxmal velocy and gap for he vehcle poson x : (m) v max g (0) (4) (0) v x ( v v ), (13) max max max (0) (4) (0) g x ( g g ). (14) (m) Thus, he value of sauraon flow, whch corresponds o he poson x can be calculaed as: (0) (4) (0) vmax x ( vmax vmax ) s. (15) (0) (4) (0) g x ( g g ) 1 Ths leads o he non-lnear relaonshps beween posons x of parcular vehcles movng n a raffc sream and he sauraon flow s (Fg. 5). Fg. 5. Fuzzy cellular model of raffc sream: sauraon flow and vehcles posons The man am of he nroduced approach s o provde a road raffc model, whch can accep an ordered fuzzy number S as an npu parameer specfyng he level of he sauraon flow. The lower char n Fg. 5 shows vehcles posons ha were obaned by akng no accoun he assumed fuzzy value of he sauraon flow. These posons are represened by ordered fuzzy numbers X. The key nsgh s ha by ransformng he formula (15) we can deermne he expeced posons ha correspond wh he assumed level of sauraon flow: x (0) (0) s g vmax (4) (0) (4) (0) v v s g g 1 max max m. (16) The resulng value (m) s dencal for all vehcles n he raffc sream and for all me seps of he smulaon. I should be also noed ha Eq. (16) ogeher wh he known nervals I provdes complee descrpon of he fuzzy numbers X. Durng raffc smulaon he posons x have o be compued as neger cell ndces n accordance wh he deermnsc cellular auomaa rules. The symbol (m) n (16) was nroduced n order o dsngush he expeced posons from he curren posons X

11 deermned as a resul of he smulaon. Wh he above defnons, he am of achevng he predeermned sauraon flow level can be ranslaed no he followng requremen, whch needs o be sasfed n he raffc smulaon: x mn m. (17) The proposed raffc smulaon algorhm copes wh hs mnmsaon problem by selecng he cellular auomaa rule ha reduces he absolue dfference defned n (17). As was menoned a he begnnng of hs secon, he rule selecon s execued for all vehcles a each me sep of he smulaon and apples o he updae of posons x for m = 1, 2, 3. Exac defnon of he rule selecon operaon s presened n he form of f-hen saemen by he pseudo-code of Algorhm 1. Snce he fuzzy cellular model s desgned o be used for he smulaon of sgnalconrolled raffc sreams, has o ake no accoun drvers reacons o raffc sgnals. The nfluence of raffc sgnalsaon s smulaed by nroducng a se of cells n fron of whch he vehcles have o hal a red sgnals. Ths se wll be denoed by H. The hal cells n H correspond wh he locaons of sop lnes. The updae of a raffc sgnal nvolves he nseron of an approprae cell ndex x no he se H when he red sgnal has o be acvaed, and removal of he ndex x from H when he red sgnal has o be deacvaed. Thus, yellow me s consdered as a par of green phase Model mplemenaon The followng defnons provde a dealed descrpon of he fuzzy cellular model mplemenaon, whch s based on he deermnsc cellular auomaa rules R1 and R2 ha were dscussed n Secon 3.1. The rules denoed by RL and RH n he smulaon algorhm (Algorhm 1) are mplemened here as he rules R1 and R2 respecvely. The velocy of vehcle a me sep s compued usng he formula: mn( V 1, G, V A, (18) V 1 max ) where G s he fuzzy number of free cells n fron of a vehcle : L S G, mn( G,, G, ). (19) Gap L G represens he dsance beween -h vehcle and s lead vehcle ( 1): L G X X 1. (20) 1, If here s no lead vehcle n fron of he vehcle hen G s assumed o be equal o V max. The varable S G descrbes dsance of he -h vehcle o he neares red sgnal (.e. he hal cell x H): S g mn{ x x 1: x x x }. (21) H If here s no hal cell x sasfyng he condon n (21) hen L g. S g s assumed o be equal o The varables V, G, L G, S G, X, and V max are rangular ordered fuzzy numbers. Thus, he calculaons are performed accordng o he defnon (11). The subracon of 1 n (20) s handled by nerpreng he scalar value as an ordered fuzzy number, whch can be represened by 5-uple havng all he componens equal o one. A s a 5-uple of bnary values: 0, r, RL v 1 0 g 1, a (22) 1, else,

12 where m = 0,..., 5. Noe ha f a 0 hen v s compued by usng he rule RL (.e. R1). The mulplcaon by he bnary uple A n (18) s performed smlarly o he operaons on ordered fuzzy numbers, accordng o he defnon (11). Afer he deermnaon of veloces for all vehcles, her posons are updaed as follows: X 1 X V, B,, (23) where B s a 5-uple of bnary values: 0, r, RH v 1 0 g 1, b (24) 1, else. In he above formula, b akes value 0 when he rule RH (.e. R2) s used for he compuaon of x. 1 The varables r n equaons (22) and (24) are componens of anoher 5-uple (R ), whch s nroduced o descrbe he curren selecon of rules: RH, x (0) (4) r,, m 1,..., 3, r RL, r RH. (25) RL, else I should be noed here ha he above defnon of R s conssen wh he rule selecon operaon ha was nroduced for he fuzzy cellular model n Secon Comparson wh Nagel-Schreckenberg cellular auomaa model 5.1. Smulaon resuls Ths secon presens some resuls of raffc smulaons n a sgnalsed areral. The resuls of a smulaon performed wh he fuzzy cellular model are compared agans hose obaned by usng he Nagel-Schreckenberg (NaSch) sochasc cellular auomaa model. For he purpose of hs expermen he fuzzy cellular model was mplemened accordng o he defnons gven n Secon 4. The parameers of he fuzzy cellular model were adjused o mach he followng sengs of he sochasc NaSch model: me sep 1 s, cell lengh 7.5 m deceleraon probably p = 0.2 and maxmal velocy v max = 2 cells per me sep. Smlarly, for he fuzzy cellular model he maxmal velocy of vehcles was assumed as wo cells per me sep: v max 2 m. Thus, due o he applcaon of deermnsc rules R1 and R2, he resulng nerval of sauraon flow values for he fuzzy cellular model s I S = [1440, 1800] (n vehcles per hour of green me). The sauraon flow volume n he fuzzy cellular model s defned by he ordered fuzzy number S. Ths parameer was esmaed n order o reproduce he dsrbuon of sauraon flow raes observed n he NaSch model. Fg. 6 shows a hsogram of he sauraon flow values ha were obaned for he NaSch model durng 500 runs of a raffc smulaon a sgnalsed nersecon. The smulaon perod was 3600 seconds for each run. The expermenal daa presened n Fg. 6 were furher used for he deermnaon of he parameer S. The values of s (1), s (2) and s (3) were se respecvely as he 5-h percenle, medan and 95-h percenle of he sauraon flow raes dsrbuon. As a resul he followng fuzzy number was obaned, whch descrbes he sauraon flow n vehcles per hour of green me: S = (1440, 1503, 1575, 1638, 1800). The parameers (1) = 0.21, (2) = 0.43, (3) = 0.60 of he fuzzy cellular model were calculaed for he above level of sauraon flow accordng o Eq. (16).

13 Fg. 6. Hsogram of sauraon flow raes for NaSch model The cell lengh for he fuzzy cellular model was deermned on he bass of free-flow velocy comparson. For low raffc denses n NaSch model, vehcles move wh a freeflow velocy, whch can be calculaed n cells per me sep usng he formula: v f = v max p. In case of he fuzzy cellular model he free-flow velocy s equal o V max (noe ha V max s an ordered fuzzy number). The me sep for boh models corresponds o one second. Takng no accoun he parameers ha were deermned above, he cell lengh for fuzzy cellular model can be calculaed as 7.5 ( vmax p) / vmax = 6.75 m. Thus, n boh models he free-flow velocy s equal o 13.5 m/s (48.6 km/h). Smulaons of a raffc n sgnalsed one-way areral road were performed n order o compare he nroduced fuzzy cellular model and he NaSch cellular auomaa. Parameers of boh models were se as dscussed above. One-lane road was consdered n hs sudy because he analyss s focused on he dealed properes of he models ha are relaed o sngle lane raffc sreams. I was assumed ha hree sgnalsed nersecons are locaed a he modelled road. Toal lengh of he road s 3 km and he dsances beween nersecons are equal o 750 m. The nal condons of he raffc smulaons are deermned by a sngle queue lengh parameer (.e. number of vehcles wang n a queue a an nersecon). A he begnnng of each smulaon queues of equal lengh are formed for all hree nersecons. Addonally, he las vehcle s always nsered no he frs cell of he modelled road. Fg. 7 presens rajecores of he las vehcle n me-space dagrams. Black dashed and doed lnes show rajecores ha were deermned by usng he fuzzy cellular model (FCM). The grey colour ndcaes rajecores obaned for he NaSch model durng 500 runs of he raffc smulaon. Black horzonal bars correspond o red me nervals a he nersecons. Traffc sgnal mngs are smlar for all smulaed nersecons. The resuls presened n Fg. 7 a) were obaned for sgnal cycle me of 60 s and green phase of 30 s. For he second case (Fg. 7 b) he cycle me was 90 s and green phase was 45 s. Dependency beween he queue lengh parameer and he ravel me of he las vehcle s llusraed n Fg. 8. The ravel me s defned as me requred for he las vehcle o pass a sop lne a he hrd nersecon. The resuls of ravel me esmaon are compared for he wo analysed models. In case of he NaSch model applcaon, he percenles of ravel me dsrbuon are deermned on he bass of 500 smulaon runs for each queue lengh. Usng fuzzy cellular model, he ravel me s deermned n sngle smulaon run as an ordered fuzzy number accordng o he followng equaon: mn{ : x 333}, (26) l,

14 where l s an ndex of he las vehcle. The cell number 333 corresponds o locaon of he sop lne a hrd nersecon. a) b) Fg. 7. Trajecory of he las vehcle for wo sgnal cycle mes: a) 60 s b) 90 s Fg. 8. Travel me of he las vehcle vs. nal queue lengh Plos n Fg. 9 show number of vehcles on he modelled road (upsream of he hrd nersecon) for successve me seps of he raffc smulaon. Noe ha he vehcles are nsered no he modelled road only a he begnnng of smulaon. The number of vehcles decreases durng smulaon as subsequen vehcles pass over he sop lne of he hrd nersecon. The nal number of vehcles s deermned by he queue lengh parameer. The resuls presened n Fg. 9 a) and b) were obaned for he queue lengh of 30 and 70 vehcles respecvely. The resuls for NaSch model were esmaed afer 500 runs of he raffc smulaon. In he fuzzy cellular model, he number of vehcles a me sep s drecly calculaed for a sngle smulaon run as an ordered fuzzy number N : n { : x 333}, (27) where. denoes he cardnaly of a se.

15 a) b) Fg. 9. Number of vehcles on he modelled road for wo nal queue lenghs: a) 30 b) 70 The resuls shown n Fg. 8 and Fg. 9 were obaned for he raffc sgnal cycle of 60 s wh green phase of 30 s. The above sgnal mng parameers were used for all hree nersecons. As can be observed n he above resuls, he evoluon of he smulaed raffc sream s very smlar for boh models. Ths fac proves ha he proposed fuzzy cellular model can be appropraely calbraed o reproduce he raffc sream behavour for a gven dsrbuon of sauraon flows raes. The expermens have shown ha he accuracy of raffc smulaon s smlar for boh consdered models. However, he fuzzy cellular model avods he aforemenoned dsadvanages of he cellular auomaa (Secon 3). Frsly, he proposed model can be precsely calbraed by adjusng s parameers. Moreover, he uncerany of model parameers can be aken no accoun as he parameers are represened by fuzzy numbers. Secondly, he fuzzy cellular model does no need mulple smulaons because uses he fuzzy numbers o esmae he dsrbuons of raffc performance measures (ravel me, he number of vehcles n a gven regon, delays, queue lenghs, ec.) durng a sngle run of he raffc smulaon Compuaonal cos The mplemenaon of he NaSch model requres mulple raffc smulaon runs (see Algorhm 2). A each run, he smulaon resuls have o be sored. Afer K runs, he sored resuls are used o calculae dsrbuons of he raffc performance measures. The number of smulaon runs K has o be appropraely hgh n order o oban meanngful esmaes. For he expermens presened n hs secon he number of runs K was 500. The sochasc rule of NaSch cellular auomaa was decomposed no wo deermnsc rules, denoed by NSH and NSL. The NSH rule s conssen wh he R2 rule, whch was defned n Secon 3.1. I corresponds o he NaSch rule wh parameer p = 0. The NSL rule reflecs he operaon of he NaSch rule for p = 1. Thus, he velocy n he NSL rule s calculaed accordng o he followng formula: v, max( 0, mn( v 1 1, g, vmax ) 1). (28) The randomsaon sep of he NaSch model was mplemened n he smulaon algorhm by nroducng a selecon of he deermnsc rule (NSL or NSH). The selecon s

16 based on a random number [0;1), whch s drawn from a unform dsrbuon. Ths descrpon of he raffc smulaon algorhm enables s comparson wh he algorhm proposed for he fuzzy cellular model (Algorhm 1). Algorhm 2. Traffc smulaon wh he NaSch model For smulaon run 1 o K do For = 1 o T do Updae raffc sgnals. For all vehcles ( = 1 o N) do Generae random number. If p hen compue v and x 1 usng rule NSL, else compue v and x 1 usng rule NSH. Sore smulaon resuls. Le us assume ha he basc operaon n he raffc smulaon algorhm s he execuon of deermnsc cellular auomaa rule.e. he compuaon of he poson and velocy for a sngle vehcle. The number of basc operaons performed durng he raffc smulaon can be deermned for boh compared models by analysng he pseudo-code of Algorhm 1 and Algorhm 2. The raffc smulaon wh he NaSch model requres K T N basc operaons whereas durng he smulaon wh he fuzzy cellular model he basc operaon s execued 5 T N mes. I was assumed ha he number of vehcles N s consan n he analysed smulaon perod. The compuaonal cos of raffc smulaon s consderably reduced for he fuzzy cellular model because he number of smulaon runs K s always much greaer han 5 (usually amouns o several hundred runs). Moreover, he raffc smulaon wh he fuzzy cellular model does no need o sore paral resuls, hus requres less memory space han he smulaon wh he NaSch cellular auomaa. 6. Conclusons The fuzzy cellular model of sgnal conrolled raffc sream was proposed by combnng cellular auomaa wh fuzzy calculus. The presened approach benefs from advanages of he cellular auomaa models and elmnaes he man drawbacks ha have mpeded her applcaons n raffc conrol sysems. Parameers of he fuzzy cellular model enable a smple calbraon and allow he raffc smulaon o reflec predeermned sauraon flow raes. The fuzzy numbers are used n order o descrbe he uncerany and precson of he smulaon npus and oupus. Thus, he mprecse raffc daa can be ulsed n he proposed modellng approach for he esmaon of raffc performance [32]. The expermens repored n hs paper show ha he raffc smulaons wh he fuzzy cellular model are conssen wh hose performed by sochasc cellular auomaa. I was also demonsraed ha he applcaon of he nroduced model consderably reduces he compuaonal cos of raffc smulaon. These fndngs are of val mporance for real-me applcaons of mcroscopc models n he road raffc conrol.

17 References [1] A.A. Kurzhansky, P. Varaya, Acve raffc managemen on road neworks: a macroscopc approach, Phlosophcal Transacons of he Royal Socey A 368 (2010) [2] M. Van den Berg, A. Hegy B. De Schuer, J. Hellendoorn, A macroscopc raffc flow model for negraed conrol of freeway and urban raffc neworks, n: Proceedngs of he 42nd IEEE Conference on Decson and Conrol, IEEE, 2003, pp [3] M. Papageorgou, C. Dakak V. Dnopoulou, A. Kosalos, Y. Wang, Revew of road raffc conrol sraeges, Proceedngs of he IEEE 91 (2003) [4] B. Płaczek, A real me vehcles deecon algorhm for vson based sensors, n: L. Bolc e al, (Eds.), ICCVG 2010, Par II, Lecure Noes n Compuer Scence 6375, Sprnger-Verlag, Berln Hedelberg, 2010, pp [5] W. Pamuła, Feaure Exracon Usng Reconfgurable Hardware, n: L. Bolc e al, (Eds.), ICCVG 2010, Lecure Noes n Compuer Scence 6375, Sprnger-Verlag, Berln Hedelberg, 2010, pp [6] U. Lee, M. Gerla, A survey of urban vehcular sensng plaforms, Compuer Neworks 54 (2010) [7] Y. Toor, P. Muhlehaler, A. Laou Vehcle Ad Hoc neworks: applcaons and relaed echncal ssues, IEEE Communcaons Surveys & Tuorals 10 (2008) [8] S.C. Lo, C.H. Hsu, Cellular auomaa smulaon for mxed manual and auomaed conrol raffc, Mahemacal and Compuer Modellng, 51 (2010) [9] J. Medna, M. Moreno, E. Royo, Sochasc vs Deermnsc Traffc Smulaor. Comparave Sudy for Is Use Whn a Traffc Lgh Cycles Opmzaon Archecure, n: J. Mra e al, (Eds.), IWINAC Lecure Noes n Compuer Scence 3562, Sprnger, Berln Hedelberg, 2005, pp [10] B. Płaczek, Fuzzy cellular model for on-lne raffc smulaon, n: PPAM 2009, Par II, Lecure Noes n: R. Wyrzykowsk e al, (Eds.), Compuer Scence 6068, Sprnger- Verlag, Berln Hedelberg, 2010, pp [11] S. Maervoe, B. De Moor, Cellular auomaa models of road raffc, Physcs Repors 419 (2005) [12] D. Chowdhury, L. Sanen, A. Schadschneder, Sascal physcs of vehcular raffc and some relaed sysems, Physcs Repors 329 (2000) [13] J. Esser, M. Schreckenberg, Mcroscopc smulaon of urban raffc based on cellular auomaa,inernaonal Journal of Modern Physcs C 8 (1997) [14] K. Nagel, M. Schreckenberg, A cellular auomaon model for freeway raffc, Journal de Physque I France 2 (1992) [15] H.B. Zhu, H.X. Ge, S.Q. Da A Densy-Dependen NaSch Model for Traffc Flow Conrolled by a Traffc Lgh, n: C. Apper-Rolland e al, (Eds.), Traffc and Granular Flow 07, Sprnger, Berln Hedelberg, 2009, pp [16] W. Jn, Y. Zheng, J. L Mcroscopc smulaon of raffc flow a sgnalzed nersecon based on cellular auomaa, n: Proceedngs of he IEEE Inernaonal Vehcle Elecroncs Conference IVEC '99, IEEE, 1999, pp [17] H.D. He, L.Y. Dong, S.Q. Da Smulaon of raffc flow wh raffc lgh sraeges, Journal of Shangha Unversy (Englsh Edon) 10 (2006) [18] A. Schadschneder, D. Chowdhury, E. Brockfeld, K. Klauck, L. Sanen, J. Zarz, A new cellular auomaa model for cy raffc, n: D. Helbng e al, (Eds.), Traffc and Granular Flow 99: Socal, Traffc, and Granular Dynamcs, Sprnger, Berln, [19] O. Bham, A. Mddleon, D. Levne, Self-organzaon and a dynamcal ranson n raffc-flow models, Physcal Revew A 46 (1992) R6124 R6127.

18 [20] E. Brockfeld, R. Barlovc, A. Schadschneder, M. Schreckenberg, Opmzng raffc lghs n a cellular auomaon model for cy raffc, Physcal Revew E 64 (2001) [21] D. Rosenblueh, C. Gershenson, A Model of Cy Traffc Based on Elemenary Cellular Auomaa, Complex Sysems 19 (2011) [22] I. Spyropoulou, Modellng a sgnal conrolled raffc sream usng cellular auomaa, Transporaon Research Par C 15 (2007) [23] T. Pamuła, Road raffc parameers predcon n urban raffc managemen sysems usng neural neworks, Transpor Problems 6 (2011) [24] A. Król, T. Pamuła, Applcaon Of Genec Algorhm For Desgnng A Transporaon Nework Wh Varyng Consrucon Coss, n: Proceedngs of he Symposum on Mehods of Arfcal Inellgence AI-METH, Glwce, 2009, pp [25] C. Chang, Y. Zhang, Y. Dong, Applcaon of fuzzy logc n he classcal cellular auomaa model, Journal of Appled Mahemacs and Compung 20 (2006) [26] C. Bone, S. Dragcevc, A. Robers, A fuzzy-consraned cellular auomaa model of fores nsec nfesaons, Ecologcal Modellng 192 (2006) [27] C.L. Ramrez, O. Casllo, A Hybrd Model Based on a Cellular Auomaa and Fuzzy Logc o Smulae he Populaon Dynamcs, n: O. Casllo e al, (Eds.), Sof Compung for Hybrd Inel. Sysems. 154, Sprnger, Hedelberg, 2008, pp [28] M. Burzyńsk W. Cudny, W. Kosńsk Traffc flow smulaon - cellular auomaa wh fuzzy rules approach, n: L. Rukowsk e al, (Eds.), Neural Neworks and Sof Compung, Advances n Sof Compung, Physca-Verlag, Hedelberg, 2003, pp [29] M. Takayasu, H. Takayasu, 1/f nose n a raffc model, Fracals 1 (1993) [30] W. Kosńsk P. Prokopowcz, D. Ślęzak, Ordered Fuzzy Numbers, Bullen of The Polsh Academy of Scences, Mahemacs 51(2003) [31] W. Kosńsk On fuzzy number calculus, In. J. Appled Mahemacs & Compuer Scence 16 (2006) [32] B. Płaczek, Performance Evaluaon of Road Traffc Conrol Usng a Fuzzy Cellular Model, n: E. Corchado e al, (Eds.), HAIS 2011, Par II, Lecure Noes n Arfcal Inellgence 6679, Sprnger-Verlag, Berln Hedelberg, 2011, pp

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon

More information

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he

More information

On One Analytic Method of. Constructing Program Controls

On One Analytic Method of. Constructing Program Controls Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna

More information

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005 Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc

More information

Time-interval analysis of β decay. V. Horvat and J. C. Hardy

Time-interval analysis of β decay. V. Horvat and J. C. Hardy Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae

More information

Solution in semi infinite diffusion couples (error function analysis)

Solution in semi infinite diffusion couples (error function analysis) Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of

More information

5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)

5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015) 5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and

More information

Variants of Pegasos. December 11, 2009

Variants of Pegasos. December 11, 2009 Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on

More information

Performance Analysis for a Network having Standby Redundant Unit with Waiting in Repair

Performance Analysis for a Network having Standby Redundant Unit with Waiting in Repair TECHNI Inernaonal Journal of Compung Scence Communcaon Technologes VOL.5 NO. July 22 (ISSN 974-3375 erformance nalyss for a Nework havng Sby edundan Un wh ang n epar Jendra Sngh 2 abns orwal 2 Deparmen

More information

Sampling Procedure of the Sum of two Binary Markov Process Realizations

Sampling Procedure of the Sum of two Binary Markov Process Realizations Samplng Procedure of he Sum of wo Bnary Markov Process Realzaons YURY GORITSKIY Dep. of Mahemacal Modelng of Moscow Power Insue (Techncal Unversy), Moscow, RUSSIA, E-mal: gorsky@yandex.ru VLADIMIR KAZAKOV

More information

Cubic Bezier Homotopy Function for Solving Exponential Equations

Cubic Bezier Homotopy Function for Solving Exponential Equations Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.

More information

TSS = SST + SSE An orthogonal partition of the total SS

TSS = SST + SSE An orthogonal partition of the total SS ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally

More information

Comb Filters. Comb Filters

Comb Filters. Comb Filters The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of

More information

GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim

GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran

More information

Genetic Algorithm in Parameter Estimation of Nonlinear Dynamic Systems

Genetic Algorithm in Parameter Estimation of Nonlinear Dynamic Systems Genec Algorhm n Parameer Esmaon of Nonlnear Dynamc Sysems E. Paeraks manos@egnaa.ee.auh.gr V. Perds perds@vergna.eng.auh.gr Ah. ehagas kehagas@egnaa.ee.auh.gr hp://skron.conrol.ee.auh.gr/kehagas/ndex.hm

More information

Reactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times

Reactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times Reacve Mehods o Solve he Berh AllocaonProblem wh Sochasc Arrval and Handlng Tmes Nsh Umang* Mchel Berlare* * TRANSP-OR, Ecole Polyechnque Fédérale de Lausanne Frs Workshop on Large Scale Opmzaon November

More information

FI 3103 Quantum Physics

FI 3103 Quantum Physics /9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon

More information

Existence and Uniqueness Results for Random Impulsive Integro-Differential Equation

Existence and Uniqueness Results for Random Impulsive Integro-Differential Equation Global Journal of Pure and Appled Mahemacs. ISSN 973-768 Volume 4, Number 6 (8), pp. 89-87 Research Inda Publcaons hp://www.rpublcaon.com Exsence and Unqueness Resuls for Random Impulsve Inegro-Dfferenal

More information

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!) i+1,q - [(! ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal

More information

( ) () we define the interaction representation by the unitary transformation () = ()

( ) () we define the interaction representation by the unitary transformation () = () Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,

More information

CS286.2 Lecture 14: Quantum de Finetti Theorems II

CS286.2 Lecture 14: Quantum de Finetti Theorems II CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2

More information

MANY real-world applications (e.g. production

MANY real-world applications (e.g. production Barebones Parcle Swarm for Ineger Programmng Problems Mahamed G. H. Omran, Andres Engelbrech and Ayed Salman Absrac The performance of wo recen varans of Parcle Swarm Opmzaon (PSO) when appled o Ineger

More information

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon

More information

Fall 2010 Graduate Course on Dynamic Learning

Fall 2010 Graduate Course on Dynamic Learning Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 Byoung-Tak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure

More information

Li An-Ping. Beijing , P.R.China

Li An-Ping. Beijing , P.R.China A New Type of Cpher: DICING_csb L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.

More information

Modeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts

Modeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts nernaonal ournal of Appled Engneerng Research SSN 0973-4562 Volume 13, Number 10 (2018) pp. 8708-8713 Modelng and Solvng of Mul-Produc nvenory Lo-Szng wh Suppler Selecon under Quany Dscouns Naapa anchanaruangrong

More information

CHAPTER 10: LINEAR DISCRIMINATION

CHAPTER 10: LINEAR DISCRIMINATION CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g

More information

Relative controllability of nonlinear systems with delays in control

Relative controllability of nonlinear systems with delays in control Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.

More information

Let s treat the problem of the response of a system to an applied external force. Again,

Let s treat the problem of the response of a system to an applied external force. Again, Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem

More information

ESTIMATIONS OF RESIDUAL LIFETIME OF ALTERNATING PROCESS. COMMON APPROACH TO ESTIMATIONS OF RESIDUAL LIFETIME

ESTIMATIONS OF RESIDUAL LIFETIME OF ALTERNATING PROCESS. COMMON APPROACH TO ESTIMATIONS OF RESIDUAL LIFETIME Srucural relably. The heory and pracce Chumakov I.A., Chepurko V.A., Anonov A.V. ESTIMATIONS OF RESIDUAL LIFETIME OF ALTERNATING PROCESS. COMMON APPROACH TO ESTIMATIONS OF RESIDUAL LIFETIME The paper descrbes

More information

Implementation of Quantized State Systems in MATLAB/Simulink

Implementation of Quantized State Systems in MATLAB/Simulink SNE T ECHNICAL N OTE Implemenaon of Quanzed Sae Sysems n MATLAB/Smulnk Parck Grabher, Mahas Rößler 2*, Bernhard Henzl 3 Ins. of Analyss and Scenfc Compung, Venna Unversy of Technology, Wedner Haupsraße

More information

An introduction to Support Vector Machine

An introduction to Support Vector Machine An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,

More information

RELATIONSHIP BETWEEN VOLATILITY AND TRADING VOLUME: THE CASE OF HSI STOCK RETURNS DATA

RELATIONSHIP BETWEEN VOLATILITY AND TRADING VOLUME: THE CASE OF HSI STOCK RETURNS DATA RELATIONSHIP BETWEEN VOLATILITY AND TRADING VOLUME: THE CASE OF HSI STOCK RETURNS DATA Mchaela Chocholaá Unversy of Economcs Braslava, Slovaka Inroducon (1) one of he characersc feaures of sock reurns

More information

HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD

HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,

More information

Robust and Accurate Cancer Classification with Gene Expression Profiling

Robust and Accurate Cancer Classification with Gene Expression Profiling Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem

More information

Chapter 6: AC Circuits

Chapter 6: AC Circuits Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.

More information

Approximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy

Approximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae

More information

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy

More information

WiH Wei He

WiH Wei He Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground

More information

Robustness Experiments with Two Variance Components

Robustness Experiments with Two Variance Components Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference

More information

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes. umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4 CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped

More information

Volatility Interpolation

Volatility Interpolation Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local

More information

ISSN MIT Publications

ISSN MIT Publications MIT Inernaonal Journal of Elecrcal and Insrumenaon Engneerng Vol. 1, No. 2, Aug 2011, pp 93-98 93 ISSN 2230-7656 MIT Publcaons A New Approach for Solvng Economc Load Dspach Problem Ansh Ahmad Dep. of Elecrcal

More information

Multi-Fuel and Mixed-Mode IC Engine Combustion Simulation with a Detailed Chemistry Based Progress Variable Library Approach

Multi-Fuel and Mixed-Mode IC Engine Combustion Simulation with a Detailed Chemistry Based Progress Variable Library Approach Mul-Fuel and Med-Mode IC Engne Combuson Smulaon wh a Dealed Chemsry Based Progress Varable Lbrary Approach Conens Inroducon Approach Resuls Conclusons 2 Inroducon New Combuson Model- PVM-MF New Legslaons

More information

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class

More information

Tight results for Next Fit and Worst Fit with resource augmentation

Tight results for Next Fit and Worst Fit with resource augmentation Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of

More information

e-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov

e-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov June 7 e-ournal Relably: Theory& Applcaons No (Vol. CONFIDENCE INTERVALS ASSOCIATED WITH PERFORMANCE ANALYSIS OF SYMMETRIC LARGE CLOSED CLIENT/SERVER COMPUTER NETWORKS Absrac Vyacheslav Abramov School

More information

Lecture 18: The Laplace Transform (See Sections and 14.7 in Boas)

Lecture 18: The Laplace Transform (See Sections and 14.7 in Boas) Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on

More information

Tools for Analysis of Accelerated Life and Degradation Test Data

Tools for Analysis of Accelerated Life and Degradation Test Data Acceleraed Sress Tesng and Relably Tools for Analyss of Acceleraed Lfe and Degradaon Tes Daa Presened by: Reuel Smh Unversy of Maryland College Park smhrc@umd.edu Sepember-5-6 Sepember 28-30 206, Pensacola

More information

Polymerization Technology Laboratory Course

Polymerization Technology Laboratory Course Prakkum Polymer Scence/Polymersaonsechnk Versuch Resdence Tme Dsrbuon Polymerzaon Technology Laboraory Course Resdence Tme Dsrbuon of Chemcal Reacors If molecules or elemens of a flud are akng dfferen

More information

2.1 Constitutive Theory

2.1 Constitutive Theory Secon.. Consuve Theory.. Consuve Equaons Governng Equaons The equaons governng he behavour of maerals are (n he spaal form) dρ v & ρ + ρdv v = + ρ = Conservaon of Mass (..a) d x σ j dv dvσ + b = ρ v& +

More information

Hidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University

Hidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden

More information

New M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study)

New M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study) Inernaonal Mahemacal Forum, Vol. 8, 3, no., 7 - HIKARI Ld, www.m-hkar.com hp://dx.do.org/.988/mf.3.3488 New M-Esmaor Objecve Funcon n Smulaneous Equaons Model (A Comparave Sudy) Ahmed H. Youssef Professor

More information

Bernoulli process with 282 ky periodicity is detected in the R-N reversals of the earth s magnetic field

Bernoulli process with 282 ky periodicity is detected in the R-N reversals of the earth s magnetic field Submed o: Suden Essay Awards n Magnecs Bernoull process wh 8 ky perodcy s deeced n he R-N reversals of he earh s magnec feld Jozsef Gara Deparmen of Earh Scences Florda Inernaonal Unversy Unversy Park,

More information

EEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment

EEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N

More information

Efficient Asynchronous Channel Hopping Design for Cognitive Radio Networks

Efficient Asynchronous Channel Hopping Design for Cognitive Radio Networks Effcen Asynchronous Channel Hoppng Desgn for Cognve Rado Neworks Chh-Mn Chao, Chen-Yu Hsu, and Yun-ng Lng Absrac In a cognve rado nework (CRN), a necessary condon for nodes o communcae wh each oher s ha

More information

Increasing the Probablility of Timely and Correct Message Delivery in Road Side Unit Based Vehicular Communcation

Increasing the Probablility of Timely and Correct Message Delivery in Road Side Unit Based Vehicular Communcation Halmsad Unversy For he Developmen of Organsaons Producs and Qualy of Lfe. Increasng he Probablly of Tmely and Correc Message Delvery n Road Sde Un Based Vehcular Communcaon Magnus Jonsson Krsna Kuner and

More information

M. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria

M. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria IOSR Journal of Mahemacs (IOSR-JM e-issn: 78-578, p-issn: 9-765X. Volume 0, Issue 4 Ver. IV (Jul-Aug. 04, PP 40-44 Mulple SolonSoluons for a (+-dmensonalhroa-sasuma shallow waer wave equaon UsngPanlevé-Bӓclund

More information

Online Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading

Online Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng

More information

Dynamic Team Decision Theory

Dynamic Team Decision Theory Dynamc Team Decson Theory EECS 558 Proec Repor Shruvandana Sharma and Davd Shuman December, 005 I. Inroducon Whle he sochasc conrol problem feaures one decson maker acng over me, many complex conrolled

More information

P R = P 0. The system is shown on the next figure:

P R = P 0. The system is shown on the next figure: TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple one-dmensonal, one-phase flow equaons As an nroducon o reservor smulaon, we wll revew he smples

More information

[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5

[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5 TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres

More information

12d Model. Civil and Surveying Software. Drainage Analysis Module Detention/Retention Basins. Owen Thornton BE (Mech), 12d Model Programmer

12d Model. Civil and Surveying Software. Drainage Analysis Module Detention/Retention Basins. Owen Thornton BE (Mech), 12d Model Programmer d Model Cvl and Surveyng Soware Dranage Analyss Module Deenon/Reenon Basns Owen Thornon BE (Mech), d Model Programmer owen.hornon@d.com 4 January 007 Revsed: 04 Aprl 007 9 February 008 (8Cp) Ths documen

More information

Parameter Estimation of Three-Phase Induction Motor by Using Genetic Algorithm

Parameter Estimation of Three-Phase Induction Motor by Using Genetic Algorithm 360 Journal of Elecrcal Engneerng & Technology Vol. 4, o. 3, pp. 360~364, 009 Parameer Esmaon of Three-Phase Inducon Moor by Usng Genec Algorhm Seesa Jangj and Panhep Laohacha* Absrac Ths paper suggess

More information

Lecture 11 SVM cont

Lecture 11 SVM cont Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc

More information

On computing differential transform of nonlinear non-autonomous functions and its applications

On computing differential transform of nonlinear non-autonomous functions and its applications On compung dfferenal ransform of nonlnear non-auonomous funcons and s applcaons Essam. R. El-Zahar, and Abdelhalm Ebad Deparmen of Mahemacs, Faculy of Scences and Humanes, Prnce Saam Bn Abdulazz Unversy,

More information

SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β

SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β SARAJEVO JOURNAL OF MATHEMATICS Vol.3 (15) (2007), 137 143 SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β M. A. K. BAIG AND RAYEES AHMAD DAR Absrac. In hs paper, we propose

More information

Graduate Macroeconomics 2 Problem set 5. - Solutions

Graduate Macroeconomics 2 Problem set 5. - Solutions Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K

More information

Attribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method GAO Jing1,a, Ma Hui1, Han Zhidong2,b

Attribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method GAO Jing1,a, Ma Hui1, Han Zhidong2,b Inernaonal Indusral Informacs and Compuer Engneerng Conference (IIICEC 05) Arbue educon Algorhm Based on Dscernbly Marx wh Algebrac Mehod GAO Jng,a, Ma Hu, Han Zhdong,b Informaon School, Capal Unversy

More information

The Dynamic Programming Models for Inventory Control System with Time-varying Demand

The Dynamic Programming Models for Inventory Control System with Time-varying Demand The Dynamc Programmng Models for Invenory Conrol Sysem wh Tme-varyng Demand Truong Hong Trnh (Correspondng auhor) The Unversy of Danang, Unversy of Economcs, Venam Tel: 84-236-352-5459 E-mal: rnh.h@due.edu.vn

More information

A NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION

A NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION S19 A NEW TECHNIQUE FOR SOLVING THE 1-D BURGERS EQUATION by Xaojun YANG a,b, Yugu YANG a*, Carlo CATTANI c, and Mngzheng ZHU b a Sae Key Laboraory for Geomechancs and Deep Underground Engneerng, Chna Unversy

More information

Clustering (Bishop ch 9)

Clustering (Bishop ch 9) Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure

More information

A Novel Iron Loss Reduction Technique for Distribution Transformers. Based on a Combined Genetic Algorithm - Neural Network Approach

A Novel Iron Loss Reduction Technique for Distribution Transformers. Based on a Combined Genetic Algorithm - Neural Network Approach A Novel Iron Loss Reducon Technque for Dsrbuon Transformers Based on a Combned Genec Algorhm - Neural Nework Approach Palvos S. Georglaks Nkolaos D. Doulams Anasasos D. Doulams Nkos D. Hazargyrou and Sefanos

More information

Analysis And Evaluation of Econometric Time Series Models: Dynamic Transfer Function Approach

Analysis And Evaluation of Econometric Time Series Models: Dynamic Transfer Function Approach 1 Appeared n Proceedng of he 62 h Annual Sesson of he SLAAS (2006) pp 96. Analyss And Evaluaon of Economerc Tme Seres Models: Dynamc Transfer Funcon Approach T.M.J.A.COORAY Deparmen of Mahemacs Unversy

More information

Short-Term Load Forecasting Using PSO-Based Phase Space Neural Networks

Short-Term Load Forecasting Using PSO-Based Phase Space Neural Networks Proceedngs of he 5h WSEAS In. Conf. on SIMULATION, MODELING AND OPTIMIZATION, Corfu, Greece, Augus 7-9, 005 (pp78-83) Shor-Term Load Forecasng Usng PSO-Based Phase Space Neural Neworks Jang Chuanwen, Fang

More information

Networked Estimation with an Area-Triggered Transmission Method

Networked Estimation with an Area-Triggered Transmission Method Sensors 2008, 8, 897-909 sensors ISSN 1424-8220 2008 by MDPI www.mdp.org/sensors Full Paper Neworked Esmaon wh an Area-Trggered Transmsson Mehod Vnh Hao Nguyen and Young Soo Suh * Deparmen of Elecrcal

More information

Political Economy of Institutions and Development: Problem Set 2 Due Date: Thursday, March 15, 2019.

Political Economy of Institutions and Development: Problem Set 2 Due Date: Thursday, March 15, 2019. Polcal Economy of Insuons and Developmen: 14.773 Problem Se 2 Due Dae: Thursday, March 15, 2019. Please answer Quesons 1, 2 and 3. Queson 1 Consder an nfne-horzon dynamc game beween wo groups, an ele and

More information

Extracting Duration Facts in Qualitative Simulation using Comparison Calculus

Extracting Duration Facts in Qualitative Simulation using Comparison Calculus Exracng Duraon Facs n Qualave Smulaon usng Comparson Calculus Tolga Könk 1 and A. C. Cem Say 2 1: konk@umch.edu Compuer Scence and Engneerng ATL., Unv. Mchgan, 1101 Beal Ave., Ann Arbor, 48105-2106 MI,

More information

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations. Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample

More information

DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL

DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA

More information

Testing a new idea to solve the P = NP problem with mathematical induction

Testing a new idea to solve the P = NP problem with mathematical induction Tesng a new dea o solve he P = NP problem wh mahemacal nducon Bacground P and NP are wo classes (ses) of languages n Compuer Scence An open problem s wheher P = NP Ths paper ess a new dea o compare he

More information

Neural Networks-Based Time Series Prediction Using Long and Short Term Dependence in the Learning Process

Neural Networks-Based Time Series Prediction Using Long and Short Term Dependence in the Learning Process Neural Neworks-Based Tme Seres Predcon Usng Long and Shor Term Dependence n he Learnng Process J. Puchea, D. Paño and B. Kuchen, Absrac In hs work a feedforward neural neworksbased nonlnear auoregresson

More information

Modélisation de la détérioration basée sur les données de surveillance conditionnelle et estimation de la durée de vie résiduelle

Modélisation de la détérioration basée sur les données de surveillance conditionnelle et estimation de la durée de vie résiduelle Modélsaon de la dééroraon basée sur les données de survellance condonnelle e esmaon de la durée de ve résduelle T. T. Le, C. Bérenguer, F. Chaelan Unv. Grenoble Alpes, GIPSA-lab, F-38000 Grenoble, France

More information

Notes on the stability of dynamic systems and the use of Eigen Values.

Notes on the stability of dynamic systems and the use of Eigen Values. Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon

More information

Econ107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)

Econ107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6) Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen

More information

Anisotropic Behaviors and Its Application on Sheet Metal Stamping Processes

Anisotropic Behaviors and Its Application on Sheet Metal Stamping Processes Ansoropc Behavors and Is Applcaon on Shee Meal Sampng Processes Welong Hu ETA-Engneerng Technology Assocaes, Inc. 33 E. Maple oad, Sue 00 Troy, MI 48083 USA 48-79-300 whu@ea.com Jeanne He ETA-Engneerng

More information

A Novel Object Detection Method Using Gaussian Mixture Codebook Model of RGB-D Information

A Novel Object Detection Method Using Gaussian Mixture Codebook Model of RGB-D Information A Novel Objec Deecon Mehod Usng Gaussan Mxure Codebook Model of RGB-D Informaon Lujang LIU 1, Gaopeng ZHAO *,1, Yumng BO 1 1 School of Auomaon, Nanjng Unversy of Scence and Technology, Nanjng, Jangsu 10094,

More information

Math 128b Project. Jude Yuen

Math 128b Project. Jude Yuen Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally

More information

Sampling Coordination of Business Surveys Conducted by Insee

Sampling Coordination of Business Surveys Conducted by Insee Samplng Coordnaon of Busness Surveys Conduced by Insee Faben Guggemos 1, Olver Sauory 1 1 Insee, Busness Sascs Drecorae 18 boulevard Adolphe Pnard, 75675 Pars cedex 14, France Absrac The mehod presenly

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu

More information

Fuzzy Set Theory in Modeling Uncertainty Data. via Interpolation Rational Bezier Surface Function

Fuzzy Set Theory in Modeling Uncertainty Data. via Interpolation Rational Bezier Surface Function Appled Mahemacal Scences, Vol. 7, 013, no. 45, 9 38 HIKARI Ld, www.m-hkar.com Fuzzy Se Theory n Modelng Uncerany Daa va Inerpolaon Raonal Bezer Surface Funcon Rozam Zakara Deparmen of Mahemacs, Faculy

More information

Optimal environmental charges under imperfect compliance

Optimal environmental charges under imperfect compliance ISSN 1 746-7233, England, UK World Journal of Modellng and Smulaon Vol. 4 (28) No. 2, pp. 131-139 Opmal envronmenal charges under mperfec complance Dajn Lu 1, Ya Wang 2 Tazhou Insue of Scence and Technology,

More information

An Optimal Control Approach to the Multi-agent Persistent Monitoring Problem

An Optimal Control Approach to the Multi-agent Persistent Monitoring Problem An Opmal Conrol Approach o he Mul-agen Perssen Monorng Problem Chrsos.G. Cassandras, Xuchao Ln and Xu Chu Dng Dvson of Sysems Engneerng and Cener for Informaon and Sysems Engneerng Boson Unversy, cgc@bu.edu,

More information

Introduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms

Introduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably

More information

Handout # 6 (MEEN 617) Numerical Integration to Find Time Response of SDOF mechanical system Y X (2) and write EOM (1) as two first-order Eqs.

Handout # 6 (MEEN 617) Numerical Integration to Find Time Response of SDOF mechanical system Y X (2) and write EOM (1) as two first-order Eqs. Handou # 6 (MEEN 67) Numercal Inegraon o Fnd Tme Response of SDOF mechancal sysem Sae Space Mehod The EOM for a lnear sysem s M X DX K X F() () X X X X V wh nal condons, a 0 0 ; 0 Defne he followng varables,

More information

A Novel Efficient Stopping Criterion for BICM-ID System

A Novel Efficient Stopping Criterion for BICM-ID System A Novel Effcen Soppng Creron for BICM-ID Sysem Xao Yng, L Janpng Communcaon Unversy of Chna Absrac Ths paper devses a novel effcen soppng creron for b-nerleaved coded modulaon wh erave decodng (BICM-ID)

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as

More information