Knowledge libraries and information space

Size: px
Start display at page:

Download "Knowledge libraries and information space"

Transcription

1 University of Wollongong Research Online University of Wollongong Thesis Collection University of Wollongong Thesis Collections 2009 Knowledge libraries and information space Eric Rayner University of Wollongong Recommended Citation Rayner, Eric, Knowledge libraries and information space, Doctor of Philosophy thesis, School of Computer Science and Software Engineering - Faculty of Informatics, University of Wollongong, Research Online is the open access institutional repository for the University of Wollongong. For further information contact the UOW Library: research-pubs@uow.edu.au

2

3 KNOWLEDGE LIBRARIES AND INFORMATION SPACE A thesis submitted in partial fulfilment of the requirements for the award of the degree DOCTOR OF PHILOSOPHY from the UNIVERSITY OF WOLLONGONG by ERIC RAYNER, BCompSc(Hons) SCHOOL OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING 2009

4

5 Thesis Certification I, Eric P. Rayner, declare that this thesis, submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy, in the School of Information and Computer Science, University of Wollongong, is wholly my own work unless otherwise referenced or acknowledged. The document has not been submitted for qualifications at any other academic institution. Eric Rayner July 27, 2009

6 Contents List of Figures List of Tables Abbreviation, Notation and Typographical Conventions Abstract Acknowledgements ix xiii xvii xix xxi 1 Introduction Thesis Overview The Contribution of this Thesis The Organisation of Information Thesis Methodology Gap in the literature Research hypothesis Experiment How to Read this Thesis Thesis Outline The Nature of Information Limitations of this Thesis Knowledge Libraries Information Space Information Organisation Terms The Organisation of Information Overview Introduction Traditional Classification Faceted classification ISBN, ISSN, MARC and CIP i

7 2.3.3 A critique of traditional classification Computer File Systems A critique of computer file systems The Database Critique of the database Information Retrieval Measuring the effectiveness of IR A critique of IR Data Warehousing Critique The Internet, World Wide Web and Semantic Web The internet The world wide web The Semantic Web Discussion and Summary What this chapter achieved Knowledge Libraries Overview Introduction Knowledge Library User Scenarios The Uses of Knowledge Libraries Knowledge Libraries for Research Knowledge Libraries for Education Knowledge Libraries for Business Core Knowledge Library Functionality Core knowledge library administration functionality Core knowledge library end use functionality Knowledge Library Security Extended Knowledge Library Functionality Automatic dimensions Dynamic dimensions Automatic report generation Automatic notification Knowledge library graphical user interface What this chapter achieved Spaces for Information Organisation Overview Potential Mathematical Bases

8 4.2.1 Metric Space Vector Space The vector model for information retrieval Lattices and Topological Space Formal Concept Analysis The Relational Model Online Analytical Processing (OLAP) Space n-dimensional Spaces Nested Spaces Span Spans of Points in n-dimensional Spaces The Generalised Triangle Inequality and Set Space Other Properties of Set Distance Functions Reflexivity Strict Positiveness d -strict positiveness Signed Distances What this Chapter Achieved Set Spaces Overview Manipulating Set Space n-dimensional Set Spaces Other Properties of n-dimensional Spaces Dimension Nesting Dilated and Translated Spaces Set Distance Functions Based on Set Operations The d M ij Set Distance function The Triangle Inequality ( I) Span The Generalised Triangle Inequality (G I) reflexivity d -strict positiveness What this Chapter Achieved L-Collections Overview

9 6.2 Background Sets Multisets Merges and Joins Indexed Families Rough Sets Fuzzy sets L-Collections L-collection operators Sets, Multisets, Fuzzy Sets, Rough Sets and L-Collections Sets and L-Collections Multisets and L-Collections Fuzzy Sets and L-Collections Rough Sets and L-Collections Extending Proofs Over Sets and Multisets to {1}, N 1 and Q >0 -Collections What this Chapter Achieved L-Collection Space Overview L-Collection Distance Functions An L-Collection Distance Function I for X X Y d -strict positiveness for X X Y reflexivity for X X Y The d M ij L-Collection Distance Function The M k d L-Collection Distance Function Span and G I for M k d reflexivity for M k d distance functions d -strict positiveness for M k d distance functions The M av d L-Collection Distance Function G I for M av d Other properties of M av d What this Chapter Achieved Information Space Overview Introduction Networked Space Classification Space

10 8.4.1 Classification spaces for uncertain and partial classifications Many levelled classification spaces Projected classification spaces Working with Classification Space Creation Addition and subtraction Point selection Ordering Attaching Information Units to Points in Classification Spaces Distance Indexing classification spaces Information Space Working with Information Space Creation Index Manipulation Information unit selection Selecting points in information space What this Chapter Achieved Basing Knowledge Libraries on Information Space Overview Information Space for Questionnaire Knowledge Libraries Example Questionnaire Information Space Information Space for Research Paper Knowledge Libraries Selecting and Comparing Research Papers Extended Dimensions Further Dimensions What this Chapter Achieved The Efficient Implementation of Knowledge Libraries Overview Introduction Distance query Range query k Nearest neighbour query Ranked query Sequential search range query algorithm

11 10.3 Metric Space Algorithms Relative ordering Radius partitioning Hyperplane partitioning Ranked query and k-nn query algorithms A critique of the literature Adapting Metric Space Algorithms for Set Space Relative ordering for set spaces Radius partitioning for set space Hyperplane partitioning for set spaces Searching hard spaces Specialised algorithms for searching hard spaces Specialised algorithms for searching n-dimensional spaces What this Chapter Achieved Experimental Results and Discussion Overview Introduction Set Space Radius Partitioning Implementation: Non symmetric Experiments Non Symmetric Experiment setup Non Symmetric Experimental results Discussion of non symmetric results Variance Experiments Variance experimental results Random edge weight experimental results Euclidean space experimental results Center Selection and Multiple Tree Experiments Greatest minimum center selection experiment Standard deviation center selection experiment Discussion of center selection experiments Experiment with multiple search trees Experiments with Multi-Dimensional Spaces Multi-Dimensional experiment setup Multi-Dimensional experimental results and discussion Multiple tree experiments Set Space Experiments Discussion of set space results Sequential search algorithms

