The Internet Ecosystem and Evolution

Size: px
Start display at page:

Download "The Internet Ecosystem and Evolution"

Transcription

1 The Intenet Ecosystem and Evolution

2 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 outing: feasible/fobidden paths, computing valley-fee paths pefe-custome policy, shotest AS-path, policy outing

3 Routing: Basics

4 Routing vesus fowading The concepts of outing and fowading ae often confused Fowading: passing each eceived packet to the next-hop IP addess, by longest-pefix-matching the packet's destination addess in the FIB (Fowading Infomation Base) Fowading needs a coect FIB to be in-place Routing: setting up/maintaining/updating the FIB based on topology infomation collected fom the netwok Responsibility of dedicated outing potocols

5 Static vesus dynamic Static outing: configued manually by the opeato (via the CLI) aely used simple, abitay outing can be configued does not scale and does not adapt to topology changes (in case of a link/node failue) Dynamic outing: FIB maintained by a dedicated outing potocol widely used adaptive and scalable but the paths ae fixed by the outing potocol's policy (e.g., pe-destination shotest path)

6 Centalized vs distibuted Centalized outing: dedicated oute seve, PCE, SDN contolle, sets all FIBs FIB FIB Distibuted outing: outes exchange topology desciptos and set up FIB individually FIB computation FIB topology info FIB FIB computation

7 Link-state vs path-vecto Link-state: outes maintain a distibuted linkstate database that descibes the entie gaph of the netwok They compute shotest paths and set FIB enties based on the fist hop along the paths Path-vecto: outes distibute available paths between each othe Each oute can pick a path it consides best accoding to its autonomous local policy Pemits highly flexible policy outing Distance-vecto: obsolete (RIP)

8 Taxonomy of outing schemes Routing Static Dynamic Centalized Distibuted Link-state Path-vecto

9 Inside and between ASes Thee ae diffeent outing potocols deployed at diffeent levels of the Intenet Inta-domain outing: outing between hosts/ outes inside an AS Inteio-Gateway Potocol (IGP) typically homogeneous outing policy (e.g., shotest path) acoss the AS: link-state Inte-domain outing: outing between ASes Exteio Gateway Potocol (EGP) heteogeneous outing policies: path-vecto

10 A Big Fou Link-state Vecto IGP OSPF, IS-IS RIP EGP BGP OSPF: Open-Shotest Path Fist IS-IS: Intemediate-System-to-Intemediate-System RIP: Routing Infomation Potocol BGP: Bode Gateway Potocol

11 IGP/EGP coopeation Routes un multiple outing potocols side-byside, e.g., an EGP and an IGP each potocol maintains its own RIB oute distills a FIB fom these RIBs AS 2 EGP AS 3 EGP EGP IGP EGP RIB RIB IGP FIB manage FIB

12 IGP/EGP coopeation R1 can each pefix /24 in two ways via (towads R4) o via (to R2 and then though R5) Exteio outes must be distibuted inside an AS as well: ibgp (Intenal BGP) To distinguish, inte- AS BGP is called Extenal BGP: ebgp R1 OSPF ebgp R3 R4 ibgp AS 1 ebgp OSPF R2 R5 ebgp AS /24 AS3

13 IGP/EGP collaboation Each outing potocol has its own RIB: all outing infomation known by the potocol (pefixes, available paths/next-hops to these pefixes, the best path/next-hop fom these, etc.) Each oute uns a FIB manage, esponsible fo assembling the FIB fom the individual RIBs Opeatos associate weights to each potocol If a pefix occus in moe than one RIB, the smallest weighted outing potocol's best path is pefeed local < static < OSPF < ebgp < ibgp Local outes ae always pefeed ebgp < ibgp means that the path though a neighboing AS is pefeed ove a path eceived fom a oute within the same AS: hot-potato outing (late) Weights can be econfigued abitaily

14 Mapping AS-AS business elationships to AS-level paths

15 Inte-domain outing Routing policy: a mechanism to epesent an ISP's AS-level business stategies in the fowading paths povisioned by the ISP Need a sophisticated outing potocol to be able to abitaily map business inteests to paths (flexible policy outing) BGP How to encode these AS-level business inteest into the fowading paths?

