Online Appendix to: Generalizing Database Forensics
|
|
- Dinah Bryan
- 5 years ago
- Views:
Transcription
1 Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that allows us to ientify many types of corruption events. A. THE FORENSIC ANALYSIS PROTOCOL Figures show ifferent parts of the formulation of the forensic analysis protocol (broken across four iagrams). We will iscuss Page Write Timestamp corruption (on isk), corruption, an Schema corruption using the the four figures as a guie. Data corruptions which affect an entire tuple will not be iscusse since no tools exist right now that aequately analyze these problems, even though we can etect that corruption is present. In general, the ientification of leaves for which no forensic tools exist (marke with Pening Future Work ) is part of our future work. After the section evote to the common starting path of the forensic protocol, each of the following sections correspons to the leaves of the above-liste major corruption subtypes. We emphasize that this protocol assumes a single corruption event. A iagram epicting the taxonomy an protocol together can be accesse at protocol.pf. The upper portion of the figures show portions of the UML taxonomy of corruption events (in shae rectangles). Everything appearing below the taxonomy epicts the steps taken an the tools use in the forensic analysis protocol, in orer to reach the leaves in the taxonomy. Within the lower position of the protocol are conitionals in iamons that enote questions istinguishing between variations of the same corruption subtype, irectives in (unshae) rectangles that inicate some computational task to be performe, an connectors in ellipses that connect the ifferent parts of the protocol using unique labels. Observables are the results of conitionals an of the forensic analysis algorithms. Recall that forensic analysis is a one-to-one corresponence between the observables an the elements in the taxonomy. Such a strong corresponence might not be possible to establish, either because of lack of tools (in this case the forensic analysis algorithms) or ue to the nature of the problem. Hence, we characterize forensic analysis as a mapping from observables to subsets of the taxonomy, which we term conclusion sets. Elements belonging to the same conclusion set are inistinguishable from one another given the available tools. Conclusion sets are shown in parallelograms. A legen in Figure 16 summarizes this useful information. The flow of analysis in the protocol is generally upwar, as inicate by the arrows. A.1. Initial Steps in Forensic Analysis Protocol Figure 16 shows that the protocol starts at the bottom of the iagram. The first question to be aske is whether the DBA has chosen a atabase scheme in which recors are physically clustere by their partition fiel. If the recors are clustere then in aition to the regular valiation proceure we must check the orer of recors uring the scan. This result will be useful later on in the protocol (vi. Figure 18). c 2013 ACM /2013/06-ART12 $15.00 DOI: ACM Transactions on Database Systems, Vol. 38,. 2, Article 12, Publication ate: June 2013.
2 App 2 K. E. Pavlou an R. T. Snograss Label B Explicit Label A Virtual (static numbere page partitioning) Which partition scheme is use? Implicit Label C True VE 0 False Label D False "DB is in a legal state." True VEn Perform valiation. : Forensic Analysis : Scheme Choice Perform Valiation while checking orer uring scan. Directive Recors physically clustere by partition fiel? UML class/subclass Output START Label X Connector to other figure with same label Fig. 16. Initial steps in forensic analysis protocol. ACM Transactions on Database Systems, Vol. 38,. 2, Article 12, Publication ate: June 2013.
3 Generalizing Database Forensics App 3 If the most recent Valiation Event returns true then the total hash chain has not been compromise. This implies that the atabase is not corrupte an it is in a legal state. If the Valiation Event returns false, meaning that the total chain has been corrupte, then we nee to ascertain whether this is ue to Schema corruption. This is achieve by valiating the notarize hash value corresponing to the atabase schema. If VE 0 is false, thus revealing schema corruption, we must follow Label D into Figure 19 to ientify the type of schema corruption. The iscussion for this can be foun in Section A.4. If VE 0 is true then no schema corruption has occurre. Before we can procee an execute the forensic analysis algorithm (in this case, the various types of a3d) we must choose the appropriate one base on the particular partitioning scheme use. Labels A, B, an C lea to the iscussion of use an results of the forensic analysis algorithm, for a Virtual (static-numbere pages), an Explicit (zip coe), or an Implicit (commit-time) partitioning scheme, respectively. The first label connects to Figure 17 with further iscussion foun in Section A.2, while the latter two connect to Figure 18 with further iscussion foun in Section A.3. As mentione earlier, espite running a forensic analysis algorithm we have no way of ascertaining whether an entire tuple on isk has been corrupte, that is, we o not yet have tools that coul istinguish it from other types of corruption. A.2. Corruption of Page Write Timestamps on Disk Figure 17 provies the portion of the protocol require for the ientification of corrupte Page Write Timestamps when these are store on isk as per the static-numbere pagebase partition scheme. Even though this is a type of corruption which occurs uner a Virtual partitioning scheme it oes not affect the partition attribute itself, namely the page number. In fact, in the case of static-numbere page-base partition scheme, the page number is not explicitly store anywhere an therefore cannot be corrupte. The algorithm can etermine the page number just by looking at what page the tuples resies in. A genuine Virtual corruption can occur in the nonstatic-numbere-page partitioning scheme but currently there are no tools to analyze such a corruption (vi. Section A.3 for more etails). After ascertaining that static-numbere page partition scheme is use (vi. Figure 16) we follow Label A into Figure 17. The Page-base a3d Forensic Analysis Algorithm is run, which coul yiel one or two resulting corruption regions. If a single corruption region is returne then we conclue that non-partition attribute has been corrupte. If two corruption regions are returne then a Page Write Timestamp resiing on a page on isk has been corrupte. Changing the timestamp will cause the associate ata to be hashe in the wrong orer uring the valiation scan. This causes the creation of two corruption regions: one correspons to the missing page (i.e., the position where the page ought to have been hashe) an the other to the new page (i.e., the position where the page is actually hashe). If the timestamp is change to later time the page will be hashe at a later stage in the valiation scan, while if it is change to an earlier time the page will be hash at an earlier stage. The former corruption is terme postating an the latter backating. Currently, we have no tools to istinguishing between the two types of corruption. (Physical clustering cannot help us here because we cannot cluster the pages by page write time since the same page albeit with ifferent contents is written out to isk multiple times.) We are force to resort to the backup tapes which will allow us to etermine the irection of corruption. (Even though there might be ways to fin the irection of timestamp corruption without making use of the backup tapes.) Discovering the original correct timestamp an comparing it with the corrupte one will allow us to ecie if the timestamp has been Backate or Postate. ACM Transactions on Database Systems, Vol. 38,. 2, Article 12, Publication ate: June 2013.
4 App 4 K. E. Pavlou an R. T. Snograss Data Corruption Page Write Timestamp NB: This is only for page base partitioning. Entire Tuple Backate Postate Partition n Partition Attr. Corrupte "to" before "from"? Determine "irection" of corruption. Compare backup tapes with ata. 2 How many regions oes the 1 Algorithm yiel? Run page base Variable Level a3d Forensic Algorithm. Label A VEn = False; VE0 = True ( schema corruption); Static Numbere Page base partitioning. Fig. 17. Forensic analysis protocol to ientify Page Write Timestamp corruption. ACM Transactions on Database Systems, Vol. 38,. 2, Article 12, Publication ate: June 2013.
5 Generalizing Database Forensics App 5 A.3. Corruption of Partition on Disk Figure 18 shows the portion of the forensic analysis protocol which allows for the ientification of the corruption event that affects partition attributes on isk; the attribute happens to be one that the ata are partitione on. This leas to three possibilities epening on the nature of the partition attribute, each with a ifferent forensic analysis technique applicable: Virtual attribute-base (non-static-numbere page-base), Explicit -base (what previous sections calle simply attribute-base), an Implicit attribute (commit-time-base). Page-base ata partitioning with non-statically numbere pages presents an interesting challenge. For example, in the case of τ BerkeleyDB [Snograss et al. 2004], the recors are store in the leaf noes of a B+-tree inex. The B+-tree invariant ictates that leaves must be at least half full, a fact which causes page splits. This results in recors migrating from the page they were originally store in an consequently in the page number of a specific recor changing over time. An effective forensic analysis algorithm for non-static-numbere page partitioning scheme has yet to be esigne. Following Label C into Figure 18 we first run Commit-time-base a3d Forensic Analysis Algorithm. We know we are partitioning on an Implicit (e.g., committime timestamps) so then next step is to check how many corruption regions the forensic analysis algorithm create. If it returne only one then we can safely say that the corruption affecte an attribute the ata are not partitione on. Elsewhere [Pavlou an Snograss 2008] this was terme a ata-only corruption an coul be either retroactive or introactive. If two corruption regions are prouce by the algorithm then this implies that an implicit attribute (timestamp) has been corrupte since a single corruption of a nonpartition attribute cannot yiel two corruption regions. w we must istinguish between a corruption which results in a backate timestamp an one which results in a postate timestamp. To achieve this we can impose a spatial organization on the atabase by exploiting the physical orer on the ata. Data can be store in contiguous segments of the isk in orer of commit time or of any attribute whose values/granules are naturally orere, for instance, age, transaction ID, page number, primary key, or accoring to any orer impose a hoc. This is essentially a heap where new recors are appene at the en. Let us consier a Backating CE. Backating is in effect the removal of a tuple from its original location on the isk an its subsequent introuction into a ifferent location. Changing only the timestamp, with no physical movement of the tuple, will rener the tuple to be out of orer, something that is evience of corruption. Therefore, to answer the to before from conitional we use the result of checking the orer of recors uring the Valiation scan (cf. initial steps of Figure 16). This is feasible because changing only the timestamp, with no physical movement of the tuple, will rener the tuple to be out of orer with respect to the impose physical orer, something which is evience of corruption. A tuple with an earlier timestamp than the timestamps of the proceeing tuples is evience of backating. Conversely, a tuple with a later timestamp than the timestamps of the succeeing tuples is evience of postating. If the ata are not physically clustere then we must compare the current ata with the ata in the backup tapes to etermine the irection of corruption. If the new value of the change implicit attribute (timestamp) refers to a time before the original value then we the corruption resulte in a backate timestamp. Otherwise, we have ientifie a postate timestamp. The path starting at Label B, to ientify a corruption uner an explicit attribute partitioning scheme, is very similar to that ealing with implicit attribute corruption. The only two ifferences are first, the nee to ientify which of the total chains ACM Transactions on Database Systems, Vol. 38,. 2, Article 12, Publication ate: June 2013.
6 App 6 K. E. Pavlou an R. T. Snograss Partition n Partition Attr. Corrupte Virtual Pening Future Work Explicit Implicit Change to lesser value Change to greater value Backate Postate Transaction ID Change NB: Artificial orer require for categorical attributes Pening Future Work "to" before "from"? "to" before "from"? Determine "irection" of corruption. Determine "irection" of corruption. Recors physically clustere by partition attr? Compare backup tapes with ata. Recors physically clustere by partition attr? Compare backup tapes with ata. 2 2 How many regions oes the Algorithm yiel? 1 How many regions oes the Algorithm yiel? 1 Ientify corrupte total chain(s). Run attribute base Variable Level a3d Forensic Algorithm. Run commit time base Variable Level a3d Forensic Algorithm. Label B VEn = False; VE0 = True ( schema corruption); base partitioning. Label C VEn = False; VE0 = True ( schema corruption); Commit time base partitioning. Fig. 18. Forensic analysis protocol to ientify Corruption. ACM Transactions on Database Systems, Vol. 38,. 2, Article 12, Publication ate: June 2013.
7 Generalizing Database Forensics App 7 Schema Corruption Table Schema Corrupte Column Schema Corrupte Other Schema Corrupte "Column" table "Table" table Detects ifferences in... Other schema table VE n = False VE 0 = True Label D Compare current contents of table metaata to backup. Fig. 19. Forensic analysis to ientify Schema Corruption. (if multiple are present) are the affecte ones an secon, the nee to have an artificial orer impose on the partitioning attribute (if it is categorical) when implementing the physical clustering of tuples on isk. Finally, note that for Virtual corruption to occur (an inee, corruption of any kin of attribute) the attribute values must themselves be susceptible to corruption. This is true in the case of non-static-numbere-page-base partitioning of the ata where the page number associate with a specific tuple changes with time. Therefore, the page number where the tuple was originally store in must be maintaine in some way. This reners these maintaine original page numbers susceptible to corruption. However, this is not an issue when the Virtual attribute we are partitioning on is static-numbere-pages. In this case the page numbers cannot be corrupte since they are not explicitly maintaine in any way. This is because at each point in time we know the page number associate with a specific tuple by virtue of looking at what page that tuple resies in. A.4. Forensic Analysis of Schema Corruption One of the issues left unaresse from earlier work in forensic analysis was how to eal with schema corruption. The initial iea was that before the atabase went online the schema of the atabase woul be hashe an notarize (NE 0 ). If uring forensic analysis the valiation of NE 0 prouce a false result then we woul know that the schema of the atabase has been compromise. As shown in Figure 19, we can eal with schema corruption by comparing the current contents of the metaata table to the backup. Depening on the etecte ifferences we can ientify a corruption to the Table or Column tables, or any other piece of metaata. ACM Transactions on Database Systems, Vol. 38,. 2, Article 12, Publication ate: June 2013.
d 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More information6.823 Computer System Architecture. Problem Set #3 Spring 2002
6.823 Computer System Architecture Problem Set #3 Spring 2002 Stuents are strongly encourage to collaborate in groups of up to three people. A group shoul han in only one copy of the solution to the problem
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationDivide-and-Conquer Algorithms
Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationFrequent Pattern Mining. Frequent Item Set Mining. Overview. Frequent Item Set Mining: Motivation. Frequent Pattern Mining comprises
verview Frequent Pattern Mining comprises Frequent Pattern Mining hristian Borgelt School of omputer Science University of Konstanz Universitätsstraße, Konstanz, Germany christian.borgelt@uni-konstanz.e
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationQuestions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.eu 6.854J / 18.415J Avance Algorithms Fall 2008 For inormation about citing these materials or our Terms o Use, visit: http://ocw.mit.eu/terms. 18.415/6.854 Avance Algorithms
More informationFundamentals of the stiffness method. Fundamentals of the stiffness method. Fundamentals of the stiffness method
CHAPER 6 russ Analsis using Stiffness Metho Objectives เข าใจว ธ ของ stiffness metho ใช ว ธ stiffness metho ก บ russ, BM & rame จะพ ดถ งในบท หน า unamentals of the stiffness metho he stiffness metho: Is
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationCordEx. >> Operating instructions. English
CorEx >> Operating instructions English Symbols use in this manual Important information concerning your safety is specifically marke. Follow these instructions closely to prevent accients an amage to
More informationAdjacency Matrix Based Full-Text Indexing Models
1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,
More informationPolitecnico di Torino. Porto Institutional Repository
Politecnico i Torino Porto Institutional Repository [Proceeing] Automatic March tests generation for multi-port SRAMs Original Citation: Benso A., Bosio A., i Carlo S., i Natale G., Prinetto P. (26). Automatic
More informationACE: And/Or-parallel Copying-based Execution of Logic Programs
ACE: An/Or-parallel Copying-base Execution of Logic Programs Gopal GuptaJ Manuel Hermenegilo* Enrico PontelliJ an Vítor Santos Costa' Abstract In this paper we present a novel execution moel for parallel
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationOverlap Interval Partition Join
Overlap Interval Partition Join Anton Dignös Department of Computer Science University of Zürich, Switzerlan aignoes@ifi.uzh.ch Michael H. Böhlen Department of Computer Science University of Zürich, Switzerlan
More informationFigure 1: Schematic of an SEM [source: ]
EECI Course: -9 May 1 by R. Sanfelice Hybri Control Systems Eelco van Horssen E.P.v.Horssen@tue.nl Project: Scanning Electron Microscopy Introuction In Scanning Electron Microscopy (SEM) a (bunle) beam
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationAuthenticated indexing for outsourced spatial databases
The VLDB Journal (2009) 8:63 648 DOI 0.007/s00778-008-03-2 REGULAR PAPER Authenticate inexing for outsource spatial atabases Yin Yang Stavros Papaopoulos Dimitris Papaias George Kollios Receive: February
More informationFeature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory
Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative
More informationAlgebraic transformations of Gauss hypergeometric functions
Algebraic transformations of Gauss hypergeometric functions Raimunas Viūnas Faculty of Mathematics, Kobe University Abstract This article gives a classification scheme of algebraic transformations of Gauss
More informationFrequency Domain Parameter Estimation of a Synchronous Generator Using Bi-objective Genetic Algorithms
Proceeings of the 7th WSEAS International Conference on Simulation, Moelling an Optimization, Beijing, China, September 15-17, 2007 429 Frequenc Domain Parameter Estimation of a Snchronous Generator Using
More informationNew Version of Davies-Bouldin Index for Clustering Validation Based on Cylindrical Distance
New Version of Davies-Boulin Inex for lustering Valiation Base on ylinrical Distance Juan arlos Roas Thomas Faculta e Informática Universia omplutense e Mari Mari, España correoroas@gmail.com Abstract
More informationCONTENT-BASED RETRIEVAL OF DEFECT IMAGES. Jukka Iivarinen and Jussi Pakkanen
Proceeings of ACIVS 2002 (Avance Concepts for Intelligent Vision Systems), Ghent, Belgium, September 9-11, 2002 CONTENT-BASED RETRIEVAL OF DEFECT IMAGES Jukka Iivarinen an Jussi Pakkanen jukka.iivarinen@hut.fi,
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign
More informationCloud Search Service Product Introduction. Issue 01 Date HUAWEI TECHNOLOGIES CO., LTD.
1.3.15 Issue 01 Date 2018-11-21 HUAWEI TECHNOLOGIES CO., LTD. Copyright Huawei Technologies Co., Lt. 2019. All rights reserve. No part of this ocument may be reprouce or transmitte in any form or by any
More informationUninformed search methods
CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the
More informationOpen Access Adaptive Image Enhancement Algorithm with Complex Background
Sen Orers for Reprints to reprints@benthamscience.ae 594 The Open Cybernetics & Systemics Journal, 205, 9, 594-600 Open Access Aaptive Image Enhancement Algorithm with Complex Bacgroun Zhang Pai * epartment
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationA Framework for Dialogue Detection in Movies
A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki
More informationA General Technique for Non-blocking Trees
A General Technique for Non-blocking Trees Trevor rown an Faith Ellen University of Toronto, Canaa Eric Ruppert York University, Canaa Abstract We escribe a general technique for obtaining provably correct,
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationEFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra
th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationRough Set Approach for Classification of Breast Cancer Mammogram Images
Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems
More informationEstimating Velocity Fields on a Freeway from Low Resolution Video
Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationIndicator i 20. User manual
Inicator i 20 WWW.PRECIAMOLEN.COM User manual 04-50-00-1 MU / 10/2012 Contents 1. Forewor... 5 Documentary conventions... 5 Pictograms... 5 Terminology an abbreviations... 5 Aitional ocumentation... 5
More informationA FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES
A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES Archana.S 1 an Srihar.S 2 1 Department of Information Science an Technology, College of Engineering, Guiny archana.santhira@gmail.com
More informationTHE increasingly digitized power system offers more data,
1 Cyber Risk Analysis of Combine Data Attacks Against Power System State Estimation Kaikai Pan, Stuent Member, IEEE, Anré Teixeira, Member, IEEE, Milos Cvetkovic, Member, IEEE, an Peter Palensky, Senior
More informationRecitation Caches and Blocking. 4 March 2019
15-213 Recitation Caches an Blocking 4 March 2019 Agena Reminers Revisiting Cache Lab Caching Review Blocking to reuce cache misses Cache alignment Reminers Due Dates Cache Lab (Thursay 3/7) Miterm Exam
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationIndexing the Edges A simple and yet efficient approach to high-dimensional indexing
Inexing the Eges A simple an yet efficient approach to high-imensional inexing Beng Chin Ooi Kian-Lee Tan Cui Yu Stephane Bressan Department of Computer Science National University of Singapore 3 Science
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationCS350 - Exam 4 (100 Points)
Fall 0 Name CS0 - Exam (00 Points).(0 points) Re-Black Trees For the Re-Black tree below, inicate where insert() woul initially occur before rebalancing/recoloring. Sketch the tree at ALL intermeiate steps
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationAdditional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication
Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationA Convex Clustering-based Regularizer for Image Segmentation
Vision, Moeling, an Visualization (2015) D. Bommes, T. Ritschel an T. Schultz (Es.) A Convex Clustering-base Regularizer for Image Segmentation Benjamin Hell (TU Braunschweig), Marcus Magnor (TU Braunschweig)
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationEfficient Recovery from False State in Distributed Routing Algorithms
Efficient Recovery from False State in Distribute Routing Algorithms Daniel Gyllstrom, Suarshan Vasuevan, Jim Kurose, Gerome Milau Department of Computer Science University of Massachusetts Amherst {pg,
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationPERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING
PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING PAMELA RUSSELL ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. Birchall an Teor prove that
More informationNEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES
More informationDesign Management Using Dynamically Defined Flows
Design Management Using Dynamically Deine Flows Peter R. Sutton*, Jay B. Brockman** an Stephen W. Director* *Department o Electrical an Computer Engineering, Carnegie Mellon University, Pittsburgh, PA
More informationChapter 9 Memory Management
Contents 1. Introuction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threas 6. CPU Scheuling 7. Process Synchronization 8. Dealocks 9. Memory Management 10.Virtual Memory
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationA Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images
A Comparative Evaluation of Iris an Ocular Recognition Methos on Challenging Ocular Images Vishnu Naresh Boeti Carnegie Mellon University Pittsburgh, PA 523 naresh@cmu.eu Jonathon M Smereka Carnegie Mellon
More informationVideo-based Characters Creating New Human Performances from a Multi-view Video Database
Vieo-base Characters Creating New Human Performances from a Multi-view Vieo Database Feng Xu Yebin Liu? Carsten Stoll? James Tompkin Gaurav Bharaj? Qionghai Dai Hans-Peter Seiel? Jan Kautz Christian Theobalt?
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationNAND flash memory is widely used as a storage
1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage
More informationWLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic
WLAN Inoor Positioning Base on Eucliean Distances an Fuzzy Logic Anreas TEUBER, Bern EISSFELLER Institute of Geoesy an Navigation, University FAF, Munich, Germany, e-mail: (anreas.teuber, bern.eissfeller)@unibw.e
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationData Mining: Clustering
Bi-Clustering COMP 790-90 Seminar Spring 011 Data Mining: Clustering k t 1 K-means clustering minimizes Where ist ( x, c i t i c t ) ist ( x m j 1 ( x ij i, c c t ) tj ) Clustering by Pattern Similarity
More informationHOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM
HOW O SECURTY TECHNOLOGES NTERACT WTH EACH OTHER TO CREATE VALUE? THE ANALYSS O REWALL AN NTRUSON ETECTON SYSTEM Huseyin CAVUSOGLU Srinivasan RAGHUNATHAN Hasan CAVUSOGLU Tulane University University of
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationEnabling Rollback Support in IT Change Management Systems
Enabling Rollback Support in IT Change Management Systems Guilherme Sperb Machao, Fábio Fabian Daitx, Weverton Luis a Costa Coreiro, Cristiano Bonato Both, Luciano Paschoal Gaspary, Lisanro Zambeneetti
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationSoftware Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency
Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationTop-down Connectivity Policy Framework for Mobile Peer-to-Peer Applications
Top-own Connectivity Policy Framework for Mobile Peer-to-Peer Applications Otso Kassinen Mika Ylianttila Junzhao Sun Jussi Ala-Kurikka MeiaTeam Department of Electrical an Information Engineering University
More informationObject Recognition Using Colour, Shape and Affine Invariant Ratios
Object Recognition Using Colour, Shape an Affine Invariant Ratios Paul A. Walcott Centre for Information Engineering City University, Lonon EC1V 0HB, Englan P.A.Walcott@city.ac.uk Abstract This paper escribes
More informationVariable Independence and Resolution Paths for Quantified Boolean Formulas
Variable Inepenence an Resolution Paths for Quantifie Boolean Formulas Allen Van Geler http://www.cse.ucsc.eu/ avg University of California, Santa Cruz Abstract. Variable inepenence in quantifie boolean
More informationEstimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction
c 2000 SPIE. Personal use of this material is permitte. However, permission to reprint/republish this material for avertising or promotional purposes or for creating new collective works for resale or
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationSupporting Fully Adaptive Routing in InfiniBand Networks
XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar
More informationInuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem
Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art
More informationMessage Transport With The User Datagram Protocol
Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer
More informationHandling missing values in kernel methods with application to microbiology data
an Machine Learning. Bruges (Belgium), 24-26 April 2013, i6oc.com publ., ISBN 978-2-87419-081-0. Available from http://www.i6oc.com/en/livre/?gcoi=28001100131010. Hanling missing values in kernel methos
More informationFTSM FAST TAKAGI-SUGENO FUZZY MODELING. Manfred Männle
FTS FAST TAKAGI-SUGENO FUZZY ODELING anfre ännle Institute for Computer Design an Fault Tolerance University of Karlsruhe, D-7628 Karlsruhe, Germany anfre.aennle@informatik.uni-karlsruhe.e Abstract Takagi-Sugeno
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More information