Distributed Hash Tables
|
|
|
- Amber Hardy
- 5 years ago
- Views:
Transcription
1 Distributed Hash Tables Amir H. Payberah Amirkabir University of Technology (Tehran Polytechnic) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 1 / 62
2 What is the Problem? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 2 / 62
3 What is the Problem? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 3 / 62
4 Possible Solutions (1/3) Central directory Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 4 / 62
5 Possible Solutions (2/3) Flooding Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 5 / 62
6 Possible Solutions (3/3) Distributed Hash Table (DHT) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 6 / 62
7 Distributed Hash Table (DHT) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 7 / 62
8 Distributed Hash Table An ordinary hash-table, which is... Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 8 / 62
9 Distributed Hash Table An ordinary hash-table, which is distributed. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 9 / 62
10 Steps to Build a DHT Step 1: decide on common key space for nodes and values. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 10 / 62
11 Steps to Build a DHT Step 1: decide on common key space for nodes and values. Step 2: connect the nodes smartly. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 10 / 62
12 Steps to Build a DHT Step 1: decide on common key space for nodes and values. Step 2: connect the nodes smartly. Step 3: make a strategy for assigning items to nodes. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 10 / 62
13 Chord: an Example of a DHT Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 11 / 62
14 Construct Chord - Step 1 Use a logical name space, called the id space, consisting of identifiers {0, 1, 2,, N 1}. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 12 / 62
15 Construct Chord - Step 1 Use a logical name space, called the id space, consisting of identifiers {0, 1, 2,, N 1}. Id space is a logical ring modulo N. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 12 / 62
16 Construct Chord - Step 1 Use a logical name space, called the id space, consisting of identifiers {0, 1, 2,, N 1}. Id space is a logical ring modulo N. Every node picks a random id though Hash H. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 12 / 62
17 Construct Chord - Step 1 Use a logical name space, called the id space, consisting of identifiers {0, 1, 2,, N 1}. Id space is a logical ring modulo N. Every node picks a random id though Hash H. Example: Space N = 16{0,, 15} Five nodes a, b, c, d, e. H(a) = 6 H(b) = 5 H(c) = 0 H(d) = 11 H(e) = 2 Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 12 / 62
18 Construct Chord - Step 2 (1/2) The successor of an id is the first node met going in clockwise direction starting at the id. succ(x): is the first node on the ring with id greater than or equal x. succ(12) = 0 succ(1) = 2 succ(6) = 6 Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 13 / 62
19 Construct Chord - Step 2 (2/2) Each node points to its successor. The successor of a node n is succ(n + 1). 0 s successor is succ(1) = 2. 2 s successor is succ(3) = s successor is succ(12) = 0. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 14 / 62
20 Construct Chord - Step 3 Where to store data? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 15 / 62
21 Construct Chord - Step 3 Where to store data? Use globally known hash function H. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 15 / 62
22 Construct Chord - Step 3 Where to store data? Use globally known hash function H. Each item key, value gets identifier H(key) = k. Space N = 16{0,, 15} Five nodes a, b, c, d, e. H(F atemeh) = 12 H(Cosmin) = 2 H(Seif) = 9 H(Sarunas) = 14 H(T allat) = 4 Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 15 / 62
23 Construct Chord - Step 3 Where to store data? Use globally known hash function H. Each item key, value gets identifier H(key) = k. Space N = 16{0,, 15} Five nodes a, b, c, d, e. H(F atemeh) = 12 H(Cosmin) = 2 H(Seif) = 9 H(Sarunas) = 14 H(T allat) = 4 Store each item at its successor. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 16 / 62
24 Construct Chord - Step 3 Where to store data? Use globally known hash function H. Each item key, value gets identifier H(key) = k. Space N = 16{0,, 15} Five nodes a, b, c, d, e. H(F atemeh) = 12 H(Cosmin) = 2 H(Seif) = 9 H(Sarunas) = 14 H(T allat) = 4 Store each item at its successor. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 16 / 62
25 Construct Chord - Step 3 Where to store data? Use globally known hash function H. Each item key, value gets identifier H(key) = k. Space N = 16{0,, 15} Five nodes a, b, c, d, e. H(F atemeh) = 12 H(Cosmin) = 2 H(Seif) = 9 H(Sarunas) = 14 H(T allat) = 4 Store each item at its successor. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 17 / 62
26 How to Lookup? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 18 / 62
27 Lookup (1/2) To lookup a key k: Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 19 / 62
28 Lookup (1/2) To lookup a key k: Calculate H(k). Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 19 / 62
29 Lookup (1/2) To lookup a key k: Calculate H(k). Follow succ pointers until item k is found. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 19 / 62
30 Lookup (1/2) To lookup a key k: Calculate H(k). Follow succ pointers until item k is found. Example: Lookup Seif at node 2. H(Seif) = 9 Traverse nodes: 2, 5, 6, 11 Return Stockholm to initiator Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 19 / 62
31 Lookup (2/2) Algorithm 1 Ask node n to find the successor of id 1: procedure n.findsuccessor(id) 2: if pred Ø and id (pred, n] then 3: return n 4: else if id (n, succ] then 5: return succ 6: else// forward the query around the circle 7: return succ.findsuccessor(id) 8: end if 9: end procedure (a, b] the segment of the ring moving clockwise from but not including a until and including b. n.foo(.) denotes an RPC of foo(.) to node n. n.bar denotes and RPC to fetch the value of the variable bar in node n. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 20 / 62
32 Put and Get Algorithm 2 Store value with key id in the DHT 1: procedure n.put(id, value) 2: n = findsuccessor(id) 3: s.store(id, value) 4: end procedure Algorithm 3 Retrieve the value of the key id from the DHT 1: procedure n.get(id) 2: n = findsuccessor(id) 3: return s.retrieve(id) 4: end procedure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 21 / 62
33 Any Improvement? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 22 / 62
34 Improvement Speeding up lookups. If only the successor pointers are used: Worst case lookup time is N, for N nodes. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 23 / 62
35 Speeding up Lookups (1/2) Finger/routing table: Point to succ(n + 1) Point to succ(n + 2) Point to succ(n + 4)... Point to succ(n + 2 M 1 ) (N = 2 M, N: the id space size) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 24 / 62
36 Speeding up Lookups (1/2) Finger/routing table: Point to succ(n + 1) Point to succ(n + 2) Point to succ(n + 4)... Point to succ(n + 2 M 1 ) (N = 2 M, N: the id space size) Distance always halved to the destination. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 24 / 62
37 Speeding up Lookups (2/2) Every node n knows succ(n + 2 i 1 ) for i = 1,, M. Size of routing tables is logarithmic: Routing table size: M, where N = 2 M. Routing entries = log 2 (N). Example: Log 2 ( ) 20 Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 25 / 62
38 Lookup Improvement (1/3) Algorithm 4 Ask node n to find the successor of id 1: procedure n.findsuccessor(id) 2: if pred Ø and id (pred, n] then 3: return n 4: else if id (n, succ] then 5: return succ 6: else// forward the query around the circle 7: return succ.findsuccessor(id) 8: end if 9: end procedure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 26 / 62
39 Lookup Improvement (2/3) Algorithm 5 Ask node n to find the successor of id 1: procedure n.findsuccessor(id) 2: if pred Ø and id (pred, n] then 3: return n 4: else if id (n, succ] then 5: return succ 6: else// forward the query around the circle 7: p closestprecedingnode(id) 8: return p.findsuccessor(id) 9: end if 10: end procedure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 27 / 62
40 Lookup Improvement (3/3) Algorithm 6 Search locally for the highest predecessor of id 1: procedure closestprecedingnode(id) 2: for i = m downto 1 do 3: if finget[i] (n, id) then 4: return finger[i] 5: end if 6: end for 7: end procedure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 28 / 62
41 Lookups (1/7) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 29 / 62
42 Lookups (2/7) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 30 / 62
43 Lookups (3/7) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 31 / 62
44 Lookups (4/7) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 32 / 62
45 Lookups (5/7) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 33 / 62
46 Lookups (6/7) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 34 / 62
47 Lookups (7/7) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 35 / 62
48 How to Maintain the Ring? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 36 / 62
49 Periodic Stabilization (1/2) In Chord, in addition to the successor pointer, every node has a predecessor pointer. Predecessor of node n is the first node met in anti-clockwise direction starting at n. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 37 / 62
50 Periodic Stabilization (1/2) In Chord, in addition to the successor pointer, every node has a predecessor pointer. Predecessor of node n is the first node met in anti-clockwise direction starting at n. Periodic stabilization is used to make pointers eventually correct. Pointing succ to closest alive successor. Pointing pred to closest alive predecessor. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 37 / 62
51 Periodic Stabilization (2/2) Algorithm 7 Periodically at n 1: procedure n.stabilize() 2: v succ.pred 3: if v Ø and v (n, succ] then 4: succ v 5: end if 6: send notify(n) to succ 7: end procedure Algorithm 8 Upon receipt a notify(p) at node m 1: on receive notify p from n do 2: if pred = Ø or p (pred, m] then 3: pred p 4: end if 5: end event Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 38 / 62
52 Handling Join Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 39 / 62
53 Handling Join When n joins: Find n s successor with lookup(n). Set succ to n s successor. Stabilization fixes the rest. Algorithm 9 Join a Chord ring containing node m 1: procedure n.join(m) 2: pred Ø 3: succ m.findsuccessor(n) 4: end procedure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 40 / 62
54 Join (1/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 41 / 62
55 Join (2/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 42 / 62
56 Join (3/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 43 / 62
57 Join (4/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 44 / 62
58 Join (5/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 45 / 62
59 Fix Fingers (1/4) Periodically refresh finger table entries, and store the index of the next finger to fix. Algorithm 10 When receiving notif y(p) at n 1: procedure n.fixfingers() 2: next next + 1 3: if next > m then 4: next 1 5: end if 6: finger[next] findsuccessor(n 2 next 1 ) 7: end procedure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 46 / 62
60 Fix Fingers (2/4) Current situation: succ(n 48) = N 60 succ( ) = succ(53) = N60 Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 47 / 62
61 Fix Fingers (3/4) succ( ) = succ(53) =? New node N 56 joins and stabilizes successor pointer. Finger 6 of node N21 is wrong now. N21 eventually try to fix finger 6 by looking up 53 which stops at N48. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 48 / 62
62 Fix Fingers (4/4) succ( ) = succ(53) = N56 N 48 will eventually stabilize its successor. This means the ring is correct now. Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 49 / 62
63 Handling Failure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 50 / 62
64 Successor List (1/2) A node has a successors list of size r containing the immediate r successors. succ(n + 1) succ(succ(n + 1) + 1) succ(succ(succ(n + 1) + 1) + 1) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 51 / 62
65 Successor List (1/2) A node has a successors list of size r containing the immediate r successors. succ(n + 1) succ(succ(n + 1) + 1) succ(succ(succ(n + 1) + 1) + 1) How big should r be? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 51 / 62
66 Successor List (1/2) A node has a successors list of size r containing the immediate r successors. succ(n + 1) succ(succ(n + 1) + 1) succ(succ(succ(n + 1) + 1) + 1) How big should r be? log 2 (N) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 51 / 62
67 Successor List (2/2) Algorithm 11 Join a Chord ring containing node m 1: procedure n.join(m) 2: pred Ø 3: succ m.findsuccessor(n) 4: updatesuccesorlist(succ.successorlist) 5: end procedure Algorithm 12 Periodically at n 1: procedure n.stabilize() 2: succ find first alive node in successor list 3: v succ.pred 4: if v Ø and v (n, succ] then 5: succ v 6: end if 7: send notify(n) to succ updatesuccessorlist(succ.successorlist) 8: end procedure Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 52 / 62
68 Dealing with Failure Periodic stabilization If successor fails: replace with closest alive successor If predecessor fails: set predecessor to nil Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 53 / 62
69 Failure (1/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 54 / 62
70 Failure (2/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 55 / 62
71 Failure (3/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 56 / 62
72 Failure (4/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 57 / 62
73 Failure (5/5) Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 58 / 62
74 Summary Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 59 / 62
75 Summary DHTs: distributed key, value Lookup service Put and Get Finger list: improve the lookup Periodically stabilization Successor list Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 60 / 62
76 References: Ion Stoica et al., Chord: A scalable peer-to-peer lookup service for internet applications, SIGCOMM, Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 61 / 62
77 Questions? Amir H. Payberah (Tehran Polytechnic) DHTs 1393/7/12 62 / 62
P2P Content Distribution BitTorrent and Spotify
P2P Content Distribution BitTorrent and Spotify Amir H. Payberah amir@sics.se Amirkabir University of Technology (Tehran Polytechnic) Amir H. Payberah (Tehran Polytechnic) P2P Content Distribution 1393/8/27
Probabilistic Quorum-Based Accounting for Peer-to-Peer Systems
Probabilistic Quorum-Based Accounting for Peer-to-Peer Systems William Conner and Klara Nahrstedt Department of Computer Science University of Illinois at Urbana-Champaign, Urbana, IL 61801 Abstract Providing
Recursive Mergesort. CSE 589 Applied Algorithms Spring Merging Pattern of Recursive Mergesort. Mergesort Call Tree. Reorder the Merging Steps
Recursive Mergesort CSE 589 Applied Algorithms Spring 1999 Cache Performance Mergesort Heapsort A[1n] is to be sorted; B[1n] is an auxiliary array; Mergesort(i,j) {sorts the subarray A[ij] } if i < j then
Index. in this web service Cambridge University Press
Abox, 159 161, 163 165, 167, 170, 175, 176, 178, 179, 182, 185 190, 192, 194, 195 absolute path, see path ACID, 294, 308 asynchronous, 253, 280, 293, 294, 296, 303, 359, 414 availability, see distributed
Touch Receptors and Mapping the Homunculus
Touch Receptors and Mapping the Homunculus Name: Date: Class: INTRODUCTION Humans learn a great deal about their immediate environment from the sense of touch. The brain is able to determine where the
Summary of Registration Changes
Summary of Registration Changes The registration changes summarized below are effective September 1, 2017. Please thoroughly review the supporting information in the appendixes and share with your staff
Artificial Intelligence. Clause Form and The Resolution Rule. Prof. Deepak Khemani. Department of Computer Science and Engineering
Artificial Intelligence Clause Form and The Resolution Rule Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 07 Lecture 03 Okay so we are
IN a distributed database system, data is
A novel Quorum Protocol 1 Parul Pandey, Maheshwari Tripathi arxiv:1403.518v1 [cs.dc] 0 Mar 014 Abstract One of the traditional mechanisms used in distributed systems for maintaining the consistency of
2.1 Review. 2.2 Inference and justifications
Applied Logic Lecture 2: Evidence Semantics for Intuitionistic Propositional Logic Formal logic and evidence CS 4860 Fall 2012 Tuesday, August 28, 2012 2.1 Review The purpose of logic is to make reasoning
A study of teacher s preferences by using of statistical methods
A study of teacher s preferences by using of statistical methods OLGA YANUSHKEVICHIENE Institute of Mathematics and Informatics Vilnius University Akademijos str., 4, Vilnius LT-08663 LITHUANIA olgjan@mail.ru
Load balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
Load balanced Scalable Byzantine Agreement through Quorum Building, with Full Information Valerie King 1, Steven Lonargan 1, Jared Saia 2, and Amitabh Trehan 1 1 Department of Computer Science, University
Heap and Merge Sorts
Heap and Merge Sorts Lecture 32 Robb T. Koether Hampden-Sydney College Mon, Apr 20, 2015 Robb T. Koether (Hampden-Sydney College) Heap and Merge Sorts Mon, Apr 20, 2015 1 / 22 1 Sorting 2 Comparison of
Sorting: Merge Sort. College of Computing & Information Technology King Abdulaziz University. CPCS-204 Data Structures I
Sorting: Merge Sort College of Computing & Information Technology King Abdulaziz University CPCS-204 Data Structures I Sorting: Merge Sort Problem with Bubble/Insertion/Selection Sorts: All of these sorts
MISSOURI S FRAMEWORK FOR CURRICULAR DEVELOPMENT IN MATH TOPIC I: PROBLEM SOLVING
Prentice Hall Mathematics:,, 2004 Missouri s Framework for Curricular Development in Mathematics (Grades 9-12) TOPIC I: PROBLEM SOLVING 1. Problem-solving strategies such as organizing data, drawing a
This report is organized in four sections. The first section discusses the sample design. The next
2 This report is organized in four sections. The first section discusses the sample design. The next section describes data collection and fielding. The final two sections address weighting procedures
UCB CS61C : Machine Structures
inst.eecs.berkeley.edu/~csc UCB CSC : Machine Structures Guest Lecturer Alan Christopher Lecture Caches II -- MEMRISTOR MEMORY ON ITS WAY (HOPEFULLY) HP has begun testing research prototypes of a novel
The Bounds of Reason: Game Theory and the Unification of the Behavioral Sciences
The Bounds of Reason: Game Theory and the Unification of the Behavioral Sciences The Bounds of Reason: Game Theory and the Unification of the Behavioral Sciences Herbert Gintis Princeton University Press
Smith Waterman Algorithm - Performance Analysis
Smith Waterman Algorithm - Performance Analysis Armin Bundle Department of Computer Science University of Erlangen Seminar mucosim SS 2016 Smith Waterman Algorithm - Performance Analysis Seminar mucosim
What can happen if two quorums try to lock their nodes at the same time?
Chapter 5 Quorum Systems What happens if a single server is no longer powerful enough to service all your customers? The obvious choice is to add more servers and to use the majority approach (e.g. Paxos,
Creating A Troop Agreement Troops and Parents
Creating A Troop Agreement Troops and Parents Objective To provide a better understanding of the benefits and importance of Team Agreements, and to provide examples and ideas. Length 15-20 minutes Materials
Biometrics Prof. Phalguni Gupta Department of Computer Science and Engineering Indian Institute of Technology, Kanpur. Lecture No.
Biometrics Prof. Phalguni Gupta Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture No. # 13 (Refer Slide Time: 00:16) So, in the last class, we were discussing
Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras
(Refer Slide Time: 00:26) Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 06 State Space Search Intro So, today
Balancing Authority Ace Limit (BAAL) Proof-of-Concept BAAL Field Trial
Balancing Authority Ace Limit (BAAL) Proof-of-Concept BAAL Field Trial Overview The Reliability-based Control Standard Drafting Team and the Balancing Area Control Standard Drafting Team were combined
Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less than Three Questions
J Philos Logic (2012) 41:493 503 DOI 10.1007/s10992-011-9181-7 Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less than Three Questions Gregory Wheeler & Pedro Barahona Received: 11 August 2010
Module 1: Health Information Exchange Policy and Procedures
Module 1: Health Information Exchange Policy and Procedures Module 1 Introduction In this module, the Health Information Exchange (HIE) Policies and Procedures will be introduced. The HIE is designed to
Laboratory Exercise Saratoga Springs Temple Site Locator
Brigham Young University BYU ScholarsArchive Engineering Applications of GIS - Laboratory Exercises Civil and Environmental Engineering 2017 Laboratory Exercise Saratoga Springs Temple Site Locator Jordi
HP-35s Calculator Program Compute Horizontal Curve Values given only 2 Parameters
Program for HP35s Calculator Page 1 HP-35s Calculator Program Compute Horizontal Curve Values given only 2 Parameters Author: This program is based on a program written by Dr. Bill Hazelton (http://www.wollindina.com/hp-35s/hp-35s_curves_1a.pdf).
The Fixed Hebrew Calendar
The Fixed Hebrew Calendar Moshe Lerman moshe.lerman@cremejvm.com June, 2017 קול גלגל המתגלגל ממטה למעלה 0. Introduction The present paper is an extension of a paper entitled Gauss Formula for the Julian
MissionInsite Learning Series Compare Your Congregation To Your Community Slide 1 COMPARE YOUR CONGREGATION TO YOUR COMMUNITY USING CONGREGANT PLOT & THE COMPARATIVEINSITE REPORT This Series will cover:
COS 226 Algorithms and Data Structures Fall Midterm
COS 226 Algorithms and Data Structures Fall 2005 Midterm This test has 6 questions worth a total of 50 points. You have 80 minutes. The exam is closed book, except that you are allowed to use a one page
STREAM-HD!!. WATCH. "Why Him?" FULL. MOVIE. (2016). ONLINE. FOR. FREE. DOWNLOAD.
STREAM-HD!!. WATCH. "Why Him?" FULL. MOVIE. (2016). ONLINE. FOR. FREE. DOWNLOAD. Watch NOW!! Watch Why Him? Full Movie, Watch Why Him? 2016 Full Movie Free Streaming Online with English Subtitles ready
Probability Distributions TEACHER NOTES MATH NSPIRED
Math Objectives Students will compare the distribution of a discrete sample space to distributions of randomly selected outcomes from that sample space. Students will identify the structure that emerges
Thesis: The book of Acts reveals God s plan for the Gospel to reach every nation, language and people.
Topic: God s GPS (Global Positioning System) Thesis: The book of Acts reveals God s plan for the Gospel to reach every nation, language and people. Key Text: Acts 1:8 & John 10:16 Hymns: Opening: #27 Closing:
Application for curing ailments through mudra science
Application for curing ailments through mudra science Nilam Upasani, Sharvari Shirke, Pallavi Jagdale, Pranjal Siraskar, Jaydeep Patil, Vision Shinde Vishwakarma Institute of Technology, Pune (India) ABSTRACT
REACHING AND KEEPING VISITORS CHECKLISTS
Dynamic Churches are not only intentional about reaching new people, but also about connecting them to the life of the Church and a personal relationship with Christ. Many Dynamic Churches use this documented
10/16/ st Century Faith Formation for All Ages & Generations! 21 ST CENTURY LEARNING & FAITH FORMATION. John Roberto, LifelongFaith Associates
21 st Century Faith Formation for All Ages & Generations! 21 ST CENTURY LEARNING & FAITH FORMATION John Roberto, LifelongFaith Associates 1 The Adaptive Challenge Technical Problems & Fixes Technical problems
St. Francis Catholic Primary School
St. Francis Catholic Primary School Admission Policy Jesus said Love one another as I have loved you St Francis School is a loving community, respecting every child and adult and caring for God s World,
THE DRUNKARDS WALK HOW RANDOMNESS RULES OUR LIVES LEONARD MLODINOW
page 1 / 5 page 2 / 5 the drunkards walk how pdf A random walk is a mathematical object, known as a stochastic or random process, that describes a path that consists of a succession of random steps on
Torah Code Cluster Probabilities
Torah Code Cluster Probabilities Robert M. Haralick Computer Science Graduate Center City University of New York 365 Fifth Avenue New York, NY 006 haralick@netscape.net Introduction In this note we analyze
The Advancement: A Book Review
From the SelectedWorks of Gary E. Silvers Ph.D. 2014 The Advancement: A Book Review Gary E. Silvers, Ph.D. Available at: https://works.bepress.com/dr_gary_silvers/2/ The Advancement: Keeping the Faith
Slides by: Ms. Shree Jaswal
Slides by: Ms. Shree Jaswal Introduction developing the project schedule Scheduling Charts logic diagrams and network (AOA,AON) critical path calendar scheduling and time based network management schedule
Ward Legacy Project: Stake Director Training
Ward Legacy Project: Stake Director Training Note: This document outlines the role of the Stake Director when the Ward Legacy Project is instituted at the Stake level. Ward Legacy Project- Overview The
St. Michael the Archangel Families Growing in Faith Parent Handbook. Cell phone:
St. Michael the Archangel Families Growing in Faith 2018-19 Parent Handbook Sunday Morning PSR Office Phone: 330-492-2657 Julie Sutton, PSR Coordinator julie@stmichaelcanton.org 330-492-3119 ext. 219 Cell
Bigdata High Availability Quorum Design
Bigdata High Availability Quorum Design Bigdata High Availability Quorum Design... 1 Introduction... 2 Overview... 2 Shared nothing... 3 Shared disk... 3 Quorum Dynamics... 4 Write pipeline... 5 Voting...
A Study of cost effectiveness of Financial Services Marketed by Islamic Banks in Iran
2010 International Conference on Economics, Business and Management IPEDR vol.2 (2011) (2011) IAC S IT Press, Manila, Philippines A Study of cost effectiveness of Financial Services Marketed by Islamic
Grade 6 correlated to Illinois Learning Standards for Mathematics
STATE Goal 6: Demonstrate and apply a knowledge and sense of numbers, including numeration and operations (addition, subtraction, multiplication, division), patterns, ratios and proportions. A. Demonstrate
PINOY BOYBAND SUPERSTAR (PBS) November 3, 2016 to December 11, A. PROMO TITLE: Pinoy Boyband Superstar: Super Fans Promo
PINOY BOYBAND SUPERSTAR (PBS) November 3, to December 11, Per DTI-FTEB SPD permit number 11768 series of A. PROMO TITLE: Pinoy Boyband Superstar: Super Fans Promo B. PROMOTION PERIOD: November 3, to December
Introduction to Statistical Hypothesis Testing Prof. Arun K Tangirala Department of Chemical Engineering Indian Institute of Technology, Madras
Introduction to Statistical Hypothesis Testing Prof. Arun K Tangirala Department of Chemical Engineering Indian Institute of Technology, Madras Lecture 09 Basics of Hypothesis Testing Hello friends, welcome
Who wrote the Letter to the Hebrews? Data mining for detection of text authorship
Who wrote the Letter to the? Data mining for detection of text authorship Madeleine Sabordo a, Shong Y. Chai a, Matthew J. Berryman a, and Derek Abbott a a Centre for Biomedical Engineering and School
Your Guide to Eucharistic Adoration at St. Thomas More Catholic Church
Your Guide to Eucharistic Adoration at St. Thomas More Catholic Church Welcome! Thank you for serving as an adorer at St. Thomas More. This guide will help you learn how Adoration works here as well as
Excel Lesson 3 page 1 April 15
Excel Lesson 3 page 1 April 15 Monday 4/13/15 We begin today's lesson with the $ symbol, one of the biggest hurdles for Excel users. Let us learn about the $ symbol in the context of what I call the Classic
Gateways DALIK v Programming manual
Gateways DALIK v1.4.3 Programming manual Index 1 GENERAL DESCRIPTION... 3 2 TECHNICAL INFORMATION... 4 3 PROGRAMMING... 5 3.1 APPLICATION PROGRAM INFORMATION... 5 3.2 INDIVIDUAL ADDRESS ASSIGMENT... 6
(Refer Slide Time 03:00)
Artificial Intelligence Prof. Anupam Basu Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 15 Resolution in FOPL In the last lecture we had discussed about
DPaxos: Managing Data Closer to Users for Low-Latency and Mobile Applications
DPaxos: Managing Data Closer to Users for Low-Latency and Mobile Applications ABSTRACT Faisal Nawab University of California, Santa Cruz Santa Cruz, CA fnawab@ucsc.edu In this paper, we propose Dynamic
Gesture recognition with Kinect. Joakim Larsson
Gesture recognition with Kinect Joakim Larsson Outline Task description Kinect description AdaBoost Building a database Evaluation Task Description The task was to implement gesture detection for some
Quorums. Christian Plattner, Gustavo Alonso Exercises for Verteilte Systeme WS05/06 Swiss Federal Institute of Technology (ETH), Zürich
Quorums Christian Plattner, Gustavo Alonso Exercises for Verteilte Systeme WS05/06 Swiss Federal Institute of Technology (ETH), Zürich {plattner,alonso}@inf.ethz.ch 20.01.2006 Setting: A Replicated Database
Agnostic KWIK learning and efficient approximate reinforcement learning
Agnostic KWIK learning and efficient approximate reinforcement learning István Szita Csaba Szepesvári Department of Computing Science University of Alberta Annual Conference on Learning Theory, 2011 Szityu
occasions (2) occasions (5.5) occasions (10) occasions (15.5) occasions (22) occasions (28)
1 Simulation Appendix Validity Concerns with Multiplying Items Defined by Binned Counts: An Application to a Quantity-Frequency Measure of Alcohol Use By James S. McGinley and Patrick J. Curran This appendix
Social Action Day May 8 Horton Bay PURPOSE OF THE UNITED METHODIST WOMEN. The organized unit of United Methodist Women. Shall be a community of women
NORTHERN LIGHT GRAND TRAVERSE DISTRICT UMW March 2018 IMPORTANT DATES OF UPCOMING EVENTS Spring Retreat April 13-14 Lake Louise Social Action Day May 8 Horton Bay Mission Day August 9 Lake City PURPOSE
Allreduce for Parallel Learning. John Langford, Microsoft Resarch, NYC
Allreduce for Parallel Learning John Langford, Microsoft Resarch, NYC May 8, 2017 Applying for a fellowship in 1997 Interviewer: So, what do you want to do? John: I d like to solve AI. I: How? J: I want
CORRELATION FLORIDA DEPARTMENT OF EDUCATION INSTRUCTIONAL MATERIALS CORRELATION COURSE STANDARDS/BENCHMARKS
SUBJECT: Spanish GRADE LEVEL: 9-12 COURSE TITLE: Spanish 1, Novice Low, Novice High COURSE CODE: 708340 SUBMISSION TITLE: Avancemos 2013, Level 1 BID ID: 2774 PUBLISHER: Houghton Mifflin Harcourt PUBLISHER
Daughters of Utah Pioneers Daughters of the Future Keepers of the Past
Daughters of Utah Pioneers Daughters of the Future Keepers of the Past Historian Objective: Perpetuate the names and achievements of the men, women, and children who were the pioneers in founding this
Pearson myworld Geography Western Hemisphere 2011
A Correlation of Pearson Western Hemisphere 2011 Table of Contents Reading Standards for... 3 Writing Standards for... 9 A Correlation of, Reading Standards for Key Ideas and Details RH.6-8.1. Cite specific
Revisiting the Socrates Example
Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
Human Resource Management (HRM) 199 hybrid managers 392
559 Index A activity-based theory 1, 7-9, 31, 47-48 Agency Theory 308, 353, 356, 358, 385 Application Service Providers (ASPs) 328 Architecture Question 190 assets 2, 4-5, 8, 24-25, 38, 42, 45-47, 66-67,
Data Sharing and Synchronization using Dropbox
Data Sharing and Synchronization Data Sharing and Synchronization using Dropbox for LDS Leader Assistant v3 Copyright 2010 LDS Soft Dropbox is either a registered trademark or trademark of Dropbox. 1 STOP
McIntosh, Gary L. Biblical Church Growth: How You Can Work With God to Build a Faithful Church. Baker Book House
Fall 2014 The Florida Extension Course of Study School Florida Southern College 111 Lake Hollingsworth Drive Lakeland, Florida 33801 Year Three COS 313 Mission from God: Evangelism Date: September 26-27
Rationalizing Denominators
Solver9 Rationalizing Denominators Get that pesky radical OUT of my denominator John Reece 7//00 What does Rationalize the Denominator mean? It means to change a fraction, without changing its value, so
Radiomics for Disease Characterization: An Outcome Prediction in Cancer Patients
Radiomics for Disease Characterization: An Outcome Prediction in Cancer Patients Magnuson, S. J., Peter, T. K., and Smith, M. A. Department of Biostatistics University of Iowa July 19, 2018 Magnuson, Peter,
Houghton Mifflin MATHEMATICS
2002 for Mathematics Assessment NUMBER/COMPUTATION Concepts Students will describe properties of, give examples of, and apply to real-world or mathematical situations: MA-E-1.1.1 Whole numbers (0 to 100,000,000),
FIRST EVANGELICAL FREE CHURCH OF MAINE MISSIONS POLICY UPDATED MARCH 2016
I. Purpose A. Definition of Missions 1. First Evangelical Free Church of Maine in Westbrook, Maine affirms the definition of Missions to be any endeavor to fulfill the Great Commission by proclaiming the
It Might Be TodaY. "Rise of the Swedish Cyborgs"
It Might Be TodaY Week-after-week for the past seven years we have presented a Prophecy Update. This is #380 in that series. The Bible is almost 30% prophecy, and most of the Bible's over 2500 prophecies
Distributed Systems. 11. Consensus: Paxos. Paul Krzyzanowski. Rutgers University. Fall 2015
Distributed Systems 11. Consensus: Paxos Paul Krzyzanowski Rutgers University Fall 2015 1 Consensus Goal Allow a group of processes to agree on a result All processes must agree on the same value The value
McDougal Littell High School Math Program. correlated to. Oregon Mathematics Grade-Level Standards
Math Program correlated to Grade-Level ( in regular (non-capitalized) font are eligible for inclusion on Oregon Statewide Assessment) CCG: NUMBERS - Understand numbers, ways of representing numbers, relationships
Key words and phrases: Genesis, equidistant letter sequences, cylindrical representations, statistical analysis.
APPENDIX Statistical Science 1994, Vol. 9, No. 3, 429-438 (abridged) Equidistant Letter Sequences in the Book of Genesis Doron Witztum, Eliyahu Rips and Yoav Rosenberg Abstract. It has been noted that
ARBITRATION AWARD. Panellist: Gail McEwan Case Reference No.: WECT Date of award: 31 January In the arbitration between: and
ARBITRATION AWARD Panellist: Gail McEwan Case Reference No.: WECT10067-14 Date of award: 31 January 2015 In the arbitration between: DAKALO MATEMBEIE Union/Employee party and TOTAL SOUTH AFRICA (PTY) LIMITED
THE SEVENTH-DAY ADVENTIST CHURCH AN ANALYSIS OF STRENGTHS, WEAKNESSES, OPPORTUNITIES, AND THREATS (SWOT) Roger L. Dudley
THE SEVENTH-DAY ADVENTIST CHURCH AN ANALYSIS OF STRENGTHS, WEAKNESSES, OPPORTUNITIES, AND THREATS (SWOT) Roger L. Dudley The Strategic Planning Committee of the General Conference of Seventh-day Adventists
The 2007 Jewish Community Study of the Lehigh Valley. Main Report Volume I: Chapters 1-7
The 2007 Jewish Community Study of the Lehigh Valley Main Report Volume I: Chapters 1-7 Ira M. Sheskin, Ph.D. Director of the Jewish Demography Project of the Sue and Leonard Miller Center for Contemporary
BEFORE THE NORTH CAROLINA MEDICAL BOARD ) ) ) ) ) This matter is before the North Carolina Medical Board
BEFORE THE NORTH CAROLINA MEDICAL BOARD In re: John J. Harris, Jr., M.D., Respondent. INTERIM NON-PRACTICE AGREEMENT This matter is before the North Carolina Medical Board ( Board on information regarding
Tests of Homogeneity and Independence
Tests of Homogeneity and Independence Lecture 52 Sections 14.5 Robb T. Koether Hampden-Sydney College Mon, Apr 26, 2010 Robb T. Koether (Hampden-Sydney College) Tests of Homogeneity and Independence Mon,
HS01: The Grammar of Anaphora: The Study of Anaphora and Ellipsis An Introduction. Winkler /Konietzko WS06/07
HS01: The Grammar of Anaphora: The Study of Anaphora and Ellipsis An Introduction Winkler /Konietzko WS06/07 1 Introduction to English Linguistics Andreas Konietzko SFB Nauklerstr. 35 E-mail: andreaskonietzko@gmx.de
WEST POTOMAC HIGH SCHOOL HONOR CODE
WEST POTOMAC HIGH SCHOOL HONOR CODE Statement of Wolverine Pride I am entrusted with the responsibility of upholding and contributing to an atmosphere of mutual respect, honesty, and fairness. My personal
Network-based. Visual Analysis of Tabular Data. Zhicheng Liu, Shamkant Navathe, John Stasko
Network-based Visual Analysis of Tabular Data Zhicheng Liu, Shamkant Navathe, John Stasko Tabular Data 2 Tabular Data Rows and columns Rows are data cases; columns are attributes/dimensions Attribute types
PHIL 155: The Scientific Method, Part 1: Naïve Inductivism. January 14, 2013
PHIL 155: The Scientific Method, Part 1: Naïve Inductivism January 14, 2013 Outline 1 Science in Action: An Example 2 Naïve Inductivism 3 Hempel s Model of Scientific Investigation Semmelweis Investigations
Parish of Christ the King
Empowering Churches with Solutions to Simplify Complex Diocesan and Parish Church Management ParishSOFT Customer Success Story: Parish of Christ the King The Diocese of Tulsa Christ the King of Tulsa,
Lesson 07 Notes. Machine Learning. Quiz: Computational Learning Theory
Machine Learning Lesson 07 Notes Quiz: Computational Learning Theory M: Hey, Charles. C: Oh, hi Michael. M: It's funny running into to you here. C: It is. It's always funny running in to you over the interwebs.
The Manual. Ordering of Ministry
The Manual for the Ordering of Ministry 2011 Edition Christian Church (Disciples of Christ) in West Virginia 1402 Washington Avenue Parkersburg, WV 26101 CONTENTS Procedures for Discernment, Commissioning,
CTK Evangelization Ministry
CTK Evangelization Ministry Go, therefore, and make disciples of all nations, baptizing them in the name of the father, and of the son, and of the holy spirit. Matthew 28:19 The Church which goes forth
Education New Zealand and The Energy and Resources Institute present. New Zealand India Sustainability Challenge. Terms and Conditions for Entrants
Education New Zealand and The Energy and Resources Institute present New Zealand India Sustainability Challenge Terms and Conditions for Entrants Education New Zealand ( ENZ ) in association with The Energy
MAIN BUILDING C
MAIN BUILDING C1-065 writingcentre@ul.ie www.ul.ie/rwc Writing Centre Resources One-to-One Peer Tutoring Writers Groups Workshops and Seminars Online Resources Writers Space RWC Events UL s One Campus
FARMS Review 19/2 (2007): (print), (online)
Title Author(s) Reference ISSN Abstract In the Forecast: Global Christianity Alive and Well Ted Lyon FARMS Review 19/2 (2007): 89 93. 1550-3194 (print), 2156-8049 (online) Review of The Next Christendom:
Principles of Distributed Computing. Burcu Canakci. Lorenzo Alvisi Cornell University. Natacha Crooks. Cong Ding
Principles of Distributed Computing Burcu Canakci Lorenzo Alvisi Cornell University Natacha Crooks Cong Ding Matthew Li Youer Pu A first course in Distributed Computing... A distributed system is one in
Externally Set Task Handbook 2018 / / /01/17
Externally Set Task Handbook 2018 / /2016 27/01/17 School Curriculum and Standards Authority, 2018 This document apart from any third party copyright material contained in it may be freely copied, or communicated
INTRODUCTION TO HYPOTHESIS TESTING. Unit 4A - Statistical Inference Part 1
1 INTRODUCTION TO HYPOTHESIS TESTING Unit 4A - Statistical Inference Part 1 Now we will begin our discussion of hypothesis testing. This is a complex topic which we will be working with for the rest of
Mark V. Shaney. Comp 140
The curious case of Mark V. Shaney Comp 140 Fall 2008 Who is Mark V. Shaney? Mark was a member of a UseNet News group called net.singles, a users group chock full of dating tips, lonely l heart chatter,
Knowability as Learning
Knowability as Learning The aim of this paper is to revisit Fitch's Paradox of Knowability in order to challenge an assumption implicit in the literature, namely, that the key formal sentences in the proof
How to organize a. in 6 steps
How to organize a in 6 steps Café Humaniste is an event series by the IHEU, bringing people together to discuss questions of interest and concern to humanists, wherever they re from. The events are organized
LIFE THROUGH DEATH Because it s intellectual property
1. LIFE THROUGH DEATH 2017 Because it s intellectual property 2. BLACK SCREEN: (V.O.) We stand on the precipice... In this adventure, the precipice on which... no... we stand together... INT. GYMNASIUM
Stum & Laws Differential Detectives Franklin & Marshall College Lancaster, PA 17604
Stum & Laws Differential Detectives Franklin & Marshall College Lancaster, PA 17604 Matilda Majestica Search Us Circus 3 Ring Boulevard Barnum, PU 54321 Dear Matilda, Thank you for contacting us about
Christians Say They Do Best At Relationships, Worst In Bible Knowledge
June 14, 2005 Christians Say They Do Best At Relationships, Worst In Bible Knowledge (Ventura, CA) - Nine out of ten adults contend that their faith is very important in their life, and three out of every