Research on Interest Model of User Behavior

Size: px
Start display at page:

Download "Research on Interest Model of User Behavior"

Transcription

1 2011 Iteratioal Coferece o Computer Sciece ad Iformatio Techology (ICCSIT 2011) IPCSIT vol. 51 (2012) (2012) IACSIT Press, Sigapore DOI: /IPCSIT.2012.V51.94 Research o Iterest Model of User Behavior Yu Ye*, Guowe Wu ad Xi Luo School of Computer Sciece ad Techology, Doghua Uiversity, Shaghai , Chia, Abstract. I searchig for the websites ad portal sites, user iterest model is applied i describig the users prefereces. We summarized some popular methods of creatig user iterest model, such as creatig models i explicit or implicit ways. O the aalysis of users' browsig behaviors or cotet, we could extract the iterests of users. A improved method is proposed to icrease the umber of web pages efficacious iformatio cotaiig, improve the accuracy of user iterest model by itroduce of search tails ad so o. Keywords: User model; hybrid iterest model; VSM(Vector space model). 1. Itroductio Recetly search egie rarely orders their results based o idividual user iterests. However differet users have various iterests ad backgrouds, thus they should obtai the differet feedback for the same query. For example: cosider the same query apple, the user has iterest i life should obtai the related websites of the food, but the perso who likes digital products, hopes to get the results of Apple digital products.researchig has they should obtai the differet feedback for the same for user iterest model costructio have become a importat part of persoalized search egies. Accordig to a aalysis of report which extract from the website of hitwise(table 1),the most commo query legth submitted to search egie(20.29%) was oly two words log,65.86% of all queries were three words log or less ad 10.57% of all queries were more tha 5 words log. The percetage of keyword which cosists of four words log or more begi to rise. This suggests that short queries are ofte ambiguous. The percetage of keyword which cosisted of four words log or more begi to rise. This suggests that short queries are ofte ambiguous. I order to solve the problems, user iterest model is proposed which allows the user to obtai more precise iformatio. The cotributios of this paper are as follows. At first, we make a geeral overview of the Keyword Search ad the ecessity of capturig user s iterest. I sectio II a brief of the category of the collectio for user iterest is itroduced. I sectio III, a geeral overview of the cocept of user iterest model, VSM, hierarchical model ad tree structure model are itroduced. At last we draw a coclusio i the last sectio. 2. User Iterest Collectio User iterest model is usually defied as a set of user s goals, plas, beliefs, kowledge ad so o ad as a descriptio about ma s uderstadig of the outside world ad as a model which is used to capture user s eeds, iterest TABLE I. PERCENTAGE OF CLICKS BY NUMBER OF KEYWORDS Percetage of U.S. clicks by umber of keywords Correspodig author. address:leafrai_001@hotmail.com 562

2 Subj ect (wor d) Ja- 08 (%) Dec- 08 (%) JAN- 09 (%) Year-overyear Percet chage % % % % % % % % ad record or maage user s iterest. Iformatio of user s iterest ca be captured from relevace feedback. The relevace feedback is to take the results that are retured from user [1] Explicit Explicitly feedback is obtaied from user s direct assessmet. For example: askig for feedback such as ratigs or appetite. Oe way to get user iterest explicitly usually completed i the registratio. I order to collect iformatio we require user to fill i relevat iterest whe they logi first time. Aother way is that allow users to commet o results returig by search egie, such as ot iterest, somewhat iterest, iterest, or very iterest. The from the feedback we lear the users curret iterests ad update model of the user s for future iformatio filterig Implicit Recetly, a great deal of effort i the research commuity has focused o improvig user experiece i web search through the icorporatio of implicit user feedback [2], [3], ad [4]. User iteractio with Web search egies is ordiary, ad complicated, i iformatio-searchig process. I the course of a search, users take various behaviors to obtai cotet which they are iterested i. The fact that a user has browsed a website is actually that he is iterested i the cotet of it. Obviously we ca derive the user s iterest by classifyig iformatio from user s browsig behavior such as which documets they select for viewig, the duratio of time spet viewig a documet, or page browsig or scrollig actios ad so o. User behavior ca be summarized as the followig aspects. 1)Search keywords Accordig to chages i the user's query iput, ifer whether there has chage i user search behavior. 2)Browsig history Site visited will be recorded i the server log, icludig the user's access time, user s time zoe, the size of visited page ad other iformatio, by aalyzig server log we ca capture the user's search iterest. 3)Bookmark Typically, users will save their favorite web page for the ext visit; therefore, we ca obtai the user s iterest by aalyzig the bookmarks. 4)Mouse behavior Users would do some operatios o the lik that they are iterested i. For example: drag, click, suspeded ad so o. We ca obtai iformatio by aalyzig these operatios. 5)Usig page dwell time Dwellig o a page for a sigificat amout of time implies that the user is iterested i it. There has more importat iformatio i the web page. I fact, previous studies have show that a dwellig time of 30 secods or more o a web page implies a kik of iterest [5]. 6)Search paths 563

