A Transitive Model for Extracting Translation Equivalents of Web Queries through Anchor Text Mining

Size: px
Start display at page:

Download "A Transitive Model for Extracting Translation Equivalents of Web Queries through Anchor Text Mining"

Transcription

1 A Trasitive Model for Extractig Traslatio Equivalets of Web Queries through Achor Text Miig We-Hsiag Lu Istitute of Iformatio Sciece Academia Siica; Dept. of Computer Sciece ad Iformatio Egieerig Natioal Chiao Tug Uiversity Hsichu 300, Taiwa, ROC Lee-Feg Chie Istitute of Iformatio Sciece, Academia Siica Nagag 5, Taiwa, ROC Hsi-Jia Lee Dept. of Computer Sciece ad Iformatio Egieerig Natioal Chiao Tug Uiversity Hsichu 300, Taiwa, ROC Abstract Oe of the existig difficulties of cross-laguage iformatio retrieval (CLIR) ad Web search is the lack of appropriate traslatios of ew termiology ad proper ames. Differet from covetioal approache i our previous research we developed a approach for exploitig Web achor texts as live biligual corpora ad reducig the existig difficulties of query term traslatio. Although Web achor text udoubtedly, are very valuable multiligual ad wide-scoped hypertext resource ot every particular pair of laguages cotais sufficiet achor texts i the Web to extract correspodig traslatios i the laguage pair. For more geeralized applicatio i this paper we exted our previous approach by addig a phase of trasitive (idirect) traslatio via a itermediate (third) laguage, ad propose a trasitive model to further exploit achor-text miig i term traslatio extractio applicatios. Prelimiary experimetal results show that may query traslatios which caot be obtaied usig the previous approach ca be extracted with the improved approach.. Itroductio Cross-laguage iformatio retrieval (CLIR), addressig the special eed where users ca query i oe laguage ad retrieve relevat documets writte or idexed i aother laguage, has become a importat issue i the research of iformatio retrieval (Dumais et al., 996; Davis et al., 997; Ballesteros & Croft, 998; Nie et al., 999). However, its applicatio to practical Web search services has ot lived up to expectatio sice they suffer a major bottleeck that lacks up-to-date biligual lexicos cotaiig the traslatio of popular query terms such as proper ous (Kwok, 200). To eable capability of CLIR, existig IR systems mostly rely o biligual dictioaries for cross-ligual retrieval. I these system queries submitted i a source laguage ormally have to be traslated ito a target laguage by meas of simple dictioary lookup. These dictioary-based techiques are limited i real-world applicatio sice the queries give by users ofte cotai proper ous. Aother kid of popular approaches to dealig with query traslatio based o corpus-based techiques uses a parallel corpus cotaiig aliged seteces whose traslatio pairs are correspodig to each other (Brow et al., 993; Daga et al., 993; Smadja et al., 996). Although more reliable traslatio equivalets ca be extracted by these techique the uavailability of large eough parallel corpora for various subject domais ad multiple laguages is still i a thory situatio. O the other had, the alterative approach usig comparable or urelated text corpora were studied by Rapp (999) ad Fug et al. (998). This task is more difficult due to lack of parallel correlatio betwee documet or setece pairs. I our collected query log most of user queries cotai oly oe or two word so we use query term, query or term iterchageably i this paper.

