WIRELESS sensor networks are created by networks

Size: px
Start display at page:

Download "WIRELESS sensor networks are created by networks"

Transcription

1 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 8, NO. 7, SEPTEMBER Hressig Bttery Reovery Effet i Wireless Sesor Networks: Experimets d Alysis Chi-Ki Chu, Member, IEEE, Fei Qi, Smir Syed, Muhmmd Husi Whb, Yg Yg, Seior Member, IEEE Abstrt My pplitios of wireless sesor etworks rely o btteries. But most btteries re ot simple eergy reservoirs, d exhibit bttery reovery effet. Tht is, the deliverble eergy i bttery be self-repleished, if left idlig for suffiiet time. As vible pproh for eergy optimistio, we mde severl otributios towrds hressig bttery reovery effet i sesor etworks. ) We empirilly exmie the gi of bttery rutime of sesor devies due to bttery reovery effet, d ffirm its sigifit beefit i sesor etworks. We lso observe sturtio threshold, beyod whih more idle time will otribute oly little to bttery reovery. ) Bsed o our experimets, we propose Mrkov hi model to pture bttery reovery osiderig sturtio threshold d rdom sesig tivities, by whih we study the effetiveess of duty ylig d bufferig. ) We devise simple distributed duty yle sheme to tke dvtge of bttery reovery usig pseudo-rdom sequees, d lyse its trde-off betwee the idued ltey of dt delivery d duty yle rtes. Idex Terms Wireless Sesor Networks, Eergy Optimistio, Bttery Reovery Effet, Duty Cyle. I. INTRODUCTION WIRELESS sesor etworks re reted by etworks of smll devies, itegrted with tiy embedded proessors, rdio trseivers, d MEMS miro-sesors. My pplitios of sesor etworks require btteries s eergy soure for the sesors. However, smll form ftors of devies ofte prohibit the uses of lrger pity btteries. Also, dho deploymet of sesor etworks d the ioveiee of bttery reolletio usully ostri frequet replemets of o-bord btteries. Hee, the desig of eergy-effiiet protools hs beome ruil topi i sesor etworkig. There re my studies o eergy optimiztio tht regrd btteries s idel eergy reservoirs, where eergy is dried t ostt dishrgig voltge, d be hlted d resumed ytime t the sme voltge. However, most ommeril btteries re govered by omplex itrisi hemil retios Musript reeived My 9; revised 6 Februry. C.-K. Chu ws supported by Crouher Foudtio fellowship. Y. Yg ws prtilly supported by CONET uder FP7 with otrt umber FP7-7-- d by the Ntiol Nturl Siee Foudtio of Chi (NSFC) uder the grt 69. C.-K. Chu is with Computer Lbortory, Uiversity of Cmbridge, UK (e-mil: hi-ki.hu@l.m..uk). F. Qi d S. Syed re with Eletroi & Eletril Egieerig Deprtmet, Uiversity College Lodo, UK (e-mil: {f.qi,s.syed}@ee.ul..uk). M. H. Whb is with the Computer Siee Deprtmet, Uiversity College Lodo (e-mil: h.whb@s.ul..uk). Y. Yg is with Shghi Reserh Ceter for Wireless Commuitios (WiCO), SIMIT, Chiese Ademy of Siees, Chi (e-mil: yg.yg@shrw.org). Digitl Objet Idetifier.9/JSAC //$. IEEE to produe eergy. Suh hemil retios re kow by hemil egieers to be depedet o vriety of evirometl ftors d opertiol prmeters (e.g., dishrge durtio, urret d history) [], []. Prtiulrly, there is subtle pheomeo lled bttery reovery effet, whih refers to the proess tht the tive hemil substes i bttery be self-repleished if left idlig for suffiiet period of time. I this pper, we re motivted to exploit bttery reovery effet to optimise the eergy effiiey of wireless sesor etworks. There re severl immedite questios. ) Is bttery reovery effet suffiietly sigifit to exted bttery rutime? ) If so, is there simple but effetive pproh to tke dvtge of bttery reovery effet i sesor etworks? ) Suh pproh my ievitbly ffet the performe of sesor etworks. The how will the idued performe (e.g., ltey of dt delivery) be ffeted? To ddress these questios, i this pper we first empirilly exmie the gi of bttery rutime due to bttery reovery effet, through test-bed experimets o ommeril sesors. Sie rdio trseivers osume sigifit portio of eergy (eve i listeig mode), s ompred to proessig d sesig tivities, we espeilly mesure the bttery rutime i the presee of duty yled rdio opertios uder both determiisti d rdomised shedules. We foud tht there is up to gi of %-% to the ormlised bttery rutime betwee duty yled d otiuous rdio opertios. We the empirilly study the hrteristis of bttery reovery effet, with respet to differet duty yle shedules. We observe tht there exists sturtio threshold, beyod whih more oseutive idle time will otribute oly little to bttery reovery. The rmifitio to sesor etworkig is tht if we refully djust the sleep time period of bttery before rehig the sturtio threshold, we mximise bttery reovery without exerbtig the ltey of dt delivery. Next, we model the proess of bttery reovery osiderig sturtio threshold d rdom sesig tivities. We study oe-hop sesor etworks by Mrkov hi model, d ivestigte the effetiveess of eergy optimistio by duty ylig d bufferig. We obti severl lytil isights for the bttery rutime, orroborted by simultio. We the exted our study to multi-hop sesor etworks, where eh sesor t s rely to forwrd the sesig dt for other sesors to the sik. I suh settig, there Normlised bttery rutime is the mesured bttery rutime multiplied by the duty yle rte.

2 CHAU et l.: HARNESSING BATTERY RECOVERY EFFECT IN WIRELESS SENSOR NETWORKS: EXPERIMENTS AND ANALYSIS requires oorditio sheme mog the duty yled sesors, suh tht eh sesor disover the pproprite timeslot to trsmit dt without wstig eergy to probe the vilbility of their relys. We dpt distributed rdomised oorditio sheme from [], d exted it to tke dvtge of bttery reovery. I our sheme, eh sesor ifers the rdom duty yle shedule of the rely bsed o pseudo-rdom sequee. The rdom duty yle shedule is set to let sesor to sleep for period of time withi the sturtio threshold, whe it hs bee tive for erti period of time. Through simultio, we show tht our bttery-wre duty yle sheme sigifitly exted the bttery rutime. Filly, sie there is ievitble trde-off betwee the ltey of dt delivery d the eergy effiiey i duty yled sesor etworks, to shed light o the performe uder ostried eergy budgets we lyse d boud the ltey of our bttery-wre duty yle sheme i multi-hop sesor etworks (d lso speifilly i lttie etworks). The lysis is bsed o the results i our previous work []. I summry, our otributios re threefold: ) I Se. III, we provide the experimetl evidee o the sigifit gi of bttery rutime by bttery reovery effet, d report tht the gi is hrterised by sturtio threshold. ) I Se. IV, we model bttery reovery d study eergy optimistio by duty ylig d bufferig, i the presee of sturtio threshold d rdom sesig tivities. ) We preset distributed duty yle sheme tht tkes dvtge of bttery reovery usig pseudo-rdom sequee i Se. V, d study the idued ltey of dt delivery i Se. VI. We lso preset the bkgroud d relted work i Se. II, d disuss some issues of our work i Se. VII. Beuse of spe ostrit, the proofs of theorems re deferred to []. II. BACKGROUND AND RELATED WORK A. Bttery Models There re my studies o the performe of btteries i hemil egieerig []. I etworkig, [6] rried out empiril study to mesure the performe of btterypowered sesors, but did ot exmie the sturtio threshold. Although bttery osumptio hs bee modelled extesively i etworkig, my extt models over-simplified the relisti bttery hrteristis (e.g., llowig ulimited bttery reovery). There re two mi models tht osider relisti bttery hrteristis. First, the kieti bttery models [7], [8] ttempt to model the detiled hemil retios d diffusio proess betwee the eletrode d eletrolyte i bttery through set of prtil differetil equtios. These models im to fully pture the o-lier dymis i bttery. However, these models re less trtble, d differet form ftors of btteries sigifitly ffet the ury of the models. Seod, there re stohsti bttery models [9] [] tht pture the bttery dymis usig rdomised Mrkovi models. But most of them did ot osider the effet of idle time period. While [] osiders idle time period i embedded systems, it did ot ddress the performe i sesor etworks. We remrk tht while ll these stohsti bttery models ttempt to imitte the kieti bttery model with less omplexity, the uses of rdomised bttery reovery is differet from the determiisti kieti bttery models. Moreover, these models re lso less trtble, with few lytil isights provided. I this pper, we preset more lysble Mrkov hi model tht simplifies the stohsti bttery models [9], [], []. Prtiulrly, our model uses determiisti bttery reovery, yet is ble to pture relisti bttery hrteristis, suh s limited bttery reovery d the effet of idle time period. More importtly, severl lytil isights for relisti bttery behviour be derived from our model. B. Eergy Mgemet d Optimistio There re my studies o eergy optimiztio i sesor etworks, iludig topology mgemet d etwork lyer optimistio. Prtiulrly relevt to our work re those bsed o MAC lyer, whih im to redue redudt rdio opertios i MAC protools: ) idle listeig (keepig rdio o eve whe o reeptio), ) overherig (reeptio of messge ot iteded for the reeiver), d ) protool overhed (redudt heders or sigllig messges). Exmples ilude S- MAC, SEEDEX, O-MAC, RI-MAC [] [6]. Listeig d reeptio osume sigifit eergy i wireless sesors. This pper redues idle listeig d overherig by duty yle bsed o pseudo-rdom sequee [] d bttery reovery effet. There re other MAC protools tht osider bttery hrteristis. BAMAC d Bel-MAC [7], [8] relied o exhgig dymi bttery stte iformtio to optimise the use of btteries mog sesors. But suh iformtio ot be obtied without relyig o olie mesuremet of bttery. However, our ide of exploitig sturtio threshold does ot rely o olie mesuremet. Also, [9] osidered bttery reovery i shedulig d routig, but did ot iorporte the iformtio of sturtio threshold, ulike our distributed oorditio sheme mog the duty yled sesors. III. EXPERIMENTAL RESULTS I this setio, we preset the experimetl results from our sesor etwork test-bed to show the sigifie of bttery reovery effet. These experimets were rried out o two types of ommeril sesors from Crossbow: TelosB d Imote. Both re populr models for wireless sesor etworkig. TelosB is osisted of MSP s MCU d CC s rdio trseiver. Imote is osisted of PXA7 s CPU d CC s rdio trseiver. TelosB llows more eergy-svig settigs with low eergy osumptio, wheres Imote is equipped with more omputtio bility with high eergy osumptio. Here, we mily study TelosB. I the experimets, we used logue-digitl oversio (ADC) iterfe rd d softwre LbVIEW to mesure d reord the dishrge profiles of ommuitig sesors. Eh sesor ws powered by stdrd AAA NiMH 6 mah btteries (TelosB hs two d Imote hs three). Whe the supply voltge of the bttery is lower th erti threshold (lled stop voltge), the devie o loger operte, whih

