COTS evaluation using modified TOPSIS and ANP

Size: px
Start display at page:

Download "COTS evaluation using modified TOPSIS and ANP"

Transcription

1 Appled Mathematcs and Computaton 177 (2006) COTS evaluaton usng modfed TOPSIS and ANP Huan-Jyh Shyur Department of Informaton Management, Tamkang Unversty, Tawan 151 Yng-Chuan Rd., Tamsu, Tape 25137, Tawan Abstract Ths paper models the COTS evaluaton problem as an MCDM problem and proposes a fve-phase COTS selecton model, combnng the technque of ANP (analytc network process) and modfed TOPSIS (technque for order performance by smlarty to dea soluton). Ths artcle dscusses usng the ANP to determne the relatve weghts of multple evaluaton crtera. The modfed TOPSIS approach s used to rank competng products n terms of ther overall performance. To llustrate how the approach s used for the COTS evaluaton problem, an emprcal study of a real case s conducted. The case study demonstrates the effectveness and feasblty of the proposed evaluaton procedure. Ó 2005 Elsever Inc. All rghts reserved. Keywords: COTS; TOPSIS; ANP; Multple crtera decson makng 1. Introducton Gven the hgh nterest n motvaton to the use of commercally avalable software, the evaluaton and selecton of commercal-off-the-self (COTS) products s an mportant actvty n the software development projects. Selectng an approprate COTS product s often a non-trval task n whch multple crtera need to be careful consderaton. Accordng to our observaton, many decson makers select COTS products accordng to ther experence and ntuton. Ths approach s obvously subjectve and ts weakness has been addressed n several prevous studes [8 10,12]. Alternatvely, multple crtera decson makng (MCDM) approach s used n rankng or selectng one or more COTS products from a set of avalable alternatves wth respect to multple evaluaton crtera. MCDM provdes an effectve framework for COTS products comparson nvolvng the evaluaton of multple crtera. For example, Konto [8] developed a systematc approach called OTSO (off-the-self-opton) to demonstrate that MCDM can be effectvely used to compare varous COTS products from multple dmensons. The OTSO approach uses the analytc herarchy process (AHP) to consoldate the evaluaton data for decson makng process. The AHP method s now wdely used by both researchers and practtoners n COTS selecton problems [5,6,8,11]. The methodology s only useful when the decson makng framework has a undrectonal herarchcal relatonshp among decson levels. However, Carney and Wallnau [2] ponts out the evaluaton E-mal address: shyur@mal.m.tku.edu.tw /$ - see front matter Ó 2005 Elsever Inc. All rghts reserved. do: /j.amc

2 252 H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) crtera for COTS product are not always ndependent of each other, but often nteract. An nvald result can be made n the face of ths complexty. Moreover, AHP s not practcally usable f the number of alternatves and crtera s large snce the repettve assessments may cause fatgue n decson makers [1]. The pror proposed MCDM technques for COTS product evaluaton are useful but have restrcted applcaton. Another popular method for solvng MCDM problems s the TOPSIS (technque for order performance by smlarty to dea soluton) whch was frst developed by Hwang and Yoon [7]. The TOPSIS bases upon the concept that the optmal alternatve should have the shortest dstance from the postve dea soluton (PIS) and the farthest dstance from the negatve dea soluton (NIS). Although the concept of TOPSIS s ratonal and understandable, and the computaton nvolved s uncomplcated, the nherent dffculty of assgnng relable subjectve preferences to the crtera s worth of note. Ths paper models the COTS evaluaton problem as an MCDM problem and proposes a fve-phase COTS selecton model, combnng the technque of analytc network process (ANP) and modfed TOPSIS. The ANP method s used n obtanng the relatve weghts of crtera but not the entre evaluaton process to reduce the large number of parwse comparson. As for the performance correspondng to each alternatve, the modfed TOPSIS approach usng a new defned weghted Eucldean dstance s conducted to rank competng products n terms of ther overall performance on multple evaluaton crtera. The method presents here does not account for dervng the evaluaton crtera for COTS selecton. However, the proposed model may provde organzatons a way to devse and refne adequate crtera and allevate the rsk of selectng sub-optmal solutons. The rest of ths paper s structured as follows: In the next secton, the proposed COTS evaluaton procedure s presented and an overvew of the technques used n our model s gven. Secton 3 wll dscuss the procedure and results of an emprcal study. In Secton 4, we present our conclusons on the results reported n ths paper. 2. Proposed model The evaluaton procedure of ths study conssts of several steps as shown n Fg. 1. The frst step s to dentfy the multple crtera that are consdered n the decson makng process for the decson makers to make an objectve and unbased decson. Brand [1] ponts out that the selecton of approprate crtera s context Crtera for COTS Selecton Identfy Relatonsh p Between Crtera ANP Weghts of Crtera Create Decson Matrx TOPSIS Rankng of COTS Fg. 1. Selecton framework of COTS.

