A SYNCHRONIZATION CONTROL SCHEME FOR REAL-TIME STREAMING MULTIMEDIA APPLICATIONS

Size: px
Start display at page:

Download "A SYNCHRONIZATION CONTROL SCHEME FOR REAL-TIME STREAMING MULTIMEDIA APPLICATIONS"

Transcription

1 A SYNCHRONIZATION CONTROL SCHEME FOR REAL-TIME STREAMING MULTIMEDIA APPLICATIONS Hnn Lu, Md El Zrk School of Informton nd Computer Scence Unersty of Clforn, Irne Irne, CA 9697 {hnn, ABSTRACT In ths pper, we propose n dpte synchronzton control scheme to chee both ntr-strem nd nterstrem synchronzton for rel-tme stremn multmed pplctons on the Internet. Bsed upon synchronzton errors clculted n rel-tme, our scheme pecewsely dusts the end-to-end dely to compenste for the dely rton. It does so by controlln the rtul clock mplemented t the destnton end. Smulton results show tht our control scheme s ble to mntn ood synchronzton performnce under dfferent network condtons. 1. INTRODUCTION The dncements n communctons nd med codn technoloes he mde rel-tme stremn of multmed pplctons, such s VoIP, nd deo conferencn, relty on the current Internet. These multmed pplctons contn ether snle or multple udo/deo obects, nd med dt unts (MDU s) wthn ech obect re pcketzed nd trnsported from the source to the destnton n seprte strem. To fthfully restore the ornl form of the multmed presentton, both the temporl ordern mon the MDU s n strem nd the relte temporl reltonshp mon dfferent strems he to be mntned. In other words, end-to-end rel-tme stremn multmed pplctons demnd both ntr-strem synchronzton nd nter-strem synchronzton. A typcl exmple of nter-strem synchronzton s the lp-sync n n udo/deo presentton. Howeer, due to the sttstcl multplexn feture of pcket swtch networks, the dely requrements cn rrely be stsfed wthout pproprte control mechnsms. For nstnce, IP networks, whch only prode best-effort serces, mke no urntees for on-tme delery of rel-tme dt. Vrble pcket delys nd unpredctble pcket losses my seerely dstort both ntr nd nter strem temporl reltonshps, nd mpr the fnl presentton qulty. Due to the lck of QoS support on the Internet, recent reserch emphss hs shfted to pplctonleel solutons for synchronzton control. A rety of pplcton-leel lorthms he been proposed to chee the ntr-strem nd nter-strem synchronzton [1]-[5]. The lorthms dffer n terms of ols nd pplcton scenros. In enerl, one cn dentfy three types of synchronzton control technques tht re employed by most lorthms, nmely, bsc control, preente control nd recte control 1. Bsc control, whch conssts of ppendn synchronzton nformton (tmestmp, sequence number, etc.) to MDU s nd buffern the dt t the receer sde, s essentl for ll lorthms. Preente control conssts of technques used to od synchrony, e.. the destnton chnes the buffern tme of the MDU s bsed upon n estmton of network dely. Recte control s used to recoer synchronzton fter synchrony occurs. Approches such s recte skppn nd pusn, shortenn/extendn plybck durton, nd rtul locl tme contrcton or expnson (referred s rtul locl tme control herefter) ll belon to recte control. Anyone of these technques, ether lone or n combnton wth others, cn be employed to chee the desred synchronzton for the treted pplcton [1]. Amon ll the technques proposed, the de of rtul locl tme control s more ttrcte becuse t 1) does not rely on synchronzed network clock, whch s not lwys fesble to procure on the Internet, ) cn be mplemented wth low oerhed [5], nd 3) cn produce resonbly ood qulty een when the network dely tter s ery hh [3]. Three lorthms tht use rtul locl tme control technque he been proposed n the lterture 1 In [1], the technques tht cn be used s both preente nd recte control ones re defned s nother type of technques, common control technques.

2 [4]-[6]. In [4], the de of chen nter-strem synchronzton by prodn ntr-strem synchronzton for ech strem s proposed. To ttn ntr-strem synchronzton, the plyout tme of ech MDU n strem s determned by comprn ts rrl tme wth seerl threshold lues, fter tht, the decson of ether plyn out or skppn s mde. Once ntr-strem synchronzton s estblshed, nter-strem synchronzton cn be mntned wth certn probblty []. The mpct of MDU losses or skppn on synchronzton dstorton s not consdered n ths lorthm. In [5], scheme whch dptely dusts the rtul plyout clock bsed on the frequency of occurrence of three synchronzton eents (MDU s 1) plyed out on tme, ) delyed, nd 3) lost) s presented. The lues of the three counters re obtned upon n ssumed worst-cse dely dstrbuton, nd the nter-strem synchronzton s exerted when clcultn the clock dustment mount. In [6], n dpte synchronzton frmework, whch s ble to mntn both ntr-strem synchronzton nd nter-strem synchronzton effectely, s proposed for wreless PCS networks. The pproch loses ts enerlty n tht t ssumes the mster strem does not experence ny dely rton n the network. In ths pper, we propose synchronzton control scheme tht 1) drectly ncorportes the qulty requrements of the pplcton nto the prmeters of the lorthm, ) clcultes synchronzton errors n rel-tme, 3) pecewsely dusts end-to-end dely by controlln the rtul locl clock to dpt to the network dely rton, nd 4) rcefully recoers the synchronzton f synchronzton error occurs. Our work hs been lrely nspred by the fndns n [3] nd the lorthms proposed n [4], [5] nd [6]. Smulton results show tht our scheme cn mntn ood synchronzton performnce under seere network condtons, e.. fluctutn delys..1 Vrtul Locl Tme Control In rel-tme multmed pplcton oer IP networks, the udo/deo MDU s re enerted t the source end nd sent cross the network. At the destnton end, the ornl temporl ordern s enerlly destroyed due to the dely rton cused by the network. A strhtforwrd soluton to ths problem s to buffer the receed MDU s t the destnton to compenste for the dely tter, nd then ply bck bsed on pre-determned sttc tmelne. Ths pproch ntroduces n equlzed end-to-end dely between the source nd the destnton. Howeer, becuse the network behor s unpredctble, t s not lwys fesble to fnd n optml sttc equlzton dely lue tht stsfes the requrements of the pplcton. A smll end-toend equlzton dely most lkely wll ncur synchronzton errors resultn from skpped MDU s (MDU s dd not rre pror to the scheduled plyout tme) s llustrted by sttc plyout tmelne (1) n Fure 1. On the other hnd, lre equlzton dely cn reduce the synchronzton error by extendn the plyout dedlne. But, s llustrted by the sttc plyout tmelne () n Fure 1, t leds to lrer end-to-end dely, whch wll deterorte the perceed qulty of the rel-tme pplcton. An dpte control mechnsm, whch s cpble of dustn the end-to-end dely bsed upon the obsered network dely nd synchronzton errors, s desrble under such crcumstnce. Ths s llustrted by the dpte plyout tmelne shown n Fure 1, the control mechnsm enbles the system to ncrese the end-toend dely f the synchronzton error exceeds certn threshold lue, nd decrese t f ll MDU s he rred hed of the scheduled tmelne durn certn perod. Sequence Number enerton tmelne dpte plyout tmelne sttc plyout tmelne (1) The rest of ths pper s structured s follows. In secton, we frst dscuss the bscs of the rtul tme control model nd the synchronzton model. We then descrbe new closed-loop synchronzton control scheme. Secton 3 detls synchronzton control lorthm tht uses rel-tme clculted synchronzton errors. Secton 4 presents the smulton results of the performnce eluton of the lorthm, nd we conclude n secton 5. end-to-end dely t1 end-to-end dely t sttc plyout tmelne () tme. SYSTEM MODEL Fure 1. Dfferent plyout strtees