3 Search paths are a series of pages startig with a query ad edig with a evet like closig the browser. Search results ca oly be used as the startig poits for collectio of user iterests. A search path cosists of a origi page, itermediate pages, ad a destiatio page [6]. Origi: The first page i the paths of the SERP (search egie result page). P2 is the origi i Fig.1. Destiatio: The last page i the paths, before visited should browse a series of itermediate pages. P5 is the destiatio i Fig.1. Origi ad destiatio is regarded as the core pages that ca reveal user s iterest. Q1 P2 P3 P4 P3 P2 P5 Fig. 1: Web behavior graph illustratig a search trail 2.3. User Iterest Model Costructio User iterest model is a collectio of persoal data associated to a specific user. It ca also be cosidered as the computer represetatio of a user iterest model. Traditioal process of creatig user iterest model is Fig.2. User iterest model has a short-term iterest model ad log-term iterest model. The short-term iterest model used to store user s recet iterest ad the stable iterests stored i log-term iterest model. The available data of user s iterest which represeted by the vector collected from registratio iformatio filled by user whe his first logi. The we adjust ad build short-term iterest model by clusterig ad aalyzig the iformatio. Usually we use the vector space model to represetig user iterest model. I additio, we ca capture user s iterest by aalyzig log which iclude user behavior ad browsig history. This is a implicit way to get user iterest. We ca coclude that the short-term iterest should be marked as the log-term iterest whe the frequecy of usig the short-term iterest reached a threshold. 3. USER INTEREST MODEL There are maily tow ways to describe the user iterest model: Vector Space Model (VSM) ad Hierarchy Model [7]. Salto's Magic Automatic Retriever of Text cotais a similar vector space model, Iverse Documet Frequecy (IDF), the term frequecy (TF), term discrimiatio values ad related cocepts such as feedback mechaisms [8] VSM Vector space model is a mathematical model which represets the feature vectors of a documet. The basic of VSM is that a documet ca be represeted by a vector. (W 1,1,W 2,2,W 3,3,..,W i,i ), W i is the weight of the i-item. There have some differet ways to computig these values. Oe of the best methods is TF-IDF (term frequecy-iverse documet frequecy) weightig. Geerally we choose sigle words, words or loger phrases as the feature item of the documet. At first, Salto used a fuctio of umber of properties that are assiged to differet documets to computig the similarity betwee both documets [8]. W i = (W i1, Wi2 W ik ) W j = (W j1, Wj2 W jk ) Followig fuctios are ecessary for similarity computig. (1) is the sum of the weights. k 1 W ik 564

4 jk W ik * k 1 W (2) (2) is the sum of the correspodig term weights for W ik ad W jk k 1 mi( W ik, W jk) (3) is the sum of the miimum weights. Ad the Dice ad Jaccard compute the similarity i documets by followig coefficiets [8]. 2[ ik jk k1 sim 1(W, i W) j (4) k1 (W * W )] Wik k1 W jk mi(w, W ) ik jk k1 sim 2(W, i W) j (5) Relevacy rakigs of documets ca be calculated by calculatig the similarity of the documet. Usually we calculate the agle betwee vectors of differet documets. Istead of the agle, we calculate the cosie of the agle betwee the vectors. v *v cos v1 * v2 k1 Wik 1 2 TF-IDF weights (term frequecy-iverse documet frequecy) TF-IDF is the commo weightig techiques i iformatio retrieval. The model is kow as term frequecy-iverse documet frequecy model. (3) Wt, tf t is term frequecy of term t i documet d. We have the term frequecy, defied as follows: d D tft *log {t d} tf i, i, j k j k, j Where i,j is the occurrece umber of the term (t i ) i documet d j ad the deomiator is the sum of umber of occurreces of all terms i documet d j. D log {t d} is iverse documet frequecy. D is the total umber of documets i the corpus. The deomiator is the umber of documets where the term t appears Tree structure A tree structure is a way of represetig the hierarchical ature of a structure i a graphical form. Usually people use a tree structure model which with the ature of Hierarchy Model represets the user iterest. The geeral process of creatig user iterest is like Fig.2. Iterest iformatio Iterest iformatio VSM Date process Clusterig Aalysis Behavior Aalysis Iterest Adjust Short-term iterest Log-term iterest Fig. 2: Traditioal process of creatig user iterest model 4. Summary ad commets 565

