A QoS balancing model for Mobile Ad hoc Networks

Size: px
Start display at page:

Download "A QoS balancing model for Mobile Ad hoc Networks"

Transcription

1 A QoS balacig model for Mobile Ad hoc Networks HENG LUO, DAVID. I. LAURENSON, AI-HUANG GUO, JIANPING CHEN, PEIDE YANG, HUA JIANG Suzhou key laboratory of mobile etworkig ad applied techologies SuZhou Uiversity of Sciece ad Techology 1 # KeRui Road SuZhou, JiagSu, CHINA luoheg1981@163.com Abstract: -Quality of Service (QoS) provisio is required for MANETs i recet years to support the rapid growth of video i mobile traffic. I spite of umerous QoS routig s, litter literature, it is observed, discusses about the QoS balacig model with several QoS metrics cosidered simultaeously, which is realistic i real applicatios, due to various uits ad attributes of QoS metrics. A ew model, deoted by SAW-AHP, which is a combiatio of Simple Additive Weightig (SAW) ad Aalytic Hierarchical Process (AHP), is proposed i this paper to balace the competig QoS metrics. Despite of differet uits ad attributes of diverse QoS metrics, SAW-AHP is able to rak the alterative routig s reliably ad cosistetly by cosiderig the relative preferece of QoS metrics which is eglected by much literature. Key words: -Mobile ad hoc etwork; Routig Protocol; QoS; SAW-AHP; Mobile traffic; Simulatio 1 Itroductio A mobile ad hoc etwork (MANET) is a autoomous system of mobile odes that are free to move about arbitrarily. The possibility of establishig such etworks i places such as disaster relief sites ad coferece rooms, which are characterized by lack of prefixed ifrastructure, justifies the developmet of MANETs. QoS provisio was ot cosidered iitially i MANETs. However, with the rapid growig of video traffic which exceeds 50% of mobile traffic [1], QoS guaratee becomes ecessary, leadig to the existece of a collectio of QoS-aware routig s [2][3]. However, a umber of QoS metrics should be guarateed simultaeously i real applicatios ad some algorithms, it is observed, are able to support oly part of QoS metrics o the cost of others, resultig i the radom selectio of s i MANETs. I this paper, a ovel QoS metrics balacig model, deoted by SAW-AHP, which is a combiatio of the Simple Additive Weightig (SAW) [4] ad the Aalytic Hierarchical Process (AHP) [5], is proposed to balace QoS requiremets by cosiderig the relative importace of differet QoS metrics which is eglected by much literature. Extesive simulatios are performed to validate the efficiecy as well as reliability of the SAW-AHP model. For simulatio, versio 2.32 of the wellkow ope-source software NS-2 is used. This paper is orgaized as follows. Sectio 2 discusses the problems after simulatios. The third part provides the problem solutio method ad the fial sectio cocludes this paper. 2 Problem Formulatio The etwork performace of several mobile termials (MTs), which share a commo access poit to access the Iteret, as show i Fig.1, is studied as a example for the SAW-AHP model. The simulatio cofiguratios as well as results are itemized i Table 1 ad Table 2 respectively. Fig.1 Simulatio sceario E-ISSN: Volume 13, 2014

