2 General Regression Neural Network (GRNN)

Size: px
Start display at page:

Download "2 General Regression Neural Network (GRNN)"

Transcription

1 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 etworks eeds ol a fracto of the trag samples a backpropagato eural etwork would eed [Specht 9]. The data avalable from measuremets of a operatg sstem s geerall ever eough for a backpropagato eural etwork [Specht 90]. Therefore the use of a probablstc eural etwork s especall advatageous due to ts ablt to coverge to the uderlg fucto of the data wth ol few trag samples avalable. The addtoal kowledge eeded to get the ft a satsfg wa s relatvel small ad ca be doe wthout addtoal put b the user. Ths makes GRNN a ver useful tool to perform predctos ad comparsos of sstem performace practce.

2 43. Algorthm The probablt dest fucto used GRNN s the Normal strbuto. Each trag sample, X, s used as the mea of a Normal strbuto. ( ) Y X - Ł T ( ) ( ) X - X X - X Y - Ł ł ł Eq..- The dstace,, betwee the trag sample ad the pot of predcto, s used as a measure of how well the each trag sample ca represet the posto of predcto, X. If the stace,, betwee the trag sample ad the pot of predcto s small, (- / ), becomes bg. For 0, (- / ) becomes oe ad the pot of evaluato s represeted best b ths trag sample. The dstace to all the other trag samples s bgger. A bgger dstace,, causes the term (- / ) to become smaller ad therefore the cotrbuto of the other trag samples to the predcto s relatvel small. The term Y *(- / ) for the th trag sample s the bggest oe ad cotrbutes ver much to the predcto. The stadard devato or the smoothess parameter,, as t s amed [Specht 9], s subect to a search. For a bgger smoothess parameter, the possble represetato of the pot of evaluato b the trag sample s possble for a wdeer rage of X. For a small

3 44 value of the smoothess parameter the represetato s lmted to a arrow rage of X, respectvel. Wth (Eq..-) t s possble to predct behavor of sstems based o few trag samples predct smooth mult-dmesoal curves terpolate betwee trag samples. I (Fg..-) a predcto performed b GRNN s show. The crcles represet the data pots or trag samples used to predct the sold le gog through most of these samples. The bell shaped curves are the dvdual terms of (Eq..-). Each of these curves s oe term, Y *(- / )/Σ (- / ) of the whole equato (Eq..-) used GRNN for the predcto. These terms are ormalzed ormal dstrbutos. Summg up the values of the dvdual terms at each posto elds the value of the predcto, the sold le gog through most of the data pots. The smoothess parameter was arbtrarl chose to 0..

4 45 Trag sample Predcto wth GRNN, Summato of Curves below Idvdual terms of Sum for GRNN x Fg..- GRNN wth dvdual terms cotrbutg to predcto, 0. I Chapter oe t was dscussed how Neural Networks weght the dvdual sgals of each euro dfferetl. I (Fg..-) GRNN s show a famlar represetato, a Backpropagato Neural Network was show before (Chapter ). The calculatos performed each patter euro of GRNN are (- / ), the ormal dstrbuto cetered at each trag sample. The sgals of the patter euro, gog to the eomator euro are weghted wth the correspodg values of the trag samples, Y. The weghts o the sgals gog to the Numerator Neuro are oe. Each sample from the trag data flueces ever pot that s beg predcted b GRNN.

5 46 X X X q- X q Iput Neuros Patter Neuros wth actvato fucto: (- /s ) Numerator Y Y Y Y p eomator Summato Neuros Output Neuro Y(X) Fg..- GRNN bult up a wa such that t ca be used as a parallel Neural Network

