Combatting Rendering Latency

Size: px
Start display at page:

Download "Combatting Rendering Latency"

Transcription

1 Comtting Rendering Lteny Mr Olno, Jon Cohen, Mrk Mine, Gry Bishop Deprtment of Computer Siene, UNC Chpel Hill ABSTRACT Lteny or lg in n intertive grphis system is the dely etween user input nd displyed output. We hve found lteny nd the pprent oing nd swimming of ojets tht it produes to e serious prolem for hed-mounted disply (HMD) nd ugmented relity pplitions. At UNC, we hve een investigting numer of wys to redue lteny; we present two of these. Slts is n experimentl rendering system for our Pixel-Plnes 5 grphis mhine gurnteeing onstnt single NTSC field of lteny. This gurnteed response is espeilly importnt for preditive trking. Just-in-time pixels is n ttempt to ompenste for rendering lteny y rendering the pixels in snned disply sed on their position in the sn. 1 INTRODUCTION 1.1 Wht is lteny? Performne of urrent grphis systems is ommonly mesured in terms of the numer of tringles rendered per seond or in terms of the numer of omplete frmes rendered per seond. While these mesures re useful, they don t tell the whole story. Lteny, whih mesures the strt to finish time of n opertion suh s drwing single, is n often negleted mesure of grphis performne. For some urrent modes of intertion, like mnipulting 3D ojet with joystik, this mesure of responsiveness my not e importnt. But for emerging modes of nturl intertion, lteny is ritil mesure. 1.2 Why is it there? All grphis systems must hve some lteny simply euse it tkes some time to ompute n. In ddition, system tht n produe new every frme my (nd often will) hve more thn one frme of lteny. This is used y the pipelining used to inrese grphis performne. The lssi prolem with pipelining is tht it provides inresed throughput t ost in lteny. The omputtions required for single frme re divided into stges nd their exeution is overlpped. This n expnd the effetive time ville to work on tht single frme sine severl frmes re eing omputed t one. However, the lteny is s long s the full time spent omputing the frme in ll of its stges. 1.3 Why is it d? Lteny is prolem for hed-mounted disply (HMD) pplitions. The higher the totl lteny, the more the world seems to lg ehind the user s hed motions. The effet of this lg is high visosity world. The effet of lteny is even more notiele with see-through HMDs. Suh displys superimpose omputer generted ojets on the user s view of the physil world. The lg eomes ovious in this sitution euse the rel world moves without lg, while the virtul ojets shift in position during the lg time, thing up to their proper positions when the user stops moving. This swimming of the virtul ojets not only detrts from the desired illusion of the ojets physil presene, ut lso hinders ny effort to use this tehnology for rel pplitions. Most see-through HMD pplitions require world without these swimming effets. If we hope to hve pplitions present 3D instrutions to guide the performne of omplex 3D tsks [9], suh s repirs to photoopy mhine or even jet engine, the instrutions must sty fixed to the mhine in question. Current reserh into the use of see-through HMDs y ostetriins to visulize 3D ultrsound dt indites the need for lower lteny visuliztion systems [3]. The use of see-through HMDs for ssisting surgil proedures is unthinkle until we mke signifint dvnes in the re of low lteny grphis systems. 2 COMBATTING LATENCY 2.1 Mthing A possile solution to this lg prolem is to use video tehniques to use the user s view of the rel world to lg in synhroniztion with the virtul world. However, this only works while the lteny is reltively smll. 2.2 Predition Another solution to the lteny prolem is to predit where the user s hed will e when the is finlly displyed [10, 1, 2]. This tehnique, lled preditive trking, involves using oth reent trking dt nd urte knowledge of the system s totl lteny to mke est guess t the position nd orienttion of the user s hed when the is displyed inside the HMD. Azum sttes tht for predition to work effetively, the lg must e smll nd onsistent. In ft he uses the single field-time lteny rendering system (Slts), whih we will disuss shortly, to hieve urte predition.