2 I our previous research we have developed a approach to extractig traslatios of Web queries through miig of Web achor texts ad lik structures (Lu, et al., 200). This approach exploits Web achor texts as live biligual corpora to reduce the existig difficulties of query traslatio. Achor text set which are composed of a umber of achor texts likig to the same page may cotai similar descriptio texts i multiple laguage thus it is more likely that user s queries ad their correspodig traslatios frequetly appear together i the same achor text sets. The achor-text miig approach has bee foud effective particularly for proper ame such as iteratioal compay ame ames of foreig movie star worldwide evet e.g., Yahoo, Athrax, Harry Potter, etc. Discoverig useful kowledge from the potetial resource of Web achor texts is still ot fully explored. Accordig to our previous experimet the extracted traslatio equivalets might ot be reliable eough whe a query term whose correspodig traslatios either appear ifrequetly i the same achor text sets or eve do ot appear together. Especially, the traslatio process will be uavailable if there is a lack of sufficiet achor texts for a particular laguage pair. Although Web achor text udoubtedly, are live multiligual resource ot every particular pair of laguages cotais sufficiet achor texts. To deal with the problem this paper exteds the previous achor-text-based approach by addig a phase of idirect traslatio via a itermediate laguage. For a query term which is uable to be traslated, our idea is to traslate it ito a set of traslatio cadidates i a itermediate laguage, ad the seek for the most likely traslatio from the cadidate which are traslated from the itermediate laguage ito the target laguage (Gollis et al., 200; Bori, 2000). We therefore propose a trasitive traslatio model to further exploit achor text miig for traslatig Web queries. A series of experimets has bee coducted to realize the performace of the proposed approach. Prelimiary experimetal results show that may query traslatios which caot be obtaied usig the previous approach ca be extracted with the improved approach. 2 The Previous Approach For query traslatio, the achor-text-based approach is a ew techique compared with the biligual-dictioary- ad parallel-corpus-based approaches. I this sectio we will itroduce the basic cocept of the achor-text-based approach. For more details please refer to our iitial work (Lu, et al., 200). 2. Achor-Text Set A achor text is the descriptive part of a out-lik of a Web page. It represets a brief descriptio of the liked Web page. For a Web page (or URL) u i, its achor-text set is defied as all of the achor texts of the lik i.e., u i 's i-lik poitig to u i. I geeral, the achor-text set records u i 's alterative cocepts ad textual expressios such as titles ad headig which are cited by other Web pages. With differet preferece covetios ad laguage competece, the achor-text set could be composed of multiligual phrase short text acroym or eve u i 's URL. For a query term appearig i the achor-text set, it is likely that its correspodig traslatios also appear together. The achor-text sets ca be cosidered as a comparable corpus of traslated text from the viewpoit of traslatio extractio. 2.2 The Probabilistic Iferece Model To determie the most probable target traslatio t for source query term we developed a probabilistic iferece model (Wog et al., 995). This model is adopted for estimatig probability value betwee source query ad each traslatio cadidate that co-occur i the same achor-text sets. The estimatio assumes that the achor texts likig to the same pages may cotai similar terms with aalogous cocepts. Therefore, a cadidate traslatio has a higher chace to be a effective traslatio if it is writte i the target laguage ad frequetly co-occurs with the source query term i the same achor-text sets. I the field of Web research, it has bee prove that the use of lik structures is effective for estimatig the 2

3 authority of Web pages (Kleiberg, 998; Chakrabarti et al., 998). The model further assumes that the traslatio cadidates i the achor-text sets of the pages with higher authority may have more reliability i cofidece. The similarity estimatio fuctio based o the probabilistic iferece model is defied below: s t) s t) = = s t) = s t ui) ( s t) ui) s t ui) ui). s t ui) ui) () The above measure is adopted to estimate the degree of similarity betwee source term s ad target traslatio t. The measure is estimated based o their co-occurrece i the achor text sets of the cocered Web pages U = {u, u 2,... u }, i which u i is a page of cocer ad u i ) is the probability value used to measure the authority of page u i. By cosiderig the lik structures ad cocept space of Web page u i ) is estimated with the probability of u i beig liked, ad its estimatio is defied as follows: u i )= L(u i )/Σ j=, L(u j ), where L(u j )= the umber of i-liks of page u j. Such estimatio is simplified from HITS algorithm (Kleiberg, 998). I additio, we assume that s ad t are idepedet give u i, the the joit probability s t u i ) is equal to the product of s u i ) ad t u i ), ad the similarity measure becomes: s t) = s u)t i u)p i ( ui).(2) [ s ui) + t ui) s u)t i u) i ] ui) The values of s u i ) ad t u i ) are defied to be estimated by calculatig the fractios of the umbers of u i s i-liks cotaiig s ad t over L(u i ), respectively. Therefore, a cadidate traslatio has a higher cofidece value to be a effective traslatio if it frequetly co-occurs with the source term i the achor-text sets of the pages with higher authority. 2.3 The Estimatio Process For each source term, the probabilistic iferece model extracts the most probable traslatio that maximizes the estimatio. The estimatio process based o the model was developed to extract term traslatios through miig of real-world achor-text sets. The process cotais three major computatioal modules: achor-text extractio, term extractio ad term traslatio extractio. The achor-text extractio module was costructed to collect pages from the Web ad build up a corpus of achor-text sets. O the other had, for each give source term the term extractio module extracts key terms as the traslatio cadidate set from the achor-text sets of the pages cotaiig s. At last, the term traslatio module extracts the traslatio that maximizes the similarity estimatio. For more details about the estimatio proces please refer to our previous work (Lu et al., 200). To make a differece from the traslatio process via a itermediate laguage, the above process is called direct traslatio, ad the adopted model called direct traslatio model hereafter. Meawhile, we will use fuctio Pdirect i Equatio (3) for the estimatio of the direct traslatio. Pdirect( t) = log s t). (3) 3 The Improved Approach 3. The Idirect Traslatio Model As metioed above, for those query terms whose correspodig traslatios either appear ifrequetly i the same achor text sets or do ot appear together, the estimatio with equatio (2) is basically ureliable. To icrease the possibility of traslatio extractio especially for the source terms whose correspodig traslatios do ot co-occur, we add a phase of idirect traslatio through a itermediate laguage. For example, as show i Fig., our idea is to obtai the correspodig target 3