2 Table 1. Parameter Simulatio time Simulatio parameters Descriptio 3000s Simulatio rus 50 Number of odes 32 Node mobility patter Trasmissio rage Routig Traffic load Topology PDR (%) Table 2. Simulatio results Delay (ms) Radom Way Poit Model Jitter (ms) 25m ad 2 streams 100m*100m Thrput (Mb/s) EC (J/pkt) PDR: packet delivery ratio; Thrput: throughput; EC: eergy cost 2.1 Simulatio results ad aalysis As show i Table 2, outperforms i terms of packet delivery ratio ad eergy cost. Three factors cotribute to the success of. To begi with, iitiates the route discovery mechaism oly whe ecessary, avoidig the use of stale routes as well as periodic routig iformatio broadcast. Secodly, if a lik breaks dow i the data trasmissio process, the upstream ode may buffer the lost packets ad activate the local lik repair mechaism which icreases the umber of data packets that are able to be delivered. Last, but ot the least, broadcasts route iformatio packets periodically ad those packets may collide with data packets. However, outperforms i other three metrics, delay, jitter ad throughput. The key reaso for this is the proactive ature of. is able to establish route much more quickly by searchig routig tables which is updated periodically. Istead, iitiates a route discovery process o demad which takes more time. 2.2 Problem statemet For a etwork operator who strives to offer reliable packet delivery service, is better a solutio compared to. O the cotrary, for a time sesitive applicatio, is preferred. However, whe the umber of QoS-metrics icreases, just as i may real applicatios, the problem becomes much more complicated [6]. 3 Problem Solutio The proposed SAW-AHP model ivolves maily two steps as show i Fig.2. Hierarchical structure compositio Weights computatio Performace evaluatio Fig.2 Dyamic switch Adaptive process SAW-AHP diagram 3.1 Performace evaluatio Optimal selectio The performace evaluatio process ca be further divided ito three steps ad the first step is to decompose the decisio problem ito a hierarchy structure, composed of a objective layer, a criteria layer ad a alterative layer so that a hard problem ca be more easily uderstadable Hierarchy structure The objective i this paper is to balace five QoS metrics ad thus fid the optimal routig give the preferece of a umber of QoS metrics which are treated as criteria. For simplicity but without loss of geerality, two alteratives, which is a proactive routig, ad, which is a reactive are selected. Fig.3 shows the hierarchy structure with three layers, the objective layer, criteria layer ad alterative layer. Objective layer Criteria layer Alterative layer Rak alterative s PDR Delay Jitter Thruput EC Fig.3 Hierarchy structure Weights computatio Oce the hierarchy is built, the decisio makers compare elemets i a pair-wise fashio with predefied rules based o which the compariso matrices are obtaied Weight for QoS metric A decisio maker is assumed to be able to compare ay two elemets, say E i ad E j, at the same level of the hierarchy structure ad provide a umerical value e ij accordig to his/her preferece, e ij > 0 for ay i=1,2,, ad j=1,2,,. The reciprocal E-ISSN: Volume 13, 2014

3 property e ji =1/ e ij holds. The fudametal scales for pair-wise compariso could serve as a good basis ad they are itemized i Table 3. Table 3. Importace ad defiitio Importace Defiitio Explaatio 1 Equal importace Two elemets cotribute equally to the objective 3 Experiece ad Moderate judgmet slightly favour importace oe elemet over aother 5 Strog importace Experiece ad judgmet strogly favour 7 9 Very strog importace Extreme importace oe elemet over aother Oe elemet is favoured very strogly over aother; The evidece favourig oe elemet over aother is of the highest possible order of affirmatio Itesities of 2,4,6 ad 8 ca be used to express itermediate values. Prior to obtaiig the pair-wise compariso matrix for criteria, several assumptios are made for the relative importace of criteria i this paper. They are as follows: (I)Packet delivery ratio is moderately more importat tha delay; (II)Packet delivery ratio is moderately more importat tha jitter; (III)Packet delivery ratio ad throughput are equally importat; (IV)Packet delivery ratio is moderately more importat tha eergy cost; (V)Delay ad jitter are equally importat; (VI)Delay ad eergy cost are equally importat; (VII)Jitter ad eergy cost are equally importat; (VIII)Throughput is moderately more importat tha delay; (IX)Throughput is moderately more importat tha jitter; (X)Throughput is moderately more importat tha eergy cost. Oe thig to ote is that these parameters are applicatio depedet ad the choices here are for a specific applicatio sceario. Accordig to Table 3, the above 10 assumptios lead to the compariso matrix for criteria as follows PDR Delay C= Jitter Thrput EC PDR Delay Jitter Thrput EC / /3 1 1/ / / /3 1 where PDR, Thrput ad EC deote packet delivery ratio, throughput ad eergy cost respectively. There are several methods to derive weights from a compariso matrix of which Geometric Mea Method (GMM) is a straight forward ad reliable (1) alterative [7]. I GMM, the ormalized weight is computed firstly via 1 1 ω = ( ) / ( ) i a ij a ij j= 1 i =1 j= 1 (2) where a ij (i,j=1,2,,) deotes the value of ij th elemets i compariso Matrix (1) ad is umber of elemets i the row. Combiig Eq. (2) with Matrix (1), the ormalized weights for criteria are obtaied i Table 4. Table 4. Normalized weights for criteria Criteria PDR Delay Jitter Thruput EC Weight As observed, the weights for packet delivery ratio ad throughput are equal, idicatig the same importace of those two metrics. Delay, jitter ad eergy cost have the same weight which accouts for oe third of that for packet delivery ratio, revealig that they are less importat compared to packet delivery ratio. Qualitatively, a that has a better performace i terms of packet delivery ratio ad throughput is more likely to be selected. A decisio maker may give icosistet judgmets for the compariso matrix ad therefore SAW-AHP is desiged with capability of measurig the cosistecy based o the idea of cardial trasitivity. A matrix M is cosistet if ad oly if a ik a kj = a ij, where a ij is the ij th elemet i Matrix (1). However, this coditio ca rarely be satisfied i practice, especially i scearios with a large umber of criteria or alteratives. The violatio level of cosistecy chages with perso or cotext. I SAW-AHP, a metric Cosistecy Ratio (C.R.), developed by Satty [5], is employed to idicate the extet to which the cosistecy is violated as follows 1 ( Cω) i ( )/[( 1) ( RI..)] > 2 CR.. = i = 1 ωi 0 = 1, 2 where C ad ω i deote the pair-wise compariso matrix ad weight for the i th elemet respectively, represets the umber of elemets ad R.I. is the radom idex of a pair-wise compariso matrix that depeds o the umber of elemets i the matrix as itemized i Table 5. Table 5. Radom icosistecy idex (R.I.) Number of elemets Radom Idex (R.I.) (3) E-ISSN: Volume 13, 2014