3 Centered round the boe obserton, the rtul locl tme control model ntroduces rtul clock t the destnton end n ddton to the ctul tme. The MDU s re plyed out lon ths rtul clock xs t the destnton end [4][5][6]. The dpte plyout tmelne s cheed by modfyn the plyout tme of the dt unt bsed on the rrl tme smpled loclly, the enerton tme stmped t the source, nd other synchronzton error nformton. The clock cn be slowed down rtully by ncresn the scheduled plyout tme lue relte to the rrl tme. Ths s lso equlent to hn the end-to-end equlzton dely ncresed. Smlrly, t cn be rtully speeded up by don the reerse. We defne the bsc notton used throuhout ths pper s follows wth rerd to ths rtul tme control model: T : The enerton tme of MDU n n strem bsed on the source clock,.e. the lue of the tme stmp ppended to the unt. Note tht f the rtul plyout clock t the destnton strts upon the recept of the frst MDU nd there s no dely rton n the network, T lso represents the scheduled plyout tme of unt n. T : The rrl tme t whch MDU n completely rres t the destnton bsed on the rtul clock t the destnton. T p : The plyout tme t whch MDU n s decoded nd rendered, wth reference to the rtul clock t the destnton. The plyout tme s determned by the lorthm descrbed n secton 3. σ : The threshold Root Men Squre Error (RMSE) for strem whch represents the mxmum ntrstrem synchronzton error tht strem cn tolerte. l : The threshold loss rto for strem whch represents the mxmum loss percente tht strem cn tolerte. σˆ : Clculted RMSE for strem oer smpln wndow. lˆ : Clculted loss rto for strem oer smpln wndow. E : The threshold of the nter-strem nt synchronzton error.. Synchronzton Performnce Eluton The qulty of the ntr-strem synchronzton for strem cn be eluted by the RMSE of the ntersmple tme of the MDU s n the strem [5]. For N MDU s plyed out n strem, the RMSE s defned s: N [( Tp Tp ( n 1)) ( T T ( n 1))] n= σ = (1) N 1 Smlrly, for the nter-strem synchronzton, the qulty cn lso be eluted by the RMSE of the closest correspondn dt unts mon strems [6]. For exmple, n the cse of udo/deo pplctons, the RMSE of nter-strem synchronzton s defned s N [( Tp ( m) Tp ) ( T ( m) T )] n= σ = () N 1 where MDU m n the udo strem corresponds to MDU n n the deo strem, nd N s the totl number of MDU s n udo strem. Whle equtons (1) nd () elute the synchronzton phse dstorton between the MDU s tht re plyed bck, t does not cpture n mportnt source of the synchronzton error dscontnuty resultn from lost/skpped MDU s. For exmple, f consecute MDU s n strem re lost or skpped, een thouh the plyed MDU s re synchronzed precsely, the perceptul synchronzton qulty wll stll be ffected. We therefore propose to tke nto ccount both fctors nd elute the synchronzton error for W consecutely enerted MDU s wthn strem, by two prmeters: 1) Clculted RMSE M [( Tp Tp ( n 1)) ( T T ( n 1))] n= σ ˆ =. (3) M ) Loss rto l W M = 4) W where M ( M < W ) represents the number of MDU s plyed bck.

4 We propose synchronzton control scheme whch controls the rtul clock t the destnton end bsed on rel-tme clculton of the synchronzton errors s defned by equton (3) nd (4). We next expln how the synchronzton control s mplemented wth the d of these two lues..3 Synchronzton Control Scheme We dopt the mster-sle concept [1] [6], nd pply the nter-strem constrnt to the sle strems. The essence of our scheme s tht t s dren by the ntrstrem synchronzton errors from mster nd sle strems nd pecewsely dust the end-to-end dely to stsfy the error threshold lues requred by the pplctons. Fure shows how ths scheme works wth mster strem nd snle sle strem. For the sle strem, the plyout tme of the rred MDU s frst determned under the ntr-strem synchronzton constrnt. It s then dusted to stsfy the nter-strem synchronzton requrement. The synchronzton errors re clculted fter ths step. For the mster strem, the plyout tme of the rred MDU s only determned under ts own ntrstrem synchronzton constrnt.the synchronzton errors of both strems re montored durn the whole process, once the synchronzton error (ether the RMSE or the loss rto) of ether strem exceeds the threshold lue, the rtul clock wll be slowed down correspondnly. The rtul clock cn be speeded up f ether strem s synchronzton errors (both the RMSE nd the loss rto) re equl to durn certn perod of tme. Note tht n our scheme, unlke the schemes n [4][5][6], only one rtul clock s mntned for roup of strems t the destnton. The rtul clock s pecewsely dusted n closedloop mnner. 3. ALGORITHM In ths secton, we frst expln how to determne the plyout tme, nd then descrbe the detls of the rtul clock dustment lorthm. 3.1 Plyout Tme Determnton It s well known tht certn mount of rendern tter s tolerble for some multmed pplctons. Ths mens tht for the MDU s tht do not mss the schedule by too much, f controlled properly, they cn be rendered wthout cusn notceble phse dstorton. Bsed on ths feture, we set lte boundry δ for ech MDU nd prtton the rrl tme of the MDU s wthn strem nto two reons s shown n Fure 3. For MDU n wthn strem, f T T + δ, where δ represents the mxmum tolerble lte tme lue ccordn to the current rtul clock, the dt unt cn be rendered. If T > T + δ, the dt unt s smply skpped to od error. Intutely, the lue of δ s the trdeoff between the RMSE nd the loss rto. If we rse the lte boundry, then the RMSE wll ncrese nd the loss rto wll drop. If the lte boundry s too close to the scheduled plyout tme, then more MDU s wll be skpped. δ s determned by the fctor to whch the pplcton s more senste. T plyout T T + δ dscrd T ( n +1) rtul clock Determne Plyout Tme under Intr-Sync Constrnt Adust Plyout Tme under Inter-Sync Constrnt Clculte Sync Error Ply Bck Fure 3. Prtton of dt unt rrl tme Sle Strem Vrtul Clock The plyout tme determnton lorthm works recursely s follows: Mster Strem Determne Plyout Tme under Intr-Sync Constrnt Clculte Sync Error Ply Bck 1) If the rrl tme of MDU n flls n the dscrd reon, tht s, T - T >δ, then n s dscrded. Fure. Closed-loop synchronzton control scheme bsed on ESD ) If the rrl tme of MDU n flls n the plyout reon, whch mens T - T <δ, then there re two possble scenros:

5 ) If T p ( n 1) s equl to T ( n 1), whch mples tht unt ( n 1) ws plyed out on tme ccordn to the current rtul clock, then Else e nt < E, nt T = T ( m) + T T ( m) E (9) p p nt Tp = mx( T, T ) (5) Equton (5) ensures tht MDU n s plyed out t ts scheduled tme f t rres erly. Otherwse, t s plyed bck mmedtely t the tme t rres. b) If T p ( n 1) s lrer thn T ( n 1), ths mples tht unt ( n 1) s plyed bck fter the scheduled tme, nd synchronzton error hs occurred. To reduce the mpct of ths slp, t needs to be recoered from smoothly. Accordnly, the plyout tme of n s set to be Tp = mx[ T, T, Tp ( n 1) + T T ( n 1) α] (6) where α s the smoothn prmeter to ensure tht unt ( n 1) s rendered wth enouh tme [6]. Equton (6) urntees tht MDU n s plyed bck fter t rres, nd menwhle, mnmzes the synchronzton error s much s possble. Accordn to our scheme shown n Fure, the plyout tme of MDU n hs to be re-checked to stsfy the nter-strem synchronzton requrement f strem s sle strem. If we cn locte the closest correspondn MDU (ccordn to ts enerton tme) n the mster strem, we cn esly dust T p s n [6]. Howeer, the correspondn dt unt my be lost or rred too lte to be referenced. To oercome ths, the determnton lorthm pcks the MDU m n the mster strem, whch s the most closely enerted one mon the MDU s tht he rred hed of n, nd forces MDU n to synchronze to t. Frst, the nter-strem synchronzton error e nt s clculted s e nt = [ T T ( m)] [ T T ( m)] (7) p p If e nt < E, where nt E nt s the threshold lue of nter-strem synchronzton error, T p s kept s t s. Else f e > E nt nt T = mx[( T ( m) + T T ( m) Ent ), T ] (8) p p + 3. Vrtul Clock Adustment In our control scheme, the ntl lue of the rtul clock s smply set to be the lue of the tmestmp crred by the frst receed MDU n the strem. If there re multple strems n the pplcton, the clock s set to be the lue of the tmestmp crred by the frst receed MDU n the mster strem. Recll tht the tmestmp represents the enerton tme of the MDU t the source, nd the scheduled plyout tme t the destnton. After MDU n s ctul plyout tme hs been determned, the control scheme then updtes the lue of the synchronzton errors for the strem to whch the dt unt belons. Recll tht the synchronzton error of ech strem should be eluted by two prmeters: RMSE σˆ nd lost rto lˆ. We use smpln wndow nd pcket lost counter to montor the synchronzton errors. If MDU n s chosen to be plyed bck, t s put nto the smpln wndow to clculte the RMSE lue. If MDU n s dscrded or lost, the counter lue ncreses by one. The sze of the smpln wndow lues rnes nd W, where W s the upper lmt of the smpln wndow sze for strem ; the counter lue rnes from to W l. The wndow sze ncreses by one fter n MDU hs entered the wndow untl the sze reches W. At the bennn or fter clock dustment, both the wndow sze nd the counter lues re reset to be. In the cse of multple strems, both prmeters for ll the strems re reset to be. The rtul plyout clock s dusted under the follown two condtons: 1) Once the sze of the smpln wndow exceeds two, we strt clcultn the synchronzton errors for ll the strems. For strem, L [( Tp Tp ( n 1)) ( T T ( n 1))] n= σ ˆ = (1) W 1 where L s the current wndow sze. At the sme tme, ψ lˆ = (11) W

6 where ψ s the current loss count lue. If ether σˆ s reter thn the threshold lue σ, or lˆ s reter thn the threshold lue l, the rtul clock wll be slowed down. If σˆ exceeds the threshold lue, we et the mxmum dely tht the dt unt n the smpln wndow experenced, whch s equl to = mx( T T ), n smpln wndow for strem. (1) Then the rtul plyout clock s dusted by -, ths s equlent to hn the end-to-end dely ncresed by. If ψ exceeds the threshold lue, we dust the rtul plyout clock by - δ. If two consecute clock dustments re trered by the loss counter s result of hhly rble network dely, we ncrese the upper lmt of smpln wndow for ll strems by β. By don ths, we he thtened the RMSE constrnt nd relxed the MDU loss constrnt for the next smpln perod. W s then chned to W = mn( W + β, W ) (13) where W s the mxmum possble sze of the mx smpln wndow. Equton (13) ensures tht W wll not exceed W. mx ) When the wndow sze reches W, the rrl tmes of the MDU s n the wndow re checked. If the rrl tme of eery MDU wthn the smpln wndow s hed of ts scheduled plyout tme ccordn to the current rtul plyout clock, the clock needs to be speeded up. The dusted mount s -, where = mx( T T ) mx, n smpln wndow for strem. (14) Note s less thn n ths cse, nd the end-to-end dely s decresed by -. Menwhle, we thten the MDU loss constrnt nd relx the RMSE constrnt for the next smpln perod by decresn the upper lmt of the smpln wndow for ll strems by β,.e. W = mx( W β, W ) (15) where W s the mnmum pplcble sze of the mn smpln wndow. Equton (15) ensures tht W wll not be lower thn W. mn mn 4. PERFORMANCE EVALUATION In ths secton, we nestte the performnce of our synchronzton control lorthm by mens of smultons. We show how the proposed scheme performs under dfferent network condtons. Both snle-strem nd mult-strem pplcton scenros re consdered, nd the controlled end-to-end dely, synchronzton errors nd ere buffern lenth re mesured wth respect to dfferent trnsport chnnel behors. For smplcty, we ssume tht ech MDU fts nto one pcket for trnsmsson. 4.1 Network Dely Model In the smulton, we frst enerte seres of pseudonetwork dely lues. We do not use the wdely ppled snle norml dstrbuton model [1], s t does not ccurtely reflect the network coneston stuton. Insted, two-stte Mrko model tht hs shown better pproxmton [8] s chosen to smulte the trnsport chnnel. 1-q Good p q Fure 4. Trnsport chnnel model Wth the two-stte Mrko model shown n Fure 4, the trnsport chnnel s ssumed to he two sttes Good or Bd. p s the probblty wth whch the network trnsts nto the coneston stte, nd q s the probblty the network resumes the unconested stte. Wthn ech stte, the network dely s ssumed to conform to norml dstrbuton wth dfferent men U nd stndrd deton D. Then by ssnn dfferent trnst probbltes nd dstrbuton prmeters, we cn et dfferent chnnel behors. In Fure 5, the dely dstrbuton of two dfferent chnnel behors, whch re lbeled s Moderte nd Bd, re presented. The dely lues we obtned cpture the hey tl feture of network dely experenced by rel-tme stremn pplctons on the current Internet [9]. We then combne the two chnnel behors nd crete new seres of pseudo-network dely lues to In order to et the lower bound of the network dely, we et rd of the lues tht re less thn U D wthn ech stte Bd 1-p

