BI-TEMPORAL INDEXING
|
|
- Cora Edwards
- 6 years ago
- Views:
Transcription
1 BI-TEMPORAL INDEXING Mirella M. Moro Uniersidade Federal do Rio Grande do Sul Poro Alegre, RS, Brazil hp:// Vassilis J. Tsoras Uniersiy of California, Rierside Rierside, CA 92521, USA hp:// SYNONYMS Bi-emporal Access Mehods DEFINITION A bi-emporal index is a daa srucure ha suppors boh emporal ime dimensions, namely, ransacionime (he ime when a fac is sored in he daabase) and alid-ime (he ime when a fac becomes alid in realiy). The characerisics of he ime dimensions suppored imply arious properies ha he bi-emporal index should hae o be efficien. As radiional indices, he performance of a emporal index is described by hree coss: (i) sorage cos (i.e., he number of pages he index occupies on he disk), (ii) updae cos (he number of pages accessed o perform an updae on he index; for example when adding, deleing or updaing a record), and (iii) query cos (he number of pages accessed for he index o answer a query). HISTORICAL BACKGROUND Mos of he early work on emporal indexing has concenraed on proiding soluions for ransacion-ime daabases. A basic propery of ransacion-ime is ha i always increases. Each newly recorded piece of daa is ime-samped wih a new, larger, ransacion ime. The immediae implicaion of his propery is ha preious ransacion imes canno be changed. Hence, a ransacion-ime daabase can rollback o, or answer queries for, any of is preious saes. On he oher hand, a alid-ime daabase mainains he enire emporal behaior of an enerprise as bes known now. I sores he curren knowledge abou he enerprise's pas, curren or een fuure behaior. If errors are discoered abou his emporal behaior, hey are correced by modifying he daabase. In general, if he knowledge abou he enerprise is updaed, he new knowledge modifies he exising one. When a correcion or an updae is applied, preious alues are no reained. I is hus no possible o iew he daabase as i was before he correcion/updae. By supporing boh alid and ransacion ime, a bi-emporal daabase combines he feaures of he oher emporal daabase ypes. While i keeps is pas saes, i also suppors changes anywhere in he alid ime domain. Hence, he oerlapping and persisen mehodologies proposed for ransacion-ime indexing (for deails see chaper on Transacion-Time Indexing) can be applied [6, 9, 5]. The difference wih ransacion-ime indexing is ha he underlying access mehod should be able o dynamically manage inerals (like an R-ree, a quad-ree ec.). For a wors-case comparison of emporal access mehods, he reader is referred o [7]. SCIENTIFIC FUNDAMENTALS When considering emporal indexing, i is imporan o realize ha he alid and ransacion ime dimensions are orhogonal [8]. While in arious scenarios i may be assumed ha daa abou a fac is enered in he daabase a he same ime as when i happens in he real world (i.e., alid and ransacion ime coincide), in pracice, here are many applicaions where his assumpion does no hold. For example, daa records abou he sales ha occurred during a gien day are recorded in he daabase a he end of he day (when bach processing of all daa colleced during he day is performed). Moreoer, a recorded alid ime may represen a laer ime insan han he ransacion ime when i was recorded. For example, a conrac may be alid for an ineral ha is laer han he (ransacion) ime when his informaion was enered in he daabase. The aboe properies are criical in he design of a bi-emporal access mehod since he suppor of boh alid and ransacion ime affecs direcly he way records are creaed or updaed. Noe ha he erm ineral is used here o mean a conex subse of he ime domain" (and no a "direced duraion"). This concep has also been named a period ; in his discussion howeer, only he erm ineral is used.
2 The reader is referred o he enry on Transacion-Time Indexing, in which a ransacion ime daabase was absraced as an eoling collecion of objecs; updaes arrie in increasing ransacion-ime order and are always applied on he laes sae of his se. In oher words, preious saes canno be changed. Thus a ransacion-ime daabase represens and sores he daabase aciiy; objecs are associaed wih inerals based on his daabase aciiy. In conras, in he chaper on Valid-Time Indexing, a alid-ime daabase was absraced as an eoling collecion of ineral-objecs, where each ineral represens he alidiy ineral of an objec. The allowable changes in his enironmen are he addiion/deleion/ modificaion of an ineral-objec. A difference wih he ransacion-ime absracion is ha he collecion's eoluion (pas saes) is no kep. Noe ha when considering he alid ime dimension, changes do no necessarily come in increasing ime order; raher hey can affec any ineral in he collecion. This implies ha a alid-ime daabase can correc errors in preiously recorded daa. Howeer, only a single daa sae is kep, he one resuling afer he correcion is applied. A bi-emporal daabase has he characerisics of boh approaches. Is absracion mainains he eoluion (hrough he suppor of ransacion-ime) of a dynamic collecion of (alid-ime) ineral-objecs. Figure 1 offers a concepual iew of a bi-emporal daabase. Insead of mainaining a single collecion of ineralobjecs (as a alid-ime daabase does) a bi-emporal daabase mainains a sequence of such collecions C( i ) indexed by ransacion-ime. Assume ha each ineral I represens he alidiy ineral of a conrac in a company. In his enironmen, he user can represen how he knowledge abou company conracs eoled. In Figure 1, he -axis (-axis) corresponds o ransacion (alid) imes. A ransacion ime 1, he daabase sars wih ineral-objecs and. A 2, a new ineral-objec I z is recorded, ec. A 5 he alidime ineral of objec is modified o a new lengh. When an ineral-objec I j is insered in he daabase a ransacion-ime, a record is creaed wih he objec's surrogae (conrac_no I j ), a alid-ime ineral (conrac duraion), and an iniial ransacion-ime ineral [, UC). When an objec is insered, i is no ye known if i (eer) will be updaed. Therefore, he righ endpoin of he ransacion-ime ineral is filled wih he ariable UC (Unil Changed), which will be changed o anoher ransacion ime if his objec is laer updaed. For example, he record for ineralobjec I z has ransacion-ime ineral [ 2, 4 ), because i was insered in he daabase a ransacion-ime 2 and was deleed a 4. Noe ha he collecions C( 3 ) and C( 4 ) correspond o he collecions C a and C b of Figure 1 in he Valid-Time Indexing chaper, assuming ha a ransacion-ime 4 he erroneous conrac I z was deleed from he daabase. C( 1 ) C( 2 ) C( 3 ) C( 4 ) C( 5 ) I z I z Figure 1. A bi-emporal daabase. Based on he aboe discussion, an index for a bi-emporal daabase should: (i) sore pas saes, (ii) suppor addiion/deleion/modificaion changes on he ineral-objecs of is curren logical sae, and (iii) efficienly access and query he ineral-objecs on any sae. Figure 1 summarizes he differences among he arious daabase ypes. Each collecion C( i ) can be hough of on is own, as a separae alid-ime daabase. A alid-ime daabase differs from a bi-emporal
3 daabase since i keeps only one collecion of ineral-objecs (he laes). A ransacion-ime daabase differs from a bi-emporal daabase in ha i mainains he hisory of an eoling se of plain-objecs insead of ineral-objecs. A ransacion-ime daabase differs from a conenional (non-emporal) daabase in ha i also keeps is pas saes insead of only he laes sae. Finally, he difference beween a alid-ime and a conenional daabase is ha he former keeps ineral-objecs (and hese inerals can be queried). There are hree approaches ha can be used for indexing bi-emporal daabases. Approach 1: The firs one is o hae each bi-emporal objec represened by a bounding recangle creaed by he objec's alid and ransacion-ime inerals, and o sore i in a conenional mulidimensional srucure like he R-ree. While his approach has he adanage of using a single index o suppor boh ime dimensions, he characerisics of ransacion-ime creae a serious oerlapping problem [5]. A bi-emporal objec wih alid-ime ineral I ha is insered in he daabase a ransacion ime, is represened by a recangle wih a ransacion-ime ineral of he form [, UC). All bi-emporal objecs ha hae no been deleed (in he ransacion sense) will share he common ransacion-ime endpoin UC (which in a ypical implemenaion, could be represened by he larges possible ransacion ime). Furhermore, inerals ha remain unchanged will creae long (in he ransacion-ime axis) recangles, a reason for furher oerlapping. A simple bi-emporal query ha asks for all alid ime inerals ha a ransacion ime i conained alid ime j, corresponds o finding all recangles ha conain poin ( i, j ). Figure 2 illusraes he bounding-recangle approach; only he alid and ransacion axis are shown. A 5, he alid-ime ineral is modified (enlarged). As a resul, he iniial recangle for ends a 5, and a new enlarged recangle is insered ranging from 5 o UC. I 2 ( i, j ) UC I Figure 2. The bounding-recangle approach for bi-emporal objecs. Approach 2: To aoid oerlapping, he use of wo R-rees has also been proposed [5]. When a biemporal objec wih alid-ime ineral I is added in he daabase a ransacion-ime, i is insered a he fron R-ree. This ree keeps bi-emporal objecs whose righ ransacion endpoin is unknown. If a biemporal objec is laer deleed a some ime ' >, i is physically deleed from he fron R-ree and insered as a recangle of heigh I and widh from o ' in he back R-ree. The back R-ree keeps biemporal objecs wih known ransacion-ime ineral. A any gien ime, all bi-emporal objecs sored in he fron R-ree share he propery ha hey are alie in he ransacion-ime sense. The emporal informaion of eery such objec is hus represened simply by a erical (alid-ime) ineral ha cus he ransacion axis a he ransacion-ime when his objec was insered in he daabase. Inserions in he fron R-ree objecs are in increasing ransacion ime while physical deleions can happen anywhere on he ransacion axis.
4 In Figure 3, he wo R-rees mehodology for bi-emporal daa is diided according o wheher heir righ ransacion endpoin is known. The scenario of Figure 2 is presened here (i.e., afer ime 5 has elapsed). The query is hen ranslaed ino an ineral inersecion and a poin enclosure problem. A simple biemporal query ha asks for all alid ime inerals which conained alid ime j a ransacion ime i, is answered wih wo searches. The back R-ree is searched for all recangles ha conain poin ( i, j ). The fron R-ree is searched for all erical inerals ha inersec a horizonal ineral H ha sars from he beginning of ransacion ime and exends unil poin i a heigh j. (0, j ) H I 3 ( 3, 2 ) ( i, j ) ( 3, 1 ) 3 The fron R-ree I 2 ( i, j ) The back R-ree Figure 3. The wo R-ree mehodology for bi-emporal daa. When an R-ree is used o index bi-emporal daa, oerlapping may also incur if he alid-ime inerals exend o he eer-increasing now. One approach could be o use he larges possible alid-ime imesamp o represen he ariable now. In [2] he problem of addressing boh he now and UC ariables is addressed by using bounding recangles/regions ha increase as he ime proceeds. A ariaion of he R-ree, he GR-ree is presened. The index leaf nodes capure he exac geomery of he bi-emporal regions of daa. Bi-emporal regions can be saic or growing, recangles or sair-shapes. Two ersions of he GR-ree are explored, one using minimum bounding recangles in non-leaf nodes, and one using minimum bounding regions in non-leaf nodes. Deails appear in [2]. Approach 3: Anoher approach o address bi-emporal problems is o use he noion of parial persisence [4,1]. This soluion emanaes from he absracion of a bi-emporal daabase as a sequence of collecions C() (in Figure 1) and has wo seps. Firs, a good index is chosen o represen each C(). This index mus suppor dynamic addiion/deleion of (alid-ime) ineral-objecs. Second, his index is made parially persisen. The collecion of queries suppored by he ineral index srucure implies which queries are answered by he bi-emporal srucure. Using his approach, he Bi-emporal R-ree ha akes an R-ree and makes i parially persisen was inroduced in [5]. Similar o he ransacion-ime daabases, one can use he oerlapping approach [3] o creae an index for bi-emporal daabases. I is necessary o use an index ha can handle he alid-ime inerals and an oerlapping approach o proide he ransacion-ime suppor. Muli-dimensional indexes can be used for supporing inerals. For example, an R-ree or a quad-ree. The Oerlapping-R-ree was proposed in [6],
5 where an R-ree mainains he alid ime inerals a each ransacion ime insan. As inerals are added/deleed or updaed, oerlapping is used o share common pahs in he relean R-rees. Likewise, [9] proposes he use of quad-rees (which can also be used for spaioemporal queries). There are wo adanages in iewing a bi-emporal query as a parial persisence or oerlapping problem. Firs, he alid-ime requiremens are disassociaed from he ransacion-ime ones. More specifically, he alid ime suppor is proided from he properies of he R-ree while he ransacion ime suppor is achieed by making his srucure parially persisen or oerlapping. Concepually, his mehodology proides fas access o he C() of ineres on which he alid-ime query is hen performed. Second, changes are always applied o he mos curren sae of he srucure and las unil updaed (if eer) a a laer ransacion ime, hus aoiding he explici represenaion of ariable UC. Considering he wo approaches, oerlapping has he adanage of simpler implemenaion, while he parial-persisence approach aoids he possible logarihmic space oerhead. KEY APPLICATIONS The imporance of emporal indexing emanaes from he many applicaions ha mainain emporal daa. The eer increasing naure of ime imposes he need for many applicaions o sore large amouns of emporal daa. Accessing such daa specialized indexing echniques is necessary. Temporal indexing has offered many such soluions ha enable fas access. CROSS REFERENCES Temporal Daabases, Transacion-Time Indexing, Valid-Time Indexing, B+-ree, R-ree RECOMMENDED READING [1] B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer (1996). An Asympoically Opimal Muliersion B- Tree. VLDB J. 5(4): [2] R. Bliujue, C.S. Jensen, S. Salenis and G. Sliinskas (1998). R-Tree Based Indexing of Now-Relaie Biemporal Daa. VLDB Conference, pp: [3] F. W. Buron, M.M. Hunbach, and J.G. Kollias (1985). Muliple Generaion Tex Files Using Oerlapping Tree Srucures. Compu. J. 28(4): [4] J.R. Driscoll, N. Sarnak, D.D. Sleaor, and R.E. Tarjan (1989). Making Daa Srucures Persisen. J. Compu. Sys. Sci. 38(1): [5] A. Kumar, V.J. Tsoras, and C. Falousos (1998). Designing Access Mehods for Biemporal Daabases. IEEE Transacions on Knowledge Daa Engineering 10(1): [6] M.A. Nascimeno and J.R.O. Sila (1998). Towards hisorical R-rees. Proceedings of SAC, pages [7] B. Salzberg and V.J. Tsoras (1999). A Comparison of Access Mehods for Time-Eoling Daa. ACM Compuing Sureys, 31(2): [8] R.T. Snodgrass and I. Ahn (1986). Temporal Daabases. IEEE Compuer 19(9): [9] T. Tzouramanis, M. Vassilakopoulos and Y. Manolopoulos (2000). Oerlapping Linear Quadrees and Spaio- Temporal Query Processing. Compu. J. 43(4):
Adding Time to an Object-Oriented Versions Model
Insiuo de Informáica Universidade Federal do Rio Grande do Sul Poro Alegre - RS - BRAZIL Adding Time o an Objec-Oriened Versions Model Mirella Moura Moro Nina Edelweiss Silvia Maria Saggiorao Clesio Saraiva
More informationImplementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationA Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationTRANSACTION-TIME INDEXING
TRANSACTION-TIME INDEXING Mirella M. Moro Universidade Federal do Rio Grande do Sul Porto Alegre, RS, Brazil http://www.inf.ufrgs.br/~mirella/ Vassilis J. Tsotras University of California, Riverside Riverside,
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationVideo Content Description Using Fuzzy Spatio-Temporal Relations
Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationScheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012
EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationData Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2
Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,
More informationNetwork management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);
QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationLecture 18: Mix net Voting Systems
6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified
More informationAnalysis of Various Types of Bugs in the Object Oriented Java Script Language Coding
Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More informationRepresenting Non-Manifold Shapes in Arbitrary Dimensions
Represening Non-Manifold Shapes in Arbirary Dimensions Leila De Floriani,2 and Annie Hui 2 DISI, Universiy of Genova, Via Dodecaneso, 35-646 Genova (Ialy). 2 Deparmen of Compuer Science, Universiy of Maryland,
More informationCAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL
CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz
More informationGauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More information3 Conceptual Graphs and Cognitive Mapping
3 Concepual Graphs and Cogniive Mapping 3.01 Inroducion Chaper 2 provided iniial evidence ha concepual graphs are a suiable knowledge-based decision suppor ool for sraegic managemen accounans. This chaper
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationCOMP26120: Algorithms and Imperative Programming
COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationDynamic Depth Recovery from Multiple Synchronized Video Streams 1
Dynamic Deph Recoery from Muliple ynchronized Video reams Hai ao, Harpree. awhney, and Rakesh Kumar Deparmen of Compuer Engineering arnoff Corporaion Uniersiy of California a ana Cruz Washingon Road ana
More information6.8 Shortest Paths. Chapter 6. Dynamic Programming. Shortest Paths: Failed Attempts. Shortest Paths
1 Chaper.8 Shore Pah Dynamic Programming Slide by Kein Wayne. Copyrigh 5 Pearon-Addion Weley. All righ reered. Shore Pah Shore Pah: Failed Aemp Shore pah problem. Gien a direced graph G = (V, E), wih edge
More informationChapter 8 LOCATION SERVICES
Disribued Compuing Group Chaper 8 LOCATION SERVICES Mobile Compuing Winer 2005 / 2006 Overview Mobile IP Moivaion Daa ransfer Encapsulaion Locaion Services & Rouing Classificaion of locaion services Home
More informationCS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II
CS 152 Compuer Archiecure and Engineering Lecure 7 - Memory Hierarchy-II Krse Asanovic Elecrical Engineering and Compuer Sciences Universiy of California a Berkeley hp://www.eecs.berkeley.edu/~krse hp://ins.eecs.berkeley.edu/~cs152
More informationVisual Indoor Localization with a Floor-Plan Map
Visual Indoor Localizaion wih a Floor-Plan Map Hang Chu Dep. of ECE Cornell Universiy Ihaca, NY 14850 hc772@cornell.edu Absrac In his repor, a indoor localizaion mehod is presened. The mehod akes firsperson
More informationSOT: Compact Representation for Triangle and Tetrahedral Meshes
SOT: Compac Represenaion for Triangle and Terahedral Meshes Topraj Gurung and Jarek Rossignac School of Ineracive Compuing, College of Compuing, Georgia Insiue of Technology, Alana, GA ABSTRACT The Corner
More informationDefinition and examples of time series
Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is
More informationSTRING DESCRIPTIONS OF DATA FOR DISPLAY*
SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac
More informationUsing CANopen Slave Driver
CAN Bus User Manual Using CANopen Slave Driver V1. Table of Conens 1. SDO Communicaion... 1 2. PDO Communicaion... 1 3. TPDO Reading and RPDO Wriing... 2 4. RPDO Reading... 3 5. CANopen Communicaion Parameer
More informationVoltair Version 2.5 Release Notes (January, 2018)
Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationQuick Verification of Concurrent Programs by Iteratively Relaxed Scheduling
Quick Verificaion of Concurren Programs by Ieraively Relaxed Scheduling Parick Mezler, Habib Saissi, Péer Bokor, Neeraj Suri Technische Univerisä Darmsad, Germany {mezler, saissi, pbokor, suri}@deeds.informaik.u-darmsad.de
More informationConstant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
Journal of Graph Algorihms and Applicaions hp://jgaa.info/ vol. 15, no. 5, pp. 569 586 (2011) Consan-Work-Space Algorihms for Shores Pahs in Trees and Simple Polygons Tesuo Asano 1 Wolfgang Mulzer 2 Yajun
More informationOutline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014
/8/0 Ouline CS8 Inroducion o Algorihm Lecure May 8, 0 Nework flow finihing capaciy-caling analyi Edmond-Karp, blocking-flow implemenaion uni-capaciy imple graph biparie maching edge-dijoin pah aignmen
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More informationLandmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases
Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu
More informationQuerying Moving Objects in SECONDO
Querying Moving Objecs in SECONDO Vicor Teixeira de Almeida, Ralf Harmu Güing, and Thomas Behr LG Daenbanksyseme für neue Anwendungen Fachbereich Informaik, Fernuniversiä Hagen D-58084 Hagen, Germany {vicor.almeida,
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationImage Content Representation
Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an
More informationReal Time Contextual Summarization of Highly Dynamic Data Streams
Real Time Conexual Summarizaion of Highly Dynamic Daa Sreams Manoj K Agarwal Microsof Bing Search Technology Cener - India Hyderabad 500032, India agarwalm@microsof.com Krihi Ramamriham Dep. of Compuer
More informationImage segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding
Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same
More informationEECS 487: Interactive Computer Graphics
EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified
More informationHandling uncertainty in semantic information retrieval process
Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,
More informationManaging XML Versions and Replicas in a P2P Context
Managing XML Versions and Replicas in a P2P Conex Deise de Brum Saccol1 1,2, Nina Edelweiss 2, Renaa de Maos Galane 2,4, Carlo Zaniolo 3 2 Insiuo de Informáica - Universidade Federal do Rio Grande do Sul
More information1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.
DRUM SET KEY Hi-ha Cmbal Clave block Cowbell (mouh) 0 Cowbell (neck) Floor om (shell) Hi om Mid om Snare Floor om Snare cross sick or clave block Bass drum Hi-ha wih foo 8 Odd Meer Clave Conor Guilfole
More informationA time-space consistency solution for hardware-in-the-loop simulation system
Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong
More informationA Deadlock-Free Multi-Granular, Hierarchical Locking Scheme for Real-time Collaborative Editing
A Deadlock-Free Muli-Granular, Hierarchical Locking Scheme for Real-ime Collaboraie Ediing Jon A. Preson and Sushil K. Prasad Deparmen of Compuer Science Georgia Sae Uniersiy Alana, GA 3030-3994 {jon.preson@acm.org,
More informationLAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation
Submission o Special Issue of CVIU on Model-based and Image-based 3D Scene Represenaion for Ineracive Visualizaion LAMP: 3D Layered, Adapive-resoluion and Muliperspecive Panorama - a New Scene Represenaion
More informationMichiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters
SHORT TERM PREDICTIONS A MONITORING SYSTEM by Michiel Helder and Marielle C.T.A Geurs Hoofdkanoor PTT Pos / Duch Posal Services Headquarers Keywords macro ime series shor erm predicions ARIMA-models faciliy
More informationMOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS
NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..
More informationA New Semantic Cache Management Method in Mobile Databases
Journal o Compuer Science 1 (3): 351-354, 25 ISSN 1549-3636 Science Publicaions, 25 A New Semanic Cache Managemen Mehod in Mobile Daabases Shengei Shi, Jianzhong Li and Chaokun Wang School o Compuer Science
More informationNRMI: Natural and Efficient Middleware
NRMI: Naural and Efficien Middleware Eli Tilevich and Yannis Smaragdakis Cener for Experimenal Research in Compuer Sysems (CERCS), College of Compuing, Georgia Tech {ilevich, yannis}@cc.gaech.edu Absrac
More informationWhy not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems
Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen
More informationIn fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps
In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied
More informationQuantitative macro models feature an infinite number of periods A more realistic (?) view of time
INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many
More informationRobust Visual Tracking for Multiple Targets
Robus Visual Tracking for Muliple Targes Yizheng Cai, Nando de Freias, and James J. Lile Universiy of Briish Columbia, Vancouver, B.C., Canada, V6T 1Z4 {yizhengc, nando, lile}@cs.ubc.ca Absrac. We address
More informationService Oriented Solution Modeling and Variation Propagation Analysis based on Architectural Building Blocks
Carnegie Mellon Universiy From he SelecedWorks of Jia Zhang Ocober, 203 Service Oriened Soluion Modeling and Variaion Propagaion Analysis based on Archiecural uilding locks Liang-Jie Zhang Jia Zhang Available
More informationFLORIDA INTERNATIONAL UNIVERSITY. Miami, Florida DIMUSE: AN INTEGRATED FRAMEWORK FOR DISTRIBUTED MULTIMEDIA
FLORIDA INTERNATIONAL UNIVERSITY Miami, Florida DIMUSE: AN INTEGRATED FRAMEWORK FOR DISTRIBUTED MULTIMEDIA SYSTEM WITH DATABASE MANAGEMENT AND SECURITY SUPPORT A disseraion submied in parial fulfillmen
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationHISTORICAL BACKGROUND
VALID-TIME INDEXING Mirella M. Moro Universidade Federal do Rio Grande do Sul Porto Alegre, RS, Brazil http://www.inf.ufrgs.br/~mirella/ Vassilis J. Tsotras University of California, Riverside Riverside,
More informationData Structures and Algorithms
Daa Srucures and Algorihms The maerial for his lecure is drawn, in ar, from The Pracice of Programming (Kernighan & Pike) Chaer 2 1 Goals of his Lecure Hel you learn (or refresh your memory) abou: Common
More informationLess Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks
Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research
More informationAutomatic Calculation of Coverage Profiles for Coverage-based Testing
Auomaic Calculaion of Coverage Profiles for Coverage-based Tesing Raimund Kirner 1 and Waler Haas 1 Vienna Universiy of Technology, Insiue of Compuer Engineering, Vienna, Ausria, raimund@vmars.uwien.ac.a
More informationAn Adaptive Spatial Depth Filter for 3D Rendering IP
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod
More informationHierarchical Recurrent Filtering for Fully Convolutional DenseNets
Hierarchical Recurren Filering for Fully Convoluional DenseNes Jo rg Wagner1,2, Volker Fischer1, Michael Herman1 and Sven Behnke2 1- Bosch Cener for Arificial Inelligence - 71272 Renningen - Germany 2-
More informationA GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER
A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER ABSTRACT Modern graphics cards for compuers, and especially heir graphics processing unis (GPUs), are designed for fas rendering of graphics.
More informationA METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS
A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,
More informationNURBS rendering in OpenSG Plus
NURS rering in OpenSG Plus F. Kahlesz Á. alázs R. Klein Universiy of onn Insiue of Compuer Science II Compuer Graphics Römersrasse 164. 53117 onn, Germany Absrac Mos of he indusrial pars are designed as
More informationWho Thinks Who Knows Who? Socio-cognitive Analysis of Networks. Technical Report
Who Thinks Who Knows Who? Socio-cogniive Analysis of Email Neworks Technical Repor Deparmen of Compuer Science and Engineering Universiy of Minnesoa 4-192 EECS Building 200 Union Sree SE Minneapolis, MN
More informationThe University of Sheffield Department of Computer Science. Indexing XML Databases: Classifications, Problems Identification and a New Approach
The Universiy of Sheffield Deparmen of Compuer Science Indexing XML Daabases: Classificaions, Problems Idenificaion and a New Approach Research Memorandum CS-7-5 Mohammed Al-Badawi Compuer Science Dep
More informationIt is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );
Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)
More informationProbabilistic Detection and Tracking of Motion Discontinuities
Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/
More informationMotor Control. 5. Control. Motor Control. Motor Control
5. Conrol In his chaper we will do: Feedback Conrol On/Off Conroller PID Conroller Moor Conrol Why use conrol a all? Correc or wrong? Supplying a cerain volage / pulsewidh will make he moor spin a a cerain
More informationVideo-Based Face Recognition Using Probabilistic Appearance Manifolds
Video-Based Face Recogniion Using Probabilisic Appearance Manifolds Kuang-Chih Lee Jeffrey Ho Ming-Hsuan Yang David Kriegman klee10@uiuc.edu jho@cs.ucsd.edu myang@honda-ri.com kriegman@cs.ucsd.edu Compuer
More informationChapter 4 Sequential Instructions
Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",
More informationComputer representations of piecewise
Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom
More information4 Error Control. 4.1 Issues with Reliable Protocols
4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can
More informationLHP: An end-to-end reliable transport protocol over wireless data networks
LHP: An end-o-end reliable ranspor proocol over wireless daa neworks Xia Gao, Suhas N. Diggavi, S. Muhukrishnan Absrac The nex generaion wireless neworks are posied o suppor large scale daa applicaions.
More informationOpportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links
1 in Low-uy-ycle Wireless Sensor Neworks wih Unreliable Links Shuo uo, Suden Member, IEEE, Liang He, Member, IEEE, Yu u, Member, IEEE, o Jiang, Suden Member, IEEE, and Tian He, Member, IEEE bsrac looding
More informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are InechOpen, he world s leading publisher of Open Access books Buil by scieniss, for scieniss 4,000 116,000 120M Open access books available Inernaional auhors and ediors Downloads Our auhors are
More informationVisualizing Complex Notions of Time
Visualizing Complex Noions of Time Rober Kosara, Silvia Miksch Insiue of Sofware Technology, Vienna Universiy of Technology, Vienna, Ausria Absrac Time plays an imporan role in medicine. Condiions are
More informationPetri Nets for Object-Oriented Modeling
Peri Nes for Objec-Oriened Modeling Sefan Wi Absrac Ensuring he correcness of concurren rograms is difficul since common aroaches for rogram design do no rovide aroriae mehods This aer gives a brief inroducion
More informationTest - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version
Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing
More informationNumerical Solution of ODE
Numerical Soluion of ODE Euler and Implici Euler resar; wih(deools): wih(plos): The package ploools conains more funcions for ploing, especially a funcion o draw a single line: wih(ploools): wih(linearalgebra):
More informationA Progressive-ILP Based Routing Algorithm for Cross-Referencing Biochips
16.3 A Progressive-ILP Based Rouing Algorihm for Cross-Referencing Biochips Ping-Hung Yuh 1, Sachin Sapanekar 2, Chia-Lin Yang 1, Yao-Wen Chang 3 1 Deparmen of Compuer Science and Informaion Engineering,
More informationRestorable Dynamic Quality of Service Routing
QOS ROUTING Resorable Dynamic Qualiy of Service Rouing Murali Kodialam and T. V. Lakshman, Lucen Technologies ABSTRACT The focus of qualiy-of-service rouing has been on he rouing of a single pah saisfying
More informationIDEF3 Process Description Capture Method
IDEF3 Process Descripion Capure Mehod IDEF3 is par of he IDEF family of mehods developmen funded by he US Air Force o provide modelling suppor for sysems engineering and enerprise inegraion 2 IDEF3 Mehod
More informationMOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:
MOBILE COMPUTING CSE 40814/60814 Fall 2015 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationMOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018
MOBILE COMPUTING CSE 40814/60814 Spring 2018 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationDETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES
Proceedings of DETC 04 ASME 004 Design Engineering Technical Conferences and Compuers and Informaion in Engineering Conference Sepember 8-Ocober, 004, Sal Lake Ciy, Uah USA DETC004/CIE-57676 VOLUME-BASED
More informationRule-Based Multi-Query Optimization
Rule-Based Muli-Query Opimizaion Mingsheng Hong Dep. of Compuer cience Cornell Universiy mshong@cs.cornell.edu Johannes Gehrke Dep. of Compuer cience Cornell Universiy johannes@cs.cornell.edu Mirek Riedewald
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More informationLet s get physical - EDA Tools for Mobility
Le s ge physical - EDA Tools for Mobiliy Aging and Reliabiliy Communicaion Mobile and Green Mobiliy - Smar and Safe Frank Oppenheimer OFFIS Insiue for Informaion Technology OFFIS a a glance Applicaion-oriened
More informationIntegro-differential splines and quadratic formulae
Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This
More informationThe Roots of Lisp paul graham
The Roos of Lisp paul graham Draf, January 18, 2002. In 1960, John McCarhy published a remarkable paper in which he did for programming somehing like wha Euclid did for geomery. 1 He showed how, given
More information