3 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 8, NO. 7, SEPTEMBER Voltge V Ative:s,Sleep:s Ative:s,Sleep:s Ative:s,Sleep:s Ative:s,Sleep:8s Ative:s,Sleep:6s Ative:s,Sleep:s. Ative:s,Sleep:s Alwys Ative Normlised Bttery Rutime mi. 6 8 Fig.. The dishrge profiles of TelosB i determiisti duty yle shedules of rdio trseiver w.r.t. differet sleep time periods. Gi Sleep Time Period s 6 8 Fig.. The gi of ormlised bttery rutime of Fig., s ompred to the otiuous (lwys tive) rdio opertio. Voltge V.6.. Ative:9s,Sleep:s. Ative:6s,Sleep:s Ative:s,Sleep:s. Ative:s,Sleep:s Ative:7s,Sleep:s. Ative:6s,Sleep:s. Ative:s,Sleep:s Ative:s,Sleep:s. Ative:s,Sleep:s Alwys Ative Normlised Bttery Rutime mi. Fig.. The dishrge profiles of TelosB i determiisti duty yle shedules of rdio trseiver w.r.t. differet tive time periods. Voltge (V). Gi Ative Time Period s Fig.. The gi of ormlised bttery rutime of Fig., s ompred to the otiuous (lwys tive) rdio opertio. Gi (%).. Ative:mi,Sleep:.67mi Ative:mi,Sleep:.mi Alwys Ative. Normlised Bttery Rutime. Fig.. The dishrge profiles of Imote i determiisti duty yle shedules of rdio trseiver w.r.t. differet sleep time periods. Sleep Time Period (mi) Fig. 6. The gi of ormlised bttery rutime of Fig., s ompred to the otiuous (lwys tive) rdio opertio. is osidered s ompletely dishrged. We set differet duty yle rte o the sesors by puttig the rdio trseiver i tive d sleep modes periodilly, d mesure the idued bttery rutime. The duty yle rte is defied s the frtio of tive time periods, d the ormlised bttery rutime is the mesured bttery rutime multiplied by the duty yle rte. First, we tested o determiisti duty yle shedules. Figs. d show the dishrge profiles of the trsmitter i ormlised bttery rutime for TelosB d Fig. for Imote. Figs.,, show the respetive gi of ormlised bttery rutime, ompred to the otiuous rdio opertio. The key observtios from the experimets re: ) There re ler sigs of bttery reovery effet. With the sme tive time period, loger sleep time period Note tht beuse TelosB hs muh loger bttery rutime, we used lower smplig rte to filitte dt loggig, whih gives ppretly smooth profile urve. However, the dishrge profiles should be s rgged s the oes of Imote i Fig..

4 CHAU et l.: HARNESSING BATTERY RECOVERY EFFECT IN WIRELESS SENSOR NETWORKS: EXPERIMENTS AND ANALYSIS Curret A. Fig. 7. We use the sme pseudo-rdom sequee to geerte the rdom duty yle shedules for both trsmitter d reeiver. This is spshot of the urret profile of pir of trsmitter-reeiver. The higher urret idites the periods of higher eergy osumptio i tive slots. idues loger ormlised bttery rutime, d hee lrger deliverble eergy of bttery. ) The effet of sleep time period is o-lier. It ppers tht sleep time period more th erti threshold will otribute muh less to bttery reovery, whih we ll sturtio threshold. ) The effet of tive time period is lso o-lier. Very smll tive time period ppers to hve lrge gi of ormlised bttery rutime (up to % i TelosB for tive/sleep time s se/ se). ) Eve the sesor is i sleep mode o rdio trseiver, there is still eergy osumptio due to the timer d other proessig tivities. TelosB osumes 6.μA i sleep mode, wheres Imote osumes.8ma. We observe tht bttery reovery tke ple uder low bttery osumptio, d the impt of bkgroud osumptio is ot substtil to bttery reovery. Next, we study the gi of rdomised duty yle shedules. We used the sme pseudo-rdom sequee to geerte the rdom duty yle shedules for both trsmitter d reeiver (see Fig. 7 for spshot). Fig. 8 shows two dishrge profiles of trsmitter d reeiver both with the sme duty yle rte s. (oe sets eh rdom slot s. se, other s se). We observe tht the gis of ormlised bttery rutime betwee the -se d.-se ses re 7% d % for trsmitter d reeiver respetively. Note tht the ormlised bttery rutime of -se rdom slots is omprble to the determiisti duty yle shedule (tive d sleep time period s se) i Fig., while the oe of.-se rdom slots is omprble to the lwys tive shedule. The implitios re ) the gi of bttery rutime is determied by how the tive d sleep time periods lst, rther by the duty yle rte loe, d ) the rdomised duty yle shedules hve omprble gi s the determiisti duty yle shedules. Note tht the tul bttery rutime is muh loger th the ormlised bttery rutime (whih is multiplied by the duty yle rte). Hee, duty yle shedules ot oly prolog the etwork lifetime by spedig time i sleep mode, but lso irese the deliverble eergy by llowig bttery reovery. Although our mesuremet of the gis of bttery reovery my differ i other evirometl settigs (e.g., differet temperture), the isights reveled by our experimets will still be useful to the modellig d optimistio of bttery reovery i sesor etworks. I geerl, uder pulsed (duty yle) dishrge profile, bttery is ble to reover hrge durig idle time periods, whih effetively ireses the deliverble eergy of the bttery. But the effetiveess of bttery reovery is ritilly determied by the tive d sleep time periods. The presee of sturtio threshold ppers uiversl i differet duty yle shedules. We evisio tht oe Voltge V.6... Trsmitter: se Rdom Slots. Reeiver: se Rdom Slots. Trsmitter:.se Rdom Slots. Reeiver:.se Rdom Slots. Normlised Bttery Rutime mi. 6 8 Fig. 8. Two dishrge profiles pir of trsmitter-reeiver of TelosB i pseudo-rdom duty yle shedules of rdio trseiver (duty yle rte s.): oe sets eh rdom slot s. se, while other sets eh rdom slot s se. evlute the sturtio threshold (i some itervls) for erti eviromets i -priori mer through experimets. Next, we desig etwork protools tht exploit bttery reovery by tkig the estimted sturtio threshold s prmeter. IV. MODEL OF BATTERY RECOVERY Our experimets orroborted the presee of bttery reovery effet d sturtio threshold. It is useful to employ simple model to pture these essetil hrteristis qulittively, whih ebles further lysis d lrger sle simultio o vrious bttery osumptio ptters. Hee, we re motivted to preset simplified Mrkov hi model, where time is disretised s slots, to pture the bttery osumptio by trsmittig rdom sesig dt. I this model, we ssume tht the sesig dt rrivig to sesor i the previous slots, will be trsmitted i the urret slot. The stte of bttery is hrterised by tuple,, t, where,, t re o-egtive itegers. is the theoretil pity determied by the mout of hemils i the eletrode d eletrolyte, is the omil pity determied by the mout of vilble tive hemils for hemil retios i the bttery, d t is the umber of idle slots sie lst dishrgig. The use of, follows populr bttery model desribed i [9], []. But we itrodue t i this pper, s relted to the sturtio threshold. I the dishrgig proess, both d re deresig. The mout of vilble tive hemils ostris the eergy of bttery deliver, despite the presee of uused hemils i the bttery. Thus, we require. But whe the bttery stops dishrgig, there is reovery proess, s diffusio proess betwee eletrode d eletrolyte to repleish vilble tive hemils, whih effetively ireses (whih however ot irese theoretil pity ). There is sturtio threshold t st for t, suh tht more oseutive idle slots t > t st will ot otribute more reovery. Here, we ormlise the uit of d, suh tht t eh idle slot, be reovered by oly oe uit. I this setio, we study this bttery model i oe-hop sesor etwork, where the multi-hop study will deferred to the ext setio. Eh sesor is lef ode, whose tsk to trsmit its deteted sesig dt to the sik. We ssume the sik is

5 6 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 8, NO. 7, SEPTEMBER lwys tive, but the sesor my follow duty yle shedule o its rdio opertios. Ad the sesor is simple trsmitter, requirig o feedbk from the sik. For geerlity, we ssume tht sesig dt rrivl proess follows Poisso distributio. The osumptio of bttery is proportiol to the mout of sesig dt for trsmissio to the sik i slot. Next, we study two serios: ) the lwys-tive se where the dt is trsmitted i the followig slot, d ) the duty ylig se where the dt is buffered for erti period before trsmissio. A. Alwys-tive Cse without Duty Cylig We model the serio without duty yle s Mrkov hi M bt with the set of sttes s: { },, t :,, t re o-egtive itegers, d,,t is bsorptio stte tht will ot trsit to other sttes, orrespodig to omplete dishrged bttery. Due to Poisso rrivl of dt, the trsitio probbilities from sttes of re obtied s: ) Dishrgig:,, t -k, -k, for k d -k, d the trsitio probbility is p λ po(k) λk e -λ k!,whereλis the verge Poisso rrivl rte of dt i slot. b) Completely Dishrged: b,, t,-, d the trsitio probbility is p λ po (k) = k= k= λ k e -λ k!. Tht is, whe osumptio exeeds omil pity, the bttery will be ompletely dishrged. ) Idlig with Reoverig:,, t +,,t+ for + d t < t st, d the trsitio probbility is p λ po () = e-λ. Tht is, there is reovery whe there is o bttery osumptio, d the oseutive idle durtio is lesser th the sturtio threshold t st. d) Idlig without Reoverig:,, t d,, t+ for <+ or t t st, d the trsitio probbility is p λ po () = e-λ. Tht is, there is o reovery whe the omil pity rehes the theoretil pity, or the oseutive idle durtio rehes the sturtio threshold t st. e) Otherwise, the trsitio probbility for ll other pirs of sttes is. I Figs. 9-, we illustrte the stte trsitios i grphil mer, with t st =. We remrk tht there re severl simplifitios i this model. First, we ssume the sturtio threshold t st is idepedet of d. Seod, the reovery proess is the sme for y stte below the sturtio threshold. While these ssumptios ot reflet the omplete o-lier dymis i rel btteries, we ited to pture the essee of geeri bttery behviour. With the miimum umber of prmeters (oly t st ), our model does ot rely o experimets to determie further prmeters s i more omplete model tht otherwise ritilly deped o the types of btteries d other evirometl ftors. Moreover, our model ebles us to obti simple lytil isights for hressig bttery reovery. Let W t m() be the expeted bttery rutime strtig t stte, +m, t i Mrkov hi M bt (i.e., the expeted umber of slots bttery lst util rehig bsorptio stte of ompletely dishrged). By the defiitio of stte trsitios i M bt d the lierity of expeted vlues, it follows tht - W () =+ p λ po (k)w (-k), Wt () =W () () k= Tht is, if the osumptio is of k uits d k, the the expeted bttery rutime will be W (-k)+.otherwise, it will be ompletely dishrged d the expeted bttery rutime is. For m, Eq. () follows. Eqs. ()-() give reursive reltioship of W t m (). But i geerl, Wt m () ppers to hve o simple losed-form solutio. However, severl geerl lytil results be derived s follows. Theorem : The expeted bttery rutime is bouded by: W t m () +m- W m () λ + e -λ This upper boud is ituitive, beuse the bttery rutime should ot exeed Θ(+m) =Θ(). Ideed, the upper boud is tight s show s follows. Theorem : Whe λ is smll or is lrge, for some ostts α, W +m m () λ + α We verified Theorems - for some speifi d m i Fig., where m =. We observe tht the upper boud is ideed tight whe λ is smll or is lrge. Theorem be regrded s pity of bttery rutime. We re iterested i the gp betwee the tul bttery rutime W m() d the pity of bttery rutime. Prtiulrly, we hrterise W m() whe m is lrge. Theorem : Cosiderig t st =, W m () lim m W m () = e λ e λ + e λ λ Theorem shows tht W m() = O() for fixed λ. However, Theorem shows tht the upper boud be O(m+). Therefore, there is gp with order s O(m+). This suggests tht there is lrge potetil for exploitig the udelivered eergy of bttery. Hee, we re motivted to mke use of duty ylig d bufferig to improve eergy effiiey by hressig bttery reovery. Other models (e.g., [9], [], []) ttempt to iorporte more prmeters, suh s omplex rdomised stte trsitios to pture o-lier bttery reovery behviour. However, these models pper ioveiet for lysis, d little lytil isights hve bee obtied.