2 A/D onverter output Pendulum Worksttion Disply Grphis Proessors LED/Photodiode Trking sensor Digitl Osillosope Photodiode Figure 1: Apprtus for externl mesurement of trking nd disply lteny. 2.3 Rendering lteny: ompenstion nd redution Rnge of solutions There re wide spetrum of pprohes tht n e used to redue lg in genertion or ompenste for it. One wy to ompenste for genertion lteny is to offset the disply of the omputed sed upon the ltest ville trking dt. This tehnique is used, for exmple, y the Visul Disply Reserh Tool (VDRT), flight simultor developed t the Nvl Trining Systems Center in Orlndo, Florid [5, 6]. VDRT is helmet-mounted lser projetion system whih projets s onto retro-refletive dome (insted of using the onventionl mosi of high resolution displys found in most flight simultors). In the VDRT system, s re first omputed sed upon the predited position of the user's hed t the time of disply. Immeditely prior to redout, the most reently ville trking dt is used to ompute the errors in the predited hed position used to generte the. These errors re then used to offset the rster of the lser projetor in pith nd yw so tht the is projeted t the ngle for whih it ws omputed. Rte signls re lso lulted nd re used to develop time dependent orretion signl whih helps keep the projeted t the orret sptil orienttion s the projetor moves during the disply field period. Similrly, Regn nd Pose re uilding the prototype for hrdwre rhiteture lled the ddress relultion pipeline[15]. This system hieves very smll lteny for hed rottions y rendering sene on the six fes of ue. As pixel is needed for disply, pproprite memory lotions from the rendered ue fes re red. A hed rottion simply lters whih memory is essed, nd thus ontriutes nothing to the lteny. Hed trnsltion is hndled y ojet-spe sudivision nd omposition. Ojets re prioritized nd re-rendered s neessry to ommodte trnsltions of the user s hed. The my not lwys e orret if the rendering hrdwre nnot keep up, ut the most importnt ojets, whih inlude the losest ones, should e rendered in time to keep their positions urte. Sine pipelining n e huge soure of lg, lteny n e redued y reduing pipelining or sing it on smller units of time like polygons or pixels insted of frmes. Most ommeril grphis systems re t lest polygon pipelined. Whtever level the pipelining, system tht omputes s frme y frme is y neessity sddled with t lest frme time of lteny. Other methods overome this y divoring the genertion from the disply updte rte. Frmeless rendering[4] n e used to redue lteny in this wy. In this tehnique pixels re updted ontinuously in rndom pttern. This removes the dependene on frmes nd fields. Ring Network Renderers Frme Buffer Worksttion Figure 2: Pixel-Plnes 5 system rhiteture Pixels my e trnsformed t whtever rte is most onvenient. This redues lteny t the ost of lrity sine only portion of the pixels re updted. The trnsform rte n remin loked to the trker updte rte or seprted on pixel-y-pixel sis s with the just-in-time pixels method, disussed next Just-in-time pixels (JITP) We will present tehnique lled just-in-time pixels, whih dels with the plement of pixels on sn-line disply s prolem of temporl lising [14]. Although the disply my tke mny milliseonds to refresh, the we see on the disply typilly represents only single instnt in time. When we see n ojet in motion on the disply, it ppers distorted euse we see the higher sn lines efore we see the lower ones, mking it seem s if the lower prt of the ojet lgs ehind the upper prt. Avoidne of this distortion entils generting every pixel the wy it should pper t the ext time of its disply. This n led to redution in lteny sine neither the hed position dt, nor the output pixels re limited to inrements of n entire frme time. This ide is of limited usefulness on urrent LCD HMDs with their sluggish response. However, it works quite well on the miniture CRT HMDs urrently ville nd is lso pplile to non-intertive video pplitions Slts As more onventionl ttk on lteny, we hve designed rendering pipeline lled Slts s tested for exploring fixed nd low lteny rendering [7]. Unlike just-in-time pixels, Slts still uses the single trnsform per frme prdigm. The rendering lteny of Slts is extly one field time (16.7 ms). This is perfet for preditive trking whih requires low nd preditle lteny. We mesure this rendering lteny from the time Slts egins trnsforming the dt set into sreen oordintes to the time the disply devies egin to sn the pixel olors from the frme uffers onto the sreens. 3 MEASURING LATENCY We hve mde oth externl nd internl mesurements of the lteny of the Pixel-Plnes 5 PPHIGS grphis lirry [13, 7]. These hve shown the genertion lteny to e etween 54 nd 57 ms for miniml dt sets. The internl mesurement methods re quite speifi to the PPHIGS lirry. However, the externl mesurements n e tken for ny grphis system. The externl lteny mesurement pprtus reords three timing signls on digitl osillosope (see figure 1). A pendulum nd led/photodiode pir provide the referene time for rel-world event the low point of the pendulum s r. A trker on the pendulum is fed into the grphis system. The grphis system

3 ojet ojet time t x time t y time t x time t y snline x mer rottion snline y snline x mer rottion snline y snout t time t x snout t time t y snout t time t x snout t time t y perieved ojet perieved ojet Figure 3: Imge genertion in onventionl omputer grphis nimtion. Snline x is displyed t time t x, snline y is displyed t time t y. strts new frme when it detets the pendulum s low point from the trking dt. An D/A onverter is used to tell the osillosope when the new frme hs strted. Frmes lternte drk nd light nd photodiode tthed to the sreen is used to tell when the hnges. The trking lteny ws the time etween the signl from the pendulum s photodiode nd the rendering strt signl out of the D/A onverter. The rendering lteny ws the time etween the signl out of the D/A onverter nd the signl from the photodiode tthed to the sreen. These time stmps were verged over numer of frmes. The internl mesurements found the sme rnge of rendering ltenies. The test ws set up to e s fir s possile given the Pixel-Plnes 5 rhiteture (figure 2, explined in more detil lter). The test involved one full sreen tringle for eh grphis proessor. This ensured tht every grphis proessor would hve work to do nd would hve rendering instrutions to send to every renderer. The first severl frmes were disrded to mke sure the pipeline ws full. Finlly, lteny determined from time stmps on the grphis proessors ws verged over numer of frmes. 4 JUST-IN-TIME PIXELS 4.1 The ide When using rster disply devie, the pixels tht mke up n re not displyed ll t one ut re spred out over time. In onventionl grphis system generting NTSC video, for exmple, the pixels t the ottom of the sreen re displyed lmost 17 ms fter those t the top. Mtters re further ggrvted when using NTSC video y the ft tht not ll of the lines of n NTSC re displyed in one rster sn ut re in ft interled ross two fields. In the first field only the odd lines in n re displyed, nd in the seond field only the even. Figure 4: Imge genertion using just-in-time pixels Thus, unless nimtion is performed on fields (i.e. generting seprte for eh field), the lst pixel in n is displyed more thn 33 ms fter the first. The prolem with this sequentil redout of dt, is tht it is not refleted in the mnner in whih the is omputed. Typilly, in onventionl omputer grphis nimtion, only single trnsform is used in generting the dt for n entire frme. Eh frme represents point smple in time whih is inonsistent with the wy in whih it is displyed. As result, s shown in figure 3 nd plte 1, the does not truly reflet the position of ojets (reltive to the view point of the mer) t the time of disply of eh pixel. A quik k of the envelope lultion n demonstrte the mgnitude of the errors tht result if this disply system dely is ignored. Assuming, for exmple, mer rottion of 200 degrees/seond ( resonle vlue when ompred with pek veloities of 370 degrees/seond during typil hed motion - see [12]) we find: Assume: 1) 200 degrees/se mer rottion 2) mer generting 60 degree Field of View (FOV) 3) NTSC video 60 fields/se NTSC video ~600 pixels/fov horizontl resolution We otin: 200 degrees 1 se degrees = 3.3 mer rottion se 60 fields field Thus in 60 degree FOV when using NTSC video: 3.3 degrees 1 FOV pixels 600 = 33 pixels error 60 degrees FOV

