Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps

Size: px
Start display at page:

Download "Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps"

Transcription

1 Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics, Urmia Brach, Islamic zad Uiversity, Urmia, Ira bstract: The preset paper aimed at desigig a ew method to rak fuzzy umbers by distace method The purpose of the preset study was to give a ew method to value various fuzzy umbers effectively ad at the same time overcome the shortcomigs of the previous studies The proposed method is based o the cetral iterval ad the maximum crisp value of fuzzy umbersthe results of the aalysis idicated that the followig method effectively rak various fuzzy umbers ad their images The fidigs are discussed as far as a ew method is cocered to be far simpler tha the other approaches Fially, this method compared the preset proposed defiitio with some other kow oes Key words: Fuzzy umbers, akig, Defuzzificatio, Distace, Evirometal maps INTODUCTION akig fuzzy umbers is oe of the importat issues i the realm of decisio makig process Most of the problems that exist i ature are fuzzy, tha probabilistic or determiistic Problems cotaiig fuzzy risk aalysis, fuzzy optimizatio, etc, are to be used i fuzzy theory, therefore, at oe of the stages fuzzy umbers must be raked before a actio is take by a decisio maker Sice fuzzy umbers are represeted by possibility distributio they ofte overlap with each other ad i this case discrimiatig them is a complex task tha discrimiatig real umbers where a atural order exist betwee them mog the existig rakig methods oe of the efficiet approaches to order the fuzzy umbers is defuzzificatioto this ed, we defie a rakig fuctio from the set of all fuzzy umbers F ( ) to the set of all real umbers, which maps each fuzzy umber ito the real lie, where a atural order exist Usually by reducig the whole of the aalysis to a sigle umber, much of the iformatio is lost ad most of the rakig methods cosider oly oe poit of view with regard to comparig fuzzy quatities Hece, a attempt is to miimize this loss Due to the importace of fuzzy umbers, may researchers have proposed the related methods or applicatios to rak fuzzy umbers For example; Jai(976), Dubios ad Prade(983) itroduced the relevat cocepts of fuzzy umberselated to the rakig methods Bortola ad Degai(985) compared ad reviewed the existig approaches, poitig out some illogical coditios ad coclusios that arise out of the research Furthermore, Yao ad Wu (2) proposed a ew approach for rakig fuzzy umbers based o the fuzzy simulatio aalysis method i which a combiatio method icludig computer ad math applicatio was developed (Lee et al, 998) Saeifard ad llahviraloo(27) cosidered a fuzzy origi for fuzzy umbers ad the based o the distace of fuzzy umbers with respect to this origi, rak thembbasbady adsaeifard(2)suggested a defuzzificatio method based o the cetral iterval of fuzzy umberssady ad Zedeham(27)poited out a defuzzificatio method usig miimizer of the distace betwee the two fuzzy umbers O the other had, aother commoly used techique is the cetroid-based fuzzy umber rakig approach Cheg(998)argued that iterms of a cetroid idex rakig approach, the distace of the cetroid poit of each fuzzy umber ad origial poit are calculated to lead to the improvemet ofyager's approach Lee ad Li (998) coducted the compariso of fuzzy umbers based o the uiform ad proportioal probability distributios i which the mea ad stadard deviatio values are used to rak fuzzy umbers I order to overcome the above metioed limitatios, Chu ad Tsao(22) proposed a approach to rak fuzzy umbers with the area betwee the cetroid ad origial poits Havig reviewed the previous methods, this paper proposes a coceptual procedure ad method to use the cocepts of cetral iterval, maximum crisp value ad Euclidea distace i order to fid the order of fuzzy umbers The advatage of this method is that ca distiguish the alteratives clearly I this paper,defuzzificatio ca be used as a crisp approximatio of a fuzzy umber Thus, the mai purpose of the preset study is to obtai a crisp approximatio with respect to a fuzzy quatity, ad defie a method for rakig of fuzzy umbers Therefore, by meas of this defuzzificatio, the preset study aimsat presetig a ovel method for rakig of fuzzy umbers The reset of this paper is orgaized as follows:i Sectio 2, some defiitio ad fudametal results o fuzzy umbers are recalled I Sectio 3, a ew approach is proposed for rakig fuzzy umbers Discussio Correspodig uthor: Saeifard, Departmet of pplied Mathematics, Urmia Brach, Islamic zad Uiversity, Urmia, Ira srsaeeifard@yahoocom 94

