IP Network Design by Modified Branch Exchange Method

Size: px
Start display at page:

Download "IP Network Design by Modified Branch Exchange Method"

Transcription

1 Received: June 7, IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management Science, Nakhon Pathom Rajabhat Univesity, Thailand * Coesponding autho s k.natchamol@hotmail.com Abstact: One popula IP netwok outing potocol is OSPF (Open Shotest Path Fist), which uses algoithms to find its own path by calculating the path with the least weight fom souce to destination. As a esult, the design and outing of the data flow may not meet the equiements. To meet the efficiency of cable installation and outing, the Banch fo netwok design pocess was applied. With the ability to select the numbe of links to be exchanged with othes, we can tade-off between the design efficiency and the pocessing time. We used the ability of the Banch method to detemine a netwok with an efficient taffic flow distibution. We calculated the end-to-end delay time using the M/M/ model, then analyzed the netwok design efficiency of 8- and 9-node netwoks compaed to the Simplex method. Fo 8-, 9-, and 0-node netwoks, we compaed the MENTOR-II method to taffic flow and netwok complexity. The esults showed that the efficiency of the Banch method in tems of delay and cost closely align to the Simplex method but with faste calculation time. Howeve, moe exchange links () means a pocessing time close to the Simplex method. Keywods: Banch exchange, IP netwok design, Weight exchange. Intoduction The Intenet is a vey impotant technology and necessay fo connecting woldwide netwoks togethe. The devices that ae used to connect netwoks ae called outes. The cuent widely popula outing potocol is OSPF (Open Shotest Path Fist), which has many embedded advantages, such as using Dijksta s algoithm to find the shotest oute by itself, ecognizing change in the topology patten, and quickly updating the netwok s oute. Howeve, because OSPF outes use this algoithm to find thei own paths with the shotest outes, the taffic flow may not match the oveall needs of some flow paths. In addition, the efficiency and cost of netwok cable installation ae the most impotant factos to be consideed. Most netwok design algoithms ae faily complex, such as the Simplex linea pogamming method and the Banch method. The simple Banch method [] equies a complexity of O(N 5 ), whee N is the numbe of nodes, which is pohibitive fo modeating to lage netwoks. Howeve, as the Intenet becomes the lifeline to business and commecial applications, one must be awae of seveal issues in designing lage data netwoks (i.e., Intenet Sevice Povides backbone). One of the most impotant is that the IP netwok is a datagam netwok in which the outing potocols oute taffic ove the path with the shotest distance that is, the sum of link weights. Howeve, the link weight setting fo an optimum outing patten is a complex poblem that is possibly unfeasible [2-3]. Sidhaan, Gúein, and Diot [4] exploed the tade-off that exists between pefomance and the ovehead associated with the additional configuation steps fo IP netwoks. Sqalli, Sait, and Asadullah [5] engineeed a Tabu Seach Iteative heuistic using two diffeent implementation stategies to solve the OSPF weight setting poblem fo link failue scenaios. But these conventional techniques ae only the IP taffic assignment algoithms fo existed netwoks which cannot be used to design IP netwoks. Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, 207

