Basic Algorithms Overview
|
|
- Cory Barker
- 5 years ago
- Views:
Transcription
1 Basic Algorithms Overview Algorithms Search algorithm Sort algorithm Induction proofs Complexity 21 December 2005 Ariel Shamir 1 Conceptual Hierarchy Algorithm/Model Program Code Today s lecture Compilers etc. Operating System Execution Cycle Hardware 21 December 2005 Ariel Shamir 2 1
2 Algorithms the How An algorithm is a procedure for executing a given task. An algorithm consist of a list of instructions. Inputs Algorithm Outputs 21 December 2005 Ariel Shamir 3 Algorithms in CS Is there an algorithm for every task? How can we know if an algorithm is correct? What is the time/space complexity? What is the best algorithm for a given task? What is the best way to express an algorithm? 21 December 2005 Ariel Shamir 4 2
3 Pseudo Code Computer algorithms are usually written in pseudo-code. Pseudo-code is code that is easy to understand and yet is easily transformed into programming language. 21 December 2005 Ariel Shamir 5 Search Algorithms Search algorithms are algorithms that search for a specific element in a given group of elements: Minimum Maximum Specific value We will use arrays as data structure to store elements. 21 December 2005 Ariel Shamir 6 3
4 Finding Minimum The minimum is the smallest element in a given group of elements. Groups can be represented in different data structures. The basic idea of the algorithm is the same for all data structures. We had in the first lecture an algorithm for finding minimum. Let s s revisit it 21 December 2005 Ariel Shamir 7 The Basic Idea Algorithm to find a minimum in a group of elements A: assign temporary_min the value of first element for each element a in A if a is smaller than temporary_min then assign temporary_min the value of a min(a) will be temporary_min 21 December 2005 Ariel Shamir 8 4
5 Java Code int min(int A[]) { int temporary_min = A[0]; for(int i=1; i<a.length; i++) if (A[i] < temporary_min) temporary_min =A[i]; return temporary_min; } 21 December 2005 Ariel Shamir 9 Finding Minimum December 2005 Ariel Shamir 10 5
6 temporary _min=23 21 December 2005 Ariel Shamir 11 i= temporary _min=23 21 December 2005 Ariel Shamir 12 6
7 i= temporary _min=5 21 December 2005 Ariel Shamir 13 i= temporary _min=5 21 December 2005 Ariel Shamir 14 7
8 i= temporary _min=5 21 December 2005 Ariel Shamir 15 i= temporary _min=2 21 December 2005 Ariel Shamir 16 8
9 temporary _min=2 21 December 2005 Ariel Shamir 17 Finding Maximum The only difference is in the sign: int max(int A[]) { int temporary_max = A[0]; for(int i=1; i<a.length; i++) if (A[i] > temporary_max) temporary_max =A[i]; return temporary_max; } 21 December 2005 Ariel Shamir 18 9
10 How Long Does It Take? If we have N elements? Around N operations (must test all of them at least once!). Can we do better? On specific cases only with assumptions: the elements are within a given range 0..K. 21 December 2005 Ariel Shamir 19 Searching for Specific Value We can search for the specific value. The type of the result can be: Boolean found or not found. Integer place of the element in set (in our case index in array). The search is also done in linear way. We walk through our data and search for a given element. 21 December 2005 Ariel Shamir 20 10
11 Element Searching Implementation public class Sarray { public static boolean search(int a[], int value) { int i=0; while( i<a.length && a[i]!=value){ i++; } return (i < a.length); } } 21 December 2005 Ariel Shamir 21 Sort Algorithms Sorting a group of elements means ordering them according to some linear order. For numbers we can use < order. There are numerous sort algorithms. We will talk about several: Selection sort (( find minimum element). Insertion sort. Bubble sort & Merge sort. 21 December 2005 Ariel Shamir 22 11
12 Sort Algorithms Input and Output The input for the algorithm: Unordered group of n elements (possible representation is an array). The output: Ordered group of elements. 21 December 2005 Ariel Shamir 23 Selection Sort Outline Find the smallest element in a group of elements and exchange it with first one. Find the second smallest element and exchange it with the second one In the j-th iteration of the algorithm we find the j-th smallest element in a group of elements and exchange it with the j-th one. 21 December 2005 Ariel Shamir 24 12
13 Selection Sort December 2005 Ariel Shamir Find Minimum 21 December 2005 Ariel Shamir 26 13
14 Find Minimum 21 December 2005 Ariel Shamir 27 Replace December 2005 Ariel Shamir 28 14
15 Replace December 2005 Ariel Shamir Find Minimum 21 December 2005 Ariel Shamir 30 15
16 Find Minimum 21 December 2005 Ariel Shamir 31 Replace December 2005 Ariel Shamir 32 16
17 Replace December 2005 Ariel Shamir Find Minimum 21 December 2005 Ariel Shamir 34 17
18 Find Minimum 21 December 2005 Ariel Shamir 35 Replace December 2005 Ariel Shamir 36 18
19 Replace December 2005 Ariel Shamir December 2005 Ariel Shamir 38 19
20 December 2005 Ariel Shamir December 2005 Ariel Shamir 40 20
21 December 2005 Ariel Shamir December 2005 Ariel Shamir 42 21
22 December 2005 Ariel Shamir December 2005 Ariel Shamir 44 22
23 December 2005 Ariel Shamir 45 The End! December 2005 Ariel Shamir 46 23
24 Selection Sort Code public static void selectionsort(int[] array) { int minindex; for(int j=0; j<array.length-1; j++) { // find j-th minimum element minindex = j; for(int k=j+1; k<array.length; k++) if(array[k]<array[minindex]) minindex=k; // exchange with j-th place element int temp = array[j]; array[j] = array[minindex]; array[minindex] = temp; } } 21 December 2005 Ariel Shamir 47 Find Minimum public static void selectionsort(int[] array) { int minindex; for(int j=0; j<array.length-1; j++) { // find j-th minimum element minindex = j; for(int k=j+1; k<array.length; k++) if(array[k]<array[minindex]) minindex=k; // exchange with j-th place element int temp = array[j]; array[j] = array[minindex]; array[minindex] = temp; } } 21 December 2005 Ariel Shamir 48 24
25 Replace public static void selectionsort(int[] array) { int minindex; for(int j=0; j<array.length-1; j++) { // find j-th minimum element minindex = j; for(int k=j+1; k<array.length; k++) if(array[k]<array[minindex]) minindex=k; // exchange with j-th place element int temp = array[j]; array[j] = array[minindex]; array[minindex] = temp; } } 21 December 2005 Ariel Shamir 49 Do This N times public static void selectionsort(int[] array) { int minindex; for(int j=0; j<array.length-1; j++) { // find j-th minimum element minindex = j; for(int k=j+1; k<array.length; k++) if(array[k]<array[minindex]) minindex=k; // exchange with j-th place element int temp = array[j]; array[j] = array[minindex]; array[minindex] = temp; } } 21 December 2005 Ariel Shamir 50 25
26 Induction Proof by induction on a set created by a creation rule {S 0, S k S k+1 }: Induction base - check that the claim is true in the basic situation, S0. Induction rule assume it is true in S k and check that the claim does not change under the update rule (or rules): S k S k December 2005 Ariel Shamir 51 Simple Induction Proof by induction on natural numbers: Induction base - check that the claim is true in the basic situation (for example for 0). Assumption assume the claim is true for k (or for all i <= k). Need to prove the assumption is true for k+1. Why it works? The telescope rule. 21 December 2005 Ariel Shamir 52 26
27 Example: Sum of n Numbers Proof n +n = n(n+1)/2 Base: 1 = 1*2/2 true! Assumption: k +k = k(k+1)/2 Need to prove: (k+1) +(k+1) = (k+1)(k+2)/2 Proof: k+(k+1) +k+(k+1) = k(k+1)/2 +(k+1) = (k(k+1)+2(k+1))/2 = (k+1)(k+2)/2! 21 December 2005 Ariel Shamir 53 Selection Sort Proof Lemma: after j passes, the j lowest elements occupy the first j places in the group and are stored in sorted order. Outcome: After n-1 n 1 passes the group is sorted! 21 December 2005 Ariel Shamir 54 27
28 Selection Sort Lemma Induction We have an iteration therefore the base case (S 0 ) is j=1. The update rule S k S k+1 is just another iteration. We assume the lemma is true for j=k (for all j <= k), and we prove it remains true after the k+1 iteration. 21 December 2005 Ariel Shamir 55 Proof by Induction (1) Lemma: after j passes, the j lowest elements occupy the first j places in the group and are stored in sorted order. Base (j=1): after 1 passes, the 1 lowest elements occupy the first 1 places in the group and are stored in sorted order. Assumption: assume after k passes, the k lowest elements occupy the first k places in the group and are stored in sorted order. 21 December 2005 Ariel Shamir 56 28
29 Proof by Induction (2) Need to prove: after k+1 passes, the k+1 lowest elements occupy the first k+1 places in the group and are stored in sorted order. Proof: in the k+1 iteration we find the smallest element in the remaining N-k N k group and put it in the k+1 place (How do we know its not smaller than the k first elements? assume otherwise). Therefore we get what we want after the K+1 iteration! 21 December 2005 Ariel Shamir 57 Insertion Sort The second sorting method will insert on the j-th pass the j-th element into its rightful place in a subgroup of j-1 j 1 elements that has already been sorted. After n-1 n 1 passes a group is sorted. 21 December 2005 Ariel Shamir 58 29
30 Inserting a Value to a Sorted List 1. Search for the correct place Linear search? Binary search? Key December 2005 Ariel Shamir 59 Inserting the Key 2. Insert the key Key December 2005 Ariel Shamir 60 30
31 Inserting to an Array Search can be done in binary search but the insertion to an array must move all elements forward. Therefore, we insert just by gradually moving the element to its place from the top. 21 December 2005 Ariel Shamir 61 Insertion to a Sorted Array December 2005 Ariel Shamir 62 31
32 Insertion Sort December 2005 Ariel Shamir 63 Key December 2005 Ariel Shamir 64 32
33 Insert to sorted December 2005 Ariel Shamir 65 Key December 2005 Ariel Shamir 66 33
34 Insert to sorted December 2005 Ariel Shamir 67 Key December 2005 Ariel Shamir 68 34
35 Insert to sorted December 2005 Ariel Shamir 69 Key December 2005 Ariel Shamir 70 35
36 Insert to sorted December 2005 Ariel Shamir 71 Key December 2005 Ariel Shamir 72 36
37 Insert to sorted December 2005 Ariel Shamir 73 Key December 2005 Ariel Shamir 74 37
38 Insert to sorted December 2005 Ariel Shamir 75 Key December 2005 Ariel Shamir 76 38
39 Insert to sorted December 2005 Ariel Shamir 77 Sorted! December 2005 Ariel Shamir 78 39
40 Insertion Sort Code public static void insertionsort(int[] array) { for(int j=1; j<array.length; j++) { int key = array[j]; int k=j-1; // insert key to its right place while( k>=0 && array[k]>key) { array[k+1] = array[k]; k--; } array[k+1]=key; } } 21 December 2005 Ariel Shamir 79 Bubble Sort The idea is to bubble-up the largest values by swapping adjacent pairs. After j loops the j topmost values are the largest values and sorted! 21 December 2005 Ariel Shamir 80 40
41 Bubble Sort Pseudo- Code For all indices i from 0 to N-1 For all indices j from 1 to N-1-i If A[j-1] > A[j] Swap A[j] and A[j-1] 21 December 2005 Ariel Shamir 81 Bubble Sort December 2005 Ariel Shamir 82 41
42 December 2005 Ariel Shamir December 2005 Ariel Shamir 84 42
43 December 2005 Ariel Shamir December 2005 Ariel Shamir 86 43
44 December 2005 Ariel Shamir December 2005 Ariel Shamir 88 44
45 December 2005 Ariel Shamir December 2005 Ariel Shamir 90 45
46 December 2005 Ariel Shamir December 2005 Ariel Shamir 92 46
47 December 2005 Ariel Shamir December 2005 Ariel Shamir 94 47
48 December 2005 Ariel Shamir December 2005 Ariel Shamir 96 48
49 December 2005 Ariel Shamir December 2005 Ariel Shamir 98 49
50 December 2005 Ariel Shamir December 2005 Ariel Shamir
51 December 2005 Ariel Shamir December 2005 Ariel Shamir
52 December 2005 Ariel Shamir December 2005 Ariel Shamir
53 December 2005 Ariel Shamir December 2005 Ariel Shamir
54 December 2005 Ariel Shamir December 2005 Ariel Shamir
55 December 2005 Ariel Shamir December 2005 Ariel Shamir
56 December 2005 Ariel Shamir December 2005 Ariel Shamir
57 December 2005 Ariel Shamir 113 Complexity The efficiency of the algorithm is called it s s complexity. Complexity = Cost in time and space (memory). Usually complexity is computed as a function of the size of the input (why?). 21 December 2005 Ariel Shamir
58 Selection Sort Loops public static void selectionsort(int[] array) { int min,temp; for(int j=0; j<array.length-1; j++) { min=j; // find j-th minimum element for(int k=j+1; k<array.length; k++) if(array[k]<array[min]) min=k; // exchange with j-th place element temp=array[j]; array[j]=array[min]; array[min]=temp; } } 21 December 2005 Ariel Shamir 115 Counting Loops j N-2 N-1 k 1..N 2..N 3..N (N-1)..N (N-1)..N # N-1 N-2 N (N-2)+(N-1) (N-2)+(N-1) = (N*(N-1))/2 =~ N 2 21 December 2005 Ariel Shamir
59 An Order of N 2 Check for Primes int numprimes = 0; for (int n = 2; n < number; n++) { isprime = true; for (int j = 2; j < n; j++) if (i % n == 0) isprime = false; } if No. (isprime) of Loops: 1+2+ (N (N-2)+(N-1) numprimes++; } 21 December 2005 Ariel Shamir 117 Counting Primes Running Times (ver. 1) Input size T N i /N 0 10K 2.5s 1 20K 10s 2 30K 22.5s 3 40K 40s 4 T i /T F(n) = n 2 is Quadratic Growth 21 December 2005 Ariel Shamir
60 An Order of NN Check for Primes int numprimes = 0; for (int n = 2; n < number; n++) { isprime = true; int largestdivisor = (int)math.sqrt (n); for (int j = 2; j < largestdivisor; j++) if (i % n == 0) isprime = false; } if (isprime) numprimes++; } 21 December 2005 Ariel Shamir 119 Number of Loops (N-2)+ (N-1) < (N-1) + (N-1) (N-1) = (N-1) 1)(N-1) < NNN 21 December 2005 Ariel Shamir
61 Counting Primes Running Times (ver. 2) Input size T N i /N 0 10K 1.1s 1 20K 3.1s 2 30K 5.6s 3 40K 8.6s 4 T i /T F(n) = nn is Sub-Quadratic Growth 21 December 2005 Ariel Shamir 121 Insertion Sort Loops public static void insertionsort(int[] array) { for(int j=1; j<array.length; j++) { int key= array[j]; int k=j-1; // shift to right values larger then key while( k>0 and array[k]>key) { array[k+1] = array[k]; k--; } array[k+1]=key; } } 21 December 2005 Ariel Shamir
62 Sorting Complexity In our examples all algorithms have the same complexity. If the size of input is N elements all algorithms in worse case require around N 2 steps not the most efficient. There are N*log(N) algorithms which is also proven to be the best possible. 21 December 2005 Ariel Shamir 123 Merge Sort public static void mergesort (int[] a) { sort(a,0,a.length-1); } private static void sort( int a[], int low, int high) { if (low >= high ) return; int med = (low + high)/2; sort(a, low, med); sort(a, med+1, high); merge(a, low, med, high); } 21 December 2005 Ariel Shamir
63 Merge Method private static merge( int[] a, int low, int med, int high) { int[] temp = new int [high-low + 1]; i = 0 ; j = low ; k = med + 1; while (i < temp.length) { if (k > high a[j] < a[k]) temp[i++] = a[j++]; else temp[i++] = a[k++]; } for (int i = 0; i < temp.length ; i++) a[low + i] = temp[i]; } 21 December 2005 Ariel Shamir
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
More informationHeap 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
More informationCOS 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
More informationRecursive 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
More informationLazy Functional Programming for a survey
Lazy Functional Programming for a survey Norman Ramsey Tufts November 2012 Book: Programming languages for practitioners Why? For people who will write code Gives future practitioners something to do I
More informationPredictive Coding. CSE 390 Introduction to Data Compression Fall Entropy. Bad and Good Prediction. Which Context to Use? PPM
Predictive Coding CSE 390 Introduction to Data Compression Fall 2004 Predictive Coding (PPM, JBIG, Differencing, Move-To-Front) Burrows-Wheeler Transform (bzip2) The next symbol can be statistically predicted
More informationDigital Logic Lecture 5 Boolean Algebra and Logic Gates Part I
Digital Logic Lecture 5 Boolean Algebra and Logic Gates Part I By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. Boolean variables and truth tables. Fundamental
More information9/7/2017. CS535 Big Data Fall 2017 Colorado State University Week 3 - B. FAQs. This material is built based on
S535 ig ata Fall 7 olorado State University 9/7/7 Week 3-9/5/7 S535 ig ata - Fall 7 Week 3-- S535 IG T FQs Programming ssignment We discuss link analysis in this week Installation/configuration guidelines
More informationArtificial Intelligence: Valid Arguments and Proof Systems. Prof. Deepak Khemani. Department of Computer Science and Engineering
Artificial Intelligence: Valid Arguments and Proof Systems Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 02 Lecture - 03 So in the last
More informationDeep Neural Networks [GBC] Chap. 6, 7, 8. CS 486/686 University of Waterloo Lecture 18: June 28, 2017
Deep Neural Networks [GBC] Chap. 6, 7, 8 CS 486/686 University of Waterloo Lecture 18: June 28, 2017 Outline Deep Neural Networks Gradient Vanishing Rectified linear units Overfitting Dropout Breakthroughs
More informationQuorums. 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
More informationAllreduce 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
More informationMcDougal 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
More informationOutline. Uninformed Search. Problem-solving by searching. Requirements for searching. Problem-solving by searching Uninformed search techniques
Outline Uninformed Search Problem-solving by searching Uninformed search techniques Russell & Norvig, chapter 3 ECE457 Applied Artificial Intelligence Fall 2007 Lecture #2 ECE457 Applied Artificial Intelligence
More informationNPTEL NPTEL ONINE CERTIFICATION COURSE. Introduction to Machine Learning. Lecture-59 Ensemble Methods- Bagging,Committee Machines and Stacking
NPTEL NPTEL ONINE CERTIFICATION COURSE Introduction to Machine Learning Lecture-59 Ensemble Methods- Bagging,Committee Machines and Stacking Prof. Balaraman Ravindran Computer Science and Engineering Indian
More informationArtificial 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
More information2. THE CHURCH MINISTRIES POLICY PROPOSAL
2. THE CHURCH MINISTRIES POLICY PROPOSAL CONTENTS: PAWI s Vision and Mission 2 Overview 3 Introduction to Ch. Ministries 5 Ch. Ministries Vision/Mission 7 Ch. Ministries Structure 8 Organogram - General
More informationSemantic Entailment and Natural Deduction
Semantic Entailment and Natural Deduction Alice Gao Lecture 6, September 26, 2017 Entailment 1/55 Learning goals Semantic entailment Define semantic entailment. Explain subtleties of semantic entailment.
More informationP.A.W.I. CHURCH MINISTRIES MANUAL
P.A.W.I. CHURCH CONTENTS PAWI Vision and Mission 2 Overview 3 Introduction to Ch. Ministries 5 Ch. Ministries Vision/Mission 7 Ch. Ministries Structure 8 Organigram- General 10 Organigram- District 11
More informationECE 5424: Introduction to Machine Learning
ECE 5424: Introduction to Machine Learning Topics: (Finish) Model selection Error decomposition Bias-Variance Tradeoff Classification: Naïve Bayes Readings: Barber 17.1, 17.2, 10.1-10.3 Stefan Lee Virginia
More informationON SOPHIE GERMAIN PRIMES
Journal for Algebra and Number Theory Academia Volume 6, Issue 1, August 016, ages 37-41 016 Mili ublications ON SOHIE GERMAIN RIMES 117 Arlozorov street Tel Aviv 609814, Israel Abstract A Sophie Germain
More informationSmith 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
More informationBalancing 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
More informationDISCS PRO 2018 Reflections
char author[] = ""; char date[] = "Mon Feb 19 12:40:27 2018"; This is a bit late, and I initially planned not to write reflections for this. But it s good to have everything on paper. The discs is the
More informationINTERMEDIATE LOGIC Glossary of key terms
1 GLOSSARY INTERMEDIATE LOGIC BY JAMES B. NANCE INTERMEDIATE LOGIC Glossary of key terms This glossary includes terms that are defined in the text in the lesson and on the page noted. It does not include
More informationIntel x86 Jump Instructions. Part 5. JMP address. Operations: Program Flow Control. Operations: Program Flow Control.
Part 5 Intel x86 Jump Instructions Control Logic Fly over code Operations: Program Flow Control Operations: Program Flow Control Unlike high-level languages, processors don't have fancy expressions or
More informationLesson 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.
More informationThe 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
More informationEpistemic Game Theory
Epistemic Game Theory In everyday life we must often reach decisions while knowing that the outcome will not only depend on our own choice, but also on the choices of others. These situations are the focus
More informationA Scientific Model Explains Spirituality and Nonduality
A Scientific Model Explains Spirituality and Nonduality Frank Heile, Ph.D. Physics degrees from Stanford and MIT frank@spiritualityexplained.com www.spiritualityexplained.com Science and Nonduality Conference
More informationComputational Learning Theory: Agnostic Learning
Computational Learning Theory: Agnostic Learning Machine Learning Fall 2018 Slides based on material from Dan Roth, Avrim Blum, Tom Mitchell and others 1 This lecture: Computational Learning Theory The
More informationFUZZY EXPERT SYSTEM IN DETERMINING HADITH 1 VALIDITY. 1. Introduction
1 FUZZY EXPERT SYSTEM IN DETERMINING HADITH 1 VALIDITY M.H.Zahedi, M.Kahani and B.Minaei Faculty of Engineering Mashad Ferdowsi University Mashad, Iran ha_za71@stu-mail.um.ac.ir, kahani@ferdowsi.um.ac.ir
More informationThe Development of Knowledge and Claims of Truth in the Autobiography In Code. When preparing her project to enter the Esat Young Scientist
Katie Morrison 3/18/11 TEAC 949 The Development of Knowledge and Claims of Truth in the Autobiography In Code Sarah Flannery had the rare experience in this era of producing new mathematical research at
More informationOutline. 1 Review. 2 Formal Rules for. 3 Using Subproofs. 4 Proof Strategies. 5 Conclusion. 1 To prove that P is false, show that a contradiction
Outline Formal roofs and Boolean Logic II Extending F with Rules for William Starr 092911 1 Review 2 Formal Rules for 3 Using Subproofs 4 roof Strategies 5 Conclusion William Starr hil 2310: Intro Logic
More informationAn Efficient Indexing Approach to Find Quranic Symbols in Large Texts
Indian Journal of Science and Technology, Vol 7(10), 1643 1649, October 2014 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 An Efficient Indexing Approach to Find Quranic Symbols in Large Texts Vahid
More informationHow to secure the keyboard chain
How to secure the keyboard chain DEF CON 23 Paul Amicelli - Baptiste David - CVO Esiea-Ouest c Creative Commons 2.0 - b Attribution - n NonCommercial - a ShareAlike 1 / 25 The Talk 1. Background 2. Keyloggers
More informationSocial Services Estimating Conference: Impact of Patient Protection and Affordable Care Act
Social Services Estimating Conference: Impact of Patient Protection and Affordable Care Act February 18, 2013 Presented by: The Florida Legislature Office of Economic and Demographic Research 850.487.1402
More informationIntroduction 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
More informationMinimal and Maximal Models in Reinforcement Learning
Minimal and Maximal Models in Reinforcement Learning Dimiter Dobrev Institute of Mathematics and Informatics Bulgarian Academy of Sciences d@dobrev.com Each test gives us one property which we will denote
More informationRadiomics 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,
More informationMITOCW watch?v=4hrhg4euimo
MITOCW watch?v=4hrhg4euimo The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high-quality educational resources for free. To
More informationDeveloping a Stewardship Committee
Stewardship Committee Overview The Stewardship process encourages parishioners to identify their gifts, to be grateful for these gifts, to cultivate and use them responsibly, to share them lovingly in
More information6. Truth and Possible Worlds
6. Truth and Possible Worlds We have defined logical entailment, consistency, and the connectives,,, all in terms of belief. In view of the close connection between belief and truth, described in the first
More informationMacro Plan
College Macro Plan 2018-2019 Subject: Computer Science Teacher: M.Sheeraz Iqbal Class / Sections: XII- BrookBond We ek Event From To Saturday Status Working Days Teaching Days Chapters Content Term-I 57-Working
More informationFunctionalism and the Chinese Room. Minds as Programs
Functionalism and the Chinese Room Minds as Programs Three Topics Motivating Functionalism The Chinese Room Example Extracting an Argument Motivating Functionalism Born of failure, to wit the failures
More informationTHE BELIEF IN GOD AND IMMORTALITY A Psychological, Anthropological and Statistical Study
1 THE BELIEF IN GOD AND IMMORTALITY A Psychological, Anthropological and Statistical Study BY JAMES H. LEUBA Professor of Psychology and Pedagogy in Bryn Mawr College Author of "A Psychological Study of
More informationHoughton 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),
More informationTorah 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
More informationSurveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur. Module - 7 Lecture - 3 Levelling and Contouring
Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur Module - 7 Lecture - 3 Levelling and Contouring (Refer Slide Time: 00:21) Welcome to this lecture series
More informationSQL: A Language for Database Applications
SQL: A Language for Database Applications P.J. McBrien Imperial College London P.J. McBrien (Imperial College London) SQL: A Language for Database Applications 1 / 42 Extensions to RA select, project and
More informationFeasibility study. Christ the king parish for Christ the king school Madisonville, Kentucky
Feasibility study Christ the king parish for Christ the king school Madisonville, Kentucky March 13, 2018 0 Christ the King Parish Feasibility Study Specific for Christ the King School Christ the King
More informationA Linear Programming Approach to Complex Games: An Application to Nuclear Exchange Models
INSTITUTE FOR DEFENSE ANALYSES A Linear Programming Approach to Complex Games: An Application to Nuclear Exchange Models I. C. Oelrich, Project Leader August 2002 Approved for public release; distribution
More informationConditionalization Does Not (in general) Maximize Expected Accuracy
1 Conditionalization Does Not (in general) Maximize Expected Accuracy Abstract: Greaves and Wallace argue that conditionalization maximizes expected accuracy. In this paper I show that their result only
More informationBounded Rationality. Gerhard Riener. Department of Economics University of Mannheim. WiSe2014
Bounded Rationality Gerhard Riener Department of Economics University of Mannheim WiSe2014 Gerhard Riener (University of Mannheim) Bounded Rationality WiSe2014 1 / 18 Bounded Rationality We have seen in
More informationGrade 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
More informationArtificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras
(Refer Slide Time: 00:14) Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 35 Goal Stack Planning Sussman's Anomaly
More informationAgnostic 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
More informationNegative Introspection Is Mysterious
Negative Introspection Is Mysterious Abstract. The paper provides a short argument that negative introspection cannot be algorithmic. This result with respect to a principle of belief fits to what we know
More informationTouch 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
More informationGeorgia Quality Core Curriculum
correlated to the Grade 8 Georgia Quality Core Curriculum McDougal Littell 3/2000 Objective (Cite Numbers) M.8.1 Component Strand/Course Content Standard All Strands: Problem Solving; Algebra; Computation
More informationA Quick Review of the Scientific Method Transcript
Screen 1: Marketing Research is based on the Scientific Method. A quick review of the Scientific Method, therefore, is in order. Text based slide. Time Code: 0:00 A Quick Review of the Scientific Method
More informationVerification and Validation
2012-2013 Verification and Validation Part III : Proof-based Verification Burkhart Wolff Département Informatique Université Paris-Sud / Orsay " Now, can we build a Logic for Programs??? 05/11/14 B. Wolff
More informationTÜ Information Retrieval
TÜ Information Retrieval Übung 2 Heike Adel, Sascha Rothe Center for Information and Language Processing, University of Munich May 8, 2014 1 / 17 Problem 1 Assume that machines in MapReduce have 100GB
More informationTuen Mun Ling Liang Church
NCD insights Quality Characteristic ti Analysis & Trends for the Natural Church Development Journey of Tuen Mun Ling Liang Church January-213 Pastor for 27 years: Mok Hing Wan "Service attendance" "Our
More informationThe Pigeonhole Principle
The Pigeonhole Principle Lecture 45 Section 9.4 Robb T. Koether Hampden-Sydney College Mon, Apr 16, 2014 Robb T. Koether (Hampden-Sydney College) The Pigeonhole Principle Mon, Apr 16, 2014 1 / 23 1 The
More informationSample Simplified Structure (BOD 274.2) Leadership Council Monthly Agenda
So, you have downsized your church administrative board and simplified your congregation s leadership structure. More leaders are now moving from leading meetings to leading ministries. You might think
More informationConfraternity of Christian
Confraternity of Christian Doctrine Parish Handbook Revised Edition 2007 Recruitment Strategies for Your Parish Volume 3 Published by: Confraternity of Christian Doctrine (Archdiocese of Sydney) Level
More information1 Introduction. Cambridge University Press Epistemic Game Theory: Reasoning and Choice Andrés Perea Excerpt More information
1 Introduction One thing I learned from Pop was to try to think as people around you think. And on that basis, anything s possible. Al Pacino alias Michael Corleone in The Godfather Part II What is this
More information(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
More informationWoodin on The Realm of the Infinite
Woodin on The Realm of the Infinite Peter Koellner The paper The Realm of the Infinite is a tapestry of argumentation that weaves together the argumentation in the papers The Tower of Hanoi, The Continuum
More informationTerri O Fallon. each seems to have a particular emphasis on what they see as non- dual.
The Three Pillars of Awakening By Terri O Fallon Abstract: Ken Wilber expounds on five major traditions focus on ridding oneself of illusion, which prevents one from awakening. This paper summarizes these
More informationProof Burdens and Standards
Proof Burdens and Standards Thomas F. Gordon and Douglas Walton 1 Introduction This chapter explains the role of proof burdens and standards in argumentation, illustrates them using legal procedures, and
More information2.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
More informationStrategies for a Successful Bishop s Appeal
Strategies for a Successful Bishop s Appeal www.catholicfoundationgb.org 920-272-8197 BishopsAppeal@gbdioc.org Putting the Pieces in Place For a successful campaign, the Pastor needs some help and there
More informationTips for Using Logos Bible Software Version 3
Tips for Using Logos Bible Software Version 3 Revised January 14, 2010 Note: These instructions are for the Logos for Windows version 3, but the general principles apply to Logos for Macintosh version
More informationCorporate Team Training Session # 2 May 30 / June 1
5 th Annual Great Corporate Debate Corporate Team Training Session # 2 May 30 / June 1 Stephen Buchanan Education Consulting Outline of Session # 2 Great Corporate Debate Review Contest, Rules, Judges
More informationREQUIRED DOCUMENT FROM HIRING UNIT
Terms of reference GENERAL INFORMATION Title: Consultant for Writing on the Proposal of Zakat Trust Fund (International Consultant) Project Name: Social and Islamic Finance Reports to: Deputy Country Director,
More informationHamilton s and Jefferson s Methods
Hamilton s and Jefferson s Methods Lecture 15 Sections 4.2-4.3 Robb T. Koether Hampden-Sydney College Mon, Feb 23, 2015 Robb T. Koether (Hampden-Sydney College) Hamilton s and Jefferson s Methods Mon,
More informationCAN TWO ENVELOPES SHAKE THE FOUNDATIONS OF DECISION- THEORY?
1 CAN TWO ENVELOPES SHAKE THE FOUNDATIONS OF DECISION- THEORY? * Olav Gjelsvik, University of Oslo. The aim of this paper is to diagnose the so-called two envelopes paradox. Many writers have claimed that
More informationEducation in Emergencies Coordination Group
Education in Emergencies Coordination Group Meeting minutes - Yangon 9 April Date: 9 April Venue: Save the Children Office, Yangon Time: 15:00 17:30 Chaired by: Arlo Kitchingman EiE Agenda KACHIN (15:00
More informationSQL: An Implementation of the Relational Algebra
: An Implementation of the Relational Algebra P.J. McBrien Imperial College London P.J. McBrien (Imperial College London) SQL: An Implementation of the Relational Algebra 1 / 40 SQL Relation Model and
More informationApplying Data Mining to Field Quality Watchdog Task
Applying Data Mining to Field Quality Watchdog Task Satoshi HORI, Member (Institute of Technologists), Hirokazu TAKI, Member (Wakayama University), Takashi WASHIO, Non-member, Motoda Hiroshi, Non-member
More informationThis 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
More information(add 'PHIL 3400' to subject line) Course Webpages: Moodle login page
Date prepared: 6/3/16 Syllabus University of New Orleans Dept. of Philosophy (3 credits) SECTIONS 476 & 585 Contact Information Instructor: Dr. Robert Stufflebeam Office: UNO: LA 385 Office Hours: M-T-W-Th,
More informationMITOCW ocw f99-lec19_300k
MITOCW ocw-18.06-f99-lec19_300k OK, this is the second lecture on determinants. There are only three. With determinants it's a fascinating, small topic inside linear algebra. Used to be determinants were
More informationWhen Negation Impedes Argumentation: The Case of Dawn. Morgan Sellers Arizona State University
When Negation Impedes Argumentation: The Case of Dawn Morgan Sellers Arizona State University Abstract: This study investigates one student s meanings for negations of various mathematical statements.
More informationCorporate Team Training Session # 2 June 8 / 10
3 rd Annual Great Corporate Debate Corporate Team Training Session # 2 June 8 / 10 Stephen Buchanan Education Consulting Outline of Session # 2 Persuasion topics Great Corporate Debate Review Contest,
More informationOverview of the ATLAS Fast Tracker (FTK) (daughter of the very successful CDF SVT) July 24, 2008 M. Shochet 1
Overview of the ATLAS Fast Tracker (FTK) (daughter of the very successful CDF SVT) July 24, 2008 M. Shochet 1 What is it for? At the LHC design accelerator intensity: New phenomena: 0.05 Hz Total interaction
More informationINTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments
INTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments Volker Halbach Pure logic is the ruin of the spirit. Antoine de Saint-Exupéry The Logic Manual The Logic Manual The Logic Manual The Logic Manual
More informationDraft 11/20/2017 APPENDIX C: TRANSPORTATION PLAN FORECASTS
APPENDIX C: TRANSPORTATION PLAN FORECASTS To determine future roadway capacity needs, year 2040 traffic forecasts were prepared using the Metropolitan Council travel demand model. The model was refined
More informationDIAGONALIZATION AND LOGICAL PARADOXES
DIAGONALIZATION AND LOGICAL PARADOXES DIAGONALIZATION AND LOGICAL PARADOXES By HAIXIA ZHONG, B.B.A., M.A. A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment of the Requirements
More informationNT 530 The Gospel of Mark
Asbury Theological Seminary eplace: preserving, learning, and creative exchange Syllabi ecommons 1-1-2000 NT 530 The Gospel of Mark William J. Patrick Follow this and additional works at: http://place.asburyseminary.edu/syllabi
More informationCMSC 341 Snow Day Chat March 14, 2017
Richard Chang CMSC 341 Snow Day Chat March 14, 2017 Alex Flaherty joined the conversation Joshua Mpere joined the conversation Paul Rehr joined the conversation Robert Duguay joined the
More informationLesson Plans that Work Year C Second Sunday in Easter Intergenerational Lesson Plans
Lesson Plans that Work Year C Second Sunday in Easter Intergenerational Lesson Plans Scripture: John 20: 19-31 (This Gospel reading of John occurs every Second Sunday of Easter. For today s session, the
More informationStrategic Planning Update for the Diocese of Evansville
Strategic Planning Update for the Diocese of Evansville November 2012 2 The following Q&A features the latest information about the strategic planning initiative currently underway in our diocese. This
More informationGödel's incompleteness theorems
Savaş Ali Tokmen Gödel's incompleteness theorems Page 1 / 5 In the twentieth century, mostly because of the different classes of infinity problem introduced by George Cantor (1845-1918), a crisis about
More informationCD 511 The Pastor and Christian Discipleship
Asbury Theological Seminary eplace: preserving, learning, and creative exchange Syllabi ecommons 1-1-2005 CD 511 The Pastor and Christian Discipleship Beverly C. Johnson-Miller Follow this and additional
More informationPOSTSCRIPT A PREAMBLE
THE POSTSCRIPT A PREAMBLE The transmission of reliable information from one person to another, from one place to another and from one generation to another has ever been a necessary feature of the human
More informationExperiencing God Notes for Home Family Study
Experiencing God Notes for Home Family Study 1. Home Family Study Guide Study guides for home study will be available for each week every Tuesday afternoon at http://www.oefchurch.com/resources. 2. Do
More informationTHERE IS SOMETHING NEW IN THE AIR
THERE IS SOMETHING NEW IN THE AIR Neopos is a technology that represents the next evolutionary step in air suspension, a cutting-edge innovation that will change your riding experience for the better.
More information