Instant Message Retrieval GoGetIM. Michael Seltzer Faculty Advisor: Zachary Ives

Size: px
Start display at page:

Download "Instant Message Retrieval GoGetIM. Michael Seltzer Faculty Advisor: Zachary Ives"

Transcription

1 Abstract Istat Message Retrieval GoGetIM Michael Seltzer Faculty Advisor: Zachary Ives May compaies ad idividuals have recetly developed a wide variety of software that attempts to moitor, store, ad orgaize the vast collectio of iformatio that we iteract with as computer users. Applicatios such as Google Desktop Search ad MSN Search Toolbar allow users to easily fid ad access a wide variety of data, from to word processig documets. However, most of these applicatios igore the characteristics ad itricacies that ca be associated with alterative types of iformatio. Istat messages are a prime example of iformatio that is fudametally differet from other web or local iformatio. They are essetially threads of back-ad-forth messages occurrig i spurts; however, they are curretly ot represeted i this maer. Cosiderig these complexities, traditioal idexig ad retrieval procedures caot practically apply. Savig the coversatio iformatio is relatively easy; however, idexig, orgaizig ad user retrieval i a practical fashio is the ultimate challege. The goal of my system was therefore to improve retrieval methods for coversatios. While I primarily wated to improve the retrieval process of searchig for istat message coversatios, a subset of fuctioalities were uderlyig this goal. This icluded searchig by simple message cotet or by a advaced search that specified other costraits. A example of a more advaced search capability would be for a user to search for a message from coversatios with a specific subset of users, ad withi a certai rage of dates. This goal also icluded producig search results that reflect the specific coversatio the user is seekig, rather tha the etire log file of the user s coversatios of the day or the sigle lie i this log that cotais it. Thus, logs ca be shaped ad preseted i their origial coversatioal cotext, istead of appearig withi the cocateated ad cumbersome file. - 1 of 13 -

2 Related Work There is curretly a diverse selectio of commercial applicatios that archive ad retrieve both web-based ad local iformatio. Search egies such as Google ad Yahoo! have developed ad released desktop search software with the capability of archivig ad retrievig istat message coversatios. However, curret search techology for istat messages is mostly limited to simple text-matchig. Additioally, some istat messagig cliets or software add-is curretly store coversatio history; however, retrieval methods are restricted to basic search across all log files ad the uisace of maual discovery. For example, DeadAIM archives istat message coversatios; however, its built-i search is rudimetary ad ieffective. Hece, there is room for improvemet i establishig efficiet techiques for accessig istat message coversatios. The system that I implemeted far surpasses these curret systems i terms of the user s ability to specify search limitatios as well as the relevace of iformatio that the program retrieves. Techical Approach I order to maitai the focus of my project o the retrieval of istat message coversatios, I did ot build ay compoets to archive coversatios. Istead, I used the output of DeadAIM software for archived istat message data. As oe of may differet third-party plug-is for AOL Istat Messeger (AIM), DeadAIM automatically archives istat message coversatios. DeadAIM produces a simple HTML file that cotais all of the coversatios oe has with user X o date Y, i chroological sequece. Because I already had a collectio of these files accessible due to my previous use of the software, the approach of usig these files was by far the most ideal. I additio to usig DeadAIM, I exteded Apache Lucee, a ope source java program that ca be molded to idex ad search a variety of data. I used Lucee to help build a istat message coversatio idex ad provide search fuctioality for that idex. O the top of the applicatio is a GUI that I built usig Java s Swig compoets that allows the user to iteract with the fuctioig code that I have writte. The fuctioal code is separated ito two geeral compoets: a idexig compoet ad a searchig compoet. The idexig compoet parses through all DeadAIM HTML logs to create a idex of coversatios, ad the - 2 of 13 -

3 searchig compoet provides results from a created idex relevat to multiple user-supplied costraits. Figure 1: Overall Techical Implemetatio Diagram Graphical User Iterface Idexig Compoet Searchig Compoet DeadAIM Archives Coversatios Userames Date Rage Search Query Coversatio Idex Search Results Idexig I created a package of classes called imstrip that would cotai all of the code pertaiig to idexig istat message coversatios. Iside this package resides the Strip class, which hadles all parsig for a idividual log file. Each log file cotais all istat messages set to ad received from a particular user o a particular date. Sice AIM produces horribly formatted HTML for these coversatios, each Strip istace is passed a versio of this HTML cleaed up - 3 of 13 -