16 Tansit vs pee Recall: two ASes typically establish a tansit o a peeing elationship between one anothe tansit: global Intenet access fo a monthly fee pee: fee taffic exchange between two ASes and between any of thei customes We focus on these two specific cases fo now How does outes induced by the tansit and, espectively, the pee elationships look like?

17 Feasible and pohibited paths The fowading paths set up by ASes eflect the business/policy inteests of ISPs Feasible path: a path between two ASes that align with the business inteests of intemediay ASes e.g., any tansit path fom a custome though a povide: economic incentive fo the povide to oute that taffic though its netwok Fobidden path: a fowading path though an AS that goes against the economic incentives of the AS e.g., between two tansit povides though a common custome's netwok the custome was not contacted to oute such taffic economic incentive to block this taffic

18 Tansit: feasible/fobidden paths Feasible path: fom the custome though any povide towads any emote AS (including the povides themselves and all thei customes and pees): Custome AS Povide, Custome AS Remote AS, etc. Fobidden path: between povides via the custome AS: Povide Custome AS Povide Povide Remote AS Custome AS Povide

19 Pee elationship: Feasible paths 1) Between pee ASes: AS6-AS7, AS7-AS8, 2) Between a custome and a pee: AS4-AS7,... custome's custome is also OK: -AS7 AS9 0 AS5 pee elationship AS6 pee elationship AS7 pee elationship AS8 AS4 AS3

20 Pee elationship: Feasible paths 3) Between customes of pee ASes: AS4-AS3 tansit is tansitive : -, -AS3 ae also OK AS9 0 AS5 pee elationship AS6 pee elationship AS7 pee elationship AS8 AS4 AS3

21 Pee elationship: Fobidden paths 1) ASes connected via two o moe pee-pee links: AS5-AS7, AS5-AS8 ( peeing is not tansitive ) 2) Between povide and a pee of an AS: AS9-AS7 AS9 0 AS5 pee elationship AS6 pee elationship AS7 pee elationship AS8 AS4 AS3

22 Pee elationship: Fobidden paths 3) Between an AS's povide and its pee's povide (AS9-0), as this would be a tansit sevice fo which tansit fees could be chaged AS9 0 AS5 pee elationship AS6 pee elationship AS7 pee elationship AS8 AS4 AS3

23 Valley-fee outing Routing by these citeia: valley-fee outing Backgound: paths confoming to the tansitpee elationships neve contain valleys in the tansit hieachy AS3 AS4 AS5 AS6 AS7 AS8

24 Valley-fee outing: Rules Definition: a path is valley-fee, if it contains fist, zeo o moe custome povide links then zeo o one pee pee link and finally zeo o moe povide custome links AS3 AS5 AS6 AS8

25 Valley-fee outing: Repesentation How to check the valley-fee popety? We use a simple labeled diected gaph-model The nodes of the gaph ae ASes and the acs/ links ae as follows: tansit link in the custome povide diection: diected ac maked with label p (povide) tansit link in the povide custome diection: diected ac maked by label c (custome) pee link in any diection: diected ac with label (pee)

26 Valley-fee outing: Repesentation = pee link = AS3 AS4 AS5 AS3 AS4 AS5 p c AS6 AS7 AS8 AS6 AS7 AS8

27 Valley-fee outing: Calculation A gaph epesentation can be eadily used to decide whethe an AS-level path is valley-fee Is the below path feasible in valley-fee outing? AS3 AS4 AS5 AS6 AS7 AS8

28 Valley-fee outing: Calculation 1) Obtain the diected gaph epesentation AS3 AS4 AS5 p c AS6 AS7 AS8 Note the consecutive labels of the acs along the diected path: p, p, c,, c

29 Valley-fee outing: Calculation Theoem: a path is fobidden if and only if it contains a two-hop, c, p, o subpath Coollay: a path is valley-fee, if and only it the labels match the below egula expession: p*?c* Regula expession: a context-fee gamma to decide whethe some input coesponds to a cetain patten *: zeo/moe occuences of the peceding label?: zeo o one occuence of the peceding label