2 J ppl Sci & gric, 8(3): 94-99, 23 ad compariso of this work ad other method are carried out i Sectio 4 The paper eds with coclusio i Sectio 5 Fially the refereces are listed at the ed 2 Basic Defiitios ad Notatios: Here, we review some basic otios of fuzzy umbers (take from (bbasbady et al, 2)) These otios are expressed as follows Defiitio 2 fuzzy umber is a mappig µ ( x ) : [,] with the followig properties: µ is a upper semi- cotiuous fuctio o 2 µ ( x ) = outside of some iterval [ a, b2] 3 There are real umbers a, a 2, b adb 2 ad such that a a2 b b2 ad 3 µ ( x ) is a mootoic icreasig fuctio o [ a, a 2], 32 µ ( x ) is a mootoic decreasig fuctio o [ b, b 2], 33 µ ( x ) = for all x i [ a2, b ] The set of all fuzzy umbers is deoted by F Defiitio22The membership fuctio µ of a fuzzy umber is expressed by (2) as: L f ( x ) whe x [ a, b ), w whe x [ b, c], µ ( x ) = (2) f ( x) wh e x ( c, d], otherwise Where < w is acostat The left fuctio f L ( x) :[ ab, ] [, w] ad the right fuctio f ( x) :[ c, d] [, w ] are two strictly mootoicad cotiuous mappig from to closed iterval[, w ] Therefore, the left iversed fuctio g L ( x) :[, w] [ ab, ] ad the right iversed fuctio g ( x) :[, w] [ cd, ] also exist Based o the basic theories of fuzzy umbers, is a ormal fuzzy umber if w =, whereas is a o-ormal fuzzy umber if < w < Notice that (2) is a L fuzzy umber fuzzy L umber with shape fuctio f ( x) ad f ( x) is defied by: L x a f ( x ) =, (22) b a ad d x f ( x ) = d c, (23) respectively, where >, will be deoted by = abcd,,, If be o-ormal fuzzy umber it will be deoted by = abcdw,,, ; If =, we simply wright = abcd,,,, which is kow as a ormal trapezoidal fuzzy umber ad if b = c, it is reduced to a triagular fuzzy umber ad represeted by = abd,,, therefore, triagular fuzzy umbers are special cases of trapezoidal fuzzy umbers Each fuzzy umber described by (2) has the followig α-level sets (α-cuts) α = [ aα, bα], aα, b, α α [,], L [ g ( α), g ( α )] for all α (,) 2 = [ bc, ] 3 = [ ad, ] If = abcd,,, the for all α [,], α = a+ α ( b a), d α ( d c) (24) 95

3 J ppl Sci & gric, 8(3): 94-99, 23 Defiitio 23ccordig to Dubios ad Prade(993) the iterval-valued probabilistic mea of a fuzzy umber with α-cuts = [ a, b ], α [,] is the iterval E( ) = [ E ( ), E ( )], where α α α E ( ) = a dα ad E ( ) = b dα (25) α α Carlsso ad Fuller (22) itroduced the iterval-valued possibilistic mea of a fuzzy umber as the iterval M ( ) = [ M ( ), M ( )], where M ( ) = 2 α aα dα ad M ( ) = 2 α bα dα (26) Defiitio 24(Bodaova, 25)Let be a fuzzy umber characterized by(2) Let ml ( ab, ) ad (, cd) be such that m ml b µ ( x ) dx = µ ( x ) dx, (27) a ad m ml d µ ( x ) dx = µ ( x ) dx, (28) c m espectivelythe M e( ) = [ ml, m] is called the media iterval(iterval-valued media) of b a Propositio 2(Bodaova, 25)Let = abcd,,, The M e( ) = [ ml, m],where ml = a+ ad m d c = d (29) I order to determie the cetral iterval C( ) = [ C ( ), C ( )] of a fuzzy umber, Bodaova (25) provides the followig cetral iterval formulae as: C( ) = E( ) M ( ) M ( ), (2) e Where E( ), M ( ) ad M e ( ) are the iterval-valued probabilistic mea ad the iterval-valued possibilistic mea ad the iterval-valued media of, respectively The cetral iterval C( ) has the lower boud C ( ) = max E{ ( ), M ( ), m ( )}, L (2) d the upper boud C ( ) = mi E{ ( ), M ( ), m ( )} (22) Defiitio 25(bbasbady et al, 2)Let be a arbitrary fuzzy umber, ad C( ) = [ C ( ), C ( )] be its cetral iterval (calculated by (2)) The measure of C( ) is as: M ( C( )) = sig ( C ( )) C ( ) C ( ), (23) I The ew measure of fuzzy umber is defied as follow: M ( ) = p( α) M ( C( )) dα (24) C I 96