3 H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) dependent and cannot be part of a general COTS selecton methodology. Then a relatonshp between crtera that shows the degree of nterdependence relatonshp s determned by group expert dscusson n general. After constructng the relatonshp of a crtera network structure, the crtera weghts can be calculated by applyng ANP. Fnally, we conduct a modfed TOPSIS approach to acheve the fnal rankng results. The detaled descrptons of each step are elaborated n each of the followng subsecton Evaluaton crtera and ther nterdependence relatonshp The large number of crtera to be usually consdered n the COTS evaluaton process makes t very dffcult for the evaluators to make an objectve, unbased decson. These crtera nvolve both the requrements that a company may currently have and wll also need when they mplement the COTS and those requrements that they currently do not need but wll requre when they mplement and mantan the system. Konto [8] presents a crtera defnton process that essentally decomposes a goal nto a herarchcal crtera set and each branch n ths herarchy ends n an evaluaton attrbute. The formal group management technque we have been usng to determne the herarchcal crtera set s called nomnal group technque (NGT) [3]. The process forces everyone to partcpate and no domnant person s allowed to come out and control the proceedngs. In NGT all deas have equal stature. Seven potental evaluaton crtera are determned through a NGT process n our emprcal study. To smplfy the process and avod any msunderstandng, the nteracton between any of these crtera s not consdered n the frst nstance. Table 1 presents the proposed crtera and ther related attrbutes. The seven crtera may not nclude all of the decson factors n COTS evaluaton. However, they are the most meanngful measures n our case and have been stressed n many leadng artcles and books. In order to reflect the nterdependence property among the evaluaton crtera, we need to dentfy the exact relatonshp n the network structure frst. Another NGT process n our study constructed the relatonshp based on the followng recogntons. (a) Good ntegrated soluton, one-stop servce, educaton support, and techncal support wll reduce the technologcal rsk and make mplementaton process easer. (b) The hgher charged prce for mplementaton and mantenance may let suppler tend to place more emphass on customer care. (c) A system wth hgher ntegraton level nduces lower technologcal rsk snce less customer development s needed. Table 1 Proposed crtera and ther related attrbutes Selecton crtera Cost (CO) SupplerÕs support (SS) Technologcal rsk (TR) Closeness of ft to the companyõs busness (FB) Easy of mplementaton (EI) Flexblty to easy change as the companyõs busness changes (FC) System ntegraton (SI) Evaluaton attrbutes Lcense fee, modular prcng, mantenance, documentaton, consultant fee, resource utlzaton, converson cost Vendor responsveness, consultng, hot lne, tranng, techncal support personnel, contnung enhancement, tme sharng access, warranty, documentaton, fnancal stablty, local branch offce, thrd vendor support, growth of customer base, actve R&D Nonrobust and ncomplete packages, complex and undefned COTS-to-legacy-system nterfaces, mddleware technology bugs, poor custom code, and poor system performance, software maturty, hardware maturty Man target, ncluded functonalty Shorter mplementaton tme, user frendlness, multste mplementaton Adaptablty, openness for customer development, openness for workng wth other systems Internal connectvty, external connectvty