12 Sequential search for n dimensional spaces Sequential search over set spaces with set distance functions Discussion of sequential search results Introducing the Sequential-Hybrid Algorithm Discussion of sequential-hybrid results Summary, discussion and recommendations What this Chapter Achieved Summary, Discussion and Future Work Chapter Overview Thesis Summary The importance of information systems The significance of Knowledge Libraries The mathematical basis for Knowledge Libraries Implementing Knowledge Libraries Discussion The Contribution of this Thesis The more formal development of Knowledge Libraries The flexibility of information space Future Work The implementation of Knowledge Libraries Graphical Interface Improving existing systems The dissemination of knowledge Appendix A: A Guide to the Accompanying CD 291 Appendix B: Publications Relating to this Thesis 299 Appendix C: Glossary of Information Organisation Terms 301

13 List of Figures 2.1 A 13-digit ISBN with EAN-13 bar code A Hasse diagram of a concept lattice of objects = {1,..., 10} and attributes = {composite, even, odd, prime, square} Three balls X, Z, Y in R Subset element counts for -reflexive proofs. a = X, b = Y X Subset element counts for I proofs. a = Z X Y, b = Z X Y, c = Z X Y Subset element counts for d -strict positive proofs. a = X Y, b = X Y and c = Y X Sub L-collection element counts for I proofs. a = Z X Y, b = Z X Y, c = Z X Y, etc Sub L-collection element counts for -strict positive proofs. a = X Y, b = X Y and c = Y X Sub L-collection element counts for -reflexive proofs. a = X, b = Y X Frequency of distances for typical 1000-point network spaces with maxdist = 25 and 1500, 2000, 2500 and 3000 directed, weight = 1 edges Frequency of distances for typical 1000-point network spaces with maxdist = 25. LHS: 1100 undirected, weight = 1 edges. RHS: 2200 directed, weight = 1 edges viii

14 11.3 Data from a range query (x = 999, t = 2) on radius partitioning search trees (branchf actor = 2, leaf Capacity = 10) over 1000 different, 1000-point, metric (network) spaces generated from networks with 1100 weight = 1 undirected edges and maxdist = 25. LHS: distribution of candidate point set size as a (truncated) percentage of space size. RHS: distribution of retrieved to candidate point set sizes (by truncated percentage) Frequency of distances. LHS: a typical 1000-point network space with maxdist = 255 and 1.1n undirected edges with uniform random weights (integers 1 to 19). Mean distance: , standard deviation: RHS: a 1 dimensional Euclidean space over integers Mean distance: , standard deviation: Data from a range query (x = 999, t = 50) on radius partitioning search trees (branchf actor = 2, leaf Capacity = 10) over 1000 different, 1000-point, metric (network) spaces (with 1100 randomly weighted undirected edges). LHS: distribution of candidate point set size as a (truncated) percentage of space size. RHS: distribution of retrieved to candidate point set sizes (by truncated percentage). Compare with figure Data from the range query x = 999, t = 50 on 1000 radius partitioning search trees (with randomly selected centers, branchf actor = 2 and leaf Capacity = 10) over a point uniform Euclidean space. LHS: distribution of candidate point set size as a (truncated) percentage of space size. RHS: distribution of retrieved to candidate point set sizes (by truncated percentage). Compare with figure ix

15 11.7 Data from a range query (x = 999, t = 2) on radius partitioning search trees (branchf actor = 2, leaf Capacity = 10) with specially selected centers over 1000 different, 1000-point, metric (network) spaces (with 1100 weight = 1 undirected edges). LHS: distribution of candidate point set size as a (truncated) percentage of space size. RHS: distribution of retrieved to candidate point set sizes (by truncated percentage). Compare with figure Data for the range query x = 999, t = 2 over 3 radius partitioning search trees (with random centers, branchf actor = 2 and leaf Capacity = 10) for each of 1000 different, point, metric (network) spaces (with 1100 weight = 1 undirected edges). The intersection of the 3 resulting candidate point sets was taken as the candidate point set for this search method. LHS: distribution of candidate point set size as a (truncated) percentage of space size. RHS: distribution of retrieved to candidate point set sizes (by truncated percentage) Distance frequencies for the first 1000 points in 2,3,4 and 5 dimensional uniform Euclidean spaces. Distances are truncated in the plot, but not when computing the mean and standard deviation. The 2 dimensional space has 32 coordinates each dimension. The others have 10, 6 and 4 (respectively) Distribution of retrieved to candidate point set sizes (by truncated percentage) for the range query x = 0, t = 2 over 1000 radius partitioning search trees (with random centers, branchf actor = 2 and leafcapacity = 10) for uniform 1000-point, 2,3,4 and 5 dimensional Euclidean space x

16 11.11 Distribution of retrieved to candidate set sizes (by truncated percentage) for the range query x = 0, t = 2 over 1000 different groups of three radius partitioning search trees (with random centers, branchf actor = 2 and leafcapacity = 10) for a uniform 1000-point, 2,3,4 and 5 dimensional Euclidean space. The group candidate set is the intersection of the candidate sets corresponding to each of the three trees Data from 1000 range queries (0 x 999, t = 50) on 1000 different radius partitioning search trees (with random centers, branchf actor = 2, leafcapacity = 10) over the space {0,..., 999}, x y. LHS: distribution of candidate point set size as a (truncated) percentage of space size. RHS: distribution of retrieved to candidate point set sizes (by truncated percentage) Data from a range query (x = 999, t = 2) on radius partitioning search trees (branchf actor = 2, leaf Capacity = 10) over 1000 different, 1000-point, (non symmetric) network spaces generated from networks with 2200 weight = 1 directed edges and maxdist = 25. LHS: distribution of candidate point set size as a (truncated) percentage of space size. RHS: distribution of retrieved to candidate point set sizes (by truncated percentage) xi