4 Thus with mer rottion of pproximtely 200 degrees/seond, registrtion errors of more thn 30 pixels (for NTSC video) n our in one field time. The term registrtion is eing used here to desrie the orrespondene etween the displyed nd the plement of ojets in the omputer generted world. Note tht even though the ove disussion onentrtes on mer rottion, the rgument is vlid for ny reltive motion etween the mer nd virtul ojets. Thus, even if the mer's view point is unhnging, ojets moving reltive to the mer will exhiit the sme registrtion errors s ove. The mount of error is dependent upon the veloity of the ojet reltive to the mer s view diretion. If ojet motion is omined with rottion the resulting errors re orrespondingly worse. The idel wy to generte n, therefore, would e to relulte for eh pixel the position nd orienttion of the mer nd the position nd orienttion of the sene s ojets, sed upon the time of disply of tht pixel. The resulting olor nd intensity generted for the pixel will e onsistent with the pixel s time of disply. Though ojets moving reltive to the mer would pper distorted when the frme is shown sttilly, the distorted JITP ojets will tully pper undistorted when viewed on the rster disply. As shown in figure 4 nd plte 2, eh pixel in n idel just-in-time pixels renderer represents smple of the virtul world tht is onsistent with the time of the pixel s disply. Computtion of oth the mtrix nd ojet positions for eh pixel is quite expensive. Aeptle pproximtions to justin-time pixels n e otined, however, with onsiderly less omputtion. One option is to use single trnsformtion per sn line. This relies on the hnges eing smll during the short (pproximtely 65 µs) time for the line. Clultions show this to e resonle ssumption, llowing on the order of 0.13 pixels error. Another pproximtion is to use only two trnsformtions per field, one for the first pixel nd one for the lst pixel. Ojet positions re linerly interpolted etween these two. 4.3 JITP pplied to lteny A prtil test implementtion hs een onstruted tht renders s using the just-in-time pixels prdigm. This system is intended to e used in see-through HMD to help redue genertion lteny. In rel-time JITP system, insted of omputing pixel vlues sed upon the predited position nd veloity of the virtul mer, eh pixel is omputed sed upon the position nd orienttion of the user s hed t the time of disply of tht pixel. Genertion of just-in-time pixel in rel time, therefore, requires knowledge of when pixel is going to e displyed nd where the user is going to e looking t the time. This implies the ontinuous nd prllel exeution of the following two entrl funtions: 1) Synhroniztion of genertion nd snout 2) Determintion of the position nd orienttion of the user s hed t the time of disply of eh pixel By synhronizing genertion nd snout, the JITP renderer n mke use of the detils of how the pixels in n re snned out to determine when prtiulr pixel is to e displyed. By knowing wht snline the pixel is on, for exmple, nd how fst the snlines in n re displyed, the JITP renderer n esily lulte the time of disply of tht pixel. Determintion of where the user is looking n e omplished through use of onventionl hed trking system (mgneti or optil for exmple). Determintion of where the user is looking t the time of disply of pixel requires the use of preditive trking sheme. This is due to the presene of delys etween the smpling of the position nd orienttion of the user s hed nd the orresponding disply of pixel. Inluded in the end-to-end delys is the time to ollet trking dt, genertion time nd the delys due to snout. In the urrent implementtion, the lultions for eh snline re pushed s lte s possile. Idelly dt for eh snline is trnsferred to the frme uffer just efore it is red out y the rster sn. This tehnique, known s em ring, ws first used in erly flight simultors. By pushing the grphis lultion s lte s possile, em ring llows genertion delys to e omined with disply system delys. The result is lower overll end-to-end dely whih simplifies the tsk of prediting the future position nd orienttion of the user s hed. Predition lso enefits from the ft tht the delyed omputtion mkes it possile to use the ltest ville trking dt in the genertion of the predited user view point. 5 SLATS 5.1 Brief Pixel-Plnes 5 desription To understnd how Slts works requires some knowledge of Pixel-Plnes 5 [11]. Using Pixel-Plnes 5 gve us totl ontrol over the grphis softwre, whih ws ll developed in-house. Beuse our gol ws to hieve lower lteny y modifying the rendering pipeline, suh low-level ontrol ws neessry. Referring to figure 2, Pixel-Plnes 5 uses prllelism t oth the trnsformtion nd rsteriztion stges of the rendering proess. Primitives re typilly generted on host worksttion nd sent vi ring network to set of grphis proessors (GPs), where they re stored in lol disply lists. The grphis proessors trverse these disply lists, trnsforming the primitives from ojet oordintes to sreen oordintes nd generting pproprite rendering ommnds. The grphis proessors then send these ommnds over the ring to the renderers, whih perform rsteriztion nd shding. Eh of whih hndles 128x128 region of the sreen. Finlly, the renderers send the resulting pixel vlues to frme uffer, whih is synhronized with video disply for output. 5.2 PPHIGS pipeline PPHIGS is the stndrd rendering lirry for Pixel-Plnes 5. It is ontrolled y softwre lyer lled Rendering Control [8]. The rendering proess is roken into three min stges. In the trnsform stge, the GPs trnsform the primitives. In the render stge, the renderers sn onvert nd shde the primitives. If there re more regions on the sreen thn there re renderers, the first renderer to finish strts on the next sreen region. Finlly, in the opy stge, the pixel dt is opied into the frme uffer. This is illustrted in figure 5. In this timing digrm nd the ones tht follow, eh line shows use of n independent hrdwre resoure. So the GPs, renderers, nd frme uffer n ll e used simultneously. However one stge on the GPs must e finished efore the next n egin. Arrows show, for one frme of interest, the dependenies etween the different resoures. All other timings n (nd proly will) hnge depending on the ontents of the sene.