4 The C.R. of Matrix (1) equals 0, idicatig that Matrix (1) is cosistet Weight for alteratives Istead of usig scales i [5], simulatio results obtaied i Table 2 are employed to costruct the pair-wise compariso matrices for alteratives for the sake of accuracy. However, the attributes ad uits of metrics are differet. Table 6 summarizes the attributes of metrics i this paper. As see, two metrics, packet delivery ratio ad throughput, are grouped ito the the larger the better category while the other three metrics, delay, jitter ad eergy cost, are allocated to the the smaller the better category. Table 6. Metric ad attributes Metric PDR Thruput Delay Jitter EC Attribute the larger the better the smaller the better I SAW-AHP, The value of the correspodig elemet i the pair-wise compariso matrix for alteratives equals (4) orm a = d / d ij i orm j orm where di = di/max{ di} for metrics that are the orm larger the better ad d i =mi{ di}/ di for the parameters that are the smaller the better. Criterio Table 7. Weights for alteratives Weights PDR Delay Jitter Thruput EC Table 7 itemizes the weights for alteratives uder differet metrics. As see, has larger weights i terms of packet delivery ratio ad eergy cost, idicatig its better performace over i those two metrics. O the cotrary, the weights for exceed those for i three other metrics, revealig s better performace i delay, jitter ad throughput. Sice there are oly two elemets i the compariso matrices for alteratives, those matrices are cosistet. 3. Sythetic weights The fial step is to sythesize the weights for criteria via (5) sω = cω ( i, j = 1,..., ) j i ij i= 1 where sω j deotes the sythetic weights for the j th alterative, c i symbolize weights for the i th metric ad ω ij represets the weight for the j th alterative uder the i th metric. The alterative with the largest sythetic weight is cosidered to the optimal oe. Table 8. Sythetic Weights Protocol Sythetic weight Rakig order > As show i Table 8, the weight of is larger tha. Therefore, is preferred i this case. 3.2 Adaptive process Based o the rakig order, is selected i this case. Four sets of simulatios are carried out as show i Fig.4 to validate the reliability as well as efficiecy of the adaptive process. Referece sim#1 sim#2 Fig.4 Referece sim#3 sim#4 Simulatios for validatio As show, both sim#1 ad sim#3 cotiue to employ the same whereas the other two switch to a differet. Sim#1 ad sim#2 are combied to determie the effect of switch from to whereas sim#3 ad sim#4 are combied to reveal the effectiveess of the switch to. The results are itemized i Table 9. Table 9. Simulatio results metric sim#1 sim#2 sim#3 sim#4 PDR (%) Delay (ms) Jitter (ms) Thruput (Mb/s) EC (J/pkt) Performace Improvemet Ratio A metric, the performace improvemet ratio deoted by PIR, is developed to specify the level of differece betwee two alteratives uder certai metrics. PIR is defied as the quotiet of the differece betwee the referece ad target s for a value of the referece. For E-ISSN: Volume 13, 2014