6 47. How to choose A predcto tool ca potetall be used for feed forward cotrol. Cotrollers usg a dervatve algorthm eed values ther algorthm that also clude a dervatve. Ths meas that the predcto tools have to submt a predcto that does ot ol represet the realt the precso of the value of the predcto but as well the slope of the predcto. The slope of the predcto ca eve be more mportat tha the actual value of the predcto, depedg o the algorthm a cotroller uses. epedg o the use of the predcto tool the emphass has to be put o oe of the two, precso or smoothess, or eve both. Fault detecto ad dagoss ca clude several methods, the ca clude as well algorthms usg a slope ther approach. But aga, depedg o the use of the predcto tool, ma aspects are mportat. The smoothess parameter s the ol parameter of the procedure. The search for the smoothess parameter has to take several aspects to accout depedg o the applcato the predcted output s used for. A bad characterstc that GRNN shows s that t ca have wggles (Fg..-). A wggle s defed as a flecto pot at a posto where o flecto should be. Wggles ca be as severe that such sudde chages the values of the predcto happe that these chages almost appear to be steps. I (Fg..-) aga the dvdual terms of the predcto usg GRNN are show. The dvdual terms have a ver arrow rage of fluece compared

7 48 to (Fg..-). The dvdual terms almost solel fluece the predcto the close vct of the trag sample. 0. Predcted Curve wth GRNN Trag Sample Idvdual Terms of Sum GRNN 0. x Fg..- GRNN Predcto wth extreme wggles, cludg the dvdual sgals, 7 The appearace of wggles s solel coected to the value of the smoothess parameter. For a predcto that s close to oe of the trag samples ad a suffcetl small smoothess parameter the fluece of the eghborg trag samples s mor. The cotrbuto to the predcto, (- k / ), s a lot smaller tha the cotrbuto of the trag sample that the predcto s close to, (- / ). The fluece of the trag samples that are further awa from the pot of predcto ca be eglected. ue to the ormalzato the predcto therefore elds the value of the trag sample the vct of

8 49 the each trag sample (Eq..-). For a bgger smoothes parameter the fluece of the eghborg trag samples caot be eglected. The predcto the s flueced b more pots ad the predcto s gettg smoother lm lm lm lm lm lm Y X X Y Y Y close to 0 lm Y Eq..- Wth eve larger the predcted curve wll get flatter more smooth as well. I some cases ths s desrable. For example whe the avalable data clude a lot of ose, the the predcto has to terpolate the data whereas f the data are correct, GRNN has to ft the data more precsel ad has to follow each lttle tred the data makes. If approaches ft the predcted value s smpl the average of all the sample pots (Eq..-). The effect of a bg

9 50 smoothess parameter ca be see ver earl.starts ver earl. I (Fg..-) a example for a smoothess parameter of oe s show. Trag samples Predcto wth GRNN for a large x Fg..- Predcto wth GRNN for a large smoothess parameter, lm Y Y Y lm lm Eq..- ue to the fact that data are ot geerall wthout measuremet errors ad that the crcumstaces chage from applcato to applcato, there caot be a rght or a wrog wa

10 5 to chose. The applcato ad the requred features of the predcto hghl determe whch should be fall chose. A tradeoff betwee smoothess ad mmal error has to be made depedg o the data ad the later use of the predcto... The Holdout Method Specht suggests [Specht 9] the use of the holdout method to select a good value of. I the holdout method, oe sample of the etre set s removed ad for a fxed GRNN s used aga to predct ths sample wth the reduced set of trag samples. The squared dfferece betwee the predcted value of the removed trag sample ad the trag sample tself s the calculated ad stored. The removg of samples ad predcto of them aga for ths chose s repeated for each sample-vector. After fshg ths process the mea of the squared dffereces s calculated for each ru. The the process of reducg the set of trag samples ad predctg the value for these samples s repeated for ma dfferet values of. The for whch the sum of the mea squared dfferece s the mmum of all the mea squared dffereces s the that should be used for the predctos usg ths set of trag samples. Accordg to Specht there are o restrctos to ths process, but ufortuatel t tured out that for certa codtos ths process does ot show the desred results. The holdout method works wth smoothess parameters that are ver small. The evaluato of the oetal fucto therefore ofte causes umercal problems; eve for 64 bt data storage. Gve that there are o umercal problems, aother problem s that the mmum of the Sum of Squares, Specht descrbes alread as wde s smpl so wde (Fg.

11 5.-3) that the fal choosg of s ver mprecse. chose the rage of the mmum ca show oe of the above metoed problems of ether extreme: Wggles or a uacceptable terpolato, but usuall wggles were observed. I (Fg..-3) a example of the result of the holdout method s show. The Sum of Sqaures s plotted versus the smoothess parameter. The holdout method suggests to use a smoothess parameter of. Wth the aked ee the mmum, the holdout method suggests ads up to a value of the smoothess parameter of Sum of Squares sgma Fg..-3 Result from Holdout Method I (Fg..-4) the results for these prevousl chose smoothess parameters are plotted. Both of the plots eld a curve that cludes wggles. The wggles are step lke for a