4 254 H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) SI TR FC CO SS EI FB Fg. 2. Relatonshp among crtera. (d) A system s flexble whch means t s desgned more openness for customer development and workng wth other systems. It reduces some technologcal rsks such as a system wth a complex and undefned COTS-to-legacy-system nterface. Fg. 2 represents the type of nterdependency network. The sngle arrows mply a one-way relatonshp. For example, the arrow that leaves from SI and feeds nto TR nfers that the attrbutes of crteron SI nfluence crteron TR Determne the weghts of crtera To determne the relatonshp of the degree of nterdependence, the analytc network process (ANP) technque, an extenson of AHP, s used to address the relatve mportance of the evaluaton crtera. The ANP s developed by Saaty [14 16] to generate prortes for decsons wthout makng assumptons about a undrectonal herarchy relatonshp among decson levels. To take the place of a lnear top-to-bottom form of strctly herarchy, the ANP model provdes a looser network structure makes possble the representaton of any decson problem. The relatve mportance or strength of the mpacts on a gven element s measured on a rato scale smlar to AHP. The major dfference between AHP and ANP s that ANP s capable of handlng nterrelatonshps between the decson levels and attrbutes by obtanng the composte weghts through the development of a supermatrx. The supermatrx s a parttoned matrx, where each submatrx s composed of a set of relatonshps between two components or clusters n a connecton network structure. Saaty [15] explans the concept correspondng to the Markov chan process. For our dscusson, we use the matrx manpulaton based on the concept of Saaty and TakzawaÕs [14] n place of SaatyÕs supermatrx, whch s much easer to understand. Due to the characterstcs of COTS evaluaton presented here we explore the approprateness of ANP to allow for the explct consderaton of nteractons n the decson makng process. The remanng procedure nvolves three substeps and shown as follows: Step 1: Wthout assumng the nterdependence among crtera, the decson makers are asked to evaluate all proposed crtera parwse. They responded questons such as: whch crtera should be emphaszed more n a COTS product, and how much more? The responses were presented numercally and scaled on the bass of SaatyÕs proposed 1 9 scale [13], where 1 represents ndfference between the two crtera and 9 s extremely preferred of the crteron under consderaton over the comparson crteron. Each par of crtera s judged only once. A recprocal value wll be automatcally assgned to the reverse comparson. Once the parwse comparsons are completed, the local prorty vector w 1 s computed as the unque soluton to Aw 1 ¼ k max w 1 ; ð1þ where k max s the largest egenvalue of parwse comparson matrx A. The obtaned vector s further normalzed by dvdng each value by ts column total to represent the normalzed local prorty vector w 2. Step 2: Next to resolve the effects of the nterdependence that exsts between the evaluaton crtera. The decson makers examne the mpact of all the crtera on each other by usng parwse comparsons as well. Questons such as: whch crteron wll nfluence crteron TR more: SI or FC? and how much more?