6 CHAU et l.: HARNESSING BATTERY RECOVERY EFFECT IN WIRELESS SENSOR NETWORKS: EXPERIMENTS AND ANALYSIS 7 +p λ - W t m () = po ()Wt+ m- (+) + p λ po (k)w m (-k) if t < t st k= +p λ - po ()Wtst ()+ p λ po (k)w m (-k) if t = t st m k= () b t= d b t= b t= t= b d W () W () W () W () Fig. 9. Stte trsitios for Mrkov hi M bt t t =. Fig.. Stte trsitios for t =,whet st = B. Duty Cylig Cse with Bufferig I this setio, we lyse the effetiveess of duty ylig d bufferig o the bttery model. We osider simple strtegy tht the sesor will sleep for b buf slots, every time fter the bttery is osumed for trsmissios. Durig the sleep time periods, the sesig uit is still o, d the dt is olleted for bufferig withi the b buf slots. To tke the mximl dvtge of bttery reovery, we set b buf t st. To pture the bove buffered opertios, we defie Mrkov hi M buf, where eh stte is tuple,, b, db mes tht the bttery hs bee i buffered stte for b slots. If b +> b buf, the the buffer will ot hold y dt d proeed to immedite trsmissios. Thus, the set of sttes is: { },, b :,, b re o-egtive itegers, d We ext lyse the expeted bttery rutime of M buf i similr mer s M bt. However, the strightforwrd defiitios of stte trsitios of M buf pper rther itrtble (eve umerilly). For the ese of lysis, i the followig we defie the stte trsitios of M buf i simplified mer, suh tht the bttery osumptio is reorded durig the bufferig slots before tul trsmissios, d hee, the bttery rutime of M buf is smller th the tul bttery rutime. This still serves s lower boud for the tul bttery rutime, d does ot ffet the isights tht we obti. Now the trsitio probbilities of M buf re defied s: ) Dishrgig:,, -k, -k, for k d -k, d the trsitio probbility is p λ po (k) = λk e -λ k!. b ) Completely Dishrged:,, b b,-, d the trsitio probbility is p λ po(k) = k= k= λ k e -λ k!. ) Idlig: { +,, if + (reovery),,,, if <+ (o reovery) d the trsitio probbility is p λ po () = e-λ. d ) Bufferig: { -k+,-k, b,, b + if + (reovery) d -k, -k, b + if <+ (o reovery) for b b buf d -k, d the trsitio probbility is p λ po (k) = λk e -λ k!.wedefie b + b+(mod b buf +) (i.e., the umber of bufferig slots ireses by, util rehig b buf, d the proeed to trsmissios by settig b =). e ) Otherwise, the trsitio probbility for ll other pirs of sttes is. Note tht trsitio d ) is defied to pture bttery osumptio i the bufferig slots before tul trsmissios. I Figs. -, we illustrte the stte trsitios i grphil mer, with b buf =. Similrly, let B b m() be the expeted bttery rutime strtig t stte, +m, b i M buf. We obti: B b () =W () () For m, see Eq. (). Theorem : If b buf = t st, bufferig is lwys better: B b m() W t m() for y b b buf d t t st. Theorem ffirms the usefuless of duty ylig d bufferig. For more qutittive mesure, i Fig., we umerilly solve the solutios of Eqs. ()-() for speifi m d. We observe tht there is sigifit improvemet of the bttery rutime. We exmie the gi of usig duty ylig d bufferig i Fig., where we idetify the speifi s i Fig. tht mximise the differee betwee W () d B () for differet vlues of λ, b buf, t st. We observe tht the mximum gi is up to %. The effetiveess dereses s b buf d t st irese, beuse the lrger sturtio threshold implies more the likely bttery reovery is, d duty ylig d bufferig will ot improve too muh.

7 8 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 8, NO. 7, SEPTEMBER + - p λ B b m () = po (k)bb+ m- (-k+) if b buf b > k= +p λ - () po ()B m- (+) + p λ po (k)b m (-k) if b = k= b= b= b= b= b d d d B () B () B () b B () Fig.. Stte trsitios for Mrkov hi M buf t b =. Fig.. Stte trsitios for b =,wheb buf =. Bttery Rutime slots Upper Boud Duty Cylig Alwys Ative Λ. Mx Gi (%) t st = b buf = t st = b buf = t st = b buf = Λ. Λ.7 Λ. Bttery Rutime slots Upper Boud Duty Cylig Alwys Ative Λ.6 Λ.7 Λ.87 Λ 6 8 Fig.. Whe b buf = t st =, we plot of the upper boud +m- + λ, log with the bttery rutime of lwys-tive se e-λ W (), dthe duty ylig se B (). V. MULTI-HOP SENSOR NETWORKS I multi-hop sesor etworks, sesor ot oly trsmits, but lso listes d reeives from its eighbours. Sie listeig still osumes osiderble eergy, we re motivted to use duty yle to regulte rdio, suh tht i sleep mode the rdio is off, while i tive mode the rdio is o for ll opertios. As i Se. IV, this redue ueessry idle listeig d hress bttery reovery λ Fig.. The mximum gi of the duty ylig se is show gist the lwys-tive se over ll. We obti smooth urves usig movig verge. However, this lso retes problem of requirig oorditio sheme mog the duty yled sesors, suh tht eh sesor disover if its eighbour is tive. A simple sheme is to employ globl oorditor tht ssigs periodi/determiisti duty yle shedule to eh sesor i - priori mer suh tht ll sesors re provided the kowledge of duty yle shedules of their eighbours. However, this sheme suffers from serious slbility issue, d ot ope with the rpid hgig etwork topology due to d ho sesor deploymets. Oe my lso osider otetio-bsed pprohes, suh tht ll sesors re tive time periodilly t the sme time d oted for trsmissio opportuities (e.g., S-MAC). However, this iurs sigifit ollisios d overherig, osumig osiderble eergy. Aother pproh is to tur rdio off d o t eh slot idepedetly d rdomly. The, pkets oly be forwrded whe the trsmittig d reeivig sesors re both tive. This requires o globl oorditor, d is self-ofigurig, with redued ollisios d overherig. But rdom duty yle lso suffers from otrol problem sesor eeds to probe the vilbility of its eighbours. Here, we dpt distributed rdomised pproh from [], by whih eh sesor ifers the rdom duty yle shedule of

8 CHAU et l.: HARNESSING BATTERY RECOVERY EFFECT IN WIRELESS SENSOR NETWORKS: EXPERIMENTS AND ANALYSIS 9 the eighbours bsed o pseudo-rdom sequee. If the trsmitter kows the seed d yle positio of the pseudo-rdom sequee geertor used by the reeiver to geerte the rdom duty yle shedule, it determiistilly predit the tive shedules of the reeiver without probig. Pseudordom sequee hs bee used i other MAC protools (e.g., SEEDEX, O-MAC [], []) for reduig MAC overhed d overherig. Next, we modify pseudo-rdom duty yle to exploit the sturtio threshold of bttery reovery. A. Pseudo-Rdom Duty Cyle Sheme As i Se. IV, we ssume tht whe sesor swithes to sleep mode, oly the rdio trseiver is off, keepig the proessig d sesig uits o for sesig tivities. Hee, it will ot udermie the sesig futiolity of the sesor etwork. All sesors will buffer ll their outgoig dt util the slot whe their respetive reeivers re tive. There is uique sik i the etwork to ollet ll the dt. The pseudo-rdom duty yle sheme is s follows: ) At bootstrppig, the sesors exhge the seed, yle positio d duty yle rte (s the probbility threshold of slot if it is tive or sleep) of their pseudo-rdom sequee geertors with eighbours. At eh slot, sesor determies its stte (beig tive or sleep), d the sttes of ll its eighbours i the ext slot. ) To forwrd pkets, sesor will wit util there is tive eighbour o its shortest pth to the sik, d the trsmit the pkets with orrespodig reeiver ID i the heder. Uiform rdom tie-brekig is used if there re more th oe tive eighbour. The reeiver of the orrespodig ID will rry out the forwrdig of the pkets util rehig the sik. The dvtges of usig pseudo-rdom sequee re tht ) the tive shedules re essetilly uorrelted d rdom mog the sesors, reduig MAC ollisios d overherig; ) sesor dymilly djust its duty yle rte by hgig the probbility threshold of pseudo-rdom sequee geertor, d ) the tive shedules be omptly distributed i the etworks, represeted by the tuple of the seed, yle positio d duty yle rte. Like other syhroised MAC protools (e.g., S-MAC), pseudo-rdom duty yle requires syhroistio, whih will be ddressed i Se. VII. Ad we ssume the rrivl pket rte is ot high, d the ollisio of simulteous trsmitters is egligible. B. Bttery Reovery Awreess To exted the pseudo-rdom duty yle sheme to tke dvtge of bttery reovery, we propose simple sheme by fored sleep. Suppose tht sesor hs bee tive for more th w mx oseutive slots from the urret slot, the it must go to sleep for the ext b buf slots for some b buf t st. This llows suffiiet bttery reovery to improve the Note tht whe eve the sesor s ow pseudo-rdom duty yle shedule presribes the slot is to sleep, it will still be tive to trsmit dt to the tive eighbour. Eve the pket rte is moderte, idepedet rdom duty yle o sesors lredy ut dow the umber of potetil ollisios. Also, oe use stdrd MAC protool withi slot to solve the problem of ollisio. deliverble eergy of bttery. After b buf slots, the sesor deides its tive shedule ordig to its pseudo-rdom sequee geertor. We suppose tht w mx d b buf re kow to ll sesors. Eh sesor still predit its eighbours bttery-wre duty yle sheme ordigly. A typil settig will be w mx =d b buf = t st. C. Evlutios We defie the etwork lifetime s the expeted time tht there is relyig sesor ruig out of its bttery. Prtiulrly, we evlute the etwork lifetime i D lttie etwork, where we idex eh sesor s (i, j) by itegers i, j. There is lik betwee odes (i, j) d (i,j ),if( i-i =d j = j )or( j-j =d i = i ). Without loss of geerlity, we deote (, ) s the sik. We suppose tht eh sesor employs greedy forwrdig (i.e., forwrdig pkets to the eighbour tht is o the shortest pths to the sik d is tive i the ext erliest slot) d rdom tie-brekig whe there re more oe eligible eighbour. We ssume tht the duty yle rtes of ll sesors re the sme. I lttie etwork, the routig lgorithm proeeds s follows: ) For i, sesor(i, ) will forwrd to (i-, ), sthere is oly oe shortest pth. ) For i, j, (i, j) will rdomly forwrd to (i-,j) or (i, j-) with equl probbility. We employ the sme disrete bttery model s Se IV for eh sesor. We ssume tht trsmissio osumes the sme eergy s reeptio, d the sesig evets of ll sesors follow the idepedet Poisso distributio p λ po (k). We defer the study of orrelted sesig evets to the future work. I multi-hop sesor etwork, the Mrkov hi is diffiult to lyse. Hee, we rely o simultio to study the etwork lifetime. By simultio, we ompre the etwork lifetime of bttery-wre, pseudo-rdom duty yle shemes d simple lwys-tive se. To demostrte the effetiveess, we selet some typil prmeters, suh s the duty yle rte s., m = d =. Fig. show tht the gi of pseudo-rdom duty yle sheme is up to %, while the gi of bttery-wre duty yle sheme is up to %. Ad the etwork lifetime of bttery-wre duty yle sheme is geerlly loger th the oe of pseudo-rdom duty yle sheme. VI. LATENCY ANALYSIS Iresig the sleep time period of sesor to mximise bttery reovery will ievitbly irese the ltey of deliverig pket to the sik. I this setio, we provide lytil results for the ltey of dt delivery i sesor etworks with both bttery-wre d pseudo-rdom duty yle. Suppose ode i is witig to forwrd dt, whih hs set of eighbours N i d degree s d i = N i. Eh of these eighbours is performig pseudo-rdom duty yle with probbility ρ d, suh tht i oe time slot, eh ode is tive with i.i.d. probbility ρ d, d is sleep with probbility -ρ d. Let L (i) be the rdom umber of slots for i before eighbour beomes tive. Therefore,