4 usig the ope source program JTidy. This cleaed HTML is traversed, ad all message userames, times ad message texts are collected. The IMStrip class, also withi the imstrip package, fids all relevat log files for a Strip istace to parse. Oce these HTML log files have bee parsed out ito userames, times ad message texts, the IMStrip istace uses the Lucee data class Documet to orgaize all of the iformatio ito coversatios. While each Documet ormally cotais fields for files such as title, date, locatio ad so o, I implemeted each Documet to have fields for the remote userame, the local userame, the date of coversatio, ad fields for every message set. The message text, or field value, is give based o the regular expressio: (r l)(m a)(######)(.+). The r is for a message that the remote user set, or the l would be for a message that the local user set. The m is for a ormal message, or the a would be for a automatically set message (through a AIM away message fuctio). The (######) represets the time of the message i 24-hour format. The actual message text follows. Thus, whe a remote user seds a regular message at 2:54:06 PM, sayig hi there the idexer would create a message field with the value rm145406hi there. After much cosideratio, I decided that time would be the best idicatig factor for the begiig ad ed of coversatios. As a mai focus of this project was to be able to supply relevat coversatioal iformatio to the user, it was importat to have a cosistet ad appropriate way to determie what the actual coversatios were. Most of the time olie coversatios cosist of back-ad-forth messagig. Whe there are gaps of time i betwee messages, such a lapse either idicates a shift to a ew coversatio, or that a user has temporarily switched his focus away from the coversatio ad to aother task. The former case aloe was sigificat eough of a idicator for coversatio boudaries to outweigh the istaces of the latter. Therefore, give a variable of a legth of time, coversatio boudaries were established wheever the time betwee messages was larger tha this variable. Oce all coversatios are established iside the IMStrip istace, they are writte to a idex via the Lucee IdexWriter class. I also write a list to the idex of userames as well as - 4 of 13 -

5 begiig ad edig dates that the idex cotais for easy access for the GUI. This idex is stored i the give locatio for the search ed of the program to access. Idexig Challeges The idexig compoet was by far the more challegig ed of the project. It would be a uderstatemet to describe AIM-geerated HTML as ill-formatted ad sloppy. Eve with help from JTidy to clea it up, I ecoutered sigificat problems with parsig. For example, there was a large icosistecy with regards to how the begiigs of messages were represeted. Whe JTidy created a DOM tree of HTML compoets for each log file, geerally the body ode for each file cotaied a spa child ode that further cotaied all of the iformatio relevat to oe message set or received. However, for some idistiguishable reaso, some spa childre would be located as childre of other spa odes istead of the origial body ode. These odd spa odes would the be wrogly recogized as message text for these wrogly established paret spa odes. I eeded to perform some sigificat workarouds i order to restore fuctioality ad address this problem. I more geeral terms, it was difficult to come up with a simple ad comprehesive algorithm to parse through the dese ad cofusig data that is AIM HTML logs. Each time I believed that my method parsed through files correctly, I would ecouter files that represeted similar data i a differet fashio that coflicted with my method. My example metioed above was but oe istace of similar data represeted i multiple, icosistet forms. Maagig all of these differet icosistecies, special cases, ad variatios at the same time proved to be a very difficult task. The method I have put i place should properly parse 99.9% of the files that AIM produces. Although I am somewhat disappoited that my project is ot bug-free or completely comprehesive, give the circumstaces ad the still extremely high parsig yield, the result is certaily more tha satisfactory. A importat idexig issue that I ecoutered that did ot pertai to bad HTML data was related to how ad whe DeadAIM writes AIM logs. DeadAIM writes all istat message coversatio to log files as soo as the user closes his istat message widow. However, if the widow cotais istat messages that spa across multiple days, these messages are still all - 5 of 13 -

6 writte together i sequece i the same file. For example, say user X has a coversatio with user Y that spas from 11:55 PM to 12:05 AM of the ext morig, at which poit user X closes the widow. All messages, both from the previous day as well the ext, are writte i the same HTML file ad are filed uder the later day. What is more, there is o record of what the previous date(s) is. Thus, a user could keep a istat message widow ope for days, have multiple coversatios o multiple days with a user, ad all messages would be writte to the log as if they occurred o the day the log file was writte. Sice there was o way for me to detect the dates for messages ot set or received o the log file dates, I dealt with the issue i the maer I believed to be most appropriate. I detected ay message sequeces where the time of a message was before the time of the previous message set. This would idicate a message set or received o a ew day. I was forced to assume that the earlier message was set or received o the previous caledar day, as there was o other iformatio to referece. These essetially udated coversatios, while give a assumed date i my idexig compoet, are always starred for the program user to iform him that the date associated with the coversatio may or may ot be appropriate. Searchig Searchig withi a idex built with the idexig compoet of my program makes use of Lucee as well. Through the GUI, a user ca specify a subset of userames, a subset of dates, ad a search query. My program the builds a query for Lucee to search usig these three factors. The set of userames selected is matched with the remote userame field s value stored withi each coversatio. Similarly, the set of dates selected is matched with the date field s value stored withi each coversatio. The search query is matched with all message text values. A istace of the Lucee class Hits is retured by the Lucee search fuctio, which cotai all of the relevat Documet istaces, or essetially all of the coversatios that match the search criteria. Lucee uses a form of tf-idf weightig i order to score or rak the set of results that are retured. This score is o the scale of 0 to 1. I tweaked this score i order to better reflect the rakig of coversatio results. This ew coversatio score is still o the same scale, ad is - 6 of 13 -

7 wi i calculated as L *( ) *(( ) / dˆ ) where L is the Lucee score, is the umber of messages i ˆ the coversatio, ad ˆ is the maximum umber of messages i a coversatio across the etire idex. Thus, ( ) is a weightig of the relative legth of the coversatio. Beyod this, w i is the ˆ wi i umber of words i each message i i the coversatio, which meas that ( ) is equivalet to average message desity for the coversatio. The term dˆ is the maximum average message wi i desity i a coversatio across the etire idex. Thus, (( ) / d ˆ ) is a weightig of the relative average message desity of the coversatio. I all, the ew score that I compute is the product of the Lucee score, the relative legth ad the relative average message desity. This ew coversatio score allows for a better rakig of coversatios. Sice these results are oly retured sorted by their Lucee scores, I reorgaize them accordig to my ewly calculated coversatio score. These sorted results are preseted i successio with the search terms highlighted. I additio, I provide a iterface for the program user to traverse the search results for a particular user, ad subsequetly for a particular date. For example, if the program user is preseted with a set of results ad realizes that coversatios with a particular userame were really what he was lookig for, he ca easily avigate to those results for that userame without havig to perform a ew search with modified parameters. Whe the program user decides to traverse these results subsets, the subsets are agai sorted by coversatio score. The implemetatio of this part of the iterface is further described i the sectio pertaiig to the GUI that I developed. Searchig Challeges The searchig compoet of my program was oe of the less challegig aspects of the project. As Lucee already provided a very comprehesive ad efficiet search fuctio with which to - 7 of 13 -

8 access the database, most of my implemetatio focused o dealig with the results obtaied from the Lucee search. At first I was cocered that for each additioal costrait provided, such as each additioal userame to search, I would have to perform a separate query. I implemeted this method ad foud that it was very resource itesive to search across all userames ad the etire date rage. Sice I imagied this would be a very commo iteractio with the program, I sought out a more efficiet search implemetatio. Usig Lucee s MultiFieldQuery class, I was able to costruct a sigle query for multiple field types (i.e. userame, date, message), cocateatig the costrait subsets with the OR operator. This allowed my program to make full use of Lucee s efficiet backboe, ad it vastly improved the resource requiremets ad performace of my program. Graphical User Iterface With the help of NetBeas IDE s Matisse GUI builder, I was able to build a robust GUI for my program that provides as a iterface for both the idexig ad searchig compoets. The program user, upo loadig my program, first chooses where his AIM log files are located. The program user the chooses where to save the idex that the program will compile. Fially, the user specifies via a slider bar the legth i secods to serve as a cutoff for coversatio boudaries. After the idexig begis, the GUI periodically is updated with the status, as the percet complete is displayed alog with the userame for whom logs are curretly beig idexed, which cotiues util idexig is complete. The GUI also allows the user to locate a previously created idex to load. I either case, a full idex is the loaded by the program. - 8 of 13 -

9 Figure 2: Idexig Logs The search iterface sectio of the GUI allows the user to specify the costraits of a set of userames ad dates as well as a search query. The list of userames is displayed withi a JList to allow for multiple selectios. The rage of dates is specified usig a start date ad a ed date, selectable via a series of dropdow meus. I costructed a variety of easy-access buttos to help the user select commo userame sets ad commo date rages, such as Select All userames ad All Dates. Beeath the search query, the user has the optio of eablig the Expad Terms fuctioality. Give the ature of coversatio text, there ted to be a wide variety of abbreviatios, acroyms ad slag. For example, istat message users will ofte make use of terms such as brb for be right back ad ttyl for talk to you later. With the Expad Terms fuctio eabled, these shorthad message compoets are expaded to their full text equivalets. After specifyig users ad dates, ad eablig or disablig the expasio of shorthad terms, the user eters a search query ad the GUI refereces the search compoet to gather results. - 9 of 13 -

10 The coversatio results, as metioed earlier, are first displayed i oe large pael, sorted by coversatio score. Located o the side of this pael is a series of tabs, with each tab labeled with a userame that cotais coversatio results. If the user selects oe of these tabs, the pael that origially displayed all coversatio results chages to cotai all coversatio results with that userame. Additioally, this pael also cotais a ew series of tabs, located o the top, with each tab labeled with a date that cotais coversatio results for that userame. If the user selects oe of these tabs, the results pael chages oce agai to cotai all coversatio results with that userame o that particular date. To illustrate, visualize a certai search s results that retured coversatios with users X ad Y from both today ad yesterday. The program would at first show all of these coversatios. The user could select a tab labeled X ad the program would the show the coversatios with X from both today ad yesterday that are i the search s results. The user could the select a tab labeled with today s date ad the program would the show the coversatios with X from today that are i the search s results. This provides for extremely easy avigatio of results from multiple agles, thus removig the eed to redo search i may users cases. This search fuctio ad subsequet avigability is a vast improvemet over curret software s abilities whe it comes to istat message retrieval of 13 -

11 Figure 3: Searchig ad Navigatig Results Graphical User Iterface Challeges While the Matisse GUI builder provided a easy iterface for me to create the basic GUI for my program, creatig the results pael was more challegig. The Matisse iterface does ot allow for dyamic compoets that are created at rutime. Rather, this must all be created with separate code. I foud it to be extremely tricky to create all of the user tab paels ad date tab paels whe search results were cojured. Oce I fully uderstood all of the GUI Swig code that I eeded i order to create each idividual compoet, I was able to devise a algorithm that would build this iterface. I made extesive use of vectors of Swig compoets i order to keep track of what compoets I had created as well as what further Swig compoets would eed to be associated with them. Whe a ew search is performed, all previous Swig compoets from the previous search results are wiped out ad recreated accordig to the ew results of 13 -

12 The GUI buildig part of my project was oe of the more iterestig processes for me. I had little previous experiece workig with GUIs, ad it was very satisfyig for me to have a visually appealig iterface that I created correspod with the backboe code that I had previously produced. I leared a great deal with regards to the fuctioality of Java s Swig compoets ad how they ca be used. I the ed, I was much more comfortable with my ability to geerate a GUI for ay fuctioality that my program required. Coclusios ad Reflectios Whe I preseted my program to my frieds ad classmates who had all previously used DeadAIM to access their istat message logs, they were all extremely impressed with the fuctioality ad possibilities for the program. I pla o submittig my program as ope source software to a variety of olie commuities whose users could make use of it. I o doubt see my program as a vast improvemet over previous istat message retrieval systems. Cosiderig my accomplishmets, I believe that my program meets my overall goal of expadig the possibilities of istat message retrieval. The process of buildig the program provided a wide array of challeges for me to overcome. I was disappoited i the amout of time that I evetually eeded to dedicate to steady the istat message parsig code. I was eve more disappoited to fid towards the ed of the project that a very recetly released versio of AIM software logs all istat message coversatios i XML format, which would be easy to maipulate i ay program. I ca oly imagie what other aspects of this program I could have focused o give this superior iformatio from the oset. Regardless, I am cotet with my experiece of fightig the beast that was the iferior data. Most importatly, I was very impressed with the ed product s usability. To complete this project ad be able to have somethig tagible ad valuable was very satisfyig. I am overwhelmed with a sese of pride whe I show off my program s features. I ca say that my program efficietly parses ad idexes vast collectios of istat message logs ad the provides a easy ad comprehesive iterface to retrieve them from the resultig idex. That aloe is a lot more tha what I could have said from this project s begiig of 13 -

13 Refereces 1. Google Desktop Search, 2. MSN Search Toolbar, 3. DeadAIM, 4. Apache Lucee, 5. JTidy, 6. NetBeas IDE, of 13 -

Panel for Adobe Premiere Pro CC Partner Solution

Panel for Adobe Premiere Pro CC Partner Solution Pael for Adobe Premiere Pro CC Itegratio for more efficiecy The makes video editig simple, fast ad coveiet. The itegrated pael gives users immediate access to all medialoopster features iside Adobe Premiere

More information

Avid Interplay Bundle

Avid Interplay Bundle Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers

More information

Guide to Applying Online

Guide to Applying Online Guide to Applyig Olie Itroductio Respodig to requests for additioal iformatio Reportig: submittig your moitorig or ed of grat Pledges: submittig your Itroductio This guide is to help charities submit their

More information

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

The Magma Database file formats

The Magma Database file formats The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

27 Refraction, Dispersion, Internal Reflection

27 Refraction, Dispersion, Internal Reflection Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet

More information

Weston Anniversary Fund

Weston Anniversary Fund Westo Olie Applicatio Guide 2018 1 This guide is desiged to help charities applyig to the Westo to use our olie applicatio form. The Westo is ope to applicatios from 5th Jauary 2018 ad closes o 30th Jue

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

Oracle Server. What s New in this Release? Release Notes

Oracle  Server. What s New in this Release? Release Notes Oracle email Server Release Notes Release 5.2 for Widows NT May 2001 Part No. A90426-01 These release otes accompay Oracle email Server Release 5.2 for Widows NT. They cotai the followig topics: What s

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Getting Started. Getting Started - 1

Getting Started. Getting Started - 1 Gettig Started Gettig Started - 1 Issue 1 Overview of Gettig Started Overview of Gettig Started This sectio explais the basic operatios of the AUDIX system. It describes how to: Log i ad log out of the

More information

BAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8

BAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8 BAAN IVc/BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject

More information

The VSS CCD photometry spreadsheet

The VSS CCD photometry spreadsheet The VSS CCD photometry spreadsheet Itroductio This Excel spreadsheet has bee developed ad tested by the BAA VSS for aalysig results files produced by the multi-image CCD photometry procedure i AIP4Wi v2.

More information

Baan Tools User Management

Baan Tools User Management Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

Web OS Switch Software

Web OS Switch Software Web OS Switch Software BBI Quick Guide Nortel Networks Part Number: 213164, Revisio A, July 2000 50 Great Oaks Boulevard Sa Jose, Califoria 95119 408-360-5500 Mai 408-360-5501 Fax www.orteletworks.com

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch

More information

Goals of the Lecture UML Implementation Diagrams

Goals of the Lecture UML Implementation Diagrams Goals of the Lecture UML Implemetatio Diagrams Object-Orieted Aalysis ad Desig - Fall 1998 Preset UML Diagrams useful for implemetatio Provide examples Next Lecture Ð A variety of topics o mappig from

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Session Initiated Protocol (SIP) and Message-based Load Balancing (MBLB)

Session Initiated Protocol (SIP) and Message-based Load Balancing (MBLB) F5 White Paper Sessio Iitiated Protocol (SIP) ad Message-based Load Balacig (MBLB) The ability to provide ew ad creative methods of commuicatios has esured a SIP presece i almost every orgaizatio. The

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Heaps. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015

Heaps. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 201 Heaps 201 Goodrich ad Tamassia xkcd. http://xkcd.com/83/. Tree. Used with permissio uder

More information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

More information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

Floristic Quality Assessment (FQA) Calculator for Colorado User s Guide

Floristic Quality Assessment (FQA) Calculator for Colorado User s Guide Floristic Quality Assessmet (FQA) Calculator for Colorado User s Guide Created by the Colorado atural Heritage Program Last Updated April 2012 The FQA Calculator was created by Michelle Fik ad Joaa Lemly

More information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

Chapter 4 The Datapath

Chapter 4 The Datapath The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5. Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple

More information

3.1 Overview of MySQL Programs. These programs are discussed further in Chapter 4, Database Administration. Client programs that access the server:

3.1 Overview of MySQL Programs. These programs are discussed further in Chapter 4, Database Administration. Client programs that access the server: 3 Usig MySQL Programs This chapter provides a brief overview of the programs provided by MySQL AB ad discusses how to specify optios whe you ru these programs. Most programs have optios that are specific

More information

MOTIF XF Extension Owner s Manual

MOTIF XF Extension Owner s Manual MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus

More information

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager. CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig

More information

fgrep - Linux Command

fgrep - Linux Command f - CetOS 5.2 - Liux Users Guide f f - Liux Commad SYNOPSIS [optios] PATTE RN [FI LE...] [ optios ] [ -e -f FILE ] [ FILE...] DESCRIPTION Grep searches the amed iput FILE s (or stadard iput if o files

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS

EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &

More information

BEA WebLogic Process Integrator

BEA WebLogic Process Integrator BEA WebLogic Process Itegrator A Compoet of BEA WebLogic Itegratio BEA WebLogic Process Itegrator Studio Olie Help BEA WebLogic Process Itegrator Release 2.0 Documet Editio 2.0 July 2001 Copyright Copyright

More information

Customer Portal Quick Reference User Guide

Customer Portal Quick Reference User Guide Customer Portal Quick Referece User Guide Overview This user guide is iteded for FM Approvals customers usig the Approval Iformatio Maagemet (AIM) customer portal to track their active projects. AIM is

More information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

n Learn how resiliency strategies reduce risk n Discover automation strategies to reduce risk

n Learn how resiliency strategies reduce risk n Discover automation strategies to reduce risk Chapter Objectives Lear how resiliecy strategies reduce risk Discover automatio strategies to reduce risk Chapter #16: Architecture ad Desig Resiliecy ad Automatio Strategies 2 Automatio/Scriptig Resiliet

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

Chapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Searching a Russian Document Collection Using English, Chinese and Japanese Queries

Searching a Russian Document Collection Using English, Chinese and Japanese Queries Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.

More information

In this chapter, you learn the concepts and terminology of databases and

In this chapter, you learn the concepts and terminology of databases and A Itroductio to Database Developmet I this chapter, you lear the cocepts ad termiology of databases ad how to desig the tables that your forms ad reports will use. Fially, you build the actual tables used

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Τεχνολογία Λογισμικού

Τεχνολογία Λογισμικού ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr

More information

Chapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs

More information

Multi-Threading. Hyper-, Multi-, and Simultaneous Thread Execution

Multi-Threading. Hyper-, Multi-, and Simultaneous Thread Execution Multi-Threadig Hyper-, Multi-, ad Simultaeous Thread Executio 1 Performace To Date Icreasig processor performace Pipeliig. Brach predictio. Super-scalar executio. Out-of-order executio. Caches. Hyper-Threadig

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Architectural styles for software systems The client-server style

Architectural styles for software systems The client-server style Architectural styles for software systems The cliet-server style Prof. Paolo Ciacarii Software Architecture CdL M Iformatica Uiversità di Bologa Ageda Cliet server style CS two tiers CS three tiers CS

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

Course Site: Copyright 2012, Elsevier Inc. All rights reserved.

Course Site:   Copyright 2012, Elsevier Inc. All rights reserved. Course Site: http://cc.sjtu.edu.c/g2s/site/aca.html 1 Computer Architecture A Quatitative Approach, Fifth Editio Chapter 2 Memory Hierarchy Desig 2 Outlie Memory Hierarchy Cache Desig Basic Cache Optimizatios

More information

Exercise 6 (Week 42) For the foreign students only.

Exercise 6 (Week 42) For the foreign students only. These are the last exercises of the course. Please, remember that to pass exercises, the sum of the poits gathered by solvig the questios ad attedig the exercise groups must be at least 4% ( poits) of

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

Code Review Defects. Authors: Mika V. Mäntylä and Casper Lassenius Original version: 4 Sep, 2007 Made available online: 24 April, 2013

Code Review Defects. Authors: Mika V. Mäntylä and Casper Lassenius Original version: 4 Sep, 2007 Made available online: 24 April, 2013 Code Review s Authors: Mika V. Mätylä ad Casper Lasseius Origial versio: 4 Sep, 2007 Made available olie: 24 April, 2013 This documet cotais further details of the code review defects preseted i [1]. of

More information

Baan Finance Financial Statements

Baan Finance Financial Statements Baa Fiace Fiacial Statemets Module Procedure UP041A US Documetiformatio Documet Documet code : UP041A US Documet group : User Documetatio Documet title : Fiacial Statemets Applicatio/Package : Baa Fiace

More information

The University of Adelaide, School of Computer Science 22 November Computer Architecture. A Quantitative Approach, Sixth Edition.

The University of Adelaide, School of Computer Science 22 November Computer Architecture. A Quantitative Approach, Sixth Edition. Computer Architecture A Quatitative Approach, Sixth Editio Chapter 2 Memory Hierarchy Desig 1 Itroductio Programmers wat ulimited amouts of memory with low latecy Fast memory techology is more expesive

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

n Explore virtualization concepts n Become familiar with cloud concepts

n Explore virtualization concepts n Become familiar with cloud concepts Chapter Objectives Explore virtualizatio cocepts Become familiar with cloud cocepts Chapter #15: Architecture ad Desig 2 Hypervisor Virtualizatio ad cloud services are becomig commo eterprise tools to

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard 1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries

More information

Using VTR Emulation on Avid Systems

Using VTR Emulation on Avid Systems Usig VTR Emulatio o Avid Systems VTR emulatio allows you to cotrol a sequece loaded i the Record moitor from a edit cotroller for playback i the edit room alog with other sources. I this sceario the edit

More information

Human-Computer Interaction IS4300

Human-Computer Interaction IS4300 Huma-Computer Iteractio IS4300 1 I5 due ext class Your missio i this exercise is to implemet a very simple Java paitig applicatio. The app must support the followig fuctios: Draw curves, specified by a

More information

Capability Analysis (Variable Data)

Capability Analysis (Variable Data) Capability Aalysis (Variable Data) Revised: 0/0/07 Summary... Data Iput... 3 Capability Plot... 5 Aalysis Summary... 6 Aalysis Optios... 8 Capability Idices... Prefereces... 6 Tests for Normality... 7

More information

Location Steps and Paths

Location Steps and Paths Locatio Steps ad Paths 3 INTHIS CHAPTER Uderstadig Locatio Steps ad Paths How do locatio paths work? We took a look at locatio paths i the overview i Chapter 1, where we saw that locatio paths look much

More information

Global Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c

Global Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c Verizo WIreless Global Support Guide For the BlackBerry 8830 World Editio Smartphoe ad the Motorola Z6c For complete iformatio o global services, please refer to verizowireless.com/vzglobal. Whether i

More information

Chapter 8. Strings and Vectors. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 8. Strings and Vectors. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 8 Strigs ad Vectors Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Copyright 2015 Pearso Educatio, Ltd..

More information

Appendix A. Use of Operators in ARPS

Appendix A. Use of Operators in ARPS A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)

More information

Extending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis

Extending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis Extedig The Sleuth Kit ad its Uderlyig Model for Pooled File System Foresic Aalysis Frauhofer Istitute for Commuicatio, Iformatio Processig ad Ergoomics Ja-Niclas Hilgert* Marti Lambertz Daiel Plohma ja-iclas.hilgert@fkie.frauhofer.de

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Well, here we are again with a new version of Max, and the first question

Well, here we are again with a new version of Max, and the first question Explorig the Max Iterface Well, here we are agai with a ew versio of Max, ad the first questio o the mids of existig users is Did the iterface chage? The aswer is a happy very little. Most serious users

More information