Motivation. Synthetic OOD concepts and reuse Lecture 4: Separation of concerns. Problem. Solution. Deleting composites that share parts. Or is it?

Size: px
Start display at page:

Download "Motivation. Synthetic OOD concepts and reuse Lecture 4: Separation of concerns. Problem. Solution. Deleting composites that share parts. Or is it?"

Transcription

1 Synthtic OOD concpts and rus Lctur 4: Sparation of concrns Topics: Complx concrn: Mmory managmnt Exampl: Complx oprations on composit structurs Problm: Mmory laks Solution: Rfrnc counting Motivation Suppos w dfin a function: Expr* mkexpr(void) Expr* l1 = nw Litral(2); Expr* v = nw Variabl( x ); Expr* t1 = nw Add(l1,v); Expr* l2 = nw Litral(2); Expr* t2 = nw Multiply(l2,t1); Problm Solution Suppos a clint program xcuts th cod: Expr* = mkexpr(); dlt ; What happns? How could w nsur that whn a composit objct is dltd, its parts ar also dltd? class Expr virtual ~Expr() ; class BinaryExpr : public Expr ~BinaryExpr() dlt(lftoprand); dlt(rightoprand); ; Or is it? Oftn dsirabl for two or mor composit objcts to shar th sam componnt Exampl: Expr* l = nw Litral(2); Expr* v = nw Variabl( x ); Expr* t1 = nw Add(l,v); Expr* t2 = nw Hr, objct l is th child of two composit objcts, t1 and t2. Will our mmory-rclamation schm work now? Dlting composits that shar parts Not saf for dstructor of a composit class to dlt its childrn if ths objcts might b childrn of multipl composit objcts Solution: dsign a protocol that tracks rfrncs to objcts and that dlts an objct only whn its rfrnc count rachs 0. Clints nvr call dlt Objcts call dlt on thmslvs! Clints must xplicitly notify objcts whn rfrncs to ths objcts ar assignd or ovrwrittn 1

2 Abstract rf-counting class class RCObjct public: void addrf() ++rfcount; void rmovrf() if(--rfcount <= 0) dlt this; protctd: RCObjct() : rfcount(0) virtual ~RCObjct() privat: int rfcount; ; Exampl Modify class Expr as follows: class Expr : public RCObjct ; Subsquntly, vry class that drivs from Expr will inhrit rfrnc counting infrastructur Exampl Modify BinaryExpr as follows: class BinaryExpr : public Expr BinaryExpr( Expr* l, Expr* r ) : lftoprand(l), rightoprand(r) l->addrf(); r->addrf(); ~BinaryExpr() l->rmovrf(); r->rmovrf(); ; Exampl (continud) Now w writ a function that crats an xprssion: Expr* cratexprssion(void) Expr* l = nw Litral(2); Expr* v = nw Variabl( x ); Expr* t1 = nw Add(l,v); Expr* t2 = nw rturn t2; Rquirs clint to incrmnt rfcount of root objct (pointd to hr by t2 bfor it gos out of scop) Stp 1 Stp 2 Expr* cratexprssion(void) Expr* l = nw Litral(2); Expr* v = nw Variabl( x ); Expr* t1 = nw Add(l,v); Expr* t2 = nw rturn t2; Expr* cratexprssion(void) Expr* l = nw Litral(2); Expr* v = nw Variabl( x ); Expr* t1 = nw Add(l,v); Expr* t2 = nw rturn t2; 2

3 Stp 3 Stp 4 Expr* cratexprssion(void) Expr* l = nw Litral(2); Expr* v = nw Variabl( x ); Expr* t1 = nw Add(l,v); Expr* t2 = nw rturn t2; Expr* cratexprssion(void) Expr* l = nw Litral(2); Expr* v = nw Variabl( x ); Expr* t1 = nw Add(l,v); Expr* t2 = nw rturn t2; rfcount=2 Exampl (continud) Clint cod thn uss as follows: Expr* = cratexprssion(); // nw lin // rathr than dlt() Adding rfrnc to rturnd objct rfcount=2 Printing xprssion Rmoving rf: Stp 1 rfcount=2 3

4 Rmoving rf: Stp 2 Rmoving rf: Stp 3 Rmoving rf: Stp 4 Rmoving rf: Stp 5 Rmoving rf: Stp 6 Rmoving rf: Stp 7 4

5 Rmoving rf: Stp 8 Concptual (but flawd) altrnativ implmntation of cratexprssion() Expr* cratexprssion(void) Expr* l = nw Litral(2); l->addrf(); Expr* v = nw Variabl( x ); v->addrf(); Expr* t1 = nw Add(l,v); t1->addrf(); Expr* t2 = nw t2->addrf(); l->rmovrf(); v->rmovrf(); t1->rmovrf(); t2->rmovrf(); // What happns hr??? rturn t2; Mixin classs RCObjct is an xampl of a mixin class So-calld bcaus dsignd to ncapsulat orthogonal functionality that may b mixd into classs in an xisting hirarchy Mixin classs ar always abstract May us multipl inhritanc to incorporat functionality in a mixin class if bas class dos not nd it or if bas class nds functionality from multipl mixin classs 5

Objectives. Two Ways to Implement Lists. Lists. Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues

Objectives. Two Ways to Implement Lists. Lists. Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues Chaptr 24 Implmnting Lists, Stacks, Quus, and Priority Quus CS2: Data Structurs and Algorithms Colorado Stat Univrsity Original slids by Danil Liang Modifid slids by Chris Wilcox Objctivs q To dsign common