4 traslatio i simplified Chiese by traslatig the source term i traditioal Chiese ito a itermediate term Soy i Eglish, ad the seek for traslatig Soy ito a target term i simplified Chiese. For both the source query ad the target traslatio, we assume that their traslatios i the itermediate laguage are the same ad ca be foud. s (Traditioal Chiese) The above assumptio is ot urealistic. For example, it is possible to fid the Chiese traslatio of a Japaese movie star through submittig his/her Eglish ame to a search egie ad browsig the retrieved Chiese pages cotaiig the Eglish ame. The Web cotais large amouts of multiligual page ad Eglish is the most likely itermediate laguage betwee other laguages. Based o this assumptio, we exted the probabilistic iferece model ad propose a idirect traslatio model as the followig formula: Pidirect( t) = log s m, m t) m Soy (Eglish) t (Simplified Chiese) s : source term t : target traslatio m : itermediate traslatio Fig.. A abstract diagram showig the cocepts of direct traslatio ad idirect traslatio. log[ s m) m t)] = log s m) + log m t). (4), where m is the trasitive traslatio of s ad t i the itermediate laguage, s m) ad m t) are the probability values obtaied with the direct traslatio model which ca be calculated by Equatio (2). 3.2 The Trasitive Traslatio Model The trasitive model is developed to combie both the direct ad idirect traslatio models ad improve the traslatio accuracy. By combiig Equatio (3) ad (4), the trasitive traslatio model is defied as follows: Ptras( t) = Pdirect( t), if Pdirect(t) > θ Pidirect( t), otherwise., where θ is a predefied threshold value. (5) 4 Experimetal Results 4. Aalysis of Achor-Text Sets ad Query Logs I the iitial experimet we took traditioal Chiese ad simplified Chiese as the source ad target laguage respectively, ad used Eglish as the itermediate laguage. We have collected,980,86 traditioal Chiese Web pages i Taiwa. Amog these page 09,46 pages whose achor-text sets cotaied both traditioal Chiese ad Eglish terms were take as the achor-text set corpus. We also collected 2,79,7 simplified Chiese Web pages i Chia ad extracted 57,786 pages whose achor-text sets cotaied both simplified Chiese ad Eglish terms. I additio, through mergig the two Web page collectios ito a larger oe, we extracted 4,56 Web pages cotaiig both traditioal ad simplified Chiese terms. The three comparable corpora provide a potetial resource of traslatio pairs for some Web queries. I order to realize the feasibility i traslatig query terms via trasitive traslatio, we aim at fidig out the correspodig simplified Chiese traslatios of traditioal Chiese query terms via Eglish as the itermediate laguage. 4