17 List of Tables 2.1 Simplified Star Schema for Nationwide Retail Chain Dimension types Eight relations illustrating operations defined in [24] Distances for three distance functions over X = {1, 3}, Y = {5, 9} and Z = {3, 5} Ball to enclosing hypercube volume (4 s.f.) for different n in Euclidian space Average, over 1000 distinct queries (t = 2, 0 x < 1000), radius partitioning tree search (branchf actor = 2, leaf Capacity = 10) and sequential search range query times (milliseconds) for typical symmetric network spaces generated from (random) n = 1000, e = 1100; n = 10000, e = 13000; and n = , e = (undirected) networks and non symmetric network spaces generated from (random) n = 1000, e = 2200; n = 10000, e = 26000; and n = , e = (directed) networks Radius partitioning search tree (branchf acor = 2 and leaf Capacity = 10) for a typical, random, 1000-point network space (with 1100 undirected weight = 1 edges) xii

18 11.3 Candidate nodes, collisions, pruned nodes and points, considered and retrieved points by level from a range query (x = 999, t = 2) on the radius partitioning search tree in table The retrieved point set contained 7 points, while the candidate point set contained 198 points, giving a retrieved to considered ratio of approximately 3% Typical radius partitioning search tree (with random centers, branchf acor = 2 and leafcapacity = 1) for a 1 dimensional Euclidean space over integers Compare with table Collisions, pruned nodes and points, considered and retrieved points by level from the range query x = 999, t = 50 on the radius partitioning search tree in table Both retrieved and candidate point sets contained 51 points, giving a retrieved to considered ratio of 100%. Compare with table Candidate set sizes for the range query x = 999, t = 2 over 3 radius partitioning search trees (with random centers, branchf actor = 2 and leafcapacity = 10) for each of 10 different, 1000-point, metric (network) spaces (with 1100 weight = 1 undirected edges). The size of the intersection of these 3 sets, and the size of the retrieved set is also displayed Space size and query time for the sequential search algorithm (for a C++ implementation, using the cmath sqrt() and pow() functions, on a 1.8GHz machine with 265k memory running Linux) for various n dimensional spaces with 1000 points in each dimension and 10 6 information elements. Dimensional ( n distances d 1,..., d n are combined using i=1 d 2) i xiii

19 11.8 Space size and query time for the sequential search algorithm (for a C++ implementation, using the cmath sqrt() and pow() functions, on a 1.8GHz machine with 265k memory running Linux) for a 3 dimensional space. Each dimension is a set space, based on an underlying space with 1000 points. The algorithm determines distances for 10 6 information units, attached to random points in the space. Dimensional distances d 1, d 2, d 3 are combined using d d d Retrieved to candidate set sizes (by truncated percentage) for a sequential search range queries over 3,5,7 and 9 dimensional spaces (with 10 6 randomly attached information elements). Each dimension consists of 1000 points. Distances are uniform random integers between 1 and In each n dimensional space, the first n 1 dimensions were used to determine the candidate set xiv

20 Abbreviation, Notation and Typographical Conventions The set of real numbers is denoted by R, the set of rational numbers by Q and the set of natural numbers (integers, strictly larger than 0) by N 1. Note that R 0 is the set of real numbers greater than or equal to 0, while R >0 is the set of real numbers strictly greater than 0. Interval notation is used to denote real intervals, so (0, 1] is the set of real numbers less than or equal to 1 and strictly larger than 0. More generally, capital letters, such as L, M, X, Y, are used to denote sets. The power set of any set M (the set of all subsets of M) is denoted P(M). Lowercase math bold font letters denote vectors, so x and y are vectors. L-collections (introduced in chapter 6) are distinguished from sets by using math calligraphy font, so M, X, Y are L-collections. Enclosing vertical bars are used to denote the cardinality of a set ( M ), the cardinality of an L-collection ( M ), the absolute value of a real number ( d(x, y) ) and the magnitude of a vector ( x ). Bold text is used to denote key terms that are defined (or at least described), both within, and (optionally) prior to, the definition. Double quotes are used for short quotations (which are also referenced) and when introducing key terms that are not defined. Finally, iff is used as shorthand for if and only if. Abbreviations in this thesis are preceded and introduced by the corresponding, non abbreviated, full term. xv

21 xvi

22 Abstract This research describes and develops Knowledge Libraries, idealised systems for organising and presenting information. By providing a mathematical basis, the definition of information space establishes a formal foundation for Knowledge Libraries. The definition of information space builds on the new definitions of L-collections, which generalise sets by allowing a real valued grade to be associated with each element, and set space, which generalises metric space to better model the relationships between information units. The multiple search tree method improves existing metric space range query algorithms. These algorithms are also generalised to work over set space. The sequential-hybrid algorithm enables efficient range queries over multi-dimensional spaces. xvii

23 xviii

24 Acknowledgements First and foremost, I would like to thank Dr. Ian Piper, my principal supervisor, for his continuing support throughout my candidacy. Acknowledgement is also due Prof. Martin Bunder for his assistance with the mathematical work in this thesis. Without Prof. Bunder s input, this thesis would not have the emphasis on mathematical correctness that it does. I would also like to thank my family for their support, particularly my father, Prof. John Rayner, for his willingness to proof read chapters and discuss thesis related matters (at some considerable length). xix

Knowledge libraries and information space

Knowledge libraries and information space University of Wollongong Thesis Collections University of Wollongong Thesis Collection University of Wollongong Year 2009 Knowledge libraries and information space Eric Rayner University of Wollongong

More information

Automatic annotation of digital photos

Automatic annotation of digital photos University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2007 Automatic annotation of digital photos Wenbin Shao University

More information

Contents. Foreword to Second Edition. Acknowledgments About the Authors

Contents. Foreword to Second Edition. Acknowledgments About the Authors Contents Foreword xix Foreword to Second Edition xxi Preface xxiii Acknowledgments About the Authors xxxi xxxv Chapter 1 Introduction 1 1.1 Why Data Mining? 1 1.1.1 Moving toward the Information Age 1

More information

ALGORITHMIC ASPECTS OF DOMINATION AND ITS VARIATIONS ARTI PANDEY

ALGORITHMIC ASPECTS OF DOMINATION AND ITS VARIATIONS ARTI PANDEY ALGORITHMIC ASPECTS OF DOMINATION AND ITS VARIATIONS ARTI PANDEY DEPARTMENT OF MATHEMATICS INDIAN INSTITUTE OF TECHNOLOGY DELHI JUNE 2016 c Indian Institute of Technology Delhi (IITD), New Delhi, 2016.

More information

Business Intelligence Roadmap HDT923 Three Days