5 GPs Renderers Frme Buffer = one frme GPs Figure 5: Bsi PPHIGS timing for frme pssing through the pipeline.,, nd re the trnsform, render, nd opy stges respetively for single frme. The rrow etween the middle of nd the strt of indites tht n egin s soon s the first region is finished in. For stereo opertion, PPHIGS hndles first the left eye nd then the right eye. However, oth re onsidered prt of single unit. When the pplition softwre sys to drw frme, s for oth eyes re drwn. This is illustrted in figure 6. Renderers Frme Buffers R L R = left eye = right eye GP Renderer L R e d f Figure 6: PPHIGS timing for stereo pir pssing through the pipeline.,, nd e re the trnsform, render, nd opy stges of the left eye., d, nd f re the right eye. As ws mentioned erlier, the timings, other thn those expliitly shown, n vry quite it. The lowest lteny possile with PPHIGS ours when the trnsform nd render stges re smll nd the opy time is the limiting ftor. In this se, the synhroniztion etween the stges fores three fields of lteny etween the time the trnsformtion egins nd the time oth eyes re omplete nd the s re displyed. This is illustrted in figure 7. Frme Buffer = left eye = right eye d e f = vertil retre Figure 7: PPHIGS timing for stereo pir with miniml lteny. Render stge to opy stge dependenies re not shown for lrity. 5.3 Slts pipeline Slts hieves its gurnteed lteny y insisting tht ll the work for one field e finished during the field immeditely efore it. Sine it is uilt with lteny sensitive HMD pplitions in mind, it lwys genertes stereo s. The pipelining in Slts is t polygon level. As soon s set of polygons re trnsformed (in lumps of 30 for ring network effiieny), they re sent to the renderers. Eh renderer hndles four sreen regions so the entire sreen for oth eyes n e overed y the ville renderers. GP Renderer Frme Buffer = oth eyes = vertil retre Figure 8: Slts timing for stereo pir.,, nd re the trnsform, render, nd opy stges respetively. Stge strts fter the first th of tringles re trnsformed in. The first hlf of must finish efore the vertil retre. Sine field is two regions high, the opy stge hppens in two prts. The opy of the seond hlf of the sreen, whih only tkes 3.9 ms, doesn t our until fter the field is lredy eing displyed. The opying of the first hlf of the sreen must e done efore the vertil retre sine those pixels re immeditely displyed. This is illustrted in figure 8. In mny wys, Slts flls short of generl grphis lirry like PPHIGS. For the ske of simpliity, it uses only single GP insted of the mny (up to 50) ville to PPHIGS. This severely limits the numer of tringles tht Slts n hndle. The use of four regions per renderer mkes polygon level pipelining esier, ut lso limits the shding model to simple Gourud olor interpoltion. All of the tringles must e trnsformed nd rendered efore the first opy egins, period of out 12.8 ms. If there re too mny primitives to mke this dedline, Slts fils to generte orret. In the urrent implementtion, this trnsltes to out 100 tringles (or 12,000 tringles per seond). Even if we optimized the ode nd PPHIGS hieved out ftor of three performne inrese fter the tringle ode ws optimized to fit in the GP instrution he the ommunition ndwidth out of one GP nd the speed of the renderers limits the mximum performne to out 250 tringles. We estimte tht using multiple GPs nd more renderers we might e le to push this to few thousnd, ut urrently don t hve plns to follow this pth. These limittions re not flws, Slts exels t wht it is uilt for: experiments requiring low lteny, fixed lteny, or oth. Azum s work on preditive trking [1] used Slts for just this reson. Beuse it onsiders oth eyes simultneously, it n shre more of the work thn PPHIGS, whih hndles them sequentilly ut grouped. In ft, oth eyes n e opied t the sme time. Beuse it only renders the lines of the visile in eh field the even lines re rendered while the odd field is visile, nd the odd lines re rendered while the even lines re visile it hs hlf the rendering nd hlf the opying. As omprison of the performne of oth, figure 9 shows the pixel error for the setup used in our video. There is 33 ms of lteny for the optil eiling trker[2], mking totl of 90 ms for PPHIGS nd 50 ms for Slts. Other trkers my hve lower lteny, ut this will only inrese the importne of genertion lteny sine the error is liner with respet to lteny[1]. The error ws lulted off-line with ptured trker dt from typil demo with nive user under the optil eiling trker. The pixel error shown is omputed y tking point in the enter of the field of view for eh frme nd