4 J ppl Sci & gric, 8(3): 94-99, 23 Thefuctio P :[,] [, + ) deotes the distributio desity of the importace of the degrees of fuzziess, where P( α) dα = I particular cases, it may be assumed that k p( α) = ( k + ) α, k =,, Throughout this study the researchers assumed that k =, ie P ( α) = 2α (25) 3 New Method for akig Fuzzy Numbers: I this sectio, based o the distace method we preset a ew approach for rakig fuzzy umbers The methodot oly cosiders the cetral iterval of a fuzzy umber, but also takes ito accout the maximum crisp value of fuzzy umbers I order to rak fuzzy umbers, firstly,this study defies a maximum crisp value amax to be the bechmark ssume that there are fuzzy umbers, 2,,, where = ( a, a2, a3, a4), The maximum crisp value a max is the maximum value of the a, a 2, a 3, a 4, ad The proposed method for rakig fuzzy umbers, 2,, is ow preseted as follow: StepUse formula (2) to calculate the cetral iterval C( ) = [ C ( ), C ( )] of each fuzzy umbers,where Step2 Calculate the maximum crisp value a max of all fuzzy umbers, where Step3 Use the cetral iterval C( ) = [ C ( ), C ( )] to calculate the rakig value MS ( ) of the fuzzy umbers,where,as follow: MS ( ) = M ( ) a (36) C max From(36), oe may that MS ( ) could be cosidered as the Euclidea distace betwee the poit ( M C ( ),) ad the poit ( a max,) We ca see that the smaller the valueof MS ( ), the better the rakig of, where Sice the aim of the preset study is to approximate a fuzzy umber by a scalar value, the researchers have to use a operator MS : F (a space of all fuzzy umbers ito a family of real lie) MS isa crisp approximatio operator Sice the above metioeddefuzzificatio ca be used as a crisp approximatio of a fuzzy umber, it ca be cocluded that the resultat value is used to rak the fuzzy umber Thus, MS is used to rak fuzzy umbers Thesmaller MS, the larger fuzzy umber Let B, F be two arbitrary fuzzy umbers Defie the rakig of ad B o MS () as follow: MS ( ) > MS ( B ) if oly if B, 2 MS ( ) < MS ( B ) if oly if B, 3 MS ( ) = MS ( B ) if oly if ~ B The this article formulate the order ad as B if ad oly if B or ~ B, B if ad oly if B or ~ B The ew rakig idex ca sort may differet fuzzy umbers simultaeously I additio, the idex also satisfies the commo properties of rakig fuzzy umbers as follow: (a) Trasitivity of the order relatio, ie if B ad B C, the we should have C (b) Compatibility of additio, that is if there is B o { B, } the there is + C B + C o{ + C, B + C} emark 3If B the, B Hece, this article ca ifer rakig order of the images of thefuzzy umbers 4 Numerical Examples: I this Sectio, the curret study compares proposed method with some of other method Example 4Cosider the followig sets, see bbasbady et al(2) Set: = (4, 5,), B = (4,7,), C = (4,9,) Set2: = (3, 4, 7, 9), B = (3,7,9), C = (5, 7, 9) Set 3: = (3, 5, 7), B = (3,5,8,9), C = (3, 5, 9) Set4: = (, 4, 8, 9), B = (2, 5, 9), C = (, 6, 8) 97

5 J ppl Sci & gric, 8(3): 94-99, 23 To compare the proposed method with other methods, researchers refer the reader to Table (4) Note that, i Table (4) ad i set4, for Sig Distace with (P=) i (bbasbady et al, 26), sady&zedeham(27), Yao&Wu(2) ad Baldwi&Guild(979) methods, the rakig order for fuzzy umbers B ad C is B ~ C, which seems ureasoable regardig to figures The preset study utilizes the proposed method to rak fuzzy umbers i the above metioed example Table 4: Comparative esults of Example 4 uthors Fuzzy Set Set 2 Set 3 Set 4 umbers Proposed method B C esult B C B C C B B C bbasbady et al(2) B C esults B C B C C B B C Sig Distace method with p= (26) B C esults B C B C C B B C Sig Distace method with p=2 (26) B C B C C B B C B C B C C B B C B C B C C B B C esults B C sady ad Zedeham (27) esults B C bbasbady ad Haari(29) esults B C Choobieh ad Li (993) B C esults B C B C B C B C Baldwi ad Guild (979) B C esults B C B C B C B C Chu ad Tsao(22) B C esults B C B C C B C B Yao ad Wu (2) B C esults B C B C C B B C Cheg (998) CV uiform distributio B C esults C B B C B C C B Cheg (998) CV proportial distributio B C 3 25 B C B C C B esults C B Example42Cosider the fuzzy umbers = (,4,7,8), B = (2, 5, 9), C = (, 6, 8), (Figure 4) We rak these fuzzy umbers with our proposed method MS ( ) = 695, MS ( B ) = 646, MS ( C ) = 62 Therefore, the rakig order is B C The images of these fuzzy umbers are = ( 8, 7, 4,), B = ( 9, 5, 2), C = ( 8, 6, ) lso, by the providedmethod MS ( ) = 25, MS ( B ) = 254, MS ( C ) = 298 Therefore, we have C B Obviously, the proposed method ca effectively rak the images of fuzzy umbers 98