Business Intelligence Roadmap HDT923 Three Days Three Days Prerequisites Students should have experience with any relational database management system as well as experience with data warehouses and star schemas. It would be helpful if students are

More information

Content distribution networks over shared infrastructure : a paradigm for future content network deployment

Content distribution networks over shared infrastructure : a paradigm for future content network deployment University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2005 Content distribution networks over shared infrastructure :

More information

Albertson AP Calculus AB AP CALCULUS AB SUMMER PACKET DUE DATE: The beginning of class on the last class day of the first week of school.

Albertson AP Calculus AB AP CALCULUS AB SUMMER PACKET DUE DATE: The beginning of class on the last class day of the first week of school. Albertson AP Calculus AB Name AP CALCULUS AB SUMMER PACKET 2017 DUE DATE: The beginning of class on the last class day of the first week of school. This assignment is to be done at you leisure during the

More information

Illumination invariant face detection

Illumination invariant face detection University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2009 Illumination invariant face detection Alister Cordiner University

More information

The Discovery and Retrieval of Temporal Rules in Interval Sequence Data

The Discovery and Retrieval of Temporal Rules in Interval Sequence Data The Discovery and Retrieval of Temporal Rules in Interval Sequence Data by Edi Winarko, B.Sc., M.Sc. School of Informatics and Engineering, Faculty of Science and Engineering March 19, 2007 A thesis presented

More information

A reputation system for BitTorrent peer-to-peer filesharing

A reputation system for BitTorrent peer-to-peer filesharing University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2006 A reputation system for BitTorrent peer-to-peer filesharing

More information

Neuro-fuzzy admission control in mobile communications systems

Neuro-fuzzy admission control in mobile communications systems University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2005 Neuro-fuzzy admission control in mobile communications systems

More information

Summary of Contents LIST OF FIGURES LIST OF TABLES

Summary of Contents LIST OF FIGURES LIST OF TABLES Summary of Contents LIST OF FIGURES LIST OF TABLES PREFACE xvii xix xxi PART 1 BACKGROUND Chapter 1. Introduction 3 Chapter 2. Standards-Makers 21 Chapter 3. Principles of the S2ESC Collection 45 Chapter

More information

Mathematics Shape and Space: Polygon Angles

Mathematics Shape and Space: Polygon Angles a place of mind F A C U L T Y O F E D U C A T I O N Department of Curriculum and Pedagogy Mathematics Shape and Space: Polygon Angles Science and Mathematics Education Research Group Supported by UBC Teaching

More information

PREREQUISITE:Individualized Educational Plan with this component. REQUIRED MATERIALS: notebook, pencil, calculator, agenda book

PREREQUISITE:Individualized Educational Plan with this component. REQUIRED MATERIALS: notebook, pencil, calculator, agenda book #936 MATH 10 SMALL GROUP GRADE: 10 LEVEL: Small Group CREDITS: 10 PREREQUISITE:Individualized Educational Plan with this component BASIC TEXT: Algebra, Prentice Hall Informal Geometry, Prentice Hall, 1992

More information

Enhanced Web Log Based Recommendation by Personalized Retrieval

Enhanced Web Log Based Recommendation by Personalized Retrieval Enhanced Web Log Based Recommendation by Personalized Retrieval Xueping Peng FACULTY OF ENGINEERING AND INFORMATION TECHNOLOGY UNIVERSITY OF TECHNOLOGY, SYDNEY A thesis submitted for the degree of Doctor

More information

"Charting the Course to Your Success!" MOC D Querying Microsoft SQL Server Course Summary

Charting the Course to Your Success! MOC D Querying Microsoft SQL Server Course Summary Course Summary Description This 5-day instructor led course provides students with the technical skills required to write basic Transact-SQL queries for Microsoft SQL Server 2014. This course is the foundation

More information

The Automatic Design of Batch Processing Systems

The Automatic Design of Batch Processing Systems The Automatic Design of Batch Processing Systems by Barry Dwyer, M.A., D.A.E., Grad.Dip. A thesis submitted for the degree of Doctor of Philosophy in the Department of Computer Science University of Adelaide

More information

Contributions to pairing-based cryptography

Contributions to pairing-based cryptography University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2010 Contributions to pairing-based cryptography Tsz Hon Yuen University

More information

TABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. ABSTRACT 5 LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS xxi

TABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. ABSTRACT 5 LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS xxi ix TABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. ABSTRACT 5 LIST OF TABLES xv LIST OF FIGURES xviii LIST OF SYMBOLS AND ABBREVIATIONS xxi 1 INTRODUCTION 1 1.1 INTRODUCTION 1 1.2 WEB CACHING 2 1.2.1 Classification

More information

Secure communication over mobile ad-hoc network

Secure communication over mobile ad-hoc network University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2009 Secure communication over mobile ad-hoc network Zhenfei Zhang

More information

PROBLEM SOLVING WITH FORTRAN 90

PROBLEM SOLVING WITH FORTRAN 90 David R. Brooks PROBLEM SOLVING WITH FORTRAN 90 FOR SCIENTISTS AND ENGINEERS Springer Contents Preface v 1.1 Overview for Instructors v 1.1.1 The Case for Fortran 90 vi 1.1.2 Structure of the Text vii

More information

A Frequent Max Substring Technique for. Thai Text Indexing. School of Information Technology. Todsanai Chumwatana

A Frequent Max Substring Technique for. Thai Text Indexing. School of Information Technology. Todsanai Chumwatana School of Information Technology A Frequent Max Substring Technique for Thai Text Indexing Todsanai Chumwatana This thesis is presented for the Degree of Doctor of Philosophy of Murdoch University May

More information

Clustering Billions of Images with Large Scale Nearest Neighbor Search

Clustering Billions of Images with Large Scale Nearest Neighbor Search Clustering Billions of Images with Large Scale Nearest Neighbor Search Ting Liu, Charles Rosenberg, Henry A. Rowley IEEE Workshop on Applications of Computer Vision February 2007 Presented by Dafna Bitton

More information

6th Grade Report Card Mathematics Skills: Students Will Know/ Students Will Be Able To...

