A data envelopment analysis approach for ranking Iranian banks based on financial indices
|
|
- Holly Jenkins
- 5 years ago
- Views:
Transcription
1 A data evelopmet aalysis approach for rakig Iraia baks based o fiacial idices Pariaz Zarehparvari, Zahra Alipour Darvish Departmet of Iformatio Techology, North brach of Islamic Azad Uiversity, Tehra, Ira Abstract There are may performace aalysis techiques cocetrates o evaluatig efficiecy of orgaizatios. As a part of them, data evelopmet aalysis is a popular maagemet tool, aims at evaluatig the efficiecy of decisio makig uits based o a o-parametric approach. This paper will focus o the metioed techique ad perform a case study o some Iraia baks to ivestigate their efficiecy ad rakig those usig data evelopmet aalysis method. This study compares the metioed baks i two mai areas, called operatioal efficiecy ad beeficial efficiecy. Aalyzig the obtaied results will determie the superiority of outstadig bak. Keywords- Data evelopmet aalysis; Decisio makig uit; Bak efficiecy; Noparametric compariso. 1- Itroductio Performace aalysis is a importat issue i orgaizatios leads maagers to make suitable decisios ad hereby improve the efficiecy. Oe the most powerful methods for such aalysis is data evelopmets aalysis. Data evelopmet aalysis (DEA) refers to a well-kow o parametric techique aims at evaluatig the efficiecy of uits based o iput-output aalysis. The iceptio of DEA is preseted i Farrell (1957) where ecoomic research motivatios raise the eed of developig better methods for evaluatig productivity fuctios. However, Farrell did ot carry his developmets to a poit which distiguishes betwee both Farrell efficiet ad Pareto-Koopmas efficiet categories (Pareto, 1927; Koopmas, 1951), referred to as weak efficiecy ad strog efficiecy, respectively (Cooper et al., 2007). The moder versio of DEA origiates from the ideas of Chares, Cooper, ad Rhodes (CCR) through mathematical formulatios. The fudametal idea behid DEA is to provide a methodology whereby a set of bechmark DMUs forms a efficiet frotier ad furthermore this methodology is able to measure the level of efficiecy of iefficiet uits. The idicator set of the DMUs is divided ito two iput ad output categories ad DEA approach attempts to maximize the ratio of weighed outputs to weighted iputs, as a covetioal efficiecy criterio. Sice the very begiig of DEA studies, several extesios of the CCR model have bee developed, such as what Baker, Chares, ad Cooper (BCC) propose to produce frotiers spaed by the covex hull of the existig DMUs (Baker et al., 1984). There have bee several recet reviews that cover both practical ad theoretical developmets of DEA (Cooper et al., 2007; Emrouzejad et al., 2008; Cook ad Seiford, 2009). Other related works ca be foud i Kao ad Lio (2014), Kaur ad Gupta (2015), LaPlate ad Paradi (2015), Razavi Hajiaghaie et al. (2015), Tajbakhs ad Hassii (2015). Despite of the previous models which were based o the simple fiacial ratio, DEA focuses o the ratio of output/iput ad hece aalyzes the effectiveess accordigly. DEA is a icreasigly popular maagemet tool is commoly used to evaluate the efficiecy of a umber of producers. A typical statistical approach is characterized as a cetral tedecy approach ad it evaluates producers relative to a average producer I cotrast, DEA compares each producer with oly the "best" producers. By the way, i the DEA literature, a producer is usually referred to as a decisio makig uit or DMU. DEA is ot always the right tool for a problem but is appropriate i certai cases discussed as stregths ad limitatios of DEA. I DEA, there are a umber of producers. The productio process for each producer is to take a set of iputs ad produce a set of outputs. Each producer has a varyig level of iputs ad gives a varyig level of outputs. For istace, cosider a set of baks. Each bak has a certai umber of tellers, a certai square footage of space, ad a certai umber of maagers (the iputs). There are a umber of measures of the output of a bak, icludig umber of 114
2 checks cashed, umber of loa applicatios processed, ad so o (the outputs). DEA attempts to determie which of the baks are most efficiet, ad to poit out specific iefficiecies of the other baks. A fudametal assumptio behid this method is that if a give producer, A, is capable of producig Y A uits of output with X A iputs, the other producers should also be able to do the same if they were to operate efficietly. Similarly, if producer B is capable of producig Y B uits of output with X B iputs, the other producers should also be capable of the same productio schedule. Producers A, B ad others ca the be combied to form a composite producer with composite iputs ad composite outputs. Sice this composite producer does ot ecessarily exist, it is typically called a virtual producer. The heart of the aalysis lies i fidig the "best" virtual producer for each real producer. If the virtual producer is better tha the origial producer by either makig more output with the same iput or makig the same output with less iput the the origial producer is iefficiet. The subtleties of DEA are itroduced i the various ways that producers A ad B ca be scaled up or dow ad combied. Because of the advatages of this method, it has bee received much attetio ad therefore there ca be foud a rich literature i DEA area. 2- Data evelopmet aalysis I decisio makig area, the term DEA refers to a o-parametric techique aims at determiig the efficiecy of DMUs based o the iput/output aalysis. DEA suggests a more efficiet combiatio of iputs ad/or outputs to improve the efficiecy of a DMU. There are two geeral approaches i DEA models. The first is to reduce iputs i a costat level of outputs ad hece called iput based model. While the secod approach suggests icreasig the outputs i a costat level of iputs. I the other had, DEA is a liear programmig procedure for a frotier aalysis of iputs ad outputs. DEA assigs a score of 1 to a uit oly whe comparisos with other relevat uits do ot provide evidece of efficiecy i the use of ay iput or output. DEA assigs a efficiecy score less tha oe to (relatively) iefficiet uits. A score less tha oe meas that a liear combiatio of other uits from the sample could produce the same vector of outputs usig a smaller vector of iputs. The score reflects the radial distace from the estimated productio frotier to the DMU uder cosideratio. For a detailed descriptio, lets X i ad Y i be the iput ad output vector of i th DMU, respectively. Also X 0 ad Y 0 be the similar otatios for the DMU that we wat to determie its efficiecy. The, the iput based approach ca be modeled as follows: Mi θ i=1 λ i X i θx 0 (1) i=1 λ i Y i Y 0 λ i 0 Where, θ is the efficiecy of the DMU0 ad also λ i is iputs ad outputs weights. So, θ ad λ i are decisio variables. Aother type of DEA based o outputs is also available. Model 2 describes the mathematical programmig model of output based DEA. Max θ i=1 λ i Y i θy 0 (2) i=1 λ i X i X 0 λ i 0 The efficiecy of DMU with θ = 1 meaig that the uit is efficiet. Otherwise, if the value of θ is less tha 1, the correspodig DMU is cosidered as a iefficiet oe that is a liear combiatio with curret iputs ca be foud with more level of output. 3- Methodology of Baks rakig usig DEA 115
3 As metioed i sectio 1, the mai purpose of this research is to performace aalysis of some Iraia baks ad rakig them ad hereby facilitatig maager decisios to achieve a suitable level of efficiecy. For this aim, the items at below are cosidered to be obtaied after the research carried out: Determiig the efficiecy of each bak from operatioal ad beeficial aspects. Idicatig the iefficiet baks accordig to the experimets. Providig a bechmark guidelie for iefficiet baks accordig to the efficiet oes. Rakig the efficiet baks. This research cosiders two mai areas for determiig the efficiecies called operatioal ad beeficial aspects. Operatioal area, usually, focuses o bak visios ad costumers satisfactio of the bak ad the ext aspect, beeficial, teds to ivestigate those regardig ivestmets, beefits ad other fiacial viewpoits. This study cocetrates o five Iraia baks itroduced i Table 1. Table 1- List of baks Number Bak Name 1 Eqtesad Novi 2 Saderat 3 Pasargad 4 Parsia 5 Mellat Iput ad output variables are selected usig expert statemets. I some cases, two or more idices are combied to form a ew variable. The variables are demostrated i Figure 1 for both operatioal ad beeficial areas. Operatioal: Beeficial: Iputs 1- Staffs of electroic services 2- Iterest free costs 3- Iterest Costs Iputs 1- Deposits 2- Loas 3- Trasactios 4- Profits of complemetary services Outputs 1- Deposits 2- Loas 3- Trasactios Outputs 1- Iterest icomes 2- Iterest free icomes 4- Profits of complemetary services Figure 1- Iput ad output variables for operatioal ad beeficial areas Beside of the variables, the weights should also be iitialized. We applied a multi-attribute decisio makig scheme for this aim. I this regard, couple compariso matrix i aalytic hierarchical process (AHP) is used for comparig differet variables. Each matrix is filled by a expert ad the all weights are determied accordigly. Table 2 ad 3 show the obtaied weights for beeficial ad operatioal areas, respectively. Table 2- Iput ad output weights i beeficial area 116
4 Variable Deposits Loa Trasactios Profits of complemetary services Iterest icomes Iterest free icomes Weights Variable Staffs of electroic services Table 3- Iput ad output weights i operatioal area Iterest cost Iterest free cost Deposits Loa Trasactios services Weights After determiig the weights of iput ad output variables, the ext step iclude solvig DEA models with obtaied data ad aalyzig the results. The ext sectio cotais all umerical experimets ad such aalysis. 4- Numerical experimet ad model aalysis Durig the aforemetioed sectios, the methodology of the curret research was described. The curret sectio of this research is assiged to solve the DEA models for 5 itroduced baks ad rak them usig the efficiecy measure. All of the computatios i this sectio are doe usig LINGO 11.0 software o a system with 2.7GH CPU ad 4 GB of RAM. Because all models were solve withi a acceptable time, the CPU time is ot reported i umerical studies. Ivestigatig the DMUs should be partitioed ito the two mai subsectios oe of them discusses operatioal area, while the ext oe aalyzes the beeficial part of the work. The subsectios at below preset the obtaied DEA aalysis Operatioal ivestigatio This subsectio is ot aythig more tha a DEA aalysis usig the operatioal iputs/outputs ad rakig the uder study baks, accordigly. Rememberig that there were 7 factors icludig 3 iputs ad 4 outputs ad also recallig the weights oe ca easily use a dual model of BCC for ruig the experimetal study. The outcomig results for DMUs are appeared as Figure
5 Figure 2- The results for efficacy of DMU 1 i operatioal area If the value of objective fuctio is equal to 1, the the DMU is a techical efficiet uit. However, the less value implies that the DMU is o-techical oe. Accordig to the results, the objective fuctio is equal to which is a o-techical uit ad the value of iefficiecy is equal to This ivestigated DMU is Eqtesad Novi bak. Similar to this, other DMUs should be ivestigated by DEA model ad compared i terms of the efficiecy measure to provide a rakig scheme. Without less of geerality, we focus o efficiet/iefficiet measures ad igore the value of efficiecy. Table 4, outlies the baks i terms of the metioed measures Beeficial ivestigatio Table 4- Operatioal efficiecy of Baks Bak Name Status Eqtesad Novi Iefficiet Saderat Iefficiet Pasargad Iefficiet Parsia Efficiet Mellat Efficiet Similarly, for beeficial area such aalyzig procedure ca be doe to idicate the efficiecy of each bak. As a istace, Figure 3 illustrates the obtaied results of software for DMU
6 Figure 2- The results for efficacy of DMU 1 i beeficial area It is obvious that DMU 1 is ot efficiet i terms of the beeficial measures, meaig that the objective fuctio is ot equal to 1. The efficiecy of this uit ca be computed by iverse value of objective fuctio ad hece is equal to The value of iefficiecy is , accordigly. Table 5 demostrates a outlied report of the results. Table 5- beeficial efficiecy of Baks Bak Name Status Eqtesad Novi Iefficiet Saderat Iefficiet Pasargad Iefficiet Parsia Iefficiet Mellat Iefficiet I operatioal area, Parsia bak is efficiet. This efficiecy comes from this fact that there is a suitable level of icomes from automatic teller systems (ATM), iterest loas ad ivestmets i this bak. Also, all costs due to the admiistrative expeses are miimized. That is why Mellat bak is also a efficiet oe. However, i beeficial area, oe of the baks are efficiet. 5- Coclusio This paper, studied efficiecies of some fiacial istitutio usig a well-kow oparametric techique called DEA. For this aim, 5 baks were selected to ivestigate i terms of the operatioal ad beeficial aspects. The obtaied results showed that i operatioal area, two baks are efficiet while oe of them are efficiet i beeficial area. It was stated that miimizig the costs ad improvig the icomes ca establish a efficiet coditio. All of the baks has have bee raked based o their scores regardig the objective fuctio values. Refereces Baker, R.D., Chares, A., Cooper, W.W., Some models for estimatig techical ad scale iefficiecies i data evelopmet aalysis. Maag. Sci. 30 (9),
7 Chares, A., Cooper, W. W. Rhodes. E., Measurig the efficiecy of decisio makig uits, Eur. J. Oper. Res. 2(6), Cook, W.D., Seiford, L.M., Data evelopmet aalysis (DEA) - thirty years o. Eur. J. Oper. Res. 192 (1), Cooper, W.W., Seiford, L.M., Toe, K., Data Evelopmet Aalysis: a Comprehesive Text with Models, Applicatios, Refereces ad DEA-solver Software. Spriger, USA. Emrouzejad, A., Parker, B.R., Tavares, G., Evaluatio of research i efficiecy ad productivity: a survey ad aalysis of the first 30 years of scholarly literature i DEA. Socio Eco. Pla. Sci. 42 (3), Farrell, M.J., The measuremet of productive efficiecy. J. R. Stat. Soc. Ser. Ge. 120 (3), Kao, C., Liu, S. T., 2014, Multi-period efficiecy measuremet i data evelopmet aalysis: The case of Taiwaese commercial baks, Omega, 74, Kaur, S., Gupta, P. K., Productive Efficiecy Mappig of the Idia Bakig System Usig Data Evelopmet Aalysis, Proc. Eco. Fi., 25, Koopmas, T., Activity Aalysis of Productio ad Allocatio. Joh Wiley & Sos, USA. LaPlate, A. E., Paradi, J. C., 2015, Evaluatio of bak brach growth potetial usig data evelopmet aalysis, Omega. 52, Pareto, V., Mauel D'Ecoomie Politique. Paris, Frace. Tajbakhsh, A., Hassii, E., 2015, A data evelopmet aalysis approach to evaluate sustaiability i supply chai etworks, J. Clea. Prod., 105, Razavi Hajiagha, S. H., Hashemi, S. S., Amoozad Mahdiraji, H., Azaddel, J., 2015, Multi-period data evelopmet aalysis based o Chebyshev iequality bouds, Expert. Syst. Appl., 42(21),
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 informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationWhat 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 informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationA 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 informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationFuzzy Efficiency Measures in Data Envelopment Analysis Using Lexicographic Multiobjective Approach
Fuzzy Efficiecy Measures i Data Evelopmet Aalysis Usig Lexicographic Multiobjective Approach Adel Hatami-Marbii * Departmet of Strategic Maagemet ad Marketig Leicester Busiess School De Motfort Uiversity
More informationSolving 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 informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationAn 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 information3D 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 informationMaxDEA Pro 6. Manual
MaxDEA Pro 6 Maual CHENG Gag, QIAN Zhehua http://www.maxdea.c Email: MaxDEA@qq.com Cotets 1 Overview... 1 Features of MaxDEA Pro... 1 DEA Models available i MaxDEA Pro... 3 2 A Quick Guide... 6 System
More informationEvaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps
Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,
More informationAn 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 informationData Warehousing. Paper
Data Warehousig Paper 28-25 Implemetig a fiacial balace scorecard o top of SAP R/3, usig CFO Visio as iterface. Ida Carapelle & Sophie De Baets, SOLID Parters, Brussels, Belgium (EUROPE) ABSTRACT Fiacial
More informationAccuracy 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 informationGE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III
GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-
More informationNew 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 informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationPattern 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 informationSecond-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems
Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationProtected 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. 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 informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationMorgan 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 informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationSectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work
200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationCS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June
CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationA 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 informationBig-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 informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationEFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS
Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationBASED 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 informationCIS 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 informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationA 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 informationNew 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 informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationCounting 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 informationOctahedral 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 informationperformance to the performance they can experience when they use the services from a xed location.
I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationAn 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 information9.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 informationIdentification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.
Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's
More informationImproving 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 informationEnhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System
Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September 2014 173 Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System Hoda Baki Departmet of Electrical ad
More informationThe 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 informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationBig-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 informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationEvaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 14, No 4 Sofia 2014 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI: 10.1515/cait-2014-0008 Evaluatio of the Software Idustry
More informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More informationA 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 informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationAn 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 informationAnalysis 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 informationCubic 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 informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationIMP: 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 informationWhat are Information Systems?
Iformatio Systems Cocepts What are Iformatio Systems? Roma Kotchakov Birkbeck, Uiversity of Lodo Based o Chapter 1 of Beett, McRobb ad Farmer: Object Orieted Systems Aalysis ad Desig Usig UML, (4th Editio),
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationAnalysis of Algorithms
Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms
More informationAssignment 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 informationFuzzy 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 informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationAdministrative 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 informationCMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 11: More Caches Prof. Yajig Li Uiversity of Chicago Lecture Outlie Caches 2 Review Memory hierarchy Cache basics Locality priciples Spatial ad temporal How to access
More informationBOOLEAN 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 informationAlgorithms 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 informationCreating 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 informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationLU 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 informationOn Nonblocking Folded-Clos Networks in Computer Communication Environments
O Noblockig Folded-Clos Networks i Computer Commuicatio Eviromets Xi Yua Departmet of Computer Sciece, Florida State Uiversity, Tallahassee, FL 3306 xyua@cs.fsu.edu Abstract Folded-Clos etworks, also referred
More informationProbabilistic 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 informationRecursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:
Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationEmpirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.
Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig
More informationPruning 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