7 smulte the stuton of brupt chnes n network condton. We then lbel ths behor s Seere. We demonstrte how the proposed control lorthm works wth dfferent pplctons under these three dfferent network condtons. Frequency p=.1, q=.1, U1= 5ms, D1=1ms, U=75ms, D=1ms Frequency Dely Dstrbuton Dely lue (ms) w th bn=5ms () Moderte Dely Dstrbuton Dely lue (ms) w th bn=5ms p=.1, q=.4, U1= 1ms, D1=5ms, U=18ms, D=7ms (b) Bd Fure 5. Dely dstrbuton of Moderte nd Bd chnnel behor 4. Snle-strem Applcton We frst elute how the control lorthm performs wth snle-strem pplcton. In ths cse, we ssume the MDU nterl s 3 ms, whch s usully the frme durton n VoIP, nd set the σ, l nd δ to be ms,. 3 nd 5ms 4, respectely. The smoothn prmeter α s set to be 5ms, whch n turn urntees tht ech udo MDU s rendered for 3 Threshold lue of RMSE for snle udo strem cn rne from to 5ms [11]; mxmum loss rto of most commonly used oce codecs rnes from 1% to % [7] 4 In order to reduce the buffer lenth nd the end-to-end dely, δ ws chosen to be less thn the nterl lue between two consecute MDU s n the udo strem,.e. T + δ T ( n + 1). A lrer lue, lthouh potentlly cceptble by the pplctons, wll result n lrer end-to-end dely nd lre buffer sze. t lest 3-5=5 ms. In order to keep ech clock dustment fxed lue for t lest 15s (frequent clock dustment lso ntroduces extr synchronzton error [6]), the W should be t lest mn 15/.3= 5. In our smultons, we set W mn to be 6. W s set to be 9. The smulton lenth s 1 mx mnutes ( MDU s). We rn the lorthm for 1 tertons wth dfferent dely seres for ech network condton. Fure 6 shows exmples of the operton of the synchronzton control lorthm under dfferent network condtons. The performnce results reflectn the 95% confdence nterls re summrzed n Tble I. Note tht we use the source clock s the common reference pont for the mesurement. As shown n Fure 6, our control lorthm dusts the end-to-end dely dptely to ccommodte dfferent network condtons. It keeps the end-to-end dely t n pproprte leel whle presern ood synchronzton performnce. The RMSE lue nd the loss rto re kept frly low under Moderte nd Bd network condtons. Een thouh the trnsport chnnel behor bruptly chned twce under the Seere network condton, the resultn RMSE s slhtly hher thn the threshold lue oer the whole plyout perod. It s lso to be noted tht, wth our synchronzton control lorthm, the loss rto stll remns resonbly low when seere chnes n network condton occurs. 4.3 Mult-strem Applcton We next nestte how the proposed control lorthm opertes wth mult-strem pplcton. Ths tme we ssume n pplcton tht hs one udo strem nd one deo strem. We set the prmeters bsed on the chrcterstcs of deo conferencn. For the udo strem, we stll ssume tht the MDU nterl n the udo strem s 3 ms nd set the other prmeters the sme s for the boe snle-strem. For the deo strem, we ssume tht the MDU nterl s ms (15 frmes/sec). σ nd l re set to be 5ms nd.3 5 respectely; the smoothn prmeter α s set to be ms [6]. E s set to nt be 8ms whch s the mxmum llowed nter-strem skew between udo nd deo [1]. The smulton 5 Threshold lue of RMSE for snle deo strem cn rne up to 1ms. We choose 5ms s n [6]. Mxmum tolerble loss rto of deo codecs rnes from % to 3% [7]

8 lenth s 4 seconds (1 MDU s for udo strem, nd 54 MDU s for deo strem). Wth dfferent choces of δ for the deo strem, we compre the resultnt synchronzton dstorton lues under Seere network condtons. Tble II shows the results. An, we run the lorthm for 1 tertons, nd ech lue n the tble s expressed n the form of 95% confdence nterl. We obsere tht the resultnt RMSE, especlly the nter-strem RMSE, ncreses drmtclly wth the lrer δ for the deo strem, whle the loss rto of the deo strem decreses t the sme tme. We conclude tht, n the cse of mult-strem pplctons n whch strems he nter-strem synchronzton reltonshps between ech other, dfferent δ lues cn result n extr nter-strem synchronzton errors. Consequently, n order to reduce the nter-strem dstorton to mproe the perceptul qulty 6, we set δ of the deo strem to be equl to tht of the udo strem nd rn the smulton n. Fure 7 shows the operton of the end-to-end dely control for udo nd deo strems under seere network condtons (wth δ = δ ). The results re presented n Tble III nd Tble IV. To summrze, wth our lorthm, both ntrstrem synchronzton nd nter-strem synchronzton for n A/V pplcton re presered under dfferent network condtons. When the trnsport chnnel behes well (low ere network dely nd moderte dely tter), our control scheme s cpble of mntnn low end-to-end dely wth smll buffer lenths. When the network becomes conested, our control scheme pecewsely dusts the end-to-end dely to n pproprte lue nd ncreses the buffer lenths dptely to ensure the synchronzton errors re mntned below the threshold lues. When the network resumes moderte stte, the control scheme rdully dusts the end-to-end dely lue to reflect ths chne. Note tht oer the trnston perod durn whch the network condton bruptly chnes from moderte to bd, our control scheme s stll ble to mntn ood synchronzton wth resonbly low loss rto. 6 In [3], t hs been shown tht nter-strem synchronzton s closely relted to the fnl presentton qulty. The less the nter-strem synchronzton error, the better the qulty. Dely (ms) Netw ork Dely Controlled End-to-End Dely MDU Sequence Number Dely (ms) Dely (ms) () Under Moderte Network Condton Netw ork Dely 5 45 Controlled End-to-End Dely MDU Sequence Number (b) Under Bd Network Condton 45 4 Netw ork Dely Controlled End-to-End Dely MDU Sequence Number (c) Under Seere Network Condton Fure 6. Controlled end-to-end dely determned by the synchronzton control lorthm for snle-strem pplcton (MDU nterl= 3ms, σ =ms, l =., δ =5ms, α =5ms, W =6, mn W =9, β =1) mx 5. CONCLUSIONS In ths pper, we presented synchronzton control scheme for rel-tme multmed pplctons oer the Internet n whch the synchronzton errors re used to dust the end-to-end equlzton dely. We nestted the performnce of the scheme n snlestrem nd mult-strem pplcton scenros. Smulton results show tht our scheme cn presere ood synchronzton performnce for these pplctons under dfferent network condtons.

