Introduction to Data Mining
|
|
- Cecil Thompson
- 6 years ago
- Views:
Transcription
1 Introduction to Data Mining Lctur #15: Clustring-2 Soul National Univrsity 1
2 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 CURE, an xtnsion of K-mans to clustrs of arbitrary saps 2
3 Outlin BFR Algoritm CURE Algoritm BFR: Extnsion of k-mans to larg data 3
4 BFR Algoritm BFR [Bradly-Fayyad-Rina] is a variant of k-mans dsignd to andl vry larg (disk-rsidnt) data sts Assums tat clustrs ar normally distributd around a cntroid in a Euclidan spac Standard dviations in diffrnt dimnsions may vary Clustrs ar axis-alignd llipss Efficint way to summariz clustrs (want mmory rquird O(clustrs) and not O(data)) 4
5 BFR Algoritm Points ar rad from disk on main-mmory-full at a tim Most points from prvious mmory loads ar summarizd by simpl statistics To bgin, from t initial load w slct t initial k cntroids by som snsibl approac: Tak k random points Tak a small random sampl and clustr optimally Tak a sampl; pick a random point, and tn k 1 mor points, ac as far from t prviously slctd points as possibl 5
6 Tr Classs of Points 3 sts of points wic w kp track of: Discard st (DS): Points clos noug to a cntroid to b summarizd Comprssion st (CS): Groups of points tat ar clos togtr but not clos to any xisting cntroid Ts points ar summarizd, but not assignd to a clustr Rtaind st (RS): Isolatd points waiting to b assignd to a comprssion st 6
7 BFR: Galaxis Pictur Points in t RS Comprssd sts. Tir points ar in t CS. A clustr. Its points ar in t DS. T cntroid Discard st (DS): Clos noug to a cntroid to b summarizd Comprssion st (CS): Summarizd, but not assignd to a clustr Rtaind st (RS): Isolatd points 7
8 Summarizing Sts of Points For ac clustr, t discard st (DS) is summarizd by: T numbr of points, N T vctor SUM, wos i t componnt is t sum of t coordinats of t points in t i t dimnsion T vctor SUMSQ: i t componnt = sum of squars of coordinats in i t dimnsion A clustr. All its points ar in t DS. T cntroid 8
9 Summarizing Points: Commnts 2d + 1 valus rprsnt any siz clustr d = numbr of dimnsions Avrag in ac dimnsion (t cntroid) can b calculatd as SUM i / N SUM i = i t componnt of SUM Varianc of a clustr s discard st in dimnsion i is: (SUMSQ i / N) (SUM i / N) 2 And standard dviation is t squar root of tat Nxt stp: Actual clustring Not: Rmoving t axis-alignd clustrs assumption would rquir storing full covarianc matrix to summariz t clustr. So, instad of SUMSQ bing a d-dim vctor, it would b a d x d matrix, wic is too big! 9
10 T Mmory-Load of Points Procssing t Mmory-Load of points (1): 1) Find tos points tat ar sufficintly clos to a clustr cntroid and add tos points to tat clustr and t DS Ts points ar so clos to t cntroid tat ty can b summarizd and tn discardd 2) Us any main-mmory clustring algoritm to clustr t rmaining points and t old RS Clustrs go to t CS; outlying points to t RS Discard st (DS): Clos noug to a cntroid to b summarizd. Comprssion st (CS): Summarizd, but not assignd to a clustr Rtaind st (RS): Isolatd points 10
11 T Mmory-Load of Points Procssing t Mmory-Load of points (2): 3) DS st: Adjust statistics of t clustrs to account for t nw points Updat Ns, SUMs, SUMSQs 4) Considr mrging comprssd sts in t CS 5) If tis is t last round, mrg all comprssd sts in t CS and all RS points into tir narst clustr Discard st (DS): Clos noug to a cntroid to b summarizd. Comprssion st (CS): Summarizd, but not assignd to a clustr Rtaind st (RS): Isolatd points 11
12 A Fw Dtails Q1) How do w dcid if a point is clos noug to a clustr tat w will add t point to tat clustr? Q2) How do w dcid wtr two comprssd sts (CS) dsrv to b combind into on? 12
13 How Clos is Clos Enoug? Q1) W nd a way to dcid wtr to put a nw point into a clustr (and discard) BFR suggsts two ways: Hig likliood of t point blonging to currntly narst cntroid (and, t point far from all otr cntroids) T Maalanobis distanc is small (< t) 13
14 Maalanobis Distanc Normalizd Euclidan distanc from cntroid For point (x 1,, x d ) and cntroid (c 1,, c d ) 1. Normaliz in ac dimnsion: y i = (x i - c i ) / σ i 2. Tak sum of t squars of t y i 3. Tak t squar root dd xx, cc = dd ii=1 xx ii cc ii σσ ii 2 σ i standard dviation of points in t clustr in t i t dimnsion 14
15 Maalanobis Distanc If clustrs ar normally distributd in d dimnsions, tn aftr transformation, on standard dviation = dd Accpt a point for a clustr if its M.D. is < t (a paramtr) 15
16 Pictur: Equal M.D. Rgions Euclidan vs. Maalanobis distanc Contours of quidistant points from t origin Uniformly distributd points, Euclidan distanc Normally distributd points, Euclidan distanc Normally distributd points, Maalanobis distanc 16
17 Sould 2 CS clustrs b combind? Q2) Sould 2 CS subclustrs b combind? Comput t varianc of t combind subclustr N, SUM, and SUMSQ allow us to mak tat calculation quickly Combin if t combind varianc is small (< s) 17
18 Outlin BFR Algoritm CURE Algoritm CURE: Extnsion of k-mans to clustrs of arbitrary saps 18
19 T CURE Algoritm Problm wit BFR/k-mans: Assums clustrs ar normally distributd in ac dimnsion And axs ar fixd llipss at an angl ar not OK Vs. CURE (Clustring Using REprsntativs): Assums a Euclidan distanc Allows clustrs to assum any sap Uss a collction of rprsntativ points to rprsnt clustrs 19
20 Starting CURE 2 Pass algoritm. Pass 1: 1) Pick a random sampl of points tat fit in main mmory 2) Initial clustrs: Clustr ts points irarcically group narst points/clustrs 3) Pick rprsntativ points: For ac clustr, pick a sampl of points, as disprsd as possibl From t sampl, pick rprsntativs by moving tm (say) 20% toward t cntroid of t clustr 20
21 Starting CURE 2 Pass algoritm. Pass 1: 4) Mrg clustrs Mrg two clustrs tat ar sufficintly clos (<t) Clustr distanc: minimum distanc of rprsntativ points Rpat, until tr ar no mor sufficintly clos clustrs 21
22 Srinking Rprsntativs Wy srink rprsntativs by 20%? Rduc outlirs ability to caus t wrong clustrs to b mrgd C1 cntroid rprsntativs C3 C2 22
23 Exampl: Initial Clustrs salary ag 23
24 Exampl: Pick Disprsd Points salary Pick (say) 4 rmot points for ac clustr. ag 24
25 Exampl: Pick Disprsd Points salary Mov points (say) 20% toward t cntroid. ag 25
26 Finising CURE Pass 2: Now, rscan t wol datast and visit ac point p in t data st Plac it in t closst clustr Normal dfinition of closst : Find t closst rprsntativ to p and assign it to rprsntativ s clustr p 26
27 Wat You Nd to Know Clustring: Givn a st of points, wit a notion of distanc btwn points, group t points into som numbr of clustrs Algoritms: Agglomrativ irarcical clustring: Cntroid and clustroid k-mans: Initialization, picking k BFR CURE 27
28 Qustions? 28
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 informationCS246: 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 informationClustering. 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 informationClustering 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 informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massiv Datasts Jur Lskovc, Stanford Univrsity ttp://cs246.stanford.du 1/22/18 Jur Lskovc, Stanford CS246: Mining Massiv Datasts 2 Hig dim. data Grap data Infinit data Macin larning Apps Locality
More informationBig Data Analytics CSCI 4030
Hig dim. data Grap data Infinit data Macin larning Apps Locality snsitiv asing PagRank, SimRank Filtring data strams SVM Rcommn dr systms Clustring Community Dtction Wb advrtising Dcision Trs Association
More informationDS504/CS586: Big Data Analytics Big Data Clustering Prof. Yanhua Li
Welcome to DS504/CS586: Big Data Analytics Big Data Clustering Prof. Yanhua Li Time: 6:00pm 8:50pm Thu Location: AK 232 Fall 2016 High Dimensional Data v Given a cloud of data points we want to understand
More informationClustering. Genoveva Vargas-Solar French Council of Scientific Research, LIG & LAFMIA Labs
1 Clustrig Govva Vargas-Solar ttp://www.vargas-solar.com/big-data-aalytics Frc Coucil of Scitific Rsarc, LIG & LAFMIA Labs Motvido, 22 d Novmbr 4 t Dcmbr, 2015 INFORMATIQUE + Hig Dimsioal Data 2 Hig dim.
More informationTo 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 informationTo 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 informationSystems 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 informationClustering. Distance Measures Hierarchical Clustering. k -Means Algorithms
Clustering Distance Measures Hierarchical Clustering k -Means Algorithms 1 The Problem of Clustering Given a set of points, with a notion of distance between points, group the points into some number of
More informationTo 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 informationTCP 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 information2018 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 informationAbout Notes And Symbols
About Nots And Symbols by Batric Wildr Contnts Sht 1 Sht 2 Sht 3 Sht 4 Sht 5 Sht 6 Sht 7 Sht 8 Sht 9 Sht 10 Sht 11 Sht 12 Sht 13 Sht 14 Sht 15 Sht 16 Sht 17 Sht 18 Sht 19 Sht 20 Sht 21 Sht 22 Sht 23 Sht
More informationAnalytics and Visualization of Big Data
1 Analytics and Visualization of Big Data Fadel M. Megahed Lecture 15: Clustering (Discussion Class) Department of Industrial and Systems Engineering Spring 13 Refresher: Hierarchical Clustering 2 Key
More informationProblem Set 1 (Due: Friday, Sept. 29, 2017)
Elctrical and Computr Enginring Mmorial Univrsity of Nwfoundland ENGI 9876 - Advancd Data Ntworks Fall 2017 Problm St 1 (Du: Friday, Spt. 29, 2017) Qustion 1 Considr a communications path through a packt
More informationMotivation. Synthetic OOD concepts and reuse Lecture 4: Separation of concerns. Problem. Solution. Deleting composites that share parts. Or is it?
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
More informationMidterm 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 informationCSE 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 informationMesh Data Structures. Geometry processing. In this course. Mesh gallery. Mesh data
Gomtry procssing Msh Data Structurs Msh data Gomtry Connctivity Data structur slction dpnds on Msh typ Algorithm rquirmnts 2 Msh gallry In this cours Only orintabl, triangular, manifold mshs Singl componnt,
More informationPrinciples 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 informationShift. 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 informationGreedy 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 informationThe 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 informationThe Problem of Clustering
Clustering Te Problem of Clustering Given a set of points, wit a no9on of distance between points, group te points into some number of clusters, so tat members of a cluster are close/similar to eac oter
More informationGernot 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 information1. 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 informationReimbursement Requests in WORKS
Rimbursmnt Rqusts in WORKS Important points about Rimbursmnts in Works Rimbursmnt Rqust is th procss by which UD mploys will b rimbursd for businss xpnss paid using prsonal funds. Rimbursmnt Rqust can
More information8.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 informationEvolutionary 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 informationLesson Focus: Finding Equivalent Fractions
Lsson Plans: Wk of 1-26-15 M o n Bindrs: /Math;; complt on own, thn chck togthr Basic Fact Practic Topic #10 Lsson #5 Lsson Focus: Finding Equivalnt Fractions *Intractiv Larning/Guidd Practic-togthr in
More informationTerrain 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 informationDO NOW Geometry Regents Lomac Date. due. Similar by Transformation 6.1 J'' J''' J'''
DO NOW Gomtry Rgnts Lomac 2014-2015 Dat. du. Similar by Transformation 6.1 (DN) Nam th thr rigid transformations and sktch an xampl that illustrats ach on. Nam Pr LO: I can dscrib a similarity transformation,
More informationVignette 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 informationRanking Overlap and Outlier Points in Data using Soft Kernel Spectral Clustering
ESANN procdings, Europan Symposium on Artificial Nural Ntworks, Computational Intllignc and Machin Larning. Brugs (Blgium), - April, idoc.com publ., ISBN 978-8787-8. Ranking Ovrlap and Outlir Points in
More informationTRIANGULATION OF NURBS SURFACES. Jamshid Samareh-Abolhassani. 1 Abstract
TRIANGULATION OF NURBS SURFACES Jamshid Samarh-Abolhassani 1 Abstract A tchniqu is prsntd for triangulation of NURBS surfacs. This tchniqu is built upon an advancing front tchniqu combind with grid point
More informationGraph Theory & Applications. Boundaries Using Graphs. Graph Search. Find the route that minimizes. cost
Graph Thory & Appliations Bounaris Using Graphs 3 4 3 4 5 Fin th rout that minimizs osts Fin th ritial path in a projt Fin th optimal borr aroun a rgion Fin loop an no quations or analog iruit analysis
More informationRegister 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 informationFSP Synthesis of an off-set five bar-slider mechanism with variable topology
FSP Synthsis of an off-st fiv bar-slidr mchanism with variabl topology Umsh. M. Daivagna 1*, Shrinivas. S. Balli 2 1 Dpartmnt of Mchanical Enginring, S.T.J.Institut of Tchnology, Ranbnnur, India 2 Dpt.
More informationUnderstanding Patterns of TCP Connection Usage with Statistical Clustering
Th UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Undrstanding Pattrns of TCP Connction Usag with Statistical Clustring Félix Hrnándz-Campos Kvin Jffay Don Smith Dpartmnt of Computr Scinc Andrw Nobl Dpartmnt
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Spring
Has-Based Indexes Capter 11 Comp 521 Files and Databases Spring 2010 1 Introduction As for any index, 3 alternatives for data entries k*: Data record wit key value k
More information2 Mega Pixel. HD-SDI Bullet Camera. User Manual
2 Mga Pixl HD-SDI Bullt Camra Usr Manual Thank you for purchasing our product. This manual is only applicabl to SDI bullt camras. Thr may b svral tchnically incorrct placs or printing rrors in this manual.
More informationRay 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 informationProbabilistic inference
robabilistic infrnc Suppos th agnt has to mak a dcision about th valu of an unobsrvd qury variabl X givn som obsrvd vidnc E = artially obsrvabl, stochastic, pisodic nvironmnt Eampls: X = {spam, not spam},
More informationPresentation 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 informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Fall
Has-Based Indexes Capter 11 Comp 521 Files and Databases Fall 2012 1 Introduction Hasing maps a searc key directly to te pid of te containing page/page-overflow cain Doesn t require intermediate page fetces
More informationObjectives. 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 informationOverview of the Gifted Services Portfolio Process
Saint Paul Public Schools Ovrviw of th Giftd Srvics Portfolio Procss Talnt Dvlopmnt and Acclration Srvics What is th Portfolio Rviw? Th portfolio rviw offrs all studnts th opportunity to b assssd for giftd
More informationRFC 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: 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 informationType & 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 informationi 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 informationA 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 informationKeywords-- Digital FIR filter, Differential Evolution algorithm, Magnitude response, Pass band ripples and Stop band ripples.
Volum 5, Issu 6, Jun 2015 ISSN: 2277 128X Intrnational Journal of Advancd Rsarch in Computr Scinc and Softwar Enginring Rsarch Papr Availabl onlin at: www.iarcss.com High Pass Digital FIR Filtr Dsign Using
More informationTillförlitlig dimensionering mot utmattning UTMIS Vårmöte 2018 på Högskolan i Skövde
Tillförlitlig dimnsionring mot utmattning UTMIS Vårmöt 2018 på Högskolan i Skövd Rami Mansour & Mårtn Olsson KTH Hållfasthtslära mart@kth.s ramimans@kth.s Introduction Ovrviw of rliabl dsign Traditional
More informationSpectral sensitivity and color formats
FirWir camras Spctral snsitivity and color formats At th "input" of a camra, w hav a CCD chip. It transforms photons into lctrons. Th spctral snsitivity of this transformation is an important charactristic
More informationWorkbook 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 informationA New Algorithm for Solving Shortest Path Problem on a Network with Imprecise Edge Weight
Availabl at http://pvamudu/aam Appl Appl Math ISSN: 193-9466 Vol 6, Issu (Dcmbr 011), pp 60 619 Applications and Applid Mathmatics: An Intrnational Journal (AAM) A Nw Algorithm for Solving Shortst Path
More informationKENDRIYA 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 informationInterfacing 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 informationSPECIFIC CRITERIA FOR THE GENERAL MOTORS GLOBAL TRADING PARTNER LABEL TEMPLATE:
SPCIFIC CRITRIA FOR TH GNRAL MOTORS GLOBAL TRADING PARTNR LABL TMPLAT: TH TMPLAT IDNTIFIS HOW AND WHR DATA IS TO B PLACD ON TH LABL WHN IT IS RQUIRD AS PART OF A GM BUSINSS RQUIRMNT FONT SIZS AR SPCIFID
More informationUsing 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 informationComment (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 informationClustering. Chapter Introduction to Clustering Techniques Points, Spaces, and Distances
Chapter 7 Clustering Clustering is the process of examining a collection of points, and grouping the points into clusters according to some distance measure. The goal is that points in the same cluster
More informationRTL Design Flow. Layout Compaction. Prof. Kurt Keutzer Prof. A. R. Newton UC Berkeley Prof. M. Orshansky UCB U of Texas. Library.
Layout ompaction Prof. Kurt Kutzr Prof. A. R. Nwton U rkly Prof. M. Orshansky U U of Txas RTL Dsign Flow HDL RTL Synthsis Manual Dsign Moul Gnrators Lirary ntlist logic optimization a s clk q ntlist a
More informationReducin} Migratin} secxn:laries
Rducing Migrating Scondaris Earl Wallr and Ml Parc INLEX, Inc. P.O. Box 1349 Montry, CA. 93942 If you ar lik us, you hav rad a lot rcntly about IMAGE and its 'myths', and you know that thr can b prformanc
More informationEnergy-Efficient Method to Improve TCP Performance for MANETs
nrgy-fficint Mthod to Improv TCP Prformanc for MANTs Chaoyu Xiong, Jagol Yim, Jason Ligh and Tadao Murata Computr Scinc Dpartmnt, Univrsity of Illinois at Chicago Chicago, IL 60607, USA ABSTRACT Th currnt
More informationThis module calculates the motor speed based on a rotor position measurement when the direction information is available.
SPEED_FRQ Spd Calulator Basd on Rotor Angl With Dirtion Information Dsription This modul alulats th motor spd basd on a rotor position masurmnt whn th dirtion information is availabl. thta_l dir_qep SPEED_FRQ
More informationQuickBird files are courtesy of DigitalGlobe and may not be reproduced without explicit permission from DigitalGlobe.
Calibrating Imags Tutorial In this tutorial, you will calibrat a QuickBird Lvl-1 imag to spctral radianc and rflctanc whil larning about th various mtadata filds that ENVI uss to prform calibration. Fils
More informationSpace Subdivision Algorithms for Ray Tracing
Spac Subdivision Algorithms for Ray Tracing by David MacDonald A thsis prsntd to th Univrsity of Watrloo in fulfillmnt of th thsis rquirmnt for th dgr of Mastr of Mathmatics in Computr Scinc Watrloo, Ontario,
More informationOption 1: Inside Mount: Installing Mounting Brackets
SrnaTM IR Insulating Honycomb Motorizd shad with infrard (IR) control Installation Guid (plas rad bfor installing) Stp : Rviw Includd Componnts English A. Option : Insid Mount: Installing Mounting Brackts
More informationTwo-Level Iterative Queuing Modeling of Software Contention
Two-Level Iterative Queuing Modeling of Software Contention Daniel A. Menascé Dept. of Computer Science George Mason University www.cs.gmu.edu/faculty/menasce.tml 2002 D. Menascé. All Rigts Reserved. 1
More informationSPECIFIC CRITERIA FOR THE GENERAL MOTORS GLOBAL TRADING PARTNER LABEL TEMPLATE:
SPCIFIC CRITRIA FOR TH GNRAL MOTORS GLOBAL TRADING PARTNR LABL TMPLAT: TH TMPLAT IDNTIFIS HOW AND WHR DATA IS TO B PLACD ON TH LABL WHN IT IS RQUIRD AS PART OF A GM BUSINSS RQUIRMNT FONT SIZS AR SPCIFID
More informationLand 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 informationAnnouncements. Lilian s office hours rescheduled: Fri 2-4pm HW2 out tomorrow, due Thursday, 7/7. CSE373: Data Structures & Algorithms
Announcements Lilian s office ours resceduled: Fri 2-4pm HW2 out tomorrow, due Tursday, 7/7 CSE373: Data Structures & Algoritms Deletion in BST 2 5 5 2 9 20 7 0 7 30 Wy migt deletion be arder tan insertion?
More informationAcceleration 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 informationAn Auto-tuned Method for Solving Large Tridiagonal Systems on the GPU
An Auto-tund Mthod for Solving Larg Tridiagonal Systms on th GPU Andrw Davidson Univrsity of California, Davis aaldavidson@ucdavis.du Yao Zhang Univrsity of California, Davis yaozhang@ucdavis.du John D.
More informationFuzzy Intersection and Difference Model for Topological Relations
IFS-EUSFLT 009 Fuzzy Intrsction and Diffrnc Modl for Topological Rlations hd LOODY Flornc SEDES Jordi INGLD 3 Univrsité Paul Sabatir (UPS) Toulous, 8 Rout d Narbonn, F-306-CEDEX 9, Franc Institut d Rchrchn
More informationOn 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 informationDynamic 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 informationRobust and Fault Tolerant Clock Synchronization Nikolaus Kerö, Oregano Systems Aneeq Mahmood, ZISS Thomas Kernen, Cisco Felix Ring, ZISS Tobias
Robust and Fault Tolrant Clock Synchronization Nikolaus Krö, Organo Systms Anq Mahmood, ZISS Thomas Krnn, Cisco Flix Ring, ZISS Tobias Müllr, Organo Systms Thomas Biglr, ZISS Rational Common notion of
More informationRevit Architecture ctu
h pt r2: Chaptr 2 Rvit Architctur ctu BasicsChaptr2: Bfor you bgin to us Rvit Architctur, you nd to bcom rc familiar with th intrfac, th typs of objcts you will b using to crat your dsigns, P sa and basic
More informationEXTENSION OF RCC TOPOLOGICAL RELATIONS FOR 3D COMPLEX OBJECTS COMPONENTS EXTRACTED FROM 3D LIDAR POINT CLOUDS
Th Intrnational rchivs of th Photogrammtry, mot Snsing and Spatial Information Scincs, Volum XLI-, 016 XXIII ISPS Congrss, 1 19 July 016, Pragu, Czch public EXTENSION OF CC TOPOLOGICL ELTIONS FO D COMPLEX
More information2D transformations Homogeneous coordinates. Uses of Transformations
2D transformations omogeneous coordinates Uses of Transformations Modeling: position and resize parts of a complex model; Viewing: define and position te virtual camera Animation: define ow objects move/cange
More informationthe following minimization problem, termed as the rectilinear polygon cover problem: \Cover
TWO GEOMETRIC OPTIMIZATION PROBLEMS BHASKAR DASGUPTA Dpartmnt of Computr Scinc Univrsity of Minnsota Minnapolis, MN 55455-0159 mail: dasgupta@cs.umn.du and VWANI ROYCHOWDHURY School of Elctrical Enginring
More informationEfficient 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 informationLecture 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 informationThe 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 informationCC-RANSAC: Fitting Planes in the Presence of Multiple Surfaces in Range Data
CC-RANSAC: Fitting Plans in th Prsnc of Multipl Surfacs in Rang Data Orazio Gallo, Robrto Manduchi Univrsity of California, Santa Cruz Abbas Rafii Cansta, Inc. Abstract Rang snsors, in particular tim-of-flight
More informationI - 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 informationInstallation Saving. Enhanced Physical Durability Enhanced Performance Warranty The IRR Comparison
Contnts Tchnology Nwly Dvlopd Cllo Tchnology Cllo Tchnology : Improvd Absorption of Light Doubl-sidd Cll Structur Cllo Tchnology : Lss Powr Gnration Loss Extrmly Low LID Clls 3 3 4 4 4 Advantag Installation
More informationModeling Surfaces of Arbitrary Topology using Manifolds 1
Modling Surfacs of Arbitrary Topology using Manifolds 1 Cindy M. Grimm John F. Hughs cmg@cs.brown.du (401) 863-7693 jfh@cs.brown.du (401) 863-7638 Th Scinc and Tchnology Cntr for Computr Graphics and Scintific
More informationMultihop MIMO Relay Networks with ARQ
Multihop MIMO Rlay Ntworks with ARQ Yao Xi Dniz Gündüz Andra Goldsmith Dpartmnt of Elctrical Enginring Stanford Univrsity Stanford CA Dpartmnt of Elctrical Enginring Princton Univrsity Princton NJ Email:
More informationThe 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 informationCPSC 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 informationIntersection-free Dual Contouring on Uniform Grids: An Approach Based on Convex/Concave Analysis
Intrsction-fr Dual Contouring on Uniform Grids: An Approach Basd on Convx/Concav Analysis Charli C. L. Wang Dpartmnt of Mchanical and Automation Enginring, Th Chins Univrsity of Hong Kong E-mail: cwang@ma.cuhk.du.hk
More informationWrap up Amortized Analysis; AVL Trees. Riley Porter Winter CSE373: Data Structures & Algorithms
CSE 373: Data Structures & Wrap up Amortized Analysis; AVL Trees Riley Porter Course Logistics Symposium offered by CSE department today HW2 released, Big- O, Heaps (lecture slides ave pseudocode tat will
More informationOutline. Tasks for Exercise Six. Exercise Six Goals. Task One: Kinetic Energy Table. Nested for Loops. Laboratory VI Program Control Using Loops
Ercis 6 -- Loopig March 9, 6 Laboratory VI Program Cotrol Usig Loops Larry Cartto Computr Scic 6 Computig i Egirig ad Scic Outli Ercis si goals Outli tasks for rcis si Itroduc ida of std loops ad tabl
More information