30 Valley-fee outing: Example 2) Check if labels match the egexp: p*?c* AS3 AS4 AS5 p c AS6 AS7 AS8 Label sting ppcc does not match the egexp: path is fobidden (thee is a c subpath)

31 Valley-fee outing: Example Is the below AS6 AS8 path valley-fee? AS3 AS4 AS5 AS6 AS7 AS8

32 Valley-fee outing: Example Reading out the path's labels fom the gaph epesentation: p, p, c, c Matches the egexp p*?c*: path is feasible AS3 AS4 AS5 p c AS6 AS7 AS8

33 Valley-fee outing: Example But the AS6 AS8 path is fobidden: p,,, c Contains an subpath AS3 AS4 AS5 AS6 AS7 AS8

34 Path pefeence Suppose that AS3 have thee valley-fee paths to a pefix in AS6: via the tansit povide anothe via the pee AS4 o diectly though the diect custome link to AS6 How to choose between these? AS3 AS5 AS4 AS6

35 Path pefeence If taffic is sent though the povide: tansit fee is chaged fo this taffic If the path via the pee AS is chosen: the taffic is most pobably fee of chage but if we oveload the pee link the symmetic taffic demand equiement might be violated in the peeing ageement the othe side might de-pee us If taffic is sent though the custome: it is guaanteed that no fees will be chaged

36 Pefe custome ule Typically, ISPs pefe paths via a custome (if available) Pefeence ode: 1. Path whose fist link is a povide custome link (fee of chage) 2. Path with a pee pee link as the fist link (pobably fee) 3. Path stating with a custome povide link (comes fo a fee!) AS3 AS5 AS4 AS6

37 Pefe custome ule In tems of the gaph model: path though the povide: pcc, fist link is labeled p the pee path: c, fist link: diect path: c Obsevation: the fist link along a valley-fee paths fixes its pefeence AS3 AS5 AS4 AS6

38 Pefe custome ule Denote with l(p) the label of the fist link along a path P: P p (povide path): l(p p ) = p P c (custome path): l(p c ) = c P (pee path): l(p ) = Theoem: the pefe custome ule equals the below elation: P c < P < P p Smalle weighted path pefeed AS3 AS5 AS4 AS6

39 Pefe custome ule In ou specific example: P c < (povide path) P < (pee path) P p (tansit path) Again, the smalle the bette AS3 AS4 p c p c AS5 AS6

40 Pefe custome ule The pefe custome ule does not always poduce optimal paths If thee is a longish sequence of custome links between and AS4 Fo smalle latency, it may be plausible to choose the tansit via instead and pay the tansit fee Soveeign decision of an opeato ISP policies can be eally complex! AS3 longish custome path AS4

41 Shotest AS path If thee ae multiple, equally pefeed valley-fee paths available to a pefix Hee, can choose fom a 2-AS-hop long and a vey long custome path It is plausible to pick the shote one: shotest AS path policy Ode of evaluation: take all valley-fee paths choose the most pefeed ones in line with the pefe-custome ule pick the shotest one fom the esultant paths longish custome path AS3

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

Chapter 4 Network Layer

Chapter 4 Network Layer Chapte 4 Netwok Laye Reti di Elaboatoi Coso di Lauea in Infomatica Univesità degli Studi di Roma La Sapienza Canale A-L Pof.ssa Chiaa Petioli Pate di queste slide sono state pese dal mateiale associato

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

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

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

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

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

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

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

Reachable State Spaces of Distributed Deadlock Avoidance Protocols

Reachable State Spaces of Distributed Deadlock Avoidance Protocols Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications

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

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:

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

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

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

Lecture # 04. Image Enhancement in Spatial Domain

Lecture # 04. Image Enhancement in Spatial Domain Digital Image Pocessing CP-7008 Lectue # 04 Image Enhancement in Spatial Domain Fall 2011 2 domains Spatial Domain : (image plane) Techniques ae based on diect manipulation of pixels in an image Fequency

More information

Perfect Bayesian Equilibrium in Extensive- Form Games Ù