9 The next step s to pply our lorthm to rel trces from the Internet to test the performnce of the scheme. We wll lso do n ctul mplementton of the control mechnsm n W-F deo conferencn proect n our lb. Dely (ms) Netw ork Dely 45 Controlled End-to-End Dely MDU Sequence Number n Audo Strem () Operton of end-to-end dely control for udo strem Buffer Lenth ( Number of MDUs) Dely (ms) Audo MDU Sequence Number (b) Buffern lenth of udo strem Netw ork Dely 45 Controlled End-to-End Dely MDU Sequence Number n Vudo Strem (c) Operton of end-to-end dely control for deo strem Buffer Lenth (Number of MDUs) Vdeo MDU Sequence Number (d) Buffern lenth of deo strem Fure 7. Operton of the end-to-end dely control for udo nd deo strems under seere network condton. (Audo MDU nterl= 3ms, σ =ms, l =., δ =5ms, α =5ms, Vdeo MDU nterl=66.667ms, σ =5ms, l =.3, δ =5ms, α =16.667ms, W =6, mn W =9, β =1) mx 6. REFERENCES 1. Y. Ishbsh nd S. Tsk, A Comprte Surey of Synchronzton Alorthms for Contnuous Med n Network Enronments, LCN, pp E. Bersck nd W. Geyer, Synchronzed Delery nd Plyout of Dstrbuted Stored Multmed Strems, Multmed Systems 7, pp. 7-9, Y. Ishbsh, S. Tsk nd H. Ow, A Comprson of Med Synchronzton Qulty mon Recte Control Schemes, INFOCOM 1, pp Y. Ishbsh nd S. Tsk, A Synchronzton Mechnsm for Contnuous Med n Multmed Communctons, INFOCOM 1995, pp Y. Xe, C. Lu, M. J. Lee, T. nd N. Sdw, Adpte Multmed Synchronzton n Teleconference System, Multmed Systems 7, pp , H. Lu nd M. El Zrk, Dely nd Synchronzton Control Mddlewre to support Rel-Tme Multmed Serces oer Wreless PCS Networks, IEEE Journl on Selected Ares n Communctons, Vol. 17, No. 9, pp , D. Mrs, A surey on Network QoS Needs of Adnced Internet Applctons, Workn Document of Internet QoS Workn Group, 8. U. Horn, K. Stuhlmuller, M. Lnk, nd B. Grod, Robust Internet Vdeo Trnsmsson Bsed on Sclble Codn nd Unequl Error Protecton, Ime Comuncton: Specl Issue on Rel-Tme Vdeo oer the Internet, pp , Sept D. Louno nd H. Rdh, End-to-End Internet Vdeo Trffc Dynmcs: Sttstcl Study nd Anlyss, INFOCOM. 1. R. Stenmetz, Humn Percepton of Jtter nd Med Synchronzton, IEEE Journl of Selected Ares n Communctons, ol. 14, pp , Sept R. Stenmetz nd C. Enler, Humn Percepton of Jtter nd Med Synchronzton, Internl Report #43.931, IBM Europen Networkn Center, Hedelber, Germny 1993.

10 Tble I Performnce of the synchronzton control lorthm for snle-strem pplcton under dfferent network condtons (MDU nterl= 3ms, σ =5ms, l =., δ =5ms, α =5ms, W =6, mn W =9, β =1) mx RMSE (ms) Loss rto Aere buffer lenth (number of dt unts) Aere controlled end-to-end dely (ms) Loss rto of frst 3s fter network condton chne Moderte 1.1 ±.. ±.3.6 ± ±.8 N/A Bd 1.4 ±.1.8 ±. 4.9 ± ± 1.6 N/A Seere.1 ±.1.6 ±.3 N/A N/A.6 ±.4 Tble II Performnce of synchronzton control lorthm wth dfferent δ for deo strem n A/V pplcton (udo MDU nterl= 3ms, σ =ms, l =., δ =5ms, α =5ms, deo MDU nterl=66.667ms, σ =5ms, l =.3, α =16.667ms, W =6, mn W =9, β =1) mx Inter-strem RMSE (ms) Intr-strem RMSE of udo strem (ms) Loss rto of udo strem Intr-strem RMSE of deo strem (ms) Loss rto of deo strem δ =6ms 4.1 ± ±..9 ± ± 1.. ±.1 δ =5ms.6 ±.8.5 ±..8 ±. 3.1 ±.9.8 ±.4 Tble III Synchronzton dstorton of A/V pplcton under dfferent network condtons (Audo MDU nterl= 3ms, σ =3ms, l =., δ =5ms, α =5ms, Vdeo MDU nterl=66.667ms, σ =5ms, α =16.667ms, W =6, mn W =9, β =1) mx Inter-strem RMSE (ms) Intr-strem RMSE of udo strem (ms) Loss rto of udo strem Intr-strem RMSE of deo strem (ms) Loss rto of deo strem Loss rto of frst 3s fter network condton chne (udo) l =.3, δ =5ms, Loss rto of frst 3s fter network condton chne (deo) Moderte 1.4 ± ±.5.3 ± ±.6.4 ±.3 N/A N/A Bd. ± ±.3.96 ± ±.5.96 ±.4 N/A N/A Seere.6 ±.9.5 ±..8 ±. 3.1 ±.9.8 ±.4.58 ± ±.19 Tble IV Controlled end-to-end dely nd ere buffer lenth for A/V strems (wth the sme set of prmeter s n Tble III) Aere controlled end-to-end dely of udo strem (ms) Aere buffer lenth of udo strem (number of MDU s) Aere controlled end-toend dely of deo strem (ms) Aere buffer lenth of deo strem (number of MDU s) Moderte 85.8 ± ± ± 6.4 ± Bd 89. ± ± ± ±. Seere N/A 3.5 ±.3 N/A 1.3 ±.1

WiMAX DBA Algorithm Using a 2-Tier Max-Min Fair Sharing Policy

WiMAX DBA Algorithm Using a 2-Tier Max-Min Fair Sharing Policy WMAX DBA Algorthm Usng 2-Ter Mx-Mn Fr Shrng Polcy Pe-Chen Tseng 1, J-Yn Ts 2, nd Wen-Shyng Hwng 2,* 1 Deprtment of Informton Engneerng nd Informtcs, Tzu Ch College of Technology, Hulen, Twn pechen@tccn.edu.tw

More information

Newton-Raphson Method of Solving a Nonlinear Equation Autar Kaw

Newton-Raphson Method of Solving a Nonlinear Equation Autar Kaw Newton-Rphson Method o Solvng Nonlner Equton Autr Kw Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson

More information

Optimal Pricing Scheme for Information Services

Optimal Pricing Scheme for Information Services Optml rcng Scheme for Informton Servces Shn-y Wu Opertons nd Informton Mngement The Whrton School Unversty of ennsylvn E-ml: shnwu@whrton.upenn.edu e-yu (Shron) Chen Grdute School of Industrl Admnstrton

More information

Resistive Network Analysis. The Node Voltage Method - 1

Resistive Network Analysis. The Node Voltage Method - 1 esste Network Anlyss he nlyss of n electrcl network conssts of determnng ech of the unknown rnch currents nd node oltges. A numer of methods for network nlyss he een deeloped, sed on Ohm s Lw nd Krchoff

More information

APPLICATION OF QUEUING THEORY TO DYNAMIC VEHICLE ROUTING PROBLEM Wei-Ning Chen, Kainan University Taiwan

APPLICATION OF QUEUING THEORY TO DYNAMIC VEHICLE ROUTING PROBLEM Wei-Ning Chen, Kainan University Taiwan GLOBAL JOURNAL OF BUSINESS RESEARCH VOLUME 3 NUMBER 009 APPLICATION OF QUEUING THEORY TO DYNAMIC VEHICLE ROUTING PROBLEM We-Nng Chen Knn Unersty Twn ABSTRACT In ths pper we eelope n nlyze ynmc moel of

More information

A Hadoop Job Scheduling Model Based on Uncategorized Slot

A Hadoop Job Scheduling Model Based on Uncategorized Slot Journl of Communctons Vol. 10, No. 10, October 2015 A Hdoop Job Schedulng Model Bsed on Unctegored Slot To Xue nd Tng-tng L Deprtment of Computer Scence, X n Polytechnc Unversty, X n 710048, Chn Eml: xt73@163.com;

More information

Vehicle Navigation System Integration with GPS/INS/GSM