6 J ppl Sci & gric, 8(3): 94-99, 23 B C Fig 4: Fuzzy Numbers BCi,, Example 42 5 Coclusios: It seems that fuzzy umbers are coveiet for represetig imprecise umerical quatities i a vague eviromet, ad their compariso or rakig is very importat for applicatio purposessice fuzzy umbers do ot form a atural liear order,i this regard like real umbers, a key issue i operatioalizig fuzzy set theory is to show how to compare fuzzy umbersseveral aalytic methods have bee proposed to solve this problem, but i this paper, we suggest a ew approach to the problem of rakig usig distace method ad employed the cetral iterval ad the maximum crisp value i the proposed defiitio EFEENCES bbasbady, S, B sady, 26 akig of fuzzy umbers by sig distace, Iformatio Sciece, 76: bbasbady, S, T Haari, 29 ew approach for rakig of trapezoidal fuzzy umbers, Computer ad Mathematics with pplicatios, 57: bbasbady, S, Saeifard, 2 method for defuzzificatio based o cetral iterval ad its applicatio i decisio makig, Joural of merica Sciece, 7(6): sady, B, Zedeham, 27akig fuzzy umbers by distace miimizatio, ppl Math Model, 3: Baldwi, JF, NCF Guild, 979 Compariso of fuzzy umbers o the same decisio space, Fuzzy Sets Syst, 2: Bodaova, S, 25 Media value ad media iterval of a fuzzy umber, Iformatio Sciece, 72: Bortola, G, Degai, 985 review of some methods for rakig fuzzy umbers, Fuzzy Sets ad Systems, 5: -9 Carlsso, C, Fuller, 22Fuzzy reasoig i decisio makig ad optimizatio, Physica Verlag, Heidelberg Cheg, CH, 998 ew approach for rakig fuzzy umbers distace method, Fuzzy Sets ad Syst, 95(3): Choobieh, F, H Li, 993 idex for orderig fuzzy umbers, Fuzzy Sets ad Systems, 54: Chu, TC, CT Tsao, 22 akig fuzzy umbers with a area betwee the cetroid poit ad origial poit, Computers ad Mathematics with applicatio, 43: -7 Dubios, D, H Prade, 983 akig of fuzzy umbers i the settig of possibility theory, If Sci, 3: Jai,, 976 Decisio makig i the presece of fuzzy variables, IEEE Trasactios o Systems, Ma ad Cyberetics, 6: Lee, ES, J Li, 998 ew approach for rakig fuzzy umbers by distace method, Fuzzy Sets ad Systems, 95: Saeifard, S, T llahviraloo, F Hosseizadeh, N Mikaeilvad, 27 Euclidea rakig DMUs with fuzzy data i DE, ppl Math Sci, 6: Yager,, 98 O choosig betwee subsets, Kyberetes, 9: 5-54 Yager,, 98 procedure for orderig fuzzy subsets of the uit iterval, If Sci, 24:43-6 Yao, J, K Wu, 2 akig fuzzy umbers based o decompositio priciple ad siged distace, Fuzzy Sets ad Systems, 6:

Assignment Problems with fuzzy costs using Ones Assignment Method

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

More information

Ones Assignment Method for Solving Traveling Salesman Problem

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

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

New HSL Distance Based Colour Clustering Algorithm

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

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Protected points in ordered trees

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

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

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

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

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

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

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

More information

Accuracy Improvement in Camera Calibration

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

More information

Which movie we can suggest to Anne?

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

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

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

More information

Cubic Polynomial Curves with a Shape Parameter

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

More information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

Big-O Analysis. Asymptotics

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

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem

A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : 2248-9622, Vol. 4, ssue 3( Versio 1), March 2014, pp.897-903 RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees. Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

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