5 Explicit buildig of user iterestig model has several drawbacks. The user provides icosistet or icorrect iformatio, the model created is static whereas the user's iterests may chage over time, ad the processig of creatig user iterest model may waste user's time ad place a burde o the user [9], [10], [11].But i our view that we ca complete the iitializatio of user iterest model by the value that obtaied explicitly ad chage with the drift of user s iterest. The vector space model has some limitatios: Log documets are poorly represeted because they have poor similarity values. Ca ot capture the items i the documet fully for user s complex preferece. The order i which the terms appear i the documet ca t be represeted i the vector space. Not cosidered the syoym ad polysemy of the words. We suggested iterest model should be expressed as a tree structure has 2 layers, the first layer describes the categories of user s iterests ad the secod layer represets user s prefereces. User ID used to distiguish differet users. User ID Ad Iterest Category P P P feature items feature items feature items feature items feature items feature items Fig. 3: Iterest Tree Each user has bee created a tree structure to store iterests. The ode i the first layer has property amed p which is used to describe the frequecy of user s iterest i a certai period. I a period of time, the frequecy of usig the iterest reaches a certai threshold ad the the iterest should be attributed to be the log-term iterest. A log-term iterest have ot bee used i a log time should be forgotte. Nodes i the last layer store the feature items of user s iterests.t j is the descriptio of feature items, W j expressed the weight which gai by a certai method to the correspodig feature items. The process of creatig a user model is ofte eglected to collect user iformatio explicitly, ad ot cosider the order of browsig pages. Ad ot selected importat historical browsig iformatio. Therefore, we propose a method to create user iterest model. Step 1 Collectig ad aalyzig iformatio from the set of user s behavior, ad the selectig the valuable pages based o search paths. By filterig effective webs, we ca low the amout of memory required to store the details Step 2 Extractig feature words form the pages of Step1 ad the creatig VSM. Step 3 Calculatig the relevacy rakig of feature words ad search key words is i order to remove oise. Step 4 Iitial formatio of short-term iterest model Step 5 Adjustig to format the log-term iterest model. Decreasig the umber of web pages required, icreasig the umber of web pages efficacious iformatio cotaiig, improvig the accuracy of user iterest model, ad updatig iterest model as iterestig movig, are merits of the method metioed above. 566

6 User Behavior SET Log-term Iterest Short-term Iterest Date Process Similarity Calculatio Select Effective Iformatio Useful Iformatio Search Key Word Vector Space Clusterig Fig. 4: Steps of creatig user iterest model 5. Ackowledgmet The authors are thakful to the experts who check ad approve this paper, ad to the classmates i No.149 lab of School of Computer Sciece ad Techology i Doghua Uiversity. 6. Refereces [1] M. Claypool, P. Le, M. Wased ad D. Brow, Implicit iterest idicators I Proc of the IUI 01 New York: ACM Press, 2001: [2] J. Atteberg, S. Padey ad T. Suel, Modelig ad Predictig User Behavior I Proc of the KDD 09 New York: ACM Press, 2009: [3] E. Agichtei, E. Brill ad S. Dumais, Improvig web search rakig by icorporatig user behavior iformatio I Proc of the SIGIR 06 New York: ACM Press, 2006: [4] S. Fox, K. Karawat, M. Mydlad, S. Dumals ad T. White, Evaluatig implicit measures to improve web search ACM Tras. If. Syst New York: ACM Press, 2005: [5] R.W. White ad J. Huag, Accessig the sceic route: measurig the value of search trails i web logs I Proc of the SIGIR 10 New York: ACM Press, 2010: [6] M. Bileko ad R.W. White, Miig the search trails of surfig crowds:idetifyig relevat websites from user activity I Proc if the WWW2008 Beijig: 2008:51-60 [7] Y.H.Wu ad Y.C. Chi, Eablig persoalized recommedatio o the web based o user iterests ad behaviors I Proc of the RIDE Heidelberg: IEEE Press, 2001: [8] G.G. Chowdhury, Itroductio to Moder Iformatio Retrieval Lodo Facet Press, 2004: [9] M. Speretta ad S. Gauch, Persoalized Search Based o User Search Histories I Proc of the WI 05 Los Alamitos: IEEE Press, 2005: [10] D. Billsus ad M.J. Pazzai, A hybrid user model for ews story classificatio I Proc of the UM 99 Baff: ACM Press,1999: [11] C.C Che, M.C Che ad Y. Su A self-adaptive persoal view aget I Proc of the KDD 01 Sa Fracisco:ACM Press, 2001:

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