5 We also collected popular query terms with the logs from two real-world Chiese search egies i Taiwa, i.e., Dreamer ad GAIS 2. The Dreamer log cotaied 228,566 uique query terms from a period of over 3 moths i 998, ad the GAIS log cotaied 4,82 uique query terms from a period of two weeks i 999. There were 9,709 most popular query terms whose frequecies were above 0 i both of the logs ad,230 of them were Eglish terms. After filterig out the terms which were used locally, we obtaied 258 terms. These query terms were take as the major test set i the term traslatio extractio aalysis. The traditioal Chiese traslatios of the test query terms were determied maually ad take as the source query set i the followig experimets. Accordig to our previous work (Lu et al., 200), there were three methods for term extractio, which is a ecessary process step i extractig traslatios from achor-text corpus. Sice we have ot yet collected a query log i simplified Chiese, i the followig experimets we adopted the PAT-tree-based keyword extractio method, which is a efficiet statistics-based approach that ca extract loger terms without usig a dictioary (Chie, 997). To evaluate the achieved performace of query traslatio, we used the average top- iclusio rate as a metric. For a set of test query term its top- iclusio rate is defied as the percetage of the query terms whose effective traslatio(s) ca be foud i the top extracted traslatios. 4.2 Performace with the Direct Traslatio Model I order to realize the feasibility of the trasitive traslatio model, we carried out some experimets based o the direct traslatio models ad the three differet achor-text set corpora i the first step. Table shows the results of the obtaied top-5 iclusio rate 2 These two search egies are secod-tier portals i Taiwa, whose logs have certai represetatives i the Chiese commuitie ad whose URL s are as follows: ad where terms TC, SC ad ENG represet traditioal Chiese, simplified Chiese ad Eglish terms respectively. The performace of traslatig TC ito SC is worse tha that of the other two sice the size of the achor-text set corpus cotaiig both TC ad SC is relatively small i compariso with the others. This is why we are pursuig i this paper to itegrate the direct traslatio with the idirect traslatio via a third laguage. However, the performace of the direct traslatio from TC to SC is used as a referece i compariso with our proposed models i the followig experimets. Table. Top- iclusio rates obtaied with the direct traslatio model ad the three specific laguage pairs corpora. Type Top Top2 Top3 Top4 Top5 TC=>SC 35.7% 43.0% 46.9% 49.6% 5.2% TC=>ENG 68.6% 82.2% 85.7% 88.0% 88.8% ENG=>SC 45.3% 55.8% 59.3% 6.6% 64.0% 4.3 Performace with the Idirect ad Trasitive Traslatio Models To realize the improvemet usig the trasitive traslatio model, some further experimets were coducted. As show i Table 2, the idirect ad trasitive traslatio models outperform tha the direct traslatio model. As metioed above, the size of the achor-text corpus that cotais both TC ad SC is small. The idirect traslatio model i therefore, helpful to fid out the correspodig traslatios for some terms with low-frequecy values i the corpora. For example, the traditioal Chiese term ±ñˆ was foud ca obtai its correspodig traslatio equivalet ±Áˆ i simplified Chiese via the itermediate traslatio Siemes, which caot be foud oly usig the direct traslatio. By examiig the top- traslatios obtaied with the three differet model it was foud that the iclusio rates ca be from 44.2% usig the idirect traslatio to 49.2% usig the trasitive traslatio model. Table 3 illustrates some of the traslatios extracted usig the trasitive traslatio model. 5