Perfect Bayesian Equilibrium in Extensive- Form Games Ù Pefect Bayesian Equiibium in Extensive-Fom Games Page Pefect Bayesian Equiibium in Extensive- Fom Games Ù Intoduction Bayes Requiement Bayes Requiement Bayes Requiement 5 Bayes Requiement 4 6 A Refinement

More information

Pipes, connections, channels and multiplexors

Pipes, connections, channels and multiplexors Pipes, connections, channels and multiplexos Fancisco J. Ballesteos ABSTRACT Channels in the style of CSP ae a poeful abstaction. The ae close to pipes and connections used to inteconnect system and netok

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

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces A Family of Distibuted Deadlock Avoidance Potocols and thei Reachable State Spaces Césa Sánchez, Henny B. Sipma, and Zoha Manna Compute Science Depatment Stanfod Univesity, Stanfod, CA 94305-9025 {cesa,sipma,manna}@cs.stanfod.edu

More information

# $!$ %&&' Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved

# $!$ %&&' Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved A note on the use of these ppt slides: We e making these slides feely available to all (faculty, students, eades). They e in PowePoint fom so you can add, modify, and delete slides (including this one)

More information

Hierarchical Peer-to-peer Systems

Hierarchical Peer-to-peer Systems Hieachical Pee-to-pee ystems L. Gacés-Eice 1, E.W. Biesack 1, P.A. Felbe 1, K.W. Ross 2, and G. Uvoy-Kelle 1 1 Institut EURECOM 06904 ophia Antipolis, Fance {gaces ebi felbe uvoy}@euecom.f 2 Polytechnic

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

On the throughput-cost tradeoff of multi-tiered optical network architectures

On the throughput-cost tradeoff of multi-tiered optical network architectures 1 On the thoughput-cost tadeoff of multi-tieed optical netwok achitectues Guy Weichenbeg, Vincent W. S. Chan, and Muiel Médad Laboatoy fo Infomation and Decision Systems Massachusetts Institute of Technology

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

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

User Group testing report

User Group testing report Use Goup testing epot Deliveable No: D6.10 Contact No: Integated Poject No. 506723: SafetyNet Aconym: SafetyNet Title: Building the Euopean Road Safety Obsevatoy Integated Poject, Thematic Pioity 6.2 Sustainable

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

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

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

Secure Collaboration in Mediator-Free Environments

Secure Collaboration in Mediator-Free Environments Secue Collaboation in Mediato-Fee Envionments Mohamed Shehab School of Electical and Compute Engineeing Pudue Univesity West Lafayette, IN, USA shehab@pudueedu Elisa Betino Depatment of Compute Sciences

More information

FACE VECTORS OF FLAG COMPLEXES

FACE VECTORS OF FLAG COMPLEXES FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.

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

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

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

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number. Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show

More information

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially

More information

Conversion Functions for Symmetric Key Ciphers

Conversion Functions for Symmetric Key Ciphers Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401

More information

Accelerating Storage with RDMA Max Gurtovoy Mellanox Technologies

Accelerating Storage with RDMA Max Gurtovoy Mellanox Technologies Acceleating Stoage with RDMA Max Gutovoy Mellanox Technologies 2018 Stoage Develope Confeence EMEA. Mellanox Technologies. All Rights Reseved. 1 What is RDMA? Remote Diect Memoy Access - povides the ability

More information

UCLA Papers. Title. Permalink. Authors. Publication Date. Localized Edge Detection in Sensor Fields. https://escholarship.org/uc/item/3fj6g58j

UCLA Papers. Title. Permalink. Authors. Publication Date. Localized Edge Detection in Sensor Fields. https://escholarship.org/uc/item/3fj6g58j UCLA Papes Title Localized Edge Detection in Senso Fields Pemalink https://escholashipog/uc/item/3fj6g58j Authos K Chintalapudi Govindan Publication Date 3-- Pee eviewed escholashipog Poweed by the Califonia

More information

User Specified non-bonded potentials in gromacs

User Specified non-bonded potentials in gromacs Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of

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

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

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

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

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

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which

