chapter 4 references and nested data structures

... 10 248 10 248 10 248 10 248 10 249 10 249 10 249 productid 1 1 1 0 0 0 NULL 11 14 42 51 72 NULL 11 42 72 NULL 14 51 (13 row(s) affected) total_quantity 0 0 0 0 76 12 10 40 27 12 10 49 40 22 Module 4: ... productid total_quantity NULL 10 248 10 248 10 248 10 248 10 249 10 249 10 249 NULL NULL 11 42 72 NULL 14 51 76 27 12 10 49 40 (8 row(s) affected) Module 4: Grouping and Summarizing Data 17 Using the GROUP BY ... Result orderid productid total_quantity 10 248 10 248 10 248 10 249 10 249 11 42 72 14 51 12 10 40 (5 row(s) affected) 16 Module 4: Grouping and Summarizing Data Example This example adds the ROLLUP...

Ngày tải lên: 11/12/2013, 14:15

... Pearson Addison- 4- 4 Call-by-Value Example: Display 4. 1 Formal Parameter Used as a Local Variable (1 of 3) Copyright © 2006 Pearson Addison- 4- 5 Call-by-Value Example: Display 4. 1 Formal Parameter ... Display 4. 1 Default Arguments (1 of 2) Copyright © 2006 Pearson Addison- 4- 27 Default Arguments Example: Display 4. 1 Default Arguments (2 of 2) Copyright © 2006 Pearson Addison- 4- 28 Testing and ... Copyright © 2006 Pearson Addison- 4- 34 Driver Program Example: Display 4. 9 Driver Program (1 of 3) Copyright © 2006 Pearson Addison- 4- 35 Driver Program Example: Display 4. 9 Driver Program (2 of 3)...

Ngày tải lên: 01/04/2014, 22:20

...  Individual Demand  Income and Substitution Effects  Market Demand  Consumer Surplus  Network Externalities  Empirical Estimation of Demand Chapter Slide Individual Demand  Price Changes ... $2.00 G $1.00 Demand Curve $.50 H 12 20 Chapter Food (units per month) Slide Individual Demand The Individual Demand Curve The Individual Demand Curve  Two Important Properties of Demand Curves 1) ... along the curve Chapter Slide Individual Demand The Individual Demand Curve The Individual Demand Curve  Two Important Properties of Demand Curves 2) At every point on the demand curve, the consumer...

Ngày tải lên: 26/09/2015, 15:07

... • Variations: use only a portion of the key 37 945 2: 379 * 379 = 143 641 → 3 64 121267: 121 * 121 = 0 146 41 → 46 4 045 128: 045 * 045 = 002025 → 202 Cao Hoang Tru CSE Faculty - HCMUT 21 01 December ... 37 945 2 121267 378 845 160252 045 128 Cao Hoang Tru CSE Faculty - HCMUT → → → → → 3 94 112 388 102 051 19 01 December 2008 Mid-square Address = middle digits of Key2 • Example: 945 2 * 945 2 = 89 340 3 04 ... key rotated key 600101 600102 600103 6001 04 600105 160010 260010 360010 46 0010 560010 → → → → → 62 63 64 65 66 → → → → → 26 36 46 56 66 Spreading the data more evenly across the address space...

Ngày tải lên: 06/03/2014, 17:20

... > Yes 3 3 2 3 3 No 4 4 Gini © Tan,Steinbach, Kumar 0 .42 0 0 .40 0 0.375 0. 343 0 .41 7 Introduction to Data Mining 0 .40 0 0.300 0. 343 0.375 0 .40 0 0 .42 0 37 Alternative Splitting Criteria ... P(C2) = 4/ 6 Error = – max (2/6, 4/ 6) = – 4/ 6 = 1/3 Introduction to Data Mining 43 Comparison among Splitting Criteria For a 2-class problem: © Tan,Steinbach, Kumar Introduction to Data Mining 44 Misclassification ... – (4/ 7)2 – (3/7)2 = 0 .48 9 © Tan,Steinbach, Kumar Node N2 C1 C2 N1 N2 Gini=0.361 C1 C2 Gini = 0 .42 Gini(Children) = 3/10 * + 7/10 * 0 .48 9 = 0. 342 Gini improves !! Introduction to Data Mining 45 ...

Ngày tải lên: 15/03/2014, 09:20