6 Error in pixels ms 50 ms Error in pixels Figure 9: Pixels of error etween pixel t the enter of the sreen nd the lotion where it should hve een displyed y the time the frme ws visile. For 90 ms, orresponding to PPHIGS 33 ms trker lteny, nd 50 ms, orresponding to Slts 33 ms trker lteny. determining how fr from the enter it would e when the frme is displyed. 6 CONCLUSION We hve presented two methods for reduing genertion lteny. Both, neessrily, t ost in polygon performne. As HMD pplitions eome more prevlent, people will require miniml lteny, muh s they do high polygon rendering performne tody. 7 ACKNOWLEDGMENTS We would like to give speil thnks to Ron Azum. Ron is responsile figure 9, nd ws huge help in the retion of the Slts video. We would lso like to thnk Tony Apod nd Pixr for ess to RenderMn, whih ws used to rete the old well JITP simultion. This projet ws funded in prt y the Ntionl Siene Foundtion, NSF Grnt Numer MIP nd NSF Coopertive Agreement Numer ASC , nd y the Advned Reserh Projets Ageny, ARPA ISTO Order Numer A410 nd ARPA Contrt DABT63-93-C-C REFERENCES 1. Azum, Ronld nd Gry Bishop. Improving Stti nd Dynmi Registrtion in n Optil See-through HMD. Proeedings of SIGGRAPH 94 (Orlndo, Florid, July 24 29, 1994). In Computer Grphis Proeedings, Annul Conferene Series, ACM SIGGRAPH, New York, 1994, pp Azum, Ronld. Preditive Trking for Augmented Relity. UNC Chpel Hill Deprtment of Computer Siene PhD Disserttion, Bjur, Mihel, Henry Fuhs nd Ryutrou Ohuhi. Merging Virtul Ojets with the Rel World: Seeing Ultrsound Imgery within the Ptient. Proeedings of SIGGRAPH 92 (Chigo, Illinois, July 26-31, 1992). In Computer Grphis, 26, 2 (July 1992), ACM SIGGRAPH, New York, 1992, pp Bishop, Gry, Henry Fuhs, Leonrd MMilln nd Ellen Sher Zgier. Frmeless Rendering: Doule Buffering Considered Hrmful. Proeedings of SIGGRAPH 94 (Orlndo, Florid, July 24 29, 1994). In Computer Grphis Proeedings, Annul Conferene Series, ACM SIGGRAPH, New York, 1994, pp Bregli, Denis, Mihel Spooner nd Dn Lo. Helmet Mounted Lser Projetor. Proeedings of the Imge Genertion/Disply Conferene II (Sottsdle, Arizon June 10 12, 1981). pp Buridge, Dik, Pul Murry. Hrdwre Improvements To The Helmet Mounted Projetor On the Visul Disply Reserh Tool (VDRT) At The Nvl Trining Systems Center. Proeedings of the SPIE onferene on Hed-Mounted Displys, Cohen, Jon nd Mr Olno. Low Lteny Rendering on Pixel-Plnes 5. UNC Chpel Hill Deprtment of Computer Siene tehnil report TR94-028, Dvid Ellsworth. Pixel-Plnes 5 Rendering Control. UNC Chpel Hill Deprtment of Computer Siene Softwre Doumenttion, Feiner, Steven, Blir MIntyre nd Dorée Seligmnn. Knowledge-sed Augmented Relity. Communitions of the ACM, 36, 7, July 1993, pp Friedmnn, Mrtin, Thd Strner nd Alex Pentlnd. Devie Synhroniztion Using n Optiml Filter. Proeedings of 1992 Symposium on Intertive 3d Grphis (Cmridge, Msshusetts, Mrh 29 April 1, 1992). Speil issue of Computer Grphis, ACM SIGGRAPH, New York, 1992 pp Fuhs, Henry, John Poulton, John Eyles, et l. Pixel- Plnes 5: A Heterogeneous Multiproessor Grphis System Using Proessor-Enhned Memories. Proeedings of SIGGRAPH 89 (Boston, MA, July 31 August 4, 1989). In Computer Grphis, 23, 3 (July 1989), ACM SIGGRAPH, New York, 1989, pp List, Uwe Nonliner Predition of Hed Movements for Helmet-Mounted Displys. Tehnil Pper AFHRL-TP-83-45, Deemer Mine, Mrk. Chrteriztion of End-to-End Delys in Hed-Mounted Disply Systems. UNC Chpel Hill Deprtment of Computer Siene tehnil report TR93-001, Mine, Mrk nd Gry Bishop. Just-In-Time Pixels. UNC Chpel Hill Deprtment of Computer Siene tehnil report TR93-005, Regn, Mtthew nd Ronld Pose. Priority Rendering with Virtul Relity Address Relultion Pipeline. Proeedings of SIGGRAPH 94 (Orlndo, Florid, July 24 29, 1994). In Computer Grphis Proeedings, Annul Conferene Series, ACM SIGGRAPH, New York, 1994, pp Wrd, Mrk, Ronld Azum, Roert Bennett, Stefn Gottshlk nd Henry Fuhs. A Demonstrted Optil Trker with Slle Work Are for Hed Mounted Disply Systems. Proeedings of 1992 Symposium on Intertive 3d Grphis (Cmridge, Msshusetts, Mrh 29 April 1, 1992). Speil issue of Computer Grphis, ACM SIGGRAPH, New York, 1992, pp

