A Transparent Rate Adaptation Algorithm for Streaming Video over the Internet
|
|
- Abel McDowell
- 5 years ago
- Views:
Transcription
1 A Transparen Rae Adapaon Algorhm for Sreamng Vdeo over he Inerne L. S. Lam, Jack Y. B. Lee, S. C. Lew, and W. Wang Deparmen of Informaon Engneerng The Chnese Unversy of Hong Kong Shan, N.T., Hong Kong, Chna {lslam2, yblee, soung, ABSTRACT The lack of end-o-end qualy of servce suppor n he curren Inerne has caused sgnfcan dffcules o ensurng playback connuy n vdeo sreamng applcaons. Ths sudy addresses hs challenge by nvesgang a new adapaon algorhm o adjus he b-rae of vdeo daa n response o he nework bandwdh avalable o mprove playback connuy. Unlke prevous works, he proposed algorhm s ransparen o he vdeo clen, requres no parameer unng, and ye can ouperform exsng algorhms. Ths paper presens hs algorhm, evaluaes and compares s performance wh he bes algorhm currenly avalable usng exensve race-drven smulaons.. INTRODUCTION The lack of end-o-end qualy-of-servce (QoS) suppor n oday s Inerne has caused sgnfcan dffcules o he deploymen of vdeo sreamng servces such as vdeo broadcasng and vdeo-on-demand. In parcular, when he nework becomes congesed, sgnfcan packe losses wll arse, leadng o corruped or even dropped vdeo frames. Gven QoS suppor s unlkely o be wdely avalable n he near fuure, researchers have resored o anoher approach o ackle hs problem. Specfcally, a number of poneerng researchers have nvesgaed algorhms o adap he vdeo b-rae o he nework bandwdh avalable [-5]. For example, when he nework becomes congesed, he sender wll reduce he b-rae of he encoded vdeo o allevae he congeson. Clearly, reducng he b-rae wll also degrade he vsual qualy. Neverheless, reducng he vdeo b-rae n a conrolled manner a he sender wll resul n far beer vsual qualy han aempng o recover from daa loss a he recever. To perform vdeo adapaon we mus ackle wo fundamenal challenges. Frs, he sender mus be able o dynamcally conrol or conver he vdeo b-rae o he desred value. Ths can be accomplshed by means of scalable vdeo codng [6] and ranscodng [7-9]. Second, an adapaon algorhm s needed o esmae he nework bandwdh avalable, and subsequenly deermne he b-rae o be used for converng and ransmng he vdeo sream. Ths sudy focuses on he second challenge,.e., desgn of he rae adapaon algorhm. Ths problem has recenly been suded by a number of researchers, ncludng he sudes by Rejae, e al. [4] and Assuncao and Ghanbar [5] whch adoped UDP as he nework ranspor; and he sudes by Cueos and Ross [], Cueos, e al. [2], and Jacobs and Elefherads [3] whch adoped TCP as he nework ranspor. A common propery of hese adapaon algorhms s he exsence of a confgurable operang parameer [-2], whch s ypcally used n he feedback loop of he algorhms. No surprsngly, as wll be llusraed n Secon 5, he choce of hs operang parameer wll sgnfcanly affec he performance of he rae adapaon algorhm. Unforunaely, o opmze hs parameer for he bes performance wll requre a pror knowledge of he nework bandwdh avalable over he enre duraon of he vdeo sesson. Ths s clearly no possble n pracce and hus poses sgnfcan dffcules o deployng hese rae adapaon algorhms. In hs sudy, we address hs ssue by presenng a new rae adapaon algorhm ha does no have confgurable parameer a all. In oher words, no pror knowledge of he avalable nework bandwdh s needed nor requred o run he rae adapaon algorhm. Our resuls show ha compared o he exsng algorhms, he presened algorhm can acheve comparable or even beer performance and does so whou he need o weak any operang parameers. 2. SYSTEM MODEL In hs work we consder a vdeo sreamng sysem ha sreams pre-encoded vdeo daa usng TCP as he nework ranspor o he recever for playback. Despe he common noon ha TCP s unsuable for vdeo sreamng
2 for s aggressve congeson conrol and full relably, does possess a number of appealng feaures. Frs, TCP s nrnscally TCP-frendly and hus farness wh oher TCP raffcs s auomacally guaraneed. Second, usng TCP he sender can sream vdeo usng say he sandard HTTP proocol o he clen. As mos, f no all, vdeo players n he marke suppors HTTP-based vdeo sreamng and playback, compably s grealy enhanced. Thrd, for secury reasons, many company and ISP blocks UDP raffc a her gaeways, hus makng UDP-based vdeo sreamng mpossble. By conras, TCP/HTTP sreamng can pass hrough frewalls n he same way as web raffc. Fnally, o perform bandwdh esmaon he sender wll need some form of feedbacks from he clen. Thus wh UDP ranspor he clen wll need o be modfed o send explc feedbacks o he sender o enable bandwdh esmaon and subsequenly rae adapaon o be performed. By conras, TCP wh s bul-n flow conrol already can provde mplc feedbacks o he sender and hus no modfcaon o he clen s necessary. Agan hs wll grealy enhance he compably of he rae-adapaon algorhm o he exsng vdeo player sofware. Neverheless, he rae-adapaon algorhm presened n hs sudy can also be appled o UDP-based vdeo sreamng wh approprae suppor from he clen s player sofware (e.g. sendng explc feedbacks). Fgure shows he key componens n he vdeo sreamng sysem. Assumng he vdeo daa are encoded a a consan b rae of r max bps. The rae conroller can conver he encoded vdeo o any b-rae beween r max and r mn (e.g., usng scalable vdeo codng [6] or ranscodng [7-9]). Noe ha here s a lower lm r mn on he achevable vdeo b-rae o model, for example, he b-rae of he base layer n FGS encoded vdeo [6] or he lowes achevable b rae n ranscodng [7-9]. In pracce, even wh a ranscoder he vdeo b-rae may no be changed a arbrary me due o he srucure of he codng algorhm (e.g. group of pcures, ec.). Thus n he sysem model we assume vdeo ranscodng s performed n dscree vdeo segmens of fxed playback duraon, denoed by M seconds. The rae conroller wll hen deermne he arge b-rae for he nex vdeo segmen based on esmaon of he clen s buffer occupancy. We denoe he average b rae for he k h vdeo segmen by r k. The ranscoded vdeo segmens are hen ransmed o he clen usng TCP. Noe ha he server does no lm he ransmsson rae here and smply sends he ranscoded vdeo daa as fas as TCP allows. Ths ensures ha avalable nework bandwdh s fully ulzed. A he recever, many exsng vdeo players wll prefech a ceran amoun of vdeo daa before sarng playback o absorb he nevable bandwdh flucuaons. Brae r max Encoded Vdeo Brae r max r mn Rae Conroller TCP Nework Fgure : Block dagram of he sysem model. Clen Buffer We denoe he playback duraon of he prefeched vdeo daa by B p seconds. Dependng on he specfc player sofware, B p can be a fxed value known o he server, or can be confgurable by he users. If s he laer case and he exsng player sofware does no repor hs value o he server, he server wll smply assume he wors case of no prefech,.e. B p = 0 sec, n performng rae adapaon. Our resuls show ha he performance dfference s nsgnfcan (c.f. Secon 5-A). 3. CLIENT BUFFER OCCUPANCY AND NETWORK BANDWIDTH ESTIMATION The objecve of he rae adapaon algorhm s o preven playback sarvaon caused by clen buffer underflow. To preven buffer underflow, he server wll need o esmae he avalable nework bandwdh as well as he clen buffer occupancy, n erms of second s worh of vdeo daa. Specfcally, we make wo assumpons on he recever and he server. Frs, we assume ha he clen wll no decode and playback a vdeo frame unl s compleely receved. Thus f a frame arrves lae mssng he playback schedule, hen he player wll pause playback unl he whole frame s receved. We call he perod of me when he playback s salled due o lae frame arrval underflow me. Second, we assume ha he oal sze of he buffer n beween he server applcaon and he nework (e.g., ncludng he buffer nsde he socke lbrary and TCP) s a known consan, denoed by Z. Esmaon of he clen buffer occupancy s hen performed every me he server complees submng a vdeo frame o he nework ranspor for delvery. For example, f he common socke lbrary s used hen hs s equvalen o compleng all send() funcon calls for he vdeo frame. Le be he compleon me of submng vdeo frame for ransmsson, and le f be he ndex of he oldes frame (.e. wh he smalles ndex number) ha has no ye been compleely receved by he clen a me. Now as he server wll subm daa for ransmsson as fas as he ranspor allows, we can assume ha he nermedae buffer a he server s always full,.e., here are Z byes of daa accumulaed awang for ransmsson. Thus we can esmae f from Decoder
3 f=max n s.. sk Z () k= n where s s he sze of frame. Smlarly, afer frame + s submed for ransmsson, we can compue f + usng (). Now f f + > f, hen we know ha frame f o frame f + mus have arrved a he clen durng he me from o +. Assumng n hs shor nerval he frames arrve a he clen a a consan rae. Then we can esmae he arrval me of frame k, denoed by T k, from k + f Tk = + ( + ) k [ f, f+ ] (2) f+ f Noe ha we gnored n (2) nework and processng delay n recevng ACKs from he clen. Our smulaons show ha hs does no have sgnfcan mpac on he algorhm s performance. Knowng he arrval me of each vdeo frame, we can hen proceed o esmae he clen buffer occupancy. Le B (n seconds of vdeo daa) be he clen buffer occupancy when frame arrves a he clen and G be he frame rae of he vdeo. Then we can esmae he clen buffer occupancy B accordng o he followng rules: Case - Bp G In hs case he frame belongs o he nal prefech par of he vdeo,.e., he player has no ye sared decodng he receved vdeo daa. Thus he buffer occupancy s equal o he duraon of vdeo daa receved: B = / G (3) Case 2 - > Bp G In hs case, he way o esmae B depends on wheher or no he frame has arrved before all he daa n he clen buffer s consumed as llusraed n Fgure 2. If (T +B ) T 0, ha means frame has arrved before he clen buffer becomes empy, hen B s esmaed as: B = ( B + T ) T + / G (4) Oherwse, f (T +B ) T 0, ha means he clen buffer has been empy for a perod of me before frame arrved, hen B s smply equal o he me value of a frame,.e.: = / G (5) B From he above dervaon, we can esmae B when frame has jus arrved a he clen. However, snce he vdeo b rae of a segmen has o be deermned when all he daa of he prevous segmen has been submed no he server buffer, some frames of he prevous segmen are sll n he server buffer. Therefore, o predc he clen buffer occupancy afer all he daa of he prevous segmen has arrved a he clen, we need o predc he arrval mes of he frames n he server buffer. T - T B = (B - + T - )- T + /G B - T B = /G Fgure 2: Two ways o esmae B when > B p x G. B Perod when buffer s empy Frame Le n be he ndex of he las frame of segmen, we have o predc B a me n whle frame n f o n frame n are sll n he server buffer and hen use he predced B o perform adapaon of segmen +. n Assumng he remanng daa n he server buffer a me wll arrve a he clen a a consan rae of D n +, whch s also he esmaed TCP hroughpu for sendng he segmen +, he arrval mes of he remanng frames are esmaed as follows: k Tk = n + ( ), Fj n k f n n D + ' (6) j= fn where F () s he remanng amoun of daa of frame a me. Wh Tk, k [ f, n n ], we can esmae B. n To esmae D +, we smply ake he rae a whch segmen was submed no he server buffer as he esmaed value,.e., n ' D+ = sk ( n ) m (7) k= m where m s he ndex of he frs frame of segmen. Ths s because he rae a whch daa are submed no he server buffer s equal o he rae a whch daa leave he server buffer. 4. RATE ADAPTATION Armed wh a mean o esmae he clen buffer occupancy and nework bandwdh, he nex challenge s o devse an adapaon algorhm o conrol he vdeo b-rae o preven clen buffer underflow. A. Segmen-based Rae Conrol As vdeo daa are ranscoded and ransmed n fxed-duraon segmens, he server mus deermne he arge b-rae before converng a vdeo segmen for ransmsson. The server deermnes he arge b-rae based on wo facors, namely he esmaed clen buffer occupancy and he esmaed nework bandwdh avalable whch could be esmaed usng echnques descrbed n Secon 3.
4 Suppose segmen has jus been submed o he server buffer, wh he esmaed D + and B, we can predc n he clen buffer occupancy afer ransmng he segmen + o he clen,.e., from: B n + Mr = + (8) + Bn B n M + D ' + where he las erm s he predced me aken o send he whole + h segmen o he clen. By rearrangng (8), we oban: Bn B n + r+ = D+ ' (9) M From (9), we can relae he vdeo b-rae r + wh he esmaed clen buffer occupancy (represened by B ). n + Our goal s o adjus he vdeo b-rae o manan he clen buffer occupancy o above a gven hreshold denoed by B T such ha shor-erm bandwdh varaons can be absorbed. In pracce, B T =B p when B p s known, oherwse s se o 5 seconds. Specfcally, f Bn < B + T hen mples he clen buffer occupancy s below he hreshold. Hence he server wll reduce he vdeo b-rae o rase he buffer occupancy o B T by subsung Bn = B n (9) o oban: + T BT Bn r+ = D+ ' (0) M Oherwse f Bn B T, hen mples he clen buffer occupancy s above he hreshold. In hs case he server wll smply manan he curren clen buffer occupancy by seng B = n + B n (9) o oban r n +. Ths s a conservave sraegy o reduce he possbly of buffer underflow. Thus, we have r ' + = D+ () Fnally, he server checks and lms he compued vdeo b rae o he feasble range [r mn, r max ] by r+ = mn { rmax, max { rmn, r+ } } (2) Noe ha n conras o prevous works [-3], hs adapaon algorhm has no conrol parameer ha requres eher offlne or onlne opmzaon. Ths has praccal sgnfcance as opmzng he conrol parameers n he exsng algorhms [-3] requres a pror knowledge of he avalable nework bandwdh over he enre duraon of he vdeo sesson, clearly mpossble n pracce. B. Preempve Rae Conrol In our expermens, we found ha he avalable nework bandwdh can occasonally drops drascally o a very low value. These sudden bandwdh drops do no appear o be predcable and hus can resul n clen vdeo playback sarvaon. The fundamenal problem s ha he adapaon algorhm s execued only when a new vdeo segmen s o be ransmed. Thus f bandwdh drops sgnfcanly, hen he ransmsson of he curren vdeo segmen wll sall. The adapaon algorhm canno reac n hs case as he curren vdeo segmen has no ye been compleely ransmed. Meanwhle he clen wll connue consumng vdeo daa for playback and hus may evenually runs no buffer underflow. To ackle hs problem, we propose a preempve schedulng echnque o shoren he me a whch he adapaon algorhm can reac o changng nework condons. Insead of wang for a vdeo segmen o be compleely submed no he server buffer, he scheduler wll meou afer Mr + /D + seconds, whch s he expeced me requred o subm he + h vdeo segmen no he server buffer, even f no all vdeo daa have been submed. In hs case, any daa no ye submed for ransmsson wll be dscarded and he remanng vdeo segmen ranscoded agan accordng o he new esmaes on clen buffer occupancy and avalable nework bandwdh. Noe ha preempve rae conrol requres he vdeo ranscoder o be able o adjus he vdeo b rae n beween a vdeo segmen. The mplemenaon wll be hghly dependen on he vdeo compresson employed and furher sudy s requred o denfy he consrans and radeoffs of hs requremen. 5. PERFORMANCE EVALUATION In hs secon, we use race-drven smulaon wren n ns-2 [0] o evaluae he performance of he proposed adapaon algorhm (denoed by AVS) and compare wh he curren sae-of-he-ar algorhm proposed by Cueos and Ross [-2] (denoed by CR). Fgure 3 depcs he smulaed nework opology. We use he common NewReno TCP [-2] as he ranspor proocol o delver he vdeo daa o he clen. Cross raffc s generaed from a packe race fle obaned from Bell Labs [3-4]. The race fle capured 07 hours of nework raffc passng hrough a frewall. We dvde he 07-hour race fle no 07 -hour race fles and run a smulaon for each -hour race fle o evaluae he algorhms performance under dfferen cross raffcs. Boh he sreamng raffc and he cross raffc share a lnk of R Mbps as shown n Fgure 3. For each smulaon, we adjus R such ha he nework has jus suffcen Nework races used n he smulaons belongs o NLANR projec sponsored by he Naonal Scence Foundaon and s ANIR dvson under Cooperave Agreemen No. ANI , and he Naonal Laboraory for Appled Nework Research.
5 bandwdh o sream he vdeo R = rmax + c, where c s he average daa rae of he cross raffc. We summarze he sysem sengs n Table. We use wo performance mercs, namely underflow rao and bandwdh ulzaon, o evaluae he algorhms performance. Underflow rao s defned as he rao of underflow duraon (.e. he duraon of me ha playback sarvaon occurs) o he vdeo lengh. Bandwdh ulzaon s defned as: N max{ P+ L, S} 0 Ulzaon s v() d = (3) = 0 where N s he oal number of frames, P s he nal prefech delay, L s he move lengh, S s he oal me aken o sream he vdeo and v() s he TCP hroughpu a me. The value of bandwdh ulzaon s n he range of [0,]. Ths merc measures how well an algorhm ulzes he avalable nework bandwdh. A. Sensvy o prefech duraon The proposed rae adapaon algorhm makes use of knowledge of he clen s nal prefech duraon n esmang he clen buffer occupancy. However f hs s no known hen smply assumes no prefech s performed. To nvesgae he performance mpac of such knowledge we run wo ses of smulaons for all 07 raffc races, one se wh he prefech duraon known o he server and he oher se smply assumng no prefech. In boh cases he clen has a prefech duraon of 5 seconds. Table 2 shows he underflow rao and bandwdh averaged over all 07 races for he wo cases. In boh cases he dfferences are nsgnfcan and hus mplyng ha he proposed rae adapaon algorhm s nsensve o he knowledge of he prefech duraon. Therefore n pracce we can smply assume no prefech f he prefech duraon s no known. B. Effecveness of preempve rae conrol To nvesgae how much performance gans can be obaned from preempve rae conrol, we run wo ses of smulaons for all 07 raffc races, one wh segmen-based rae conrol and he oher wh preempve rae conrol. In all 07 races, preempve rae conrol acheves lower underflow raos compared o segmen-based rae conrol. On average, he underflow rao s reduced by 20% when preempve rae conrol s used. Neverheless preempve rae conrol does requre more complex ranscoders and hus furher nvesgaon s needed o quanfy he gans and he radeoffs. Sreamng Server 00Mbps, 0ms 00Mbps, 0ms Cross Traffc Generaor R Mbps, 00ms 00Mbps, 0ms 00Mbps, 0ms Sreamng Clen Cross Traffc Recever Fgure 3: The nework opology n he smulaon. Table : Sysem sengs for smulaons. Parameer Symbol Value Prefech duraon B p 5 seconds Vdeo segmen lengh M seconds Orgnal vdeo b-rae r max. Mbps Lowes vdeo b-rae r mn 200 kbps Vdeo Lengh 3000 seconds TCP MSS 500 byes Table 2: Effec of knowledge of he prefech duraon. Prefech Duraon Known Unknown Dfference Bandwdh Ulzaon ~0.0% Underflow Rao ~.48% C. Comparson wh he CR algorhm In hs secon, we compare he proposed rae adapaon algorhm (he AVS algorhm) wh he curren sae-of-he-ar algorhm proposed by Cueos and Ross [-2] (he CR algorhm). In he CR algorhm, here s a conrol parameer α (0 α ) ha can subsanally affec he performance. To fnd he opmal value for α s necessary o know he nework bandwdh avalably over he enre duraon of he vdeo sesson. Ths s clearly no possble n pracce and he auhors dd no explan how o adjus he parameer n pracce. Thus o oban performance resuls for he CR algorhm we run 2,000 smulaons wh he conrol parameer α vared from 0 o wh a sep sze of We found ha he opmal value for α depends heavly on he parcular raffc race chosen, and can range from 0 o 0.7 over he 07 races. As he opmal α s no known a pror, we compare CR wh AVS by compung he proporon of he 2,000 smulaon runs ha resul n hgher underflow rao han he AVS algorhm, whch does no need any parameer unng. The resuls are summarzed n Fgure 4, whch also plos he bandwdh ulzaon rao, defned as (bandwdh ulzaon of AVS)/(average bandwdh ulzaon of CR over all α values).
6 .20 ACKNOWLEDGEMENTS Porporon/Rao Ths research s funded n par by an Earmarked Gran (CUHK4229/00E) from he HKSAR Research Gran Councl and n par by he Area of Excellence Scheme, esablshed under he Unversy Grans Councl of he Hong Kong Specal Admnsrave Regon, Chna (Projec No. AoE/E-0/99). REFERENCES Trace No. Proporon of alpha values CR gves larger underflow rao Bandwdh ulzaon rao Fgure 4: Comparson of underflow raos and bandwdh ulzaon of CR and AVS for dfferen races. The resuls n Fgure 4 show ha he proposed AVS algorhm ouperforms CR n more han half of he smulaon runs wh dfferen α values. Averagng over all 07 races, he proposed AVS algorhm can acheve lower underflow rao han he CR algorhm for 77% of he α values. Ths shows ha n pracce, he proposed AVS algorhm s lkely o perform beer and ye does no requre any a pror knowledge of he nework bandwdh avalable nor unng of any conrol parameer. Despe he reducon n he underflow rao, he proposed AVS algorhm can sll make effcen use of he nework bandwdh, and achevng bandwdh ulzaon smlar o ha of he CR algorhm. 6. CONCLUSIONS In hs sudy we presened a new rae adapaon algorhm for vdeo sreamng over he Inerne. The algorhm has wo unque feaures o maxmze s compably wh exsng vdeo player sofware. Frs, we show ha he rae adapaon algorhm can be appled o sreamng vdeo over TCP/HTTP, whch s compable wh mos of he exsng vdeo player sofware. Second, he rae adapaon algorhm performs nework bandwdh and clen buffer occupancy esmaons usng only local nformaon. Thus explc feedbacks from he clen s no needed and hence exsng vdeo player sofware can be suppored. More mporanly, unlke prevous approaches he proposed algorhm does no need any parameer unng o operae nor requres a pror knowledge of he nework bandwdh avalable o perform well, hus smplfyng he deploymen of he adapaon algorhm n pracce. Our resuls show ha he proposed algorhm can ouperform exsng algorhm and ye sll acheve effcen bandwdh ulzaon. [] P. de Cueos and K.W. Ross, Adapve Rae Conrol for Sreamng Sored Fne-Graned Scalable Vdeo, Proc. NOSSDAV, May 2002, pp.3-2. [2] P. de Cueos, P. Gulloel, K.W. Ross and D. Thoreau, Implemenaon of Adapve Sreamng Of Sored MPEG-4 FGS Vdeo Over TCP, Proc. IEEE Mulmeda and Expo, 2002, pp [3] S. Jacobs and A. Elefherads, Sreamng Vdeo usng Dynamc Rae Shapng and TCP Congeson Conrol, Journal of Vsual Communcaon and Image Represenaon, Vol. 9, No. 3, 998, pp [4] R. Rejae, M. Handley and D. Esrn, Archecural consderaons for playback of qualy adapve vdeo over he Inerne, Techncal Repor , USC-CS, Nov [5] P.A.A. Assuncao and M. Ghanbar, Congeson conrol of vdeo raffc wh ranscoders, Proc. IEEE In. Conf. Communcaons, Vol., June 997, pp [6] W. L, Overvew of Fne Granulary Scalably n MPEG-4 Vdeo Sandard, IEEE Trans. Crcus and Sysems for Vdeo Tech. Vol., No. 3, March 200, pp [7] P. A. A. Assunção and G. Mohammed, A Frequency-Doman Vdeo Transcoder for Dynamc B-Rae Reducon of MPEG-2 B Sreams, IEEE Trans. Crcus and Sysems for Vdeo Tech., Vol. 8, No. 8, Dec. 998, pp [8] B. K. Naarajan and B. Vasudev, A Fas Approxmae Algorhm for Scalng down Dgal Images n he DCT Doman, Proc. IEEE In. Conf. Image Processng, Vol. 2, Oc. 995, pp [9] H. Sun, W. Kwok and J.W. Zdepsk, Archecure for MPEG compressed bsream scalng, IEEE Trans. Crcus and Sysems for Vdeo Technology, Vol. 6, No. 2, Aprl 996, pp [0] The nework smulaor ns-2. [Onlne]. Avalable: hp:// [] S. Floyd and V. Paxson, Dffcules n Smulang he Inerne, IEEE/ACM Trans. Neworkng, Vol. 9, No. 4, Augus 200, pp [2] S. Floyd and T. Henderson, The NewReno Modfcaon o TCP s Fas Recovery Algorhm, RFC 2582, Aprl 999. [3] NLANR Measuremen and Nework Analyss Group. [Onlne]. Avalable: hp://pma.nlanr.ne/traces/long/bell.hml [4] Bell Labs Inerne Traffc Research. [Onlne]. Avalable: hp://cm.bell-labs.com/cm/ms/deparmens/sa/inernetra ffc/
V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationGENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim
Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,
More informationNetworked Estimation with an Area-Triggered Transmission Method
Sensors 2008, 8, 897-909 sensors ISSN 1424-8220 2008 by MDPI www.mdp.org/sensors Full Paper Neworked Esmaon wh an Area-Trggered Transmsson Mehod Vnh Hao Nguyen and Young Soo Suh * Deparmen of Elecrcal
More informationIncreasing the Probablility of Timely and Correct Message Delivery in Road Side Unit Based Vehicular Communcation
Halmsad Unversy For he Developmen of Organsaons Producs and Qualy of Lfe. Increasng he Probablly of Tmely and Correc Message Delvery n Road Sde Un Based Vehcular Communcaon Magnus Jonsson Krsna Kuner and
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationWiH Wei He
Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground
More informationA Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
A Deermnsc Algorhm for Summarzng Asynchronous Sreams over a Sldng ndow Cosas Busch Rensselaer Polyechnc Insue Srkana Trhapura Iowa Sae Unversy Oulne of Talk Inroducon Algorhm Analyss Tme C Daa sream: 3
More informationInter-Class Resource Sharing using Statistical Service Envelopes
In Proceedngs of IEEE INFOCOM 99 Iner-Class Resource Sharng usng Sascal Servce Envelopes Jng-yu Qu and Edward W. Knghly Deparmen of Elecrcal and Compuer Engneerng Rce Unversy Absrac Neworks ha suppor mulple
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationTime-interval analysis of β decay. V. Horvat and J. C. Hardy
Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informatione-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov
June 7 e-ournal Relably: Theory& Applcaons No (Vol. CONFIDENCE INTERVALS ASSOCIATED WITH PERFORMANCE ANALYSIS OF SYMMETRIC LARGE CLOSED CLIENT/SERVER COMPUTER NETWORKS Absrac Vyacheslav Abramov School
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationOptimized Video Streaming over Cloud: A Stall-Quality Trade-off
1 Opmzed Vdeo Sreamng over Cloud: A Sall-Qualy Trade-off Abubakr Alabbas and Vanee Aggarwal arxv:1806.09466v1 cs.ni 22 Jun 2018 Absrac As vdeo-sreamng servces have expanded and mproved, cloud-based vdeo
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More informationA Novel Efficient Stopping Criterion for BICM-ID System
A Novel Effcen Soppng Creron for BICM-ID Sysem Xao Yng, L Janpng Communcaon Unversy of Chna Absrac Ths paper devses a novel effcen soppng creron for b-nerleaved coded modulaon wh erave decodng (BICM-ID)
More informationBandlimited channel. Intersymbol interference (ISI) This non-ideal communication channel is also called dispersive channel
Inersymol nererence ISI ISI s a sgnal-dependen orm o nererence ha arses ecause o devaons n he requency response o a channel rom he deal channel. Example: Bandlmed channel Tme Doman Bandlmed channel Frequency
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationAPOC #232 Capacity Planning for Fault-Tolerant All-Optical Network
APOC #232 Capacy Plannng for Faul-Toleran All-Opcal Nework Mchael Kwok-Shng Ho and Kwok-wa Cheung Deparmen of Informaon ngneerng The Chnese Unversy of Hong Kong Shan, N.T., Hong Kong SAR, Chna -mal: kwcheung@e.cuhk.edu.hk
More informationA Systematic Framework for Dynamically Optimizing Multi-User Wireless Video Transmission
A Sysemac Framework for Dynamcally Opmzng ul-user Wreless Vdeo Transmsson Fangwen Fu, haela van der Schaar Elecrcal Engneerng Deparmen, UCLA {fwfu, mhaela}@ee.ucla.edu Absrac In hs paper, we formulae he
More informationComparison of Differences between Power Means 1
In. Journal of Mah. Analyss, Vol. 7, 203, no., 5-55 Comparson of Dfferences beween Power Means Chang-An Tan, Guanghua Sh and Fe Zuo College of Mahemacs and Informaon Scence Henan Normal Unversy, 453007,
More informationExistence and Uniqueness Results for Random Impulsive Integro-Differential Equation
Global Journal of Pure and Appled Mahemacs. ISSN 973-768 Volume 4, Number 6 (8), pp. 89-87 Research Inda Publcaons hp://www.rpublcaon.com Exsence and Unqueness Resuls for Random Impulsve Inegro-Dfferenal
More informationMulti-priority Online Scheduling with Cancellations
Submed o Operaons Research manuscrp (Please, provde he manuscrp number!) Auhors are encouraged o subm new papers o INFORMS journals by means of a syle fle emplae, whch ncludes he journal le. However, use
More informationAchieving High Throughput and Low Delay by Accurately Regulating Link Queue Length over Mobile Data Network
24 IEEE h Inernaonal Conerence on Wreless and Moble Compung, eworkng and Communcaons (WMob) Achevng Hgh Throughpu and Low Delay by Accuraely Regulang Lnk ueue Lengh over Moble Daa ework e Lu Sae ey Laboraory
More information10. A.C CIRCUITS. Theoretically current grows to maximum value after infinite time. But practically it grows to maximum after 5τ. Decay of current :
. A. IUITS Synopss : GOWTH OF UNT IN IUIT : d. When swch S s closed a =; = d. A me, curren = e 3. The consan / has dmensons of me and s called he nducve me consan ( τ ) of he crcu. 4. = τ; =.63, n one
More informationSOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β
SARAJEVO JOURNAL OF MATHEMATICS Vol.3 (15) (2007), 137 143 SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β M. A. K. BAIG AND RAYEES AHMAD DAR Absrac. In hs paper, we propose
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationEfficient Asynchronous Channel Hopping Design for Cognitive Radio Networks
Effcen Asynchronous Channel Hoppng Desgn for Cognve Rado Neworks Chh-Mn Chao, Chen-Yu Hsu, and Yun-ng Lng Absrac In a cognve rado nework (CRN), a necessary condon for nodes o communcae wh each oher s ha
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationOn One Analytic Method of. Constructing Program Controls
Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna
More informationLecture 2 M/G/1 queues. M/G/1-queue
Lecure M/G/ queues M/G/-queue Posson arrval process Arbrary servce me dsrbuon Sngle server To deermne he sae of he sysem a me, we mus now The number of cusomers n he sysems N() Tme ha he cusomer currenly
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationA New Rate Control Algorithm for MPEG-4 Video Coding
A New Rae onrol Algorhm for MPEG-4 Vdeo odng Sun Yu and Ishfaq Ahmad Deparmen of ompuer Scence Hong Kong Unversy of Scence and Technology cssunyu@cs.us.hk, ahmad@cs.us.hk ABSTRAT Ths paper proposes a new
More informationPerformance Analysis for a Network having Standby Redundant Unit with Waiting in Repair
TECHNI Inernaonal Journal of Compung Scence Communcaon Technologes VOL.5 NO. July 22 (ISSN 974-3375 erformance nalyss for a Nework havng Sby edundan Un wh ang n epar Jendra Sngh 2 abns orwal 2 Deparmen
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More informationTight results for Next Fit and Worst Fit with resource augmentation
Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of
More informationDEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL
DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA
More informationCubic Bezier Homotopy Function for Solving Exponential Equations
Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.
More informationTHE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS
THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he
More informationUsing Fuzzy Pattern Recognition to Detect Unknown Malicious Executables Code
Usng Fuzzy Paern Recognon o Deec Unknown Malcous Execuables Code Boyun Zhang,, Janpng Yn, and Jngbo Hao School of Compuer Scence, Naonal Unversy of Defense Technology, Changsha 40073, Chna hnxzby@yahoo.com.cn
More informationJ i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.
umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationEcon107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)
Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen
More information12d Model. Civil and Surveying Software. Drainage Analysis Module Detention/Retention Basins. Owen Thornton BE (Mech), 12d Model Programmer
d Model Cvl and Surveyng Soware Dranage Analyss Module Deenon/Reenon Basns Owen Thornon BE (Mech), d Model Programmer owen.hornon@d.com 4 January 007 Revsed: 04 Aprl 007 9 February 008 (8Cp) Ths documen
More informationFall 2010 Graduate Course on Dynamic Learning
Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 Byoung-Tak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/
More informationNotes on the stability of dynamic systems and the use of Eigen Values.
Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon
More informationReactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times
Reacve Mehods o Solve he Berh AllocaonProblem wh Sochasc Arrval and Handlng Tmes Nsh Umang* Mchel Berlare* * TRANSP-OR, Ecole Polyechnque Fédérale de Lausanne Frs Workshop on Large Scale Opmzaon November
More informationFirst-order piecewise-linear dynamic circuits
Frs-order pecewse-lnear dynamc crcus. Fndng he soluon We wll sudy rs-order dynamc crcus composed o a nonlnear resse one-por, ermnaed eher by a lnear capacor or a lnear nducor (see Fg.. Nonlnear resse one-por
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and
More informationVolatility Interpolation
Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local
More informationProxy Cache Management for Fine-Grained Scalable Video Streaming
Proxy Cache Managemen for Fne-Graned Scalable Vdeo Sreamng Jangchuan Lu Xaowen Chu 2 Janlang Xu 2 ljc@cse.cuhk.edu.hk chxw@comp.hkbu.edu.hk xujl@comp.hkbu.edu.hk Deparmen of Compuer Scence and Engneerng
More informationLi An-Ping. Beijing , P.R.China
A New Type of Cpher: DICING_csb L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.
More informationELASTIC MODULUS ESTIMATION OF CHOPPED CARBON FIBER TAPE REINFORCED THERMOPLASTICS USING THE MONTE CARLO SIMULATION
THE 19 TH INTERNATIONAL ONFERENE ON OMPOSITE MATERIALS ELASTI MODULUS ESTIMATION OF HOPPED ARBON FIBER TAPE REINFORED THERMOPLASTIS USING THE MONTE ARLO SIMULATION Y. Sao 1*, J. Takahash 1, T. Masuo 1,
More informationLet s treat the problem of the response of a system to an applied external force. Again,
Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationRobust and Accurate Cancer Classification with Gene Expression Profiling
Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem
More informationON THE WEAK LIMITS OF SMOOTH MAPS FOR THE DIRICHLET ENERGY BETWEEN MANIFOLDS
ON THE WEA LIMITS OF SMOOTH MAPS FOR THE DIRICHLET ENERGY BETWEEN MANIFOLDS FENGBO HANG Absrac. We denfy all he weak sequenal lms of smooh maps n W (M N). In parcular, hs mples a necessary su cen opologcal
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationAnisotropic Behaviors and Its Application on Sheet Metal Stamping Processes
Ansoropc Behavors and Is Applcaon on Shee Meal Sampng Processes Welong Hu ETA-Engneerng Technology Assocaes, Inc. 33 E. Maple oad, Sue 00 Troy, MI 48083 USA 48-79-300 whu@ea.com Jeanne He ETA-Engneerng
More informationRelative controllability of nonlinear systems with delays in control
Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.
More information2.1 Constitutive Theory
Secon.. Consuve Theory.. Consuve Equaons Governng Equaons The equaons governng he behavour of maerals are (n he spaal form) dρ v & ρ + ρdv v = + ρ = Conservaon of Mass (..a) d x σ j dv dvσ + b = ρ v& +
More informationHidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University
Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden
More informationSingle-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method
10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationMath 128b Project. Jude Yuen
Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationNational Exams December 2015 NOTES: 04-BS-13, Biology. 3 hours duration
Naonal Exams December 205 04-BS-3 Bology 3 hours duraon NOTES: f doub exss as o he nerpreaon of any queson he canddae s urged o subm wh he answer paper a clear saemen of any assumpons made 2 Ths s a CLOSED
More informationA Paper presentation on. Department of Hydrology, Indian Institute of Technology, Roorkee
A Paper presenaon on EXPERIMENTAL INVESTIGATION OF RAINFALL RUNOFF PROCESS by Ank Cakravar M.K.Jan Kapl Rola Deparmen of Hydrology, Indan Insue of Tecnology, Roorkee-247667 Inroducon Ranfall-runoff processes
More informationOnline Appendix for. Strategic safety stocks in supply chains with evolving forecasts
Onlne Appendx for Sraegc safey socs n supply chans wh evolvng forecass Tor Schoenmeyr Sephen C. Graves Opsolar, Inc. 332 Hunwood Avenue Hayward, CA 94544 A. P. Sloan School of Managemen Massachuses Insue
More informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationIntroduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms
Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably
More informationLearning Objectives. Self Organization Map. Hamming Distance(1/5) Introduction. Hamming Distance(3/5) Hamming Distance(2/5) 15/04/2015
/4/ Learnng Objecves Self Organzaon Map Learnng whou Exaples. Inroducon. MAXNET 3. Cluserng 4. Feaure Map. Self-organzng Feaure Map 6. Concluson 38 Inroducon. Learnng whou exaples. Daa are npu o he syse
More informationChapter 2 Linear dynamic analysis of a structural system
Chaper Lnear dynamc analyss of a srucural sysem. Dynamc equlbrum he dynamc equlbrum analyss of a srucure s he mos general case ha can be suded as akes no accoun all he forces acng on. When he exernal loads
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
More informationarxiv: v1 [cs.sy] 2 Sep 2014
Noname manuscrp No. wll be nsered by he edor Sgnalng for Decenralzed Roung n a Queueng Nework Y Ouyang Demoshens Tenekezs Receved: dae / Acceped: dae arxv:409.0887v [cs.sy] Sep 04 Absrac A dscree-me decenralzed
More informationAppendix H: Rarefaction and extrapolation of Hill numbers for incidence data
Anne Chao Ncholas J Goell C seh lzabeh L ander K Ma Rober K Colwell and Aaron M llson 03 Rarefacon and erapolaon wh ll numbers: a framewor for samplng and esmaon n speces dversy sudes cology Monographs
More informationEpistemic Game Theory: Online Appendix
Epsemc Game Theory: Onlne Appendx Edde Dekel Lucano Pomao Marcano Snscalch July 18, 2014 Prelmnares Fx a fne ype srucure T I, S, T, β I and a probably µ S T. Le T µ I, S, T µ, βµ I be a ype srucure ha
More informationBayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Journal of Indusral Engneerng 1 (008) 35-39 The preempve resource-consraned projec schedulng problem subjec o due daes and preempon penales An neger programmng approach B. Afshar Nadjaf Deparmen of Indusral
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ
More informationOptimal environmental charges under imperfect compliance
ISSN 1 746-7233, England, UK World Journal of Modellng and Smulaon Vol. 4 (28) No. 2, pp. 131-139 Opmal envronmenal charges under mperfec complance Dajn Lu 1, Ya Wang 2 Tazhou Insue of Scence and Technology,
More informationComputing Relevance, Similarity: The Vector Space Model
Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are
More informationApproximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy
Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae
More informationImplementation of Quantized State Systems in MATLAB/Simulink
SNE T ECHNICAL N OTE Implemenaon of Quanzed Sae Sysems n MATLAB/Smulnk Parck Grabher, Mahas Rößler 2*, Bernhard Henzl 3 Ins. of Analyss and Scenfc Compung, Venna Unversy of Technology, Wedner Haupsraße
More informationStochastic Game Formulation for Cognitive Radio Networks- Short Paper
Sochasc Game Formulaon for Cognve Rado Neworks- Shor Paper Fangwen Fu and haela van der Schaar Elecrcal Engneerng Deparmen Unversy of Calforna Los Angeles (UCLA) Los Angeles Calforna USA {fwfu mhaela}@ee.ucla.edu
More informationDepartment of Economics University of Toronto
Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of
More informationDynamic Team Decision Theory
Dynamc Team Decson Theory EECS 558 Proec Repor Shruvandana Sharma and Davd Shuman December, 005 I. Inroducon Whle he sochasc conrol problem feaures one decson maker acng over me, many complex conrolled
More informationLife-Add: Lifetime Adjustable Design for WiFi Networks with Heterogeneous Energy Supplies
Lfe-Add: Lfeme Adjusable Desgn for WF Neworks wh Heerogeneous Energy Supples Shengbo Chen, Tarun Bansal, Yn Sun, Prasun Snha and Ness B. Shroff Deparmen of ECE, The Oho Sae Unversy Deparmen of CSE, The
More information2/20/2013. EE 101 Midterm 2 Review
//3 EE Mderm eew //3 Volage-mplfer Model The npu ressance s he equalen ressance see when lookng no he npu ermnals of he amplfer. o s he oupu ressance. I causes he oupu olage o decrease as he load ressance
More informationNew M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study)
Inernaonal Mahemacal Forum, Vol. 8, 3, no., 7 - HIKARI Ld, www.m-hkar.com hp://dx.do.org/.988/mf.3.3488 New M-Esmaor Objecve Funcon n Smulaneous Equaons Model (A Comparave Sudy) Ahmed H. Youssef Professor
More informationHidden Markov Models
11-755 Machne Learnng for Sgnal Processng Hdden Markov Models Class 15. 12 Oc 2010 1 Admnsrva HW2 due Tuesday Is everyone on he projecs page? Where are your projec proposals? 2 Recap: Wha s an HMM Probablsc
More information