5 metrics that are the larger the better, PIR ref-tar is computed via PIR P P P target referece target ref tar = = 1 (6) P P referece referece where P target ad P referece deote the performace of the target ad referece s respectively. For the smaller the better metrics, PIR ref-tar is 1/ Ptarget -1/ Preferece PIRref tar = = P / P 1 (7) referece target 1/ P referece A positive PIR suggests the performace improvemet while a egative oe reveals the deterioratio. PIRs may be aggregated by cosiderig the weights for metrics i a applicatio via (8) AIRi = ci PIRi where AIR i deotes the aggregated improvemet ratio for the i th metric ad c i deotes the weight for i th metric. AIR reflects the impact of performace improvemet/deterioratio of a metric o the overall QoS satisfactio. AIRs are sythesized to obtai the sythetic improvemet ratio idex (SIRI) SIRI = AIR (9) i=1 A positive SIRI is desired sice it idicates system improvemet whe a target is selected. O the cotrary, a egative SIRI reveals performace deterioratio if the target is selected. Referece sim#1 sim#2 SIRI=0% SIRI=20.8% Fig.5 SIRI results i Referece sim#3 sim#4 SIRI=0% SIRI=-0.14% As see i Fig.5, a positive SIRI is achieved which demostrates the effectiveess of the switch from to. O the cotrary, whe replaces the origial, the overall performace deteriorates. Therefore, it is cocluded that is more suitable for the case of 2 traffic streams, which is idetical with results i Table 8. 4 Coclusio I spite of various attributes ad uits for differet QoS metrics, the proposed SAW-AHP is able to balace competig QoS metrics ad thus rak alterative s ad efficietly ad reliably. Based o the performace evaluatio results, the system is able to switch to the optimal adaptively. Extesive simulatios show that the performace of the whole etwork may improve as much as 20.8% by adoptig the SAW- AHP model. Despite oly oe case beig studied i this paper usig the SAW-AHP method, it is geeric to other cases with differet QoS requiremets. 5. Future work The SAW-AHP model is appropriate for scearios where the decisio maker is certai about his/her preferece o the performace metrics ad oly the average value is cosidered. I the future, the SAW- AHP model will be fuzzified to icorporate the stadard deviatio of simulatio results as well as the ucertaity of the decisio maker. Ackowledgemet The project was fuded by the State Key Laboratory of Advaced Optical Commuicatio Systems Networks ad Suzhou Sciece ad Techology Fud (SZS201304). Referece [1] Cisco visual etworkig idex: global mobile data traffic forecast update, , solutios /collateral/s341/ s525/s537/s705/s827/ white_paper_c pdf, 2013, pp [2] Bakht, H., Survey of Routig Protocols for Mobile Ad-hoc Network, Iteratioal Joural of Iformatio ad Commuicatio Techology Research, vol.1 No. 6, 2011, pp [3] Che, W. et al., A survey ad challeges i routig ad data dissemiatio i vehicular ad hoc etworks, Wireless Commuicatios ad Mobile Computig, vol.11 No.7, 2011, pp [4] Wag Y., A simple additive weightig method for timeseries multi-idices decisio makig ad its applicatios, Joural of systems egieerig ad electroics, vol.10, 1999, pp [5] Saaty, T. L. How to make decisio: The Aalytic Hierarchy Process, Europea Joural of Operatioal Research, vol.48, 1990, pp [6] Papadimitriou C. H., Computatioal Complexity, 1 st ed., Addiso-Wesley, USA, [7] Xu Z., O cosistecy of the weighted geometric mea complex judgemet matrix i AHP, Europea Joural of E-ISSN: Volume 13, 2014

6 Operatioal Research, vol.126 No.3, 2000, pp E-ISSN: Volume 13, 2014

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 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 information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive 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 information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 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 information

Evaluation scheme for Tracking in AMI

Evaluation 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 information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization 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 information

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

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

More information

Data diverse software fault tolerance techniques

Data 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 information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris 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 information

New HSL Distance Based Colour Clustering Algorithm

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

More information

Ones Assignment Method for Solving Traveling Salesman Problem

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

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

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

More information

3D Model Retrieval Method Based on Sample Prediction

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

More information

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection

Ontology-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 information

Cubic Polynomial Curves with a Shape Parameter

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

More information

Lecture 28: Data Link Layer

Lecture 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 information

How do we evaluate algorithms?

How 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 information

Octahedral Graph Scaling

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

More information

A QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services

A QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services A QoS Provisioig mechaism of Real-time Wireless USB Trasfers for Smart HDTV Multimedia Services Ji-Woo im 1, yeog Hur 2, Jog-Geu Jeog 3, Dog Hoo Lee 4, Moo Sog Yeu 5, Yeowoo Lee 6 ad Seog Ro Lee 7 1 Istitute

More information

Interference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks

Interference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks Iterferece Aware Chael Assigmet Scheme i Multichael Wireless Mesh Networks Sumyeg Kim Departmet of Computer Software Egieerig Kumoh Natioal Istitute of Techology Gum South Korea Abstract Wireless mesh

More information

The power of multi-objective calibration: Two case studies with SWAT

The power of multi-objective calibration: Two case studies with SWAT The power of multi-objective calibratio: Two case studies with SWAT Sader Huisma Thorste Pohlert, Lutz Breuer & Has-Georg Frede Justus-Liebig-Uiversität Gieße, Germay Istitut für Ladschaftsökologie ud

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

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

More information

Python Programming: An Introduction to Computer Science

Python 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 information

Assignment Problems with fuzzy costs using Ones Assignment Method

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

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology

More information

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

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

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

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

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

More information

A Study on the Performance of Cholesky-Factorization using MPI

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

More information

BASED ON ITERATIVE ERROR-CORRECTION

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

More information

BGP Attributes and Path Selection. ISP Training Workshops

BGP Attributes and Path Selection. ISP Training Workshops BGP Attributes ad Path Selectio ISP Traiig Workshops 1 BGP Attributes The tools available for the job 2 What Is a Attribute?... Next Hop AS Path MED...... p Part of a BGP Update p Describes the characteristics

More information

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

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

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

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

More information

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

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

More information

What are Information Systems?

What 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 information

BOOLEAN MATHEMATICS: GENERAL THEORY

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

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

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

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

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture 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 information

The identification of key quality characteristics based on FAHP

The identification of key quality characteristics based on FAHP Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP

More information

Big-O Analysis. Asymptotics

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

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 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 information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A 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 information

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE 14thNew Zealad Workshop 1992 NON-LNEAR MODELLNG OF A GEOTHERMAL STEAM PPE Y. Huag ad D. H. Freesto Geothermal stitute, Uiversity of Aucklad SUMMARY Recet work o developig a o-liear model for a geothermal

More information

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio

More information

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.

Identification 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 information

An Efficient Algorithm for Graph Bisection of Triangularizations

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

More information

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits: Itro Admiistrivia. Sigup sheet. prerequisites: 6.046, 6.041/2, ability to do proofs homework weekly (first ext week) collaboratio idepedet homeworks gradig requiremet term project books. questio: scribig?

More information

Introduction to OSPF. ISP Training Workshops

Introduction to OSPF. ISP Training Workshops Itroductio to OSPF ISP Traiig Workshops 1 OSPF p Ope Shortest Path First p Lik state or SPF techology p Developed by OSPF workig group of IETF (RFC 1247) p OSPFv2 stadard described i RFC2328 p Desiged

More information

Multi Attributes Approach for Tourist Trips Design

Multi Attributes Approach for Tourist Trips Design Multi Attributes Approach for Tourist Trips Desig Ilaria Baffo 1, Pasquale Caroteuto 2, Atoella Petrillo 3, Fabio De Felice 4 1 Idustrial Egieerig School (DEIM) - Uiversity of Tuscia, Italy ilaria.baffo@uitus.it

More information

INTERSECTION CORDIAL LABELING OF GRAPHS

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

More information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

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

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms 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 information

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System

Low 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 information

Lecture 13: Validation

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

More information

IS-IS in Detail. ISP Workshops

IS-IS in Detail. ISP Workshops IS-IS i Detail ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 27 th November

More information

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring 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 information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

A Hierarchical Load Balanced Fault tolerant Grid Scheduling Algorithm with User Satisfaction

A Hierarchical Load Balanced Fault tolerant Grid Scheduling Algorithm with User Satisfaction A Hierarchical Load Balaced Fault tolerat Grid Schedulig Algorithm with User Satisfactio 1 KEERTHIKA P, 2 SURESH P Assistat Professor (Seior Grade), Departmet o Computer Sciece ad Egieerig Assistat Professor

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile 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 information

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network A Algorithm of Mobile Robot Node Locatio Based o Wireless Sesor Network https://doi.org/0.399/ijoe.v3i05.7044 Peg A Nigbo Uiversity of Techology, Zhejiag, Chia eirxvrp2269@26.com Abstract I the wireless