12 53 smoothess parameter of, the wggles are more getle for a smoothess parameter of 4. The precso of the predcto s ver good at the trag pots but the chages the slope of ths curve are uacceptable for several applcatos. As a comparso a predcto wth a smoothess parameter of 7 s cluded too. Ths predcto does ot clude wggles but s therefore less precse at the trag samples. A decso has to be made what curve s better. Ths decso depeds o the applcato the predcto s fall used for. predcto wth sgma ust outsde the mmum of holdout method, sgma4 predcto wth sgma7 predcto wth sgma from holdout method, sgma 0. trag sample 0. x Fg..-4 Usg as suggested b the Holdout Method ad other to compare.. The Wggle-Method All possble procedures for the choosg of are emprcal procedures ad caot eld a exact or correct value for. The holdout method ca work ver well for some examples but the results of the holdout method caot be flueced such that the

13 54 accommodate for the dfferet possble desred characterstcs of the predcto. Some effort was udertake to fd a dfferet, more flexble wa of choosg. The result s the Wggle- Method. The wggle-method s a purel emprcal method that turs out to be ver eas to work wth. The results usg the wggle-method ca be flueced ver easl. It leaves room to adust the algorthm to pa closer atteto to smoothess or to precso the predcto. The wggle-method (Fg..-5) works for a umber of dmesos. Usg a two dmesoal example the wggle-method wll be laed. The wggle-method eeds to have the allowable umber of flecto pots specfed. Ths formato s usuall kow or ca easl be assessed. The udgmet that s eeded though s to allow the rght umber of addtoal flectos to cout for uequall spaced data or measuremet errors, problems that wll be dscussed later. For the wggle-method, GRNN predcts the curve over the etre rage of the data. Frst s chose ver small, too small to predct the curve wthout wggles. The value for s creased b a specfable amout costatl utl the umber of flecto pots s equal to the allowable umber of flecto pots. Icreasg wll sooer or later eld a curve that s too smooth, that has ot eough flectos, the has to be decreased aga. Ths terato wll go o utl a stop crtera s satsfed. The stop crtera ca be a maxmum umber of teratos aroud the maxmal allowable umber of wggles, or t ca be a maxmum tolerable chage or a combato of these two. The umber of wggles s calculated wth a umercal approxmato. Ma predctos for equall spaced pots are calculated. The spacg of the predcted pots eeds to be

14 55 suffcetl more dese tha the spacg of the trag samples, otherwse the method would ot otce the flecto pots. Usg about fve tmes or more pots of predctos tha trag samples s suggested. The secod dervatve usg three cosecutve pots s the calculated umercall (Eq..-3) over the etre rage. Iflecto pots show a sg chage the secod dervatve. The umber of sg chages over the rage of the calculated predctos s equal to the umber of flecto pots. sec ( + ) + + x Eq..-3

15 56 The predcto has 0 wggles, crease x x The predcto has 0 wggles, crease x x The predcto has 0 wggles, crease xx The predcto has 4 wggles, crease xx 0. Ol two wggles left close to the edges. Now some more teratos ca follow to get closer to the border to three wggles. 0. xx Fg..-5 Wggle-method