More information

Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems

Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems Achievable Catalog Size in Pee-to-Pee Video-on-Demand Systems Yacine Boufkhad, Fabien Mathieu, Fabien De Montgolfie, Diego Peino, Lauent Viennot To cite this vesion: Yacine Boufkhad, Fabien Mathieu, Fabien

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

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

E.g., movie recommendation

E.g., movie recommendation Recommende Systems Road Map Intodction Content-based ecommendation Collaboative filteing based ecommendation K-neaest neighbo Association les Matix factoization 2 Intodction Recommende systems ae widely

More information

SOCIAL COMPUTING: AN INTELLIGENT AND RESPONSIVE SYSTEM

SOCIAL COMPUTING: AN INTELLIGENT AND RESPONSIVE SYSTEM SOCIAL COMPUTING: AN INTELLIGENT AND RESPONSIVE SYSTEM Dev Rishi Tekiwal, Undegaduate Student Akapava De, Undegaduate Student Ezhilmaan D, Assistant Pofesso School of Computing Science and Engineeing,

More information

Elliptic Generation Systems

Elliptic Generation Systems 4 Elliptic Geneation Systems Stefan P. Spekeijse 4.1 Intoduction 4.1 Intoduction 4.2 Two-Dimensional Gid Geneation Hamonic Maps, Gid Contol Maps, and Poisson Systems Discetization and Solution Method Constuction

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

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

The EigenRumor Algorithm for Ranking Blogs

The EigenRumor Algorithm for Ranking Blogs he EigenRumo Algoithm fo Ranking Blogs Ko Fujimua N Cybe Solutions Laboatoies N Copoation akafumi Inoue N Cybe Solutions Laboatoies N Copoation Masayuki Sugisaki N Resonant Inc. ABSRAC he advent of easy

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

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

Automatically Testing Interacting Software Components

Automatically Testing Interacting Software Components Automatically Testing Inteacting Softwae Components Leonad Gallaghe Infomation Technology Laboatoy National Institute of Standads and Technology Gaithesbug, MD 20899, USA lgallaghe@nist.gov Jeff Offutt

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

Monte Carlo Techniques for Rendering

Monte Carlo Techniques for Rendering Monte Calo Techniques fo Rendeing CS 517 Fall 2002 Compute Science Conell Univesity Announcements No ectue on Thusday Instead, attend Steven Gotle, Havad Upson Hall B17, 4:15-5:15 (efeshments ealie) Geomety

More information

DISTRIBUTION MIXTURES

DISTRIBUTION MIXTURES Application Example 7 DISTRIBUTION MIXTURES One fequently deals with andom vaiables the distibution of which depends on vaious factos. One example is the distibution of atmospheic paametes such as wind

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

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

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

Module 6 STILL IMAGE COMPRESSION STANDARDS

Module 6 STILL IMAGE COMPRESSION STANDARDS Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.

More information

SIMOCODE pro. Motor Management and Control Devices. SIMOCODE pro for Modbus RTU. Answers for industry. Edition 04/2015

SIMOCODE pro. Motor Management and Control Devices. SIMOCODE pro for Modbus RTU. Answers for industry. Edition 04/2015 SIMOCODE po Moto Management and Contol Devices SIMOCODE po fo Modbus RTU Geätehandbuch Configuation Manual Edition 04/2015 Answes fo industy. Intoduction 1 System configuation and commissioning with RTU

More information

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1 Impovement of Fist-ode Takagi-Sugeno Models Using Local Unifom B-splines Felipe Fenández, Julio Gutiéez, Gacián Tiviño and Juan Calos Cespo Dep. Tecnología Fotónica, Facultad de Infomática Univesidad Politécnica

More information

Simulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM

Simulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM J. Basic. Appl. Sci. Res., 1(10)1594-1602, 2011 2011, TextRoad Publication ISSN 2090-424X Jounal of Basic and Applied Scientific Reseach www.textoad.com Simulation and Pefomance Evaluation of Netwok on