More information

Systems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point.

Systems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point. 3-5 Systms in Thr Variabls TEKS FOCUS VOCABULARY TEKS (3)(B) Solv systms of thr linar quations in thr variabls by using Gaussian limination, tchnology with matrics, and substitution. Rprsntation a way

More information

Midterm 2 - Solutions 1

Midterm 2 - Solutions 1 COS 26 Gnral Computr Scinc Spring 999 Midtrm 2 - Solutions. Writ a C function int count(char s[ ]) that taks as input a \ trminatd string and outputs th numbr of charactrs in th string (not including th

More information

Greedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works.

Greedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works. Algorithm Grdy Algorithm 5- Grdy Algorithm Grd i good. Grd i right. Grd work. Wall Strt Data Structur and Algorithm Andri Bulatov Algorithm Grdy Algorithm 5- Algorithm Grdy Algorithm 5- Intrval Schduling

More information

Building a Scanner, Part I

Building a Scanner, Part I COMP 506 Ric Univrsity Spring 2018 Building a Scannr, Part I sourc cod IR Front End Optimizr Back End IR targt cod Copyright 2018, Kith D. Coopr & Linda Torczon, all rights rsrvd. Studnts nrolld in Comp

More information

Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8.

Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8. Rviw: Shift-Rduc Parsing Bottom-up parsing uss two actions: Bottom-Up Parsing II Lctur 8 Shift ABC xyz ABCx yz Rduc Cbxy ijk CbA ijk Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur 8 2 Rcall: h Stack

More information

Introduction to Data Mining

Introduction to Data Mining Introduction to Data Mining Lctur #15: Clustring-2 Soul National Univrsity 1 In Tis Lctur Larn t motivation and advantag of BFR, an xtnsion of K-mans to vry larg data Larn t motivation and advantag of

More information

TCP Congestion Control. Congestion Avoidance

TCP Congestion Control. Congestion Avoidance TCP Congstion Control TCP sourcs chang th snding rat by modifying th window siz: Window = min {Advrtisd window, Congstion Window} Rcivr Transmittr ( cwnd ) In othr words, snd at th rat of th slowst componnt:

More information

8.3 INTEGRATION BY PARTS

8.3 INTEGRATION BY PARTS 8.3 Intgration By Parts Contmporary Calculus 8.3 INTEGRATION BY PARTS Intgration by parts is an intgration mthod which nabls us to find antidrivativs of som nw functions such as ln(x) and arctan(x) as

More information

A Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 )

A Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 ) A Brif Summary of Draw Tools in MS Word with Exampls! ( Pag 1 ) Click Viw command at top of pag thn Click Toolbars thn Click Drawing! A chckmark appars in front of Drawing! A toolbar appars at bottom of

More information

" dx v(x) $ % You may also have seen this written in shorthand form as. & ' v(x) + u(x) '# % ! d

 dx v(x) $ % You may also have seen this written in shorthand form as. & ' v(x) + u(x) '# % ! d Calculus II MAT 146 Mthods of Intgration: Intgration by Parts Just as th mthod of substitution is an intgration tchniqu that rvrss th drivativ procss calld th chain rul, Intgration by parts is a mthod

More information

The Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline PS 6 Ntwork Programming Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du http://www.cs.clmson.du/~mwigl/courss/cpsc6 Th Ntwork Layr: Routing & ddrssing

More information

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy PS Intrntworking Th Ntwork Layr: Routing & ddrssing Outlin Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du Novmbr, Ntwork layr functions Routr architctur

More information

Ray Tracing. Wen-Chieh (Steve) Lin National Chiao-Tung University