7 Plte 1: Imge from n nimtion of UNC s Old Well, moving from left to right, rendered with onventionl methods. On sn line disply, this ppers slnted. Plte 2: Imge from n nimtion of UNC s Old Well, moving from left to right, rendered with the just-in-time pixels method. On sn line disply, this ppers to e stright.

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front

More information

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions Distne Computtion etween Non-onvex Polyhedr t Short Rnge Bsed on Disrete Voronoi Regions Ktsuki Kwhi nd Hiroms Suzuki Deprtment of Preision Mhinery Engineering, The University of Tokyo 7-3-1 Hongo, Bunkyo-ku,

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

Enterprise Digital Signage Create a New Sign

Enterprise Digital Signage Create a New Sign Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their

More information

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition

More information

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup COSC 6374 Prllel Computtion Communition Performne Modeling (II) Edgr Griel Fll 2015 Overview Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition Impt of olletive ommunition

More information

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted

More information

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering

More information

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,

More information

Lecture 11: Interactive Rendering Chapters 7 in Advanced GI

Lecture 11: Interactive Rendering Chapters 7 in Advanced GI Leture 11: Intertive endering Chpters 7 in Advned GI Questions? HW 1 Fll 2004 Kvit Bl Computer Siene Cornell University Intertive Softwre endering Intertive User-driven, not pre-sripted nimtion At lest

More information

Lecture 8: Graph-theoretic problems (again)

Lecture 8: Graph-theoretic problems (again) COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V

More information

Midterm Exam CSC October 2001

Midterm Exam CSC October 2001 Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not

More information

Computational geometry

Computational geometry Leture 23 Computtionl geometry Supplementl reding in CLRS: Chpter 33 exept 33.3 There re mny importnt prolems in whih the reltionships we wish to nlyze hve geometri struture. For exmple, omputtionl geometry

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

Shared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion

Shared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion Tody s Outline Arhitetures Progrmming nd Synhroniztion Disuss pper on Cosmi Cube (messge pssing) Messge pssing review Cosmi Cube disussion > Messge pssing mhine Shred memory model > Communition > Synhroniztion