More information

Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing

Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing IEEE TRANSACTIONS ON COMPUTERS, VOL. 50, NO. 9, SEPTEMBER 200 949 Dynamic Multiple Paity (DMP) Disk Aay fo Seial Tansaction Pocessing K.H. Yeung, Membe, IEEE, and T.S. Yum, Senio Membe, IEEE AbstactÐThe

More information

Also available at ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010)

Also available at  ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) Also available at http://amc.imfm.si ISSN 1855-3966 (pinted edn.), ISSN 1855-3974 (electonic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) 109 120 Fulleene patches I Jack E. Gave Syacuse Univesity, Depatment

More information

MIS to Prepress ICS. Version Date: File: ICS-MIS-Prepress-1.01.doc,.pdf. Origination & Prepress WG

MIS to Prepress ICS. Version Date: File: ICS-MIS-Prepress-1.01.doc,.pdf. Origination & Prepress WG MIS to Pepess ICS Vesion 1.01 Date: 2006-01-02 File: ICS-MIS-Pepess-1.01.doc,.pdf Oigination & Pepess WG Abstact This ICS defines the Inteface between the MIS and Pepess. It specifies the Pocesses fo a

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

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

Hierarchical Region Mean-Based Image Segmentation

Hierarchical Region Mean-Based Image Segmentation Hieachical Region Mean-Based Image Segmentation Slawo Wesolkowski and Paul Fieguth Systems Design Engineeing Univesity of Wateloo Wateloo, Ontaio, Canada, N2L-3G1 s.wesolkowski@ieee.og, pfieguth@uwateloo.ca

More information

MULTI-AGENT SYSTEM FOR NETWORK ATTACK DETECTION

MULTI-AGENT SYSTEM FOR NETWORK ATTACK DETECTION Intenational Jounal of Civil Engineeing and Technology (IJCIET) Volume 9, Issue 6, June 2018, pp. 279 286, Aticle ID: IJCIET_09_06_032 Available online at http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=9&itype=6

More information

Dual Licensing in Open Source Software Markets

Dual Licensing in Open Source Software Markets Dual Licensing in Open Souce Softwae Makets Stefano Comino Fabio M. Manenti Novembe 2008 Abstact In this pape we pesent a theoetical model to study the chaacteistics and the commecial sustainability of

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

Lecture 27: Voronoi Diagrams

Lecture 27: Voronoi Diagrams We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the

More information

Using Data Flow Diagrams for Supporting Task Models

Using Data Flow Diagrams for Supporting Task Models in Companion Poc. of 5 th Euogaphics Wokshop on Design, Specification, Veification of Inteactive Systems DSV-IS 98 (Abingdon, 3-5 June 1998), P. Makopoulos & P. Johnson (Eds.), Spinge-Velag, Belin, 1998.

More information

The concept of PARPS - Packet And Resource Plan Scheduling

The concept of PARPS - Packet And Resource Plan Scheduling The concept of PARPS - Packet And Resouce Plan Scheduling Magnus Eiksson 1 and Håkan Sätebeg 2 1) Dept. of Signals, Sensos and Systems, Royal Inst. of Technology, Sweden. E-mail: magnus.eiksson@ite.mh.se.

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

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300

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

Time-Constrained Big Data Transfer for SDN-Enabled Smart City

Time-Constrained Big Data Transfer for SDN-Enabled Smart City Emeging Tends, Issues, and Challenges in Big Data and Its Implementation towad Futue Smat Cities Time-Constained Big Data Tansfe fo SDN-Enabled Smat City Yuanguo Bi, Chuan Lin, Haibo Zhou, Peng Yang, Xuemin

More information

Back to basics J. Addressing is the key! Application (HTTP, DNS, FTP) Application (HTTP, DNS, FTP) Transport. Transport (TCP/UDP) Internet (IPv4/IPv6)

Back to basics J. Addressing is the key! Application (HTTP, DNS, FTP) Application (HTTP, DNS, FTP) Transport. Transport (TCP/UDP) Internet (IPv4/IPv6) Routing Basics Back to basics J Application Presentation Application (HTTP, DNS, FTP) Data Application (HTTP, DNS, FTP) Session Transport Transport (TCP/UDP) E2E connectivity (app-to-app) Port numbers

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