16 57 The precso of last curve (Fg..-5) s ot as good as t could possbl be but t s ver a ver smooth curve. Ths curve has the desred characterstcs for ma applcatos, t s smooth ad t s precse. The umber of flectos rema costat over a rage of. But the precso at the trag samples chages cotuousl wth. The precso decles for bgger. should be chose at the lower boud of the rage for the desred umber sce the qualt of the predcto of the trag samples creases as gets smaller (Fg..-6). 0 Number of Iflectos 4 Choose at ths ed of the rage o ot choose at ths ed of the rage Fg..-6 Selecto of The qualt of the predcto s ot gog to be bad, supposg that the umber of flectos gve s close to the true umber of flectos that the sstem reall has. It was prove b Parze [Parze] that the probablstc approach wll coverge to the uderlg fucto as more trag samples are avalbale. Coutg the flecto pots suggested b the user s a measure of how close the predcto s to the uderlg fucto. Ths s smpl a

17 58 measure of qualt as the sum of squares s as well a measure of qualt. The wggle-method also allows hadlg of measuremet errors ad hadlg of the fluece of uequall spaced data. These problems wll be dscussed later. Usg the wggle-method the curve wll ot be flueced b the scatter of the data such that extreme devatos occur as wth Sple fuctos. The curve wll have the desred shape ad the proof of covergece b Parze make sure that the curve wll terpolate the data. A procedure ca be cluded that shows the developmet of the mea squared error over the etre process. Adustmets to the search method ca the be made. These adustmets are othg else tha creasg or decreasg the tolerable umber of wggles for the predcto order to get a more precse or smooth curve. Later (Secto 3.6) a wa to crease the precso wthout loosg the smoothess of the curve wll be dscussed. The wggle-method wll coverge to a value of the smoothess parameter. For a ver small the predcto cludes too ma wggles. For a that s amg towards ft, the value of the predcto wll be the average of the values of the trag samples wthout a wggle. Accordg to [Specht 9] there s a value of for whch the predcto coverges to the uderlg fucto of the samples. The wggle-method wll fd a value that les betwee these two boudares, ma wggles or average value ad o wggles. As metoed before a trade-off has to be made betwee precso ad smoothess. I (Fg..-7) the same example that was prevousl used s show aga. Prevousl the predcto dd ot eld ver precse values. The predcto s ver smooth but the predcto

18 59 does ot represet the trag samples ver precsel. I (Fg..-8) the predcto represets the trag samples ver well but the predcto has ma wggles. epedg o the use of the results oe or the other predcto ca be better. I (Fg..-7) ad (Fg..-8) the predcto tself ad the slope of the predcto s show for the examples used (Fg..- 7) ad (Fg..-8). The slope of the predcto for usg a 0. s ver smooth too. A cotroller usg the two sgals, value ad slope of the predcto wll perform ver dfferet for the predcto usg a 0. tha the same cotroller usg the predcto ad the slope for a Slope of Predcto slope 0. Predcto - 0. x -.0 Fg..-7 Predcto ad Slope of Predcto for a ver smooth curve, 0.

19 Slope of Predcto slope 0. Predcto x -4.0 Fg..-8 Predcto ad Slope of Predcto for a curve wth ma wggles, 7 It caot be assumed that the wggle-method s the best wa of choosg, but the results tured out to be ver satsfg. The holdout method could work wthout addtoal formato provded b the user; the wggle-method eeds addtoal formato. Ths makes the method vulerable to errors but as well more flexble.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Beijing University of Technology, Beijing , China; Beijing University of Technology, Beijing , China;

Beijing University of Technology, Beijing , China; Beijing University of Technology, Beijing , China; d Iteratoal Coferece o Machery, Materals Egeerg, Chemcal Egeerg ad Botechology (MMECEB 5) Research of error detecto ad compesato of CNC mache tools based o laser terferometer Yuemg Zhag, a, Xuxu Chu, b

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Summary of Curve Smoothing Technology Development