9 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 8, NO. 7, SEPTEMBER Network Lifetime slots Λ 8 Bttery wre Duty Cylig Pseudo rdom Duty Cylig Alwys Ative Mx Gi 8 6 Λ 6 Λ Λ 8 Bttery wre DC vs. Alwys Ative Pseudo rdom DC vs. Alwys Ative Network Size Λ Fig.. I lttie with b buf = t st =, we obtied through simultio the etwork lifetime of bttery-wre duty yle sheme, pseudo-rdom duty yle sheme d simple lwys-tive se. We set the duty yle rte s., m =, =, w mx =. L (i) = mi{l,l,...,l di }, where L j is the rdom witig time for eighbour j N i to beome tive. Theorem : E[L (i) ]= ( ρ d ) di Note tht the expeted per-hop ltey dereses quikly with iresig ode degree d i. For very low duty yle rte (i.e., very smll vlue ρ d ), we obti pproximtio s: E[L (i) ] ( ρ d d i ) = ρ d d i Theorem 6: For D lttie, let l(i, j) be the ed-to-ed ltey from (i, j) to (, ). () E[l(i, )] = + i- d E[l(,j)] = + j- ρ d ρ d () For i, j, E[l(i, j)] + i+j- ρ d I bttery-wre duty yle sheme, sesor tht hs bee tive for more th w mx oseutive slots from the urret slot will go to sleep for the ext b buf slots. Theorem 7: I bttery-wre pseudo-rdom duty yle with fored sleep, E[L j ] b buf + d E[L (i) ] b buf + ρ d ( ρ d ) di For D lttie, let l(i, j) be the expeted ed-to-ed ltey from (i, j) to (, ). () E[l(i, )] +(i-) ( ) b buf + ρ d d E[l(,j)] +(j-) ( ) b buf + ρ d () For i, j, E[l(i, j)] +(i+j-) ( b buf + ρ d ) We ext preset good pproximtio of E[L (i) ].Whe w mx =, we pproximte E[L j ] b buf + ρ d,next, we osider Mrkov hi of the stte of eighbour j. Let p t j be the probbility tht t y slot j is tive. Sie it is -stte Mrkov hi, by stdrd Mrkov hi theory o the reurret times, p t j = E[L j]. Sie the pseudordom duty yle of ll eighbours re idepedet, we b buf + ρ d obti the followig pproximtio i similr s Theorem : E[L (i) ] ( ) di b buf + ρ d I Fig. 6, we observe tht the pproximtio is ideed urte s ompred to simultio. The bove theorems eble sesor etwork desigers useful tool to ble d optimise the trde-off betwee improvig bttery rutime d the iurred ltey of dt delivery. Here we disuss useful pplitio of our theorem. Suppose tht we desig sesor etwork with ltey ostrit. We let the mximum tolerble ltey s E[L (i) ] d E[l(i, j)], d obti the miimum b buf from Theorem 7. Suh b buf be used to ifer the bttery rutime from experimetl dt. VII. DISCUSSION A. Sigifie of Bttery Reovery Eergy effiiey be improved from both the supply side d the demd side. Improvemets from the supply side ilude ew bttery mterils d tehologies. However, the developmet of ew prtil btteries i reet yers hs bee slow. Although fuel ells my brig lrge lep i eergy supply, we rgue tht they re ot vilble i physil formt tht re pproprite for eoomil sesor etworks tht re required to deploy i lrge sle d outdoors i log utteded periods. Aother oeptul ltertive be eergy hrvestig (e.g., solr ells). But the vilbility of eergy soure will sigifitly ostri the pplitios of sesor etworks. Whtever eergy soure is used, effiiet eergy mgemet from the demd side is lwys desirble. I this work, we hve reetly exmied by experimets the beefit of hressig bttery reovery effet, d foud sigifit extesio of bttery rutime (up to % ormlised gi) by tkig dvtge of the itrisi bttery hrteristis. B. Applitios I this pper, we foud tht pproprite (determiisti d rdomised) duty yle shedules irese the deliverble eergy of bttery without jeoprdisig ltey of dt delivery. This is prtiulrly useful to sesor etwork pplitios with eergy d ltey ostrits, suh s seurity d emergee surveille. I these pplitios, duty yle shedules my be used to prolog the etwork

10 CHAU et l.: HARNESSING BATTERY RECOVERY EFFECT IN WIRELESS SENSOR NETWORKS: EXPERIMENTS AND ANALYSIS Ltey E[L (i) ]... Simultio - ( ) - b buf + / Ρ d d i Ltey E [L (i) ]... Simultio d -( i - b buf - / Ρ d ).8.6. w mx =,Ρ d =. w mx =,Ρ d =. w mx =,Ρ d =.. w mx =,Ρ = d.6 w mx =,Ρ d =.9. b buf.. w mx =,b buf = w mx =,b buf =. w mx =,b buf = w mx =,b buf = w mx =,b buf = Ρ d Fig. 6. The figure shows the per-hop ltey E[L (i) ] with d i =d w mx =. The oloured dots re obtied from simultio, while the solid lies re by equtio. di b buf + ρ d lifetime. However, s show by our experimets, duty yle rte is ot the oly ftor to determie the effetiveess of bttery reovery effet. Eve with the sme duty yle rte, some sleep/tive time periods hve sigifit gi by the bttery reovery effet. If we refully set the sleep time periods withi the sturtio threshold, we mximise bttery reovery without exerbtig the ltey of dt delivery. Other pplitios tht tolerte ltey (e.g., moitorig dily temperture) usully hve very log sleep time period, where bttery reovery is fully utilised. C. Syhroistio Protools Like other syhroised eergy optimisig protools (e.g., S-MAC []), we ssume tht the sesors syhroise their lok with eighbours usig populr low-overhed time syhroistio protool (e.g., FTSP []) i spordi itervls. The eed for time syhroistio is due to the possible lok drift o the sesors tht use errors i the duty yle shedules. Smll d low-ed sesors my suffer from iosistet loks beuse of severl ftors (temperture, hrdwre jitter, istbility of the lok rystl). However, we rgue tht tive/sleep time periods re muh loger th the lok drift (withi μs per seod s mesured i []). It does ot require frequet time syhroistio. Moreover, reltively urte time syhroistio is oly required for per-hop bsis. Our duty yle does ot require etwork-wide time syhroistio tht omes with high omplexity. VIII. CONCLUSION This pper exmies the gi of bttery reovery effet d provides lytil results to shed light o hressig the bttery reovery i sesor etworks. I prtiulr, we lyse bttery reovery i the presee of sturtio threshold d rdom sesig tivities, bsed o our experimets. We derive upper bouds of bttery rutime d study the beefit of duty ylig d bufferig. We the propose more eergy-effiiet duty yle sheme tht is wre of bttery reovery, by extedig the pseudo-rdom duty yle sheme. We provide lytil results tht predit the ltey of dt delivery i sesor etworks whe osiderig bttery reovery optimistio. I future work, we im to study broder sope of optimisig bttery reovery effet i ojutio with vriety of qulities of servie observed i sesor etworks, suh s overge, oetivity, relibility. We will lso osider the impt of iterferee i wireless ommuitios o bttery reovery effet, d orrelted sesig tivities. ACKNOWLEDGMENT The uthors thk Yusheg Wg d Xi Yi for helps i the experimets, d the reviewers for helpful ommets. REFERENCES [] D. Lide, Hdbook of Btteries d Fuel Cells. MGrw-Hill, 99. [] I. Buhm, Btteries i Portble World: A Hdbook o Rehrgeble Btteries for No-Egieers. Cdex Eletrois I,. [] J. Redi, S. Kolek, K. Mig, C. Prtridge, R. Rosles-Hi, R. Rmth, d I. Cstieyr, Jvele: A ultr-low eergy d ho wireless etwork, Ad Ho Networks Jourl, vol., o. 8, 8. [] P. Bsu d C.-K. Chu, Opportuisti forwrdig i wireless etworks with duty ylig, i Pro. ACM Workshop o Chlleged Networks (CHANTS), September 8. [] C.-K. Chu, F. Qi, S. Syed, M. H. Whb, d Y. Yg, Hressig bttery reovery effet i wireless sesor etworks: Experimets d lysis, Uiversity of Cmbridge, Teh. Rep., 9. [6] C. Prk, K. Lhiri, d A. Rghuth, Bttery dishrge hrteristis of wireless sesor odes: A experimetl lysis, i Pro. IEEE Seo,, pp.. [7] M. Doyle d J. S. Newm, Alysis of pity-rte dt for lithium btteries usig simplified models of the dishrge proess, J. Applied Eletrohem, vol. 7, pp , July 997. [8] T. F. Fuller, M. Doyle, d J. S. Newm, Modelig of glvostti hrge d dishrge of the lithium polymer isertio ell, J. Applied Eletrohem, vol., pp. 6, 99. [9] C. F. Chisserii d R. R. Ro, Improvig bttery performe by usig trffi shpig tehiques, IEEE J. Sel. Ares i Commu., vol. 9, pp. 8 9, July. [], Eergy effiiet bttery mgemet, IEEE J. Sel. Ares i Commu., vol. 9, pp., July. [] S. Srkr d M. Admou, A frmework for optiml bttery mgemet for wireless odes, IEEE J. Sel. Ares i Commu., vol., o.,. [] V. Ro, G. Sighl, A. Kumr, d N. Nvet, Bttery model for embedded systems, i Pro. Itl. Cof. o VLSI Desig,. [] W. Ye, J. Heidem, d D. Estri, Medium ess otrol with oordited dptive sleepig for wireless sesor etworks, IEEE/ACM Trs. Netw., vol., pp. 9 6, Jue. [] R. Rozovsky d P. R. Kumr, SEEDEX: A MAC protool for d ho etworks, i Pro. ACM MobiHOC,. [] H. Co, K. Prker, d A. Aror, O-MAC: A reeiver etri power mgemet protool, i Pro. IEEE ICNP, 6.