6th Grade Report Card Mathematics Skills: Students Will Know/ Students Will Be Able To... 6th Grade Report Card Mathematics Skills: Students Will Know/ Students Will Be Able To... Report Card Skill: Use ratio reasoning to solve problems a ratio compares two related quantities ratios can be

More information

Lecture : Topological Space

Lecture : Topological Space Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous

More information

Computer Programming C++ (wg) CCOs

Computer Programming C++ (wg) CCOs Computer Programming C++ (wg) CCOs I. The student will analyze the different systems, and languages of the computer. (SM 1.4, 3.1, 3.4, 3.6) II. The student will write, compile, link and run a simple C++

More information

Dissertation Title. Royal Holloway logo guidelines. Dissertation Subtitle. Stephen D. Wolthusen

Dissertation Title. Royal Holloway logo guidelines. Dissertation Subtitle. Stephen D. Wolthusen Dissertation Title Dissertation Subtitle Stephen D. Wolthusen Thesis submitted to the University of London for the degree of Doctor of Philosophy Royal Holloway logo guidelines 2012 Standard logo The logo

More information

Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics , Fall Instructor: prof. János Pach Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,

More information

Child Prime Label Approaches to Evaluate XML Structured Queries

Child Prime Label Approaches to Evaluate XML Structured Queries Child Prime Label Approaches to Evaluate XML Structured Queries Shtwai Abdullah Alsubai Department of Computer Science the University of Sheffield This thesis is submitted for the degree of Doctor of Philosophy

More information

Prentice Hall Pre-Algebra 2004 Correlated to: Hawaii Mathematics Content and Performance Standards (HCPS) II (Grades 9-12)

Prentice Hall Pre-Algebra 2004 Correlated to: Hawaii Mathematics Content and Performance Standards (HCPS) II (Grades 9-12) Hawaii Mathematics Content and Performance Standards (HCPS) II (Grades 9-12) NUMBER AND OPERATIONS STANDARD 1: Students understand numbers, ways of representing numbers, relationships among numbers, and

More information

A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions

A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions 1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =

More information

Embedded lossless audio coding using linear prediction and cascade coding

Embedded lossless audio coding using linear prediction and cascade coding University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2005 Embedded lossless audio coding using linear prediction and

More information

Middle School Math Course 3

Middle School Math Course 3 Middle School Math Course 3 Correlation of the ALEKS course Middle School Math Course 3 to the Texas Essential Knowledge and Skills (TEKS) for Mathematics Grade 8 (2012) (1) Mathematical process standards.

More information

Interactive Math Glossary Terms and Definitions

Interactive Math Glossary Terms and Definitions Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the

More information

Integrated Algebra 2 and Trigonometry. Quarter 1

Integrated Algebra 2 and Trigonometry. Quarter 1 Quarter 1 I: Functions: Composition I.1 (A.42) Composition of linear functions f(g(x)). f(x) + g(x). I.2 (A.42) Composition of linear and quadratic functions II: Functions: Quadratic II.1 Parabola The

More information

Odd-Numbered Answers to Exercise Set 1.1: Numbers