Summary of Curve Smoothing Technology Development RESEARCH ARTICLE Summary of Curve Smoothg Techology Developmet Wu Yze,ZhagXu,Jag Mgyag (College of Mechacal Egeerg, Shagha Uversty of Egeerg Scece, Shagha, Cha) Abstract: Wth the cotuous developmet of

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

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

A Novel Clustering Algorithm Based on Graph Matching

A Novel Clustering Algorithm Based on Graph Matching JOURNAL OF SOFTWARE, VOL. 8, NO. 4, APRIL 203 035 A Novel Clusterg Algorthm Based o raph Matchg uoyua L School of Computer Scece ad Techology, Cha Uversty of Mg ad Techology, Xuzhou, Cha State Key Laboratory

More information

Review Statistics review 1: Presenting and summarising data Elise Whitley* and Jonathan Ball

Review Statistics review 1: Presenting and summarising data Elise Whitley* and Jonathan Ball Crtcal Care February Vol 6 No Whtley ad Ball Revew Statstcs revew : Presetg ad summarsg data Else Whtley* ad Joatha Ball *Lecturer Medcal Statstcs, Uversty of Brstol, Brstol, UK Lecturer Itesve Care Medce,

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

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

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

Estimation of Co-efficient of Variation in PPS sampling.

Estimation of Co-efficient of Variation in PPS sampling. It. Statstcal Ist.: Proc. 58th World Statstcal Cogress, 0, Dubl (Sesso CPS00) p.409 Estmato of Co-effcet of Varato PPS samplg. Archaa. V ( st Author) Departmet of Statstcs, Magalore Uverst Magalagagotr,

More information

Signal Classification Method Based on Support Vector Machine and High-Order Cumulants

Signal Classification Method Based on Support Vector Machine and High-Order Cumulants Wreless Sesor Network,,, 48-5 do:.46/ws..7 Publshed Ole Jauary (http://www.scrp.org/joural/ws/). Sgal Classfcato Method Based o Support Vector Mache ad Hgh-Order Cumulats Abstract X ZHOU, Yg WU, B YANG

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

Self-intersection Avoidance for 3-D Triangular Mesh Model

Self-intersection Avoidance for 3-D Triangular Mesh Model Self-tersecto Avodace for 3-D Tragular Mesh Model Habtamu Masse Aycheh 1) ad M Ho Kyug ) 1) Departmet of Computer Egeerg, Ajou Uversty, Korea, ) Departmet of Dgtal Meda, Ajou Uversty, Korea, 1) hab01@ajou.ac.kr

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

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

Approximation of Curves Contained on the Surface by Freed-Forward Neural Networks

Approximation of Curves Contained on the Surface by Freed-Forward Neural Networks Appromato of Curves Cotaed o the Surface by Freed-Forward Neural Networks Zheghua Zhou ad Jawe Zhao Departmet of formato ad mathematcs Sceces Cha Jlag Uversty, Hagzhou, 3008, Cha zzhzjw003@63.com Abstract.

More information

Associated Pagerank: A Content Relevance Weighted Pagerank Algorithm

Associated Pagerank: A Content Relevance Weighted Pagerank Algorithm Assocated Pagerak: A Cotet Relevace Weghted Pagerak Algorthm Jh-Shh Hsu,Cha-Che Ye Assocated Pagerak: A Cotet Relevace Weghted Pagerak Algorthm 1 Jh-Shh Hsu, 2 Cha-Che Ye 1 Natoal Yul Uversty of Scece

More information

Comparison Studies on Classification for Remote Sensing Image Based on Data Mining Method

Comparison Studies on Classification for Remote Sensing Image Based on Data Mining Method Hag Xao ad Xub Zhag Comparso Studes o Classfcato for Remote Sesg Image Based o Data Mg Method Hag XIAO 1, Xub ZHANG 1 1: School of Electroc, Iformato ad Electrcal Egeerg Shagha Jaotog Uversty No. 1954,