5 are answered. Varous parwse comparson matrces are constructed for each of the crteron. These parwse comparson matrces are needed to dentfy the relatve mpacts of crtera nterdependent relatonshps. The normalzed prncpal egenvectors for these matrces are calculated and shown as column component n nterdependence weght matrx of crtera B, where zeros are assgned to the egenvector weghts of the crtera from whch a gven crteron s gven. Step 3: Now we can obtan the nterdependence prortes of the crtera by syntheszng the results from prevous two steps as follows: w c ¼ Bw T 2. ð2þ 2.3. The rankng process The evaluaton procedure calculates the mportance weghts of varous crtera by ANP. Once the weghts of crtera are determned, a modfed TOPSIS rankng approach s proceeded to conduct the remanng evaluaton procedure. The full ANP soluton s only practcally usable f the number of crtera and alternatves s suffcently low so that the number of parwse comparsons performed by evaluator must reman below a reasonable threshold. For example, f there are n crtera whch have been assgned the mportance weghts and m alternatves, then to run a full ANP soluton there are n Æ m Æ (m 1)/2 parwse comparsons remanng to be performed. The number of alternatve COTS on the market ncreases rapdly [1]. To avod unreasonably large number of parwse comparsons, we conduct TOPSIS to acheve the fnal rankng result and replace the full ANP soluton. The basc TOPSIS technque conssts of the followng steps: 1. Establsh a decson matrx for alternatve performance. The structure of the matrx can be expressed as follows: F 1 F 2 F j F n 2 A 1 f 11 f 12 f 1j f 3 1n A 2 f 21 f 22 f 2j f 2n.. D ¼.... A f 1 f 2 f j f ; n A m f m1 f m2 f mj f mn where A denotes the possble alternatves, =1,...,m; F j represents attrbutes or crtera relatng to alternatve performance, j =1,...,n; and f j s a crsp value ndcatng the performance ratng of each alternatve A wth respect to each crteron F j. 2. Calculate the normalzed decson matrx R (=[r j ]). The normalzed value r j s calculated as f j r j ¼ q ffffffffffffffffffffffffffffff P ; j ¼ 1;...; n; ¼ 1;...; m. ð3þ n j¼1 f j 2 3. Calculate the weghted normalzed decson matrx by multplyng the normalzed decson matrx by ts assocated weghts. The weghted normalzed value v j s calculated as v j ¼ w j r j ; j ¼ 1;...; n; ¼ 1;...; m; ð4þ where w j represents the weght of the jth attrbute or crteron. 4. Determne the deal and negatve-deal solutons. V þ ¼fv þ 1 ;...; vþ n g¼fðmax V ¼fv 1 ;...; v n g¼fðmn H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) v j jj 2 JÞ; ðmn v j jj 2 J 0 Þg; v j jj 2 J 0 Þg; v j jj 2 JÞ; ðmax where J s assocated wth beneft crtera, and J 0 s assocated wth cost crtera. ð5þ

6 256 H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) Calculate the separaton measures, usng the m-dmensonal Eucldean dstance. The separaton of each alternatve from the deal soluton ðd þ Þ s gven as vffffffffffffffffffffffffffffffffffffffffffffffffffffff ux n ¼ t ðv j v þ j Þ 2 ; ¼ 1;...; m. ð6þ D þ j¼1 Smlarly, the separaton of each alternatve from the negatve-deal soluton ðd Þ s as follows: vffffffffffffffffffffffffffffffffffffffffffffffffffffff ux n ¼ t ðv j v j Þ 2 ; ¼ 1;...; m. ð7þ D j¼1 6. Calculate the relatve closeness to the dea soluton and rank the preference order. The relatve closeness of the alternatve A wth respect to V + can be expressed as D C ¼ D þ þ D ; ¼ 1;...; m; ð8þ where the C ndex value les between 0 and 1. The larger the ndex value means the better the performance of the alternatves. In the aggregaton process, a set of alternatve COTS s to be compared wth respect to predefned crtera. The performance ratng of each alternatve for each crteron s assgned and formed as a decson matrx. Furthermore, the normalzaton formula as shown n formula (1) s used to transform the varous scale nto a comparable scale. The normalzed decson matrx s weghted by multplyng each column of the matrx by ts assocated crtera weght n the above process. The overall performance of an alternatve s then determned by ts Eucldean dstance to V + and V. However, Shpley et al. [17] ponts out that ths dstance s nterrelated wth the crtera weghts and should be ncorporated n the dstance measurement. Ths s because all alternatves are compared wth V + and V, rather than drectly among themselves. Deng et al. [4] presents the weghted Eucldean dstances to nstead of creatng a weghted decson matrx. In ths process, we defne the postve deal soluton (R + ) and the negatve-deal soluton (R ), whch are not depended on the weghted decson matrx, as R þ ¼fr þ 1 ;...; rþ n g¼fðmax R ¼fr 1 ;...; r n g¼fðmn r j jj 2 JÞ; ðmn r j j j 2 J 0 Þg; r j jj 2 JÞ; ðmax r j jj 2 J 0 Þg. The weghted Eucldean dstances, between A and R +, and between A and R, are calculated, respectvely, as vffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff vffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff X n u ux ¼ t w j ðr j r þ j Þ 2 n ; D ¼ t w j ðr j r j Þ 2 ; ¼ 1;...; m; ð10þ D þ j¼1 j¼1 where the value of w j (j =1ton) s the element of vector w c whch s calculated by formula (2). Then we can obtan closeness coeffcent for each alternatve based on formula (8). Fnally, a set of alternatve can be preference ranked accordng to the descendng order of closeness coeffcent. 3. Illustratve example To llustrate the proposed COTS evaluaton process, an applcaton based on practcal experence and mplementaton n an electronc company s presented n ths sesson. A team of four s been charged n an off-lne producton data analyss system selecton project. All the team members have prevous experence n nformaton systems evaluaton. To conduct the emprcal study, we spent more than two weeks to gather enough nformaton through ntervews wth users and managers, observaton of current operaton process, and analyss of the systemõs documentaton to develop some general deas for the to-be system. Next, the screenng crtera were created ð9þ