Vehicle Navigation System Integration with GPS/INS/GSM Chun Hu Journl of Scence nd Enneern, ol.,no., pp.3-(3) ehcle Nvton System Interton wth GPS/INS/GSM Jum-Mn Ln Chen-Wen Hun, nd Fon-Lon Ts Insttute of Aeronutcs nd Astronutcs Chun-Hw Unversty Hsn-Chu 3,

More information

Irregular Repeat Accumulate Codes 1

Irregular Repeat Accumulate Codes 1 Irregulr epet Accumulte Codes 1 Hu Jn, Amod Khndekr, nd obert McElece Deprtment of Electrcl Engneerng, Clforn Insttute of Technology Psden, CA 9115 USA E-ml: {hu, mod, rjm}@systems.cltech.edu Abstrct:

More information

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of

More information

Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.

Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3. The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only

More information

Vector Geometry for Computer Graphics

Vector Geometry for Computer Graphics Vector Geometry for Computer Grphcs Bo Getz Jnury, 7 Contents Prt I: Bsc Defntons Coordnte Systems... Ponts nd Vectors Mtrces nd Determnnts.. 4 Prt II: Opertons Vector ddton nd sclr multplcton... 5 The

More information

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( ) Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

More information

ALABAMA ASSOCIATION of EMERGENCY MANAGERS

ALABAMA ASSOCIATION of EMERGENCY MANAGERS LBM SSOCTON of EMERGENCY MNGERS ON O PCE C BELLO MER E T R O CD NCY M N G L R PROFESSONL CERTFCTON PROGRM .. E. M. CERTFCTON PROGRM 2014 RULES ND REGULTONS 1. THERE WLL BE FOUR LEVELS OF CERTFCTON. BSC,

More information

ORIGIN DESTINATION DISAGGREGATION USING FRATAR BIPROPORTIONAL LEAST SQUARES ESTIMATION FOR TRUCK FORECASTING

ORIGIN DESTINATION DISAGGREGATION USING FRATAR BIPROPORTIONAL LEAST SQUARES ESTIMATION FOR TRUCK FORECASTING ORIGIN DESTINATION DISAGGREGATION USING FRATAR BIPROPORTIONAL LEAST SQUARES ESTIMATION FOR TRUCK FORECASTING Unversty of Wsconsn Mlwukee Pper No. 09-1 Ntonl Center for Freght & Infrstructure Reserch &

More information

Experiment 6: Friction

Experiment 6: Friction Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht

More information

Graphs on Logarithmic and Semilogarithmic Paper

Graphs on Logarithmic and Semilogarithmic Paper 0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl

More information

Incorporating Negative Values in AHP Using Rule- Based Scoring Methodology for Ranking of Sustainable Chemical Process Design Options

Incorporating Negative Values in AHP Using Rule- Based Scoring Methodology for Ranking of Sustainable Chemical Process Design Options 20 th Europen ymposum on Computer Aded Process Engneerng ECAPE20. Perucc nd G. Buzz Ferrrs (Edtors) 2010 Elsever B.V. All rghts reserved. Incorportng Negtve Vlues n AHP Usng Rule- Bsed corng Methodology

More information

Helicopter Theme and Variations

Helicopter Theme and Variations Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the

More information

Joint Opaque booking systems for online travel agencies

Joint Opaque booking systems for online travel agencies Jont Opque bookng systems for onlne trvel gences Mlgorzt OGOOWSKA nd Domnque TORRE Mrch 2010 Abstrct Ths pper nlyzes the propertes of the dvnced Opque bookng systems used by the onlne trvel gences n conjuncton

More information

Basic Analysis of Autarky and Free Trade Models

Basic Analysis of Autarky and Free Trade Models Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently

More information

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Fuzzy Clustering for TV Program Classification

Fuzzy Clustering for TV Program Classification Fuzzy Clusterng for TV rogrm Clssfcton Yu Zhwen Northwestern olytechncl Unversty X n,.r.chn, 7007 yuzhwen77@yhoo.com.cn Gu Jnhu Northwestern olytechncl Unversty X n,.r.chn, 7007 guh@nwpu.edu.cn Zhou Xngshe

More information

Math 135 Circles and Completing the Square Examples

Math 135 Circles and Completing the Square Examples Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for

More information

MULTI-CRITERIA DECISION AIDING IN PROJECT MANAGEMENT OUTRANKING APPROACH AND VERBAL DECISION ANALYSIS

MULTI-CRITERIA DECISION AIDING IN PROJECT MANAGEMENT OUTRANKING APPROACH AND VERBAL DECISION ANALYSIS Dorot Górec Deprtment of Econometrcs nd Sttstcs Ncolus Coperncus Unversty n Toruń MULTI-CRITERIA DECISION AIDING IN PROJECT MANAGEMENT OUTRANKING APPROACH AND VERBAL DECISION ANALYSIS Introducton A proect

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the

More information

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions. Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

More information

Small Business Cloud Services

Small Business Cloud Services Smll Business Cloud Services Summry. We re thick in the midst of historic se-chnge in computing. Like the emergence of personl computers, grphicl user interfces, nd mobile devices, the cloud is lredy profoundly

More information

Research on performance evaluation in logistics service supply chain based unascertained measure

Research on performance evaluation in logistics service supply chain based unascertained measure Suo Junun, L Yncng, Dong Humn Reserch on performnce evluton n logstcs servce suppl chn bsed unscertned mesure Abstrct Junun Suo *, Yncng L, Humn Dong Hebe Unverst of Engneerng, Hndn056038, Chn Receved

More information

Lecture 3 Gaussian Probability Distribution

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

More information

Lectures 8 and 9 1 Rectangular waveguides

Lectures 8 and 9 1 Rectangular waveguides 1 Lectures 8 nd 9 1 Rectngulr wveguides y b x z Consider rectngulr wveguide with 0 < x b. There re two types of wves in hollow wveguide with only one conductor; Trnsverse electric wves

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

The CAT model: Predicting air temperature in city streets on the basis of measured reference data

The CAT model: Predicting air temperature in city streets on the basis of measured reference data The CAT model: Predctng r temperture n cty streets on the bss of mesured reference dt Evytr Erell 1 nd Terry Wllmson 2 1 The J. Blusten Insttute For Desert Reserch, Ben-Guron Unversty of the Negev, Sde

More information

MATH 150 HOMEWORK 4 SOLUTIONS

MATH 150 HOMEWORK 4 SOLUTIONS MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive

More information

Lesson 28 Psychrometric Processes

Lesson 28 Psychrometric Processes 1 Lesson 28 Psychrometrc Processes Verson 1 ME, IIT Khrgpur 1 2 The specfc objectves of ths lecture re to: 1. Introducton to psychrometrc processes nd ther representton (Secton 28.1) 2. Importnt psychrometrc

More information

Optimal Order Processing Policies for E- commerce Servers

Optimal Order Processing Policies for E- commerce Servers Optml Order Processn Polces or E- commerce Servers Yon Tn Vy S Mooeree Kmrn Monzde Unversty o Wsnton Busness Scool Box 353 Settle Wsnton 9895-3 USA Unversty o Texs t Dlls Scool o Mnement PO Box 83688 JO44

More information

How To Set Up A Network For Your Business

How To Set Up A Network For Your Business Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

How To Use An Unersty Phone In Southmpton Solent Unerst