More information

ECE Digital Image Processing and Introduction to Computer Vision

ECE Digital Image Processing and Introduction to Computer Vision ECE59064 Dgtal Image Processg ad Itroducto to Computer Vso Depart. of ECE NC State Uverst Istructor: Tafu Matt Wu Sprg 07 Outle Recap Le Segmet Detecto Fttg Least square Total square Robust estmator Hough

More information

TDT-2004: ADAPTIVE TOPIC TRACKING AT MARYLAND

TDT-2004: ADAPTIVE TOPIC TRACKING AT MARYLAND 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 20742 Cotact author: telsayed@cs.umd.edu Gary

More information

Speeding- Up Fractal Image Compression Using Entropy Technique

Speeding- Up Fractal Image Compression Using Entropy Technique Avalable Ole at www.jcsmc.com Iteratoal Joural of Computer Scece ad Moble Computg A Mothly Joural of Computer Scece ad Iformato Techology ISSN 2320 088X IMPACT FACTOR: 5.258 IJCSMC, Vol. 5, Issue. 4, Aprl

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

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

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

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

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

A Novel Optimization Algorithm for Adaptive Simplex Method with Application to High Dimensional Functions

A Novel Optimization Algorithm for Adaptive Simplex Method with Application to High Dimensional Functions A Novel Optmzato Algorthm for Adaptve Smplex Method th Applcato to Hgh Dmesoal Fuctos ZuoYg LIU, XaWe LUO 2 Southest Uversty Chogqg 402460, Cha, zuyglu@alyu.com 2 Southest Uversty Chogqg 402460, Cha, xael@su.edu.c.

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

NUMERICAL INTEGRATION BY GENETIC ALGORITHMS. Vladimir Morozenko, Irina Pleshkova

NUMERICAL INTEGRATION BY GENETIC ALGORITHMS. Vladimir Morozenko, Irina Pleshkova 5 Iteratoal Joural Iformato Theores ad Applcatos, Vol., Number 3, 3 NUMERICAL INTEGRATION BY GENETIC ALGORITHMS Vladmr Morozeko, Ira Pleshkova Abstract: It s show that geetc algorthms ca be used successfully

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

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

A CAD based Computer-Aided Tolerancing Model for the Machining Process

A CAD based Computer-Aided Tolerancing Model for the Machining Process A CAD based Computer-Aded Toleracg Model for the Machg Process Yujg Feg Computer ad Iformato ceces Departmet Idaa Uverst outh Bed TR-45- Ma 4 TABLE OF CONTENT ACNOWLEDGEMENT Error! Bookmark ot defed. LIT

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

Effects of Exterior Orientation Elements on Direct Georeferencing in POS-Supported Aerial Photogrammetry

Effects of Exterior Orientation Elements on Direct Georeferencing in POS-Supported Aerial Photogrammetry Proceedgs of the 8th Iteratoal mposum o patal Accurac Assessmet atural Resources ad Evrometal ceces hagha P. R. Cha Jue 5-7 008 pp. 30-36 Effects of Eteror Oretato Elemets o Drect Georeferecg PO-upported

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

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

SVM Classification Method Based Marginal Points of Representative Sample Sets

SVM Classification Method Based Marginal Points of Representative Sample Sets P P College P P College P Iteratoal Joural of Iformato Techology Vol. No. 9 005 SVM Classfcato Method Based Margal Pots of Represetatve Sample Sets Wecag ZhaoP P, Guagrog JP P, Ru NaP P, ad Che FegP of

More information

Nine Solved and Nine Open Problems in Elementary Geometry

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

More information

An Improved Fuzzy C-Means Clustering Algorithm Based on Potential Field

An Improved Fuzzy C-Means Clustering Algorithm Based on Potential Field 07 d Iteratoal Coferece o Advaces Maagemet Egeerg ad Iformato Techology (AMEIT 07) ISBN: 978--60595-457-8 A Improved Fuzzy C-Meas Clusterg Algorthm Based o Potetal Feld Yua-hag HAO, Zhu-chao YU *, X GAO

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