11 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 8, NO. 7, SEPTEMBER [6] Y. Su, O. Gurewitz, d D. Johso, RI-MAC: reeiver-iitited syhroous duty yle MAC protool for dymi trffi lods i wireless sesor etworks, i Pro. ACM SeSys, 8. [7] S. Jyshree, B. Moj, d C. S. R. Murthy, O usig bttery stte for medium ess otrol i d ho wireless etworks, i Pro. ACM MOBICOM,. [8] M. Dhrj, S. Jyshree, d C. S. R. Murthy, A ovel bttery wre m protool for miimizig eergy ltey i wireless sesor etworks, i Pro. HiPC,. [9] C. F. Chisserii, P. Nuggehlli, V. Sriivs, d R. R. Ro, Eergyeffiiet ommuitio protools, i Pro. DAC,. [] M. Mróti, B. Kusy, G. Simo, d A. Lédezi, The floodig time syhroiztio protool, i Pro. ACM SeSys,. Fei Qi reeived the B.Eg i Iformtio Egieerig from HUST, d M.Eg. i Eletroi Egieerig from BIT, 6. He is urretly fuded by DHPA sholrship to work s PhD Cdidte with Dr. Joh Mithell d Dr. Yg Yg i EE Dept., Uiversity College Lodo. Prior to tht, he served s Sr. Applitio Egieer t Crossbow Tehology, Beijig Rep. Offie. Smir Syed reeived his B.S d M.S. degrees i Eletrois d Commuitios Egieerig from Helw Uiversity, Egypt, i 997 d, respetively. Curretly, he is Ph.D. didte t the Deprtmet of EE Dept., Uiversity College Lodo. His preset reserh iterests ilude wireless etworkig, medium ess otrol, qulity of servie, d oopertive ommuitios. Chi-Ki Chu is urretly Reserh Assoite t Uiversity of Cmbridge s primry reserher for the Itertiol Tehology Allie i Network d Iformtio Siee (ITA) progrm tht is joitly fuded by the U.S. Army Reserh Lbortory d the U.K. Miistry of Defese. Previously, he ws Crouher Foudtio Reserh Fellow t the EE Dept., Uiversity College Lodo, wrded two-yer fellowship by the Crouher Foudtio Hog Kog. He reeived the Ph.D. from the Computer Lbortory, Uiversity of Cmbridge, d the B. Eg. (First-lss Hoors) from the Dept. of Iformtio Egieerig, the Chiese Uiversity of Hog Kog. His reserh iterests oer diverse res of etworkig, ommuitios, distributed systems, stohsti etworks d rdomized lgorithms. Muhmmd Husi Whb reeived the BS i Eletrois d Computer Egieerig from Cregie Mello Uiversity d MS from Glsgow Uiversity i 8. He worked o mhie lerig d etworkig protools. He is ow PhD studet i the Computer Siee deprtmet, Uiversity College Lodo, workig o mhie lerig for visio systems uder the Visio d Imgig Siee group. Yg Yg is urretly the Assistt Diretor d Vie CTO t Shghi Reserh Ceter for Wireless Commuitios (WiCO), SIMIT, Chiese Ademy of Siees. Prior to tht, he ws Seior Leturer with EE Dept., Uiversity College Lodo, Uited Kigdom. His geerl reserh iterests ilude wireless d ho d sesor etworks, wireless mesh etworks, d G/G mobile systems.

Riemann Integral Oct 31, such that

Riemann Integral Oct 31, such that Riem Itegrl Ot 31, 2007 Itegrtio of Step Futios A prtitio P of [, ] is olletio {x k } k=0 suh tht = x 0 < x 1 < < x 1 < x =. More suitly, prtitio is fiite suset of [, ] otiig d. It is helpful to thik of

More information

CS 331 Design and Analysis of Algorithms. -- Divide and Conquer. Dr. Daisy Tang

CS 331 Design and Analysis of Algorithms. -- Divide and Conquer. Dr. Daisy Tang CS 33 Desig d Alysis of Algorithms -- Divide d Coquer Dr. Disy Tg Divide-Ad-Coquer Geerl ide: Divide problem ito subproblems of the sme id; solve subproblems usig the sme pproh, d ombie prtil solutios,

More information

0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k.

0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k. . Computtio of Fourier Series I this sectio, we compute the Fourier coefficiets, f ( x) cos( x) b si( x) d b, i the Fourier series To do this, we eed the followig result o the orthogolity of the trigoometric

More information

Air Compressor Driving with Synchronous Motors at Optimal Parameters

Air Compressor Driving with Synchronous Motors at Optimal Parameters Iuliu Petri, Adri Vleti Petri AALELE UIVERSITĂłII EFTIMIE MURGU REŞIłA AUL XVII, R., 010, ISS 1453-7397 Air Compressor Drivig with Syhroous Motors t Optiml Prmeters I this pper method of optiml ompestio

More information

Inference on One Population Mean Hypothesis Testing