More information

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1 Additionl Mesurement Algorithms in the Overhuser Mgnetometer POS-1 O.V. Denisov, A.Y. Denisov, V.A. Spunov (QM Lortory of Url Stte Tehnil University, Mir 19, Ekterinurg, 620002, Russi) J.L. Rsson (Royl

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

A distributed edit-compile workflow

A distributed edit-compile workflow Time Synhroniztion nd Logil Cloks Tody 1. The need for time synhroniztion 2. Wll lok time synhroniztion 3. Logil Time: Lmport Cloks COS 418: Distriuted Systems Leture 4 Kyle Jmieson 2 A distriuted edit-ompile

More information

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-

More information

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page. 6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem

More information

Cameras. Importance of camera models

Cameras. Importance of camera models pture imges mesuring devie Digitl mers mers fill in memor ith olor-smple informtion D hrge-oupled Devie insted of film film lso hs finite resolution grininess depends on speed IS 00 00 6400 sie 35mm IMAX

More information

Can Pythagoras Swim?

Can Pythagoras Swim? Overview Ativity ID: 8939 Mth Conepts Mterils Students will investigte reltionships etween sides of right tringles to understnd the Pythgoren theorem nd then use it to solve prolems. Students will simplify

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

To access your mailbox from inside your organization. For assistance, call:

To access your mailbox from inside your organization. For assistance, call: 2001 Ative Voie, In. All rights reserved. First edition 2001. Proteted y one or more of the following United Sttes ptents:,070,2;,3,90;,88,0;,33,102;,8,0;,81,0;,2,7;,1,0;,90,88;,01,11. Additionl U.S. nd

More information

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut

More information

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

More information

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE 24 th Interntionl Conferene on Eletriity Distriution Glsgow, 12-15 June 2017 Pper 0615 COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE Mihel SANKUR Dniel ARNOLD Lun SCHECTOR

More information

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The

More information

Parallelization Optimization of System-Level Specification

Parallelization Optimization of System-Level Specification Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion

More information

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its

More information

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression

More information

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees. 428 T FOU 4.3 Blned Trees T BT GOIT IN T VIOU setion work well for wide vriety of pplitions, ut they hve poor worst-se performne. s we hve noted, files lredy in order, files in reverse order, files with

More information

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,

More information

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.

More information

Convex Hull Algorithms. Convex hull: basic facts

Convex Hull Algorithms. Convex hull: basic facts CG Leture D Conve Hull Algorithms Bsi fts Algorithms: Nïve, Gift wrpping, Grhm sn, Quik hull, Divide-nd-onquer Lower ound 3D Bsi fts Algorithms: Gift wrpping, Divide nd onquer, inrementl Conve hulls in

More information

Geometrical reasoning 1

Geometrical reasoning 1 MODULE 5 Geometril resoning 1 OBJECTIVES This module is for study y n individul teher or group of tehers. It: looks t pprohes to developing pupils visulistion nd geometril resoning skills; onsiders progression

More information

McAfee Network Security Platform

McAfee Network Security Platform Pssive Fil-Open Kit Quik Strt Guide Revision D MAfee Network Seurity Pltform MAfee Network Seurity Pltform IPS Sensors, when deployed in-line, route ll inoming trffi through designted port pir. However,

More information

COSC 6374 Parallel Computation. Dense Matrix Operations

COSC 6374 Parallel Computation. Dense Matrix Operations COSC 6374 Prllel Computtion Dense Mtrix Opertions Edgr Griel Fll Edgr Griel Prllel Computtion Edgr Griel erminology Dense Mtrix: ll elements of the mtrix ontin relevnt vlues ypilly stored s 2-D rry, (e.g.

More information

INTEGRATED WORKFLOW ART DIRECTOR

INTEGRATED WORKFLOW ART DIRECTOR ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures

More information

Solids. Solids. Curriculum Ready.

Solids. Solids. Curriculum Ready. Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 [Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Troubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page

Troubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page Trouleshooting This setion explins the following: Verify the Ciso Prime Collortion Provisioning Instlltion (for Advned or Stndrd Mode), pge 1 Upgrde the Ciso Prime Collortion Provisioning from Smll to

More information

UT1553B BCRT True Dual-port Memory Interface

UT1553B BCRT True Dual-port Memory Interface UTMC APPICATION NOTE UT553B BCRT True Dul-port Memory Interfce INTRODUCTION The UTMC UT553B BCRT is monolithic CMOS integrted circuit tht provides comprehensive MI-STD- 553B Bus Controller nd Remote Terminl

More information

All in One Kit. Quick Start Guide CONNECTING WITH OTHER DEVICES SDE-4003/ * 27. English-1

All in One Kit. Quick Start Guide CONNECTING WITH OTHER DEVICES SDE-4003/ * 27. English-1 All in One Kit Quik Strt Guide SDE-00/00 CONNECTING WITH OTHER DEVICES Lol PC Brodnd Modem Brodnd Router or HUB CH CH CH CH 9 0 G 9 0 ALARM RS- OUT G DC V If you do not use the Internet, just follow the

More information

Tiling Triangular Meshes

Tiling Triangular Meshes Tiling Tringulr Meshes Ming-Yee Iu EPFL I&C 1 Introdution Astrt When modelling lrge grphis senes, rtists re not epeted to model minute nd repetitive fetures suh s grss or snd with individul piees of geometry

More information

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED OLTAGE WAESHAPES M.H.J. Bollen, L.D. Zhng Dept. Eletri Power Engineering Chlmers University of Tehnology, Gothenurg, Sweden Astrt:

More information

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING Rsh Al-Tmimi et l, Interntionl Journl of Computer Siene nd Mobile Computing, Vol.4 Issue.1, Jnury- 015, pg. 11-119 Avilble Online t www.ijsm.om Interntionl Journl of Computer Siene nd Mobile Computing

More information

CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL:

CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL: CS38: Computer Grphics Modeling Trnsformtions Sung-Eui Yoon ( 윤성의 ) Course URL: http://sgl.kist.c.kr/~sungeui/cg/ Clss Ojectives (Ch. 3.5) Know the clssic dt processing steps, rendering pipeline, for rendering

More information

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Calculus Differentiation

Calculus Differentiation //007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 423 lecture 11 Jan. 28, 2008 COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

Inter-domain Routing

Inter-domain Routing COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

Fault tree conversion to binary decision diagrams

Fault tree conversion to binary decision diagrams Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.

More information

High-performance Monitoring Software. User s Manual

High-performance Monitoring Software. User s Manual High-performne Monitoring Softwre User s Mnul Introdution Thnk you for purhsing WeView Livesope MV Ver. 2.1. Plese red this mnul prior to use to ensure tht you will e le to use this softwre effetively.

More information

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012 Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt

More information

High-speed architectures for binary-tree based stream ciphers: Leviathan case study

High-speed architectures for binary-tree based stream ciphers: Leviathan case study High-speed rhitetures for inry-tree sed strem iphers: Levithn se study Astrt Rel-time pplitions suh s streming medi nd voie require enryption lgorithms tht do not propgte errors nd support fst enryption

More information

Smart Output Field Installation for M-Series and L-Series Converter

Smart Output Field Installation for M-Series and L-Series Converter Smrt Output Field Instlltion for M-Series nd L-Series Converter Instlltion Proedure -- See setion 5.0, Instlltion Proedure 1. Open the Housing nd Prepre for Instlltion 2. Plug the Rion Cle into the Min

More information

Review from Thursday. Computer Animation II. Grid acceleration. Debugging. Computer-Assisted Animation. Final project

Review from Thursday. Computer Animation II. Grid acceleration. Debugging. Computer-Assisted Animation. Final project Computer Animtion II Orienttion interpoltion Dynmis Some slides ourtesy of Leonrd MMilln nd Jon Popoi Reiew from Thursdy Interpoltion Splines Artiulted odies Forwrd kinemtis Inerse Kinemtis Optimiztion

More information

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center Resource Overview Quntile Mesure: Skill or Concept: 80Q Multiply two frctions or frction nd whole numer. (QT N ) Excerpted from: The Mth Lerning Center PO Box 99, Slem, Oregon 9709 099 www.mthlerningcenter.org

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

5 ANGLES AND POLYGONS

5 ANGLES AND POLYGONS 5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.

More information

Lecture 13: Graphs I: Breadth First Search

Lecture 13: Graphs I: Breadth First Search Leture 13 Grphs I: BFS 6.006 Fll 2011 Leture 13: Grphs I: Bredth First Serh Leture Overview Applitions of Grph Serh Grph Representtions Bredth-First Serh Rell: Grph G = (V, E) V = set of verties (ritrry

More information

Avocado: A Distributed Virtual Reality Framework

Avocado: A Distributed Virtual Reality Framework Avodo: A Distriuted Virtul Relity Frmework Henrik Trmerend GMD - Germn Ntionl Reserh Center for Informtion Tehnology henrik.trmerend@gmd.de Astrt We present Avodo, our ojet-oriented frmework for the development

More information

Assembly & Installation Instructions: 920 CPU Holder, 920-X

Assembly & Installation Instructions: 920 CPU Holder, 920-X Assemly & Instlltion Instrutions: 920 CPU Holder, 920-X Prt Inluded, CPU Holder (ll models) A Exterior Housing B Interior Housing C Hrdwre Kit (ll models) D CPU Supporting Plte F Loking Kit (models 920-FL

More information

McAfee Network Security Platform

McAfee Network Security Platform NS3x00 Quik Strt Guide Revision B MAfee Network Seurity Pltform This quik strt guide explins how to quikly set up nd tivte your MAfee Network Seurity Pltform NS3100 nd NS3200 Sensors in inline mode. These

More information

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string. CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over

More information

HW Stereotactic Targeting

HW Stereotactic Targeting HW Stereotctic Trgeting We re bout to perform stereotctic rdiosurgery with the Gmm Knife under CT guidnce. We instrument the ptient with bse ring nd for CT scnning we ttch fiducil cge (FC). Above: bse

More information

Minimal Memory Abstractions

Minimal Memory Abstractions Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.

More information

Midterm 2 Sample solution

Midterm 2 Sample solution Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the

More information

The Greedy Method. The Greedy Method

The Greedy Method. The Greedy Method Lists nd Itertors /8/26 Presenttion for use with the textook, Algorithm Design nd Applictions, y M. T. Goodrich nd R. Tmssi, Wiley, 25 The Greedy Method The Greedy Method The greedy method is generl lgorithm

More information

Right Angled Trigonometry. Objective: To know and be able to use trigonometric ratios in rightangled

Right Angled Trigonometry. Objective: To know and be able to use trigonometric ratios in rightangled C2 Right Angled Trigonometry Ojetive: To know nd e le to use trigonometri rtios in rightngled tringles opposite C Definition Trigonometry ws developed s method of mesuring ngles without ngulr units suh

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides for Data Mining by I. H. Witten and E. Frank Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully

More information

What are suffix trees?

What are suffix trees? Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search. CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke

More information

[SYLWAN., 158(6)]. ISI

[SYLWAN., 158(6)]. ISI The proposl of Improved Inext Isomorphi Grph Algorithm to Detet Design Ptterns Afnn Slem B-Brhem, M. Rizwn Jmeel Qureshi Fulty of Computing nd Informtion Tehnology, King Adulziz University, Jeddh, SAUDI

More information

HIGH-LEVEL TRANSFORMATIONS DATA-FLOW MODEL OF COMPUTATION TOKEN FLOW IN A DFG DATA FLOW

HIGH-LEVEL TRANSFORMATIONS DATA-FLOW MODEL OF COMPUTATION TOKEN FLOW IN A DFG DATA FLOW 1 2 Topis: * Dt-flow grphs * (Non)overlpped sheduling * Miniml itertion period Further reding: * Trnsformtions for speed-up * Trnsformtions for low power Prhi, K.K., High-Level Algorithm nd Arhiteture

More information