Toward Understanding Heterogeneity in Computing
|
|
- Dana McLaughlin
- 5 years ago
- Views:
Transcription
1 Toward Understandng Heterogenety n Computng Arnold L. Rosenberg Ron C. Chang Department of Electrcal and Computer Engneerng Colorado State Unversty Fort Collns, CO, USA {rsnbrg, ron.chang@colostate.edu}
2 Motvaton Goal to ncrease our understandng of heterogenety n computng platforms 2
3 Motvaton Goal to ncrease our understandng of heterogenety n computng platforms Heterogeneous computng platforms dfferent computng speeds 3
4 Motvaton Goal to ncrease our understandng of heterogenety n computng platforms Heterogeneous computng platforms dfferent computng speeds archtecturally balanced 4
5 Understandng Heterogenety Suppose we have n+ computers: the server C a cluster C comprsng n computers, C,, C n Heterogenety profle of C C can complete one unt of work n tme <,..., n >... 2 n 5
6 The Cluster-Explotaton Problem (CEP) C must complete as many unts of work as possble on cluster C wthn a gven lfespan of L tme unts 6
7 The Cluster-Explotaton Problem (CEP) C must complete as many unts of work as possble on cluster C wthn a gven lfespan of L tme unts A worksharng protocol a schedule that solves the CEP 7
8 Archtectural Parameters Fxed communcaton cost setup tme σ latency λ neglgble over a long lfespan 8
9 Archtectural Parameters and Sample Values Common parameters: transmsson rate τ (e.g. μsec. / work unt) output-to-nput length rato δ (= ) For computer, packagng rate π (e.g. μsec. / work unt) unpackagng rate π (e.g. μsec. / work unt) workload (work unts) w 9
10 Worksharng Protocols w C ( π + τ w ) C C n
11 Worksharng Protocols ( + π ) w C C w n ( π + τ)w n C n
12 Worksharng Protocols δw C ( π + τ δw ) C ( + π ) n w n C n 2
13 Worksharng Protocols C C δw n ( π + τ) δ n w n C n 3
14 The FIFO Protocol C sends work to C ( sends work to C 2 π + τ) w ( τ) w2 sends work to C 3 π + ( π + τ) w3 C wats processes ( + π ) w results ( π + τ δw ) C 2 wats processes ( + π ) w 2 2 results ( π + τ δw 2 ) 2 C 3 wats processes ( + π ) w 3 3 results ( π + τ δw 3 ) 3 (NOT TO SCALE) 4
15 The FIFO Protocol s Optmal Theorem [Adler-Gong-Rosenberg] Over any suffcently long lfespan L, for any heterogeneous cluster C no matter what ts heterogenety profle: FIFO worksharng protocols provde optmal solutons to the cluster-explotaton problem C s equally productve under every FIFO protocol,.e., under all startup orderngs 5
16 Let X = n = ( π The Work-Producton of FIFO + τ) + (+ π + πδ) π + τ τδ = ( π + τ) + (+ π + πδ j j ) 6
17 Let X = n = ( π The Work-Producton of FIFO + τ) + (+ π + πδ) π + τ τδ = ( π + τ) + (+ π + πδ j j ) Then, W = τδ + X L 7
18 8 The Work-Producton of FIFO = = = + + = + = n j j j B A B B A X, and B A let smplfy, To τδ πδ π τ π = = = n j j X ) ( ) ( ) ( ) ( Let πδ π τ π τδ τ π πδ π τ π
19 On Comparng Heterogenety Profles For any cluster C wth heterogenety profle P =,..., n 9
20 On Comparng Heterogenety Profles For any cluster C wth heterogenety profle P =,..., n C s homogeneous-equvalent computng rate (HECR) s where P c = ( ) max =,..., { ( ) X( P ) X( P) } 2
21 Heterogenety Profles Profle : when n = 8, n + =, whch spreads evenly n a range n 8 7 6,,,..., Number of Computers HECR Recall: faster cluster has smaller HECR value 2
22 Heterogenety Profles Profle 2 : when n = 8, =,,,..., Number of Computers HECR
23 Avg. Speed vs. Std-Dev of Speed 8 computers HECR Avg. Speed =.75 Avg. Speed =.5 Avg. Speed =.25 Std-Dev=.2 Std-Dev=. Std-Dev=.5 Randomly generate profles for each combnaton 23
24 Avg. Speed vs. Std-Dev of Speed 8 computers Std-Dev HECR Avg. Speed The probablty that these two groups have the same mean s 2 24
25 Avg. Speed vs. Std-Dev of Speed 8 computers Std-Dev HECR Avg. Speed Trals wth 6, 32 computers show smlar pattern 25
26 Speedng Up Clusters Optmally under FIFO Protocols Whch one computer should you speed up, f you can speed up only one? 26
27 Speedng Up Clusters Optmally under FIFO Protocols Whch one computer should you speed up, f you can speed up only one? We study two varants of ths queston 27
28 Speedng Up Clusters Optmally under FIFO Protocols For convenence, - let cluster have heterogenety profle where C let and j > be two computer ndces n P =<,..., n >, 28
29 29 Fxed and Proportonal Speed-up Fxed-speedup scenaro by a fxed amount n j j j j n j j j P P φ φ,...,,,,...,,,,...,,...,,,,...,,,,..., ) ( ) ( = = n φ <
30 3 Fxed and Proportonal Speed-up Fxed-speedup scenaro (by a fxed amount ) n j j j j n j j j P P φ φ,...,,,,...,,,,...,,...,,,,...,,,,..., ) ( ) ( = = Proportonal-speedup scenaro by a relatve amount n j j j j n j j j P P ψ ψ,...,,,,...,,,,...,,...,,,,...,,,,..., ] [ ] [ = = n φ < < ψ
31 Proposton for Fxed-Speedup Under the fxed-speedup scenaro, the most advantageous sngle computer to speed up s C s fastest computer 3
32 Terms for followng fgures Recall: work producton W = τδ + X L Work rato the rato of work producton after speedup to work producton before speedup Speedup computer the sngle computer that s sped up 32
33 Fxed-Speedup Scenaro Work rato <, /2, /3, /4> </2, /4, /6, /8> speedup computer φ = /6 33
34 Proposton for Proportonal-Speedup (Recall : A = π + τ, B = + π + πδ, and > j ) If If ψ > speedng up (faster) s better ψ < j j Aτδ Aτδ 2 / B C j 2 / B speedng up (slower) s better C 34
35 If ψ Proposton for Proportonal-Speedup (Recall : A = π + τ, B = + π + πδ, and > j ) speedng up C j (faster) s better 2 5 If ψ < Aτδ / B =. j j > Aτδ / B 2 =. speedng up (slower) s better C 5 Parameter A B wth coarse ( sec / task) tasks Rate μ second / work unt. second / work unt 35
36 If ψ Proposton for Proportonal-Speedup (Recall : A = π + τ, B = + π + πδ, and > j ) speedng up C j (faster) s better 2 5 If ψ < Aτδ / B =. j j > Aτδ / B 2 =. speedng up (slower) s better C 5 That s, t s more advantageous to speed up the faster one unless ether both computers are already very fast or the speedup factor s very large. 36
37 Proportonal-Speedup n Acton Round speedup computer 37
38 Proportonal-Speedup n Acton Round speedup computer 38
39 Proportonal-Speedup n Acton Round speedup computer 39
40 Proportonal-Speedup n Acton Round speedup computer 4
41 Proportonal-Speedup n Acton Round speedup computer 4
42 Proportonal-Speedup n Acton Round speedup computer 42
43 Proportonal-Speedup n Acton Round speedup computer 43
44 Proportonal-Speedup n Acton Round speedup computer 44
45 Proportonal-Speedup n Acton Round speedup computer 45
46 Proportonal-Speedup n Acton Round speedup computer 46
47 Proportonal-Speedup n Acton Round speedup computer 47
48 Proportonal-Speedup n Acton Round speedup computer 48
49 Proportonal-Speedup n Acton Round speedup computer 49
50 Proportonal-Speedup n Acton Round speedup computer 5
51 Proportonal-Speedup n Acton Round speedup computer 5
52 Proportonal-Speedup n Acton Round speedup computer 52
53 Proportonal-Speedup n Acton When all computers are very fast It s more advantageous to speed up the slower one 53
54 Proportonal-Speedup n Acton.8 Round speedup computer 54
55 Proportonal-Speedup n Acton.8 Round speedup computer 55
56 Proportonal-Speedup n Acton.8 Round speedup computer 56
57 Proportonal-Speedup n Acton.8 Round speedup computer 57
58 Proportonal-Speedup n Acton.8 Round speedup computer 58
59 Summary Two ways to measure computng power the X functon the HECR value 59
60 Summary Two ways to measure computng power the X functon the HECR value Standard devaton nfluences work producton 6
61 Summary Two ways to measure computng power the X functon the HECR value Standard devaton nfluences work producton Speedng up a fast computer n a cluster s almost always more advantageous than speedng up a slower one 6
62 Thank you Questons?
63 HECR values Number of Computers Profle Profle Profle : = n n + Profle 2 : = Recall: faster cluster has smaller HECR value 63
64 Avg. Speed vs. Std-Dev of Speed 6 computers Std-Dev HECR Avg. Speed
65 Avg. Speed vs. Std-Dev of Speed 32 computers Std-Dev HECR Avg. Speed
x = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationExternalities in wireless communication: A public goods solution approach to power allocation. by Shrutivandana Sharma
Externaltes n wreless communcaton: A publc goods soluton approach to power allocaton by Shrutvandana Sharma SI 786 Tuesday, Feb 2, 2006 Outlne Externaltes: Introducton Plannng wth externaltes Power allocaton:
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationBIO Lab 2: TWO-LEVEL NORMAL MODELS with school children popularity data
Lab : TWO-LEVEL NORMAL MODELS wth school chldren popularty data Purpose: Introduce basc two-level models for normally dstrbuted responses usng STATA. In partcular, we dscuss Random ntercept models wthout
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More informationEGR 544 Communication Theory
EGR 544 Communcaton Theory. Informaton Sources Z. Alyazcoglu Electrcal and Computer Engneerng Department Cal Poly Pomona Introducton Informaton Source x n Informaton sources Analog sources Dscrete sources
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationCathy Walker March 5, 2010
Cathy Walker March 5, 010 Part : Problem Set 1. What s the level of measurement for the followng varables? a) SAT scores b) Number of tests or quzzes n statstcal course c) Acres of land devoted to corn
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationWeek 9 Chapter 10 Section 1-5
Week 9 Chapter 10 Secton 1-5 Rotaton Rgd Object A rgd object s one that s nondeformable The relatve locatons of all partcles makng up the object reman constant All real objects are deformable to some extent,
More information/ n ) are compared. The logic is: if the two
STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence
More informationStatistical Evaluation of WATFLOOD
tatstcal Evaluaton of WATFLD By: Angela MacLean, Dept. of Cvl & Envronmental Engneerng, Unversty of Waterloo, n. ctober, 005 The statstcs program assocated wth WATFLD uses spl.csv fle that s produced wth
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationImportant Instructions to the Examiners:
Summer 0 Examnaton Subject & Code: asc Maths (70) Model Answer Page No: / Important Instructons to the Examners: ) The Answers should be examned by key words and not as word-to-word as gven n the model
More informationDepartment of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution
Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationSTATISTICS QUESTIONS. Step by Step Solutions.
STATISTICS QUESTIONS Step by Step Solutons www.mathcracker.com 9//016 Problem 1: A researcher s nterested n the effects of famly sze on delnquency for a group of offenders and examnes famles wth one to
More informationPhysics 115. Molecular motion and temperature Phase equilibrium, evaporation
Physcs 115 General Physcs II Sesson 9 Molecular moton and temperature Phase equlbrum, evaporaton R. J. Wlkes Emal: phy115a@u.washngton.edu Home page: http://courses.washngton.edu/phy115a/ 4/14/14 Physcs
More informationComputing a Cournot Equilibrium in Integers
Computng a Cournot Equlbrum n Integers Mchael J. Todd December 6, 2013 Abstract We gve an effcent algorthm for computng a Cournot equlbrum when the producers are confned to ntegers, the nverse demand functon
More informationSupporting Information
Supportng Informaton Water structure at the ar-aqueous nterface of dvalent caton and ntrate solutons Man Xu, Rck Spnney, Heather C. Allen* allen@chemstry.oho-state.edu Fresnel factors and spectra normalzaton
More informationComputing MLE Bias Empirically
Computng MLE Bas Emprcally Kar Wa Lm Australan atonal Unversty January 3, 27 Abstract Ths note studes the bas arses from the MLE estmate of the rate parameter and the mean parameter of an exponental dstrbuton.
More informationAnnouncements EWA with ɛ-exploration (recap) Lecture 20: EXP3 Algorithm. EECS598: Prediction and Learning: It s Only a Game Fall 2013.
Lecture 0: EXP3 Algorthm 1 EECS598: Predcton and Learnng: It s Only a Game Fall 013 Prof. Jacob Abernethy Lecture 0: EXP3 Algorthm Scrbe: Zhhao Chen Announcements None 0.1 EWA wth ɛ-exploraton (recap)
More informationChapter 1. Probability
Chapter. Probablty Mcroscopc propertes of matter: quantum mechancs, atomc and molecular propertes Macroscopc propertes of matter: thermodynamcs, E, H, C V, C p, S, A, G How do we relate these two propertes?
More informationPricing and Resource Allocation Game Theoretic Models
Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationHighly-Efficient Multi-Coil Wireless Power Transfer (WPT)
Hghly-Effcent Mult-Col Wreless Power Transfer WPT Mehd Kan May 3, 04 GT-Boncs ab, School of Electrcal and Computer Engneerng Georga Insttute of Technology, Atlanta, GA www.gtboncs.org WPT Applcatons Chargng
More informationIntroduction to Information Theory, Data Compression,
Introducton to Informaton Theory, Data Compresson, Codng Mehd Ibm Brahm, Laura Mnkova Aprl 5, 208 Ths s the augmented transcrpt of a lecture gven by Luc Devroye on the 3th of March 208 for a Data Structures
More informationThis column is a continuation of our previous column
Comparson of Goodness of Ft Statstcs for Lnear Regresson, Part II The authors contnue ther dscusson of the correlaton coeffcent n developng a calbraton for quanttatve analyss. Jerome Workman Jr. and Howard
More informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
More informationA NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011
A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegan Busness School 2011 Functons featurng constant elastcty of substtuton CES are wdely used n appled economcs and fnance. In ths note, I do two thngs. Frst,
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationContinuous Time Markov Chain
Contnuous Tme Markov Chan Hu Jn Department of Electroncs and Communcaton Engneerng Hanyang Unversty ERICA Campus Contents Contnuous tme Markov Chan (CTMC) Propertes of sojourn tme Relatons Transton probablty
More informationIndeterminate pin-jointed frames (trusses)
Indetermnate pn-jonted frames (trusses) Calculaton of member forces usng force method I. Statcal determnacy. The degree of freedom of any truss can be derved as: w= k d a =, where k s the number of all
More informationGeorgia Tech PHYS 6124 Mathematical Methods of Physics I
Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends
More informationBoise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab
Bose State Unersty Department of Electrcal and omputer Engneerng EE 1L rcut Analyss and Desgn Lab Experment #8: The Integratng and Dfferentatng Op-Amp rcuts 1 Objectes The objectes of ths laboratory experment
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationLab 4: Two-level Random Intercept Model
BIO 656 Lab4 009 Lab 4: Two-level Random Intercept Model Data: Peak expratory flow rate (pefr) measured twce, usng two dfferent nstruments, for 17 subjects. (from Chapter 1 of Multlevel and Longtudnal
More informationModeling and Simulation of a Hexapod Machine Tool for the Dynamic Stability Analysis of Milling Processes. C. Henninger, P.
Smpack User Meetng 27 Modelng and Smulaton of a Heapod Machne Tool for the Dynamc Stablty Analyss of Mllng Processes C. Hennnger, P. Eberhard Insttute of Engneerng project funded by the DFG wthn the framework
More informationBoise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab
Bose State Unersty Department of Electrcal and omputer Engneerng EE 1L rcut Analyss and Desgn Lab Experment #8: The Integratng and Dfferentatng Op-Amp rcuts 1 Objectes The objectes of ths laboratory experment
More informationCS47300: Web Information Search and Management
CS47300: Web Informaton Search and Management Probablstc Retreval Models Prof. Chrs Clfton 7 September 2018 Materal adapted from course created by Dr. Luo S, now leadng Albaba research group 14 Why probabltes
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationJoint Scheduling and Power-Allocation for Interference Management in Wireless Networks
Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More information), it produces a response (output function g (x)
Lnear Systems Revew Notes adapted from notes by Mchael Braun Typcally n electrcal engneerng, one s concerned wth functons of tme, such as a voltage waveform System descrpton s therefore defned n the domans
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More information(1 ) (1 ) 0 (1 ) (1 ) 0
Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral
More informationHow to choose under social influence?
How to choose under socal nfluence? Mrta B. Gordon () Jean-Perre Nadal (2) Dens Phan (,3) - Vktorya Semeshenko () () Laboratore Lebnz - IMAG - Grenoble (2) Laboratore de Physque Statstque ENS - Pars (3)
More informationNonlinear Classifiers II
Nonlnear Classfers II Nonlnear Classfers: Introducton Classfers Supervsed Classfers Lnear Classfers Perceptron Least Squares Methods Lnear Support Vector Machne Nonlnear Classfers Part I: Mult Layer Neural
More informationWINTER 2017 EXAMINATION
(ISO/IEC - 700-00 Certfed) WINTER 07 EXAMINATION Model wer ject Code: Important Instructons to Eamners: ) The answers should be eamned by key words and not as word-to-word as gven n the model answer scheme.
More informationEstimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort
Estmatng Delas Would be nce to have a back of the envelope method for szng gates for speed Logcal Effort ook b Sutherland, Sproull, Harrs Chapter s on our web page Gate Dela Model Frst, normalze a model
More informationCHAPTER IV RESEARCH FINDING AND ANALYSIS
CHAPTER IV REEARCH FINDING AND ANALYI A. Descrpton of Research Fndngs To fnd out the dfference between the students who were taught by usng Mme Game and the students who were not taught by usng Mme Game
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationAS-Level Maths: Statistics 1 for Edexcel
1 of 6 AS-Level Maths: Statstcs 1 for Edecel S1. Calculatng means and standard devatons Ths con ndcates the slde contans actvtes created n Flash. These actvtes are not edtable. For more detaled nstructons,
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationClustering gene expression data & the EM algorithm
CG, Fall 2011-12 Clusterng gene expresson data & the EM algorthm CG 08 Ron Shamr 1 How Gene Expresson Data Looks Entres of the Raw Data matrx: Rato values Absolute values Row = gene s expresson pattern
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationx i1 =1 for all i (the constant ).
Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationMeasurement of Radiation: Exposure. Purpose. Quantitative description of radiation
Measurement of Radaton: Exposure George Starkschall, Ph.D. Department of Radaton Physcs U.T. M.D. Anderson Cancer Center Purpose To ntroduce the concept of radaton exposure and to descrbe and evaluate
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationAssessment of Site Amplification Effect from Input Energy Spectra of Strong Ground Motion
Assessment of Ste Amplfcaton Effect from Input Energy Spectra of Strong Ground Moton M.S. Gong & L.L Xe Key Laboratory of Earthquake Engneerng and Engneerng Vbraton,Insttute of Engneerng Mechancs, CEA,
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationComplex Numbers, Signals, and Circuits
Complex Numbers, Sgnals, and Crcuts 3 August, 009 Complex Numbers: a Revew Suppose we have a complex number z = x jy. To convert to polar form, we need to know the magntude of z and the phase of z. z =
More informationCokriging Partial Grades - Application to Block Modeling of Copper Deposits
Cokrgng Partal Grades - Applcaton to Block Modelng of Copper Deposts Serge Séguret 1, Julo Benscell 2 and Pablo Carrasco 2 Abstract Ths work concerns mneral deposts made of geologcal bodes such as breccas
More informationDiscussion 11 Summary 11/20/2018
Dscusson 11 Summary 11/20/2018 1 Quz 8 1. Prove for any sets A, B that A = A B ff B A. Soluton: There are two drectons we need to prove: (a) A = A B B A, (b) B A A = A B. (a) Frst, we prove A = A B B A.
More informationCONJUGACY IN THOMPSON S GROUP F. 1. Introduction
CONJUGACY IN THOMPSON S GROUP F NICK GILL AND IAN SHORT Abstract. We complete the program begun by Brn and Squer of charactersng conjugacy n Thompson s group F usng the standard acton of F as a group of
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationFUZZY FINITE ELEMENT METHOD
FUZZY FINITE ELEMENT METHOD RELIABILITY TRUCTURE ANALYI UING PROBABILITY 3.. Maxmum Normal tress Internal force s the shear force, V has a magntude equal to the load P and bendng moment, M. Bendng moments
More informationAGC Introduction
. Introducton AGC 3 The prmary controller response to a load/generaton mbalance results n generaton adjustment so as to mantan load/generaton balance. However, due to droop, t also results n a non-zero
More informationSpin-rotation coupling of the angularly accelerated rigid body
Spn-rotaton couplng of the angularly accelerated rgd body Loua Hassan Elzen Basher Khartoum, Sudan. Postal code:11123 E-mal: louaelzen@gmal.com November 1, 2017 All Rghts Reserved. Abstract Ths paper s
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationLecture 16 Statistical Analysis in Biomaterials Research (Part II)
3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationElectrical double layer: revisit based on boundary conditions
Electrcal double layer: revst based on boundary condtons Jong U. Km Department of Electrcal and Computer Engneerng, Texas A&M Unversty College Staton, TX 77843-318, USA Abstract The electrcal double layer
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationDetermining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application
7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,
More informationHomework 9 Solutions. 1. (Exercises from the book, 6 th edition, 6.6, 1-3.) Determine the number of distinct orderings of the letters given:
Homework 9 Solutons PROBLEM ONE 1 (Exercses from the book, th edton,, 1-) Determne the number of dstnct orderngs of the letters gven: (a) GUIDE Soluton: 5! (b) SCHOOL Soluton:! (c) SALESPERSONS Soluton:
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More information2010 Black Engineering Building, Department of Mechanical Engineering. Iowa State University, Ames, IA, 50011
Interface Energy Couplng between -tungsten Nanoflm and Few-layered Graphene Meng Han a, Pengyu Yuan a, Jng Lu a, Shuyao S b, Xaolong Zhao b, Yanan Yue c, Xnwe Wang a,*, Xangheng Xao b,* a 2010 Black Engneerng
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationHierarchical Bayes. Peter Lenk. Stephen M Ross School of Business at the University of Michigan September 2004
Herarchcal Bayes Peter Lenk Stephen M Ross School of Busness at the Unversty of Mchgan September 2004 Outlne Bayesan Decson Theory Smple Bayes and Shrnkage Estmates Herarchcal Bayes Numercal Methods Battng
More informationMotion Perception Under Uncertainty. Hongjing Lu Department of Psychology University of Hong Kong
Moton Percepton Under Uncertanty Hongjng Lu Department of Psychology Unversty of Hong Kong Outlne Uncertanty n moton stmulus Correspondence problem Qualtatve fttng usng deal observer models Based on sgnal
More informationCHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD
CHALMERS, GÖTEBORGS UNIVERSITET SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS COURSE CODES: FFR 35, FIM 72 GU, PhD Tme: Place: Teachers: Allowed materal: Not allowed: January 2, 28, at 8 3 2 3 SB
More informationCHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD
90 CHAPTER 7 STOCHASTIC ECOOMIC EMISSIO DISPATCH-MODELED USIG WEIGHTIG METHOD 7.1 ITRODUCTIO early 70% of electrc power produced n the world s by means of thermal plants. Thermal power statons are the
More informationFIFO scheduling of divisible loads with return messages under the one-port model
FIFO schedulng of dvsble loads wth return messages under the one-port model Olver Beaumont, Lors Marchal 2, Veronka Rehn 2 and Yves Robert 2 : LaBRI, UMR CNRS 5800 2: LIP, UMR CNRS-INRIA-UCBL 5668 Bordeaux,
More information