How To Use An Unersty Phone In Southmpton Solent Unerst IT05 Telephone nd Moble Phone Usge Polcy Introducton 1 Ths polcy sets out the generl rules for the use of Southmpton Solent Unersty s telephones nd moble phones. These serces re coordnted nd mnged by Informton

More information

IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying

IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying IS-LABEL: n Independent-Set bsed Lbeln Scheme for Pont-to-Pont Dstnce Queryn Ad W-Chee Fu, Hunhun Wu, Jmes Chen Dept. of Computer Scence nd Enneern The Chnese Unversty of Hon Kon dfu,hhwu,jchen@cse.cuhk.edu.hk

More information

SPECIAL PRODUCTS AND FACTORIZATION

SPECIAL PRODUCTS AND FACTORIZATION MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come

More information

ffiiii::#;#ltlti.*?*:j,'i#,rffi

ffiiii::#;#ltlti.*?*:j,'i#,rffi 5..1 EXPEDTNG A PROJECT. 187 700 6 o 'o-' 600 E 500 17 18 19 20 Project durtion (dys) Figure 6-6 Project cost vs. project durtion for smple crsh problem. Using Excel@ to Crsh Project T" llt ffiiii::#;#ltlti.*?*:j,'i#,rffi

More information

Rotating DC Motors Part II

Rotating DC Motors Part II Rotting Motors rt II II.1 Motor Equivlent Circuit The next step in our consiertion of motors is to evelop n equivlent circuit which cn be use to better unerstn motor opertion. The rmtures in rel motors

More information

Welch Allyn CardioPerfect Workstation Installation Guide

Welch Allyn CardioPerfect Workstation Installation Guide Welch Allyn CrdioPerfect Worksttion Instlltion Guide INSTALLING CARDIOPERFECT WORKSTATION SOFTWARE & ACCESSORIES ON A SINGLE PC For softwre version 1.6.5 or lter For network instlltion, plese refer to

More information

Distributions. (corresponding to the cumulative distribution function for the discrete case).

Distributions. (corresponding to the cumulative distribution function for the discrete case). Distributions Recll tht n integrble function f : R [,] such tht R f()d = is clled probbility density function (pdf). The distribution function for the pdf is given by F() = (corresponding to the cumultive

More information

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers. 2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this

More information

Physics 43 Homework Set 9 Chapter 40 Key

Physics 43 Homework Set 9 Chapter 40 Key Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x

More information

Models and Software for Urban and Regional Transportation Planning : The Contributions of the Center for Research on Transportation

Models and Software for Urban and Regional Transportation Planning : The Contributions of the Center for Research on Transportation Models nd Softwre for Urbn nd Regonl Plnnng : The Contrbutons of the Center for Reserch on Mchel Florn Aprl 2008 CIRRELT-2008-11 Models nd Softwre for Urbn Regonl Plnnng: The Contrbutons of the Center

More information

The Velocity Factor of an Insulated Two-Wire Transmission Line

The Velocity Factor of an Insulated Two-Wire Transmission Line The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the

More information

How To Network A Smll Business

How To Network A Smll Business Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding 1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

ClearPeaks Customer Care Guide. Business as Usual (BaU) Services Peace of mind for your BI Investment

ClearPeaks Customer Care Guide. Business as Usual (BaU) Services Peace of mind for your BI Investment ClerPeks Customer Cre Guide Business s Usul (BU) Services Pece of mind for your BI Investment ClerPeks Customer Cre Business s Usul Services Tble of Contents 1. Overview...3 Benefits of Choosing ClerPeks

More information

Operating Network Load Balancing with the Media Independent Information Service for Vehicular Based Systems

Operating Network Load Balancing with the Media Independent Information Service for Vehicular Based Systems CHI MA et l: OPERATING NETWORK LOAD BALANCING WITH THE MEDIA INDEPENDENT... Opertng Network Lod Blncng wth the Med Independent Inforton Servce for Vehculr Bsed Systes Ch M, End Fllon, Yunsong Qo, Brn Lee

More information

Algebra Review. How well do you remember your algebra?

Algebra Review. How well do you remember your algebra? Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then

More information

Physics 110 Spring 2006 2-D Motion Problems: Projectile Motion Their Solutions

Physics 110 Spring 2006 2-D Motion Problems: Projectile Motion Their Solutions Physcs 110 Sprn 006 -D Moton Problems: Projectle Moton Ther Solutons 1. A place-kcker must kck a football from a pont 36 m (about 40 yards) from the oal, and half the crowd hopes the ball wll clear the

More information

Fuzzy Logic Based Anomaly Detection for Embedded Network Security Cyber Sensor

Fuzzy Logic Based Anomaly Detection for Embedded Network Security Cyber Sensor INL/CON-10-20411 PREPRINT Fuzzy Logc Bsed Anomly Detecton for Embedded Network Securty Cyber Sensor 2011 IEEE Symposum on Computtonl Intellgence n Cyber Securty Ondre Lnd Mlos Mnc Todd Vollmer Json Wrght

More information

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00 COMP20212 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Digitl Design Techniques Dte: Fridy 16 th My 2008 Time: 14:00 16:00 Plese nswer ny THREE Questions from the FOUR questions provided

More information

Binary Representation of Numbers Autar Kaw

Binary Representation of Numbers Autar Kaw Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy

More information

2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING and CLAMPING CIRCUITS 2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

More information

EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

More information

Peak Inverse Voltage

Peak Inverse Voltage 9/13/2005 Peak Inerse Voltage.doc 1/6 Peak Inerse Voltage Q: I m so confused! The brdge rectfer and the fullwae rectfer both prode full-wae rectfcaton. Yet, the brdge rectfer use 4 juncton dodes, whereas

More information

Warm-up for Differential Calculus

Warm-up for Differential Calculus Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:

More information

On the System Dynamics of the Logistic Risk of Marketing Channels

On the System Dynamics of the Logistic Risk of Marketing Channels 1194 JOURNAL OF SOFTWARE, VOL. 8, NO. 5, MAY 2013 On the System Dynmcs of the Logstc Rsk of Mrketng Chnnels Yng M School of Mngement, Wuhn Unversty of Technology, Wuhn, Chn Eml: myng331@163.com Fe Feng

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-265 Technicl notes on using Anlog Devices DSPs, processors nd development tools Contct our technicl support t dsp.support@nlog.com nd t dsptools.support@nlog.com Or visit our

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Clipping & Scan Conversion. CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2005

Clipping & Scan Conversion. CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2005 Clipping & Scn Conersion CSE167: Computer Grphics Instructor: Stee Rotenberg UCSD, Fll 2005 Project 2 Render 3D hnd (mde up of indiidul boxes) using hierrchicl trnsformtions (push/pop) The hnd should perform

More information

Faculdade de Economia da Universidade de Coimbra

Faculdade de Economia da Universidade de Coimbra Fculdde de Econom d Unversdde de Combr Grupo de Estudos Monetáros e Fnnceros (GEMF) Av. Ds d Slv, 65 3004-52 COIMBRA, PORTUGAL gemf@fe.uc.pt http://gemf.fe.uc.pt JOSÉ A. SOARES DA FONSECA The performnce

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuity Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

More information

Quick Reference Guide: One-time Account Update

Quick Reference Guide: One-time Account Update Quick Reference Guide: One-time Account Updte How to complete The Quick Reference Guide shows wht existing SingPss users need to do when logging in to the enhnced SingPss service for the first time. 1)

