TDT-2004: ADAPTIVE TOPIC TRACKING AT MARYLAND

Size: px
Start display at page:

Download "TDT-2004: ADAPTIVE TOPIC TRACKING AT MARYLAND"

Transcription

1 TDT-2004: ADAPTIVE TOPIC TRACKING AT MARYLAND Tamer Elsayed, Douglas W. Oard, Davd Doerma Isttute for Advaced r Studes Uversty of Marylad, College Park, MD Cotact author: telsayed@cs.umd.edu Gary Kuh Natoal Securty Agecy 9800 Savage Road, Sute 6514 Fort Meade, MD ABSTRACT A topc trackg system that combes elemets from vector space ad laguage modelg frameworks to compute documet scores s descrbed. The model s used for both the tradtoal TDT topc trackg evaluato desg ad the ew supervsed adaptve topc trackg evaluato. Results dcate that supervsed adaptato ad score ormalzato should be more closely coupled, ad that curret techques for detecto error trade aalyss may be of lmted utlty whe supervsed adaptato s performed. 1. INTRODUCTION The adaptve topc trackg task at TDT-2004 ers a useful evaluato framework for a project that we have recetly tated whch ole learg of user eeds wll be a mportat compoet. Our goals for partcpato TDT-2004 therefore focused o frastructure buldg; specfcy: (1 to tegrate our basele rakg fucto to a adaptve topc trackg system, ad (2 to explore the desg of evaluato measures that are sutable to our ultmate tasks. Tme costrats precluded parameter tug usg the TDT-4 collecto, so the results reported below should be cosdered prelmary. We submtted oe o-adaptve topc trackg ru for the requred codto (oe o-topc trag. At the tme we submtted our o-adaptve ru, score ormalzato was ot yet corporated to our system. As we show below, ths adversely affected both our Detecto Error Trade (DET curves ad the resultg mmum detecto error cost. Our actual detecto error cost s below the computed mmum cost pot o the DET curve because a mplemetato lmtato at the tme of submsso resulted a hard decso of NO for a few topcs for whch the trag epoch was very ear the begg of the TDT-5 collecto. Ths s the frst year whch adaptve topc trackg has bee cluded the Topc Detecto ad Trackg (TDT evaluatos. We submtted two rus, oe wth sgle-pass score ormalzato, ad oe whch score ormalzato was dsabled (for cotrast wth our o-adaptve ru. Both used oly a sgle o-topc trag ; topcs wth early trag epochs were hadled approprately these rus. Adaptato reduced the actual detecto error cost for the uormalzed codto from 0.65 to Sgle-pass score ormalzato (wth z-scores computed from the tal o-topc trag creased the actual detecto error cost from 0.24 to 0.38, suggestg a eed for reormalzato each tme the topc represetato s adjusted. I pror topc trackg evaluatos, we foud the DET curves to be useful because our terests focused more o score computato tha threshold selecto [1,2]. Adaptve topc trackg troduces a atural depedece o threshold selecto, ad that depedece does ot seem to be reflected well by the preset way whch DET curves are costructed. We dscuss ths ssue greater detal below. The remader of ths paper s orgazed as follows. I the ext secto, we descrbe the score computato fucto that was used for three submtted rus ad the mplemetato detals for each ru. Secto 3 the presets our cal results ad some tal post-hoc aalyss, cludg dscussos of score ormalzato ad DET curve terpretato for adaptve topc trackg. Fy, we coclude wth a few remarks about future work. 2. MODELING TOPIC TRACKING I ths secto we dscuss the desg of our trackg systems. We start wth the laguage model Secto 2.1 followed by a overvew of the system compoets Secto The Laguage Model The "-gram logodds" laguage model s a term frequecy model, cosstg of a lexcographcy ordered lst of character strgs ad log lkelhood ratos. The strgs the lst are exactly characters log, hece the ame -gram, where the legth s a model parameter. These strgs occurred the o-topc ad (assumed -topc trag stores for the topc beg tracked, T, ad they may overlap. Ay -gram begg wth a character code value less tha or equal to that of a ASCII space s ot cluded the model. Other model parameters are the mmum umber of occurreces of each N-gram, separately for the o-topc trag set

2 (MCout o, the (assumed -topc trag set (MCout, ad over (MCout, -grams that do ot meet these mmum couts are excluded from the model. log odds(, T log o orm orm (9 The model s traed o two sets of stores. Oe set T o cotas o-topc stores, ad the other set T cotas (assumed -topc stores. I each set, the umber of occurreces (term frequecy of each -gram s couted. Those -grams that meet the preset mmum couts are cluded the model. The relatve frequecy of each -gram s computed for the o-topc, the -topc, ad the over sets: o tf (, T j T o j T o tf ( j, T tf (, T j T tf ( j, T o tf (, T tf ( j, T where tf(,x s the term frequecy of the set X. A weght, λ, s computed for each N-gram the model, based o ts over cout: (1 (2 (3 2 λ 1 (4. (, 1+ k tf T e The expermeter chooses k ths equato. As k s creased from 0, λ reaches 0.5 at er ad er values of the over cout. λ tells us how much weght to gve to the potety very (ad therefore less relable class-depedet relatve frequecy for -gram, ( o, ad ad the potety very large (ad therefore more relable over relatve frequecy for -gram,, the followg covex combatos T o ad T, whch defe the oothed "lkelhood" of -gram both of the trag sets. Note that these values eed to be ormalzed after beg oothed. o λ (1 ( To + λ p T (5 p λ + (1 λ (6 ( o orm orm j T o j T j j o Fy, the "logodds" or log lkelhood rato for each -gram s computed from the class-depedet lkelhoods: o (7 (8 The score of S for topc T was the computed as follows: tf _ score(, S L 1.5 L s S S avg tf (, S + tf (, S (10 1 score ( S, T log odds(, T * tf _ score(, S (11 where s a -gram occurred S, S s the umber of dfferet -grams S, L S s the total umber of -grams S, ad L avg s the average legth of stores see so far ( both trag ad testg sets. I a earler verso of ths model, we used the raw tf value; for our TDT-2004 expermets we replaced that wth the Okap BM25 term frequecy compoet equato (10 [3] System Desg Buldg topc model Fgure 1: System overvew. As llustrated Fgure 1, the core system cossts of three ma modules: buldg the topc model usg the techque descrbed Secto 2.1, computg the factors that wll be used the cotext of cross-topc ad cross-source score ormalzato, ad fy trackg the o-topc stores the comg data stream. Buldg the Topc Model Sample -topc stores o-topc term -topc term Computg ormalzato factors relatve Fgure 2: Buldg the topc model. Topc trackg logodds A two-sded trag set s eeded to buld our model for each topc. The requred codto provdes oe o-topc trag ad o cofrmed -topc stores. We assumed that stores that substaty predate the o-topc trag wll be -topc. To mmze the possblty of falsely selectg a was actuy o-topc, we formed a trag epoch from the begg of the TDT-5 corpus to the kow o-topc ad the

3 radomly sampled N stores (f avalable from the frst 80% of that trag epoch 1. A cose larty measure was the computed betwee each of the N stores ad the oe o-topc trag. The top half of the most lar stores costtuted the -topc trag set for that topc. Ths procedure was desged to detfy -topc stores that were farly lar to the oe o-topc the way whch they used terms. The logodds value for each term s the computed as descrbed above. The whole process s depcted Fgure 2. No-adaptve Topc Trackg Testg set ew term score Pre-computed logodds Fgure 3: The o-adaptve trackg approach. The approach we adopted for the o-adaptve trackg task ply treats each depedetly ad does ot take the tmg attrbutes to accout. I other words, oce the topc model has bee traed as descrbed above, each the comg stream s scored wth respect to the tal model (represeted by the pre-computed logodds as show Fgure 3. Ay gve would therefore receve the same score regardless of ts order the stream. A hard (yes-o decso for each was made usg a statc threshold Th Track. Because the o-adaptve system dd ot perform ay usupervsed updates to the topc model, the computed score for each does ot deped o the specfc value of Th Track. Supervsed Adaptato for Topc Trackg Make hard decso Th Track The ew (supervsed adaptve trackg task s lar to the o-adaptve task, except that the true state (o-topc or -topc of a S wth respect to the curret topc becomes kow to the system mmedately f the system makes a hard decso that the s o-topc. Ths s teded to ulate a teractve applcato whch the user provdes feedback for stores that the system elects to dsplay. We adopted a straghtforward adaptato approach (llustrated Fgure 4 whch the ew formato was leveraged to ehace the curret topc model. A judged to be o-topc was added to the o-topc trag set by mergg ts -gram couts wth the curret couts the topc model ad the re-computg the 1 I some cases, ths resulted fewer tha N stores the trag epoch. For our adaptve rus, we added the etre TDT-4 corpus to the trag epoch order to avod that problem. relatve frequeces ad the logodds values for each term. A judged to be -topc was hadled larly; sce our tal model was bult usg assumed -topc stores (as descrbed above, we removed oe of the assumed -topc stores each tme a ewly judged -topc became avalable ad aga retraed the logodds. I ether case, the modfed model would be used utl the ext tme the system elected to declare a o-topc (at whch tme a ew judgmet would become avalable. We aga used a statc threshold, Th Track, to make these hard decsos for each. Testg set ew Fgure 4: The adaptve trackg approach. Computg Normalzato Factors I our secod adaptve trackg ru, we augmeted our supervsed topc trackg model by corporatg score ormalzato. I order to get comparable scores across topcs, laguages ad ews sources, we adopted a varat of the z-score ormalzato method troduced [4]. The method assumes that the true scores of -topc stores would follow a commo Gaussa dstrbuto regardless of codto; therefore, a score ca be ormalzed gve estmates for the mea ad stadard devato of -topc stores. We assumed for ths purpose that most TDT-4 stores would be topc for ay TDT-5 topcs. For each ews source that exsted both TDT-4 ad TDT-5, we sampled N orm stores uformly dstrbuted across data fles for that source ad computed scores for each usg each topc model separately; that resulted tal estmates of µ ad σ for each topc. I order to guard agast the possblty that a few o-topc stores mght exst the TDT-4 corpus, we the removed ay sampled wth a score greater tha µ by more tha Th Norm, * σ ad the recomputed term fal estmates for µ ad σ score Normalzato factors Logodds Relevace judgmets Th Track Make hard decso f yes Add to topc model. Those estmates (we c them ormalzato factors are the used to ormalze the raw scores as descrbed below. For those cases whch TDT-5 cotaed a source that was ot preset TDT-4, we averaged the ormalzato factors for TDT-4 sources the same source laguage ad used those values as a estmate for what we would have obtaed had trag data for the ew source bee avalable. Fy, the ormalzed score for each was computed as follows:

4 score orm ( S, T score ( S, T µ σ ( src ( S, T ( src ( S, T (12 where src(s s the source of the S, ad score(s,t s computed as the o-adaptve approach. Note that the ormalzato factors were computed oly oce before the trackg phase ad used throughout the testg process. Implemetato ad Parameters Settgs Cotext Parameter Value Parameter Value N 6 K 0.37 Model MCout o 0 MCout 0 MCout 1 Normalzato Th orm 5 N orm 2000 Trag N 100 Table 1. System parameters Our systems were mplemeted Java2. We dd t make use of ay prevously developed formato retreval system compoets, so the frastructure has bee bult from scratch. Table 1 summarzes the specfc values of our systems parameters. All these values were statcy used submtted rus. 3. RESULTS Ths year, we submtted 3 systems, oe for the o-adaptve trackg task, ad two for the adaptve supervsed task. Here we dscuss the performace of these systems. Fgure 5. DET curve for the o-adaptve system. abormal result. Our system bult a statc model traed wth oly oe o-topc, so we beleve that that uque mght ot be suffcet for our approach to buld a relable topc model. Had more tme bee avalable, we expect that a parameter tug usg the TDT-4 collecto, would have yelded a stroger basele. Score ormalzato s also expected to have a major effect. 3.2 Supervsed Adaptato Systems Actual M DET Task System Th Track Cost Cost No-adaptve UMD UMD Adaptve UMD Table2. Actual ad mmum DET costs for the submtted rus 3.1 No-adaptve System At the tme of the o-adaptve task submsso, the ormalzato phase was ot read so the cost show Table 2 ad the DET curve llustrated Fgure 5 are acheved the absece of score ormalzato. The real cost s less tha the computed cost because of the hard No decso take for 4 topcs whose uque o-topc was located at the very begg of the TDT-5 corpus. Ths problem s solved the adaptve rus. Surprsgly, our actual cost was less tha the mmum DET cost. The reaso s that our system provded o score for the stores whose legth s oe word of less tha 6 characters. Ufortuately, the evaluato set cludes more tha a hudred stores (o average per topc. Despte beg judged -topc, those stores caused that Fgure 6. DET curve for the o-ormalzed adaptve system. Fgure 6 llustrates the performace of o-ormalzed supervsed adaptve system. The actual cost dropped to 0.24 as show Table 2, about a 63% mprovemet over the o-adaptve cost. We attrbute ths to the ablty of our system to lear evely from both o-topc ad -topc stores. Ths result demostrated the stregth of our adaptato techque regardless of score

5 ormalzato. reteto behavor; we therefore pla to explore possbltes for erchg the collecto ways that may also be of terest to other TDT partcpats. Before we commt to dog so, however, we wll eed to better uderstad the effect of complete judgmets o the utlty of the TDT-5 collecto as a bass for system comparso. The large umber of topcs the TDT-5 collecto makes t somewhat better suted to evaluato desgs that requre extedg the trag epoch (because some topcs wth few relevat documets would be lost, but f there are cocers about the stablty of effectveess measures we mght ultmately choose to use the more extesvely aotated TDT-4 collecto stead. We are, therefore, also partcularly terested characterzg the effect of complete judgmets o the stablty of both the TDT effectveess measures ad other measures that mght er a lar degree of sght (e.g., bary preferece [5]. We look forward to meetg Gathersburg to dscuss these ssues! ACKNOWLEDGMENTS Fgure 7. DET curve for the ormalzed adaptve system. The DET curve show Fgure 7 llustrates the performace of our adaptve system that ormalzes the scores. We dd oly oe ormalzato pass, before startg the evaluato epoch. Uexpectedly, the performace cost creased about 37% wth respect to the o-ormalzed ru, but was stll mproved over the o-adaptve system (about a 50% cost drop. Three reasos could be behd that degradato. Frst, the ormalzato sample sze mght ot be large eough to obta good estmates of the -topc dstrbuto. Secod, scores resultg from our approach for -topc stores mght ot follow a Gaussa dstrbuto, falsfyg a basc assumpto the Z-score ormalzato techque. Fy, as the model chages, the pre-computed ormalzato factors become less ad less represetatve because they were computed gve a dfferet model represetato. We expect better performace to be acheved f we recompute these factors perodcy. The scores reported here are threshold depedet, ply because the topc model chages dyamcy 2. If we use aother threshold, we expect to have dfferet scores, hece probably dfferet DET curve ad mmum cost. Ths makes the usefuless of DET curve the evaluato of adaptve systems doubtful. 4. CONCLUSION AND FUTURE WORK Our partcpato TDT-2004 has yelded both a deeper uderstadg of evaluato ssues for adaptve topc trackg ad a substatal part of the evaluato frastructure that we pla to leverage as we explore the desg of adaptve topc trackg systems. We are partcularly terested the effect of alteratve tal codtos (e.g., explct queres ad/or substatal umbers of marked o-topc ad -topc documets ad modelg mperfect evdece of user preferece (e.g., readg ad/or The authors are grateful to Jo Fscus for hs exceptoal efforts ad fte patece. Ths work has bee supported part by DoD cooperatve agreemet N REFERENCES 1. Levow, G.-A. ad Oard, D.W. Sgal Boostg for Traslgual Topc Trackg, Alla, J., ed.., Topc Detecto ad Trackg: Evet-Based Iformato Orgazato, Kluwer Academc Publshers, Bosto, pp , He, D., Park, H.R., Murray, G.C., Subot, M., ad Oard, D.W., TDT-2002 Topc Trackg at Marylad: Frst Expermets wth the Lemur Toolkt, TDT-2002 Workg Notes, Aval from Robertso, S.E., Walker, S., Joes, S., Hacock-Beauleu, M.M. ad Gatford, M., Okap at TREC-3, Proceedgs of TREC-3, Gathersburg, MD, pp , Leek, T., Schwartz, R., ad Ssta, S., Probablstc Approaches to Topc Detecto ad Trackg, I James Alle, edtor, Topc Detecto ad Trackg: Evet-based Iformato Orgazato, chapter 4, pp Kluwer Academc Publshers, Buckley, C. ad Voorhees, E.M., Retreval Evaluato wth Icomplete Iformato, Proceedgs of SIGIR-2004, Sheffeld, UK, pp , Assumg the topc model has bee chaged betwee.

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning CS 7 Foudatos of AI Lecture Mache learg Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Mache Learg The feld of mache learg studes the desg of computer programs (agets) capable of learg from past eperece

More information

Point Estimation-III: General Methods for Obtaining Estimators

Point Estimation-III: General Methods for Obtaining Estimators Pot Estmato-III: Geeral Methods for Obtag Estmators RECAP 0.-0.6 Data: Radom Sample from a Populato of terest o Real valued measuremets: o Assumpto (Hopefully Reasoable) o Model: Specfed Probablty Dstrbuto

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications /03/ Mache Learg: Algorthms ad Applcatos Florao Z Free Uversty of Boze-Bolzao Faculty of Computer Scece Academc Year 0-0 Lecture 3: th March 0 Naïve Bayes classfer ( Problem defto A trag set X, where each

More information

Face Recognition using Supervised & Unsupervised Techniques

Face Recognition using Supervised & Unsupervised Techniques Natoal Uversty of Sgapore EE5907-Patter recogto-2 NAIONAL UNIVERSIY OF SINGAPORE EE5907 Patter Recogto Project Part-2 Face Recogto usg Supervsed & Usupervsed echques SUBMIED BY: SUDEN NAME: harapa Reddy

More information

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1 -D matrx method We ca expad the smple plae-wave scatterg for -D examples that we ve see to a more versatle matrx approach that ca be used to hadle may terestg -D problems. The basc dea s that we ca break

More information

APR 1965 Aggregation Methodology

APR 1965 Aggregation Methodology Sa Joaqu Valley Ar Polluto Cotrol Dstrct APR 1965 Aggregato Methodology Approved By: Sged Date: March 3, 2016 Araud Marjollet, Drector of Permt Servces Backgroud Health rsk modelg ad the collecto of emssos

More information

ITEM ToolKit Technical Support Notes

ITEM ToolKit Technical Support Notes ITEM ToolKt Notes Fault Tree Mathematcs Revew, Ic. 2875 Mchelle Drve Sute 300 Irve, CA 92606 Phoe: +1.240.297.4442 Fax: +1.240.297.4429 http://www.itemsoft.com Page 1 of 15 6/1/2016 Copyrght, Ic., All

More information

For all questions, answer choice E) NOTA" means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA

For all questions, answer choice E) NOTA means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA For all questos, aswer choce " meas oe of the above aswers s correct.. What s the sum of the frst 000 postve tegers? A) 50,500 B) 500,000 C) 500,500 D),00,000. What s the sum of the tegers betwee 00 ad

More information

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon Curve represetato Copyrght@, YZU Optmal Desg Laboratory. All rghts reserved. Last updated: Yeh-Lag Hsu (--). Note: Ths s the course materal for ME55 Geometrc modelg ad computer graphcs, Yua Ze Uversty.

More information

Clustering documents with vector space model using n-grams

Clustering documents with vector space model using n-grams Clusterg documets wth vector space model usg -grams Klas Skogmar, d97ksk@efd.lth.se Joha Olsso, d97jo@efd.lth.se Lud Isttute of Techology Supervsed by: Perre Nugues, Perre.Nugues@cs.lth.se Abstract Ths

More information

Descriptive Statistics: Measures of Center

Descriptive Statistics: Measures of Center Secto 2.3 Descrptve Statstcs: Measures of Ceter Frequec dstrbutos are helpful provdg formato about categorcal data, but wth umercal data we ma wat more formato. Statstc: s a umercal measure calculated

More information

Blind Steganalysis for Digital Images using Support Vector Machine Method

Blind Steganalysis for Digital Images using Support Vector Machine Method 06 Iteratoal Symposum o Electrocs ad Smart Devces (ISESD) November 9-30, 06 Bld Stegaalyss for Dgtal Images usg Support Vector Mache Method Marcelus Hery Meor School of Electrcal Egeerg ad Iformatcs Badug

More information

Area and Power Efficient Modulo 2^n+1 Multiplier

Area and Power Efficient Modulo 2^n+1 Multiplier Iteratoal Joural of Moder Egeerg Research (IJMER) www.jmer.com Vol.3, Issue.3, May-Jue. 013 pp-137-1376 ISSN: 49-6645 Area ad Power Effcet Modulo ^+1 Multpler K. Ptambar Patra, 1 Saket Shrvastava, Sehlata

More information

Journal of Chemical and Pharmaceutical Research, 2015, 7(3): Research Article

Journal of Chemical and Pharmaceutical Research, 2015, 7(3): Research Article Avalable ole www.ocpr.com Joural of Chemcal ad Pharmaceutcal Research, 2015, 73):476-481 Research Artcle ISSN : 0975-7384 CODENUSA) : JCPRC5 Research o cocept smlarty calculato method based o sematc grd

More information

Identifying Chemical Names in Biomedical Text: An Investigation of the Substring Co-occurrence Based Approaches

Identifying Chemical Names in Biomedical Text: An Investigation of the Substring Co-occurrence Based Approaches Idetfyg Chemcal Names Bomedcal Text: A Ivestgato of the Substrg Co-occurrece Based Approaches Alexader Vasserma Departmet of Computer ad Iformato Scece Uversty of Pesylvaa Phladelpha, PA 94 avasserm@seas.upe.edu

More information

Machine Learning. CS 2750 Machine Learning. Administration. Lecture 1. Milos Hauskrecht 5329 Sennott Square, x4-8845

Machine Learning. CS 2750 Machine Learning. Administration. Lecture 1. Milos Hauskrecht 5329 Sennott Square, x4-8845 CS 75 Mache Learg Lecture Mache Learg Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square, 5 people.cs.ptt.edu/~mlos/courses/cs75/ Admstrato Istructor: Prof. Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square,

More information

New Fuzzy Integral for the Unit Maneuver in RTS Game

New Fuzzy Integral for the Unit Maneuver in RTS Game New Fuzzy Itegral for the Ut Maeuver RTS Game Peter Hu Fug Ng, YgJe L, ad Smo Ch Keug Shu Departmet of Computg, The Hog Kog Polytechc Uversty, Hog Kog {cshfg,csyjl,csckshu}@comp.polyu.edu.hk Abstract.

More information

COMSC 2613 Summer 2000

COMSC 2613 Summer 2000 Programmg II Fal Exam COMSC 63 Summer Istructos: Name:. Prt your ame the space provded Studet Id:. Prt your studet detfer the space Secto: provded. Date: 3. Prt the secto umber of the secto whch you are

More information

Unsupervised Discretization Using Kernel Density Estimation

Unsupervised Discretization Using Kernel Density Estimation Usupervsed Dscretzato Usg Kerel Desty Estmato Maregle Bba, Floraa Esposto, Stefao Ferll, Ncola D Mauro, Teresa M.A Basle Departmet of Computer Scece, Uversty of Bar Va Oraboa 4, 7025 Bar, Italy {bba,esposto,ferll,dm,basle}@d.uba.t

More information

Optimal Allocation of Complex Equipment System Maintainability

Optimal Allocation of Complex Equipment System Maintainability Optmal Allocato of Complex Equpmet System ataablty X Re Graduate School, Natoal Defese Uversty, Bejg, 100091, Cha edcal Protecto Laboratory, Naval edcal Research Isttute, Shagha, 200433, Cha Emal:rexs841013@163.com

More information

ANALYSIS OF VARIANCE WITH PARETO DATA

ANALYSIS OF VARIANCE WITH PARETO DATA Proceedgs of the th Aual Coferece of Asa Pacfc Decso Sceces Isttute Hog Kog, Jue -8, 006, pp. 599-609. ANALYSIS OF VARIANCE WITH PARETO DATA Lakhaa Watthaacheewakul Departmet of Mathematcs ad Statstcs,

More information

Chapter 3 Descriptive Statistics Numerical Summaries

Chapter 3 Descriptive Statistics Numerical Summaries Secto 3.1 Chapter 3 Descrptve Statstcs umercal Summares Measures of Cetral Tedecy 1. Mea (Also called the Arthmetc Mea) The mea of a data set s the sum of the observatos dvded by the umber of observatos.

More information

A Comparison of Univariate Smoothing Models: Application to Heart Rate Data Marcus Beal, Member, IEEE

A Comparison of Univariate Smoothing Models: Application to Heart Rate Data Marcus Beal, Member, IEEE A Comparso of Uvarate Smoothg Models: Applcato to Heart Rate Data Marcus Beal, Member, IEEE E-mal: bealm@pdx.edu Abstract There are a umber of uvarate smoothg models that ca be appled to a varety of olear

More information

Interactive Change Detection Using High Resolution Remote Sensing Images Based on Active Learning with Gaussian Processes

Interactive Change Detection Using High Resolution Remote Sensing Images Based on Active Learning with Gaussian Processes Iteractve Chage Detecto Usg Hgh Resoluto Remote Sesg Images Based o Actve Learg wth Gaussa Processes Hu Ru a, Hua Yu a,, Pgpg Huag b, We Yag a a School of Electroc Iformato, Wuha Uversty, 43007 Wuha, Cha

More information

Text Categorization Based on a Similarity Approach

Text Categorization Based on a Similarity Approach Text Categorzato Based o a Smlarty Approach Cha Yag Ju We School of Computer Scece & Egeerg, Uversty of Electroc Scece ad Techology of Cha, Chegdu 60054, P.R. Cha Abstract Text classfcato ca effcetly ehace

More information

NEURO FUZZY MODELING OF CONTROL SYSTEMS

NEURO FUZZY MODELING OF CONTROL SYSTEMS NEURO FUZZY MODELING OF CONTROL SYSTEMS Efré Gorrosteta, Carlos Pedraza Cetro de Igeería y Desarrollo Idustral CIDESI, Av Pe de La Cuesta 70. Des. Sa Pablo. Querétaro, Qro, Méxco gorrosteta@teso.mx pedraza@cdes.mx

More information

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30.

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30. Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. COS 31 Dscrete Math 1 Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. Nobody seems to care. Chage oce hours? Tuesday, 8 PM

More information

A modified Logic Scoring Preference method for dynamic Web services evaluation and selection

A modified Logic Scoring Preference method for dynamic Web services evaluation and selection A modfed Logc Scorg Preferece method for dyamc Web servces evaluato ad selecto Hog Qg Yu ad Herá Mola 2 Departmet of Computer Scece, Uversty of Lecester, UK hqy@mcs.le.ac.uk 2 Departmet of Iformatcs, School

More information

ChEn 475 Statistical Analysis of Regression Lesson 1. The Need for Statistical Analysis of Regression

ChEn 475 Statistical Analysis of Regression Lesson 1. The Need for Statistical Analysis of Regression Statstcal-Regresso_hadout.xmcd Statstcal Aalss of Regresso ChE 475 Statstcal Aalss of Regresso Lesso. The Need for Statstcal Aalss of Regresso What do ou do wth dvdual expermetal data pots? How are the

More information

A Genetic K-means Clustering Algorithm Applied to Gene Expression Data

A Genetic K-means Clustering Algorithm Applied to Gene Expression Data A Geetc K-meas Clusterg Algorthm Appled to Gee Expresso Data Fag-Xag Wu, W. J. Zhag, ad Athoy J. Kusal Dvso of Bomedcal Egeerg, Uversty of Sasatchewa, Sasatoo, S S7N 5A9, CANADA faw34@mal.usas.ca, zhagc@egr.usas.ca

More information

Software reliability is defined as the probability of failure

Software reliability is defined as the probability of failure Evolutoary Regresso Predcto for Software Cumulatve Falure Modelg: a comparatve study M. Beaddy, M. Wakrm & S. Aljahdal 2 : Dept. of Math. & Ifo. Equpe MMS, Ib Zohr Uversty Morocco. beaddym@yahoo.fr 2:

More information

Process Quality Evaluation based on Maximum Entropy Principle. Yuhong Wang, Chuanliang Zhang, Wei Dai a and Yu Zhao

Process Quality Evaluation based on Maximum Entropy Principle. Yuhong Wang, Chuanliang Zhang, Wei Dai a and Yu Zhao Appled Mechacs ad Materals Submtted: 204-08-26 ISSN: 662-7482, Vols. 668-669, pp 625-628 Accepted: 204-09-02 do:0.4028/www.scetfc.et/amm.668-669.625 Ole: 204-0-08 204 Tras Tech Publcatos, Swtzerlad Process

More information

Software Clustering Techniques and the Use of Combined Algorithm

Software Clustering Techniques and the Use of Combined Algorithm Software Clusterg Techques ad the Use of Combed Algorthm M. Saeed, O. Maqbool, H.A. Babr, S.Z. Hassa, S.M. Sarwar Computer Scece Departmet Lahore Uversty of Maagemet Sceces DHA Lahore, Paksta oaza@lums.edu.pk

More information

Using Linear-threshold Algorithms to Combine Multi-class Sub-experts

Using Linear-threshold Algorithms to Combine Multi-class Sub-experts Usg Lear-threshold Algorthms to Combe Mult-class Sub-experts Chrs Mesterharm MESTERHA@CS.RUTGERS.EDU Rutgers Computer Scece Departmet 110 Frelghuyse Road Pscataway, NJ 08854 USA Abstract We preset a ew

More information

Transistor/Gate Sizing Optimization

Transistor/Gate Sizing Optimization Trasstor/Gate Szg Optmzato Gve: Logc etwork wth or wthout cell lbrary Fd: Optmal sze for each trasstor/gate to mmze area or power, both uder delay costrat Statc szg: based o tmg aalyss ad cosder all paths

More information

A hybrid method using FAHP and TOPSIS for project selection Xuan Lia, Jiang Jiangb and Su Deng c

A hybrid method using FAHP and TOPSIS for project selection Xuan Lia, Jiang Jiangb and Su Deng c 5th Iteratoal Coferece o Computer Sceces ad Automato Egeerg (ICCSAE 205) A hybrd method usg FAHP ad TOPSIS for project selecto Xua La, Jag Jagb ad Su Deg c College of Iformato System ad Maagemet, Natoal

More information

Fitting. We ve learned how to detect edges, corners, blobs. Now what? We would like to form a. compact representation of

Fitting. We ve learned how to detect edges, corners, blobs. Now what? We would like to form a. compact representation of Fttg Fttg We ve leared how to detect edges, corers, blobs. Now what? We would lke to form a hgher-level, h l more compact represetato of the features the mage b groupg multple features accordg to a smple

More information

Active Bayesian Learning For Mixture Models

Active Bayesian Learning For Mixture Models Actve Bayesa Learg For Mxture Models Ia Davdso Slco Graphcs 300 Crttede L, MS 876 Mouta Vew, CA 94587 pd@hotmal.com Abstract Tradtoally, Bayesa ductve learg volves fdg the most probable model from the

More information

Weighting Cache Replace Algorithm for Storage System

Weighting Cache Replace Algorithm for Storage System Weghtg Cache Replace Algorthm for Storage System Yhu Luo 2 Chagsheg Xe 2 Chegfeg Zhag 2 School of mathematcs ad Computer Scece, Hube Uversty, Wuha 430062, P.R. Cha 2 Natoal Storage System Laboratory, School

More information

Enumerating XML Data for Dynamic Updating

Enumerating XML Data for Dynamic Updating Eumeratg XML Data for Dyamc Updatg Lau Ho Kt ad Vcet Ng Departmet of Computg, The Hog Kog Polytechc Uversty, Hug Hom, Kowloo, Hog Kog cstyg@comp.polyu.edu.h Abstract I ths paper, a ew mappg model, called

More information

International Mathematical Forum, 1, 2006, no. 31, ON JONES POLYNOMIALS OF GRAPHS OF TORUS KNOTS K (2, q ) Tamer UGUR, Abdullah KOPUZLU

International Mathematical Forum, 1, 2006, no. 31, ON JONES POLYNOMIALS OF GRAPHS OF TORUS KNOTS K (2, q ) Tamer UGUR, Abdullah KOPUZLU Iteratoal Mathematcal Forum,, 6, o., 57-54 ON JONES POLYNOMIALS OF RAPHS OF TORUS KNOTS K (, q ) Tamer UUR, Abdullah KOPUZLU Atatürk Uverst Scece Facult Dept. of. Math. 54 Erzurum, Turkey tugur@atau.edu.tr

More information

PERSPECTIVES OF THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS

PERSPECTIVES OF THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS PERSPECTIVES OF THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS Lal Besela Sokhum State Uversty, Poltkovskaa str., Tbls, Georga Abstract Moder cryptosystems aalyss s a complex task, the soluto of whch s

More information

Constructive Semi-Supervised Classification Algorithm and Its Implement in Data Mining

Constructive Semi-Supervised Classification Algorithm and Its Implement in Data Mining Costructve Sem-Supervsed Classfcato Algorthm ad Its Implemet Data Mg Arvd Sgh Chadel, Arua Twar, ad Naredra S. Chaudhar Departmet of Computer Egg. Shr GS Ist of Tech.& Sc. SGSITS, 3, Par Road, Idore (M.P.)

More information

Preventing Information Leakage in C Applications Using RBAC-Based Model

Preventing Information Leakage in C Applications Using RBAC-Based Model Proceedgs of the 5th WSEAS It. Cof. o Software Egeerg Parallel ad Dstrbuted Systems Madrd Spa February 5-7 2006 (pp69-73) Prevetg Iformato Leakage C Applcatos Usg RBAC-Based Model SHIH-CHIEN CHOU Departmet

More information

FEATURE SELECTION ON COMBINATIONS FOR EFFICIENT LEARNING FROM IMAGES. Rong Xiao, Lei Zhang, and Hong-Jiang Zhang

FEATURE SELECTION ON COMBINATIONS FOR EFFICIENT LEARNING FROM IMAGES. Rong Xiao, Lei Zhang, and Hong-Jiang Zhang FEATURE SELECTION ON COMBINATIONS FOR EFFICIENT LEARNING FROM IMAGES Rog Xao, Le Zhag, ad Hog-Jag Zhag Mcrosoft Research Asa, Bejg 100080, P.R. Cha {t-rxao, lezhag, hjzhag}@mcrosoft.com ABSTRACT Due to

More information

Performance Impact of Load Balancers on Server Farms

Performance Impact of Load Balancers on Server Farms erformace Impact of Load Balacers o Server Farms Ypg Dg BMC Software Server Farms have gaed popularty for provdg scalable ad relable computg / Web servces. A load balacer plays a key role ths archtecture,

More information

On a Sufficient and Necessary Condition for Graph Coloring

On a Sufficient and Necessary Condition for Graph Coloring Ope Joural of Dscrete Matheatcs, 04, 4, -5 Publshed Ole Jauary 04 (http://wwwscrporg/joural/ojd) http://dxdoorg/0436/ojd04400 O a Suffcet ad Necessary Codto for raph Colorg Maodog Ye Departet of Matheatcs,

More information

Differentiated Service of Streaming Media Playback Technology

Differentiated Service of Streaming Media Playback Technology Iteratoal Coferece o Advaced Iformato ad Commucato Techology for Educato (ICAICTE 2013) Dfferetated Servce of Streamg Meda Playback Techology CHENG Z-ao 1 MENG Bo 1 WANG Da-hua 1 ZHAO Yue 1 1 Iformatzato

More information

Mode Changes in Priority Pre-emptively Scheduled Systems. K. W. Tindell, A. Burns, A. J. Wellings

Mode Changes in Priority Pre-emptively Scheduled Systems. K. W. Tindell, A. Burns, A. J. Wellings ode hages rorty re-emptvely Scheduled Systems. W. dell, A. Burs, A.. Wellgs Departmet of omputer Scece, Uversty of York, Eglad Abstract may hard real tme systems the set of fuctos that a system s requred

More information

Vanishing Point Detection: Representation Analysis and New Approaches

Vanishing Point Detection: Representation Analysis and New Approaches Publshed the Proceedgs of the th Iteratoal Coferece o Image Aalyss ad Processg (ICIAP ). IEEE. Persoal use of ths materal s permtted. However, permsso to reprt/republsh ths materal for advertsg or promotoal

More information

Spatial Interpolation Using Neural Fuzzy Technique

Spatial Interpolation Using Neural Fuzzy Technique Wog, K.W., Gedeo, T., Fug, C.C. ad Wog, P.M. (00) Spatal terpolato usg eural fuzzy techque. I: Proceedgs of the 8th Iteratoal Coferece o Neural Iformato Processg (ICONIP), Shagha, Cha Spatal Iterpolato

More information

Statistical Techniques Employed in Atmospheric Sampling

Statistical Techniques Employed in Atmospheric Sampling Appedx A Statstcal Techques Employed Atmospherc Samplg A.1 Itroducto Proper use of statstcs ad statstcal techques s ecessary for assessg the qualty of ambet ar samplg data. For a comprehesve dscusso of

More information

Morphological Ending based Strategies of Unknown Word Estimation for Statistical POS Urdu Tagger

Morphological Ending based Strategies of Unknown Word Estimation for Statistical POS Urdu Tagger IJCSES Iteratoal Joural of Computer Sceces ad Egeerg Systems, Vol., No.3, July 2007 CSES Iteratoal c2007 ISSN 0973-4406 67 Morphologcal Edg based Strateges of Ukow Word Estmato for Statstcal POS Urdu Tagger

More information

A Double-Window-based Classification Algorithm for Concept Drifting Data Streams

A Double-Window-based Classification Algorithm for Concept Drifting Data Streams 00 IEEE Iteratoal Coferece o Graular Computg A Double-Wdow-based Classfcato Algorthm for Cocept Drftg Data Streams Qu Zhu, Xuegag Hu, Yuhog Zhag, Pepe L, Xdog Wu, School of Computer Scece ad Iformato Egeerg,

More information

Automated approach for the surface profile measurement of moving objects based on PSP

Automated approach for the surface profile measurement of moving objects based on PSP Uversty of Wollogog Research Ole Faculty of Egeerg ad Iformato Sceces - Papers: Part B Faculty of Egeerg ad Iformato Sceces 207 Automated approach for the surface profle measuremet of movg objects based

More information

Fuzzy ID3 Decision Tree Approach for Network Reliability Estimation

Fuzzy ID3 Decision Tree Approach for Network Reliability Estimation IJCSI Iteratoal Joural of Computer Scece Issues, Vol. 9, Issue 1, o 1, Jauary 2012 ISS (Ole): 1694-0814 www.ijcsi.org 446 Fuzzy ID3 Decso Tree Approach for etwor Relablty Estmato A. Ashaumar Sgh 1, Momtaz

More information

Object Segmentation based on Saliency Extraction and Bounding Box Jian Ma, Lei Huang, Bo Yin, Fengfu Yin

Object Segmentation based on Saliency Extraction and Bounding Box Jian Ma, Lei Huang, Bo Yin, Fengfu Yin Iteratoal Coferece o Lostcs Eeer, Maaemet ad Computer Scece (LEMCS 204) Object Semetato based o Salecy Extracto ad Boud Box Ja Ma, Le Hua, Bo Y, Fefu Y Ja Ma Collee of Evrometal Scece ad Eeer yff3@26.com

More information

A genetic procedure used to train RFB neural networks

A genetic procedure used to train RFB neural networks A geetc procedure used to tra RFB eural etworks Costat-Iula VIZITIU Commucatos ad Electroc Systems Departmet Mltary Techcal Academy George Cosbuc Aveue 8-83 5 th Dstrct Bucharest ROMANIA vc@mta.ro http://www.mta.ro

More information

MATHEMATICAL PROGRAMMING MODEL OF THE CRITICAL CHAIN METHOD

MATHEMATICAL PROGRAMMING MODEL OF THE CRITICAL CHAIN METHOD MATHEMATICAL PROGRAMMING MODEL OF THE CRITICAL CHAIN METHOD TOMÁŠ ŠUBRT, PAVLÍNA LANGROVÁ CUA, SLOVAKIA Abstract Curretly there s creasgly dcated that most of classcal project maagemet methods s ot sutable

More information

CLUSTERING ASSISTED FUNDAMENTAL MATRIX ESTIMATION

CLUSTERING ASSISTED FUNDAMENTAL MATRIX ESTIMATION CLUSERING ASSISED FUNDAMENAL MARIX ESIMAION Hao Wu ad Y Wa School of Iformato Scece ad Egeerg, Lazhou Uversty, Cha wuhao1195@163com, wayjs@163com ABSRAC I computer vso, the estmato of the fudametal matrx

More information

MINIMIZATION OF THE VALUE OF DAVIES-BOULDIN INDEX

MINIMIZATION OF THE VALUE OF DAVIES-BOULDIN INDEX MIIMIZATIO OF THE VALUE OF DAVIES-BOULDI IDEX ISMO ÄRÄIE ad PASI FRÄTI Departmet of Computer Scece, Uversty of Joesuu Box, FI-800 Joesuu, FILAD ABSTRACT We study the clusterg problem whe usg Daves-Bould

More information

Toward Undetected Operating System Fingerprinting

Toward Undetected Operating System Fingerprinting Toward Udetected Operatg System Fgerprtg Lloyd G. Greewald ad Tavars J. Thomas LGS Bell Labs Iovatos {lgreewald, tthomas}@lgsovatos.com Abstract Tools for actve remote operatg system fgerprtg geerate may

More information

2 General Regression Neural Network (GRNN)

2 General Regression Neural Network (GRNN) 4 Geeral Regresso Neural Network (GRNN) GRNN, as proposed b oald F. Specht [Specht 9] falls to the categor of probablstc eural etworks as dscussed Chapter oe. Ths eural etwork lke other probablstc eural

More information

LP: example of formulations

LP: example of formulations LP: eample of formulatos Three classcal decso problems OR: Trasportato problem Product-m problem Producto plag problem Operatos Research Massmo Paolucc DIBRIS Uversty of Geova Trasportato problem The decso

More information

A Disk-Based Join With Probabilistic Guarantees*

A Disk-Based Join With Probabilistic Guarantees* A Dsk-Based Jo Wth Probablstc Guaratees* Chrstopher Jermae, Al Dobra, Subramaa Arumugam, Shatau Josh, Abhjt Pol Computer ad Iformato Sceces ad Egeerg Departmet Uversty of Florda, Gaesvlle {cjerma, adobra,

More information

An Ensemble Multi-Label Feature Selection Algorithm Based on Information Entropy

An Ensemble Multi-Label Feature Selection Algorithm Based on Information Entropy The Iteratoal Arab Joural of Iformato Techology, Vol., No. 4, July 204 379 A Esemble Mult-Label Feature Selecto Algorthm Based o Iformato Etropy Shg L, Zheha Zhag, ad Jaq Dua School of Computer Scece,

More information

Some Interesting SAR Change Detection Studies

Some Interesting SAR Change Detection Studies Some Iterestg SAR Chage Detecto Studes Lesle M. ovak Scetfc Sstems Compa, Ic. 500 West Cummgs Park, Sute 3000 Wobur, MA 080 USA E-mal lovak@ssc.co ovakl@charter.et ABSTRACT Performace results of coheret

More information

AN IMPROVED TEXT CLASSIFICATION METHOD BASED ON GINI INDEX

AN IMPROVED TEXT CLASSIFICATION METHOD BASED ON GINI INDEX Joural of Theoretcal ad Appled Iformato Techology 30 th September 0. Vol. 43 No. 005-0 JATIT & LLS. All rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 AN IMPROVED TEXT CLASSIFICATION METHOD

More information

APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL

APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL Sergej Srota Haa Řezaková Abstract Bak s propesty models are beg developed for busess support. They should help to choose clets wth a hgher

More information

Region Matching by Optimal Fuzzy Dissimilarity

Region Matching by Optimal Fuzzy Dissimilarity Rego Matchg by Optmal Fuzzy Dssmlarty Zhaggu Zeg, Ala Fu ad Hog Ya School of Electrcal ad formato Egeerg The Uversty of Sydey Phoe: +6--935-6659 Fax: +6--935-3847 Emal: zzeg@ee.usyd.edu.au Abstract: Ths

More information

Web Page Clustering by Combining Dense Units

Web Page Clustering by Combining Dense Units Web Page Clusterg by Combg Dese Uts Morteza Haghr Chehregha, Hassa Abolhassa ad Mostafa Haghr Chehregha Departmet of CE, Sharf Uversty of Techology, Tehra, IRA {haghr, abolhassa}@ce.sharf.edu Departmet

More information

Estimating Feasibility Using Multiple Surrogates and ROC Curves

Estimating Feasibility Using Multiple Surrogates and ROC Curves Estmatg Feasblty Usg Multple Surrogates ad ROC Curves Arba Chaudhur * Uversty of Florda, Gaesvlle, Florda, 3601 Rodolphe Le Rche École Natoale Supéreure des Mes de Sat-Étee, Sat-Étee, Frace ad CNRS LIMOS

More information

Personalized Search Based on Context-Centric Model

Personalized Search Based on Context-Centric Model JOURNAL OF NETWORKS, VOL. 8, NO. 7, JULY 13 1 Persoalzed Search Based o Cotext-Cetrc Model Mgyag Lu, Shufe Lu, Chaghog Hu Dept. College of Computer Scece ad Techology, Jl Uversty, Chagchu, Jl, Cha Emal:

More information

A Framework for Block-Based Timing Sensitivity Analysis

A Framework for Block-Based Timing Sensitivity Analysis 39.3 Framework for Block-Based Tmg Sestvty alyss Sajay V. Kumar Chadramoul V. Kashyap Sach S. Sapatekar Uversty of Mesota Itel Corporato Uversty of Mesota Meapols MN 55455 Hllsboro OR 973 Meapols MN 55455

More information

Content-Based Image Retrieval Using Associative Memories

Content-Based Image Retrieval Using Associative Memories Proceedgs of the 6th WSEAS It. Coferece o ELECOMMUNICAIONS ad INFORMAICS, Dallas, exas, USA, March 22-24, 2007 99 Cotet-Based Image Retreval Usg Assocatve Memores ARUN KULKARNI Computer Scece Departmet

More information

Adaptive Clustering Algorithm for Mining Subspace Clusters in High-Dimensional Data Stream *

Adaptive Clustering Algorithm for Mining Subspace Clusters in High-Dimensional Data Stream * ISSN 673-948 CODEN JKYTA8 E-mal: fcst@vp.63.com Joural of Froters of Computer Scece ad Techology http://www.ceaj.org 673-948/200/04(09)-0859-06 Tel: +86-0-566056 DOI: 0.3778/j.ss.673-948.200.09.009 *,2,

More information

WEB PAGE CLASSIFIERS FOR TOPICAL CRAWLER

WEB PAGE CLASSIFIERS FOR TOPICAL CRAWLER 244 WEB PAGE CLASSIFIERS FOR TOPICAL CRAWLER Dw H. Wdyatoro, Masayu L. Khodra, Paramta * School of Iformatcs ad Electrcal Egeerg - Isttut Tekolog Badug Jl. Gaesha 0 Badug Telephoe 62 22 250835 emal : dw@f.tb.ac.d,

More information

Short Text Classification Based on Improved ITC

Short Text Classification Based on Improved ITC Joural of Computer ad Commucatos, 013, 1, -7 http://dx.do.org/10.436/jcc.013.14004 Publshed Ole October 013 (http://.scrp.org/joural/jcc) Short Text Classfcato Based o Improved ITC Laglag L, Shoug Qu School

More information

Application of Genetic Algorithm for Computing a Global 3D Scene Exploration

Application of Genetic Algorithm for Computing a Global 3D Scene Exploration Joural of Software Egeerg ad Applcatos, 2011, 4, 253-258 do:10.4236/jsea.2011.44028 Publshed Ole Aprl 2011 (http://www.scrp.org/joural/jsea) 253 Applcato of Geetc Algorthm for Computg a Global 3D Scee

More information

A NOVEL ADAPTIVE FUZZY INFERENCE SYSTEM FOR MOBILE ROBOT NAVIGATION

A NOVEL ADAPTIVE FUZZY INFERENCE SYSTEM FOR MOBILE ROBOT NAVIGATION A NOVEL ADAPTIVE FUZZY INFERENCE SYSTEM FOR MOBILE ROBOT NAVIGATION J. HOSSEN, S. SAYEED, 3 A. HUDAYA, 4 M. F. A. ABDULLAH, 5 I. YUSOF Faculty of Egeerg ad Techology (FET), Multmeda Uversty (MMU), Malaysa,,3,4,5

More information

A New Newton s Method with Diagonal Jacobian Approximation for Systems of Nonlinear Equations

A New Newton s Method with Diagonal Jacobian Approximation for Systems of Nonlinear Equations Joural of Mathematcs ad Statstcs 6 (3): 46-5, ISSN 549-3644 Scece Publcatos A New Newto s Method wth Dagoal Jacoba Appromato for Systems of Nolear Equatos M.Y. Wazr, W.J. Leog, M.A. Hassa ad M. Mos Departmet

More information

Term Weighting Schemes Experiment Based on SVD for Malay Text Retrieval

Term Weighting Schemes Experiment Based on SVD for Malay Text Retrieval IJCSS Iteratoal Joural o Computer Scece ad etwork Securty, VOL.8 o.0, October 2008 357 Term Weghtg Schemes Expermet Based o SVD or Malay Text Retreval ordaah Ab Samat, Masrah Azrah Azm Murad, Muhamad Tauk

More information

Adaptive Provisioning of Differentiated Services Networks based on Reinforcement Learning

Adaptive Provisioning of Differentiated Services Networks based on Reinforcement Learning Adaptve Provsog of Dfferetated Servces Networks based o Reforcemet Learg T C K Hu ad C K Tham Dept of Electrcal & Computer Egeerg Natoal Uversty of Sgapore to appear IEEE Trasactos o Systems, Ma & Cyberetcs

More information

An evaluation of the paired comparisons method for software sizing

An evaluation of the paired comparisons method for software sizing A evaluato of the pared comparsos method for software szg ABSTRACT Ths paper evaluates the accuracy, precso ad robustess of the pared comparsos method for software szg ad cocludes that the results produced

More information

Delay based Duplicate Transmission Avoid (DDA) Coordination Scheme for Opportunistic routing

Delay based Duplicate Transmission Avoid (DDA) Coordination Scheme for Opportunistic routing Delay based Duplcate Trasmsso Avod (DDA) Coordato Scheme for Opportustc routg Ng L, Studet Member IEEE, Jose-Fera Martez-Ortega, Vcete Heradez Daz Abstract-Sce the packet s trasmtted to a set of relayg

More information

Marcus Gallagher School of Information Technology and Electrical Engineering The University of Queensland QLD 4072, Australia

Marcus Gallagher School of Information Technology and Electrical Engineering The University of Queensland QLD 4072, Australia O the Importace of Dversty Mateace Estmato of Dstrbuto Algorthms Bo Yua School of Iformato Techology ad Electrcal Egeerg The Uversty of Queeslad QLD 4072, Australa +6-7-3365636 boyua@tee.uq.edu.au Marcus

More information

Support Vector Machine and Random Forest Modeling for Intrusion Detection System (IDS)

Support Vector Machine and Random Forest Modeling for Intrusion Detection System (IDS) Joural of Itellget Learg Systems ad Applcatos, 04, 6, 45-5 Publshed Ole February 04 (http://www.scrp.org/joural/jlsa) http://dx.do.org/0.436/jlsa.04.6005 45 Support Vector Mache ad Radom Forest Modelg

More information

DEEP (Displacement Estimation Error Back-Propagation) Method for Cascaded ViSPs (Visually Servoed Paired Structured Light Systems)

DEEP (Displacement Estimation Error Back-Propagation) Method for Cascaded ViSPs (Visually Servoed Paired Structured Light Systems) DEEP (Dsplacemet Estmato Error Back-Propagato) Method for Cascaded VSPs (Vsually Servoed Pared Structured Lght Systems) Haem Jeo 1), Jae-Uk Sh 2), Wachoel Myeog 3), Yougja Km 4), ad *Hyu Myug 5) 1), 3),

More information

Evaluation of Node and Link Importance Based on Network Topology and Traffic Information DU Xun-Wei, LIU Jun, GUO Wei

Evaluation of Node and Link Importance Based on Network Topology and Traffic Information DU Xun-Wei, LIU Jun, GUO Wei Advaced Materals Research Submtted: 2014-08-29 ISSN: 1662-8985, Vols. 1049-1050, pp 1765-1770 Accepted: 2014-09-01 do:10.4028/www.scetfc.et/amr.1049-1050.1765 Ole: 2014-10-10 2014 Tras Tech Publcatos,

More information

A New Hybrid Audio Classification Algorithm Based on SVM Weight Factor and Euclidean Distance

A New Hybrid Audio Classification Algorithm Based on SVM Weight Factor and Euclidean Distance Proceedgs of the 2007 WSEAS Iteratoal Coferece o Computer Egeerg ad Applcatos, Gold Coast, Australa, Jauary 7-9, 2007 52 A New Hybrd Audo Classfcato Algorthm Based o SVM Weght Factor ad Eucldea Dstace

More information

Prof. Feng Liu. Winter /24/2019

Prof. Feng Liu. Winter /24/2019 Prof. Feg Lu Wter 209 http://www.cs.pd.edu/~flu/courses/cs40/ 0/24/209 Last Tme Feature detecto 2 Toda Feature matchg Fttg The followg sldes are largel from Prof. S. Lazebk 3 Wh etract features? Motvato:

More information

SALAM A. ISMAEEL Computer Man College for Computer Studies, Khartoum / Sudan

SALAM A. ISMAEEL Computer Man College for Computer Studies, Khartoum / Sudan AAPTIVE HYBRI-WAVELET ETHO FOR GPS/ SYSTE INTEGRATION SALA A. ISAEEL Computer a College for Computer Studes, Khartoum / Suda salam.smaeel@gmal.com ABSTRACT I ths paper, a techque for estmato a global postog

More information

Designing a learning system

Designing a learning system CS 75 Mache Leafrg Lecture 3 Desgg a learg system Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square, x4-8845 people.cs.ptt.edu/~mlos/courses/cs75/ Homeork assgmet Homeork assgmet ll be out today To parts:

More information

Developer Recommendation with Awareness of Accuracy and Cost

Developer Recommendation with Awareness of Accuracy and Cost Developer Recommedato wth Awareess of Accuracy ad Cost * J Lu, Yquz Ta State Key Lab of Software Egeerg Computer School, Wuha Uversty Wuha, Cha *Correspodg author jlu@whu.edu.c tayquz@whu.edu.c Lag Hog

More information

Clustering Algorithm for High Dimensional Data Stream over Sliding Windows

Clustering Algorithm for High Dimensional Data Stream over Sliding Windows 2011 Iteratoal Jot Coferece of IEEE TrustCom-11/IEEE ICESS-11/FCST-11 Clusterg Algorthm for Hgh Dmesoal Data Stream over Sldg Wdows Weguo Lu, Ja OuYag School of Iformato Scece ad Egeerg, Cetral South Uversty,

More information

Hybrid Landmark Routing in Ad Hoc Networks with Heterogeneous Group Mobility

Hybrid Landmark Routing in Ad Hoc Networks with Heterogeneous Group Mobility Hybrd Ladmark Routg Ad Hoc Networks wth Heterogeeous Group Moblty Yeg-Zhog Lee, Kax Xu 2, Xaoya Hog 3, Maro Gerla Computer Scece Departmet, Uversty of Calfora, Los Ageles, CA, {yeglee, gerla}@cs.ucla.edu

More information

An Ensemble Approach to Classifier Construction based on Bootstrap Aggregation

An Ensemble Approach to Classifier Construction based on Bootstrap Aggregation A Esemble Approach to Classfer Costructo based o Bootstrap Aggregato Dewa Md. Fard Jahagragar Uversty Dhaka-342, Bagladesh Mohammad Zahdur Rahma Jahagragar Uversty Dhaka-342, Bagladesh Chowdhury Mofzur

More information

COMPARISON OF PARAMETERIZATION METHODS USED FOR B-SPLINE CURVE INTERPOLATION

COMPARISON OF PARAMETERIZATION METHODS USED FOR B-SPLINE CURVE INTERPOLATION Europea Joural of Techc COMPARISON OF PARAMETERIZATION METHODS USED FOR B-SPLINE CURVE INTERPOLATION Sıtı ÖZTÜRK, Cegz BALTA, Melh KUNCAN 2* Kocael Üverstes, Mühedsl Faültes, Eletro ve Haberleşme Mühedslğ

More information

Reliable Surface Extraction from Point-Clouds using Scanner-Dependent Parameters

Reliable Surface Extraction from Point-Clouds using Scanner-Dependent Parameters 1 Relable Surface Extracto from Pot-Clouds usg Scaer-Depedet Parameters Hrosh Masuda 1, Ichro Taaka 2, ad Masakazu Eomoto 3 1 The Uversty of Tokyo, masuda@sys.t.u-tokyo.ac.jp 2 Tokyo Dek Uversty, taaka@cck.deda.ac.jp

More information

Eight Solved and Eight Open Problems in Elementary Geometry

Eight Solved and Eight Open Problems in Elementary Geometry Eght Solved ad Eght Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew eght prevous proposed ad solved problems of elemetary

More information