More information

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

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

More information

Convergence results for conditional expectations

Convergence results for conditional expectations Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,

More information

On Computing the Fuzzy Weighted Average Using the KM Algorithms

On Computing the Fuzzy Weighted Average Using the KM Algorithms O Computig the Fuzzy Weighted Average Usig the KM Algorithms Feilog iu ad Jerry M Medel Sigal ad Image Processig Istitute, Departmet of Electrical Egieerig Uiversity of Souther Califoria, 3740 McClitock

More information

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics

More information

The Extended Weibull Geometric Family

The Extended Weibull Geometric Family The Exteded Weibull Geometric Family Giovaa Oliveira Silva 1 Gauss M. Cordeiro 2 Edwi M. M. Ortega 3 1 Itroductio The literature o Weibull models is vast, disjoited, ad scattered across may differet jourals.

More information

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types Data Aalysis Cocepts ad Techiques Chapter 2 1 Chapter 2: Gettig to Kow Your Data Data Objects ad Attribute Types Basic Statistical Descriptios of Data Data Visualizatio Measurig Data Similarity ad Dissimilarity

More information

ANN WHICH COVERS MLP AND RBF

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

More information

Fuzzy Linear Regression Analysis

Fuzzy Linear Regression Analysis 12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted

More information

Method for Solving Unbalanced Transportation Problems Using Trapezoidal Fuzzy Numbers

Method for Solving Unbalanced Transportation Problems Using Trapezoidal Fuzzy Numbers Kadhirvel. K, Balauruga. K / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.ijera.co Vol., Issue 4, Jul-Aug 0, pp.59-596 Method for Solvig Ubalaced Trasportatio Probles Usig

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

More information

Big-O Analysis. Asymptotics

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

More information

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering 0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Compactness of Fuzzy Sets

Compactness of Fuzzy Sets Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i

More information

LU Decomposition Method

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

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

BASED ON ITERATIVE ERROR-CORRECTION

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

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

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

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

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

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

More information

Fuzzy Transportation Problem Using Triangular Membership Function-A New approach

Fuzzy Transportation Problem Using Triangular Membership Function-A New approach Vol3 No.. PP 8- March 03 ISSN: 3 006X Trasportatio Proble Usig Triagular Mebership Fuctio-A New approach a S. Solaiappaa* K. Jeyaraab Departet of Matheatics Aa UiversityUiversity College of Egieerig Raaathapura

More information

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

A General Framework for Accurate Statistical Timing Analysis Considering Correlations A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

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

More information

Area As A Limit & Sigma Notation

Area As A Limit & Sigma Notation Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

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

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

More information

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

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

A study on Interior Domination in Graphs

A study on Interior Domination in Graphs IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,

More information

A Study on the Performance of Cholesky-Factorization using MPI

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

More information

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

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

More information

ON MATHIEU-BERG S INEQUALITY

ON MATHIEU-BERG S INEQUALITY ON MATHIEU-BERG S INEQUALITY BICHENG YANG DEPARTMENT OF MATHEMATICS, GUANGDONG EDUCATION COLLEGE, GUANGZHOU, GUANGDONG 533, PEOPLE S REPUBLIC OF CHINA. bcyag@pub.guagzhou.gd.c ABSTRACT. I this paper, by

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

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

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

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

More information

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

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

More information

Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters

Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios,

More information

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

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

More information

Image Segmentation EEE 508

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

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

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

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

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

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

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

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

More information

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

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

More information

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

Lower Bounds for Sorting

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

More information

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

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

More information

Intermediate Statistics

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

More information

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

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

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

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

More information

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

INTERSECTION CORDIAL LABELING OF GRAPHS

INTERSECTION CORDIAL LABELING OF GRAPHS INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,

More information

Analysis of Documents Clustering Using Sampled Agglomerative Technique

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

More information

Neutrosophic Linear Programming Problems

Neutrosophic Linear Programming Problems Neutrosophic Operatioal Research I Neutrosophic Liear Programmig Problems Abdel-Nasser Hussia Mai Mohamed Mohamed Abdel-Baset 3 Floreti Smaradache 4 Departmet of Iformatio System, Faculty of Computers

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

On (K t e)-saturated Graphs

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

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Lecture 13: Validation

Lecture 13: Validation Lecture 3: Validatio Resampli methods Holdout Cross Validatio Radom Subsampli -Fold Cross-Validatio Leave-oe-out The Bootstrap Bias ad variace estimatio Three-way data partitioi Itroductio to Patter Recoitio

More information