Analysis of Documents Clustering Using Sampled Agglomerative Technique

Analysis of Documents Clustering Using Sampled Agglomerative Technique Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based

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

Which movie we can suggest to Anne?

Which movie we can suggest to Anne? ECOLE CENTRALE SUPELEC MASTER DSBI DECISION MODELING TUTORIAL COLLABORATIVE FILTERING AS A MODEL OF GROUP DECISION-MAKING You kow that the low-tech way to get recommedatios for products, movies, or etertaiig

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

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

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

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

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

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

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

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

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

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

Study on effective detection method for specific data of large database LI Jin-feng

Study on effective detection method for specific data of large database LI Jin-feng Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

Concept-Based user Profiles for Effective Search

Concept-Based user Profiles for Effective Search Cocept-Based user Profiles for Effective Search D. Pavithra, Assistat Professor, CSE Dr.N.G.P Istitute of Techology, Coimbatore. Abstract The objective of this project is to create a cocept based user

More information

1&1 Next Level Hosting

1&1 Next Level Hosting 1&1 Next Level Hostig Performace Level: Performace that grows with your requiremets Copyright 1&1 Iteret SE 2017 1ad1.com 2 1&1 NEXT LEVEL HOSTING 3 Fast page loadig ad short respose times play importat

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

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

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

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

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word A New Method of N-gram Statistics for Large Number of ad Automatic Extractio of Words ad Phrases from Large Text Data of Japaese Makoto Nagao, Shisuke Mori Departmet of Electrical Egieerig Kyoto Uiversity

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

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

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

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

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

Design and Implementation of Web Usage Mining Intelligent System in the Field of e-commerce

Design and Implementation of Web Usage Mining Intelligent System in the Field of e-commerce Available olie at www.sciecedirect.com Procedia Egieerig 30 (2012) 20 27 Iteratioal Coferece o Commuicatio Techology ad System Desig Desig ad Implemetatio of Web Usage Miig Itelliget System i the Field

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Hybrid User Model for Information Retrieval

Hybrid User Model for Information Retrieval Hybrid User Model for Iformatio Retrieval Hie Nguye Uiversity of Wiscosi-Whitewater Mathematical ad Computer Scieces Dept. 800 W. Mai Street Whitewater, WI 53190 guyeh@uww.edu Eugee Satos Jr. Dartmouth

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

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

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

Web Text Feature Extraction with Particle Swarm Optimization

Web Text Feature Extraction with Particle Swarm Optimization 32 IJCSNS Iteratioal Joural of Computer Sciece ad Network Security, VOL.7 No.6, Jue 2007 Web Text Feature Extractio with Particle Swarm Optimizatio Sog Liagtu,, Zhag Xiaomig Istitute of Itelliget Machies,

More information

Solutions for Homework 2

Solutions for Homework 2 Solutios for Homework 2 IIR Book: Exercise.2 (0.5 ) Cosider these documets: Doc breakthrough drug for schizophreia Doc 2 ew schizophreia drug Doc 3 ew approach for treatmet of schizophreia Doc 4 ew hopes

More information

Comparison of Different Distance Measures on Hierarchical Document Clustering in 2-Pass Retrieval

Comparison of Different Distance Measures on Hierarchical Document Clustering in 2-Pass Retrieval Compariso of Differet Distace Measures o Hierarchical Documet Clusterig i 2-Pass Retrieval Azam Jalali Farhad Oroumchia Mahmoud Reza Hejazi Departmet of Computer ad Electrical Egieerig, Faculty of Egieerig,

More information

Using Markov Model and Popularity and Similarity-based Page Rank Algorithm for Web Page Access Prediction