6 Table 2. Top- iclusio rates obtaied with differet models. Model Top Top2 Top3 Top4 Top5 Direct 35.7% 43.0% 46.9% 49.6% 5.2% Traslatio Idirect 44.2% 55.% 58.0% 59.7% 60.5% Traslatio Trasitive 49.2% 58.% 60.9% 6.6% 62.0% Traslatio Combiatio 55.8% 60.8% 64.0% 65.9% 67.8% of Trasitive Traslatio ad Lexico 4.4 Performace with a Itegratio of Lexico Lookup A additioal experimet was also made to compare with the use of a traslatio lexico for query traslatio. The lexico cotaied more tha 23,948 word/phrase etries i both traditioal Chiese ad simplified Chiese. It was foud the top- iclusio rate that usig the lexico lookup was 2.4% which is obviously lower tha the 49.2% that usig the proposed trasitive traslatio model. I additio, the top- iclusio rate ca reach to 55.8% (see the last row of Table 2) if both of the approaches are combied. With the combied approach, the traslatio(s) of a query term is picked up from the lexico if such a traslatio is already i the lexico, otherwise it is obtaied based o the trasitive traslatio model. 5 Cocludig Remarks Achor-text set corpus is a valuable resource for extractig traslatios of Web queries. How to exploit such kid of corpora i query traslatio is a challegig ad potetial research task. I this paper, we exted our previous approach by proposig a trasitive traslatio model ad achieve some improvemets o traslatig those queries whose traslatios caot be extracted usig the previous approach. The improved approach has bee prove particularly useful for the specific laguage pairs whose achor texts are isufficiet. However, there are still some problems eed to be further ivestigated i the future. Refereces Ballestero L. ad Croft, W. B. (997) Phrasal Traslatio ad Query Expasio Techiques for Cross-Laguage Iformatio Retrieval, Proceedigs of ACM-SIGIR 97, pp Bori, L. (2000) You ll Take the High Road ad I ll Take the Low Road: Usig a Third Laguage to Improve Biligual Word Aligmet, Proceedigs of the 8th COLING, pp Brow, P., Pietra, S. A. D., Pietra, V. D. J., Mercer, R. L. (993) The Mathematics of Machie Traslatio, Computatioal Liguistic 9(2), pp Chakrabarti, S., Dom, B., Gibso, D., Kleiberg, J., Raghava, P., Rajagopala, S. (998) Automatic Resource List Compilatio by Aalysig Hyperlik Structure ad Associated Text, Proceedigs of the seveth World Wide Web Coferece. Chie, L. F. (997) PAT-Tree-Based Keyword Extractio for Chiese Iformatio Retrieval, Proceedigs of ACM-SIGIR 97, pp Daga, I., Church, K. W., Gale, W. A (993) Robust Biligual Word Aligmet for Machie Aided Traslatio. Proceedigs of the Workshop o Very Large Corpora, pp. -8. Davi M. ad Ogde, W. C. (997) Quilt: Implemetig a large-scale cross-laguage text retrieval system, Proceedigs of ACM-SIGIR 97 Coferece, pp Dumai S. T., Ladauer, T. K., Littma, M. L. (996) Automatic Cross-liguistic Iformatio Retrieval Usig Latet Sematic Idexig, SIGIR 96 Workshop o Cross-Liguistic Iformatio Retrieval, pp Fug, P. ad Yee, L. Y. (998) A IR Approach for Traslatig New Words from Noparallel, Comparable Text Proceedigs of The 36th Aual Coferece of the Associatio for Computatioal Liguistic pp Golli T., Saderso, M. (200) Improvig Cross laguage Iformatio with Triagulated Traslatio, Proceedigs of ACM-SIGIR200 Coferece, pp Kleiberg, J. (998) Authoritative Sources i a Hyperliked Eviromet, Proceedigs of 9th ACM-SIAM Symposium o Discrete Algorithms. Kwok, K. L. (200) NTCIR-2 Chiese, Cross Laguage Retrieval Experimets Usig PIRCS, Proceedigs of NTCIR workshop meetig. Lu, W. H., Chie, L. F., Lee, H. J. (200) Achor Text Miig for Traslatio of Web Querie 6

7 Proceedigs of The 200 IEEE Iteratioal Coferece o Data Miig. Nie, J. Y., Isabelle, P., Simard, M., ad Durad, R. (999) Cross-laguage Iformatio Retrieval Based o Parallel Texts ad Automatic Miig of Parallel Texts from the Web, Proceedigs of ACM-SIGIR 99 Coferece. Rapp, R. (999) Automatic Idetificatio of Word Traslatios from Urelated Eglish ad Germa Corpora, Proceedigs of The 37th Aual Coferece of the Associatio for Computatioal Liguistics. Smadja, F., McKeow, K., Hatzivassiloglou, V. (996) Traslatig Collocatios for Biligual Lexicos: A Statistical Approach, Computatioal Liguistic 22(), pp Wog, S. K. M., Yao Y. Y. (995) O Modelig Iformatio Retrieval with Probabilistic Iferece, ACM trasactios o Iformatio System Vol.3, pp Table 3. Some examples of extracted target traslatios with the three differet models. (the asterisk idicates the correct traslatio) Source terms i traditioal Chiese Top-5 extracted target traslatios i simplified Chiese Direct Traslatio Idirect Traslatio Trasitive Traslatio Model Model Model ±Áˆ* (Siemes) (Compay) Š (Chia) (website) ³(cooperatio) ±ñˆ(siemes) Not available ±Áˆ* (Siemes) (Compay) Š (Chia) (website) ³(cooperatio) (Compaq) Not available * (Compaq) ÆÌ (computer compay) (compay) (America) (Soy) ÆÌ(computer) š* (Soy) š* (Soy) œ (our compay) * (Soy) * (Soy) Æ (movie site) (record) ¹(etertaimet) Š é(chiese versio) (record compay) * (Compaq) ÆÌ (computer compay) (compay) (America) ÆÌ(computer) š* (Soy) * (Soy) Æ (movie site) ¹(etertaimet) (record compay) 7

