Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
24 Cards in this Set
- Front
- Back
Dijkstra’s Algorithm
|
finding the “best” path through a graph or a specific item in a graph
|
|
Graph isomorphism
|
mapping one graph onto another
|
|
Ullman Algorithm (subgraph isomorphism)
|
finding one graph inside another
|
|
Depth-first search (breadth-first search)
|
searching through graphs for particular nodes or combinations of nodes
|
|
Adjacency matrix
|
means of representing which vertices of a graph are adjacent to which other vertices
|
|
Distance matrix
|
a matrix (two-dimensional array) containing the distances, taken pairwise, of a set of points.
|
|
physical
|
representation at the hardware level (e.g. how bits and bytes are stored, devices, etc)
|
|
logical
|
implements conceptual schema with a particular computer representation (e.g. XML, relational database)
|
|
conceptual
|
entities and their relationship in a particular domain (e.g. biology)
|
|
pitfalls to avoid in representation of human beings
|
embellishment of data, information destruction, clutter
|
|
structured data
|
The structured world includes formal models, databases, XML, etc. It is the traditional world of information systems. The structured environment is made up of data that has fields, columns, tables, rows and indexes. It centers around transactions and has reports, audits and definitions of words. There is a high degree of predictability and order associated with the structured environment.
|
|
unstructured data
|
The unstructured world includes tagging, folksonomies, Web 2.0, natural language processing, data mining, and so on. The unstructured environment has no particular order to it. It consists of text found in medical reports, warranties, contracts, e-mail and spreadsheets. The text has no rules governing its creation or usage. With text, there are no keys, no indexes, no columns or attributes. Text is free-form and is as disorderly as structured data is orderly."
|
|
1NF
|
No repeating rows (implies a Unique Key); no intrinsic important ordering of the rows or columns (doesn't matter what order they are returned in)
|
|
2NF
|
All fields in a table are dependent on the whole of a Candidate Key, not just part of it
|
|
3NF
|
All fields in a table are ONLY dependent on the whole of the candidate key.
|
|
VOIP
|
digital representation format specifically for voice
- delivery of voice communications over IP networks such as the Internet or other packet-switched networks |
|
row
|
tuple
|
|
column
|
attribute
|
|
public key cryptography
|
removes the need for an initial sharing of an encryption key
public key= encode key private key= decode key |
|
what can we represent with rdf
|
relational information or relationships
|
|
OWL
|
represents ontologies
OWL is for processing information on the web |
|
Dublin core
|
describing resources on the web in a standardized way
made up of 15 metadata elements that offer expanded cataloging information and improved document indexing for search engine programs |
|
FOAF
|
represents user generated content
community driven effort to define an RDF vocabulary or expressing metadata about people, and their relationships and activities. eliminates need for a centralized database |
|
chart junk
|
edward tufte
extraneous material on charts and graphs which cloud their meaning refers to all visual elments in charts and graphs that are not necessary to comprehend the information represented on the graph, or that distract from this information |