7 H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) to conduct a market research ntatve lookng for sutable work flow systems and narrow the feld, where screenng crtera are the mnmum requrements about canddate systems. In our practcal example, we brng nto budget lmt as the major screenng crtera, and four systems (A 1,A 2,A 3,A 4 ) were selected nto the canddate lst. After the ntal screenng process wth respect to a few rgorous cutoff crtera, the decson problem faced by the evaluaton team was to determne the prorty of each canddate and select the fnalsts. The phase composes of a seres of complex revew and decson but short of an explct approach. In ths study, the proposed method was appled to solve ths problem and the computatonal procedure s summarzed as follows: Step 1: The team members were asked to evaluate all proposed crtera (Table 1) parwse wthout assumng the nterdependence among them. The result s presented n Table 2. The normalzed egenvector s lke w 2 = (CO, EI,SS,FB,FC, TR, SI) = (0.242,0.360,0.042, 0.102,0.030, 0.157, 0.067) whch represents the related local prorty of these crtera. Step 2: In addton we consdered and analyzed the dependence among the selecton crtera. The team members examned the mpact of all the crtera on each by usng parwse comparson. Totally, seven parwse comparson matrces were developed. The normalzed egenvectors for these matrces are calculated and shown as seven columns n Table 3, where zeros are assgned to the egenvector weghts of the crtera from whch a gven crteron s gven. The data of Table 3 mean seven crteraõs degree of relatve mpact for each seven crtera. For example, the COÕs degree of relatve mpact for SS s Step 3: The relatve mportance of the crtera consderng nterdependence now can be obtaned by syntheszng the results from Steps 1 and 2 as follows: CO 1 0: :242 0:301 SS 0 0:835 0: : :360 0:332 EI 0 0 0: :042 0:026 w c ¼ FB ¼ 0 0 0: :102 ¼ 0:112. FC : :030 0: TR : : :097 5 SI : :067 0:091 Table 2 Crtera parwse comparson matrx CO SS EI FB FC TR SI Vector weghts CO 1 1/ SS EI 1/5 1/7 1 1/3 2 1/5 1/ FB 1/3 1/ / FC 1/7 1/8 1/2 1/4 1 1/4 1/ TR 1/2 1/ SI 1/4 1/5 2 1/2 3 1/ Table 3 Degree of relatve mpact for evaluaton crtera CO SS EI FB FC TR SI CO SS EI FB FC TR SI