Odd-Numbered Answers to Exercise Set 1.1: Numbers Odd-Numbered Answers to Exercise Set.: Numbers. (a) Composite;,,, Prime Neither (d) Neither (e) Composite;,,,,,. (a) 0. 0. 0. (d) 0. (e) 0. (f) 0. (g) 0. (h) 0. (i) 0.9 = (j). (since = ) 9 9 (k). (since

More information

FORMULATION AND BENEFIT ANALYSIS OF OPTIMIZATION MODELS FOR NETWORK RECOVERY DESIGN

FORMULATION AND BENEFIT ANALYSIS OF OPTIMIZATION MODELS FOR NETWORK RECOVERY DESIGN FORMULATION AND BENEFIT ANALYSIS OF OPTIMIZATION MODELS FOR NETWORK RECOVERY DESIGN Approved by: Dr. Richard Barr Dr. Eli Olinick Dr. Marion Sobol Dr. Jerrell Stracener Dr. Stephen A. Szygenda FORMULATION

More information

CS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T

CS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T CS 1200 Discrete Math A.R. Hurson 323 CS Building, Missouri S&T hurson@mst.edu 1 Course Objective: Mathematical way of thinking in order to solve problems 2 Variable: holder. A variable is simply a place

More information

QED Q: Why is it called the triangle inequality? A: Analogue with euclidean distance in the plane: picture Defn: Minimum Distance of a code C:

QED Q: Why is it called the triangle inequality? A: Analogue with euclidean distance in the plane: picture Defn: Minimum Distance of a code C: Lecture 3: Lecture notes posted online each week. Recall Defn Hamming distance: for words x = x 1... x n, y = y 1... y n of the same length over the same alphabet, d(x, y) = {1 i n : x i y i } i.e., d(x,

More information

The Further Mathematics Support Programme

The Further Mathematics Support Programme Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements

More information

Table Of Contents: xix Foreword to Second Edition

Table Of Contents: xix Foreword to Second Edition Data Mining : Concepts and Techniques Table Of Contents: Foreword xix Foreword to Second Edition xxi Preface xxiii Acknowledgments xxxi About the Authors xxxv Chapter 1 Introduction 1 (38) 1.1 Why Data

More information

This image cannot currently be displayed. Course Catalog. Pre-algebra Glynlyon, Inc.

This image cannot currently be displayed. Course Catalog. Pre-algebra Glynlyon, Inc. This image cannot currently be displayed. Course Catalog Pre-algebra 2016 Glynlyon, Inc. Table of Contents COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS...

More information

Agile Mind Mathematics 6 Scope and Sequence, Indiana Academic Standards for Mathematics

Agile Mind Mathematics 6 Scope and Sequence, Indiana Academic Standards for Mathematics In the three years prior Grade 6, students acquired a strong foundation in numbers and operations, geometry, measurement, and data. Students are fluent in multiplication of multi-digit whole numbers and

More information

Grade 6 Math Curriculum Sequence School Year

Grade 6 Math Curriculum Sequence School Year Grade 6 Math Curriculum Sequence School Year 2010-2011 QUARTER 1 (Aug 30 Nov 5) 45 days BENCHMARK A (same skills as June Benchmark in previous grade) UNIT 1: Fractions 1 Review Add and Subtract Fractions

More information

A Simplified Abstract Syntax for the Dataflow Algebra. A. J. Cowling

A Simplified Abstract Syntax for the Dataflow Algebra. A. J. Cowling Verification and Testing Research Group, Department of Computer Science, University of Sheffield, Regent Court, 211, Portobello Street, Sheffield, S1 4DP, United Kingdom Email: A.Cowling @ dcs.shef.ac.uk

More information

"Charting the Course... Agile Database Design Techniques Course Summary

Charting the Course... Agile Database Design Techniques Course Summary Course Summary Description This course provides students with the skills necessary to design databases using Agile design techniques. It is based on the Scott Ambler book Agile Database Techniques: Effective

More information

CCSSM Curriculum Analysis Project Tool 1 Interpreting Functions in Grades 9-12

CCSSM Curriculum Analysis Project Tool 1 Interpreting Functions in Grades 9-12 Tool 1: Standards for Mathematical ent: Interpreting Functions CCSSM Curriculum Analysis Project Tool 1 Interpreting Functions in Grades 9-12 Name of Reviewer School/District Date Name of Curriculum Materials:

More information

University of Moratuwa

University of Moratuwa University of Moratuwa Guidelines on Documentation and Submission of Theses and Dissertations 1. INTRODUCTION A dissertation is an essay advancing a new point of view resulting from research as a requirement

More information

Curriculum Catalog

Curriculum Catalog 2017-2018 Curriculum Catalog 2017 Glynlyon, Inc. Table of Contents MATHEMATICS 800 FUNDAMENTALS COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS... 2 UNIT

More information

SWALLOW SCHOOL DISTRICT CURRICULUM GUIDE. Stage 1: Desired Results

SWALLOW SCHOOL DISTRICT CURRICULUM GUIDE. Stage 1: Desired Results SWALLOW SCHOOL DISTRICT CURRICULUM GUIDE Curriculum Area: Math Course Length: Full Year Grade: 5th Date Last Approved: June 2015 Stage 1: Desired Results Course Description and Purpose: 5th grade offers

More information

Topological space - Wikipedia, the free encyclopedia

Topological space - Wikipedia, the free encyclopedia Page 1 of 6 Topological space From Wikipedia, the free encyclopedia Topological spaces are mathematical structures that allow the formal definition of concepts such as convergence, connectedness, and continuity.

More information

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.

More information

Computer Experiments. Designs

Computer Experiments. Designs Computer Experiments Designs Differences between physical and computer Recall experiments 1. The code is deterministic. There is no random error (measurement error). As a result, no replication is needed.

More information

INTELLIGENT NON-DESTRUCTIVE CLASSIFICATION OF JOSAPINE PINEAPPLE MATURITY USING ARTIFICIAL NEURAL NETWORK

INTELLIGENT NON-DESTRUCTIVE CLASSIFICATION OF JOSAPINE PINEAPPLE MATURITY USING ARTIFICIAL NEURAL NETWORK INTELLIGENT NON-DESTRUCTIVE CLASSIFICATION OF JOSAPINE PINEAPPLE MATURITY USING ARTIFICIAL NEURAL NETWORK NAZRIYAH BINTI HAJI CHE ZAN @ CHE ZAIN MASTER OF ENGINEERING (ELECTRONICS) UNIVERSITI MALAYSIA

More information

TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.

TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead

More information

DISCRETE MATHEMATICS

DISCRETE MATHEMATICS DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The

More information

TABLE OF CONTENTS CHAPTER NO. TITLE PAGENO. LIST OF TABLES LIST OF FIGURES LIST OF ABRIVATION

TABLE OF CONTENTS CHAPTER NO. TITLE PAGENO. LIST OF TABLES LIST OF FIGURES LIST OF ABRIVATION vi TABLE OF CONTENTS ABSTRACT LIST OF TABLES LIST OF FIGURES LIST OF ABRIVATION iii xii xiii xiv 1 INTRODUCTION 1 1.1 WEB MINING 2 1.1.1 Association Rules 2 1.1.2 Association Rule Mining 3 1.1.3 Clustering

More information

Efficient Index Maintenance for Text Databases

Efficient Index Maintenance for Text Databases Efficient Index Maintenance for Text Databases A thesis submitted for the degree of Doctor of Philosophy Nicholas Lester B.E. (Hons.), B.Sc, School of Computer Science and Information Technology, Science,

More information

INTRODUCTION Background of the Problem Statement of the Problem Objectives of the Study Significance of the Study...

INTRODUCTION Background of the Problem Statement of the Problem Objectives of the Study Significance of the Study... vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION... ii DEDICATION... iii ACKNOWLEDGEMENTS... iv ABSTRACT... v ABSTRAK... vi TABLE OF CONTENTS... vii LIST OF TABLES... xii LIST OF FIGURES... xiii LIST

More information

Brief Contents. Foreword by Sarah Frostenson...xvii. Acknowledgments... Introduction... xxiii. Chapter 1: Creating Your First Database and Table...

Brief Contents. Foreword by Sarah Frostenson...xvii. Acknowledgments... Introduction... xxiii. Chapter 1: Creating Your First Database and Table... Brief Contents Foreword by Sarah Frostenson....xvii Acknowledgments... xxi Introduction... xxiii Chapter 1: Creating Your First Database and Table... 1 Chapter 2: Beginning Data Exploration with SELECT...

More information

Integrated Math 1. Integrated Math, Part 1

Integrated Math 1. Integrated Math, Part 1 Integrated Math 1 Course Description: This Integrated Math course will give students an understanding of the foundations of Algebra and Geometry. Students will build on an an understanding of variables,

More information

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below: Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have

More information

Prentice Hall. Connected Mathematics 2, 6th Grade Units Mississippi Mathematics Framework 2007 Revised, Grade 6

Prentice Hall. Connected Mathematics 2, 6th Grade Units Mississippi Mathematics Framework 2007 Revised, Grade 6 Prentice Hall Connected Mathematics 2, 6th Grade Units 2006 C O R R E L A T E D T O Mississippi Mathematics Framework 2007 Revised, Grade 6 NUMBER AND OPERATIONS 1. Analyze numbers using place value and

More information

The adaptive serializable snapshot isolation protocol for managing database transactions

The adaptive serializable snapshot isolation protocol for managing database transactions University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2007 The adaptive serializable snapshot isolation protocol for

More information

JULY GRADE 6(MATHEMATICS) OBJECTIVE LEARNER PROFILE ATL INTERDISCIPLINARY TOPIC- NUMBER. Topic-1

JULY GRADE 6(MATHEMATICS) OBJECTIVE LEARNER PROFILE ATL INTERDISCIPLINARY TOPIC- NUMBER. Topic-1 JULY GRADE 6(MATHEMATICS) OBJECTIVE LEARNER PROFILE ATL INTERDISCIPLINARY TOPIC- NUMBER Topic-1 Topic - 1 Topic- 1 Topic-1 Significant Concepts- We depend on numbers everyday and we need to understand

More information

Math Curriculum Guide PK-8

Math Curriculum Guide PK-8 Math Curriculum Guide July 2013 PK-8 Archdiocese of Oklahoma City Department of Catholic Education P.O. Box 32180 7501 Northwest Expressway Oklahoma City, Oklahoma 73123-0380 405.721.4202 PreK through

More information

Skew propagation time

Skew propagation time Graduate Theses and Dissertations Graduate College 015 Skew propagation time Nicole F. Kingsley Iowa State University Follow this and additional works at: http://lib.dr.iastate.edu/etd Part of the Applied

More information

Foundation. Scheme of Work. Year 9. September 2016 to July 2017

Foundation. Scheme of Work. Year 9. September 2016 to July 2017 Foundation Scheme of Work Year 9 September 06 to July 07 Assessments Students will be assessed by completing two tests (topic) each Half Term. These are to be recorded on Go Schools. There will not be

More information

Mathematics - LV 6 Correlation of the ALEKS course Mathematics MS/LV 6 to the State of Texas Assessments of Academic Readiness (STAAR) for Grade 6

Mathematics - LV 6 Correlation of the ALEKS course Mathematics MS/LV 6 to the State of Texas Assessments of Academic Readiness (STAAR) for Grade 6 Mathematics - LV 6 Correlation of the ALEKS course Mathematics MS/LV 6 to the State of Texas Assessments of Academic Readiness (STAAR) for Grade 6 Number, Operation, and Quantitative Reasoning. 6.1.A:

More information

AAM Guide for Authors

AAM Guide for Authors ISSN: 1932-9466 AAM Guide for Authors Application and Applied Mathematics: An International Journal (AAM) invites contributors from throughout the world to submit their original manuscripts for review

More information

Anadarko Public Schools MATH Power Standards

Anadarko Public Schools MATH Power Standards Anadarko Public Schools MATH Power Standards Kindergarten 1. Say the number name sequence forward and backward beginning from a given number within the known sequence (counting on, spiral) 2. Write numbers

More information

Aston Hall s A-Z of mathematical terms

Aston Hall s A-Z of mathematical terms Aston Hall s A-Z of mathematical terms The following guide is a glossary of mathematical terms, covering the concepts children are taught in FS2, KS1 and KS2. This may be useful to clear up any homework

More information

Data Mining. 3.5 Lazy Learners (Instance-Based Learners) Fall Instructor: Dr. Masoud Yaghini. Lazy Learners

Data Mining. 3.5 Lazy Learners (Instance-Based Learners) Fall Instructor: Dr. Masoud Yaghini. Lazy Learners Data Mining 3.5 (Instance-Based Learners) Fall 2008 Instructor: Dr. Masoud Yaghini Outline Introduction k-nearest-neighbor Classifiers References Introduction Introduction Lazy vs. eager learning Eager

More information

NFC ACADEMY MATH 600 COURSE OVERVIEW

NFC ACADEMY MATH 600 COURSE OVERVIEW NFC ACADEMY MATH 600 COURSE OVERVIEW Math 600 is a full-year elementary math course focusing on number skills and numerical literacy, with an introduction to rational numbers and the skills needed for

More information

8 th Grade Pre-Integrated Math

8 th Grade Pre-Integrated Math Use order of operations Evaluate expressions Use integers and absolute value Add integers Subtract integers Use inductive reasoning Multiply and divide integers Use properties of numbers Simplify variable

More information

Middle School Math Course 2

Middle School Math Course 2 Middle School Math Course 2 Correlation of the ALEKS course Middle School Math Course 2 to the Indiana Academic Standards for Mathematics Grade 7 (2014) 1: NUMBER SENSE = ALEKS course topic that addresses

More information

Introduction to PTC Windchill ProjectLink 11.0

Introduction to PTC Windchill ProjectLink 11.0 Introduction to PTC Windchill ProjectLink 11.0 Overview Course Code Course Length TRN-4756-T 8 Hours In this course, you will learn how to participate in and manage projects using Windchill ProjectLink

More information

(Cover Page) TITLE OF THE THESIS TITLE OF THE THESIS TITLE OF THE THESIS (Not more than 3 lines. CAPS Times New Roman Font size 20)

(Cover Page) TITLE OF THE THESIS TITLE OF THE THESIS TITLE OF THE THESIS (Not more than 3 lines. CAPS Times New Roman Font size 20) (Cover Page) (Not more than 3 lines. CAPS Times New Roman Font size 20) A Thesis submitted by Dr./ Mr. / Ms [Full Name with Initials (if any)] (US No..) to NITTE (DEEMED TO BE UNIVERSITY) (Estd under Section

More information

PITSCO Math Individualized Prescriptive Lessons (IPLs)

PITSCO Math Individualized Prescriptive Lessons (IPLs) Orientation Integers 10-10 Orientation I 20-10 Speaking Math Define common math vocabulary. Explore the four basic operations and their solutions. Form equations and expressions. 20-20 Place Value Define

More information

Curriculum Connections (Fractions): K-8 found at under Planning Supports

Curriculum Connections (Fractions): K-8 found at   under Planning Supports Curriculum Connections (Fractions): K-8 found at http://www.edugains.ca/newsite/digitalpapers/fractions/resources.html under Planning Supports Kindergarten Grade 1 Grade 2 Grade 3 Grade 4 Grade 5 Grade

More information

CITY UNIVERSITY OF NEW YORK. Creating a New Project in IRBNet. i. After logging in, click Create New Project on left side of the page.

CITY UNIVERSITY OF NEW YORK. Creating a New Project in IRBNet. i. After logging in, click Create New Project on left side of the page. CITY UNIVERSITY OF NEW YORK Creating a New Project in IRBNet i. After logging in, click Create New Project on left side of the page. ii. Enter the title of the project, the principle investigator s (PI)

More information

Contributions to image encryption and authentication

Contributions to image encryption and authentication University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2003 Contributions to image encryption and authentication T. Uehara

More information

Inside Microsoft* SQL Server 2008: T-SQL Querying

Inside Microsoft* SQL Server 2008: T-SQL Querying Microsoft Inside Microsoft* SQL Server 2008: T-SQL Querying Itzik Ben-Gan Lubor Kollor Dejan Sarka Steve Kass Table of Contents Foreword Acknowledgments Introduction xiii xv xix 1 Logical Query Processing

More information

Mathematics. Scheme of Work. Year 7. New Mathematics Framework

Mathematics. Scheme of Work. Year 7. New Mathematics Framework Mathematics Scheme of Work Year 7 New Mathematics Framework 1 YEAR 7: Overview of year 7 scheme of work YEAR 7 Topics Assessment Tests Term 1 Algebra 1 Number 1 Geometry and Measures 1 Test 1 Sequences

More information

Mechanism Design using Creo Parametric 3.0

Mechanism Design using Creo Parametric 3.0 Mechanism Design using Creo Parametric 3.0 Overview Course Code Course Length TRN-4521-T 1 Day In this course, you will learn about creating mechanism connections, configuring the mechanism model, creating

More information

Students will understand 1. that numerical expressions can be written and evaluated using whole number exponents

Students will understand 1. that numerical expressions can be written and evaluated using whole number exponents Grade 6 Expressions and Equations Essential Questions: How do you use patterns to understand mathematics and model situations? What is algebra? How are the horizontal and vertical axes related? How do

More information

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1

More information

Curriculum Catalog

Curriculum Catalog 2018-2019 Curriculum Catalog Table of Contents MATHEMATICS 800 COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS... 3 UNIT 3: MODELING PROBLEMS WITH RATIONAL

More information

COMMUNITY UNIT SCHOOL DISTRICT 200

COMMUNITY UNIT SCHOOL DISTRICT 200 COMMUNITY UNIT SCHOOL DISTRICT 200 Regular Math Middle School Grade 8 1. Subject Expectation (State Goal 6) Essential Learning 1 (Learning Standard A) (Learning Standard D) Students will be able to demonstrate

More information

York Public Schools Subject Area: Mathematics Course: 6 th Grade Math NUMBER OF DAYS TAUGHT DATE

York Public Schools Subject Area: Mathematics Course: 6 th Grade Math NUMBER OF DAYS TAUGHT DATE 6.1.1.d 6.EE.A.1 Represent large numbers using exponential notation (i.e.. 10x10x10x10x10) (Review PV chart first) Write evaluate numerical expressions involving whole number exponents 5 days August, Lesson

More information

Compute fluently with multi-digit numbers and find common factors and multiples.

Compute fluently with multi-digit numbers and find common factors and multiples. Academic Year: 2014-2015 Site: Stork Elementary Course Plan: 6th Grade Math Unit(s): 1-10 Unit 1 Content Cluster: Compute fluently with multi-digit numbers and find common factors and multiples. Domain:

More information

LECTURE 8: SETS. Software Engineering Mike Wooldridge

LECTURE 8: SETS. Software Engineering Mike Wooldridge LECTURE 8: SETS Mike Wooldridge 1 What is a Set? The concept of a set is used throughout mathematics; its formal definition matches closely our intuitive understanding of the word. Definition: A set is

More information

MATHS. years 4,5,6. malmesbury c of e primary school NAME CLASS

MATHS. years 4,5,6. malmesbury c of e primary school NAME CLASS MATHS years 4,5,6 NAME CLASS malmesbury c of e primary school LEARNING LADDERS CONTENTS Ladder Title Times Tables Addition Subtraction Multiplication Division Fractions Decimals Percentage and Ratio Problem

More information

Big Data Management and NoSQL Databases

Big Data Management and NoSQL Databases NDBI040 Big Data Management and NoSQL Databases Lecture 10. Graph databases Doc. RNDr. Irena Holubova, Ph.D. holubova@ksi.mff.cuni.cz http://www.ksi.mff.cuni.cz/~holubova/ndbi040/ Graph Databases Basic

More information

Year 3 Number Number and place Number Addition and Number Multiplication Number Fractions value subtraction and division

Year 3 Number Number and place Number Addition and Number Multiplication Number Fractions value subtraction and division Year 3 Number Number and place value count from 0 in multiples of 4, 8, 50 and 100; find 10 or 100 more or less than a given Number recognise the place value of each digit in a threedigit number (hundreds,

More information

Installing and Administering a Satellite Environment

Installing and Administering a Satellite Environment IBM DB2 Universal Database Installing and Administering a Satellite Environment Version 8 GC09-4823-00 IBM DB2 Universal Database Installing and Administering a Satellite Environment Version 8 GC09-4823-00

More information

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS Contents Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS 1.1. INTRODUCTION TO COMPUTERS... 1 1.2. HISTORY OF C & C++... 3 1.3. DESIGN, DEVELOPMENT AND EXECUTION OF A PROGRAM... 3 1.4 TESTING OF PROGRAMS...

More information

Math 7 Glossary Terms

Math 7 Glossary Terms Math 7 Glossary Terms Absolute Value Absolute value is the distance, or number of units, a number is from zero. Distance is always a positive value; therefore, absolute value is always a positive value.

More information

SHAPE, SPACE & MEASURE

SHAPE, SPACE & MEASURE STAGE 1 Know the place value headings up to millions Recall primes to 19 Know the first 12 square numbers Know the Roman numerals I, V, X, L, C, D, M Know the % symbol Know percentage and decimal equivalents

More information

6th Grade P-AP Math Algebra

6th Grade P-AP Math Algebra 6th Grade P-AP Math Algebra If your student is considering a jump from 6th grade P-AP to 7th Grade Advanced math, please be advised of the following gaps in instruction. None of the 7th or 8th grade mathematics

More information