Translation of Web Queries Using Anchor Text Mining

Translation of Web Queries Using Anchor Text Mining Traslatio of Web Queries Usig Achor Text Miig WEN-HSIANG LU Academia Siica ad Natioal Chiao Tug Uiversity LEE-FENG CHIEN Academia Siica AND HSI-JIAN LEE Natioal Chiao Tug Uiversity This article presets

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

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

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

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

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

Chinese and Korean Topic Search of Japanese News Collections

Chinese and Korean Topic Search of Japanese News Collections Chiese ad Korea Topic Search of Japaese News Collectios Fredric C. Gey UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley 94720-5100, USA gey@ucdata.berkeley.edu Abstract UC Berkeley

More information

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.

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

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

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

Automatic Collecting of Text Data for Cantonese Language Modeling

Automatic Collecting of Text Data for Cantonese Language Modeling S4-4 Automatic Collectig of Text Data for Catoese Laguage Modelig Jiag CAO, Xiaoju WU, Yu Tig Yeug 2, Ta LEE 2, Thomas Fag Zheg *. Ceter for Speech ad Laguage Techologies, Divisio of Techical Iovatio ad

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

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection 2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,

More information

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic. Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

A Comprehensive Method for Text Summarization Based on Latent Semantic Analysis

A Comprehensive Method for Text Summarization Based on Latent Semantic Analysis A Comprehesive Method for Text Summarizatio Based o Latet Sematic Aalysis Yigjie Wag ad Ju Ma School of Computer Sciece ad Techology, Shadog Uiversity, Jia, Chia yigj_wag@hotmail.com, maju@sdu.edu.c Abstract.

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

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

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

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

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

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

Shadow Document Methods of Results Merging

Shadow Document Methods of Results Merging Shadow Documet Methods of Results Mergig Shegli Wu ad Fabio Crestai Departmet of Computer ad Iformatio Scieces Uiversity of Strathclyde, Glasgow, UK {s.wu,f.crestai}@cis.strath.ac.uk ABSTRACT I distributed

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

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao

More information

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System Mappig Publishig ad Mappig Adaptatio i the Middleware of Railway Iformatio Grid ystem You Gamei, Liao Huamig, u Yuzhog Istitute of Computig Techology, Chiese Academy of cieces, Beijig 00080 gameiu@ict.ac.c

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

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

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

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

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

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

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

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

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter

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

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

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

SOFTWARE usually does not work alone. It must have

SOFTWARE usually does not work alone. It must have Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad

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

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

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

A Parallel DFA Minimization Algorithm

A Parallel DFA Minimization Algorithm A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this

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

Research on Interest Model of User Behavior

Research on Interest Model of User Behavior 2011 Iteratioal Coferece o Computer Sciece ad Iformatio Techology (ICCSIT 2011) IPCSIT vol. 51 (2012) (2012) IACSIT Press, Sigapore DOI: 10.7763/IPCSIT.2012.V51.94 Research o Iterest Model of User Behavior

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology

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

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

Dictionary and Monolingual Corpus-based Query Translation for Basque-English CLIR

Dictionary and Monolingual Corpus-based Query Translation for Basque-English CLIR Dictioary ad Mooligual Corpus-based Query for Basque-Eglish CLIR Xabier Saralegi, Maddale Lopez de Lacalle R&D Elhuyar Foudatio Usurbil, Spai x.saralegi@elhuyar.com, m.lopezdelacalle@elhuyar.com Abstract

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

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

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

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

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

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

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

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

. 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

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis

More information

A Boolean Query Processing with a Result Cache in Mediator Systems