8 258 H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) Table 4 Normalzed decson matrx CO SS EI FB FC TR SI A A A A Table 5 Fnal rankng of COTS products Rank Alternatve Closeness coeffcent 1 A A A A Accordng to what we calculated, SS, CO, and FB were three of the most mportant consderng factors relatng to the system evaluaton n ths company, whch was confrmed by the decson team. Step 4: At the next level of the decson procedure, the team members were asked to establsh the decson matrx by comparng canddates under each of the crtera separately. The crtera were assumed to be beneft crtera and all the members were asked to gve a set of crsp values wthn the range from 1 to 10 to represent the performance of each alternatve wth respect to each crteron. After the decson matrx was determned, we normalzed the matrx by usng formula (1). Table 4 shows the result. Step 5: The fnal rankng procedure starts at the determnaton of the deal and negatve-deal solutons. The deal and negatve-deal solutons are defned by formula (9) as R þ ¼ð0:64; 0:70; 0:63; 0:64; 0:61; 0:69; 0:63Þ; R ¼ð0:28; 0:35; 0:39; 0:32; 0:30; 0:30; 0:39Þ. Snce the crtera weghts (w c ) have been obtaned from ANP, the weghted Eucldean dstances, between A and R +, and between A and R, can be calculated by formula (10). Fnally, usng formula (8) the relatve closeness to the dea soluton of each alternatve are then calculated. The evaluaton results can be seen n Table 5. Accordng to the closeness coeffcent, the rankng order of the four canddates s A 4, A 1, A 2, and A 3. Obvously, the best selecton s canddate A 4. In ths emprcal study, a refnement process was performed to confrm the result whch was obtaned by our proposed approach. The decson team revewed and refned the applcaton of the lst of crtera to each fnal canddate system. Each system provder was requested to demonstrate the system, to help the decson team to obtan a much deeper knowledge on ts functonalty and adaptablty to the company. The decson team vsted two reference stes of the wnnng software as well, to see the software n actual use n a company. In ths case, alternatve A 4 was selected as the fnal wnner after the refnement process. 4. Conclusons The purpose of ths paper s to present an effectve framework usng both ANP and modfed TOPSIS methods for performng COTS evaluaton. To address the crtera nterdependence problem, ANP method s used n obtanng the relatve weght of crtera. As the results shown n the emprcal study, we fnd that the proposed method s practcal for rankng competng COTS products n terms of ther overall performance wth respect to multple nterdependence crtera. Whle we beleve that the approach presented there s room for future enhancements and valdaton. For example, how to extend the current proposed approach to handle the nherent uncertanty and mprecson of the human decson makng process should be examned. The ANP whch s used n determnng the crte-