More information

Sequences and Series

Sequences and Series Secto 9. Sequeces d Seres You c thk of sequece s fucto whose dom s the set of postve tegers. f ( ), f (), f (),... f ( ),... Defto of Sequece A fte sequece s fucto whose dom s the set of postve tegers.

More information

Version 001 Summer Review #03 tubman (IBII20142015) 1

Version 001 Summer Review #03 tubman (IBII20142015) 1 Version 001 Summer Reiew #03 tubmn (IBII20142015) 1 This print-out should he 35 questions. Multiple-choice questions my continue on the next column or pge find ll choices before nswering. Concept 20 P03

More information

9 CONTINUOUS DISTRIBUTIONS

9 CONTINUOUS DISTRIBUTIONS 9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete

More information

Cardiff Economics Working Papers

Cardiff Economics Working Papers Crdff Economcs Workng Ppers Workng Pper No. E204/4 Reforms, Incentves nd Bnkng Sector Productvty: A Cse of Nepl Kul B Luntel, Shekh Selm nd Pushkr Bjrchry August 204 Crdff Busness School Aberconwy Buldng

More information

NOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A

NOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A BCD DECADE COUNTERS/ 4-BIT BINARY COUNTERS The LS160A/ 161A/ 162A/ 163A are hgh-speed 4-bt synchronous counters. They are edge-trggered, synchronously presettable, and cascadable MSI buldng blocks for

More information

GFI MilArchiver 6 vs C2C Archive One Policy Mnger GFI Softwre www.gfi.com GFI MilArchiver 6 vs C2C Archive One Policy Mnger GFI MilArchiver 6 C2C Archive One Policy Mnger Who we re Generl fetures Supports

More information

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100 hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

Unit 6: Exponents and Radicals

Unit 6: Exponents and Radicals Eponents nd Rdicls -: The Rel Numer Sstem Unit : Eponents nd Rdicls Pure Mth 0 Notes Nturl Numers (N): - counting numers. {,,,,, } Whole Numers (W): - counting numers with 0. {0,,,,,, } Integers (I): -

More information

Lecture 5. Inner Product

Lecture 5. Inner Product Lecture 5 Inner Product Let us strt with the following problem. Given point P R nd line L R, how cn we find the point on the line closest to P? Answer: Drw line segment from P meeting the line in right

More information

How fast can we sort? Sorting. Decision-tree model. Decision-tree for insertion sort Sort a 1, a 2, a 3. CS 3343 -- Spring 2009

How fast can we sort? Sorting. Decision-tree model. Decision-tree for insertion sort Sort a 1, a 2, a 3. CS 3343 -- Spring 2009 CS 4 -- Spring 2009 Sorting Crol Wenk Slides courtesy of Chrles Leiserson with smll chnges by Crol Wenk CS 4 Anlysis of Algorithms 1 How fst cn we sort? All the sorting lgorithms we hve seen so fr re comprison

More information

Review guide for the final exam in Math 233

Review guide for the final exam in Math 233 Review guide for the finl exm in Mth 33 1 Bsic mteril. This review includes the reminder of the mteril for mth 33. The finl exm will be cumultive exm with mny of the problems coming from the mteril covered

More information

YOU FINALLY FINISHED YOUR FILM. NOW WHAT? Distributor...? Sales agent...? GOT IT: SELF DISTRIBUTION

YOU FINALLY FINISHED YOUR FILM. NOW WHAT? Distributor...? Sales agent...? GOT IT: SELF DISTRIBUTION YOU FINALLY FINISHED YOUR FILM. NOW WHAT? Dstrbutor...? Sles gent...? GOT IT: SELF DISTRIBUTION THE ADVANTAGES OF SELF DISTRIBUTION: A gurnteed openng n NY / LA prme theter nd you keep 100% of the boxoffce.

More information

Multi-Market Trading and Liquidity: Theory and Evidence

Multi-Market Trading and Liquidity: Theory and Evidence Mult-Mrket Trdng nd Lqudty: Theory nd Evdence Shmuel Bruch, G. Andrew Kroly, b* Mchel L. Lemmon Eccles School of Busness, Unversty of Uth, Slt Lke Cty, UT 84, USA b Fsher College of Busness, Oho Stte Unversty,

More information

SOLUTIONS TO CONCEPTS CHAPTER 5

SOLUTIONS TO CONCEPTS CHAPTER 5 1. m k S 10m Let, ccelertion, Initil velocity u 0. S ut + 1/ t 10 ½ ( ) 10 5 m/s orce: m 5 10N (ns) 40000. u 40 km/hr 11.11 m/s. 3600 m 000 k ; v 0 ; s 4m v u ccelertion s SOLUIONS O CONCEPS CHPE 5 0 11.11

More information

COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE. Skandza, Stockholm ABSTRACT

COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE. Skandza, Stockholm ABSTRACT COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE Skndz, Stockholm ABSTRACT Three methods for fitting multiplictive models to observed, cross-clssified

More information

** Dpt. Chemical Engineering, Kasetsart University, Bangkok 10900, Thailand

** Dpt. Chemical Engineering, Kasetsart University, Bangkok 10900, Thailand Modelling nd Simultion of hemicl Processes in Multi Pulse TP Experiment P. Phnwdee* S.O. Shekhtmn +. Jrungmnorom** J.T. Gleves ++ * Dpt. hemicl Engineering, Ksetsrt University, Bngkok 10900, Thilnd + Dpt.hemicl

More information

Factoring Polynomials

Factoring Polynomials Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles

More information

Design Example 1 Special Moment Frame

Design Example 1 Special Moment Frame Design Exmple 1 pecil Moment Frme OVERVIEW tructurl steel specil moment frmes (MF) re typiclly comprised of wide-flnge bems, columns, nd bem-column connections. Connections re proportioned nd detiled to

More information

Integration by Substitution

Integration by Substitution Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is

More information

Project 6 Aircraft static stability and control

Project 6 Aircraft static stability and control Project 6 Aircrft sttic stbility nd control The min objective of the project No. 6 is to compute the chrcteristics of the ircrft sttic stbility nd control chrcteristics in the pitch nd roll chnnel. The

More information

ANALYSIS OF THERMAL STRATIFICATION IN THE PRIMARY CIRCUIT WITH THE CFX CODE

ANALYSIS OF THERMAL STRATIFICATION IN THE PRIMARY CIRCUIT WITH THE CFX CODE ANALYSIS OF THERMAL STRATIFICATION IN THE PRIMARY CIRCUIT WITH THE CFX CODE Ildikó Boros, Dr. Attil Aszódi Budpest University of Technology nd Economics, Institute of Nucler Techniques Abstrct The therml

More information

The Choice of Direct Dealing or Electronic Brokerage in Foreign Exchange Trading

The Choice of Direct Dealing or Electronic Brokerage in Foreign Exchange Trading The Choce of Drect Dealng or Electronc Brokerage n Foregn Exchange Tradng Mchael Melvn & Ln Wen Arzona State Unversty Introducton Electronc Brokerage n Foregn Exchange Start from a base of zero n 1992

More information

Econ 4721 Money and Banking Problem Set 2 Answer Key

Econ 4721 Money and Banking Problem Set 2 Answer Key Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in

More information

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information