... the current Fibonacci number and its two predecessors 39 Fibonacci Numbers (Iteractive version) 40 The Towers of Hanoi 41 The Towers of Hanoi 42 The Towers of Hanoi 43 The Towers of Hanoi Algorithm ... the program 13 Recursion 14 Print List 10 14 20 15 Print List A list is • empty, or • consists of an element and a sublist, where sublist is a list 16 Print List 10 14 20 17 Print List Algorithm ... finish, source) 44 End Move The Towers of Hanoi 45 The Towers of Hanoi Does the program for the Towers of Hanoi produce the best possible solution? (possibly include redundant and useless sequences...

Ngày tải lên: 15/03/2014, 17:20

... once and only once in a predetermined sequence • Depth-First Traverse: preOrderTraverse (refOperation(ref Data )) inOrderTraverse (refOperation(ref Data )) ... (refOperation(ref Data )) • Breadth-First Traverse: BreadthFirstTraverse (refOperation(ref Data )) 16 17 18 19 20 21 22 Contiguous Implementation of Binary Tree BinaryTree Data ... Contiguous Implementation of Binary Tree Record Data Parent Flag End Record BinaryTree Data End BinaryTree Data A B E C F G H Parent - A B A C C...

Ngày tải lên: 15/03/2014, 17:20

... InsertElement (val DataIn ) DeleteMin (ref MinData ) RetrieveMin (ref MinData ) RetrieveMax (ref MaxData ) ... // swap data at position with data at child ReheapDown(child, lastPosition) return 10 Insert new element into min-heap Insert 14: 14 14 14 The new element is put to the last position, and ReheapUp ... DeleteHeap (ref MinData ) // Recursive version Removes the minimum element from the min-heap Post MinData receives the minimum data in the heap and this data has been removed The...

Ngày tải lên: 15/03/2014, 17:20

... , ref median ) 32 B-Tree Insertion 33 B-Tree Insertion 34 35 B-Tree Deletion 36 B-Tree Deletion 37 B-Tree Deletion 38 39 40 41 42 43 k-d Trees  2-d Tree  k-d Tree 44 ... loop (position < subroot->count) AND (target>subroot->dataposition) position = position + // Sequential Search if (position < subroot->count) AND (target = subroot->dataposition) return success else ... End SearchNode 24 Methods and Functions SearchTree (calls) recursiveSearchTree SearchNode Insert recursiveInsert splitNode push_in B-Tree Insertion Insert (val newData ) (local...

Ngày tải lên: 15/03/2014, 17:20

... 85, 74, 63 21 11 14 21 63 74 78 85 97 11 63 14 78 74 85 97 overflow Insert 45 , 42 , 57 21 11 14 42 45 78 57 21 63 overflow Cao Hoang Tru CSE Faculty - HCMUT 74 85 97 11 14 42 45 57 78 63 74 85 ... 11 14 16 19 57 20 overflow 78 63 42 74 16 85 97 11 14 19 45 21 20 42 11 14 21 19 30 57 20 21 78 63 74 85 97 45 42 Insert 52, 30, 21 16 57 63 42 16 78 45 74 52 85 97 11 14 19 21 21 20 57 30 45 ... Original node Rotate parent data down Rotate data to parent Shift entries left Cao Hoang Tru CSE Faculty - HCMUT 21 14 42 45 63 42 45 63 42 45 63 45 63 21 14 21 42 14 21 42 14 21 23 17 November 2008...

Ngày tải lên: 15/03/2014, 17:20

... eK is uncorrelated with the observed measure, xK : CovðxK ; eK Þ ¼ 4: 43Þ 74 Chapter From equation (4. 42), if assumption (4. 43) is true, then eK must be correlated with à the unobserved variable ... write à xK ¼ xK À eK and plug this into equation (4. 41): y ¼ b0 þ b1 x1 þ b x2 þ Á Á Á þ b K xK þ ðv À b K eK Þ 4: 44 Now, we have assumed that v and eK both have zero mean and are uncorrelated ... equation (4. 47) becomes ! sx à ^ ¼b plim b1 4: 48Þ 2 sx à þ se1 à The term multiplying b1 in equation (4. 48) is Varðx1 Þ=Varðx1 Þ, which is always less à than unity under the CEV assumption (4. 45)...

Ngày tải lên: 06/07/2014, 08:20

... 94 1 544 206907 41 79 94 641 940 823323 206650 22968 14 26712 47 198 118868 146 747 31678 371203 79889 73210 159329 136392 12237 46 1087 643 9 881 24 83005 1 547 42 2535 3 348 45 41 289 47 2 84 98796 108815 46 992 ... 1987 1992 1997 1982 3.5 3 .4 6.3 5.3 4. 4 4. 1 4. 8 4. 4 3 .4 3.0 7.7 6.5 5.6 4. 9 2.7 2.6 2.3 2.2 8.3 8.2 5.8 4. 4 4. 7 4. 1 3.5 3.3 3.6 4. 0 3.1 3.9 5.6 5.3 5.0 4. 4 5.7 5.9 4. 1 4. 5 2.5 2.5 2.3 2.0 2.6 2.6 ... 64. 6 48 .4 6.17 54. 1 95.8 39.1 4. 9 13 .45 3.19 5.89 210 65.1 1,201 580 13.3 1,7 94 163 188 61 .4 125 41 .5 64. 6 48 .4 5.95 53.7 93 .4 37.5 4. 9 13 .45 2.51 5.82 210 64. 1 123 131 46 .3 80.0 28.2 36 .4 29.7...

Ngày tải lên: 11/08/2014, 21:21

Ngày tải lên: 12/08/2014, 16:20