2 Received: June 7, The least complex and high-speed heuistic netwok design algoithm is MENTOR (Mesh Netwok Topological Optimization and Routing [6], which selects a link to be installed as assigned taffic flows ove it. MENTOR is often used to design vitual cicuit packet switching netwoks, such as Fame Relay, ATM, and MPLS. Afte that, Cahn [7] poposed a modified vesion of MENTOR called MENTOR-II in which appopiate link weights ae assigned to the installed links such that the taffic always outes to the path with minimum distance and can be applied to IP netwoks. Howeve, both MENTOR and MENTOR-II give a good pefomance by using some value of the design paametes [8-9]. Banch [0] is a distibuted design method which consists of adding, dopping, o exchanging links to achieve bette pefomance. In ode to detemine the efficiency and costeffectiveness of cable installation and taffic outing, we applied ou modified Banch method fo IP netwok design to get the advantage of the ability to adjust between the design efficiency and the pocessing time of the design pocess. 2. Modified banch exchange method Banch is a distibuted design method that can be applied to IP netwok design. It stats by connecting the station with any topology and then adding, dopping, o exchanging links to achieve bette pefomance though a link exchange called pemutation. Thus, the default link weights ae assigned and exchanged to achieve bette pefomance, as shown in Fig.. An oveview of the modified Banch method is shown in Fig.. It stats with the following use s equiements: () The numbe of netwok nodes. (2) The node degee, which is the atio of the numbe of signal lines to the numbe of nodes. (3) Taffic equiement to flow between the two nodes. (4) Umax, which is the maximum acceptable taffic utilization of links. (5) Umin, which is the minimum acceptable taffic utilization of links. The initial netwok with default weight links is ceated with the node degee equied fom the use. The netwok links ae then exchanged to get the best netwok delay. Finally, the link weights ae exchanged to get the best netwok with the best link weights. The initial netwok ceation pocess begins by installing links between node pais with the most taffic equiements in ode to meet the equied node degee. Then the links load, suitable bandwidth, and delay cost ae calculated. If thee is any beach of utilization conditions, links with beach of conditions must be dopped and the link with the next lagest taffic equiement will be added instead until the netwok meets the use s node degee. The links bandwidth exchange pocess stats by calculating each link s netwok load and exchanging each link s bandwidth, which has the -ank highest taffic load with othe links. When each new netwok is ceated by the links bandwidth exchange pocess, then the new delay cost and the links netwok load is calculated. But if thee is any link with beach of utilization conditions, this netwok will be dopped. Afte calculating all foms of exchange, the netwok with the least delay cost is selected; if thee is not an acceptable netwok, a netwok with minimal condition violations is chosen to be the solution. Stat Requiements and design paametes Ceate an initial netwok links link weights Optimized netwok End Figue. Oveview of the Banch method Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, 207

3 Received: June 7, Afte the solution netwok is ceated by the links bandwidth exchange pocess, a default weight is assigned to each link. But if the default weight is not suitable fo the solution netwok, then we used a link s weight exchange pocess to poduce a suitable link weight fo each link. We begin by calculating each link s netwok load and exchanging each link s weight, which has the -ank highest taffic load with the othe links. When each new netwok is ceated by the links weight exchange pocess, then the new delay cost and the links netwok load is calculated. But if thee is any beach of utilization conditions, this netwok will be dopped. Afte calculating all foms of exchange, the netwok with the least delay cost is selected; if thee is not an acceptable netwok, a netwok with minimal condition violations is chosen to be the final solution. Finally, the output netwok consists of the following: () Good link connections and bandwidths among nodes. (2) Link weights, which allow fo efficient OSPF outing. (3) Total delay cost of the netwok. (4) Oveall time involved in the pocess. (5) Installation cost of the netwok. 3. Expeimental design We conducted an expeiment to compae the taffic flow pefomance of netwoks designed by the modified Banch method with the same equiement netwoks designed by the Simplex method and the MENTOR-II algoithm. The expeiment was conducted with thee node numbes 8, 9, and 0 and six node degee values,.0,.2,.4,.6,.8, and 2.0. We used DELITE [7] to geneate thee diffeent data sets fo each node numbe and taffic equiement, with total inbound and outbound taffic fo each data set equal to 00 Mbps, 50 Mbps, and 200 Mbps. A total of 62 data sets wee used in this expeiment. In pats of the MENTOR-II algoithm, we used the design paametes [9] of α (0, 0.5, ), ρ (0.6, 0.7, 0.8), and s (0.3, 0.4, 0.5) and then calculated the pefomance in the following aeas. 3. Delay efficiency Conside a diected netwok gaph G = (N, A) with a capacity c a fo each a A and, as defined in pevious section, d st denotes the amount of taffic st flow between s and t. Let f a indicate how much taffic flow fom s to t ove ac a, taffic load l a ove link a A is the sum of all f st a. It is suggested by Fotz et al. [3] to measue the netwok pefomance by delay cost function in Eq. (). Φ = a A a(l a, c a), () whee a(l a, c a) is an M/M/ queuing theoy style link cost function given by Eq. (2). a(l a, c a) = l a / (c a - l a) (2) With this function, it is moe expensive to send flow along acs whose loads appoach capacity, which is what we want. Howeve, the function does not deal with oveloaded links that is, l a c a. To ovecome this poblem, l a /(c a - l a) is appoximated by a piece-wise linea function [3] a(0) = 0 and deivative in Eq. (3). a(l a, c a) = fo 0 l a / c a < /3, 3 fo /3 l a / c a < 2/3, 0 fo 2/3 l a / c a < 9/0, 70 fo 9/0 l a / c a<, 500 fo l a / c a< /0, 5000 fo /0 l a / c a <. (3) Then we can calculate the delay efficiency as a diffeence between the total netwok delay [3] of the oiginal method and the new method fom Eq. (4). Delay Efficiency = D L o M D B 00 % (4) When delay efficiency is a pefomance in tems of total link delay in the netwok, D L o M is a total links netwok delay designed by the Simplex o MENTOR-II method and D B is a total links netwok delay designed by the Banch method. 3.2 Pocessing time efficiency We can calculate the efficiency of the time spent in the netwok design pocess as shown in Eq. (5). Times = T B T L o M (5) When Times is a pocessing time efficiency of the netwok, T L o M is the time spent on the design pocess of the Simplex o MENTOR-II method and T B is the time spent on the design pocess of the Banch method. Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, 207

4 Received: June 7, Installation cost efficiency When it is necessay to conside the cost of installing cables, then we can calculate the installation cost efficiency [] of the design pocess as shown in Eq. (6): Cost Efficiency = C L o M C B 00 % (6) When Cost Efficiency is an installation cost efficiency of the netwok, C B is the total netwok installation cost that was designed by the Banch method and C L o M is the netwok installation cost that was designed by the Simplex o MENTOR-II method. 4. Expeiment esults and analysis 4. Expeiment esults We analyzed the pefomance among the netwoks designed by the Banch, Simplex, and MENTOR-II methods in the thee aeas of delay, pocessing time, and installation cost []. The esults ae shown in Tables 9. Tables 3 show the aveage delay cost of the netwoks designed by the Banch, Simplex, and MENTOR-II methods. The esults fo each method wee aveaged fom the esults of 62 netwoks, except fo Banch, which ae sepaated fo each value of. Tables 4 6 show the aveage pocessing time of netwoks designed by the Banch, Simplex, and MENTOR-II methods. The esults fo each method wee aveaged fom the esults of 62 netwoks. As with the delay cost, the Banch esults ae sepaated fo each value of. Table. Aveage delay cost of 8-node netwoks Delay Cost Banch Table 2. Aveage delay cost of 9-node netwoks Delay Cost Banch Table 3. Aveage delay cost of 0-node netwoks Delay Cost Banch MENTOR-II Table 4. Aveage pocessing time fo designing 8-node netwoks Pocessing Time Banch Table 5. Aveage pocessing time fo designing 9-node netwoks Pocessing Time Banch Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, 207

5 Received: June 7, Table 6. Aveage pocessing time fo designing 0-node netwoks Pocessing Time Banch MENTOR-II Table 7. Aveage installation cost of 8-node netwoks Installation Cost Banch netwoks. As with the delay cost and pocessing time, the Banch exchange esults ae sepaated fo each value of. 5. Results analysis This section analyzes the total delay cost, pocessing time, and installation cost of 8-, 9-, and 0-node netwoks. Figs. 2 4 show the delay cost compaison of the modified Banch method to the Simplex and MENTOR-II methods. By selecting links to be exchanged in the Banch method, we found that the delay efficiency of the Banch method will fluctuate based on the numbe of selected links (). The geate the value of, the less netwok delay, which makes this method bette than the MENTOR- II method and moe closely aligned to the Simplex method. As shown in Tables 3, with equal to, we can see that the aveage delay cost of 8-, 9-, and 0-node netwoks is,679.8, 2,06.04, and 3,642.9, espectively, but when equals 7, the aveage delay cost of 8-, 9-, and 0-node netwoks is educed to,582.77, 2,058.63, and 2,377.33, espectively. Table 8. Aveage installation cost of 9-node netwoks Installation Cost Banch Delay cost Banch Simplex Figue.2 Aveage delay cost in 8-node netwoks Table 9. Aveage installation cost of 0-node netwoks Installation Cost Banch MENTOR-II Tables 7 9 show the aveage netwok installation cost designed by the Banch, Simplex, and MENTOR-II methods. The esults fo each method wee aveaged fom the esults of 62 Delay cost Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, Banch Simplex Figue.3 Aveage delay cost in 9-node netwoks

6 Received: June 7, Delay cost Banch Mento-II Figue.4 Aveage delay cost in 0-node netwoks Times (S) Banch Simplex Figue.5 Aveage pocessing time of 8-node netwoks Figs. 5 7 show the pocessing time compaison of the modified Banch method to the Simplex and MENTOR-II methods. By selecting links to be exchanged in the Banch method, we found that the pocessing time of the Banch method will also fluctuate based on the numbe of selected links (). The geate the value of, the moe pocessing time needed by the Banch method, which makes it wose than the MENTOR-II method and moe closely aligned to the Simplex method. As shown in Tables 4 6, with equal to, the aveage pocessing time of 8-, 9-, and 0-node netwoks is 0.0, 0.03, and 0.07 seconds, espectively, but when equals 7, the aveage pocessing time of 8-, 9-, and 0-node netwoks is inceased to , 7,208.6, and 49,25.95 seconds, espectively. Figs. 8 0 show the installation cost compaison of the modified Banch method to the Simplex and MENTOR-II methods. By selecting links to be exchanged in the Banch method, we found that the installation cost of the Banch method did not fluctuate based on the numbe of selected links (). As shown in Tables 7 9, the aveage installation cost of 8-, 9-, and 0- node netwoks is 2,476.42, 3,226, and 5,63.56, espectively. Times (S) Banch Simplex Figue.6 Aveage pocessing time of 9-node netwoks Times (S) Banch Mento-II Figue.7 Aveage pocessing time of 0-node netwoks Installation cost Banch Simplex Figue.8 Aveage installation cost in 8-node netwoks Installation cost Banch Simplex Figue.9 Aveage installation cost in 9-node netwoks Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, 207

7 Received: June 7, Installation cost Banch Mento-II Figue.0 Aveage installation cost in 0-node netwoks Pocessing time (s) Numbe of nodes Figue. Simplex method pocessing time Pocessing time (s) Numbe of nodes = Figue.2 Banch method pocessing time The Simplex method netwok design and outing pocess takes a vey long time, especially fo lage netwoks. Fig. shows the elationship between the numbe of nodes and the pocessing time, which can be appoximated to an exponential equation of y = e x when x and y ae the numbe of nodes and the pocessing time, espectively. The Banch netwok design and outing pocess takes less time than the Simplex method. Fig. 2 shows the elationship between the numbe of nodes and the pocessing time fo each. These elationships can be appoximated to exponential equations of y = e x, y = e 0.543x, y = e 0.877x, y = 0.033e x, y = e.2992x, y = e.3965x, and y = e.5465x, fo equals to 7, espectively. Fom these estimated elationships, we can conclude that the Simplex method is not suitable fo lage netwoks. Using the example of a -month pocessing time, the Simplex method could povide only a 7-node netwok, while the Banch method could povide a maximum 45-node netwok with =. 6. Conclusion Adopting the Banch method fo netwok design and outing is a highly flexible option. With the ability to select the numbe of links () to be exchanged with othes, we can tade-off between the design efficiency and the pocessing time. We used the ability of the Banch method to add, dop, and exchange links in ode to detemine a netwok with an efficient taffic flow distibution. We then analyzed the pefomance of netwok delay, pocessing time, and installation cost of the Banch method. The esults showed the aveage delay pefomance compaed to the Simplex method is equal to 9.77%, the aveage pocessing time compaed to the Simplex method is 337,03.4 seconds faste, and the efficiency of installation cost is equal to 89.72% compaed to the Simplex method. In compaison with the MENTOR- II method, the esults showed that the aveage delay pefomance is equal to 8.27%, the aveage pocessing time is,80.2 seconds slowe, and the efficiency of installation cost equals 74.42%. In addition, we found that given the geate the numbe of, the delay and time pefomance of the Banch method would be even bette. Howeve, given moe numbes of links (), the Banch method equied moe pocesso time than the MENTOR-II method and thus aligned moe closely to the Simplex method. In conclusion, the Banch method offes bette pocessing time but with slightly wose delay and installation cost efficiency compaed to the Simplex method. But, in compaison with the MENTOR-II method, the Banch method offes bette efficiency in netwok delay but with slightly wose pocessing time and highe installation cost. Thus moe eseach woks need to be done in the futue to find a suitable technique to be added in ou method fo deceasing the pocessing time and the installation cost. Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, 207

8 Received: June 7, Refeences [] A. Keshenbaum, Telecommunications netwok design algoithms, McGaw-Hill, New Yok, N.Y [2] W. Ben-Ameu, E. Goudin, B. Liau, and N. Michel, Dimensioning of Intenet netwoks, In: Poc. of the second intenational wokshop on the design of eliable communication netwoks, Munich, Gemany, pp. 56 6, [3] B. Fotz, J. Rexfod, and M. Thoup, Taffic engineeing with taditional IP outing potocols, IEEE Communications Magazine, Vol.40, No.0, pp. 8 24, [4] A. Sidhaan, R. A. Gúein, and C. Diot, Achieving nea-optimal taffic engineeing solutions fo cuent OSPF/IS-IS netwoks, IEEE/ACM Tansactions on Netwoking, Vol.3, No.2, pp , [5] M. H. Sqalli, S. Sait, and S. Asadullah, OSPF weight setting optimization fo single link failues, Intenational Jounal of Compute Netwoks & Communications, Vol.3, No., pp , 20. [6] A. Keshenbaum, P. Kemani, and G. A. Gove, MENTOR: An algoithm fo mesh netwok topological optimization and outing, IEEE Tansactions on Communications, Vol.39, No.4, pp , 99. [7] R. S. Cahn, Wide aea netwok design: Concepts and tools fo optimization, Mogan Kaufmann, San Mateo, CA, 998. [8] K. Jaoenat, and P. Chankeitkong, On outing pefomance of MENTOR algoithm, WSEAS Tansaction on Communications, Vol.9, No.5, pp , [9] P. Chankeitkong, K. Jaoenat and P. Keatthaleenglit, On IP Netwok Routing Pefomance of MENTOR-II Algoithm, In: Poc. of IT Towads Empowement Intenational Confeence, Bangkok, Thailand, pp.38-43, [0] C. Ababei, and R. G. Kavassei, Efficient netwok econfiguation using minimum cost maximum flow-based banch exchanges and andom walks-based loss estimations, IEEE Tansactions on Powe Systems, Vol.26, No., pp , 20. [] K. Jaoenat, S. Chimmanee and P. Chankeitkong, Algoithms fo IP netwoks design with ECMP outing enable, In: Poc. of 7 th Intenational Confeence on Computing and Convegence Technology, Seoul, South Koea, pp , 202. Intenational Jounal of Intelligent Engineeing and Systems, Vol.0, No.6, 207

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012 2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo

More information

Optical Flow for Large Motion Using Gradient Technique

Optical Flow for Large Motion Using Gradient Technique SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this

More information

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension 17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach

More information

Performance Optimization in Structured Wireless Sensor Networks

Performance Optimization in Structured Wireless Sensor Networks 5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame

More information

A New Finite Word-length Optimization Method Design for LDPC Decoder

A New Finite Word-length Optimization Method Design for LDPC Decoder A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology

More information

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;

More information

An Unsupervised Segmentation Framework For Texture Image Queries

An Unsupervised Segmentation Framework For Texture Image Queries An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu

More information

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

More information

Color Correction Using 3D Multiview Geometry

Color Correction Using 3D Multiview Geometry Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,

More information

SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH

SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,

More information

Point-Biserial Correlation Analysis of Fuzzy Attributes

Point-Biserial Correlation Analysis of Fuzzy Attributes Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh

More information

A Recommender System for Online Personalization in the WUM Applications

A Recommender System for Online Personalization in the WUM Applications A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based

More information

A Fuzzy Constraint-Based Routing Algorithm for Traffic Engineering

A Fuzzy Constraint-Based Routing Algorithm for Traffic Engineering Fuzz Constaint-ased Routing lgoithm fo Taffic Engineeing Junaid. Khan and Hussein M. lnuweii Depatment of Electical & Compute Engineeing, 2356 Main Mall, Univesit of itish Columbia, Vancouve,.C. Canada,

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

The Internet Ecosystem and Evolution

The Internet Ecosystem and Evolution The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee

More information

Interference-Aware Multicast for Wireless Multihop Networks

Interference-Aware Multicast for Wireless Multihop Networks Intefeence-Awae Multicast fo Wieless Multihop Netwoks Daniel Letpatchya School of Electical and Compute Engineeing Geogia Institute of Technology Atlanta, Geogia 30332 0250 Douglas M. Blough School of

More information

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition

More information

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class

More information

Topological Characteristic of Wireless Network

Topological Characteristic of Wireless Network Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences

More information

A Novel Automatic White Balance Method For Digital Still Cameras

A Novel Automatic White Balance Method For Digital Still Cameras A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing

More information

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet

More information

An Assessment of the Efficiency of Close-Range Photogrammetry for Developing a Photo-Based Scanning Systeminthe Shams Tabrizi Minaret in Khoy City

An Assessment of the Efficiency of Close-Range Photogrammetry for Developing a Photo-Based Scanning Systeminthe Shams Tabrizi Minaret in Khoy City Austalian Jounal of Basic and Applied Sciences, 5(1): 80-85, 011 ISSN 1991-8178 An Assessment of the Efficiency of Close-Range Photogammety fo Developing a Photo-Based Scanning Systeminthe Shams Tabizi

More information

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

A Two-stage and Parameter-free Binarization Method for Degraded Document Images A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and

More information

IP Multicast Simulation in OPNET

IP Multicast Simulation in OPNET IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok

More information

Erasure-Coding Based Routing for Opportunistic Networks

Erasure-Coding Based Routing for Opportunistic Networks Easue-Coding Based Routing fo Oppotunistic Netwoks Yong Wang, Sushant Jain, Magaet Matonosi, Kevin Fall Pinceton Univesity, Univesity of Washington, Intel Reseach Bekeley ABSTRACT Routing in Delay Toleant

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

Configuring RSVP-ATM QoS Interworking

Configuring RSVP-ATM QoS Interworking Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP

More information

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

Efficient protection of many-to-one. communications

Efficient protection of many-to-one. communications Efficient potection of many-to-one communications Miklós Molná, Alexande Guitton, Benad Cousin, and Raymond Maie Iisa, Campus de Beaulieu, 35 042 Rennes Cedex, Fance Abstact. The dependability of a netwok

More information

ANN Models for Coplanar Strip Line Analysis and Synthesis

ANN Models for Coplanar Strip Line Analysis and Synthesis 200 IJCSNS Intenational Jounal of Compute Science and Netwok Secuity, VOL.8 No.10, Octobe 2008 Models fo Coplana Stip Line Analysis and J.Lakshmi Naayana D.K.Si Rama Kishna D.L.Patap Reddy Chalapathi Institute

More information

arxiv: v2 [physics.soc-ph] 30 Nov 2016

arxiv: v2 [physics.soc-ph] 30 Nov 2016 Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity

More information

Adaptation of TDMA Parameters Based on Network Conditions

Adaptation of TDMA Parameters Based on Network Conditions Adaptation of TDMA Paametes Based on Netwok Conditions Boa Kaaoglu Dept. of Elect. and Compute Eng. Univesity of Rocheste Rocheste, NY 14627 Email: kaaoglu@ece.ocheste.edu Tolga Numanoglu Dept. of Elect.

More information

Annales UMCS Informatica AI 2 (2004) UMCS

Annales UMCS Informatica AI 2 (2004) UMCS Pobane z czasopisma Annales AI- Infomatica http://ai.annales.umcs.pl Annales Infomatica AI 2 (2004) 33-340 Annales Infomatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ Embedding as a

More information

(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1)

(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1) 1 Multi Path PERT Ankit Singh and A. L. Naasimha Reddy Electical and Compute Engineeing Depatment, Texas A&M Univesity; email: eddy@ece.tamu.edu. Abstact This pape pesents a new multipath delay based algoithm,

More information

IP MULTICAST. Adiseshu Hari, T. V. Lakshman and Gordon Wilfong Nokia Bell Labs

IP MULTICAST. Adiseshu Hari, T. V. Lakshman and Gordon Wilfong Nokia Bell Labs IP MULTICAST Adiseshu Hai, T. V. Lakshman and Godon Wilfong Nokia DIMACS Wokshop on Algoithms fo Data Cente Netwoks Rutges Univesity, NJ 1 Why is IP Multicast not deployed in public netwoks? Denial-of-Sevice

More information

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks Numbe of Paths and Neighbous Effect on Multipath Routing in Mobile Ad Hoc Netwoks Oday Jeew School of Infomation Systems and Accounting Univesity of Canbea Canbea ACT 2617, Austalia oday.jeew@canbea.edu.au

More information

The Dual Round Robin Matching Switch with Exhaustive Service

The Dual Round Robin Matching Switch with Exhaustive Service The Dual Round Robin Matching Switch with Exhaustive Sevice Yihan Li, Shivenda S. Panwa, H. Jonathan Chao Abstact Vitual Output Queuing is widely used by fixed-length highspeed switches to ovecome head-of-line

More information

Prioritized Traffic Recovery over GMPLS Networks

Prioritized Traffic Recovery over GMPLS Networks Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing

More information

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments Wieless Netwoks 0, 3 32, 200 200 Kluwe Academic Publishes. Manufactued in The Nethelands. Combinatoial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registation in Mobile

More information

On Error Estimation in Runge-Kutta Methods

On Error Estimation in Runge-Kutta Methods Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment

More information

IS-IS Protocol Hardware Implementation for VPN Solutions

IS-IS Protocol Hardware Implementation for VPN Solutions IS-IS Potocol Hadwae Implementation fo VPN Solutions MOHAMED ABOU-GABAL, RAYMOND PETERKIN, DAN IONESCU School of Infomation Technology and Engineeing (SITE) Univesity of Ottawa 161 Louis Pasteu, P.O. Box

More information

Hierarchically Clustered P2P Streaming System

Hierarchically Clustered P2P Streaming System Hieachically Clusteed P2P Steaming System Chao Liang, Yang Guo, and Yong Liu Polytechnic Univesity Thomson Lab Booklyn, NY 11201 Pinceton, NJ 08540 Abstact Pee-to-pee video steaming has been gaining populaity.

More information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220

More information

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

More information

On using circuit-switched networks for file transfers

On using circuit-switched networks for file transfers On using cicuit-switched netwoks fo file tansfes Xiuduan Fang, Malathi Veeaaghavan Univesity of Viginia Email: {xf4c, mv5g}@viginia.edu Abstact High-speed optical cicuit-switched netwoks ae being deployed

More information

Quality-of-Content (QoC)-Driven Rate Allocation for Video Analysis in Mobile Surveillance Networks

Quality-of-Content (QoC)-Driven Rate Allocation for Video Analysis in Mobile Surveillance Networks Quality-of-Content (QoC)-Diven Rate Allocation fo Video Analysis in Mobile Suveillance Netwoks Xiang Chen, Jenq-Neng Hwang, Kuan-Hui Lee, Ricado L. de Queioz Depatment of Electical Engineeing, Univesity

More information

Separability and Topology Control of Quasi Unit Disk Graphs

Separability and Topology Control of Quasi Unit Disk Graphs Sepaability and Topology Contol of Quasi Unit Disk Gaphs Jiane Chen, Anxiao(Andew) Jiang, Iyad A. Kanj, Ge Xia, and Fenghui Zhang Dept. of Compute Science, Texas A&M Univ. College Station, TX 7784. {chen,

More information

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,

More information

Scaling Location-based Services with Dynamically Composed Location Index

Scaling Location-based Services with Dynamically Composed Location Index Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute

More information

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks On the Fowading Aea of Contention-Based Geogaphic Fowading fo Ad Hoc and Senso Netwoks Dazhi Chen Depatment of EECS Syacuse Univesity Syacuse, NY dchen@sy.edu Jing Deng Depatment of CS Univesity of New

More information

Assessment of Track Sequence Optimization based on Recorded Field Operations

Assessment of Track Sequence Optimization based on Recorded Field Operations Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment

More information

Towards Adaptive Information Merging Using Selected XML Fragments

Towards Adaptive Information Merging Using Selected XML Fragments Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,

More information

Analysis of Wired Short Cuts in Wireless Sensor Networks

Analysis of Wired Short Cuts in Wireless Sensor Networks Analysis of Wied Shot Cuts in Wieless Senso Netwos ohan Chitaduga Depatment of Electical Engineeing, Univesity of Southen Califonia, Los Angeles 90089, USA Email: chitadu@usc.edu Ahmed Helmy Depatment

More information

An Efficient Handover Mechanism Using the General Switch Management Protocol on a Multi-Protocol Label Switching Network

An Efficient Handover Mechanism Using the General Switch Management Protocol on a Multi-Protocol Label Switching Network An Efficient andove Mechanism Using the Geneal Switch Management Potocol on a Multi-Potocol abel Switching Netwok Seong Gon hoi, yun Joo Kang, and Jun Kyun hoi Using the geneal switch management potocol

More information

Fault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs

Fault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs Fault-Toleant Routing Schemes in RDT(,,)/α-Based Inteconnection Netwok fo Netwoks-on-Chip Designs Mei Yang, Tao Li, Yingtao Jiang, and Yulu Yang Dept. of Electical & Compute Engineeing Univesity of Nevada,

More information

An Improved Resource Reservation Protocol

An Improved Resource Reservation Protocol Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

A Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation

A Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation A Minutiae-based Fingepint Matching Algoithm Using Phase Coelation Autho Chen, Weiping, Gao, Yongsheng Published 2007 Confeence Title Digital Image Computing: Techniques and Applications DOI https://doi.og/10.1109/dicta.2007.4426801

More information

Shortest Paths for a Two-Robot Rendez-Vous

Shortest Paths for a Two-Robot Rendez-Vous Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal

More information

A New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE

A New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE 5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai

More information

EE 6900: Interconnection Networks for HPC Systems Fall 2016

EE 6900: Interconnection Networks for HPC Systems Fall 2016 EE 6900: Inteconnection Netwoks fo HPC Systems Fall 2016 Avinash Kaanth Kodi School of Electical Engineeing and Compute Science Ohio Univesity Athens, OH 45701 Email: kodi@ohio.edu 1 Acknowledgement: Inteconnection

More information

High performance CUDA based CNN image processor

High performance CUDA based CNN image processor High pefomance UDA based NN image pocesso GEORGE VALENTIN STOIA, RADU DOGARU, ELENA RISTINA STOIA Depatment of Applied Electonics and Infomation Engineeing Univesity Politehnica of Buchaest -3, Iuliu Maniu

More information

Data mining based automated reverse engineering and defect discovery

Data mining based automated reverse engineering and defect discovery Data mining based automated evese engineeing and defect discovey James F. Smith III, ThanhVu H. Nguyen Naval Reseach Laboatoy, Code 5741, Washington, D.C., 20375-5000 ABSTRACT A data mining based pocedue

More information

Mobility Pattern Recognition in Mobile Ad-Hoc Networks

Mobility Pattern Recognition in Mobile Ad-Hoc Networks Mobility Patten Recognition in Mobile Ad-Hoc Netwoks S. M. Mousavi Depatment of Compute Engineeing, Shaif Univesity of Technology sm_mousavi@ce.shaif.edu H. R. Rabiee Depatment of Compute Engineeing, Shaif

More information

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes CS630 Repesenting and Accessing Digital Infomation Infomation Retieval: Basics Thosten Joachims Conell Univesity Infomation Retieval Basics Retieval Models Indexing and Pepocessing Data Stuctues ~ 4 lectues

More information

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,

More information

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,

More information

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO Zeeshan A. Shaikh 1 and T.Y. Badguja 2 1,2 Depatment of Mechanical Engineeing, Late G. N. Sapkal

More information

Parallel processing model for XML parsing

Parallel processing model for XML parsing Recent Reseaches in Communications, Signals and nfomation Technology Paallel pocessing model fo XML pasing ADRANA GEORGEVA Fac. Applied Mathematics and nfomatics Technical Univesity of Sofia, TU-Sofia

More information

FINITE ELEMENT MODEL UPDATING OF AN EXPERIMENTAL VEHICLE MODEL USING MEASURED MODAL CHARACTERISTICS

FINITE ELEMENT MODEL UPDATING OF AN EXPERIMENTAL VEHICLE MODEL USING MEASURED MODAL CHARACTERISTICS COMPDYN 009 ECCOMAS Thematic Confeence on Computational Methods in Stuctual Dynamics and Eathquake Engineeing M. Papadakakis, N.D. Lagaos, M. Fagiadakis (eds.) Rhodes, Geece, 4 June 009 FINITE ELEMENT

More information

An Extension to the Local Binary Patterns for Image Retrieval

An Extension to the Local Binary Patterns for Image Retrieval , pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science

More information

Drag Optimization on Rear Box of a Simplified Car Model by Robust Parameter Design

Drag Optimization on Rear Box of a Simplified Car Model by Robust Parameter Design Vol.2, Issue.3, May-June 2012 pp-1253-1259 ISSN: 2249-6645 Dag Optimization on Rea Box of a Simplified Ca Model by Robust Paamete Design Sajjad Beigmoadi 1, Asgha Ramezani 2 *(Automotive Engineeing Depatment,

More information

A Stable Traffic Engineering Technique for Performance Enhancement of the Non-TCP Elastic Flows *

A Stable Traffic Engineering Technique for Performance Enhancement of the Non-TCP Elastic Flows * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 30, 1115-1129 (2014) A Stable Taffic Engineeing Technique fo Pefomance Enhancement of the Non-TCP Elastic Flows * Ian Telecom Reseach Cente (ITRC) Tehan,

More information

Image Enhancement in the Spatial Domain. Spatial Domain

Image Enhancement in the Spatial Domain. Spatial Domain 8-- Spatial Domain Image Enhancement in the Spatial Domain What is spatial domain The space whee all pixels fom an image In spatial domain we can epesent an image by f( whee x and y ae coodinates along

More information

Communication vs Distributed Computation: an alternative trade-off curve

Communication vs Distributed Computation: an alternative trade-off curve Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,

More information

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced

More information

APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE

APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE 1 YAROSLAVTSEV A.F., 2 Al-THUNEIBAT S.A., 3 AL TAWALBEH N.A 1 Depatment of Netwoking, SSUTI, Novosibisk, Russia

More information

Dynamic Topology Control to Reduce Interference in MANETs

Dynamic Topology Control to Reduce Interference in MANETs Dynamic Topology Contol to Reduce Intefeence in MANETs Hwee Xian TAN 1,2 and Winston K. G. SEAH 2,1 {stuhxt, winston}@i2.a-sta.edu.sg 1 Depatment of Compute Science, School of Computing, National Univesity

More information

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks 788 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 12, NO. 2, APRIL 2016 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang,

More information

Image Registration among UAV Image Sequence and Google Satellite Image Under Quality Mismatch

Image Registration among UAV Image Sequence and Google Satellite Image Under Quality Mismatch 0 th Intenational Confeence on ITS Telecommunications Image Registation among UAV Image Sequence and Google Satellite Image Unde Quality Mismatch Shih-Ming Huang and Ching-Chun Huang Depatment of Electical

More information

Effects of Model Complexity on Generalization Performance of Convolutional Neural Networks

Effects of Model Complexity on Generalization Performance of Convolutional Neural Networks Effects of Model Complexity on Genealization Pefomance of Convolutional Neual Netwoks Tae-Jun Kim 1, Dongsu Zhang 2, and Joon Shik Kim 3 1 Seoul National Univesity, Seoul 151-742, Koea, E-mail: tjkim@bi.snu.ac.k

More information

WIRELESS sensor networks (WSNs), which are capable

WIRELESS sensor networks (WSNs), which are capable IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. XX, NO. XX, XXX 214 1 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang, Kuan

More information

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits

More information

Approximating Euclidean Distance Transform with Simple Operations in Cellular Processor Arrays

Approximating Euclidean Distance Transform with Simple Operations in Cellular Processor Arrays 00 th Intenational Wokshop on Cellula Nanoscale Netwoks and thei Applications (CNNA) Appoximating Euclidean Distance Tansfom with Simple Opeations in Cellula Pocesso Aas Samad Razmjooei and Piot Dudek

More information

A Caching Algorithm using Evolutionary Game Theory in a File-Sharing System

A Caching Algorithm using Evolutionary Game Theory in a File-Sharing System A Caching Algoithm using Evolutionay Game Theoy in a File-Shaing System Masahio Sasabe Cybemedia Cente Osaka Univesity 1-32 Machikaneyama-cho, Toyonaka-shi Osaka 56-43, Japan m-sasabe@cmc.osaka-u.ac.jp

More information

Tier-Based Underwater Acoustic Routing for Applications with Reliability and Delay Constraints

Tier-Based Underwater Acoustic Routing for Applications with Reliability and Delay Constraints Tie-Based Undewate Acoustic Routing fo Applications with Reliability and Delay Constaints Li-Chung Kuo Depatment of Electical Engineeing State Univesity of New Yok at Buffalo Buffalo, New Yok 14260 Email:

More information

And Ph.D. Candidate of Computer Science, University of Putra Malaysia 2 Faculty of Computer Science and Information Technology,

And Ph.D. Candidate of Computer Science, University of Putra Malaysia 2 Faculty of Computer Science and Information Technology, (IJCSIS) Intenational Jounal of Compute Science and Infomation Secuity, Efficient Candidacy Reduction Fo Fequent Patten Mining M.H Nadimi-Shahaki 1, Nowati Mustapha 2, Md Nasi B Sulaiman 2, Ali B Mamat

More information

Positioning of a robot based on binocular vision for hand / foot fusion Long Han

Positioning of a robot based on binocular vision for hand / foot fusion Long Han 2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,

More information

New Algorithms for Daylight Harvesting in a Private Office

New Algorithms for Daylight Harvesting in a Private Office 18th Intenational Confeence on Infomation Fusion Washington, DC - July 6-9, 2015 New Algoithms fo Daylight Havesting in a Pivate Office Rohit Kuma Lighting Solutions and Sevices Philips Reseach Noth Ameica

More information

Bo Gu and Xiaoyan Hong*

Bo Gu and Xiaoyan Hong* Int. J. Ad Hoc and Ubiquitous Computing, Vol. 11, Nos. /3, 1 169 Tansition phase of connectivity fo wieless netwoks with gowing pocess Bo Gu and Xiaoyan Hong* Depatment of Compute Science, Univesity of

More information

Fast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry

Fast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry Univesity of Wollongong Reseach Online Faculty of Infomatics - Papes (Achive) Faculty of Engineeing and Infomation Sciences 2010 Fast quality-guided flood-fill phase unwapping algoithm fo thee-dimensional

More information

HISTOGRAMS are an important statistic reflecting the

HISTOGRAMS are an important statistic reflecting the JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe

More information

Adaptation of Motion Capture Data of Human Arms to a Humanoid Robot Using Optimization

Adaptation of Motion Capture Data of Human Arms to a Humanoid Robot Using Optimization ICCAS25 June 2-5, KINTEX, Gyeonggi-Do, Koea Adaptation of Motion Captue Data of Human Ams to a Humanoid Robot Using Optimization ChangHwan Kim and Doik Kim Intelligent Robotics Reseach Cente, Koea Institute

More information

Clustering Interval-valued Data Using an Overlapped Interval Divergence

Clustering Interval-valued Data Using an Overlapped Interval Divergence Poc. of the 8th Austalasian Data Mining Confeence (AusDM'9) Clusteing Inteval-valued Data Using an Ovelapped Inteval Divegence Yongli Ren Yu-Hsn Liu Jia Rong Robet Dew School of Infomation Engineeing,

More information

XFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers

XFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers XFVHDL: A Tool fo the Synthesis of Fuzzy Logic Contolles E. Lago, C. J. Jiménez, D. R. López, S. Sánchez-Solano and A. Baiga Instituto de Micoelectónica de Sevilla. Cento Nacional de Micoelectónica, Edificio

More information

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver 1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent

More information

Gravitational Shift for Beginners

Gravitational Shift for Beginners Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational

More information

Embeddings into Crossed Cubes

Embeddings into Crossed Cubes Embeddings into Cossed Cubes Emad Abuelub *, Membe, IAENG Abstact- The hypecube paallel achitectue is one of the most popula inteconnection netwoks due to many of its attactive popeties and its suitability

More information