Inference on One Population Mean Hypothesis Testing Iferece o Oe Popultio Me ypothesis Testig Scerio 1. Whe the popultio is orml, d the popultio vrice is kow i. i. d. Dt : X 1, X,, X ~ N(, ypothesis test, for istce: Exmple: : : : : : 5'7" (ull hypothesis:

More information

SPH3UW Unit 7.5 Snell s Law Page 1 of Total Internal Reflection occurs when the incoming refraction angle is

SPH3UW Unit 7.5 Snell s Law Page 1 of Total Internal Reflection occurs when the incoming refraction angle is SPH3UW Uit 7.5 Sell s Lw Pge 1 of 7 Notes Physis Tool ox Refrtio is the hge i diretio of wve due to hge i its speed. This is most ommoly see whe wve psses from oe medium to other. Idex of refrtio lso lled

More information

Discrete Time Sliding Mode Flow Controllers for Connection-Oriented Networks with Lossy Links

Discrete Time Sliding Mode Flow Controllers for Connection-Oriented Networks with Lossy Links BULGARIAN ACADEMY OF SCIENCES CYBERNEICS AND INFORMAION ECHNOLOGIES Volume 3, No Sofi 3 Prit ISSN: 3-97; Olie ISSN: 34-48 DOI:.478/it-3-9 Disrete ime Slidig Mode Flow Cotrollers for Coetio-Orieted Networks

More information

a f(x)dx is divergent.

a f(x)dx is divergent. Mth 250 Exm 2 review. Thursdy Mrh 5. Brig TI 30 lultor but NO NOTES. Emphsis o setios 5.5, 6., 6.2, 6.3, 3.7, 6.6, 8., 8.2, 8.3, prt of 8.4; HW- 2; Q-. Kow for trig futios tht 0.707 2/2 d 0.866 3/2. From

More information

Chapter 2. LOGARITHMS

Chapter 2. LOGARITHMS Chpter. LOGARITHMS Dte: - 009 A. INTRODUCTION At the lst hpter, you hve studied bout Idies d Surds. Now you re omig to Logrithms. Logrithm is ivers of idies form. So Logrithms, Idies, d Surds hve strog

More information

1.3 Continuous Functions and Riemann Sums

1.3 Continuous Functions and Riemann Sums mth riem sums, prt 0 Cotiuous Fuctios d Riem Sums I Exmple we sw tht lim Lower() = lim Upper() for the fuctio!! f (x) = + x o [0, ] This is o ccidet It is exmple of the followig theorem THEOREM Let f be

More information

Fatigue life analysis of the plate structure with random vibro-acoustic loading

Fatigue life analysis of the plate structure with random vibro-acoustic loading INTER-NOISE 16 Ftigue life lysis of the plte struture with rdom vibro-ousti lodig Go Zhg 1 ; Hubig Jig 1 Istitute of Systems Egieerig, Chi Ademy of Egieerig Physis,Miyg Chi Istitute of Systems Egieerig,

More information

AN DIGITAL FILTER DESIGN SCHEME BASED ON MATRIX TRANSFORMATION

AN DIGITAL FILTER DESIGN SCHEME BASED ON MATRIX TRANSFORMATION Jourl of heoretil d Applied Iformtio ehology 5 th November. Vol. 5 No. 5 - JAI & LLS. All rights reserved. ISSN: 99-865 www.jtit.org E-ISSN: 87-95 AN DIGIAL FILER DESIGN SCHEME BASED ON MARIX RANSFORMAION

More information

EXPONENTS AND LOGARITHMS

EXPONENTS AND LOGARITHMS 978--07-6- Mthemtis Stdrd Level for IB Diplom Eerpt EXPONENTS AND LOGARITHMS WHAT YOU NEED TO KNOW The rules of epoets: m = m+ m = m ( m ) = m m m = = () = The reltioship etwee epoets d rithms: = g where

More information

Let. Then. k n. And. Φ npq. npq. ε 2. Φ npq npq. npq. = ε. k will be very close to p. If n is large enough, the ratio n

Let. Then. k n. And. Φ npq. npq. ε 2. Φ npq npq. npq. = ε. k will be very close to p. If n is large enough, the ratio n Let The m ( ) ( + ) where > very smll { } { ( ) ( + ) } Ad + + { } Φ Φ Φ Φ Φ Let, the Φ( ) lim This is lled thelw of lrge umbers If is lrge eough, the rtio will be very lose to. Exmle -Tossig oi times.

More information

POWER SERIES R. E. SHOWALTER

POWER SERIES R. E. SHOWALTER POWER SERIES R. E. SHOWALTER. sequeces We deote by lim = tht the limit of the sequece { } is the umber. By this we me tht for y ε > 0 there is iteger N such tht < ε for ll itegers N. This mkes precise

More information

Definite Integral. The Left and Right Sums

Definite Integral. The Left and Right Sums Clculus Li Vs Defiite Itegrl. The Left d Right Sums The defiite itegrl rises from the questio of fidig the re betwee give curve d x-xis o itervl. The re uder curve c be esily clculted if the curve is give

More information

Introduction of Fourier Series to First Year Undergraduate Engineering Students

Introduction of Fourier Series to First Year Undergraduate Engineering Students Itertiol Jourl of Adved Reserh i Computer Egieerig & Tehology (IJARCET) Volume 3 Issue 4, April 4 Itrodutio of Fourier Series to First Yer Udergrdute Egieerig Studets Pwr Tejkumr Dtttry, Hiremth Suresh

More information

Modified Farey Trees and Pythagorean Triples

Modified Farey Trees and Pythagorean Triples Modified Frey Trees d Pythgore Triples By Shi-ihi Kty Deprtet of Mthetil Siees, Fulty of Itegrted Arts d Siees, The Uiversity of Tokushi, Tokushi 0-0, JAPAN e-il ddress : kty@istokushi-ujp Abstrt I 6,

More information

Accuplacer Elementary Algebra Study Guide

Accuplacer Elementary Algebra Study Guide Testig Ceter Studet Suess Ceter Aupler Elemetry Alger Study Guide The followig smple questios re similr to the formt d otet of questios o the Aupler Elemetry Alger test. Reviewig these smples will give

More information

Double Sums of Binomial Coefficients

Double Sums of Binomial Coefficients Itertiol Mthemticl Forum, 3, 008, o. 3, 50-5 Double Sums of Biomil Coefficiets Athoy Sofo School of Computer Sciece d Mthemtics Victori Uiversity, PO Box 448 Melboure, VIC 800, Austrli thoy.sofo@vu.edu.u

More information

Neighborhoods of Certain Class of Analytic Functions of Complex Order with Negative Coefficients

Neighborhoods of Certain Class of Analytic Functions of Complex Order with Negative Coefficients Ge Mth Notes Vol 2 No Jury 20 pp 86-97 ISSN 229-784; Copyriht ICSRS Publitio 20 wwwi-srsor Avilble free olie t http://wwwemi Neihborhoods of Certi Clss of Alyti Futios of Complex Order with Netive Coeffiiets

More information

National Conference on Advances in Mechanical Engineering Science (NCAMES-2016)

National Conference on Advances in Mechanical Engineering Science (NCAMES-2016) Ntiol Coferee o Adves i Mehil Egieerig Siee (NCAMES-2016) Modelig Stepper Motor Cotrol System with Miro-Steppig Exittio Mode Nvy Thirumleshwr, Hegde 1 Dr. S. Meethi Sudrm 2,, Aldri Vz 3 1 Assistt Professor,

More information

Review of the Riemann Integral

Review of the Riemann Integral Chpter 1 Review of the Riem Itegrl This chpter provides quick review of the bsic properties of the Riem itegrl. 1.0 Itegrls d Riem Sums Defiitio 1.0.1. Let [, b] be fiite, closed itervl. A prtitio P of

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Lecture 17

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Lecture 17 CS 70 Discrete Mthemtics d Proility Theory Sprig 206 Ro d Wlrd Lecture 7 Vrice We hve see i the previous ote tht if we toss coi times with is p, the the expected umer of heds is p. Wht this mes is tht

More information

1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2

1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2 Mth 3, Clculus II Fil Exm Solutios. (5 poits) Use the limit defiitio of the defiite itegrl d the sum formuls to compute 3 x + x. Check your swer by usig the Fudmetl Theorem of Clculus. Solutio: The limit

More information

MATH 104: INTRODUCTORY ANALYSIS SPRING 2008/09 PROBLEM SET 10 SOLUTIONS. f m. and. f m = 0. and x i = a + i. a + i. a + n 2. n(n + 1) = a(b a) +

MATH 104: INTRODUCTORY ANALYSIS SPRING 2008/09 PROBLEM SET 10 SOLUTIONS. f m. and. f m = 0. and x i = a + i. a + i. a + n 2. n(n + 1) = a(b a) + MATH 04: INTRODUCTORY ANALYSIS SPRING 008/09 PROBLEM SET 0 SOLUTIONS Throughout this problem set, B[, b] will deote the set of ll rel-vlued futios bouded o [, b], C[, b] the set of ll rel-vlued futios

More information

LESSON 11: TRANSFORMER NAME PLATE DATA AND CONNECTIONS

LESSON 11: TRANSFORMER NAME PLATE DATA AND CONNECTIONS ET 332 Motors, Geertors d Power Systems LESSON 11: TRNSFORMER NME PLTE DT ND ONNETIONS 1 LERNING OJETIVES fter this presettio you will e le to: Idetify trsformer polrity usig dot d ovetiol lelig. Expli

More information

( ) 2 3 ( ) I. Order of operations II. Scientific Notation. Simplify. Write answers in scientific notation. III.

( ) 2 3 ( ) I. Order of operations II. Scientific Notation. Simplify. Write answers in scientific notation. III. Assessmet Ceter Elemetry Alger Study Guide for the ACCUPLACER (CPT) The followig smple questios re similr to the formt d otet of questios o the Aupler Elemetry Alger test. Reviewig these smples will give

More information

General properties of definite integrals

General properties of definite integrals Roerto s Notes o Itegrl Clculus Chpter 4: Defiite itegrls d the FTC Sectio Geerl properties of defiite itegrls Wht you eed to kow lredy: Wht defiite Riem itegrl is. Wht you c ler here: Some key properties

More information

Convergence rates of approximate sums of Riemann integrals

Convergence rates of approximate sums of Riemann integrals Jourl of Approximtio Theory 6 (9 477 49 www.elsevier.com/locte/jt Covergece rtes of pproximte sums of Riem itegrls Hiroyuki Tski Grdute School of Pure d Applied Sciece, Uiversity of Tsukub, Tsukub Ibrki

More information

Project 3: Using Identities to Rewrite Expressions

Project 3: Using Identities to Rewrite Expressions MAT 5 Projet 3: Usig Idetities to Rewrite Expressios Wldis I lger, equtios tht desrie properties or ptters re ofte lled idetities. Idetities desrie expressio e repled with equl or equivlet expressio tht

More information

Numerical Methods. Lecture 5. Numerical integration. dr hab. inż. Katarzyna Zakrzewska, prof. AGH. Numerical Methods lecture 5 1

Numerical Methods. Lecture 5. Numerical integration. dr hab. inż. Katarzyna Zakrzewska, prof. AGH. Numerical Methods lecture 5 1 Numeril Methods Leture 5. Numeril itegrtio dr h. iż. Ktrzy Zkrzewsk, pro. AGH Numeril Methods leture 5 Outlie Trpezoidl rule Multi-segmet trpezoidl rule Rihrdso etrpoltio Romerg's method Simpso's rule

More information

Section 6.3: Geometric Sequences

Section 6.3: Geometric Sequences 40 Chpter 6 Sectio 6.: Geometric Sequeces My jobs offer ul cost-of-livig icrese to keep slries cosistet with ifltio. Suppose, for exmple, recet college grdute fids positio s sles mger erig ul slry of $6,000.

More information

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J. Probbility d Stochstic Processes: A Friedly Itroductio for Electricl d Computer Egieers Roy D. Ytes d Dvid J. Goodm Problem Solutios : Ytes d Goodm,4..4 4..4 4..7 4.4. 4.4. 4..6 4.6.8 4.6.9 4.7.4 4.7.

More information

Module B3 3.1 Sinusoidal steady-state analysis (single-phase), a review 3.2 Three-phase analysis. Kirtley

Module B3 3.1 Sinusoidal steady-state analysis (single-phase), a review 3.2 Three-phase analysis. Kirtley Module B.1 Siusoidl stedy-stte lysis (sigle-phse), review.2 Three-phse lysis Kirtley Chpter 2: AC Voltge, Curret d Power 2.1 Soures d Power 2.2 Resistors, Idutors, d Cpitors Chpter 4: Polyphse systems

More information

Waves in dielectric media. Waveguiding: χ (r ) Wave equation in linear non-dispersive homogenous and isotropic media

Waves in dielectric media. Waveguiding: χ (r ) Wave equation in linear non-dispersive homogenous and isotropic media Wves i dieletri medi d wveguides Setio 5. I this leture, we will osider the properties of wves whose propgtio is govered by both the diffrtio d ofiemet proesses. The wveguides re result of the ble betwee

More information

Taylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best

Taylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best Tylor Polyomils Let f () = e d let p() = 1 + + 1 + 1 6 3 Without usig clcultor, evlute f (1) d p(1) Ok, I m still witig With little effort it is possible to evlute p(1) = 1 + 1 + 1 (144) + 6 1 (178) =

More information

Data Compression Techniques (Spring 2012) Model Solutions for Exercise 4

Data Compression Techniques (Spring 2012) Model Solutions for Exercise 4 58487 Dt Compressio Tehiques (Sprig 0) Moel Solutios for Exerise 4 If you hve y fee or orretios, plese ott jro.lo t s.helsii.fi.. Prolem: Let T = Σ = {,,, }. Eoe T usig ptive Huffm oig. Solutio: R 4 U

More information

Error-free compression

Error-free compression Error-free compressio Useful i pplictio where o loss of iformtio is tolerble. This mybe due to ccurcy requiremets, legl requiremets, or less th perfect qulity of origil imge. Compressio c be chieved by

More information

Limit of a function:

Limit of a function: - Limit of fuctio: We sy tht f ( ) eists d is equl with (rel) umer L if f( ) gets s close s we wt to L if is close eough to (This defiitio c e geerlized for L y syig tht f( ) ecomes s lrge (or s lrge egtive

More information

ON n-fold FILTERS IN BL-ALGEBRAS

ON n-fold FILTERS IN BL-ALGEBRAS Jourl of Alger Numer Theor: Adves d Applitios Volume 2 Numer 29 Pges 27-42 ON -FOLD FILTERS IN BL-ALGEBRAS M. SHIRVANI-GHADIKOLAI A. MOUSSAVI A. KORDI 2 d A. AHMADI 2 Deprtmet of Mthemtis Trit Modres Uiversit

More information

Radix-2/4 Streamlined Real Factor FFT Algorithms

Radix-2/4 Streamlined Real Factor FFT Algorithms SHAIK QADEER et l: RADIX-/ STREAMLIED REAL FACTOR FFT ALGORITHMS Rdix-/ Stremlied Rel Ftor FFT Algorithms Shi Qdeer () Mohmmed Zfr Ali Kh () d Syed A. Sttr () () Deprtmet of Eletril d Eletrois egieerig

More information

Addendum. Addendum. Vector Review. Department of Computer Science and Engineering 1-1

Addendum. Addendum. Vector Review. Department of Computer Science and Engineering 1-1 Addedum Addedum Vetor Review Deprtmet of Computer Siee d Egieerig - Coordite Systems Right hded oordite system Addedum y z Deprtmet of Computer Siee d Egieerig - -3 Deprtmet of Computer Siee d Egieerig

More information

THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING

THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING OLLSCOIL NA héireann, CORCAIGH THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING MATHEMATICS MA008 Clculus d Lier

More information

Ch. 12 Linear Bayesian Estimators

Ch. 12 Linear Bayesian Estimators h. Lier Byesi stimtors Itrodutio I hpter we sw: the MMS estimtor tkes simple form whe d re joitly Gussi it is lier d used oly the st d d order momets (mes d ovries). Without the Gussi ssumptio, the Geerl

More information

Reconstruction of mass spectra on the basis of partial pressures

Reconstruction of mass spectra on the basis of partial pressures Tutoril: Residul Gs Alysis Reostrutio of mss spetr o the sis of prtil pressures olo Chiggito & Berthold Jeiger 06-16/06/017 CER Aelertor Shool 017 1 Tutoril: Residul Gs Alysis Reostrutio of mss spetr o

More information

Section 11.5 Notes Page Partial Fraction Decomposition. . You will get: +. Therefore we come to the following: x x

Section 11.5 Notes Page Partial Fraction Decomposition. . You will get: +. Therefore we come to the following: x x Setio Notes Pge Prtil Frtio Deompositio Suppose we were sked to write the followig s sigle frtio: We would eed to get ommo deomitors: You will get: Distributig o top will give you: 8 This simplifies to:

More information

INFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1

INFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1 Appedix A.. Itroductio As discussed i the Chpter 9 o Sequeces d Series, sequece,,...,,... hvig ifiite umber of terms is clled ifiite sequece d its idicted sum, i.e., + + +... + +... is clled ifite series

More information

( a n ) converges or diverges.

( a n ) converges or diverges. Chpter Ifiite Series Pge of Sectio E Rtio Test Chpter : Ifiite Series By the ed of this sectio you will be ble to uderstd the proof of the rtio test test series for covergece by pplyig the rtio test pprecite

More information

lecture 16: Introduction to Least Squares Approximation

lecture 16: Introduction to Least Squares Approximation 97 lecture 16: Itroductio to Lest Squres Approximtio.4 Lest squres pproximtio The miimx criterio is ituitive objective for pproximtig fuctio. However, i my cses it is more ppelig (for both computtio d

More information

Approximations of Definite Integrals

Approximations of Definite Integrals Approximtios of Defiite Itegrls So fr we hve relied o tiderivtives to evlute res uder curves, work doe by vrible force, volumes of revolutio, etc. More precisely, wheever we hve hd to evlute defiite itegrl

More information

Observer Design with Reduced Measurement Information

Observer Design with Reduced Measurement Information Observer Desig with Redued Measuremet Iformatio I pratie all the states aot be measured so that SVF aot be used Istead oly a redued set of measuremets give by y = x + Du p is available where y( R We assume

More information

1/16/2013. Overview. 05-Three Phase Analysis Text: Three Phase. Three-Phase Voltages. Benefits of Three-Phase Systems.

1/16/2013. Overview. 05-Three Phase Analysis Text: Three Phase. Three-Phase Voltages. Benefits of Three-Phase Systems. oltge () 1/16/21 Overview 5Three Phse Alysis Text: 2.4 2.7 ECEGR 451 Power Systems ThreePhse Soures Delt d Y Coetios ThreePhse Lods ThreePhse Power ThreePhse Alysis PerPhse Alysis Dr. Louie 2 ThreePhse

More information

Chapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures

Chapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures Chpter 5 The Riem Itegrl 5.1 The Riem itegrl Note: 1.5 lectures We ow get to the fudmetl cocept of itegrtio. There is ofte cofusio mog studets of clculus betwee itegrl d tiderivtive. The itegrl is (iformlly)

More information

Prior distributions. July 29, 2002

Prior distributions. July 29, 2002 Prior distributios Aledre Tchourbov PKI 357, UNOmh, South 67th St. Omh, NE 688-694, USA Phoe: 4554-64 E-mil: tchourb@cse.ul.edu July 9, Abstrct This documet itroduces prior distributios for the purposes

More information

Fig. 1. I a. V ag I c. I n. V cg. Z n Z Y. I b. V bg

Fig. 1. I a. V ag I c. I n. V cg. Z n Z Y. I b. V bg ymmetricl Compoets equece impedces Although the followig focuses o lods, the results pply eqully well to lies, or lies d lods. Red these otes together with sectios.6 d.9 of text. Cosider the -coected lced

More information

MA123, Chapter 9: Computing some integrals (pp )

MA123, Chapter 9: Computing some integrals (pp ) MA13, Chpter 9: Computig some itegrls (pp. 189-05) Dte: Chpter Gols: Uderstd how to use bsic summtio formuls to evlute more complex sums. Uderstd how to compute its of rtiol fuctios t ifiity. Uderstd how

More information

Section IV.6: The Master Method and Applications

Section IV.6: The Master Method and Applications Sectio IV.6: The Mster Method d Applictios Defiitio IV.6.1: A fuctio f is symptoticlly positive if d oly if there exists rel umer such tht f(x) > for ll x >. A cosequece of this defiitio is tht fuctio

More information

INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS) Mthemtics Revisio Guides Itegrtig Trig, Log d Ep Fuctios Pge of MK HOME TUITION Mthemtics Revisio Guides Level: AS / A Level AQA : C Edecel: C OCR: C OCR MEI: C INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

More information

Reversing the Arithmetic mean Geometric mean inequality

Reversing the Arithmetic mean Geometric mean inequality Reversig the Arithmetic me Geometric me iequlity Tie Lm Nguye Abstrct I this pper we discuss some iequlities which re obtied by ddig o-egtive expressio to oe of the sides of the AM-GM iequlity I this wy

More information

: : 8.2. Test About a Population Mean. STT 351 Hypotheses Testing Case I: A Normal Population with Known. - null hypothesis states 0

: : 8.2. Test About a Population Mean. STT 351 Hypotheses Testing Case I: A Normal Population with Known. - null hypothesis states 0 8.2. Test About Popultio Me. Cse I: A Norml Popultio with Kow. H - ull hypothesis sttes. X1, X 2,..., X - rdom smple of size from the orml popultio. The the smple me X N, / X X Whe H is true. X 8.2.1.

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem The Weierstrss Approximtio Theorem Jmes K. Peterso Deprtmet of Biologicl Scieces d Deprtmet of Mthemticl Scieces Clemso Uiversity Februry 26, 2018 Outlie The Wierstrss Approximtio Theorem MtLb Implemettio

More information

PROGRESSIONS AND SERIES

PROGRESSIONS AND SERIES PROGRESSIONS AND SERIES A sequece is lso clled progressio. We ow study three importt types of sequeces: () The Arithmetic Progressio, () The Geometric Progressio, () The Hrmoic Progressio. Arithmetic Progressio.

More information

Chapter System of Equations

Chapter System of Equations hpter 4.5 System of Equtios After redig th chpter, you should be ble to:. setup simulteous lier equtios i mtrix form d vice-vers,. uderstd the cocept of the iverse of mtrix, 3. kow the differece betwee

More information

INTEGRATION IN THEORY

INTEGRATION IN THEORY CHATER 5 INTEGRATION IN THEORY 5.1 AREA AROXIMATION 5.1.1 SUMMATION NOTATION Fibocci Sequece First, exmple of fmous sequece of umbers. This is commoly ttributed to the mthemtici Fibocci of is, lthough

More information

Thomas J. Osler Mathematics Department Rowan University Glassboro NJ Introduction

Thomas J. Osler Mathematics Department Rowan University Glassboro NJ Introduction Ot 0 006 Euler s little summtio formul d speil vlues of te zet futio Toms J Osler temtis Deprtmet Row Uiversity Glssboro J 0608 Osler@rowedu Itrodutio I tis ote we preset elemetry metod of determiig vlues

More information

King Fahd University of Petroleum & Minerals

King Fahd University of Petroleum & Minerals Kig Fhd Uiversity of Petroleum & Mierls DEPARTMENT OF MATHEMATICAL CIENCE Techicl Report eries TR 434 April 04 A Direct Proof of the Joit Momet Geertig Fuctio of mple Me d Vrice Awr H. Jorder d A. Lrdji

More information

CH 19 SOLVING FORMULAS

CH 19 SOLVING FORMULAS 1 CH 19 SOLVING FORMULAS INTRODUCTION S olvig equtios suh s 2 + 7 20 is oviousl the orerstoe of lger. But i siee, usiess, d omputers it is lso eessr to solve equtios tht might hve vriet of letters i them.

More information

Review of Sections

Review of Sections Review of Sectios.-.6 Mrch 24, 204 Abstrct This is the set of otes tht reviews the mi ides from Chpter coverig sequeces d series. The specific sectios tht we covered re s follows:.: Sequces..2: Series,

More information

MATH 104: INTRODUCTORY ANALYSIS SPRING 2009/10 PROBLEM SET 8 SOLUTIONS. and x i = a + i. i + n(n + 1)(2n + 1) + 2a. (b a)3 6n 2

MATH 104: INTRODUCTORY ANALYSIS SPRING 2009/10 PROBLEM SET 8 SOLUTIONS. and x i = a + i. i + n(n + 1)(2n + 1) + 2a. (b a)3 6n 2 MATH 104: INTRODUCTORY ANALYSIS SPRING 2009/10 PROBLEM SET 8 SOLUTIONS 6.9: Let f(x) { x 2 if x Q [, b], 0 if x (R \ Q) [, b], where > 0. Prove tht b. Solutio. Let P { x 0 < x 1 < < x b} be regulr prtitio

More information

AP Calculus AB AP Review

AP Calculus AB AP Review AP Clulus AB Chpters. Re limit vlues from grphsleft-h Limits Right H Limits Uerst tht f() vlues eist ut tht the limit t oes ot hve to.. Be le to ietify lel isotiuities from grphs. Do t forget out the 3-step

More information

Stalnaker s Argument

Stalnaker s Argument Stlker s Argumet (This is supplemet to Coutble Additiviy, Dutch Books d the Sleepig Beuty roblem ) Stlker (008) suggests rgumet tht c be stted thus: Let t be the time t which Beuty wkes o Mody morig. Upo

More information

Introduction to Matrix Algebra

Introduction to Matrix Algebra Itrodutio to Mtri Alger George H Olso, Ph D Dotorl Progrm i Edutiol Ledership Applhi Stte Uiversit Septemer Wht is mtri? Dimesios d order of mtri A p q dimesioed mtri is p (rows) q (olums) rr of umers,

More information

Convergence rates of approximate sums of Riemann integrals

Convergence rates of approximate sums of Riemann integrals Covergece rtes of pproximte sums of Riem itegrls Hiroyuki Tski Grdute School of Pure d Applied Sciece, Uiversity of Tsuku Tsuku Irki 5-857 Jp tski@mth.tsuku.c.jp Keywords : covergece rte; Riem sum; Riem

More information

Riemann Integration. Chapter 1

Riemann Integration. Chapter 1 Mesure, Itegrtio & Rel Alysis. Prelimiry editio. 8 July 2018. 2018 Sheldo Axler 1 Chpter 1 Riem Itegrtio This chpter reviews Riem itegrtio. Riem itegrtio uses rectgles to pproximte res uder grphs. This

More information

Schrödinger Equation Via Laplace-Beltrami Operator

Schrödinger Equation Via Laplace-Beltrami Operator IOSR Jourl of Mthemtics (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. Volume 3, Issue 6 Ver. III (Nov. - Dec. 7), PP 9-95 www.iosrjourls.org Schrödiger Equtio Vi Lplce-Beltrmi Opertor Esi İ Eskitşçioğlu,

More information

NOP 10 * * * * + NOP NOP + < TIME 1 TIME 2 TIME 3 TIME 4 NOP

NOP 10 * * * * + NOP NOP + < TIME 1 TIME 2 TIME 3 TIME 4 NOP Outlie SCHEDULING The schedulig problem. cgiovi De Micheli Schedulig without costrits. Stford Uiversity Schedulig uder timig costrits. { Reltive schedulig. Schedulig uder resource costrits. { The ILP model.

More information

Chapter 7 Infinite Series

Chapter 7 Infinite Series MA Ifiite Series Asst.Prof.Dr.Supree Liswdi Chpter 7 Ifiite Series Sectio 7. Sequece A sequece c be thought of s list of umbers writte i defiite order:,,...,,... 2 The umber is clled the first term, 2

More information

CH 20 SOLVING FORMULAS

CH 20 SOLVING FORMULAS CH 20 SOLVING FORMULAS 179 Itrodutio S olvig equtios suh s 2 + 7 20 is oviousl the orerstoe of lger. But i siee, usiess, d omputers it is lso eessr to solve equtios tht might hve vriet of letters i them.

More information

Canonical Form and Separability of PPT States on Multiple Quantum Spaces

Canonical Form and Separability of PPT States on Multiple Quantum Spaces Coicl Form d Seprbility of PPT Sttes o Multiple Qutum Spces Xio-Hog Wg d Sho-Mig Fei, 2 rxiv:qut-ph/050445v 20 Apr 2005 Deprtmet of Mthemtics, Cpitl Norml Uiversity, Beijig, Chi 2 Istitute of Applied Mthemtics,

More information

ANALYSIS HW 3. f(x + y) = f(x) + f(y) for all real x, y. Demonstration: Let f be such a function. Since f is smooth, f exists.

ANALYSIS HW 3. f(x + y) = f(x) + f(y) for all real x, y. Demonstration: Let f be such a function. Since f is smooth, f exists. ANALYSIS HW 3 CLAY SHONKWILER () Fid ll smooth fuctios f : R R with the property f(x + y) = f(x) + f(y) for ll rel x, y. Demostrtio: Let f be such fuctio. Sice f is smooth, f exists. The The f f(x + h)

More information

Vectors. Vectors in Plane ( 2

Vectors. Vectors in Plane ( 2 Vectors Vectors i Ple ( ) The ide bout vector is to represet directiol force Tht mes tht every vector should hve two compoets directio (directiol slope) d mgitude (the legth) I the ple we preset vector

More information

ROUTH-HURWITZ CRITERION

ROUTH-HURWITZ CRITERION Automti Cotrol Sytem, Deprtmet of Mehtroi Egieerig, Germ Jordi Uiverity Routh-Hurwitz Criterio ite.google.om/ite/ziydmoud 7 ROUTH-HURWITZ CRITERION The Routh-Hurwitz riterio i lytil proedure for determiig

More information

Background 1. Cramer-Rao inequality

Background 1. Cramer-Rao inequality Bro-06, Lecture, 60506 D/Stt/Bro-06/tex wwwmstqueesuc/ blevit/ Observtio vector, dt: Bckgroud Crmer-Ro iequlity X (X,, X X R Here dt c be rel- or vector vlued, compoets of the dt c be idepedet or depedet,

More information

=> PARALLEL INTERCONNECTION. Basic Properties LTI Systems. The Commutative Property. Convolution. The Commutative Property. The Distributive Property

=> PARALLEL INTERCONNECTION. Basic Properties LTI Systems. The Commutative Property. Convolution. The Commutative Property. The Distributive Property Lier Time-Ivrit Bsic Properties LTI The Commuttive Property The Distributive Property The Associtive Property Ti -6.4 / Chpter Covolutio y ] x ] ] x ]* ] x ] ] y] y ( t ) + x( τ ) h( t τ ) dτ x( t) * h(

More information

 n. A Very Interesting Example + + = d. + x3. + 5x4. math 131 power series, part ii 7. One of the first power series we examined was. 2!

 n. A Very Interesting Example + + = d. + x3. + 5x4. math 131 power series, part ii 7. One of the first power series we examined was. 2! mth power series, prt ii 7 A Very Iterestig Emple Oe of the first power series we emied ws! + +! + + +!! + I Emple 58 we used the rtio test to show tht the itervl of covergece ws (, ) Sice the series coverges

More information

Week 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right:

Week 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right: Week 1 Notes: 1) Riem Sum Aim: Compute Are Uder Grph Suppose we wt to fid out the re of grph, like the oe o the right: We wt to kow the re of the red re. Here re some wys to pproximte the re: We cut the

More information

Introduction to mathematical Statistics

Introduction to mathematical Statistics More ttistics tutoril t wwwdumblittledoctorcom Itroductio to mthemticl ttistics Chpter 7 ypothesis Testig Exmple (ull hypothesis) : the verge height is 5 8 or more ( : μ 5'8" ) (ltertive hypothesis) :

More information

Sequence and Series of Functions

Sequence and Series of Functions 6 Sequece d Series of Fuctios 6. Sequece of Fuctios 6.. Poitwise Covergece d Uiform Covergece Let J be itervl i R. Defiitio 6. For ech N, suppose fuctio f : J R is give. The we sy tht sequece (f ) of fuctios

More information

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006 Sttistics for Ficil Egieerig Sessio : Lier Algebr Review rch 8 th, 6 Topics Itroductio to trices trix opertios Determits d Crmer s rule Eigevlues d Eigevectors Quiz The cotet of Sessio my be fmilir to

More information

Linear Programming. Preliminaries

Linear Programming. Preliminaries Lier Progrmmig Prelimiries Optimiztio ethods: 3L Objectives To itroduce lier progrmmig problems (LPP To discuss the stdrd d coicl form of LPP To discuss elemetry opertio for lier set of equtios Optimiztio

More information

UNIVERSITY OF BRISTOL. Examination for the Degrees of B.Sc. and M.Sci. (Level C/4) ANALYSIS 1B, SOLUTIONS MATH (Paper Code MATH-10006)

UNIVERSITY OF BRISTOL. Examination for the Degrees of B.Sc. and M.Sci. (Level C/4) ANALYSIS 1B, SOLUTIONS MATH (Paper Code MATH-10006) UNIVERSITY OF BRISTOL Exmitio for the Degrees of B.Sc. d M.Sci. (Level C/4) ANALYSIS B, SOLUTIONS MATH 6 (Pper Code MATH-6) My/Jue 25, hours 3 miutes This pper cotis two sectios, A d B. Plese use seprte

More information

Similar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication

Similar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication Next. Covered bsics of simple desig techique (Divided-coquer) Ch. of the text.. Next, Strsse s lgorithm. Lter: more desig d coquer lgorithms: MergeSort. Solvig recurreces d the Mster Theorem. Similr ide

More information

Numbers (Part I) -- Solutions

Numbers (Part I) -- Solutions Ley College -- For AMATYC SML Mth Competitio Cochig Sessios v.., [/7/00] sme s /6/009 versio, with presettio improvemets Numbers Prt I) -- Solutios. The equtio b c 008 hs solutio i which, b, c re distict

More information

Infinite Series Sequences: terms nth term Listing Terms of a Sequence 2 n recursively defined n+1 Pattern Recognition for Sequences Ex:

Infinite Series Sequences: terms nth term Listing Terms of a Sequence 2 n recursively defined n+1 Pattern Recognition for Sequences Ex: Ifiite Series Sequeces: A sequece i defied s fuctio whose domi is the set of positive itegers. Usully it s esier to deote sequece i subscript form rther th fuctio ottio.,, 3, re the terms of the sequece

More information

Chapter Real Numbers

Chapter Real Numbers Chpter. - Rel Numbers Itegers: coutig umbers, zero, d the egtive of the coutig umbers. ex: {,-3, -, -,,,, 3, } Rtiol Numbers: quotiets of two itegers with ozero deomitor; termitig or repetig decimls. ex:

More information

We will begin by supplying the proof to (a).

We will begin by supplying the proof to (a). (The solutios of problem re mostly from Jeffrey Mudrock s HWs) Problem 1. There re three sttemet from Exmple 5.4 i the textbook for which we will supply proofs. The sttemets re the followig: () The spce

More information

Mathacle. PSet Stats, Concepts In Statistics Level Number Name: Date:

Mathacle. PSet Stats, Concepts In Statistics Level Number Name: Date: APPENDEX I. THE RAW ALGEBRA IN STATISTICS A I-1. THE INEQUALITY Exmple A I-1.1. Solve ech iequlity. Write the solutio i the itervl ottio..) 2 p - 6 p -8.) 2x- 3 < 5 Solutio:.). - 4 p -8 p³ 2 or pî[2, +

More information

B. Examples 1. Finite Sums finite sums are an example of Riemann Sums in which each subinterval has the same length and the same x i

B. Examples 1. Finite Sums finite sums are an example of Riemann Sums in which each subinterval has the same length and the same x i Mth 06 Clculus Sec. 5.: The Defiite Itegrl I. Riem Sums A. Def : Give y=f(x):. Let f e defied o closed itervl[,].. Prtitio [,] ito suitervls[x (i-),x i ] of legth Δx i = x i -x (i-). Let P deote the prtitio

More information

12.2 The Definite Integrals (5.2)

12.2 The Definite Integrals (5.2) Course: Aelerted Egieerig Clulus I Istrutor: Mihel Medvisky. The Defiite Itegrls 5. Def: Let fx e defied o itervl [,]. Divide [,] ito suitervls of equl width Δx, so x, x + Δx, x + jδx, x. Let x j j e ritrry

More information