Intelligent Water Drops (IWD) Algorithm for COQUAMO Optimization
|
|
- Wilfred Fletcher
- 5 years ago
- Views:
Transcription
1 Proceedigs of the World Cogress o Egieerig ad Computer Sciece Vol I WCECS, October -,, Sa Fracisco, USA Itelliget Water Drops (IWD) Algorithm for COQUAMO Optimizatio Abdulelah G. Saif, Safia Abbas, ad Zaki Fayed, Member, IAENG Abstract Software quality estimatio is oe of essetial aspects i software proects. Accurate quality estimates are ecessary for goodly developig software systems. May estimatio methods have bee proposed. Amog those methods, COQUAMO, the model used to estimate the quality of the software proect i defects/ksloc (or some other uit of size). Nowadays, estimatio models are based o eural etwork, the fuzzy logic modelig etc. for accurately estimate software developmet effort, time ad quality. As, eural etworks desig have ot clear guidelies ad fuzzy logic approach usage is more difficult, a meta-heuristic Itelliget Water Drops (IWD) algorithm ca offer some improvemets i accuracy for software quality estimatio. This work adapts the IWD algorithm for optimizig the curret of COQUAMO model to achieve more accurate estimatio of software developmet quality. The experimet has bee coducted o NASA software proects. This work is the first oe used to optimize COQUAMO. Idex Terms COQUAMO, IWD algorithm, Software quality estimatio I. INTRODUCTION A software proect that is completed o time, withi budget, ad delivers a quality product that satisfies users ad meets requiremets is said to be successful. However, may software proects fail. Oly a third of all software developmet proects were successful, i terms of they met budget, schedule, ad quality goals as a report give by the Stadish Group states []. Most proect fails usually are due to the plaig ad estimatio steps, ot due to the implemetatio steps. Several studies have bee doe durig the last decade, for fidig the reaso of the software proects failure. iteret sites were searched extesively by Galorath et al. who foud reasos for the software proect failures. Amog the foud reasos, isufficiet requiremets egieerig, poorly plaed proect, suddely decisios makig at the early stages of the proect ad iaccurate estimatios were the most importat reasos []. Therefore, accurate software cost, time ad quality estimatio is ecessary ad is critical to both developers ad customers. Software cost estimatio focuses Mauscript submitted July, ; revised July,. The authors gratefully ackowledge the support of Ai Shams Uiversity ad Yeme govermet i supportig them. Abdulelah Ghaleb Farha Saif is Ph.D studet at Ai Shams Uiversity, Egypt (phoe: 44; abdulelah.saif@gmail.com). Safia Abbas Mahmoed Abbas is lecturer at Ai Shams Uiversity, Egypt ( Safia_abbas@yahoo.com). Zaki Taha Ahmed Fayed is Emeritus Professor at Ai Shams Uiversity, Egypt ( ZFayed@hotmail.com). o the time ad the effort required to complete a software proect. Software cost estimatio starts at the proposal state ad cotiues throughout the life time of a proect []. The huma-effort occupies the large part of software developmet cost ad most cost estimatio methods focus o this aspect ad give estimates i terms of perso-moth [4]. Some software defects are uavoidable durig software developmet, eve if accurate plaig, well documetatio ad proper process cotrol are performed carefully. These software defects affect the quality of software product which might be the mai cause of proect failure []. Therefore, i order to maage budget, schedule ad quality of software proects, several software estimatio methods have bee developed. Amog those methods, COCOMO II is the most widely used model for estimatig the effort i persomoth ad the time i moths for the whole software proect ad also at differet stages, ad COQUAMO is the model used to estimate the quality of the software proect i terms of defects/ksloc (or some other uit of size). Nowadays, most estimatio models are based o eural etwork, geetic algorithm, the fuzzy logic modelig etc. for accurately estimate software developmet effort, time ad quality. As, eural etworks have ot clear guidelies for desig ad fuzzy logic approach usage is more difficult, the meta-heuristic itelliget water drops (IWD) algorithm ca offer some improvemets i accuracy for software quality estimatio. This work adapts the IWD algorithm for optimizig the curret of COQUAMO model to achieve more accurate estimatio of software developmet quality. The experimet has bee coducted o NASA software proects. This work is the first oe used to optimize COQUAMO. The rest of the paper is orgaized as follow: sectio II related works, sectio III COQUAMO model, sectio IV dataset descriptio, sectio V IWD algorithm, sectio VI results aalysis ad sectio VII discusses ad cocludes the paper. II. RELATED WORK There are may predictio models that ca be used to predict software defects such as machie learig based models (artificial eural etworks (ANN), Bayesia belief etworks (BBN), reiforcemet learig (RL), geetic algorithms (GA), geetic programmig (GP) ad decisio trees) [] ad fuzzy logic models [] etc. However each oe has its ow advatages ad disadvatages ad each oe ca be used for specific proects at differet stages []. Because COCOMO II is the most widely used ad stadard model for estimatig the effort i perso-moth ad the time i moths for a software proect at differet stages [4] ad COQUAMO [][] is a extesio of it, COQUAMO ISBN: ---- ISSN: - (Prit); ISSN: - (Olie) WCECS
2 Proceedigs of the World Cogress o Egieerig ad Computer Sciece Vol I WCECS, October -,, Sa Fracisco, USA model will deserve much attetio to improve it. Because today's proect quality evaluatio based o old of COQUAMO model may ot match the required accuracy, therefore by calibratio, the accuracy of results i this method will be icreased ad the aim of this research is to use IWD algorithm to optimize the curret COQUAMO model to achieve accurate software quality estimatio ad reduce the ucertaity of COQUAMO usig IWD algorithm. III. COQUAMO MODEL Costructive quality model (COQUAMO), which is show i figure, is a extesio of the existig costructive cost model (COCOMO II) ad cosists of two sub-models; defects itroductio (DI) sub-model ad defects removal (DR) sub-model. A. Defect Itroductio (DI) Sub-Model The DI sub-model s iputs iclude source lies of code ad/or fuctio poits FPs as the sizig parameter, adusted for both reuse ad breakage, ad a set of multiplicative DI-drivers divided ito four categories, platform, product, persoel ad proect. These DI-drivers are a subset of the cost parameters required as iput for COCOMO II. Developmet flexibility FLEX driver has o effect o defect itroductio ad thus here its values for ratig are set to. The decisio to use these drivers was take after the author did a extesive literature search ad did some behavioral aalyses o factors affectig defect itroductio. The outputs of DI sub-model are predicted umber of otrivial defects of requiremets, desig ad code itroduced durig developmet life cycle; where o-trivial defects iclude: Critical (causes a system crash or causes a serious damage or eopardizes persoel) High (causes impairmet of critical system fuctios ad o workaroud solutio exists) Medium (causes impairmet of critical system fuctio, though a workaroud solutio does exist). Based o expert-udgmet, a iitial set of values to each of ratigs of the DI-drivers that have a effect o the umber of defects itroduced ad overall software quality were proposed ad we are used them i our implemetatio. B. Defect Removal (DR) Sub- Model The aim of the defect removal (DR) model is to estimate the umber of defects removed by several defect removal activities, amely automated aalysis AUTA, people reviews PEER ad executio testig ad tools EXTT. The DR model is a post-processor to the DI model. Each of these three defect removal profiles removes a fractio of the requiremets, desig ad codig defects itroduced from DI model. Each profile has levels of icreasig defect removal capability, amely Very Low, Low, Nomial, High, 'Very High' ad Extra High with Very Low beig the least effective ad Extra High beig the most effective i defect removal. To determie the defect removal fractios (DRF) associated with each of the six levels (i.e. very low, low, omial, high, very high, extra high) of the three profiles (i.e. automated aalysis, people reviews, executio testig ad tools) for each of the three types of defect artifacts (i.e. requiremets defects, desig defects ad code defects), the author coducted a -roud Delphi ad we used the values of DRF resulted from -roud Delphi i our implemetatio. The iputs of DR sub-model iclude software size i thousad source lies of code KSLOC ad/or fuctio poits, defect removal profiles levels ad umber of otrivial defects of requiremets (Req), desig (Des) ad code (Code) from DI model. For more details about COQUAMO, see [] []. Software size estimate Software platform, product, persoel ad proect attributes Defect removal profile levels Fig.. Costructive quality model (COQUAMO). For each of the three artifacts: Estimated itroduced defects i requiremets: DI Req = A. (Size) B. ( DI Driver ) Re q ) () Estimated residual defects i Requiremets: DR Req = C. DI Req. ( DRF ) r Re q () r Estimated itroduced defects i desig: DI Des =A. (Size) B. Estimated residual defects i desig: ( DI Driver ) Des ) () DR Des =C. DI Des. ( DRF ) rdes (4) r Estimated itroduced defects i code: DI Code =A. (Size) B. COQUAMO Defect Itroductio Sub-Model Defect Removal Sub- Model Estimated residual defects i code: Number of residual defects (Defect desity per uits of size) ( DI Driver ) Code ) () DR Code =C. DI Code. ( DRF ) rcode () r A, A, A, C, C ad C are the multiplicative calibratio costats for each artifact. Size is the size of the software proect measured i terms of KSLOC (thousads of source lies of code, fuctio poits FPs or ay other uit of size), here KSLOC is coverted to FPs as software size ISBN: ---- ISSN: - (Prit); ISSN: - (Olie) WCECS
3 Proceedigs of the World Cogress o Egieerig ad Computer Sciece Vol I WCECS, October -,, Sa Fracisco, USA measure by assumig c laguage is used for implemetatio. B, B ad B accout for ecoomies / disecoomies of scale. (DI-driver)Req, (DI-driver)Des ad (DIdriver)Code are the defect itroductio driver for each artifact ad the th factor. r = to for each DR profile, amely automated aalysis, people reviews, executio testig ad tools. DRF rreq, DRF rdes ad DRF rcode are Defect Removal Fractio for defect removal profile r ad artifact type (Req, Des ad Code). IV. DATASET DESCRIPTION Experimets have bee coducted o NASA data set foud i []. The dataset cosist of completed proects with its size i kilo lie of code (KLOC) ad actual quality i defects/ KLOC. Here KSLOC is coverted to FPs as software size measure by assumig c laguage is used for implemetatio. Multipliers (DI-Drivers) ad scale factors ratig from Very Low to Extra High are also give i the dataset. Defects removal activities levels (ratigs) are ot foud i NASA dataset, so the ratigs are assumed to be of Nomial ratig. I this data set, there is o classificatio of defects ito requiremets (Req), desig (Des) ad Code (Code) defects, So the total defects of each proect i the dataset are coverted ito Req, Des ad Code defects accordig to Joes report [] such that documetatio defects =. per fuctio poit FP, requiremets defects= per FP, desig defects =. per FP, code defects=. per FP ad bad fixes defects=.4. Therefore, Req, Des ad Code defects for each proect (Pr ) i the data set are calculated as follow: Pr Req defects = Pr Des defects= Pr Code defects= total defects of Pr total defects of Pr total defects of Pr *(+.) () *(.+.) () *(.+.) () Where, documetatio defects are divided equally amog artifacts by assumptio (. for each). is a factor of c laguage to covert SLOC ito FPs. Bad fixes defects are related to DI-drivers. V. INTELLIGENT WATER DROPS (IWD) ALGORITHM I ature, flowig water drops are mostly see i rivers, which form huge movig swarms. The paths that a atural river follows have bee created by a swarm of water drops. while a atural water drop flows from oe poit of a river to the ext poit i the frot, Three chages occur durig this trasitio: the water drop velocity is icreased, the water drop soil is icreased, ad i betwee these two poits, soil of the river s bed is decreased. Based o these observatios, the Itelliget Water Drops have bee itroduced. These Itelliget Water Drops or IWDs flow i a graph of a give optimizatio problem. The, the resultig effect is that the best solutio is obtaied for the problem [, ]. A. Assumptio ad Represetatio IWD is basically developed for combiatorial optimizatio problems, with oly oe paper [] modifies it to be used for cotiuous optimizatio problems by usig the biary codig of edges. To use IWD for cotiuous optimizatio problems such as optimizig the COQUALMO model ad maitaiig the origial structure of IWD, the of COQUALMO model, A, B, C, A, B, C, A, B ad C, are assumed to be represeted by the graph by addig virtual odes umbered from to ad coectig those odes to each coefficiet as i figure, where i= soil soil soil soil soil soil A i Fig.. Coefficiets represetatio. B i Each of above ie is expressed by 4 digits which are chose amog digits by IWD algorithm accordig to miimum probabilities. First digit is itegral part of a coefficiet ad the remaiig are fractios part. The soils are placed o the edges betwee ad digits as i the figure. B. The Proposed IWD Algorithm To optimize the COQUALMO model, The mai steps of proposed IWD algorithm are i figure. VI. RESULT ANALYSIS IWD parameters iitial values: Number of IWDs=, Iitial Soil=, velocity=, local ad global soil updatig parameters=., a v =,b v =., c v =,a s =,b s =. ad c s =. The best result is achieved usig iteratios, ad a solutio set is received from which the best solutio is chose i.e. a solutio with the best fitess fuctio value (FitessAll). The fial best solutio obtaied for are: Accordig to this solutio, the resultig optimized COQUALMO model are the followig: A=.4, B=., C=., A=.4, B=., C=., A=.4, B=.ad C=.. Curret COQUALMO model are all equal. Tables, table I ad table II, show the compariso amog actual ad estimated Req, Des ad Code defects/fp obtaied from COQUALMO model usig its curret ad usig optimized by IWD, respectively for the first te proect dataset with their estimated proect size. Table III shows the compariso amog the actual ad estimated Req, Des ad Code defects/fp for the first te proect dataset usig optimized ad curret COQUAMO model with their estimated proect size. The graphical compariso described i table I ad table II is show i figure 4 ad figure, respectively. The graphical compariso described i table III is show i figure, figure ad figure. Ci ISBN: ---- ISSN: - (Prit); ISSN: - (Olie) WCECS
4 Proceedigs of the World Cogress o Egieerig ad Computer Sciece Vol I WCECS, October -,, Sa Fracisco, USA. Set parameters ad determie dataset. Iitialize the soils of virtual edges betwee ad their digits.. While (termiatio coditio ot met) do 4. IWDs are placed o the first ode A ad move to the ext util ode C is reached.. IWDs choose 4 digits amog digits as values for all accordig to miimum probabilities ad add the digits to their visited lists. If there is o improvemet i oe of the fitess fuctios (FitessCode) i step, IWDs choose 4 digits for each coefficiet radomly.. IWDs update their velocity. IWDs update soils o edges betwee ad chose digits ad load some soils accordig to IWD algorithm equatio 4 i [].. Each IWD i calculate estimated Req, Des ad Code defects for each proect i the dataset usig the values of chose by them.. Each IWD i calculates Magitude of Relative Error (MRE) for each proect, the equatio used for Req, Des ad Code, respectively are: FitessReqi = ActualReq EstimatedReqi / ActualReq () FitessDesi = ActualDes EstimatedDesi / ActualDes () FitessCodei = ActualCode EstimatedCodesi / ActualCode (). The fitess fuctios (Mea Magitude of Relative Error MMRE) for each artifact are calculated as the average value of all proects specific fitess values calculated durig steps ad which depeds o the differece betwee real ad estimated Req, Des ad Code defects. So, the fitess fuctios values should be miimized. FitessReq = / * FitessDes = / * FitessReqi () FitessDesi (4) FitessCode = / * FitessCodei () FitessAll=(FitessReq+FitessDes+FitessCode)/ (). Fid the iteratio best solutio (optioal).. Update the soils of virtual edges that form curret best solutio accordig to IWD equatio i [] (optioal).. ed while. 4. Retur the values of ad the estimated Req, Des ad Code defects. i - the IWD umber, the proect umber, ActualReq - is actual software Req defects, EstimatedReqi - is the estimated software Req defects, usig IWD i, ActualDes - is actual software Des defects, EstimatedDesi - is the estimated software Des defects, usig IWD i, ActualCode - is actual software Code defects ad EstimatedCodesi - is the estimated software Code defects, usig IWD i. Fig.. Proposed IWD algorithm. Pr. No TABLE I: ESTIMATED DEVELOPMENT DEFECTS VALUES BY CURRENT COQUAMO COEFFICIENTS FPs Actual Req Defects/FP Req Defects /FP Calculated by Curret COQUAMO Des Defects/FP Calculated by Curret COQUAMO Code Defects /FP Calculated by Curret COQUAMO TABLE II: ESTIMATED DEVELOPMENT DEFECTS VALUES BY OPTIMIZED IWD COEFFICIENTS Pr_No FPs Actual Req Defects/FP Req Defects/FP Calculated by Optimized IWD Des Defects/FP Calculated by Optimized IWD Code Defects /FP Calculated by Optimized IWD ISBN: ---- ISSN: - (Prit); ISSN: - (Olie) WCECS
5 Proceedigs of the World Cogress o Egieerig ad Computer Sciece Vol I WCECS, October -,, Sa Fracisco, USA Pr_No TABLE III: COMPARISON AMONG REQ, DES AND CODE DEFECTS VALUES VS. SIZE BY IWD AND COQUAMO 4 FPs Compariso amog actual ad COQUAMO Req,Des ad Code defecs values vs estimated proect size i FPs.. Actual Req Defects/FP Req Defects /FP Calculated by Optimized IWD Req Defects/FP Calculated by Curret COQUAMO Proect Size (FPs)... Des Defects/FP Calculated by Optimized IWD Des Defects/FP Calculated by Curret COQUAMO Fig. 4. Compariso amog defects values by COQUAMO Code Defects/FP Calculated by Optimized IWD Actual Req Defects/FP Code Defects /FP Calculated by Curret COQUAMO Req Defects /FP Calculated by Curret COQUAMO Des Defects/FP Calculated by Curret COQUAMO Code Defects /FP Calculated by Curret COQUAMO 4 Compariso amog actual ad optimized Req,Des ad Code defecs values vs estimated proect size i FPs Actual Req Defects Proect Size (FPs) Fig.. Compariso amog defects values by IWD. 4 Req Defects Calculated Actual Des Defects Des Defects Calculated Actual Code Defects Code Defects Calculated Compariso amog actual,optimized ad COQUAMO Req defecs values vs estimated proect size i FPs Proect Size (FPs).. Actual Req Defects Req Defects Calculated Req Defects Calculated by Curret COQUAMO Fig.. Compariso amog Req defects values by IWD ad COQUAMO. 4 Compariso amog actual,optimized ad COQUAMO Des defecs values vs estimated proect size i FPs Proect Size (FPs).. Actual Des Defects Des Defects Calculated Des Defects Calculated by Curret COQUAMO Fig.. Compariso amog Des defects values by IWD ad COQUAMO. 4 Compariso amog actual,optimized ad COQUAMO Code defecs values vs estimated proect size i FPs Proect Size (FPs).. Actual Code Defects Code Defects Calculated Code Defects Calculated by Curret COQUAMO Fig.. Compariso amog Code defects values by IWD ad COQUAMO. Table IV compares the MMRE (Mea Magitude of Relative Error) ad PRED (.) (predictio (.) which shows the performace of IWD ad COQUAMO i estimatig the Req, Des ad Code defects for the whole dataset. ISBN: ---- ISSN: - (Prit); ISSN: - (Olie) WCECS
6 Proceedigs of the World Cogress o Egieerig ad Computer Sciece Vol I WCECS, October -,, Sa Fracisco, USA MMRE = * MRE = Actual - Estimated Actual Actual - Estimated Actual () () PRED (p) = k / () k is the umber of proects where MRE is less tha or equal to p, ad is the total umber of proects. The graphical compariso described i table IV is show i figure. TABLE IV: PERFORMANCE MEASURE COMPARISON Results IWD COQUAMO MMRE_Req.4. MMRE_Des..4 MMRE_Code..44 Total MMRE.4.4 PRED_Req (.). PRED_Des (.).4 PRED_Code (.).4.4 Total PRED (.)..... MMRE_Req MMRE_Des MMRE_Code Performace Compariso Total MMRE PRED_Req (.) PRED_Des (.) Fig.. Performace measure compariso. PRED_Code (.) Total PRED (.) IWD COQUAMO From table IV ad figure, the MMRE of IWD for Req, Des ad Code defects is lower tha that of COQUAMO ad PRED(.) of IWD for Req, Des ad Code defects is larger tha that of COQUAMO. It shows clearly that optimized by IWD algorithm produces more accurate results tha the old. So, IWD algorithm ca offer some sigificat improvemets i accuracy ad has the potetial to be a valid additioal tool for the software quality estimatio curret COQUAMO model. The results show that, i the sample proects take from the dataset, the results obtaied usig the optimized with the proposed algorithm are better tha the oes obtaied usig the curret. The results also show that i the sample proects take from the dataset, the results obtaied usig the optimized with the proposed algorithm are close to the real defects values. The results also show that i the whole dataset, the MMRE of IWD is less tha that of COQUAMO ad PRED(.) is larger tha that of COQUAMO. I the future work or the ext paper, we adapt PDBO algorithm for optimizig the of COQUAMO ad compare it with IWD algorithm. REFERENCES [] Gary B. Shelly, Harry J. Roseblatt, Systems Aalysis ad Desig Nith Editio, Shelly Cashma Series,. [] Vahid Khatibi, Dayag N. A. Jawawi, Software Cost Estimatio Methods: A Review, Volume No., Joural of Emergig Treds i Computig ad Iformatio Scieces,. [] Sweta Kumari, Shashak Pushkar, Performace Aalysis of the Software Cost Estimatio Methods: A Review, Iteratioal Joural of Advaced Research i Computer Sciece ad Software Egieerig, Volume, Issue, July. [4] Astha Dhima, Chader Diwaker, Optimizatio of COCOMO II Effort Estimatio usig Geetic Algorithm, America Iteratioal Joural of Research i Sciece, Techology, Egieerig & Mathematics,, [] Nasa dataset cotais effort ad defect iformatio available at dem/asa-dem.arff. [] Hamed Shah-Hosseii, The itelliget water drops algorithm: a ature-ispired swarm-based optimizatio algorithm, It. J. Bio- Ispired Computatio, Vol., Nos. /,. [] Priti Aggarwal, Jaspreet Kaur Sidhu, Harish Kudra, applicatios of itelliget water drops, IISRO, Multi-Coferece, Bagkok,. [] Hamed Shah-Hosseii, A approach to cotiuous optimizatio by the Itelliget Water Drops algorithm, 4th Iteratioal Coferece of Cogitive Sciece (ICCS ) [] Mrial Sigh Rawat, Saay Kumar Dubey, Software Defect Predictio Models for Quality Improvemet: A Literature Study, IJCSI Iteratioal Joural of Computer Sciece Issues, Vol., Issue, No, September. [] Suita Chulai, results of Delphi for the defects itroductio model (sub-model of the cost/quality model extesio to COCOMO II), Ceter for software egieerig,. [] Suita Chulai ad Barry Boehm, Modelig Software Defect Itroductio ad Removal: COQUALMO (Costructive Quality Model), USC - Ceter for Software Egieerig, Los Ageles, CA -,. [] Capers Joes, software defect origi ad removal methods, Draft., December,. VII. DISCUSSION ad CONCLUSION This paper adapts IWD algorithm for optimizig COQUAMO. The proposed algorithm is tested o NASA dataset ad the obtaied results are compared with the oes obtaied usig the curret COQUAMO model. The proposed model is able to provide good estimatio capabilities. It is cocluded that By havig the appropriate statistical data describig the software developmet proects, IWD based ca be used to produces better results i compariso with the results obtaied usig the ISBN: ---- ISSN: - (Prit); ISSN: - (Olie) WCECS
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 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 informationA Novel Hybrid Algorithm for Software Cost Estimation Based on Cuckoo Optimization and K-Nearest Neighbors Algorithms
Egieerig, Techology & Applied Sciece Research Vol. 6, No. 3, 26, 8-22 8 A Novel Hybrid Algorithm for Software Cost Estimatio Based o Optimizatio ad K-Nearest Neighbors Algorithms Elaz Eskadaria Miadoab
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 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 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 informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationAn Estimation of Distribution Algorithm for solving the Knapsack problem
Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,
More informationEMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL
Iteratioal Joural of Iformatio Techology ad Kowledge Maagemet July-December 2012, Volume 5, No. 2, pp. 371-375 EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL
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 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 informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
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 informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
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 informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationA Model for Estimation of Efforts in Development of Software Systems
A for Estimatio of Efforts i Developmet of Software Systems Parvider S. Sadhu, Maisha Prashar, Pourush Bassi, ad Atul Bisht Abstract Software effort estimatio is the process of predictig the most realistic
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More 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 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 informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationData-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps
Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas
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 informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
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 informationFuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms
Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
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 informationOntology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection
2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,
More informationApplying Fuzzy ID3 Decision Tree for Software Effort Estimation
www.ijcsi.org 131 Applyig Fuzzy ID3 Decisio Tree for Software Effort Estimatio Ali Idri 1 ad Saaa Elyassami 1 1 Departmet of Software Egieerig ENSIAS, Mohammed Vth Souissi Uiversity, BP. 713, Madiat Al
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 informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
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 informationReal-time Path Prediction and Grid-based Path Modeling Method Using GPS
Iteratioal Joural of Applied Egieerig Research ISSN 0973-4562 Volume 12, Number 20 (2017) pp. 9997-10001 Research Idia Publicatios. http://www.ripublicatio.com Real-time Path Predictio ad Grid-based Path
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
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 information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
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 informationPerformance Comparisons of PSO based Clustering
Performace Comparisos of PSO based Clusterig Suresh Chadra Satapathy, 2 Guaidhi Pradha, 3 Sabyasachi Pattai, 4 JVR Murthy, 5 PVGD Prasad Reddy Ail Neeruoda Istitute of Techology ad Scieces, Sagivalas,Vishaapatam
More informationComputer Systems - HS
What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic
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 informationLow Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More 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 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 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 informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More 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 informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationKeywords Software Architecture, Object-oriented metrics, Reliability, Reusability, Coupling evaluator, Cohesion, efficiency
Volume 3, Issue 9, September 2013 ISSN: 2277 128X Iteratioal Joural of Advaced Research i Computer Sciece ad Software Egieerig Research Paper Available olie at: www.ijarcsse.com Couplig Evaluator to Ehace
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
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 informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationIntrusion Detection using Fuzzy Clustering and Artificial Neural Network
Itrusio Detectio usig Fuzzy Clusterig ad Artificial Neural Network Shraddha Suraa Research Scholar, Departmet of Computer Egieerig, Vishwakarma Istitute of Techology, Pue Idia shraddha.suraa@gmail.com
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationn Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis
Overview Chapter 6 Writig a Program Bjare Stroustrup Some thoughts o software developmet The idea of a calculator Usig a grammar Expressio evaluatio Program orgaizatio www.stroustrup.com/programmig 3 Buildig
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 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 informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationSOFTWARE usually does not work alone. It must have
Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad
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 informationx x 2 x Iput layer = quatity of classificatio mode X T = traspositio matrix The core of such coditioal probability estimatig method is calculatig the
COMPARATIVE RESEARCHES ON PROBABILISTIC NEURAL NETWORKS AND MULTI-LAYER PERCEPTRON NETWORKS FOR REMOTE SENSING IMAGE SEGMENTATION Liu Gag a, b, * a School of Electroic Iformatio, Wuha Uiversity, 430079,
More informationAn improved support vector machine based on particle swarm optimization in laser ultrasonic defect detection
A improved support vector machie based o particle swarm optimizatio i laser ultrasoic defect detectio School of Sciece, North Uiversity of Chia, aiyua, Shaxi 35, Chia xut98@63.com,hhp9@63.com,xywag@6.com,43497@qq.com
More informationDETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION
Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme
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 informationHADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING
Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is
More informationParallel Learning of Large Fuzzy Cognitive Maps
g Proceedigs of Iteratioal Joit Coferece o Neural Networks, Orlado, Florida, USA, August 2-7, 07 Parallel Learig of Large Fuzzy Cogitive Maps Wojciech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy
More informationUsing a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations
Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag
More 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 informationAnalysis of Documents Clustering Using Sampled Agglomerative Technique
Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based
More 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 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 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 informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
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 informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationHeuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)
Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -
More informationInvestigating methods for improving Bagged k-nn classifiers
Ivestigatig methods for improvig Bagged k-nn classifiers Fuad M. Alkoot Telecommuicatio & Navigatio Istitute, P.A.A.E.T. P.O.Box 4575, Alsalmia, 22046 Kuwait Abstract- We experimet with baggig knn classifiers
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More informationSpeeding-up dynamic programming in sequence alignment
Departmet of Computer Sciece Aarhus Uiversity Demark Speedig-up dyamic programmig i sequece aligmet Master s Thesis Dug My Hoa - 443 December, Supervisor: Christia Nørgaard Storm Pederse Implemetatio code
More informationImage based Cats and Possums Identification for Intelligent Trapping Systems
Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
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 informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
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 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 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 informationGuide to Applying Online
Guide to Applyig Olie Itroductio Respodig to requests for additioal iformatio Reportig: submittig your moitorig or ed of grat Pledges: submittig your Itroductio This guide is to help charities submit their
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 informationBE Software Upgrades to ITALYCS 5. It s in the. Software
BE Software Upgrades to ITALYCS 5 It s i the Software UPGRADES WE OFFER Brampto Egieerig is offerig customers with ITALYCS 2 ad ITALYCS 4 systems the opportuity to upgrade their existig systems to the
More information