Network Intrusion Detection Using Support Vector Machine Based on Particle Swarm Optimization Li Wang 1,2, Chunhua Dong 2, Jianping Hu 2, Guodong Li 2

Network Intrusion Detection Using Support Vector Machine Based on Particle Swarm Optimization Li Wang 1,2, Chunhua Dong 2, Jianping Hu 2, Guodong Li 2 Iteratoal Coferece o Appled Scece ad Egeerg Iovato (ASEI 015) Network Itruso Detecto Usg Support Vector Mache Based o Partcle Swarm Optmzato L Wag 1,, Chuhua Dog, Japg Hu, Guodog L 1.School of Electrocs

More information

Classification Web Pages By Using User Web Navigation Matrix By Mementic Algorithm

Classification Web Pages By Using User Web Navigation Matrix By Mementic Algorithm Classfcato Web Pages By Usg User Web Navgato Matrx By Memetc Algorthm 1 Parvaeh roustae 2 Mehd sadegh zadeh 1 Studet of Computer Egeerg Software EgeergDepartmet of ComputerEgeerg, Bushehr brach,

More information

Auto-Scalability in Cloud: A Surveyof Energy and Sla Efficient Virtual Machine Consolidation

Auto-Scalability in Cloud: A Surveyof Energy and Sla Efficient Virtual Machine Consolidation SSRG Iteratoal Joural of Computer Scece ad Egeerg (SSRG-IJCSE volume 3 Issue November 06 Auto-Scalablty Cloud: A Surveyof Eergy ad Sla Effcet Vrtual Mache Cosoldato A.Rchard Wllam, Dr.J.Sethlkumar Asst.

More information

Application Research for Ultrasonic Flaw Identification Based on Support Vector Machine Jing Huang 1, a, Binglei Guan 1, b

Application Research for Ultrasonic Flaw Identification Based on Support Vector Machine Jing Huang 1, a, Binglei Guan 1, b 4th Iteratoal Coferece o Mechatrocs, Materals, Chemstry ad Computer Egeerg (ICMMCCE 205) Applcato Research for Ultrasoc Flaw Idetfcato Based o Support Vector Mache Jg Huag, a, Bgle Gua, b School of Electroc

More information

OMAE HOW TO CARRY OUT METOCEAN STUDIES

OMAE HOW TO CARRY OUT METOCEAN STUDIES Proceedgs of the ASME 20 30th Iteratoal Coferece o Ocea, Offshore ad Arctc Egeerg OMAE20 Jue 9-24, 20, Rotterdam, The Netherlads OMAE20-490 HOW TO CARRY OUT METOCEAN STUDIES Judth va Os Hydraulc Egeerg

More information

Determination Method of Nonlinear Membership Function Based on the Density Function of the Square Error

Determination Method of Nonlinear Membership Function Based on the Density Function of the Square Error Research Joural of Appled Sceces, geerg ad Techology 5(8): 504-508, 03 ISSN: 040-7459; e-issn: 040-7467 Maxwell Scetfc Orgazato, 03 Submtted: July 7, 0 Accepted: September 03, 0 Publshed: March 5, 03 Determato

More information

Fingerprint Classification Based on Spectral Features

Fingerprint Classification Based on Spectral Features Fgerprt Classfcato Based o Spectral Features Hosse Pourghassem Tarbat Modares Uversty h_poorghasem@modares.ac.r Hassa Ghassema Tarbat Modares Uversty ghassem@modares.ac.r Abstract: Fgerprt s oe of the

More information

Improved MOPSO Algorithm Based on Map-Reduce Model in Cloud Resource Scheduling

Improved MOPSO Algorithm Based on Map-Reduce Model in Cloud Resource Scheduling Improved MOPSO Algorthm Based o Map-Reduce Model Cloud Resource Schedulg Heg-We ZHANG, Ka NIU *, J-Dog WANG, Na WANG Zhegzhou Isttute of Iformato Scece ad Techology, Zhegzhou 45000, Cha State Key Laboratory

More information

Network Security Evaluation Based on Variable Weight Fuzzy Cloud Model

Network Security Evaluation Based on Variable Weight Fuzzy Cloud Model 207 2 d Iteratoal Coferece o Computer Scece ad Techology (CST 207) ISBN: 978--60595-46-5 Networ Securty Evaluato Based o Varable Weght Fuzzy Cloud Model Yag JIANG a*, Cheg-ha LI, Zh-peg LI ad Mg-ca SUN

More information

Prediction Method of Network Security Situation Based on GA- LSSVM Time Series Analysis

Prediction Method of Network Security Situation Based on GA- LSSVM Time Series Analysis AMSE JOURNALS-AMSE IIETA publcato-07-seres: Advaces B; Vol. 60; N ; pp 37-390 Submtted Mar. 05 07; Revsed May 5 07; Accepted Ju. 0 07 Predcto Method of Network Securty Stuato Based o GA- LSSVM Tme Seres

More information

Multiple fault diagnosis of down-hole conditions of sucker-rod pumping wells based on Freeman chain code and DCA

Multiple fault diagnosis of down-hole conditions of sucker-rod pumping wells based on Freeman chain code and DCA Pet.Sc.(3):37-3 DOI.7/s8-3-83-37 Multple fault dagoss of dow-hole codtos of sucker-rod pumpg wells based o Freema cha code ad DCA LI Ku, GAO Xa-we, YANG We-bg, DAI Yg-log ad TIAN Zhog-da College of Iformato

More information

Electrocardiogram Classification Method Based on SVM

Electrocardiogram Classification Method Based on SVM Electrocardogram Classfcato Method Based o SVM Xao Tag Zhwe Mo College of mathematcs ad software scece, Schua ormal uversty, Chegdu 60066, P. R. Cha Abstract Heart dsease s oe of the ma dseases threateg

More information

Regression Analysis. Acknowledgments

Regression Analysis. Acknowledgments PT 3 - Lear Regresso Regresso Aalyss How to develop ad assess a CER All models are wrog, but some are useful. -George Box I mathematcs, cotext obscures structure. I data aalyss, cotext provdes meag. -George

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

Integrated fault diagnosis method for down-hole working conditions of the beam pumping unit

Integrated fault diagnosis method for down-hole working conditions of the beam pumping unit Itegrated fault dagoss method for dow-hole workg codtos of the beam pumpg ut Ha Yg, L Ku College of Egeerg, Boha Uversty, Jzhou 203, Cha. E-mal: fegya326@alyu.com Abstract: The Dyamometer card s commoly

More information

Reconstruction of Orthogonal Polygonal Lines

Reconstruction of Orthogonal Polygonal Lines Recostructo of Orthogoal Polygoal Les Alexader Grbov ad Eugee Bodasky Evrometal System Research Isttute (ESRI) 380 New ork St. Redlads CA 9373-800 USA {agrbov ebodasky}@esr.com Abstract. A orthogoal polygoal

More information

Multiclass classification Decision trees

Multiclass classification Decision trees CS 75 Mache Learg Lecture Multclass classfcato Decso trees Mlos Hauskrecht mlos@cs.tt.edu 59 Seott Suare CS 75 Mache Learg Mdterm eam Mdterm Tuesda, March 4, 4 I-class 75 mutes closed book materal covered

More information

A Cordic-based Architecture for High Performance Decimal Calculations

A Cordic-based Architecture for High Performance Decimal Calculations A Cordc-ased Archtecture for Hgh Performace Decmal Calculatos Jose L. Sachez, Atoo Jmeo, Hgo Mora, Jeromo Mora, Fracsco Puol Computer Techology Departmet Uversty of Alcate Alcate, Spa Emal: sachez@dtc.ua.es,

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