Ray Tracing. Wen-Chieh (Steve) Lin National Chiao-Tung University Ra Tracing Wn-Chih (Stv Lin National Chiao-Tung Univrsit Shirl, Funamntals of Computr Graphics, Chap 15 I-Chn Lin s CG slis, Doug Jams CG slis Can W Rnr Imags Lik Ths? Raiosit imag Pictur from http://www.graphics.cornll.u/onlin/ralistic/

More information

XML Publisher with connected query: A Primer. Session #30459 March 19, 2012

XML Publisher with connected query: A Primer. Session #30459 March 19, 2012 XML Publishr with connctd qury: A Primr Sssion #30459 March 19, 2012 Agnda/ Contnts Introduction Ovrviw of XMLP Gtting Startd Bst practics for building a basic XMLP rport Connctd Qury Basics Building a

More information

Principles of Programming Languages Topic: Formal Languages II

Principles of Programming Languages Topic: Formal Languages II Principls of Programming Languags Topic: Formal Languags II CS 34,LS, LTM, BR: Formal Languags II Rviw A grammar can b ambiguous i.. mor than on pars tr for sam string of trminals in a PL w want to bas

More information

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1 Advancd Computr Graphics CSE 63 [Spring 208], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 27 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2

More information

The semantic WEB Roles of XML & RDF

The semantic WEB Roles of XML & RDF Th smantic WEB Rols of XML & RDF STEFAN DECKER AND SERGEY MELNIK FRANK VAN HARMELEN, DIETER FENSEL, AND MICHEL KLEIN JEEN BROEKSTRA MICHAEL ERDMANN IAN HORROCKS Prsntd by: Iniyai Thiruvalluvan CSCI586

More information

Oracle Data Relationship Management Suite User's Guide. Release

Oracle Data Relationship Management Suite User's Guide. Release Oracl Data Rlationship Managmnt Suit Usr's Guid Rlas 11.1.2.4.346 E75912-02 Jun 2018 Oracl Data Rlationship Managmnt Suit Usr's Guid, Rlas 11.1.2.4.346 E75912-02 Copyright 1999, 2018, Oracl and/or its

More information

CISC 360 Fa2009. Overview. Computational Example. Real-World Pipelines: Car Washes. Michela Taufer. Pipelined

CISC 360 Fa2009. Overview. Computational Example. Real-World Pipelines: Car Washes. Michela Taufer. Pipelined CISC 360 a2009 Ovrviw ichla Taufr Powrpoint Lctur Nots for Computr Systms: Prorammr's Prspctiv,. ryant and. O'Hallaron, Prntic Hall, CS:PP 2003 2 CISC 360 aʼ08 al-orld Piplins: Car ashs Computational xampl

More information

1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table

1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table 1. Trac th array for Bubbl sort 34, 8, 64, 51, 3, 1. And fill in th following tabl bubbl(intgr Array x, Intgr n) Stp 1: Intgr hold, j, pass; Stp : Boolan switchd = TRUE; Stp 3: for pass = 0 to (n - 1 &&

More information

RFC Java Class Library (BC-FES-AIT)

RFC Java Class Library (BC-FES-AIT) RFC Java Class Library (BC-FES-AIT) HELP.BCFESDEG Rlas 4.6C SAP AG Copyright Copyright 2001 SAP AG. All Rcht vorbhaltn. Witrgab und Vrvilfältigung disr Publikation odr von Tiln daraus sind, zu wlchm Zwck

More information

Workbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O.

Workbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O. Workbook for Dsigning Distributd Control Applications using Rockwll Automation s HOLOBLOC Prototyping Softwar John Fischr and Thomas O. Bouchr Working Papr No. 05-017 Introduction A nw paradigm for crating

More information

Design Methodologies and Tools

Design Methodologies and Tools Dsign Mthodologis and Tools Dsign styls Full-custom dsign Standard-cll dsign Programmabl logic Gat arrays and fild-programmabl gat arrays (FPGAs) Sa of gats Systm-on-a-chip (mbddd cors) Dsign tools 1 Full-Custom

More information

Register Allocation. Register Allocation

Register Allocation. Register Allocation Rgistr Allocation Jingk Li Portlan Stat Univrsity Jingk Li (Portlan Stat Univrsity) CS322 Rgistr Allocation 1 / 28 Rgistr Allocation Assign an unboun numbr of tmporaris to a fix numbr of rgistrs. Exampl:

More information

A positional container ("pcontainer" for short) is a generic container that is organized by position, which means

A positional container (pcontainer for short) is a generic container that is organized by position, which means Chaptr: Gnric Positional Containrs and Doul Endd Quus Gnric Positional Containrs A positional containr is a gnric containr that stors lmnts y position at th discrtion of a clint. For xampl, a vctor stors

More information

The Size of the 3D Visibility Skeleton: Analysis and Application

The Size of the 3D Visibility Skeleton: Analysis and Application Th Siz of th 3D Visibility Sklton: Analysis and Application Ph.D. thsis proposal Linqiao Zhang lzhang15@cs.mcgill.ca School of Computr Scinc, McGill Univrsity March 20, 2008 thsis proposal: Th Siz of th

More information

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Directed Graphs BOS SFO

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Directed Graphs BOS SFO Prsntation for us with th txtbook, Algorithm Dsign and Applications, by M. T. Goodrich and R. Tamassia, Wily, 2015 Dirctd Graphs BOS ORD JFK SFO LAX DFW MIA 2015 Goodrich and Tamassia Dirctd Graphs 1 Digraphs

More information

Modelling CoCoME with DisCComp

Modelling CoCoME with DisCComp Modlling CoCoME with DiCComp Dagtuhl Workhop, Sbatian Hrold Clauthal Univrity of Tchnology Dpartmnt of Informatic Softwar Sytm Enginring Chair of Prof. Dr. Andra Rauch Ovrviw Introduction Introduction

More information

Polygonal Models. Overview. Simple Data Structures. David Carr Fundamentals of Computer Graphics Spring 2004 Based on Slides by E.

Polygonal Models. Overview. Simple Data Structures. David Carr Fundamentals of Computer Graphics Spring 2004 Based on Slides by E. INSTITUTIONEN FÖR SYSTEMTEKNIK LULEÅ TEKNISKA UNIVERSITET Polygonal Modls David Carr Fundamntals of Computr Graphics Spring 200 Basd on Slids by E. Angl Fb-3-0 SMD159, Polygonal Modls 1 L Ovrviw Simpl

More information

Acceleration of the Smith-Waterman Algorithm using Single and Multiple Graphics Processors

Acceleration of the Smith-Waterman Algorithm using Single and Multiple Graphics Processors Acclration of th Smith-Watrman Algorithm using Singl and Multipl Graphics Procssors Ali Khah-Sad, Stphn Pool and J. Blair Prot Abstract Finding rgions of similarity btwn two vry long data strams is a computationally

More information

LAB1: DMVPN Theory. DMVPN Theory. Disclaimer. Pag e

LAB1: DMVPN Theory. DMVPN Theory. Disclaimer. Pag e LAB1: DMVPN Thory Disclaimr This Configuration Guid is dsignd to assist mmbrs to nhanc thir skills in rspctiv tchnology ara. Whil vry ffort has bn mad to nsur that all matrial is as complt and accurat

More information

Ray Tracing. Ray Tracing. Ray Tracing. ray object. ray object = 0. Utah School of Computing Spring Computer Graphics CS5600

Ray Tracing. Ray Tracing. Ray Tracing. ray object. ray object = 0. Utah School of Computing Spring Computer Graphics CS5600 Utah School of omputing Spring 20 Wk Ra Tracing S5600 omputr Graphics From Rich Risnfl Spring 203 Ra Tracing lassical gomtric optics tchniqu Etrml vrsatil Historicall viw as pnsiv Goo for spcial ffcts

More information

Summary: Semantic Analysis

Summary: Semantic Analysis Summary: Smantic Analysis Chck rrors not dtctd by lxical or syntax analysis Intrmdiat Cod Scop rrors: Variabls not dfind Multipl dclarations Typ rrors: Assignmnt of valus of diffrnt typs Invocation of

More information

I - Pre Board Examination

I - Pre Board Examination Cod No: S-080 () Total Pags: 06 KENDRIYA VIDYALAYA SANGATHAN,GUWHATI REGION I - Pr Board Examination - 04-5 Subjct Informatics Practics (Thory) Class - XII Tim: 3 hours Maximum Marks : 70 Instruction :

More information

i e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S

i e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S isto C o C or Co r op ra p a py ag yr g ri g g gh ht S S S V V K r V K r M K v M r v M rn v MW n W S r W Sa r W K af r: W K f : a H a M r T H r M rn w T H r Mo ns w T i o S ww c ig on a w c g nd af ww

More information

Lecture 39: Register Allocation. The Memory Hierarchy. The Register Allocation Problem. Managing the Memory Hierarchy

Lecture 39: Register Allocation. The Memory Hierarchy. The Register Allocation Problem. Managing the Memory Hierarchy Ltur 39: Rgistr Alloation [Aapt rom nots y R. Boik an G. Nula] Topis: Mmory Hirarhy Managmnt Rgistr Alloation: Rgistr intrrn graph Graph oloring huristis Spilling Cah Managmnt Th Mmory Hirarhy Computrs

More information

Recorder Variables. Defining Variables

Recorder Variables. Defining Variables Rcordr Variabls Dfining Variabls Simpl Typs Complx Typs List of Rsrvd Words Using Variabls Stting Action Paramtrs Parsing Lists and Tabls Gtting Valu from Lists and Tabls Using Indxs with Lists Using Indxs

More information

To Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1

To Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1 Advancd Computr Graphics (Fall 200) CS 283, Lctur 5: Msh Data Structurs Ravi Ramamoorthi http://inst.cs.brkly.du/~cs283/fa0 To Do Assignmnt, Du Oct 7. Start rading and working on it now. Som parts you

More information

Dynamic modelling of multi-physical domain system by bond graph approach and its control using flatness based controller with MATLAB Simulink

Dynamic modelling of multi-physical domain system by bond graph approach and its control using flatness based controller with MATLAB Simulink Dnamic modlling of multi-phsical domain sstm b bond graph approach and its control using flatnss basd controllr with MATLAB Simulink Sauma Ranjan Sahoo Rsarch Scholar Robotics Lab Dr. Shital S. Chiddarwar

More information

Ontology and Context. Isabel Cafezeiro Departamento de Ciência da Computação Universidade Federal Fluminense Niterói - RJ, Brazil

Ontology and Context. Isabel Cafezeiro Departamento de Ciência da Computação Universidade Federal Fluminense Niterói - RJ, Brazil Ontology and Contxt Isabl Cafziro Dpartamnto d Ciência da Computação Univrsidad Fdral Fluminns Nitrói - RJ, Brazil isabl@dcc.ic.uff.br dward Hrmann Hauslr, Alxandr Radmakr Dpartamnto d Informática Pontifícia

More information

Clustering Algorithms

Clustering Algorithms Clustring Algoritms Hirarcical Clustring k -Mans Algoritms CURE Algoritm 1 Mtods of Clustring Hirarcical (Agglomrativ): Initially, ac point in clustr by itslf. Rpatdly combin t two narst clustrs into on.

More information

Descriptors story. talented developers flexible teams agile experts. Adrian Dziubek - EuroPython

Descriptors story. talented developers flexible teams agile experts. Adrian Dziubek - EuroPython Dscriptors story talntd dvloprs flxibl tams agil xprts Adrian Dziubk - EuroPython - 2016-07-18 m t u o b A Adrian Dziubk Snior Python dvlopr at STX Nxt in Wrocław, Crating wb applications using Python

More information

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1 Advancd Computr Graphics CSE 63 [Spring 207], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 28 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2

More information

Gernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents

Gernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents Grnot Hoffmann Sphr Tssllation by Icosahdron Subdivision Contnts 1. Vrtx Coordinats. Edg Subdivision 3 3. Triangl Subdivision 4 4. Edg lngths 5 5. Normal Vctors 6 6. Subdividd Icosahdrons 7 7. Txtur Mapping

More information

CS246: Mining Massive Datasets Jure Leskovec, Stanford University.

CS246: Mining Massive Datasets Jure Leskovec, Stanford University. CS246: Mining Massiv Datasts Jur Lskovc, Stanford Univrsity ttp://cs246.stanford.du 11/26/2010 Jur Lskovc, Stanford C246: Mining Massiv Datasts 2 Givn a st of points, wit a notion of distanc btwn points,

More information

Vignette to package samplingdatacrt

Vignette to package samplingdatacrt Vigntt to packag samplingdatacrt Diana Trutschl Contnts 1 Introduction 1 11 Objctiv 1 1 Diffrnt study typs 1 Multivariat normal distributd data for multilvl data 1 Fixd ffcts part Random part 9 3 Manual

More information

Pipelined Implementation

Pipelined Implementation Lctur 9 Computr rchitctur IV Piplind Implmntation Gnral Principls of Piplinin Goal ifficultis Cratin a Piplind Y86 Procssor arranin SQ Insrtin piplin ristrs Computational xampl Systm 300 ps 20 ps Combinational

More information

Land restrictions/easements

Land restrictions/easements Land rstrictions/asmnts rwgian Mapping Authority grd.mardal@statkart.no rwgian Mapping Authority Jun 2009 Pag 1 of 9 Tabl of contnts 1.1 Application schma...3 1.2...5 1.2.1... 5 1.2.2 Boundary... 5 1.2.3

More information

What is state? Unit 5. State Machine Block Diagram. State Diagrams. State Machines. S0 Out=False. S2 out=true. S1 Out=False

What is state? Unit 5. State Machine Block Diagram. State Diagrams. State Machines. S0 Out=False. S2 out=true. S1 Out=False 5.1 What i tat? 5.2 Unit 5 Stat Machin You a DPS officr approaching you. Ar you happy? It' lat at night and. It' lat at night and you'v bn. Your intrprtation i bad on mor than jut what your n ar tlling

More information

Clustering Algorithms

Clustering Algorithms Clustring Algoritms Applications Hirarcical Clustring k -Mans Algoritms CURE Algoritm 1 T Problm of Clustring Givn a st of points, wit a notion of distanc btwn points, group t points into som numbr of

More information

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION 03-4 Sub : Informatics Practics (065) Tim allowd : 3 hours Maximum Marks : 70 Instruction : (i) All qustions ar compulsory

More information

calctab package version 0.6.1

calctab package version 0.6.1 calctab packag vrsion 0.6.1 Robrto Giacomlli -mail: giacont dot mailbox at gmail dot com 2009/07/12 Th tabl computs th sum not bcaus is usful, but bcaus th rsult is not an usr ssntial data Contnts 1 Introduction

More information

Minimum Spanning Trees

Minimum Spanning Trees MST Origin Minimum Spanning Trs Givn. Undirctd graph G with positiv dg wights (connctd). Goal. Find a min wight st of dgs that conncts all of th vrtics. 4 24 6 23 18 9 wightd graph API cycls and cuts Kruskal

More information

Reactive Chatbot Programming

Reactive Chatbot Programming Abstract Guillaum Baudart IBM Rsarch USA Ractiv Chatbot Programmg Avraham Shnar IBM Rsarch USA Chatbots ar ractiv applications with a convrsational trfac. Thy ar usually implmntd as compositions of clt-sid

More information

EE 231 Fall EE 231 Homework 10 Due November 5, 2010

EE 231 Fall EE 231 Homework 10 Due November 5, 2010 EE 23 Fall 2 EE 23 Homwork Du Novmbr 5, 2. Dsign a synhronous squntial iruit whih gnrats th following squn. (Th squn should rpat itslf.) (a) Draw a stat transition diagram for th iruit. This is a systm

More information

AV1640 ANAG VISION. 16x4 Character

AV1640 ANAG VISION. 16x4 Character AV1640 16x4 Character 5x7 dots with cursor 1/16 duty +5V single supply Controller built in (KS0066 or quivalent) B/L driven by pin1 and 2, 15 and 16 or A,K Pin Assignment No. Symbol Function 1 Vss Gnd,

More information

Reminder: Affine Transformations. Viewing and Projection. Transformation Matrices in OpenGL. Shear Transformations. Specification via Shear Angle

Reminder: Affine Transformations. Viewing and Projection. Transformation Matrices in OpenGL. Shear Transformations. Specification via Shear Angle CSCI 480 Comptr Graphics Lctr 5 Viwing and Projction Shar Transormation Camra Positioning Simpl Paralll Projctions Simpl Prspctiv Projctions [Angl, Ch. 5] Janary 30, 2013 Jrnj Barbic Univrsity o Sothrn

More information

XML security in certificate management

XML security in certificate management XML scurity in crtificat managmnt Joan Lu, Nathan Cripps and Chn Hua* School of Computing and Enginring, Univrsity of Huddrsfild, UK J.lu@hud.ac.uk *Institut of Tchnology, Xi'an, Shaanxi, P. R. China Abstract

More information

Driver for netgear wn111v2 wireless usb adapter Get file - Driver for netgear wn111v2 wireless usb adapter

Driver for netgear wn111v2 wireless usb adapter Get file - Driver for netgear wn111v2 wireless usb adapter Drivr for ntgar wn111v2 wirlss usb adaptr. Fr FILE Download My IE dosn t work. Drivr for ntgar wn111v2 wirlss usb adaptr Gt fil - Drivr for ntgar wn111v2 wirlss usb adaptr But somtims thy grow back. RAR

More information

Transaction processing in real-time database systems

Transaction processing in real-time database systems Rtrospctiv Thss and Dissrtations Iowa Stat Univrsity Capstons, Thss and Dissrtations 1993 Transaction procssing in ral-tim databas systms Waqar ul Haqu Iowa Stat Univrsity Follow this and additional works

More information

An Agent-Based Architecture for Service Discovery and Negotiation in Wireless Networks

An Agent-Based Architecture for Service Discovery and Negotiation in Wireless Networks An Agnt-Basd Architctur for Srvic Discovry and Ngotiation in Wirlss Ntworks Abstract Erich Birchr and Torstn Braun Univrsity of Brn, Nubrückstrass 10, 3012 Brn, Switzrland Email: braun@iam.unib.ch This

More information

Comment (justification for change) by the MB

Comment (justification for change) by the MB Editor's disposition s CD2 19763-12 as at 2013-11-03 Srial Annx (.g. 3.1) Figur/ Tabl/t (.g. Tabl 1) 001 CA 00 All All - G Canada disapprovs th draft for th rasons blow. 002 GB 01 Gnral d numbring has

More information

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding CS364B: Frontirs in Mchanism Dsign Lctur #10: Covrag Valuations and Convx Rounding Tim Roughgardn Fbruary 5, 2014 1 Covrag Valuations Rcall th stting of submodular biddr valuations, introducd in Lctur

More information

Formal Foundation, Approach, and Smart Tool for Software Models Comparison

Formal Foundation, Approach, and Smart Tool for Software Models Comparison Formal Foundation, Approach, and Smart Tool for Softwar Modls Comparison Olna V. Chbanyuk, Abdl-Badh M. Salm Softwar Enginring Dpartmnt, National Aviation Univrsity, Kyiv, Ukrain Computr Scinc, Faculty

More information

: Mesh Processing. Chapter 6

: Mesh Processing. Chapter 6 600.657: Msh Procssing Chaptr 6 Quad-Dominant Rmshing Goal: Gnrat a rmshing of th surfac that consists mostly of quads whos dgs align with th principal curvatur dirctions. [Marinov t al. 04] [Alliz t al.

More information

Clustering. Shannon Quinn. (with thanks to J. Leskovec, A. Rajaraman, and J. Ullman of Stanford University)

Clustering. Shannon Quinn. (with thanks to J. Leskovec, A. Rajaraman, and J. Ullman of Stanford University) Clustring Sannon Quinn (wit tanks to J. Lskovc, A. Rajaraman, and J. Ullman of Stanford Univrsity) Hig Dimnsional Data Givn a cloud of data points w want to undrstand its structur of Massiv Datasts, ttp://www.mmds.org

More information

TypeCastor: Demystify Dynamic Typing of JavaScript Applications

TypeCastor: Demystify Dynamic Typing of JavaScript Applications TypCastor: Dmystify Dynamic Typing of JavaScript Applications Shishng Li China Runtim Tch Cntr Intl China Rsarch Cntr Bijing, China shishng.li@intl.com Buqi Chng China Runtim Tch Cntr Intl China Rsarch

More information

Clustering Belief Functions using Extended Agglomerative Algorithm

Clustering Belief Functions using Extended Agglomerative Algorithm IJ Imag Graphics and Signal Procssing 0 - Publishd Onlin Fbruary 0 in MECS (http://wwwmcs-prssorg/ ing Blif Functions using Extndd Agglomrativ Algorithm Ying Png Postgraduat Collg Acadmy of Equipmnt Command

More information

Linked Data meet Sensor Networks

Linked Data meet Sensor Networks Digital Entrpris Rsarch Institut www.dri.i Linkd Data mt Snsor Ntworks Myriam Lggiri DERI NUI Galway, Irland Copyright 2008 Digital Entrpris Rsarch Institut. All rights rsrvd. Linkd Data mt Snsor Ntworks

More information

On Some Maximum Area Problems I

On Some Maximum Area Problems I On Som Maximum Ara Problms I 1. Introdution Whn th lngths of th thr sids of a triangl ar givn as I 1, I and I 3, thn its ara A is uniquly dtrmind, and A=s(s-I 1 )(s-i )(s-i 3 ), whr sis th smi-primtr t{i

More information

D11.2 Service concepts, models and method: Model Driven Service Engineering M12 issue

D11.2 Service concepts, models and method: Model Driven Service Engineering M12 issue D11.2 Srvic concpts, modls and mthod: Modl Drivn Srvic Enginring M12 issu Documnt Ownr: Y. Ducq (UB1), G. Doumingts (I-VLab), C. Liu (I-VLab), D. Chn (UB1), T. Alix (UB1), G. Zacharwicz (UB1) Contributors:

More information

running at 133 MHz bus. A Pentium III 1.26GHz with 512K cache running at 133 MHz bus is an available option. Fits Your Needs

running at 133 MHz bus. A Pentium III 1.26GHz with 512K cache running at 133 MHz bus is an available option. Fits Your Needs 3715 Industrial PCs 15.0" LCD Flat Panl Display DS-371500(E) Xycom Automation's nwst gnration of Industrial PCs is dsignd and tstd for th tough nvironmnts rquird for plant floor us. Our standard PC configurations

More information

An Architecture for Hierarchical Collision Detection

An Architecture for Hierarchical Collision Detection An Architctur for Hirarchical Collision Dtction Gabril Zachmann Computr Graphics, Informatik II Univrsity of Bonn mail: zach@cs.uni-bonn.d Güntr Knittl WSI/GRIS Univrsity of Tübingn mail: knittl@gris.uni-tubingn.d

More information

Blue-Bot. Marketing Guide BLUETOOTH FLOOR ROBOT. Computing and ICT

Blue-Bot. Marketing Guide BLUETOOTH FLOOR ROBOT. Computing and ICT Blu-Bot BLUETOOTH FLOOR ROBOT Computing and ICT Markting Guid Blu-Bot_Usr Guid.indd 1 About this guid Introduction This markting guid has bn cratd to nsur that you ar informd of all of th ky faturs and

More information

Between Testing and Formal Verification

Between Testing and Formal Verification Btwn Tsting and Formal Vrification Jan Tobias Mühlbrg jantobias.muhlbrg@cs.kuluvn.b imc-distrint, KU Luvn, Clstijnnlaan 200A, B-3001 Blgium ScAppDv, Luvn, March 2017 1 /19 Jan Tobias Mühlbrg Btwn Tsting

More information

TRIES BBM 201 DATA STRUCTURES DEPT. OF COMPUTER ENGINEERING

TRIES BBM 201 DATA STRUCTURES DEPT. OF COMPUTER ENGINEERING Acknowdgmnt: T cour id r dptd from t id prprd by R. Sdgwick nd K. Wyn of Princton Univrity. BBM 2 DATA STRUCTURES DEPT. OF COMPUTER ENGINEERING TRIES Tri R-wy tri TODAY R-wy tri TRIES Tri Tri. [from rtriv,

More information

From Last Time. Origin of Malus law. Circular and elliptical polarization. Energy of light. The photoelectric effect. Exam 3 is Tuesday Nov.

From Last Time. Origin of Malus law. Circular and elliptical polarization. Energy of light. The photoelectric effect. Exam 3 is Tuesday Nov. From Last Tim Enrgy and powr in an EM wav Exam 3 is Tusday Nov. 25 5:30-7 pm, 2103 Ch (hr) Studnts w / schduld acadmic conflict plas stay aftr class Tus. Nov. 18 to arrang altrnat tim. Covrs: all matrial

More information

Proceedings of the 5 th Annual Linux Showcase & Conference

Proceedings of the 5 th Annual Linux Showcase & Conference USENIX Association Procdings of th 5 th Annual Linux Showcas & Confrnc Oakland, California, USA Novmbr 5 10, 2001 THE ADVANCED COMPUTING SYSTEMS ASSOCIATION 2001 by Th USENIX Association All Rights Rsrvd

More information

2018 How to Apply. Application Guide. BrandAdvantage

2018 How to Apply. Application Guide. BrandAdvantage 2018 How to Apply Application Guid BrandAdvantag Contnts Accssing th Grant Sit... 3 Wlcom pag... 3 Logging in To Pub Charity... 4 Rgistration for Nw Applicants ( rgistr now )... 5 Organisation Rgistration...

More information

arxiv: v1 [cs.cr] 17 May 2011

arxiv: v1 [cs.cr] 17 May 2011 THE BLOCK CIPHER NSABC (PUBLIC DOMAIN) ALICE NGUYENOVA-STEPANIKOVA (*) AND TRAN NGOC DUONG (**) arxiv:1105.3388v1 [cs.cr] 17 May 2011 Abstract. W introduc NSABC/w Nic-Structurd Algbraic Block Ciphr using

More information

Principles for Computer System Design

Principles for Computer System Design Principls for Computr Systm Dsign 10 yars ago: Hints for Computr Systm Dsign Not that much larnd sinc thn disappointing Instad of standing on ach othr s shouldrs, w stand on ach othr s tos. (Hamming) On

More information

Terrain Mapping and Analysis

Terrain Mapping and Analysis Trrain Mapping and Analysis Data for Trrain Mapping and Analysis Digital Trrain Modl (DEM) DEM rprsnts an array of lvation points. Th quality of DEM influncs th accuracy of trrain masurs such as slop and

More information

Maxwell s unification: From Last Time. Energy of light. Modern Physics. Unusual experimental results. The photoelectric effect

Maxwell s unification: From Last Time. Energy of light. Modern Physics. Unusual experimental results. The photoelectric effect From Last Tim Enrgy and powr in an EM wav Maxwll s unification: 1873 Intimat connction btwn lctricity and magntism Exprimntally vrifid by Hlmholtz and othrs, 1888 Polarization of an EM wav: oscillation

More information

Lightweight Polymorphic Effects

Lightweight Polymorphic Effects Lightwight Polymorphic Effcts Lukas Rytz, Martin Odrsky, and Philipp Hallr EPFL, Switzrland, {first.last}@pfl.ch Abstract. Typ-and-ffct systms ar a wll-studid approach for rasoning about th computational

More information

Interfacing the DP8420A 21A 22A to the AN-538

Interfacing the DP8420A 21A 22A to the AN-538 Intrfacing th DP8420A 21A 22A to th 68000 008 010 INTRODUCTION This application not xplains intrfacing th DP8420A 21A 22A DRAM controllr to th 68000 Thr diffrnt dsigns ar shown and xplaind It is assumd

More information

Type & Media Page 1. January 2014 Libby Clarke

Type & Media Page 1. January 2014 Libby Clarke Nam: 1 In ordr to hlp you s your progrss at th nd of this ntir xrcis, you nd to provid som vidnc of your starting point. To start, draw th a on th lft into th box to th right, dpicting th sam siz and placmnt.

More information

Different shells (e.g. bash, ksh, tcsh, ash, sh) => different commands/scripts

Different shells (e.g. bash, ksh, tcsh, ash, sh) => different commands/scripts Shll Programming Diffrnt hll (.g. bah, kh, tch, ah, h) => diffrnt command/cript Why a hll cript? impl way to tring togthr a bunch of UNIX-command cript ar uually fat to gt going portabl acro th whol UNIX

More information

Dynamic Light Trail Routing and Protection Issues in WDM Optical Networks

Dynamic Light Trail Routing and Protection Issues in WDM Optical Networks This full txt papr was pr rviwd at th dirction of IEEE Communications Socity subjct mattr xprts for publication in th IEEE GLOBECOM 2005 procdings. Dynamic Light Trail Routing and Protction Issus in WDM

More information

Evolutionary Clustering and Analysis of Bibliographic Networks

Evolutionary Clustering and Analysis of Bibliographic Networks Evolutionary Clustring and Analysis of Bibliographic Ntworks Manish Gupta Univrsity of Illinois at Urbana-Champaign gupta58@illinois.du Charu C. Aggarwal IBM T. J. Watson Rsarch Cntr charu@us.ibm.com Jiawi

More information

Conquest: Better Performance Through A Disk/Persistent-RAM Hybrid File System

Conquest: Better Performance Through A Disk/Persistent-RAM Hybrid File System Conqust: Bttr Prformanc Through A Disk/Prsistnt-RAM Hybrid Fil Systm An-I A. Wang, Ptr Rihr, and Grald J. Popk Computr Scinc Dpartmnt Univrsity of California, Los Angls {awang, rihr, popk}@fmg.cs.ucla.du

More information

Minimum Spanning Trees

Minimum Spanning Trees MT Origin Minimum panning Trs Givn. Undirctd graph G with positiv dg wights (connctd). Goal. Find a min wight st of dgs that conncts all of th vrtics. 4 24 6 23 18 9 wightd graph API cycls and cuts advancd

More information

Using the brackets as a guide, mark hole locations and then pre-drill holes for the screws.

Using the brackets as a guide, mark hole locations and then pre-drill holes for the screws. Sivoia QS Wirlss Cllular English. Motorizd shad with wirlss radio frquncy (RF) Installation Guid (plas rad bfor installing) Option : Outsid Mount Trim: Install Mounting Brackts Using th brackts as a guid,

More information

Towards Fractal Approach in Healthcare Information Systems: A Review

Towards Fractal Approach in Healthcare Information Systems: A Review t 2 L E P U T PER J O R TI D I OCI IC 2011 O E I UIV UDET E T R I TI I K E E B DO G I M L Y I l a n o i t a rn In c i n tif i c C o n IC 2011 f r n c 0 1 Procding of th Intrnational Confrnc on dvancd cinc,

More information

Dynamic Spatial Partitioning for Real-Time Visibility Determination

Dynamic Spatial Partitioning for Real-Time Visibility Determination Dynamic Spatial Partitioning for Ral-Tim Visibility Dtrmination Joshua Shagam Josph J. Pfiffr, Jr. Nw Mxico Stat Univrsity Abstract Th static spatial partitioning mchanisms usd in currnt intractiv systms,

More information

CSE 272 Assignment 1

CSE 272 Assignment 1 CSE 7 Assignmnt 1 Kui-Chun Hsu Task 1: Comput th irradianc at A analytically (point light) For point light, first th nrgy rachd A was calculatd, thn th nrgy was rducd by a factor according to th angl btwn

More information

Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction

Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Efficint Obstacl-Avoiding Rctilinar Stinr Tr Construction Chung-Wi Lin, Szu-Yu Chn, Chi-Fng Li, Yao-Wn Chang, and Chia-Lin Yang Graduat Institut of Elctronics Enginring Dpartmnt of Elctrical Enginring

More information

void DoTask1( void); void main(void) { DoTask1( ); void DoTask1_CPP( void); void main(void) { DoTask1_CPP( ); void DoTask1_CPP( void);

void DoTask1( void); void main(void) { DoTask1( ); void DoTask1_CPP( void); void main(void) { DoTask1_CPP( ); void DoTask1_CPP( void); void otask( void); You have one task that you run once Concepts and issues of an operating system for a medical device eptember 9 Tutorial continued during eptember 9 Class void main(void) { otask( );

More information

Whitepaper: IEEE P1687 Internal JTAG (IJTAG) taps into embedded instrumentation

Whitepaper: IEEE P1687 Internal JTAG (IJTAG) taps into embedded instrumentation Whitpapr: IEEE P1687 Intrnal JAG (IJAG) taps into mbddd instrumntation By Al Crouch Chif chnologist, Cor Instrumntation ASSE Intrch Co-Chairman, IEEE P1687 IJAG Standard Working Group ASSE Intrch, Inc.

More information

FLASHING CHRISTMAS TREE KIT

FLASHING CHRISTMAS TREE KIT R4 FLASHING CHRISTMAS TREE KIT 9 10 8 7 11 6 R3 12 T4 C4 5 T3 R5 R7 13 C3 C2 4 14 R1 T2 R6 3 OWNER S MANUAL T1 R8 15 2 C1 R2 1 16 Cat. No. 277-8001 CUSTOM MANUFACTURED FOR TANDY CORPORATION LTD ASSEMBLY

More information