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

Size: px
Start display at page:

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

Transcription

1 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 USA ABSTRACT. As i CLEF 2003, Berkeley experimeted with the CLEF Russia Izvestia documet collectio with mooligual ad biligual rus for the Russia collectio. For CLEF 2004 we also experimeted with Chiese ad Japaese as topic laguages, usig Eglish as the pivot laguage. For biligual retrieval our approaches were query traslatio (for Eglish as a topic laguage) ad fast documet traslatio from Russia to Eglish (for Chiese ad Japaese traslated to Eglish as the topic laguage). Chiese ad Japaese topic retrieval sigificatly uder-performed Eglish Russia retrieval because of the double traslatio loss of effectiveess. 1 Itroductio CLEF 2003 was the first time a Russia laguage documet collectio was available i CLEF. We had worked for several years with Russia topics i both the GIRT task ad the CLEF mai tasks, so extesio of our techiques to Russia was straightforward No uusual methodoy was applied to the Russia collectio, however ecodig remaied a issue ad we eded up usig the KOI-8 ecodig scheme for both Russia documets ad topics. 2 Documet rakig Berkeley has used a mooligual documet rakig algorithm which uses statistical clues foud i documets ad queries to predict a dichotomous variable (relevace) based upo istic regressio fittig of prior relevace judgmets. The exact formula is: O ( R = P ( R P ( R D, Q ) = D, Q ) D, Q ) = x 3 + P ( R D, Q ) 1 P ( R D, Q ) x x 4 x 2 where O ( R D, Q ), P( R D, Q ) mea, respectively, odds ad probability of relevace of a documet with respect to a query, ad 1 qtfi x1 = + 1 ql 35 i= 1 +

