Performance Evaluation of WDM LAN s with Propagation Delay Constraint Analysis

Size: px
Start display at page:

Download "Performance Evaluation of WDM LAN s with Propagation Delay Constraint Analysis"

Transcription

1 Pefomance Evaluaton of WD AN s wth Popagaton Dela Constant Analss IOANNI E. POUNOURAKI Depatment of Electcal & Compute Engneeng Natonal echncal Unvest of Athens Zogaphou, Athens GREECE Abstact: -In ths pape we stud the effect of ound tp popagaton dela n pefomance measues of Wavelength Dvson ultplexng (WD netwoks. Even though the mpact of popagaton dela s substantal n optcal netwoks behavo, most of the studes gnoe the effect of ths object n thoughput dela evaluaton. We assume a WD ocal Aea Netwok (AN whee the ound tp popagaton dela s less o equal to a data packet tansmsson tme. he poposed asnchonous tansmsson polc avod data channel collson. In the analss we take nto account the popagaton delas the effect of eceve collson fo a sstem wth fnte numbe of statons. Ke-Wods: - Wavelength Dvson ultplexng, ound tp popagaton dela, eceve collson, Elang- fomula, aveage ejecton pobablt.. Netwok Achtectue odel he sstem unde consdeaton as Fgue shows s a passve sta netwok. he sstem uses N + wavelengths, λ 0, λ,..., λ N, to seve a fnte numbe ( > N of statons. he sstem at wavelength λ 0 opeates as the contol channel whle the emanng N channels at wavelengths λ,..., λ N consttute the multchannel of data tansmsson sstem[-4]. hus the poposed netwok model can be descbed as a CC FR R stuctue. It has a common contol channel CC. means that each staton has a tunable tansmtte tuned at λ 0, λ,..., λn. he outcomng taffc fom a staton s connected to one nput of the passve sta couple. Addtonall, eve staton also uses a fxed tuned eceve FR fo the contol channel one tunable eceve to an of data channel λ,..., λ N ndcated b R. he ncomng taffc to a use staton s spltted nto N + wavelengths b a WDA spltte fom whch one of N wavelengths can be selected b the tunable eceve as Fgue ndcates. he tansmsson tme of a fxed sze contol packet s used as tme unt (contol slot the data packet tansmsson nomalzed n contol slot tme unts s ( > whch s called data slot. We assume the exstence of a common clock, obtaned b dstbutng a clock to all statons. he oundtp popagaton tme between an staton to the hub of the sta couple to an othe staton s assumed to be equal to R tme unts. he oundtp popagaton plas a ke ole n the pefomance evaluaton of the WDA potocols. ost of the studes consde data packet tansmsson tme s much geate than popagaton dela. Howeve n optcal netwoks, popagaton dela n most cases s hghe than data packet tansmsson tme. Fo example lets sa a netwok wth damete 2Km data packets wth sze 800 bts. In case of a channel wth capact 0 b/s 8 popagaton speed of 2 0, the popagaton dela s 0µsec whle the data tansmsson tme s 800µsec. In case of a wavelength wth capact of Gbt/sec the data tansmsson tme s 8µsec. he close elaton the small dffeence between popagaton dela data packet tansmsson tme s a ve mpotant facto n desgned multple access WD netwoks.

2 he poposed scheme belongs to the asnchonous tansmsson potocols n whch the data channels ae unslotted. Contol channel s consdeed to be slotted wth R + tme unts sze. he contol packet conssts of the tansmtte addess, the eceve addess the wavelength λ k as s shown n Fgue 2. he access method follows the "tell wat " polc n whch a data packet s tansmtted f onl f ts coespondng contol packet has successfull tansmtted. contol data packet b lstenng to the sta couple multchannel sstem snce t opeates as a boadcast medum. he packet of a backlogged staton must be etansmtted n some late tme slot accodng to etansmsson polc, wth possbl futhe such etansmssons untl successful ecepton. he poposed achtectue potocol acheves collsonless data packet tansmsson tackng the avalablt of data channels. We stud data collson due to destnaton staton contenton n pefomance measue evaluaton. Fgue 2. Data Contol packets stuctue. Fgue. Passve sta couple. oe ove each staton s equpped b a buffe wth capact of one data packet. If the buffe s empt the staton s sad to be fee, othewse, t s backlogged. If a staton s backlogged geneates a new packet, the packet s lost neve etuns. A staton wll hea the esult of a tansmsson of ts Analss We use the followng notatons: numbe of statons n the sstem; N numbe of data channels n the sstem; length of data packets n contol packet tansmsson tme unts; R ( R < the oundtp popagaton dela n the sstem; R + length of contol slot n contol packet tansmsson tme unts; G the aveage numbe of tansmtted contol packets pe contol slot tme on contol channel; c output ate of successful tansmtted contol packets; the aveage ate of successfull tansmtted d he speed the ange of tunable tansmttes set majo lmtatons affectng WD opeaton. In ou stud we ae not take nto account these lmtatons assumng neglgble tunng tmes ve lage tunable bwdths. data packets though one of the data channels pe data slot. d the aveage ate of successfull eceved data packets at destnaton though one of the data channels pe data slot. 2. Access mode A staton contnuousl montos the contol channel wth ts fxed tuned eceve. At the begnnng of each contol slot each staton knows the status of data channels (dle o bus. o the staton ecognzes the dle channels. In case of detecton of dle channels, the staton selects one of them oml, wats the begnnng of the next contol slot sends fst the contol 2

3 packet ove the contol channel, specfng the eseved channel numbe fo data tansmsson. At the end of the contol slot, namel R tme unts late, the staton hea the esult of ts tansmsson. In case of successful tansmsson on the contol channel, the staton mmedatel tansmts the coespondng data packet ove the chosen dle data channel wth avodance of data channel collson. If thee s unsuccessful tansmsson on the contol channel due to contol channel collson o thee s no dle data channels, the staton becomes backlogged defe ts tansmsson accodng to etansmsson polc. he nput nto the data channels sstem has one to one coespondence to the output of the contol channel. heefoe the netwok achtectue wth N data channels, wth constant mean aval ate of data packets, alwas an dle channel s ead fo tansmsson untl all data channels become bus. At ths pont the ncomng successful tansmssons ae ejected n a F -seve loss sstem. In ths taffc model the block pobablt of a data packet s P esults fom the well known Elang- fomula. he fxed data packets length gves constant sevce ate /. he Elang- fomula was deved fo Posson nput taffc. he nput nto data channels sstem has one to one coespondence to output fom the contol channel. We appoxmate the output ate of the successful tansmtted contol packets whch coesponds to the nput taffc ate of the accompanng data packets nto the data channels tansmsson sstem, wth Posson aval pocess [-3]. o obtanng closed fom expessons fo the stead state behavo, we can expess the output ate of successful tansmtted contol packets nomalzed n contol slots duaton tme unts as follows : Ge c ( R + he evaluaton of block pobablt s gven b P N n ( Ge R + ( Ge R + N N! n n! (2 We defne as thoughput the aveage ate of successfull tansmsson of data packets ove N- data channels sstem dung a data slot tme peod n stead state. Ge R + o we get d Ge N R + ( P ( P.2 Recepton mode (3 (4 In the ecevng mode, at the end of the contol slot, f a staton dentfes ts addess announced n a contol packet on a contol channel the coespondng data packet wll be tansmtted successfull. hen, mmedatel adjusts ts tunable eceve to the wavelength channel specfed n the contol packet fo data packet ecepton. Fgue 3. Vulneable peod. We sa that a tunable eceve of a staton Z s actve, f t s tuned ecevng a data packet fom a data channel λd (,..., N as Fgue 3 ndcates. It s possble the tunable eceve of staton Z to be actve at a tme nstant. o an successfull tansmtted data packet addessed to staton Z s ejected. hs phenomenon s called eceve collson [5-9]. We consde that at an pont n tme each staton s capable of tansmttng at a patcula wavelength λ d smultaneousl ecevng at a wavelength λ dr. We assume unfom dstbuton of 3

4 etansmssons. he om tme dela ntoduced between two consecutve etansmssons s unfoml dstbuted fom to K tme unts..3 Receve Collson he thoughput educton nduced b eceve collson s elated wth the possblt a eceve to be actve. hus we examne what wll happen f a data packet whch stats tansmsson at tme nstant t has as destnaton a staton Z who belongs to the set,2,. he tme nstant that a successful tansmtted data packet aves at ts destnaton s dffeent fom the othes, because the tansmsson stat tmes among two successve data packets ae ndependent ma dffe at least R + tme unts. It s obvous that f a successful data packet has stated tansmsson between t { ( R + } t ( R + wll have actvate the eceve of staton Z a eceve collson occus. In the opposte case, the Z staton tunable eceve wll be able to ead ts destnaton addess so the data packet s eceved coectl. hus the vulneable peod tme lasts ( R + tme unts. It s evdent that an othe successful data packet tansmsson, statng between t + ( R + t + { ( R + }, wll fnd the staton's Z eceve actve wll be aboted, causng eceve collson. In othe wods the collson wndow nteval s extendng fom t to t + { ( R + }. he pobablt that staton Z s destnaton of a data packet s / (fo sake of smplct of the analss, we assume that a staton ma sent packets to tself. We defne the followng events fo the vulneable tme peod tt { ( R + } p t : A, the successful tansmsson of a data packet, statng tansmsson n the th tme unt of the vulneable peod ove a gven data channel j {,2, N}., the data packet statng tansmsson n the th tme unt, whose coespondng contol packet has been tansmtted ove the contol channel at th ( R + tme unt, has as destnaton a gven staton, let's sa Z {,...,. akng nto account the ndependence of the of the A events fo each tme unt, we defne C, as the event that no one data packet has as destnaton the staton Z dung the vulneable peod. We nomalze the vulneable peod n contol slot tme peods as follows: If modulus ( R + equals to zeo then x R + x.else x x. the ntege pat of R + C I ( A I (5 We defne as P co, the pobablt of coectl ecepton of a data packet fom staton Z statng tansmsson at the gven tme nstant. hs pobablt s equvalent wth the pobablt P (C. Fom (5 we get, P co P( C [ G [ P( A I ] [ ] ( C e P( A I [ P( A P( / A ] ( P ] (6 We defne as thoughput pe staton n stead state, the facton of successfull data packets that ae eceved coectl at destnaton b a staton dung a data slot tme. G G e ( P [ e ( P ] R + (7 Usng appoxmatons n the above equaton, we take G G e ( P exp[ e ( P ] R + (8 et RC be the total sstem thoughput of the sstem, that s defned as the aveage numbe of the successful tansmssons of data packets at destnaton dung a data slot tme n stead state. 4

5 RC (9 Rc d N (0.4 Aveage Rejecton Pobablt We defne P ej as the aveage ejecton pobablt at destnaton, n stead state, the ato of the aveage numbe of data packets ejected at destnaton due to actve eceves, to aveage numbe of successfull tansmtted packets ove the multchannel sstem dung a data packet tansmsson tme, then P ej RC ( that the pobablt of success s the same on an t, n has a geometc dstbuton,.e. Q ( n F ( F n W the aveage numbe of tals fo successful tansmsson of a contol packet. o W E[ n] nq ( n / F G n ( P [ e ( E[ D] E[ D ] + E[ D R + + ( W ( D 2 3 Numecal Results w b e G ] + + 2R + (4 P ] ( R R R + (6 2 Dela Analss We assume unfom dstbuton of etansmssons. he om tme dela ntoduced between two consecutve etansmssons s unfoml dstbuted fom to K contol slot tme unts, wth aveage value gven b D b ( K + / 2. D the nteval between the geneaton tme of a data packet the tme of successful ecepton at destnaton. Data packet dela D, s composed fom thee pats as follows: D Dw + D R + (2 D w the watng tme fom the geneaton of a packet untl the begn of the next contol slot. D the dela fom the tansmsson of a data packet untl the begn of successful ecepton at the destnaton. F the pobablt of successful tansmsson of a data packet. Fom (7 we take G F e ( P [ e ( P ] (3 Q (n the pobablt of successful etansmsson of a packet afte n tals. Assumng Fgue 4. he thoughput pe data channel wthout wth eceve collson, vesus the offeed taffc chaactestcs fo R0,5,25 tme unts N0 data channels wth 00 tme unts 00 statons. he esults fom the analss ae llustated n the Fg. 4. It s obvous fom the fgue that as R nceases the thoughput pe data channel deceases. Especall fo R0 we take d (max Fo R5 we take d (max wth educton 37.2% fom the case of R0 fo R25 we take d (max 0.4 wth educton 87.69% fom the case of R % fom the case wth R5.. 5

6 4 Conclusons Ou analss poves that ound tp popagaton dela plas a ke ole n sngle-hop WD Passve sta technolog netwoks. he thoughput measue deteoates damatcall as data packet tansmsson tme s less than ound tp popagaton dela. Also destnaton conflcts educe an moe the pefomance measues n ths WD netwoks catego. Ou stud gves a fame fo the futue eseache fo a eal pefomance measues evaluaton unde the condtons of popagaton dela eceve collson phenomenon. Refeences: [] H. agak. Klenock, Output pocess n contenton packet boadcastng sstems, IEEE ans. Communc., vol.co-33, n., pp9-99, Nov 985 [2] N. ehava," Pefomance Potocol Impovements fo Ve Hgh -peed Optcal Fbe ocal Aea Netwoks Usng a Passve ta opolog ", J. ghtwave echnolog, vol.8, pp , Ap.990. [3].I. Habbab,.Kavehad, C.E.W. undbeg," Potocols fo Ve Hgh -peed Optcal Fbe ocal Aea Netwoks Usng a Passve ta opolog ",J. ghtwave echnolog, vol. -5,pp , Dec [4] J. u. Klenock, " A wavelength dvson multple access potocol fo hgh-speed local aea netwoks wth a passve sta topolog", Pefomance Eval., vol.6 pp , Nov [5] I. E. Pountouaks, " Pefomance Evaluaton wth Receve Collsons Analss n Ve Hgh- peed Optcal Fbe ocal Aea Netwoks usng Passve ta opolog ", J. ghtwave echnolog, vol.6, No.2 pp , Decembe 998. [6] I. E.Pountouaks, " A ultwavelength Contol Achtectue fo Electonc Pocessng ottleneck Reducton n WDA, ghtwave Netwoks", Compute Communcatons vol.2 Numbe 5-6, pp , eptembe 999. [7] I. E. Pountouaks " Wavelength Contol Potocols fo WD AN's wth Restcted Data Channel Collsons", Intenatonal Jounal of Communcaton stems, vol.3, Issue 4, pp , June [8] I.E.Pountouaks A ultwavelength Contol Achtectue fo Electonc Pocessng ottleneck Reducton In WDA ghtwave Netwoks Compute Communcatons vol. 22 Numbe 5, 6 eptembe 999 pp [9] Ioanns.E.Pountouaks: Desgn Potocol Analss fo Passve ta opolog of WD Netwok, cowave Optcal echnolog ettes John Wle & ons, td, vol.25 Numbe 3, a 2000 pp

7 7

FUNDAMENTALS OF RADIOMETRY

FUNDAMENTALS OF RADIOMETRY 1 FUNDAMENTALS OF RADIOMETRY Lectue 5 Radomety 2 Quanttatve measuement of the popetes of EM adaton nteacton wth matte o emsson fom t Radomety deals wth total EM adaton We extend the concept of adans n

More information

Effectiveness evaluation of electronic warfare command and control system based on grey AHP method

Effectiveness evaluation of electronic warfare command and control system based on grey AHP method Avalable onlne www.jocp.com Jounal of hemcal and Phamaceutcal Reseach, 014, 6(7):535-54 Reseach Atcle ISSN : 0975-7384 ODEN(USA) : JPR5 Effectveness evaluaton of electonc wafae command and contol system

More information

School of Computer Science. control algorithms for use in datagram networks. rates to alleviate the congestion. In the case

School of Computer Science. control algorithms for use in datagram networks. rates to alleviate the congestion. In the case WF 2 Q: Wost-case Fa Weghted Fa Queueng Jon C.R. Bennett FORE Systems Hu Zhang School of Compute Scence Canege Mellon Unvesty Abstact The Genealzed Pocesso Shang (GPS) dscplne s poven to have two desable

More information

arxiv: v1 [math.co] 21 Jan 2016

arxiv: v1 [math.co] 21 Jan 2016 PROOF OF BIJECTION FOR COMBINATORIAL NUMBER SYSTEM axv:60.05794v [math.co] Jan 06 ABU BAKAR SIDDIQUE, SAADIA FARID, AND MUHAMMAD TAHIR Abstact. Combnatoal numbe system epesents a non-negatve natual numbes

More information

A QoS Scheme for a Congestion Core Network Based on Dissimilar QoS Structures in Smart-Phone Environments

A QoS Scheme for a Congestion Core Network Based on Dissimilar QoS Structures in Smart-Phone Environments Sensos 2010, 10, 10006-10013; do:10.3390/s101110006 OPEN ACCESS sensos ISSN 1424-8220 www.mdp.com/jounal/sensos Atcle A QoS Scheme fo a Congeston Coe Netwok Based on Dssmla QoS Stuctues n Smat-Phone Envonments

More information

An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks

An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks An Enegy-Awae QoS Routng Potocol fo Weless Senso Netwoks Kemal Akkaya and Mohamed Youns Depatment of Compute Scence and Electcal Engneeng Unvesty of Mayland, Baltmoe County Baltmoe, MD 225 kemal youns@cs.umbc.edu

More information

Efficient End-to-End Communication Services for Mixed Criticality Avionics Systems

Efficient End-to-End Communication Services for Mixed Criticality Avionics Systems 214 IEEE 22nd Intenatonal Symposum of Qualty of Sevce (IWQoS) Effcent End-to-End Communcaton Sevces fo Mxed Ctcalty Avoncs Systems Yng Fang Yu Hua Xue Lu McGll Unvesty Huazhong Unv. of Sc. and Tech. McGll

More information

Cost of Stable Dimensioning in Optical Packet Ring with Uniform and Symmetric Traffic

Cost of Stable Dimensioning in Optical Packet Ring with Uniform and Symmetric Traffic Telfo Jounal, Vol. 5, No., 03. 43 ost of Stable Dmensonng n Optcal Packet Rng th Unfom and Symmetc Taffc Bogdan Ušćumlć, Veseln Gedć, Anne Gavey, Phlppe Gavey, Mchel Movan, and Peta Matavulj Abstact Optcal

More information

Fault Tolerant Routing For Wireless Sensor Grid Networks

Fault Tolerant Routing For Wireless Sensor Grid Networks Fault oleant Routng Fo Weless Senso Gd etwoks Xn-ng Huang, Jng Deng 2, Jng a and Zeyu Wu Depatment of Electcal Engneeng 2 Depatment of Compute Scence Unvesty of ew Oleans, ew Oleans, A 7048, USA Abstact

More information

Guaranteeing Quality of Service to Peering Traffic

Guaranteeing Quality of Service to Peering Traffic Guaanteeng Qualty of Sevce to Peeng Taffc Ru Zhang-Shen Depatment of Electcal Engneeng Pnceton Unvesty Emal: z@pnceton.edu ck McKeown Compute Systems Laboatoy Stanfod Unvesty Emal: nckm@stanfod.edu Abstact

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

A SAS Macro for Finding Optimal k-means Clustering in One Dimension with Size Constraints

A SAS Macro for Finding Optimal k-means Clustering in One Dimension with Size Constraints Pape SD-02 A SAS Maco fo Fndng Optmal k-means Clusteng n One Dmenson wth Sze Constants Fengao Hu, Geoga Regents Unvesty; Robet E. Johnson, Vandeblt Unvesty ABSTRACT Wang and Song (2011) poposed a k-means

More information

Performance Evaluation of Neighborhood Signature Techniques for Peer-to-Peer Search

Performance Evaluation of Neighborhood Signature Techniques for Peer-to-Peer Search Pefomance Evaluaton of Neghbohood gnatue Technques fo Pee-to-Pee each e L Wang-Chen Lee * Anand vasubamanam Depatment of Compute cence and Engneeng Pennsylvana tate Unvesty Unvesty Pak, PA 16802, UA E-al:

More information

Recognizing Facial Expressions Based on Gabor Filter Selection

Recognizing Facial Expressions Based on Gabor Filter Selection Recognzng Facal Expessons Based on Gabo Flte Selecton Zang Zhang, Xaomn Mu, Le Gao School of Infomaton Engneeng Zhengzhou Unvest Zhengzhou, Chna Abstact Recognton of human emotonal state s an mpotant component

More information

Comparing performance of SRAMT-LE vs other layered encoding schemes regarding TCP friendliness

Comparing performance of SRAMT-LE vs other layered encoding schemes regarding TCP friendliness Compang pefomance of SRAMT-LE vs othe layeed encodng schemes egadng TCP fendlness Chstos Bouas, Apostolos Gkamas Reseach Academc Compute Technology Insttute, 61 Rga Feaou St, GR-26221 Patas, Geece Compute

More information

Vol. 4, No. 6 June 2013 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

Vol. 4, No. 6 June 2013 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved. Vol 4, No 6 June 03 ISSN 079-8407 Jounal Emegng Tends n Computng and Infomaton Scences 009-03 CIS Jounal All ghts eseved http://wwwcsjounalog Optmal Powe Dstbuton System Placement to Install the RTU wth

More information

Some Image Processing Algorithms on a RAP with Wider Bus Networks

Some Image Processing Algorithms on a RAP with Wider Bus Networks Some Image Pocessng Algothms on a RAP wth Wde Bus Netwoks Shung-Shng Lee, Sh-Jnn Hong, Hong-Ren Tsa and Yu-Hua Lee Natonal Tawan Insttute of Technology Depatment of Electcal Engneeng 4, Secton 4, Kee-Lung

More information

THE energy management using advanced metering

THE energy management using advanced metering 48 A Collaboatve Famewok fo Avodng Intefeence Between Zgbee and WF fo Effectve Smat Meteng Applcatons Vkam. K. and Saat Kuma Sahoo Abstact Enegy management s one of the foemost potes of eseach n many countes

More information

Real Time Face Recognition Using Polynomial Regression and Sub-region Color Component Distribution

Real Time Face Recognition Using Polynomial Regression and Sub-region Color Component Distribution Real Tme Face Recognton Usng Polynomal Regesson and Sub-egon Colo Component Dstbuton Manshanka Mondal, Md. Almas Hossan, Md. Matu Rahman, Kamul Hasan Talukde* Compute Scence and Engneeng Dscplne Khulna

More information

Robust Proper Clustering Structure Fuzzy Modeling for Function Approximation

Robust Proper Clustering Structure Fuzzy Modeling for Function Approximation Robust Pope lusteng Stuctue Fuzzy Modelng fo Functon Appoxmaton hh-hng Hsao Depatment of Electcal Engneeng Kao Yuan Unvesty Kaohsung ounty,tawan RO hsao@ooneentustedutw Shun-Feng Su Depatment of Electcal

More information

Volumetric Textures. Esteban W. Gonzalez Clua 1 Marcelo Dreux 2

Volumetric Textures. Esteban W. Gonzalez Clua 1 Marcelo Dreux 2 Volumetc Textues Esteban W. Gonzalez Clua 1 Macelo Deux 2 1 PUC-Ro - Depatment of Compute Scence Rua Maquês de São Vcente, 255, 22443-900, Ro de Janeo, RJ, Bazl esteban @nf.puc-o.b 2 PUC-RIO Mechancal

More information

One-Dimensional Linear Local Prototypes for Effective Selection of Neuro-Fuzzy Sugeno Model Initial Structure

One-Dimensional Linear Local Prototypes for Effective Selection of Neuro-Fuzzy Sugeno Model Initial Structure One-Dmensonal Lnea Local Pototypes fo Effectve Selecton of euo-fuzzy Sugeno Model Intal Stuctue Jace Kabzńs Insttute of Automatc Contol, Techncal Unvesty of Lodz, Stefanowsego 8/22, 90 924 Lodz, Poland,

More information

THE HIERARCHICAL MODEL OF INTERACTION BETWEEN INTELLIGENT AGENTS IN THE MANET CONTROL SYSTEMS

THE HIERARCHICAL MODEL OF INTERACTION BETWEEN INTELLIGENT AGENTS IN THE MANET CONTROL SYSTEMS UDC 6.396.4 THE HIERARCHICAL MODEL OF INTERACTION BETWEEN INTELLIGENT AGENTS IN THE MANET CONTROL SYSTEMS Oleg Ya. Sova Valey A. Romanyuk Mltay Insttute of Telecommuncatons and Infomatzaton Kyv Ukane Dmyto

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 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

More information

Journal of Engineering Science and Technology Review 7 (1) (2014) Research of Anti-Noise Image Salient Region Extraction Method

Journal of Engineering Science and Technology Review 7 (1) (2014) Research of Anti-Noise Image Salient Region Extraction Method Jest Jounal of Engneeng Scence and echnology Revew 7 () (04) 43 47 JOURNAL OF Engneeng Scence and echnology Revew www.jest.og Reseach of Ant-Nose Image Salent Regon Extacton Method Bng XU,*, Shy XIE and

More information

QFSRD:OrthogenesisEvolutionBasedGeneticAlgorithmforQosFitnessScopeawareRouteDiscoveryinAd Hoc Networks

QFSRD:OrthogenesisEvolutionBasedGeneticAlgorithmforQosFitnessScopeawareRouteDiscoveryinAd Hoc Networks Global Jounal of Compute Scence and Technology: E Netwo, Web & Secuty Volume 5 Issue 3 Veson.0 Yea 205 Type: Double Blnd Pee Revewed Intenatonal Reseach Jounal Publshe: Global Jounals Inc. (USA) Onlne

More information

Refraction Ray Normal

Refraction Ray Normal Ray Nomal wave cests θ Bounday θ θ θ less dense, n1 moe dense, n2 (>n1) Moe Smply: θ θ Note: (Lght) Rays bend towads the nomal when gong fom a egon of low ndex of efacton to a egon of hgh ndex of efacton

More information

Risk assessment research for power transformer based on fuzzy synthetic evaluation

Risk assessment research for power transformer based on fuzzy synthetic evaluation Avalable onlne www.jocp.com Jounal of Chemcal and Phamaceutcal Reseach, 23, 5(2):62-68 Reseach Atcle ISSN : 975-7384 CODEN(USA) : JCPRC5 Rsk assessment eseach fo powe tansfome based on fuzzy synthetc evaluaton

More information

KANBAN DEVS MODELLING, SIMULATION AND VERIFICATION

KANBAN DEVS MODELLING, SIMULATION AND VERIFICATION KANBAN DEVS MODELLING, SIMULATION AND VERIFICATION Alex Cave and Saed Nahavand School of Engneeng and Technology, Deakn Unvesty, Geelong, Vctoa 3216, Austala nahavand@deakn.edu.au ABSTRACT Kanban Contol

More information

COVERAGE BASED DENSITY ESTIMATION STRATEGY FOR VANET

COVERAGE BASED DENSITY ESTIMATION STRATEGY FOR VANET Intenatonal Jounal of Advanced Compute Technology (IJACT) ISSN:319-7900 COVERAGE BASED DENSITY ESTIMATION STRATEGY FOR VANET Chun-Chh Lo, Depatment of Compute Scence and Infomaton Engneeng, Natonal Cheng

More information

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE Tolga Numanoglu, Bulent Tavli, and Wendi Heinzelman Depatment of Electical and Compute Engineeing Univesity

More information

Recognition of Shapes for Object Retrieval in Image Databases by Discrete Curve Evolution and Two Consecutive Primitive Edges

Recognition of Shapes for Object Retrieval in Image Databases by Discrete Curve Evolution and Two Consecutive Primitive Edges Poceedngs of the Intenatonal MultConfeence of Engnees and Compute Scentsts 009 Vol I IMECS 009 Mach 8-0 009 Hong Kong Recognton of Shapes fo Object Reteval n Image Databases by Dscete Cuve Evoluton and

More information

Fuzzy Membership Function Based on Structural Information of Data Fang-Zhi ZHU a, Hui-Ru WANG b, Zhi-Jian ZHOU c,*

Fuzzy Membership Function Based on Structural Information of Data Fang-Zhi ZHU a, Hui-Ru WANG b, Zhi-Jian ZHOU c,* 06 Intenatona Confeence on Sevce Scence, Technoogy and Engneeng (SSTE 06 ISBN: 978--60595-35-9 Fuzzy Membeshp Functon Based on Stuctua Infomaton of Data Fang-Zh ZHU a, Hu-Ru WANG b, Zh-Jan ZHOU c,* Coege

More information

SOFT COMPUTING OPTIMIZATION TECHNIQUES FOR SOLAR PHOTOVOLTAIC ARRAYS

SOFT COMPUTING OPTIMIZATION TECHNIQUES FOR SOLAR PHOTOVOLTAIC ARRAYS ARPN Jounal of Engneeng and Appled Scences 2006-20 Asan Reseach Publshng Netwok (ARPN). All ghts eseved. SOFT COMPUTING OPTIMIZATION TECHNIQUES FOR SOLAR PHOTOVOLTAIC ARRAYS Ramapabha R. and Mathu B. L.

More information

THE THETA BLOCKCHAIN

THE THETA BLOCKCHAIN THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent

More information

Interactive Rendering of Deforming NURBS Surfaces

Interactive Rendering of Deforming NURBS Surfaces EUROGRAHICS 97 / D. Fellne and L. Szmay-Kalos Volume 6, (997), Numbe 3 (Guest Edtos) Inteactve Rendeng of Defomng NURBS Sufaces Fedeck W. B. L Rynson W. H. Lau Mak Geen Compute Gaphcs and Meda Laboatoy

More information

Adjusting the Contact Surface of Forming Tools in Order to Compensate for Elastic Deformations during the Process

Adjusting the Contact Surface of Forming Tools in Order to Compensate for Elastic Deformations during the Process Adjustng the Contact Suface of Fomng Tools n Ode to Compensate fo Elastc Defomatons dung the Pocess Knut Goßmann, Hajo Weme, Andè Hadtmann, Las Pente, Sebastan Kechenbaue Insttute fo Machne Tools and Contol

More information

NURBS Curve Shape Modification and Fairness Evaluation for Computer Aided Aesthetic Design

NURBS Curve Shape Modification and Fairness Evaluation for Computer Aided Aesthetic Design oceedngs of the 7th WSEAS Int. Conf. on Sgnal ocessng, Computatonal Geomet & Atfcal Vson, Athens, Geece, August 4-6, 7 38 NURBS Cuve Shape Modfcaton and Faness Evaluaton fo Compute Aded Aesthetc Desgn

More information

Distribution Ray Tracing

Distribution Ray Tracing Dstbuton Ray Tacng In Whtte Ray Tacng we compute lghtng vey cuely Phong + specula global lghtng In Dstbute Ray Tacng we want to compute the lghtng as accuately as possble Use the fomalsm of Raomety Compute

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

Auction-based Resource Allocation for Wireless Local Area Networks in Metropolitan Areas

Auction-based Resource Allocation for Wireless Local Area Networks in Metropolitan Areas Aucton-based Resouce Allocaton fo Weless Local Aea Netwos n Metopoltan Aeas Bo GU*, Kyoo YAMORI** *, Sugang XU*, Yosha TANAKA* *** *Global Infomaton and Telecommuncaton Insttute, Waseda Unvesty, Toyo,

More information

Improved Methods on PCA Based Human Face Recognition for Distorted Images

Improved Methods on PCA Based Human Face Recognition for Distorted Images Poceedngs of the Intenatonal MultConfeence of Engnees and Compute Scentsts 016 Vol I,, Mach 16-18, 016, Hong Kong Impoved Methods on PCA Based Human Face Recognton fo Dstoted Images Buce Poon, M. Ashaful

More information

An Optimization Procedure In A Production Line Of Sokat Soap Industry, Ikotun, Lagos State. Adamawa State, Nigeria.

An Optimization Procedure In A Production Line Of Sokat Soap Industry, Ikotun, Lagos State. Adamawa State, Nigeria. An Optmzaton Pocedue In A Poducton Lne Of Sokat Soap Industy, Ikotun, Lagos State. 1 O.S. Balogun, 2 A.A. Olatun and 3 A.A. Momoh 1 Depatment of Statstcs and Opeatons Reseach, Modbbo Adama Unvesty of Technology,

More information

Research on Fast Reconstruction of Virtual Plant Leaves

Research on Fast Reconstruction of Virtual Plant Leaves Reseach on Fast Reconstucton of Vtual Plant Leaves Fang Ku Lu-Mng Shen 2 College of Infomaton Scence and Technology Hunan Agcultual Unvesty, Changsha, Chna fk@hunau.net Jng Song 2 College of Scence Hunan

More information

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining EE 341 Lectue # 12 Instucto: Zeshan hishti zeshan@ece.pdx.edu Novembe 10, 2014 Potland State Univesity asic Pocessing Unit ontol Signals Hadwied ontol Datapath contol signals Dealing with memoy delay Pipelining

More information

Fair NURBS Curve Generation using a Hand-drawn Sketch for Computer Aided Aesthetic Design

Fair NURBS Curve Generation using a Hand-drawn Sketch for Computer Aided Aesthetic Design Poceedngs of the 7th WSEAS Int. Conf. on Sgnal Pocessng, Computatonal Geomet & Atfcal Vson, Athens, Geece, August 24-26, 27 29 Fa NURBS Cuve Geneaton usng a Hand-dawn Sketch fo Compute Aded Aesthetc Desgn

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

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

Soochow University: Description and Analysis of the Chinese Word Sense Induction System for CLP2010

Soochow University: Description and Analysis of the Chinese Word Sense Induction System for CLP2010 Soochow Unvesty: Descpton and Analyss of the Chnese Wod Sense Inducton System fo CLP2010 Hua Xu Bng Lu Longhua Qan Guodong Zhou Natual Language Pocessng Lab School of Compute Scence and Technology Soochow

More information

Interactive NURBS Tutorial in Virtual Reality

Interactive NURBS Tutorial in Virtual Reality Inteacte NURBS Ttoal n Vtal Realty Eng 477 Poect Fa Octobe 10 2006 Edmond Nadle enadle@mch.ed 734 913-6970 Eng 477 Poect Fa Octobe 10 2006 Eng 477 Poect Fa Octobe 10 2006 NURBS Ces and Sfaces = Non-Unfom

More information

Flood Runoff Simulation Using Grid-based Radar Rainfall and Vflo TM Model

Flood Runoff Simulation Using Grid-based Radar Rainfall and Vflo TM Model Flood Runoff Smulaton Usng Gd-based Rada Ranfall and Vflo TM Model HUI SEONG NOH 1, BYUNG SIK KIM 2, NA RAE KANG 3, HUNG SOO KIM 4 1 Dept. of Cvl Engneeng, Inha Unvesty, Incheon, Koea, heesung80@hanmal.net

More information

Planar Curve Representation and Matching

Planar Curve Representation and Matching Plana Cuve Repesentaton and Matchng Mahe Al-Khayat and Fahad Kamanga Compute Scence and Engneeng Depatment Unvesty of Texas at Alngton Alngton, Texas 7609, USA [al-khay kamanga]@cse.uta.edu Abstact In

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

COSC 6385 Computer Architecture. - Pipelining

COSC 6385 Computer Architecture. - Pipelining COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped

More information

3D Head Tracking Based on Recognition and Interpolation Using a Time-Of- Flight Depth Sensor

3D Head Tracking Based on Recognition and Interpolation Using a Time-Of- Flight Depth Sensor 3D Head Tacng Based on Recognton and Intepolaton Usng a Tme-Of- Flght Depth Senso Salh Bua Götü 1 and Calo Tomas 1,2 1 Canesta Inc., 2 Due Unvesty bgotu@canesta.co tomas@cs.due.edu Abstact Ths pape descbes

More information

Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching

Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching Enhance the Algnment Accuacy of Actve Shape Models Usng Elastc Gaph Matchng Sanqang Zhao 1,, Wen Gao, Shguang Shan, Baoca Yn 1 1) Multmeda and Intellgent Softwae Technology Lab, Beng Unvesty of Technology,

More information

A Bayesian Approach toward Active Learning for Collaborative Filtering

A Bayesian Approach toward Active Learning for Collaborative Filtering A Bayesan Appoach towad Actve Leanng fo Collaboatve Flteng Rong Jn Depatment of Compute Scence and Engneeng Mchgan State Unvesty ong@cse.cmu.edu Abstact Collaboatve flteng s a useful technque fo eplotng

More information

Constructing Service Semantic Link Network Based on the Probabilistic Graphical Model

Constructing Service Semantic Link Network Based on the Probabilistic Graphical Model Intenatonal Jounal of omputatonal Intellgence ystems, Vol. 5, No. 6 (Novembe, 2012), 1040-1051 onstuctng evce emantc Lnk Netwok Based on the Pobablstc Gaphcal odel ANPING ZHAO * ollege of ompute and Infomaton

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

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser

More information

Simulation Based Analysis of FAST TCP using OMNET++

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

More information

Dynamic Optimization of Structures Subjected to Earthquake

Dynamic Optimization of Structures Subjected to Earthquake IACSIT Intenatonal Jounal of Engneeng and Technology, Vol. 8, No. 4, August 06 Dynamc Optmzaton of Stuctues Subjected to Eathquake Aleza Lavae and Aleza Lohasb Abstact To educe the oveall tme of stuctual

More information

Computer Science 141 Computing Hardware

Computer Science 141 Computing Hardware Compute Science 141 Computing Hadwae Fall 2006 Havad Univesity Instucto: Pof. David Books dbooks@eecs.havad.edu [MIPS Pipeline Slides adapted fom Dave Patteson s UCB CS152 slides and May Jane Iwin s CSE331/431

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

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

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

THE MODELLING OF INVOLUTE TEETH GENERATION, WITH THE RELATIVE GENERATING TRAJECTORIES METHOD

THE MODELLING OF INVOLUTE TEETH GENERATION, WITH THE RELATIVE GENERATING TRAJECTORIES METHOD THE MODELLING OF INVOLUTE TEETH GENERATION, WITH THE RELATIVE GENERATING TRAJECTORIES METHOD Vgl Gabel TEODOR 1, Ncuşo BAROIU 1, Flon SUSAC 1 and Ncolae OANCEA 1 ABSTRACT: The modellng of a cul of sufaces

More information

A LIGHT SCATTERING METHOD TO MEASURE REAL-TIME PARTICULATE EMISSIONS

A LIGHT SCATTERING METHOD TO MEASURE REAL-TIME PARTICULATE EMISSIONS A Lght Scatteng Method to Measue Real-tme Patculate Emssons Rose Gong & Keyn Wllams 6 th Austalasan Tanspot Reseach Foum Wellngton New Zealand -3 Octobe 003 A LIGHT SCATTERING METHOD TO MEASURE REAL-TIME

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

1.3 Multiplexing, Time-Switching, Point-to-Point versus Buses

1.3 Multiplexing, Time-Switching, Point-to-Point versus Buses http://achvlsi.ics.foth.g/~kateveni/534 1.3 Multiplexing, Time-Switching, Point-to-Point vesus Buses n R m Aggegation (multiplexing) Distibution (demultiplexing) Simplest Netwoking, like simplest pogamming:

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

Massachusetts Institute of Technology Department of Mechanical Engineering

Massachusetts Institute of Technology Department of Mechanical Engineering cm cm Poblem Massachusetts Institute of echnolog Depatment of Mechanical Engineeing. Intoduction to obotics Sample Poblems and Solutions fo the Mid-em Exam Figue shows a obotic vehicle having two poweed

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

can also encrypt with d and decrypt with e Rivest, Shamir, Adleman Generate two primes: p, q

can also encrypt with d and decrypt with e Rivest, Shamir, Adleman Generate two primes: p, q CSCI, Spng Pulc Ke Cptogph CSCI, Spng CS Pulc Ke Cptogph Bll Cheng http://melot.usc.edu/css k smmetc cptogph Bsed on some NPcomplete polem tvelng slesmn polem n ctes, connected fnd shotest tou, ll ctes

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

UCB CS61C : Machine Structures

UCB CS61C : Machine Structures inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called

More information

Hadoop based Feature Selection and Decision Making Models on Big Data

Hadoop based Feature Selection and Decision Making Models on Big Data Indan Jounal of Scence and Technology, Vol 9(0), DOI: 0.7485/jst/206/v90/88905, Mach 206 ISSN (Pnt) : 0974-6846 ISSN (Onlne) : 0974-5645 Hadoop based Featue Selecton and Decson Makng Models on Bg Data

More information

Goniocolorimetry: from measurement to representation in the CIELAB color space

Goniocolorimetry: from measurement to representation in the CIELAB color space Gonocolomety: fom measuement to epesentaton n the CIELAB colo space Lonel Smonot PHYMAT: Physque des Matéaux, UMR CNRS 6630, Boulevad Mae et Pee Cue, BP 179, 8696 Futuoscope Chasseneul Cedex, Fance Coespondng

More information

4.2. Co-terminal and Related Angles. Investigate

4.2. Co-terminal and Related Angles. Investigate .2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as

More information

AN EXPLICIT GROWTH MODEL OF THE STEREO REGION GROWING ALGORITHM FOR PARALLEL PROCESSING

AN EXPLICIT GROWTH MODEL OF THE STEREO REGION GROWING ALGORITHM FOR PARALLEL PROCESSING Intenatonal Achves of Photogammety, Remote Sensng and Spatal Infomaton Scences, Vol. XXXVIII, Pat 5 AN EXPLICIT GROWTH MODEL OF THE STEREO REGION GROWING ALGORITHM FOR PARALLEL PROCESSING Dongoe Shn*,

More information

CS 61C: Great Ideas in Computer Architecture. Pipelining Hazards. Instructor: Senior Lecturer SOE Dan Garcia

CS 61C: Great Ideas in Computer Architecture. Pipelining Hazards. Instructor: Senior Lecturer SOE Dan Garcia CS 61C: Geat Ideas in Compute Achitectue Pipelining Hazads Instucto: Senio Lectue SOE Dan Gacia 1 Geat Idea #4: Paallelism So9wae Paallel Requests Assigned to compute e.g. seach Gacia Paallel Theads Assigned

More information

Designing Self-checking Circuits with Smooth Power Dissipation

Designing Self-checking Circuits with Smooth Power Dissipation 6 IEEE 4th Conventon of Electcal and Electoncs Engnees n Isael Desgnng Self-checkng Ccuts wth Smooth Powe Dsspaton Benjamn Abamov, Vladm Ostovsky, Ilya Levn Tel Avv Unvesty Ramat Avv, Tel Avv 69978, Isael

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

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS SCALABL NRGY FFICINT AD-HOC ON DMAND DISTANC VCTOR (S-AODV) ROUTING PROTOCOL IN WIRLSS MSH NTWORKS Sikande Singh Reseach Schola, Depatment of Compute Science & ngineeing, Punjab ngineeing College (PC),

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

Fibre-Optic AWG-based Real-Time Networks

Fibre-Optic AWG-based Real-Time Networks Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se

More information

Statistical Bayesian Learning for Automatic Arabic Text Categorization

Statistical Bayesian Learning for Automatic Arabic Text Categorization Jounal of Compute Scence 7 (): 39-45, 20 ISSN 549-3636 20 Scence Publcatons Statstcal Baesan Leanng fo Automatc Aabc Text Categozaton Bassam Al-Salem and Mohd. Juzaddn Ab Azz Depatment of Compute Scence,

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

Beyond a Simple Physically Based Blinn-Phong Model in Real-Time

Beyond a Simple Physically Based Blinn-Phong Model in Real-Time Pactcal Physcally Based Shadng n Flm and Game Poducton: Beyond a Smple Physcally Based Blnn-Phong Model n Real-Tme. Intoducton Yoshhau Gotanda t-ace, Inc. http://eseach.t-ace.com/ We pesented ou mplementaton

More information

Any modern computer system will incorporate (at least) two levels of storage:

Any modern computer system will incorporate (at least) two levels of storage: 1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe

More information

FUZZY ARTMAP AND NEURAL NETWORK APPROACH TO ONLINE PROCESSING OF INPUTS WITH MISSING VALUES

FUZZY ARTMAP AND NEURAL NETWORK APPROACH TO ONLINE PROCESSING OF INPUTS WITH MISSING VALUES FUZZY ARTMAP AD EURAL ETWORK APPROACH TO OLIE PROCESSIG OF IPUTS WITH MISSIG VALUES F.V. elwamondo* and T. Mawala* * School of Electcal and Infomaton Engneeng, Unvesty of the Wtwatesand, Johannesbug, Pvate

More information

Multidimensional Testing

Multidimensional Testing Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of

More information

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation

More information

Weighted Piecewise LDA for Solving the Small Sample Size Problem in Face Verification

Weighted Piecewise LDA for Solving the Small Sample Size Problem in Face Verification TNN05-P485 Weghted Pecewse LDA fo Solvng the Small Sample Sze Poblem n Face Vefcaton Maos Kypeountas, Anastasos Tefas, Membe, IEEE, and Ioanns Ptas, Seno Membe, IEEE Abstact A novel algothm that can be

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

DYNAMIC STORAGE ALLOCATION. Hanan Samet

DYNAMIC STORAGE ALLOCATION. Hanan Samet ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu

More information

ETAtouch RESTful Webservices

ETAtouch RESTful Webservices ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................

More information

FFT Library. Module user s Guide C28x Foundation Software

FFT Library. Module user s Guide C28x Foundation Software FFT Lbay Module use s Gude C8x Foundaton Softwae Texas Instuments Inc., May 00 Texas Instuments Inc., May 00 IMPORTAT OTICE Texas Instuments and ts subsdaes (TI) eseve the ght to make changes to the poducts

More information

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann.

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann. A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Pesonification by Boulic, Thalmann and Thalmann. Mashall Badley National Cente fo Physical Acoustics Univesity of

More information

A BROKER FOR SELECTING AND PROVISIONING HIGH

A BROKER FOR SELECTING AND PROVISIONING HIGH A BROKER FOR SELECTING AND PROVISIONING HIGH QUALITY SYNDICATED DATA (Reseac Pape) Danlo Adagna, Cna Cappello, Maco Comu, Caa Fancalanc, Babaa Penc Poltecnco d Mlano, Mlano, Italy adagna, cappell, comu,

More information