83 Pages

ch8

Course Number: CS 595, Fall 2009

College/University: Western Michigan

Word Count: 22533

Rating:

Document Preview

Contents 8 Cluster Analysis 8.1 What is cluster analysis? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.2 Types of data in clustering analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.2.1 Interval-scaled variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.2.2 Binary variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

Unformatted Document Excerpt
Coursehero >> Michigan >> Western Michigan >> CS 595

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Western Michigan - CS - 595
INTRODUCTION . 2WHAT IS DATA MINING? . 2 HOW TO ACHIEVE DATA MINING . 2 THE ROLE OF DARWIN . 3FEATURES OF DARWIN .. 4USER FRIENDLY . 4 SCALABILITY .. 6 VISUALIZATION . 8 FUNCTIONALITY. 10 Data Mining for Telecommunications. 11 Data Mining for Fin
Western Michigan - CS - 5950
CS 5950/6030: Network Security - Fall 2005Requirements for Term Project Presentation and Final ReportProf. Leszek Lilien llilien@cs.wmich.edu (Note cs, please!) Department of Computer Science Western Michigan UniversityUpdated course gradingMi
Western Michigan - CS - 5950
CS 5950: Computer Security and Information Assurance Spring 2007 Prof. Leszek T. Lilien Department of Computer Science, Western Michigan UniversityMidterm ExamFirst Name _ Last Name (in BLOCK LETTERS): Row_ Seat _ __ Email: _Do not open this ex
Western Michigan - CS - 1120
Operator OverloadingConsider the Fraction ClassOn object in the class Fraction encapsulates two integer variables designated by numer and denom. These two variables together symbolize and contain the rational number that we typically think of as n
Western Michigan - CS - 5950
More Theoretical ProjectsT1) Privacy-Preserving Data Dissemination Goal: Contribute to design and develoment of a scheme for privacy-preserving data dissemination. (Research papers are available from the instructor.) Note: Possibility of project con
Western Michigan - CS - 6910
CS 6910: Advanced Computer and Information Security (ACIS) Fall 2006 Project #2A Privacy &amp; Security Issues in Software Defined RadioBy Dheeraj Subbarayappa Aralumallige and Ravi K. Yellepeddy Department of Computer Science Western Michigan Universit
Western Michigan - CS - 6910
CS- 6910: Advanced Computer and Information Security (ACIS) Trusted Computing Group By Subhashini Pulimamidi Department of Computer Science Western Michigan University Instructor: Prof. Leszek T. Lilien1What is TCG ?Trusted Computing Group (TCG)
Western Michigan - CS - 6910
CS 6910 PT2B 30Mins PresentationRecursive Data Mining for Masquerade Detection and Author IdentificationBoleslaw K. Szymanski, IEEE Fellow, and Yongqiang Zhang Department of Computer Science, RPI, Troy, NY 12180, USAPresented by: Prashanth Srin
Western Michigan - CS - 6910
Anti-Cloning:Towards a Fraud-Prevention Framework for Software Defined Radio Mobile Devicesby Alessandro Brawerman &amp; John A. CopelandSchool of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30318, USAPresented
Western Michigan - CS - 6910
CS 6910:Advanced Computer and Information Security (ACIS) Fall 2006 Project 7An Overview of Authorization and Privacy for Semantic Web ServicesBy L. Kagal, M. Paolucci, N. Srinivasan, G. Denker, T. Finin, K. SycaraPresented By: Yvette Yoder Depa
Western Michigan - CS - 6910
PAPER IDENTIFICATION NUMBER: 50116071A Scheme for Privacy-preserving Data DisseminationLeszek Lilien, Senior Member, IEEE, and Bharat Bhargava, Fellow, IEEEAbstractAn adequate level of trust must be established between prospective partners bef
Western Michigan - CS - 6910
Authentication,Authorization and Accounting in Hybrid Ad hoc NetworksBy, Venkata VamshiOverviewWLAN a popular Technology. Hybrid Ad hoc Networks, A solution to WLAN Independent AccessAuthentication Authorization and Accounting important for Wi
Western Michigan - CS - 1120
1Chapter 7 - MethodsOutline Note: Inconsistent with textbook subsection numbering 7.13 [] Recursion [] 2002 Prentice Hall. All rights reserved.27.13 Recursion Recursive methods Methods that call themselves Directly Indirectly Call other
Western Michigan - CS - 5950
CS 5950/6030: Network Security Fall 2005MASTERPlease note that answers are more detailed than required for full credit. This is in order to give you a credit for any partial answers (e.g., if you include one subcase for, say, the case of limitati
Western Michigan - CS - 5950
CS 5950/6030: Network Security Fall 2005MASTERPlease note that answers are more detailed than required for full credit. This is in order to give you a credit for any partial answers (e.g., if you include one subcase for, say, the case of limitati
Western Michigan - ECE - 3510
IGNITION/INJECTION POWERBOXPB2006The PB2006 is a combination of three units: an eight-stage ignition unit, an eight-stage single-ended injection unit and a switchmode converter providing a regulated DC rail at 14V from a 3-phase permanent magnet al
Western Michigan - ECE - 357
Chapter 4 Lecture 5 The Microarchitecture Level Integer JAVA Virtual MachineThis is a limited version of a hardware implementation to execute the JAVA programming language.1 of 18Notes and figures are based on or taken from materials in the cour
Western Michigan - ECE - 3510
POWERTRAIN CONTROL UNITTAG-310BTAG-310B is the main processing unit for complete powertrain control of a racing car. It may be used with a pair of small companion driver units to provide direct control of ignition and injection, along with all othe
Western Michigan - CS - 112
TreesTerminology Trees are hierarchical parent-child relationship exits A is the parent of B B is a child of A B and C are siblings Generalized to ancestor and descendant root: the only node without parent leaf: a node has no children Sub
Western Michigan - CS - 112
Quick SortAnother Divide and Conquer Choose a pivot item p Partition array S[first.last] about pPesudo-Codequicksort(int *array, int first, int last) { if (first&lt;last) { choose a pivot item p from array[first.last]; partition the items about p
Western Michigan - CS - 112
Exception HandlingIntroduction Common examples of exceptions Failure of new to obtain memory Out-of-bounds array subscript Division by zero Invalid function parameters Programs with exception handling Clearer, more robust, more fault-tolera
Western Michigan - CS - 112
Merge SortDivide and Conquer Divide array into smaller ones Recursively sort smaller arrays Recombine smaller arrays obtaining one final sorted arrayAn ExamplePesudo-Codemergesort(int *array, int first, int last) { if (first&lt;last) { /find m
Western Michigan - CS - 112
FriendRevisit the Class Moneyclass Money { public: Money(int D, int C); int getDollars(); int getCents(); private: int dollars; int cents; }; Overload =:Money m1(5,25),m2(5,25); If (m1=m2) cout &lt; m1 and m2 are the same amount of money\n; Ove
Western Michigan - CS - 112
Linked ListList Definitions Linear relationship Each element except the first has a unique predecessor, and each element except the last has a unique successor. Length The number of items in a list; the length can vary over time.Abstract Data T
Western Michigan - CS - 112
Walls &amp; Mirrors Chapter 1Principles of Programming and Software EngineeringSoftware Life CyclePhase 1: Specification Answers What do we build? Define clearly all aspects of the problem What is input (valid/invalid) data? What assumptions are
Western Michigan - CS - 112
Polymorphism and Virtual Functionsclass Ball : public SphereProblems in Function Redefinitionint main() { Sphere mySphere(); Ball myBall(); Sphere *spherePtr; spherePtr = &amp;mySphere; spherePtr-&gt;displayStatistics(); spherePtr = &amp;myBall; spherePt
Western Michigan - CS - 112
Problem Solving with ADT -StacksChecking for Balanced BracesBalanced: Unbalanced: abc{dc{dc}pa}{csd+} {asdf{df@#}dfa{df}Pseudocodewhile (not end of line) { if (ch is {) add ch to ADT else if (ch is }){ if (ADT is empty) return unbalanced; remov
Western Michigan - CS - 112
PointersAddresses in Memory When a variable is declared, enough memory to hold a value of that type is allocated for it at an unused memory location. This is the address of the variable.int x; float number; char ch; 2000 2002 2006xnumberch
Western Michigan - CS - 112
Problem Solving with ADT -QueuesQueue ADT A queue is a FIFO: first in, first outApplication: Recognizing Palindromes Palindrome is a string of characters that reads the same from left to right as it does from right to left Madam, Im Adam A ma
Western Michigan - CS - 112
Trees -ContinuedArray-Based Implementation Represent binary tree by using an array of tree nodesclass TreeNode { private: TreeNode(); TreeNode(TreeItem&amp; nItem, int left, int right); TreeItem item; int leftC; int rightC; friend class BinaryTree; }
Western Michigan - CS - 4850
A Project Centered Programming Lang~ge Course Robert Trenary Computer Science Department Western Michigan UniversityAbstract A programming language course is difficult to organize because of the diversity of languages and concepts discussed. A Lisp
Western Michigan - CS - 2240
CS224 Fall 2008 Programming Assignment #2 Due Date: January 29PurposeThe purpose of this assignment is to gain experience using the unbuered I/O system calls (open(), read(), write(), etc.). The assignment will also give you experience doing simpl
Western Michigan - CS - 2230
Assignment 1 CS223, Spring 2008 Due: Thursday, January 31Part I) You will write a C main and 2 Sparc assembly language functions. The C program will be in one file, the Sparc functions in another. The C main will simply call a function whose prototy
Western Michigan - CS - 2230
tvc10 ignored 1111 111010 rs1 tt = 0x80 | (i = 0 ? r[rs2] : sign-extend (13 bit immediate)&lt;6:0&gt;); 10 ignored 1111 111010 rs1 1. 2. 3. Purpose: trap on no signed overflow Format: tvc address Operation: If (V = 0) trap; else { r[pc] = r[npc]; r[npc] =
Western Michigan - CS - 2230
USER MODE MACHINE INSTRUCTIONS USER MODE MACHINE INSTRUCTIONSSyntaxSymbol Definition Comment Bits n through m inclusive Integer register n Destination register Source register Source register Floating-point register n A signed constant that fits in
Western Michigan - CS - 2230
Shift InstructionsMachine shift instructions.sll10 rd 100101 op2 = i = 0 ? r[rs2]&lt;4:0&gt; : shift count 10 rd 100101 1. 2. 3. 4. 5. rs1 rs1 i=0 i =1 ignored shift count rs2Purpose: perform logical left-shift Format: sll rs1, op2, rd Operation: r[r
Western Michigan - CS - 2230
SPARC INSTRUCTIONS INDEX LISTAadd addcc addx addxcc .align and andcc andn andncc .ascii .ascizFfabss faddd faddq fba fbe fbg fbge fbl fble fblg fbn fbne fbo fbu fbue fbug fbuge fbul fbule fcmpd fcmped fcmpeq fcmpes fcmpq fcmps fdivd fdivs fdtoi
Western Michigan - CS - 2240
Chapter 1. UNIX System Overview Section 1.1. Introduction Section 1.2. UNIX Architecture Section 1.3. Logging In Section 1.4. Files and Directories Section 1.5. Input and Output Section 1.6. Programs and Processes Section 1.7. Error Handling Section
Western Michigan - CS - 4850
Unix System Programming FALL 2008 M-W-F, 10:30 - 11:20 C124 INSTRUCTOR PARTICULARS Instructor: Robert Trenary Office: B250 CEAS Office Hours M-W-F 11:30 12:20 Phone: 276-3127 E-mail: trenary@wmich.edu or trenary@cs.wmich.edu (either Vax or Suns) TEX
Western Michigan - CS - 2230
Computer Organization Spring 2009 MWF 9:30 10:20, D201 INSTRUCTOR PARTICULARS Instructor: Robert Trenary Office: B250 CEAS Office Hours: MWF 11:30 12:30 Phone: 276-3127 E-mail: trenary@wmich.edu or trenary@cs.wmich.edu (either Bronco or CS) TEXT: T
Western Michigan - CS - 2240
Unix System Programming FALL 2008 M-W-F, 1:30 - 2:20 D202 INSTRUCTOR PARTICULARS Instructor: Robert Trenary Office: B250 CEAS Office Hours M-W-F 11:30 12:30 Phone: 276-3127 E-mail: trenary@wmich.edu or trenary@cs.wmich.edu (either Vax or Suns) TEXT:
Western Michigan - CS - 2230
Computer Organization Spring 2008 Tues Thurs C136 INSTRUCTOR PARTICULARS Instructor: Robert Trenary Office: B250 CEAS Office Hours: Tues Thurs 12:45 1:30 , 3 - 4 Phone: 276-3127 E-mail: trenary@wmich.edu or trenary@cs.wmich.edu (either Bronco or C
Western Michigan - CS - 2230
Logical InstructionsMachine bit-wise logical instructions.and10 rd 000001 rs1 op2 = i = 0 ? r[rs2] : sign-extend(13 bit immediate); 10 rd 000001 rs1 1. 2. 3. 4. 5. i=0 i=1 ignored rs2signed 13 bit immediatePurpose: perform bit-wise and operat
Western Michigan - CS - 2230
ldf11 rd 100000 rs1 op2 = i = 0 ? r[rs2] : sign-extend(13 bit immediate); 11 rd 100000 rs1 1. 2. 3. 4. 5. i=0 i =1 ignored rs2signed 13 bit immediatePurpose: load floating-point register with word from memory Format: ldf [rs1 + op2], rd Operatio
Western Michigan - CS - 2230
tne10 ignored 1001 111010 rs1 tt = 0x80 | (i = 0 ? r[rs2] : sign-extend (13 bit immediate)&lt;6:0&gt;); 10 ignored 1001 111010 rs1 1. 2. 3. Purpose: trap on not equal Format: tne address Operation: if (Z = 0) trap; else { r[pc] = r[npc]; r[npc] = r[npc] +
Western Michigan - CS - 2230
fsubd10 1. 2. 3. 4. 5. rd 110100 ignored 001000110 rs2Purpose: double-precision floating-point subtract Format: fsubd rs1, rs2, rd Operation: f[rd], f[rd + 1] = f[rs1], f[rs1 + 1] f[rs2], f[rs2 + 11; Condition Codes: unaffected Description: doubl
Western Michigan - CS - 2230
subcc10 rd 010100 %rs1 op2 = i = 0 ? r[rs2] : sign-extend(13 bit immediate); 10 rd 010100 %rs1 1. 2. 3. 4. Purpose: perform integer subtraction and set condition codes Format: subcc rs1, rs2, rd Operation: r[rd] = r[rs1] - op2 Condition Codes: N = r
Western Michigan - CS - 2230
fble00 1. 2. 3. a 1101 110 disp22Purpose: branch on less or equal Format: fble label Operation: r[pc] = r[npc]; if (E | L) = 1) r[npc] = + sign_extend(disp22) &lt; 2; else { r[npc] = r[pc] + 4; if (a = 1) annul next instruction; }4. 5.Condition C
Western Michigan - CS - 2230
tn10 ignored 0000 111010 rs1 tt = 0x80 | (i = 0 ? r[rs2] : sign-extend (13 bit immediate)&lt;6:0&gt;); 10 ignored 0000 111010 rs1 1. 2. 3. 4. 5. Purpose: trap never Format: tn address Operation: no operation Condition Codes: unaffected Description: Trap n
Western Michigan - CS - 2230
fqtoi10 1. 2. 3. 4. 5. rd 110100 ignored 011010011 rs2Purpose: convert from extended-precision floating-point to integer and round Format: fqtoi rs2, rd Operation: f[rd] = (int) f[rs2], f[rs2 + 1], f[rs2 + 2], f[rs2 + 3]; Condition Codes: unaffect
Western Michigan - CS - 2230
xnorcc10 rd 010111 rs1 op2 = i = 0 ? r[rs2] : sign-extend(13 bit immediate); 10 rd 010111 rs1 1. 2. 3. 4. i=0 i=1 ignored rs2signed 13 bit immediatePurpose: perform bit-wise xnor operation with op2 and set condition codes Format: xnorcc rs1, op2
Western Michigan - CS - 2230
st11 rd 000100 rs1 op2 = i = 0 ? r[rs2] : sign-extend(13 bit immediate); 11 rd 000100 rs1 1. 2. 3. 4. 5. i=0 i =1 asi rs2Signed 13 bit immediatePurpose: store register into memory Format: st rd, [rs1 + op2] Operation: memory[r[rs1] + op2] = r[rd
Western Michigan - CS - 2230
ConversionsFrom\To 2 (Binary)28 Group 3 Bits, Map to Octal Digit (Right to Left)10 Formula 116 Group 4 Bits, Map to Hex Digit (Right to Left) 8 2 168 (Octal)Map each Octal digit to 3 bits Division Algorithm Map each hex digit to 4 bit
Western Michigan - CS - 1120
Extended Regular ExpressionsElementary Operations single characters except \ . \$ ^ [ ] - ? * + | ( ) / { } % &lt; &gt; concatenation (put characters together) alternation (a|b|c) [ab] = a|b [a-k] = a|b|c|.|i|j|k [a-z0-9] = any letter or digit [^a] = any
Western Michigan - CS - 05
NAME ID #: XXX XX LAB NUMBER Lab: TWFDUE DATESUBMISSION DATE DAYS LATE (Unless otherwise specified, all deadlines are 11:55:00 p.m. on the due date.) Total Possible Points for Assignment If the program does not contain an appropriate Headers &amp; h
Western Michigan - CS - 1120
NAME ID #: XXX XX LAB NUMBER Lab: TWFDUE DATESUBMISSION DATE DAYS LATE (Unless otherwise specified, all deadlines are 11:55:00 p.m. on the due date.) Total Possible Points for Assignment If the program does not contain an appropriate Headers &amp; h
Western Michigan - CS - 531
CS 531Homework#2SummerII 2003Due : July 23, 2003, 1:00pm 1. Given the following algorithm: for i = 1 to n y = i; for k = n downto i z = k; for j = k to n if k n/4 then x = x y; elseif n/4 &lt; k 3n/4 then x = x y z; else x = x z + y z + x
Western Michigan - CS - 531
CS 531Max. pts = 100Homework Assignment # 3SummerII 2003Due date: August 4, 2003 - 1:00pmIn this assignment we will empirically observe the performance of a 2-3 search tree. First build a 2-3 search tree (as discussed in class) and do various
Western Michigan - CS - 531
CS531 - SummerII 2003 - Home Work IDue: 7/11/03, 1:00pm1. Prove by induction: a) b)n n(n+1)(2n+1) 2 , i=1 i = 6 1 1 1 13 n+1 + n+2 + . + 2n &gt; 24 ,for all n 1 for all n &gt; 1.2. Show that the following equalities are correct: a) b) c) d) e) f) g
Western Michigan - CS - 331
.on'&quot;&quot;-. 5~ 0 c= . 0-.c&gt;00 .!, !u t~o-~~ o~V.!= O -5v ~ v~. c=-5-5 t.S~~ vV'I: ~~.&quot;Ce=.&quot;tj,I , , ,I~ J .!~ .E~!~Z.~., &quot;0&gt; v.-CC 0 0.-50 0 &quot;'&quot; c&quot;;'U&gt;-.~U.c vu~vev. ., ., A .0 . ..c 00&quot;0&quot;0 -C1.5-5U., ~, .I
Western Michigan - CS - 5260
A Theoretician's Guide to the Experimental Analysis of AlgorithmsDavid S. Johnson AT&amp;T Research April 30, 19961 IntroductionThere has been much encouragement recently for the experimental analysis of algorithms. This encouragement has come both f