2 x 2 = i i= 1 dl + dtf 80 1 ctfi x3 = + 1 cl x = 4 i= 1 where is the umber of matchig terms betwee a documet ad a query, ad ql : query legth dl: documet legth cl: collectio legth qtf_i: the withi-query frequecy of the ith matchig term dtf_i: the withi-documet frequecy of the ith matchig term ctf_i: the occurrece frequecy of the ith matchig term i the collectio. This formula has bee used sice the secod TREC coferece ad for all NTCIR ad CLEF cross-laguage evaluatios [1]. 3 Russia Retrieval for the CLEF mai task CLEF 2003 marked the first time a documet collectio was available ad evaluated i the Russia laguage. The CLEF Russia collectio cosists of 16,716 articles from Izvestia ewspaper for This is a small umber of documets by most CLEF measures (the smallest other collectio of CLEF 2003, Fiish, has 55,344 documets; the Spaish collectio has 454,045 documets). We used the Russia ad Eglish idexes geerated for CLEF 2003 for all our CLEF 2004 Russia rus. The collectio is also rich i metadata, icludig specificatio of geography for ews articles; this ca be exploited for mappig ad geotemporal queryig of documets relatig to place ad time [2]. 3.1 Ecodig Issues The Russia documet collectio was supplied i the UTF-8 uicode ecodig, as were the Russia versio of the topics. However, sice the stemmer we employ is i KOI8 format, the etire collectio was coverted ito KOI8 ecodig, as with CLEF 2003 [3]. I idexig the collectio, we coverted upper-case letters to lowercase ad applied Sowball s Russia stemmer ( together with Russia stopword list created by mergig the Sowball list with a traslatio of the Eglish stopword list. I additio the PROMPT traslatio system would also oly work o KOI8 ecodig which meat that our traslatios from Eglish also would come i that ecodig. 3.2 Russia Mooligual Retrieval We submitted two Russia mooligual rus, the results of which are summarized below. As i CLEF 2003, both rus utilized blid feedback, choosig the top 30 terms from the top raked 20 documets of a iitial retrieval ru For BKRUMLRR1 ad BKRUMLRR2 rus we used TITLE ad DESCRIPTION documet fields for idexig. The results of our retrieval are summarized i Table 1. Results were reported by the CLEF orgaizers for 34 topics which had oe or more relevat documets. Ru Name BKRUMLRR1 BKRUMLRR2 Idex Koi Koi Topic fields TD TDN Retrieved

3 Relevat Rel Ret Precisio at at at at at at at at at at at Avg. Precisio Table 1: Berkeley Mooligual Russia rus for CLEF 2004 Addig the Narrative sectio to the query did ot sigificatly improve results because the Narrative sectio did ot cotribute additioal cotet terms beyod those foud i the Title ad Descriptio fields of the topics. 3.3 Biligual Retrieval from Eglish to Russia We submitted eight biligual rus agaist the Russia documet collectio, four with Eglish as topic laguage ad two each with Chiese ad Japaese as topic laguages. These rus used a idex i which oly the TITLE ad TEXT fields of each Russia documet was idexed, so are directly comparable to the mooligual rus BKMLRURR1 ad BKMLRURR2 above. The four Eglish Russia rus utilized query traslatio from Eglish topics ito Russia. We compared two web-available traslatio systems, SYSTRAN at for the first two rus (BKRUBLER1, BKRUBLER2) ad the PROMT system (rus BKRUBLER3, BKRUBLER4) developed i Russia ad foud at Ru Name BKRUBLER1 BKRUBLER2 BKRUBLER3 BKRUBLER4 Traslatio Babelfish Babelfish PROMT PROMT Topic fields TD TDN TD TDN Retrieved Relevat Rel Ret Precisio at at at at at at at at at at at Avg. Prec Table 2. Biligual Eglish Russia rus.

4 The results demostrate clearly the superiority of the PROMT system for this topic set. 3.4 Biligual Retrieval from Chiese ad Japaese to Russia Because Chiese ad Japaese were available as topic laguages, we experimeted with these laguages by traslatig the topics to Eglish (i.e. used Eglish as a pivot laguage). Our approach to traslatio from Chiese or Japaese topics to Eglish was to utilize a widely available software package, the SYSTRAN CJK Persoal system available for less tha $US100. from However, istead of query traslatio a secod time, we utilized a techique (also used for Russia i CLEF 2003) developed by Aitao Che, called Fast Documet Traslatio [4]. Istead of doig complete documet traslatio usig MT software, the MT system is used to traslate the etire vocabulary of the documet collectio o a word-by-word basis without the cotextualizatio of positio i setece with respect to other words. Mooligual retrieval was performed by matchig the Eglish versios of the Chiese or Japaese topics agaist the traslated Eglish documet collectio. More details ca be foud i our CLEF-2003 fial paper [3]. The results, displayed below i Table 3, show that there is cosiderable loss of performace whe usig Eglish as a pivot laguage for these Asia laguage (we have re-displayed the best Eglish Russia rus for compariso). It may be that this performace was hampered by the reduced utility of the Eglish documets traslated from Russia, as was the case for our CLEF 2003 biligual performace which used this method. We did ot try mergig of rus from the two methods to see if it would improvemet performace. Ru Name BKRUBLER3 BKRUBLER4 BKRUMLZE1 BKRUMLZE2BKRUMLJR1 BKRUMLJR2 Laguage Eglish Eglish Chiese Chiese Japaese Japaese Traslatio PROMT PROMT Systra CJK Systra CJK Systra CJK Systra CJK Topic fields TD TDN TD TDN TD TDN Retrieved Relevat Rel Ret Precisio at at at at at at at at at at at Avg. Prec Table 3. Biligual Chiese/Japaese Russia rus 3.5. Brief Aalysis of Retrieval Performace Our mooligual Russia performace was acceptable but certaily ot outstadig. For may topics, Title- Descriptio rus out-performed Title-Descriptio-Narrative rus, because the Narrative sectio added o ew iformatio ad might sometimes add oise terms. For all our rus our biligual retrieval results were worse tha mooligual (Russia-Russia) retrieval i terms of overall precisio. However the traslatio of Eglish to Russia by the PROMT system achieved 82% of mooligual for the TD rus. Oe puzzlig ad iterestig topic was umber 202 ( Nick Leeso's Arrest )

5 where our biligual retrieval out-performed our mooligual rus it seems that the PROMT traslatio ad trasliteratio Арест Ника Лизона came up with a better spellig of the last ame tha the Russia topic creator who used Арест Ника Леесон, which did ot seem to match ay relevat documets. Accordig to the summary results for Russia mooligual, at least oe ru achieved 1.00 precisio for this topic; it would be most iterestig to see how they modified the topic to match to the three relevat documets. A cautioary ote must be made about the CLEF-2004 Russia topic set. The total umber of relevat documets was oly 123 for the etire topic set, with a mea of 3.6 relevat documets per topic. Because of the ature of the retrieval results by query from the Russia collectio (22 of the 34 topics have 2 or fewer relevat documets) oe has to be careful about drawig coclusios from ay submitted results. 4 Summary ad Ackowledgmets For CLEF 2004, we experimeted with the CLEF Russia documet collectio with both mooligual Russia ad biligual to Russia from Eglish, Chiese ad Japaese topics I additio to query traslatio methodoy for biligual retrieval, we tried a fast documet traslatio method of the Russia collectio to Eglish ad performed Eglish-Eglish mooligual retrieval with the traslated topics from Chiese ad Eglish to Japaese. Chiese Russia ad Japaese Russia biligual performace results were sigificatly worse tha query traslatio from Eglish to Russia. We would like to thak Aitao Che for supplyig writig the istic regressio rakig software ad for performig the fast documet traslatio from Russia to Eglish. 5 Refereces [1] A. Che, W. Cooper ad F. Gey. Full text retrieval based o probabilistic equatios with coefficiets fitted by istic regressio. I: D.K. Harma (Ed.), The Secod Text Retrieval Coferece (TREC-2), pages 57-66, March 1994 [2] F. Gey ad K. Carl, Geotemporal Queryig of Multiligual Documets, Proceedigs of the Workshop o Geographic Iformatio Retrieval, available at: [3] V. Petras, N. Perelma ad F. Gey. UC Berkeley at CLEF-2003 Russia Laguage Experimets ad Domai-Specific Retrieval. To appear i: Proceedigs of the CLEF 2003 Workshop, Spriger Computer Sciece Series. [4] A. Che ad F. Gey. Multiligual Iformatio Retrieval Usig Machie Traslatio, Relevace Feedback, ad Decompoudig, Iformatio Retrieval Joural: Special Issue o CLEF, V7 No 1-2, pp , Ja-Apr 2004

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

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

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

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

A Transitive Model for Extracting Translation Equivalents of Web Queries through Anchor Text Mining 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

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

Copyright 1982, by the author(s). All rights reserved.

Copyright 1982, by the author(s). All rights reserved. Copyright 1982, by the author(s). All rights reserved. Permissio to make digital or hard copies of all or part of this work for persoal or classroom use is grated without fee provided that copies are ot

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Math Section 2.2 Polynomial Functions

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

More information

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

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

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

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

More information

The potential of QATD: Question Answering by Tree Distance

The potential of QATD: Question Answering by Tree Distance The potetial of QATD: Questio Aswerig by Tree Distace Marti Emms Dept. of Computer Sciece, Triity College, Dubli, Irelad b whole tree matchig dist=3.0 b c b a b b a a a a a Pla tree distace tree distace

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

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

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

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

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

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

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

More information

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/

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

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

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

More information

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

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

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

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

why study sorting? Sorting is a classic subject in computer science. There are three reasons for studying sorting algorithms.

why study sorting? Sorting is a classic subject in computer science. There are three reasons for studying sorting algorithms. Chapter 5 Sortig IST311 - CIS65/506 Clevelad State Uiversity Prof. Victor Matos Adapted from: Itroductio to Java Programmig: Comprehesive Versio, Eighth Editio by Y. Daiel Liag why study sortig? Sortig

More information

Automatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL

Automatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig

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

CS 111: Program Design I Lecture 16: Module Review, Encodings, Lists

CS 111: Program Design I Lecture 16: Module Review, Encodings, Lists CS 111: Program Desig I Lecture 16: Module Review, Ecodigs, Lists Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago October 18, 2016 Last time Dot otatio ad methods Padas: user maual poit

More information

Term Ranking for Clustering Web Search Results

Term Ranking for Clustering Web Search Results Term Rakig for Clusterig Web Search Results Fatih Gelgi Departmet of Computer Sciece ad Egieerig Arizoa State Uiversity Tempe, AZ, 85287, USA fagelgi@asu.edu Hasa Davulcu Departmet of Computer Sciece ad

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

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

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria. Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

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

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

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

More information

Unsupervised Discretization Using Kernel Density Estimation

Unsupervised Discretization Using Kernel Density Estimation Usupervised Discretizatio Usig Kerel Desity Estimatio Maregle Biba, Floriaa Esposito, Stefao Ferilli, Nicola Di Mauro, Teresa M.A Basile Departmet of Computer Sciece, Uiversity of Bari Via Oraboa 4, 7025

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

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

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

More information

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

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

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

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

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

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

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

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

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

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

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

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

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

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

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

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

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

Counting II 3, 7 3, 2 3, 9 7, 2 7, 9 2, 9

Counting II 3, 7 3, 2 3, 9 7, 2 7, 9 2, 9 Coutig II Sometimes we will wat to choose objects from a set of objects, ad we wo t be iterested i orderig them For example, if you are leavig for vacatio ad you wat to pac your suitcase with three of

More information

CSE 2320 Notes 8: Sorting. (Last updated 10/3/18 7:16 PM) Idea: Take an unsorted (sub)array and partition into two subarrays such that.

CSE 2320 Notes 8: Sorting. (Last updated 10/3/18 7:16 PM) Idea: Take an unsorted (sub)array and partition into two subarrays such that. CSE Notes 8: Sortig (Last updated //8 7:6 PM) CLRS 7.-7., 9., 8.-8. 8.A. QUICKSORT Cocepts Idea: Take a usorted (sub)array ad partitio ito two subarrays such that p q r x y z x y y z Pivot Customarily,

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

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

Instant Message Retrieval GoGetIM. Michael Seltzer Faculty Advisor: Zachary Ives Abstract Istat Message Retrieval GoGetIM Michael Seltzer mseltzer@seas.upe.edu Faculty Advisor: Zachary Ives zives@cis.upe.edu May compaies ad idividuals have recetly developed a wide variety of software

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

A Comparative Study of Positive and Negative Factorials

A Comparative Study of Positive and Negative Factorials A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the

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

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

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

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

More information

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

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

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

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

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

The Impact of Feature Selection on Web Spam Detection

The Impact of Feature Selection on Web Spam Detection I.J. Itelliget Systems ad Applicatios, 2012, 9, 61-67 Published Olie August 2012 i MECS (http://www.mecs -press.org/) DOI: 10.5815/ijisa.2012.09.08 The Impact of Feature Selectio o Web Spam Detectio Jaber

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

TUTORIAL Create Playlist Helen Doron Course

TUTORIAL Create Playlist Helen Doron Course TUTORIAL Create Playlist Hele Doro Course TUTY Tutorial Create Playlist Hele Doro Course Writte by Serafii Giampiero (INV SRL) Revised by Raffaele Forgioe (INV SRL) Editio EN - 0 Jue 0-0, INV S.r.l. Cotact:

More information

Text-based Image Indexing and Retrieval using Formal Concept Analysis

Text-based Image Indexing and Retrieval using Formal Concept Analysis KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 2, NO. 3, JUNE 2008 50 Copyright c 2008 KSII Text-based Image Idexig ad Retrieval usig Formal Cocept Aalysis Imra Shafiq Ahmad, No-Member School

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

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

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

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

R(n) ^ 0.4. RBR.RBR CORI.RBR Ideal(0).RBR

R(n) ^ 0.4. RBR.RBR CORI.RBR Ideal(0).RBR Comparig the Performace of Database Selectio Algorithms James C. Frech 1, Alliso L. Powell 1, Jamie Calla 2, Charles L. Viles 3 Travis Emmitt 1, Kevi J. Prey 1,Yu Mou 2 1 Dept. of Computer Sciece Uiversity

More information

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

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

More information

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

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

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

Graphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)

Graphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU) Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total

More information

BEA WebLogic XML/Non-XML Translator. Samples Guide

BEA WebLogic XML/Non-XML Translator. Samples Guide BEA WebLogic XML/No-XML Traslator Samples Guide BEA WebLobic XML/No-XML Traslator Samples Guide 1.0.1 Documet Editio 1.1 March 2001 Copyright Copyright 2000, 2001 BEA Systems, Ic. All Rights Reserved.

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete

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

CS 111: Program Design I Lecture 19: Networks, the Web, and getting text from the Web in Python

CS 111: Program Design I Lecture 19: Networks, the Web, and getting text from the Web in Python CS 111: Program Desig I Lecture 19: Networks, the Web, ad gettig text from the Web i Pytho Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago April 3, 2018 Goals Lear about Iteret Lear about

More information