Using Markov Model and Popularity and Similarity-based Page Rank Algorithm for Web Page Access Prediction Iteratioal Coferece o Advaces i Egieerig ad Techology (ICAET'2014 March 29-30, 2014 Sigapore Usig Markov Model ad Popularity ad Similarity-based Page Rak Algorithm for Web Page Access Predictio Phyu Thwe

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

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

Analysis of Different Similarity Measure Functions and their Impacts on Shared Nearest Neighbor Clustering Approach

Analysis of Different Similarity Measure Functions and their Impacts on Shared Nearest Neighbor Clustering Approach Aalysis of Differet Similarity Measure Fuctios ad their Impacts o Shared Nearest Neighbor Clusterig Approach Ail Kumar Patidar School of IT, Rajiv Gadhi Techical Uiversity, Bhopal (M.P.), Idia Jitedra

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

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

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

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

Rapid Frequent Pattern Growth and Possibilistic Fuzzy C-means Algorithms for Improving the User Profiling Personalized Web Page Recommendation System

Rapid Frequent Pattern Growth and Possibilistic Fuzzy C-means Algorithms for Improving the User Profiling Personalized Web Page Recommendation System Received: November 21, 2017 237 Rapid Frequet Patter Growth ad Possibilistic Fuzzy C-meas Algorithms for Improvig the User Profilig Persoalized Web Page Recommedatio System Sipra Sahoo 1 * Bikram Kesari

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

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

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

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

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

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

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

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

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

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

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

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

A PREDICTION MODEL FOR USER S SHARE ANALYSIS IN DUAL- SIM ENVIRONMENT

A PREDICTION MODEL FOR USER S SHARE ANALYSIS IN DUAL- SIM ENVIRONMENT GSJ: Computer Sciece ad Telecommuicatios 03 No.3(39) ISSN 5-3 A PRDICTION MODL FOR USR S SHAR ANALYSIS IN DUAL- SIM NVIRONMNT Thakur Sajay, Jai Parag Orietal Uiversity, Idore, Idia sajaymca00@yahoo.com

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

Chapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4

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

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

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

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE Wiwik Aggraei 1, Agyl Ardi Rahmadi 1, Radityo Prasetyo Wibowo 1 1 Iformatio System Departmet, Faculty of Iformatio Techology, Istitut Tekologi Sepuluh

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

Table 2 GSM, UMTS and LTE Coverage Levels

Table 2 GSM, UMTS and LTE Coverage Levels 6 INDICATORS OF QUALITY OF SERVICE This sectio defies quality idicators that characterize the performace of services supported o mobile commuicatio systems i their various phases of access ad use 6. 6.1

More information

Intermediate Statistics

Intermediate Statistics Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet

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

Text Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree

Text Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree Available olie at www.ijpe-olie.com vol. 13, o. 7, November 017, pp. 1159-1164 DOI: 10.3940/ijpe.17.07.p19.11591164 Text Feature Selectio based o Feature Dispersio Degree ad Feature Cocetratio Degree Zhifeg

More information

EFFICIENT MULTIPLE SEARCH TREE STRUCTURE

EFFICIENT MULTIPLE SEARCH TREE STRUCTURE EFFICIENT MULTIPLE SEARCH TREE STRUCTURE Mohammad Reza Ghaeii 1 ad Mohammad Reza Mirzababaei 1 Departmet of Computer Egieerig ad Iformatio Techology, Amirkabir Uiversity of Techology, Tehra, Ira mr.ghaeii@aut.ac.ir

More information

What are Information Systems?

What are Information Systems? Iformatio Systems Cocepts What are Iformatio Systems? Roma Kotchakov Birkbeck, Uiversity of Lodo Based o Chapter 1 of Beett, McRobb ad Farmer: Object Orieted Systems Aalysis ad Desig Usig UML, (4th Editio),

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods. Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig

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

Neural Networks A Model of Boolean Functions

Neural Networks A Model of Boolean Functions Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de

More information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

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

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

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Text Summarization using Neural Network Theory

Text Summarization using Neural Network Theory Iteratioal Joural of Computer Systems (ISSN: 2394-065), Volume 03 Issue 07, July, 206 Available at http://www.ijcsolie.com/ Simra Kaur Jolly, Wg Cdr Ail Chopra 2 Departmet of CSE, Ligayas Uiversity, Faridabad

More information

Σ P(i) ( depth T (K i ) + 1),

Σ P(i) ( depth T (K i ) + 1), EECS 3101 York Uiversity Istructor: Ady Mirzaia DYNAMIC PROGRAMMING: OPIMAL SAIC BINARY SEARCH REES his lecture ote describes a applicatio of the dyamic programmig paradigm o computig the optimal static

More information

Vol. 4, No. 6 June 2013 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

Vol. 4, No. 6 June 2013 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved. Sematic Method for Query Expasio i a Itelliget Search System 1 Ejiofor C. I, 2 Williams E. E, 3 Nwachukwu E.O, 4 Theo va der Weide 1,3 Uiversity of PortHarcourt, River State, Nigeria, 2 Uiversity of Calabar,

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

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