9 ron weghts requres complex matrx operatons on real number, tradtonal fuzzy concept cannot be drectly used n the matrx calculatons of the ANP [10]. Ths may be a new drecton n future development. In concluson, the underlyng concept of ths method s ratonal and comprehensble. The consderaton of relatonshps among COTS evaluaton crtera presented n ths paper provdes organzatons a way to devse and refne adequate crtera and allevate the rsk of selectng sub-optmal solutons. References H.-J. Shyur / Appled Mathematcs and Computaton 177 (2006) [1] L.C. Brand, COTS evaluaton and selecton, n: Proceedngs of the Internatonal Conference on Software Mantenance, vol. 1998, 1998, pp [2] D.J. Carney, K.C. Wallnau, A bass for evaluaton of commercal software, Informaton and Software Technology 40 (1998) [3] A.L. Delbecq, V.A.H. Ven, D.H. Gustafson, Group Technques for Program Plannng, Scott, Foresman and Company, IL, [4] H. Deng, C.H. Yeh, R.J. Wlls, Inter-company comparson usng modfed TOPSIS wth objectve weghts, Computers and Operatons Research 27 (2000) [5] G.R. Fnne, G.E. Wttg, D.I. Petkov, Prortzng software development productvty factors usng the analytc herarchy process, Journal of Systems and Software 22 (1995) [6] S. Hong, R. Ngam, Analytc herarchy process appled to evaluaton of fnancal modelng software, n: Proceedngs of the 1st Internatonal Conference on Decson Support Systems, Atlanta, [7] C.L. Hwang, K. Yoon, Multple Attrbute Decson Makng: Methods and Applcatons, A State of the Art Survey, Sprnger-Verlag, New York, [8] J. Konto, A case study n applyng a systematc method for COTS selecton, n: IEEE Proceedngs of ICSE-18, 1996, pp [9] K.R.P.H. Leung, H.K.N. Leung, On the effcency of doman-based COTS product selecton method, Informaton and Software Technology 44 (2002) [10] L. Mkhalov, M.G. Sngh, Fuzzy analytc network process and ts applcaton to the development of decson support systems, IEEE Transactons on Systems, Man, and Cybernetcs Part C: Applcatons and Revews 33 (1) (2003) [11] H. Mn, Selecton of software: the analytc herarchy process, Internatonal Journal of Physcal Dstrbuton and Logstcs Management 122 (1) (1992) [12] C. Rolland, Requrement engneerng for COTS based systems, Informaton and Software Technology 41 (14) (1999) [13] T.L. Saaty, The Analytc Herarchy Process, McGraw-Hll, New York, [14] T.L. Saaty, M. Takzawa, Dependence and ndependence: from lnear herarches to nonlnear networks, European Journal of Operatonal Research 26 (1986) [15] T.L. Saaty, The Analytc Network Process, RWS Publcatons, Pttsburgh, [16] T.L. Saaty, Fundamentals of the Analytc Network Process, ISAHP, Kobe, Japan, [17] M.F. Shpley, D.K. Korvn, R. Obt, A decson makng model for mult-attrbute problems ncorporatng uncertanty and bas measures, Computers and Operatons Research 18 (1991)

OPTIMIZATION OF PROCESS PARAMETERS USING AHP AND TOPSIS WHEN TURNING AISI 1040 STEEL WITH COATED TOOLS

OPTIMIZATION OF PROCESS PARAMETERS USING AHP AND TOPSIS WHEN TURNING AISI 1040 STEEL WITH COATED TOOLS Internatonal Journal of Mechancal Engneerng and Technology (IJMET) Volume 7, Issue 6, November December 2016, pp.483 492, Artcle ID: IJMET_07_06_047 Avalable onlne at http://www.aeme.com/jmet/ssues.asp?jtype=ijmet&vtype=7&itype=6

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

CHAPTER 3 AHP, FUZZY AHP AND GRA

CHAPTER 3 AHP, FUZZY AHP AND GRA 38 CHAPTER 3 AHP, FUZZY AHP AND GRA 3.1 INTRODUCTION The purpose of ths chapter s to dscuss the fundamental concepts of AHP, Fuzzy AHP and GRA. The steps nvolved n AHP, characterstcs and lmtatons of AHP

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Professional competences training path for an e-commerce major, based on the ISM method

Professional competences training path for an e-commerce major, based on the ISM method World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

ANALYSIS OF ALUMINIUM PROFILE MANUFACTURING INDUSTRIES BY USING TOPSIS METHOD

ANALYSIS OF ALUMINIUM PROFILE MANUFACTURING INDUSTRIES BY USING TOPSIS METHOD Int. J. ech. Eng. & Rob. Res. 2014 Prashant B alve and Shrkant Jachak 2014 Research Paper ISSN 2278 0149 www.jmerr.com Vol. 3 No. 3 July 2014 2014 IJERR. All Rghts Reserved ANALYSIS OF ALUINIU PROFILE

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

COMPLEX METHODOLOGY FOR STUDY OF INTERCITY RAIL TRANSPORT