On Adaptive Bandwidth Sharing with Rate Guarantees

On Adaptive Bandwidth Sharing with Rate Guarantees On Adaptive Bandwidth Shaing with Rate Guaantees N.G. Duffield y T. V. Lakshman D. Stiliadis y AT&T Laboatoies Bell Labs Rm A175, 180 Pak Avenue Lucent Technologies Floham Pak, 101 Cawfods Cone Road NJ

More information

Internet Routing Basics

Internet Routing Basics Internet Routing Basics Back to basics J Application Presentation Application (HTTP, DNS, FTP) Data Application (HTTP, DNS, FTP) Session Transport Transport (TCP/UDP) E2E connectivity (app-to-app) Port

More information

An effective hop-by-hop Interest shaping mechanism for CCN communications

An effective hop-by-hop Interest shaping mechanism for CCN communications An effective hop-by-hop Inteest shaping mechanism fo CCN communications Natalya Rozhnova, Sege Fdida To cite this vesion: Natalya Rozhnova, Sege Fdida. An effective hop-by-hop Inteest shaping mechanism

More information

NODAL AND LOOP ANALYSIS TECHNIQUES

NODAL AND LOOP ANALYSIS TECHNIQUES NODAL AND LOOP ANALYSIS TECHNIQUES LEANING GOALS NODAL ANALYSIS LOOP ANALYSIS Deelop systematic techniques to determine all the oltages and currents in a circuit NODE ANALYSIS One of the systematic ways

More information

Prof. Feng Liu. Fall /17/2016

Prof. Feng Liu. Fall /17/2016 Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2

More information

Routing Basics. SANOG July, 2017 Gurgaon, INDIA

Routing Basics. SANOG July, 2017 Gurgaon, INDIA Routing Basics SANOG 30 14-18 July, 2017 Gurgaon, INDIA Back to basics J Application Presentation Application (HTTP, DNS, FTP) Data Application (HTTP, DNS, FTP) Session Transport Transport (TCP/UDP) E2E

More information

A General Characterization of Representing and Determining Fuzzy Spatial Relations

A General Characterization of Representing and Determining Fuzzy Spatial Relations 7 The Intenational Aab Jounal of Infomation Technolog A Geneal Chaacteization of Repesenting and Detemining Fuzz Spatial Relations Lui Bai and Li Yan 2 College of Infomation Science and Engineeing, Notheasten

More information

3D Hand Trajectory Segmentation by Curvatures and Hand Orientation for Classification through a Probabilistic Approach

3D Hand Trajectory Segmentation by Curvatures and Hand Orientation for Classification through a Probabilistic Approach 3D Hand Tajectoy Segmentation by Cuvatues and Hand Oientation fo Classification though a Pobabilistic Appoach Diego R. Faia and Joge Dias Abstact In this wok we pesent the segmentation and classification

More information

Modeling a shared medium access node with QoS distinction

Modeling a shared medium access node with QoS distinction Modeling a shaed medium access node with QoS distinction Matthias Gies, Jonas Geutet Compute Engineeing and Netwoks Laboatoy (TIK) Swiss Fedeal Institute of Technology Züich CH-8092 Züich, Switzeland email:

More information

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform A Shape-peseving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonunifom Fuzzification Tansfom Felipe Fenández, Julio Gutiéez, Juan Calos Cespo and Gacián Tiviño Dep. Tecnología Fotónica, Facultad

More information

The Java Virtual Machine. Compiler construction The structure of a frame. JVM stacks. Lecture 2

The Java Virtual Machine. Compiler construction The structure of a frame. JVM stacks. Lecture 2 Compile constuction 2009 Lectue 2 Code geneation 1: Geneating code The Java Vitual Machine Data types Pimitive types, including intege and floating-point types of vaious sizes and the boolean type. The

More information

MULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION

MULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION Intenational Achives of the Photogammety Remote Sensing and Spatial Infomation Sciences Volume XXXIX-B3 2012 XXII ISPRS Congess 25 August 01 Septembe 2012 Melboune Austalia MULTI-TEMPORAL AND MULTI-SENSOR

More information