A Boolean Query Processing with a Result Cache in Mediator Systems A Boolea Query Processig with a Result Cache i Mediator Systems Jae-heo Cheog ad Sag-goo Lee * Departmet of Computer Sciece Seoul Natioal Uiversity Sa 56-1 Shillim-dog Kwaak-gu, Seoul Korea {cjh, sglee}cygus.su.ac.kr

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

Language Resources in Indonesia

Language Resources in Indonesia Laguage Resources i Idoesia Laguage Techology & Applied Iformatio Laboratory Directorate for Iformatio Techology ad Electroics Agecy for the Assessmet & Applicatio of Techology (BPPT) Idoesia TBIT Laboratory

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

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:

More information

Efficient Compound Unit Search for Heterogeneous Types

Efficient Compound Unit Search for Heterogeneous Types Efficiet Compoud Uit Search for Heterogeeous Types Hami Jug, Saghwa Yuh, Taewa Kim, Dog-I Park Machie Traslatio Laboratory, Systems Egieerig Research Istitute Eueo 1, Yuseog Taejeo, South Korea 305-333

More information

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

Mining Hidden Community in Heterogeneous Social Networks

Mining Hidden Community in Heterogeneous Social Networks Miig Hidde Commuity i Heterogeeous Social Networks Deg Cai Zheg Shao Xiaofei He Xifeg Ya Jiawei Ha Departmet of Computer Sciece, Uiversity of Illiois at Urbaa-Champaig Departmet of Computer Sciece, Uiversity

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

A Focused Crawler Based on Naive Bayes Classifier

A Focused Crawler Based on Naive Bayes Classifier Third Iteratioal Symposium o Itelliget Iformatio Techology ad Security Iformatics A Focused Crawler Based o Naive Bayes Classifier Wexia Wag, Xigshu Che*, Yogbi Zou Network ad Trusted Computig Istitute,

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

performance to the performance they can experience when they use the services from a xed location.

performance to the performance they can experience when they use the services from a xed location. I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi

More information

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural

More information

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül

More information

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

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

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P. Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's

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

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

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

Li Zheng2 School of Management Fujian University of Technology Fujian Province, , China

Li Zheng2 School of Management Fujian University of Technology Fujian Province, , China Iteratioal Coferece of Orgaizatioal Iovatio (ICOI 07) Usig Fuzzy FP-Growth for Miig Associatio Rules Chie-Hua Wag* * Correspodig author: wagthuck@gmail.com Li Zheg zzheglimail@gmail.com Xuelia Yu Yuxuelia_00@6.com

More information

Bayesian Network Structure Learning from Attribute Uncertain Data

Bayesian Network Structure Learning from Attribute Uncertain Data Bayesia Network Structure Learig from Attribute Ucertai Data Wetig Sog 1,2, Jeffrey Xu Yu 3, Hog Cheg 3, Hogya Liu 4, Ju He 1,2,*, ad Xiaoyog Du 1,2 1 Key Labs of Data Egieerig ad Kowledge Egieerig, Miistry

More information

AN ADAPTIVE LEARNING ALGORITHM FOR TASK ADAPTATION IN CHINESE HOMOPHONE DISAMBIGUATION 1. Hsin-Hsi Chen and Yue-Shi Lee

AN ADAPTIVE LEARNING ALGORITHM FOR TASK ADAPTATION IN CHINESE HOMOPHONE DISAMBIGUATION 1. Hsin-Hsi Chen and Yue-Shi Lee AN ADAPTIVE LEARNING ALGORITHM FOR TASK ADAPTATION IN CHINESE HOMOPHONE DISAMBIGUATION Hsi-Hsi Che ad Yue-Shi Lee ABSTRACT Task adaptatio from a set of ru-time feedback iformatio has become icreasigly

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Economical Structure for Multi-feature Music Indexing 1

Economical Structure for Multi-feature Music Indexing 1 Proceedigs of the Iteratioal MultiCoferece of Egieers ad Computer Scietists 2008 Vol I IMECS 2008, 19-21 March, 2008, Hog Kog Ecoomical Structure for Multi-feature Music Idexig 1 Yu-Lug Lo, ad Chu-Hsiug

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

Analysis of Algorithms

Analysis of Algorithms Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms

More information

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp

More information

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree 1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:

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