COMPLEX METHODOLOGY FOR STUDY OF INTERCITY RAIL TRANSPORT ENGINEERING FOR RURA DEVEOPMENT Jelgava 5.-7.05.06. COMPEX METHODOOGY FOR STUDY OF INTERCITY RAI TRANSPORT Svetla Stolova Radna Nkolova Techncal Unversty-Sofa Bulgara stolova@tu-sofa.bg r.nkolova@tu-sofa.bg

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

CONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal

CONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal CONCURRENT OPTIMIZATION OF MUTI RESPONCE QUAITY CHARACTERISTICS BASED ON TAGUCHI METHOD Ümt Terz*, Kasım Baynal *Department of Industral Engneerng, Unversty of Kocael, Vnsan Campus, Kocael, Turkey +90

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

(1) The control processes are too complex to analyze by conventional quantitative techniques.

(1) The control processes are too complex to analyze by conventional quantitative techniques. Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

Expert Systems with Applications

Expert Systems with Applications Expert Systems wth Applcatons 38 (2011) 13588 13603 Contents lsts avalable at ScenceDrect Expert Systems wth Applcatons journal homepage: www.elsever.com/locate/eswa A group AHP-TOPSIS framework for human

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Face Recognition using 3D Directional Corner Points

Face Recognition using 3D Directional Corner Points 2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS

MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS Int. Journal for Housng Scence, Vol.38, No.1 pp.13-23, 2014 Publshed n the Unted States MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS Ádám BUKOVICS Szécheny István Unversty Department of Structural

More information

An Internal Clustering Validation Index for Boolean Data

An Internal Clustering Validation Index for Boolean Data BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 6 Specal ssue wth selecton of extended papers from 6th Internatonal Conference on Logstc, Informatcs and Servce Scence

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Identifying Top-k Most Influential Nodes by using the Topological Diffusion Models in the Complex Networks

Identifying Top-k Most Influential Nodes by using the Topological Diffusion Models in the Complex Networks (IJACSA) Internatonal Journal of Advanced Computer Scence and Applcatons, Vol. 8, No., 07 Identfyng Top-k Most Influental Nodes by usng the Topologcal Dffuson Models n the Complex Networks Maryam Padar,

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

A New Measure of Cluster Validity Using Line Symmetry *

A New Measure of Cluster Validity Using Line Symmetry * JOURAL OF IFORMATIO SCIECE AD EGIEERIG 30, 443-461 (014) A ew Measure of Cluster Valdty Usng Lne Symmetry * CHIE-HSIG CHOU 1, YI-ZEG HSIEH AD MU-CHU SU 1 Department of Electrcal Engneerng Tamkang Unversty

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Laplacian Eigenmap for Image Retrieval

Laplacian Eigenmap for Image Retrieval Laplacan Egenmap for Image Retreval Xaofe He Partha Nyog Department of Computer Scence The Unversty of Chcago, 1100 E 58 th Street, Chcago, IL 60637 ABSTRACT Dmensonalty reducton has been receved much

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

An Efficient Algorithm for PC Purchase Decision System

An Efficient Algorithm for PC Purchase Decision System Proceedngs of the 6th WSAS Internatonal Conference on Instrumentaton, Measurement, Crcuts & s, Hangzhou, Chna, Aprl 15-17, 2007 216 An ffcent Algorthm for PC Purchase Decson Huay Chang Department of Informaton

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Incremental Learning with Support Vector Machines and Fuzzy Set Theory

Incremental Learning with Support Vector Machines and Fuzzy Set Theory The 25th Workshop on Combnatoral Mathematcs and Computaton Theory Incremental Learnng wth Support Vector Machnes and Fuzzy Set Theory Yu-Mng Chuang 1 and Cha-Hwa Ln 2* 1 Department of Computer Scence and

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

Modular PCA Face Recognition Based on Weighted Average

Modular PCA Face Recognition Based on Weighted Average odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract

More information

A Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China

A Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China for Database Clusterng Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal: 6085@qq.com Me Zhang Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal:64605455@qq.com Database clusterng

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information