More information

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,

More information

Python Programming: An Introduction to Computer Science

Python 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 information

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

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

More information

ANN WHICH COVERS MLP AND RBF

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

More information

Chapter 3 Classification of FFT Processor Algorithms

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

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

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

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

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

More information

Partition in mobile adhoc network with mobility-a new approach for effective use of fast IP address autoconfiguration

Partition in mobile adhoc network with mobility-a new approach for effective use of fast IP address autoconfiguration Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Partitio i mobile adhoc etwork with mobility-a ew approach for effective use of fast IP address autocofiguratio Mukesh Chad *, HL

More information

Lower Bounds for Sorting

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

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

Accuracy Improvement in Camera Calibration

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

More information

An Approach to Develop a Dynamic Job Shop Scheduling by Fuzzy Rule Based System and Comparative Study with the Traditional Priority Rules

An Approach to Develop a Dynamic Job Shop Scheduling by Fuzzy Rule Based System and Comparative Study with the Traditional Priority Rules America Joural of Egieerig ad Applied Scieces Origial Research Paper A Approach to Develop a Dyamic Job Shop Schedulig by Fuzzy Rule Based System ad Comparative Study with the Traditioal Priority Rules

More information

DCMIX: Generating Mixed Workloads for the Cloud Data Center

DCMIX: Generating Mixed Workloads for the Cloud Data Center DCMIX: Geeratig Mixed Workloads for the Cloud Data Ceter XigWag Xiog, Lei Wag, WaLig Gao, Rui Re, Ke Liu, Che Zheg, Yu We, YiLiag Istitute of Computig Techology, Chiese Academy of Scieces Bech 2018, Seattle,

More information

6.854J / J Advanced Algorithms Fall 2008

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

More information

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

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

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic 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 information

Fast Fourier Transform (FFT) Algorithms

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

More information

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems The Peta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems Abdulkarim Ayyad Departmet of Computer Egieerig, Al-Quds Uiversity, Jerusalem, P.O. Box 20002 Tel: 02-2797024,

More information

SOFTWARE usually does not work alone. It must have

SOFTWARE 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 information

performance to the performance they can experience when they use the services from a xed location.

performance 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 information

Design of efficient, virtual non-blocking optical switches

Design of efficient, virtual non-blocking optical switches Desig of efficiet, virtual o-blockig otical switches Larry F. Lid, Michael Sratt Mobile Systems ad Services Laboratory HP Laboratories Bristol HPL-200-239 March 3 th, 2002* otical switchig, switch desig

More information

Digital Microfluidic Biochips Online Fault Detection Route Optimization Scheme Chuan-pei XU and Tong-zhou ZHAO *

Digital Microfluidic Biochips Online Fault Detection Route Optimization Scheme Chuan-pei XU and Tong-zhou ZHAO * 2018 Iteratioal Coferece o Commuicatio, Network ad Artificial Itelligece (CNAI 2018) ISBN: 978-1-60595-065-5 Digital Microfluidic Biochips Olie Fault Detectio Route Optimizatio Scheme Chua-pei XU ad Tog-zhou

More information

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

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

More information

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

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

More information

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE Wiwik Aggraei 1, Agyl Ardi Rahmadi 1, Radityo Prasetyo Wibowo 1 1 Iformatio System Departmet, Faculty of Iformatio Techology, Istitut Tekologi Sepuluh

More information

DATA MINING II - 1DL460

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

More information

SERIAL COMMUNICATION INTERFACE FOR ESA ESTRO

SERIAL COMMUNICATION INTERFACE FOR ESA ESTRO Bulleti E708 rev0 7/06/0 SERIAL COMMUNICATION INTERFACE FOR - SERIES FEATURES Supply voltage: 90 40vac Supply frequecy: 40 70 Hz Max. absorbtio: 40W Operatig temperature: 0 50 C Storage temperature: -0

More information

The Value of Peering

The Value of Peering The Value of Peerig ISP/IXP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 25 th

More information

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

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

More information

Data Warehousing. Paper

Data 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 information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis 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 information

Which movie we can suggest to Anne?

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

More information

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

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

More information

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

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

More information

LU Decomposition Method

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

More information

Lecture 2: Spectra of Graphs

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

More information