Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.
2 Pages
semanticweb
Course: CPS 049, Spring 2009School: Duke
Rating:
Document Preview
Search Perfect Semantic Web RDF Objects, relationships Reasoning Examples Dbpedia Vs. Wikipedia Del.icio.us How is this possible: Need taxonomy --- Directory, Folksonomy IBMs WebFountain What Paul Ford has to say What is the use of the Semantic Web? Better search (there E-commerce is a downside as well) How Search is Evolving New search interfaces From a cell phone or personal device (remember...
Unformatted Document Excerpt
Coursehero >> North Carolina >> Duke >> CPS 049Course 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.
Search
Perfect Semantic Web
RDF Objects, relationships Reasoning
Examples
Dbpedia Vs. Wikipedia Del.icio.us
How is this possible:
Need taxonomy --- Directory, Folksonomy IBMs WebFountain What Paul Ford has to say
What is the use of the Semantic Web?
Better search (there E-commerce is a downside as well)
How Search is Evolving
New search interfaces
From a cell phone or personal device (remember the UPC scanning example ...
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:
Below is a small sample set of documents:
Duke - CPS - 049
Ashley Twichell Comp Sci 49S Scribe Notes 4/15 Perfect Search search today is not as good as it could be, for many reasons data is not just HTLM data Semantic Web best way to think about it is a web that solves the problem of being able to co
Duke - CPS - 049
Discussion January 16, 2007 The Database of Intentions: Chapter 1 Definitions and Introductory Notes o In 199 there were a lot of money focused mini inernet companies starting up which all went bankrupt after the hit on the business world on Septemb
CUNY Baruch - CIS - 739
A PPENDIX E The TCP/IP Protocol ArchitectureE.1 E.2 E.3 E.4TCP/IP LAYERS.2 TCP AND UDP ..3 OPERATION OF TCP/IP .4 TCP/IP APPLICATIONS.6William Stallings Copyright 2008Supplement to Computer Security: Principles and Practice William Stallings
Duke - CPS - 108
MVC reconsidered: Boggle and OOGAWhat are use-cases and scenarios for boggle (client POV) As visible timer ticks, what does user do? How does user interact with the game? What are different possibilities? Gui? Text? What should happen as user "e
Duke - CPS - 100
Binary TreesqqLinked lists have efficient insertion and deletion, but inefficient search Vector/array: search is efficient, insertion/deletion are not Binary trees are structures that yield efficient insertion, deletion, and search trees used
Duke - CPS - 108
CPS 108qReminder of PRO reasons to take the course (including) Programming, project, prolific, proficient, prodigious, process, procrastination, profound Some CON reasons Conceptual, condemnable, confusing, condensed, conscientious, contemptuous
Duke - CPS - 110
Virtual Memory and Demand PagingVirtual Memory Illustratedexecutable fileheader text idata data wdata symbol table, etc. program sectionsvirtual memory (big)text data BSS user stack args/envkernelphysical memory (small)backing storagepag
Duke - CPS - 100
What is Computer Science?What is it that distinguishes it from the separate subjects with which it is related? What is the linking thread which gathers these disparate branches into a single discipline? My answer to these questions is simple - it is
Duke - CPS - 100
Review of Data StructuresADTs: Abstract Data TypesWe've studied concrete data structures Vectors Homogeneous aggregates supporting random accessLinked lists Collections supporting constant-time insertionMultiset is an ADT Operations toget
Duke - CPS - 100
ADTs and vectors, towards linked listslLinked listslltvector is a class-based implementation of a lower-level data type called an array tvector grows dynamically (doubles in size as needed) when elements inserted with push_back tvector prot
Duke - CPS - 100
Graphs: Structures and AlgorithmslVocabularylHow do packets of bits/information get routed on the internet Message divided into packets on client (your) machine Packets sent out using routing tables toward destination Packets may take differ
CUNY Baruch - CIS - 718
NURUNNAHER SHIKHA CIS 718 EXPERT SYSTEM HW 1, DATE:10.25.05ACM Turing Award1966 A.J. Perlis Influence in the area of advanced programming techniques and compiler construction. 1967 Maurice V. Wilkes Known as the builder and designer of the EDSAC,
CUNY Baruch - CIS - 718
ACM Turing Award Recipients List Summary: Yuhang Jiang mike.jiang@gmail.com CIS718, 11/1/2005Yuhang Jiang CIS718, 11/1/2005 ACM Turing Award Summary: Award Winner Year Main Contribution A.J. Perlis 1966 advanced programming techniques and compiler
CUNY Baruch - CIS - 718
The Use of Expert Systems in Conservation Author: Lida Liberopoulou Introduction This project was the MSc Thesis for a Computing Science cource at Birkbeck College, London and was presented at the 1999 AI*IA "Intelligenza Artificiale per i Beni Cu
CUNY Baruch - CIS - 718
Sevda Mammadova Prof. D. Kopec2238 CIS 718SmartLaw: Adapting Classic Expert System Techniques For the Legal Research DomainSmartLaw is an Expert System that gives advice on legal research problems. It uses four level knowledge structure of rese
Duke - CPS - 108
Standard C Library Functions tmpnam(3C)NAME tmpnam, tmpnam_r, tempnam - create a name for a temporary fileSYNOPSIS #include <stdio.h> char *tmpnam(char *s); char *tmpnam_r(char *s);
CUNY Baruch - CC - 312
-BEGIN PGP PUBLIC KEY BLOCK-Version: PGP 8.1 - not licensed for commercial use: www.pgp.commQGiBEOQg8YRBADEU5fQHDlqNe6lE8Npyee8zu0CZt9nHUUZJ3L/fR4/4GYogk6ooB9xwLeypQ1oBUAWCIoqZFYaxE5+yCaBYW8xb5WSFJINJoA0qbPwlWXdLbGmwIKD/ebXaKHuwSqCuFnhaJ4WlhAjk7
CUNY Baruch - CS - 1007
CS1007 lecture #20 notestue 19 nov 2002 news streams files java.io package exceptions StringTokenizer formatting output reading: ch 10-11cs1007-fall2002-sklar-lect20 1streams (1).we've drawn a picture of input and output many
CUNY Baruch - CS - 1007
CS1007 lecture #5 notestue 17 sep 2002 news boolean expressions logical operators truth tables relational operators the if branching statement owcharts command line arguments System.exit() method reading: ch 3.1-3.4cs1007-fall2002-sklar-lect05
CUNY Baruch - CS - 1007
last time in cs1007.course objectives policies academic integrity resources WEB PAGE: http:/www.columbia.edu/cs1007 NOTE CHANGES IN ASSESSMENT 5 EXTRA CREDIT POINTS ADDEDcs1007-fall2002-sklar-lect02 1recitations.sign up for a recitatio
CUNY Baruch - CS - 3157
write(2)write(2)NAMEwrite, pwrite, writev - write on a fileSYNOPSIS#include <unistd.h> ssize_t write(int fildes, const void *buf , size_t nbyte); #include <sys/types.h> #include <unistd.h> ssize_t pwrite(int fildes, const void *buf , size_t n
CUNY Baruch - CS - 1007
CS1007 lecture #12 notestue 15 oct 2002 news objects classes constants methods (review) encapsulation and visibility (the public and private modifiers) instantiation (the static modifier) reading: ch 6.1-6.7cs1007-spring2002-sklar-lect12
CUNY Baruch - CS - 1007
CS1007 lecture #8 notesthu 26 sep 2002 news homework #2 due tue oct 1 homework #1 should be returned in recitation this week short quiz #1 today the java.util.Random class the java.util.Date class introduction to recursion method overloading read
Duke - CPS - 100
Balanced Search TreesBinary search trees keep keys ordered, with efficient lookup Insert, Delete, Find, all are O(log n) in average case Worst case is bad Compared to hashing? Advantages? Balanced trees are guaranteed O(log n) in the worst case
Duke - CPS - 150
cps150, Fall 2001homework-5Due Date: 1. Written Part Due on 11/02, Friday, in class. 2. Programming Part Due on 11/02, Friday, midnight. (Be aware that every problem involve implementation in Matlab). Part I: Sensitivity to perturbation We consid
Duke - CPS - 230
11AWw5f11IwXW1 ~1Y11A1A~wXw1 X11~kA1k`w17XwWA11`Xww05!1! X YXF Qc4baIVP HX E~w141I` XyefYXWAXw1 3V1UTTT5Q43HGw1W5#F1w1! ` # F FRSSSRP I F D
Duke - CPS - 216
Eddies: Continuously Adaptive Query Processingby Ron Avnur and Joseph M. HellersteinIntroductionLarge-scale query engines (WANs, clusters) must be able to perform robustly under changing conditions Telegraph is a system being developed to provide
Duke - CPS - 216
CPS 216 Fall 2001 Course Project Important Dates Milestone 1: Thursday, October 18 Milestone 2: Thursday, November 15 Project Demo and Presentation Period: December 3-7, 10-12 Final Project Report Due: Thursday, December 13 You can choose either one
Duke - CPS - 100
Balanced Search TreesqqBinary search trees keep keys ordered, with efficient lookup Insert, Delete, Find, all are O(log n) in average case Worst case is bad Compared to hashing? Advantages? Balanced trees are guaranteed O(log n) in the worst
Duke - CPS - 100
Efficient ProgrammingqSee readwords.cppqDesigning and building efficient programs efficiently requires knowledge and practice Hopefully the programming language helps, it's not intended to get in the way Object-oriented concepts, and more gen
Duke - CPS - 100
Sorting: From Theory to PracticeqWhy do we study sorting? Because we have to Because sorting is beautiful Because and There are n sorting algorithms, how many should we study? O(n), O(log n), Why do we study more than one algorithm? q
Duke - CPS - 100
Graphs: Structures and AlgorithmsHow do packets of bits/information get routed on the internet Message divided into packets on client (your) machine Packets sent out using routing tables toward destination Packets may take different routes to des
Duke - CPS - 100
CPS 100E - Program Design and Analysis I Prof. Rodger Section: Templates, Stacks, Queues handout Read W3, W6.1-6.3, W15, W11Overloading FunctionsFunctions can have the same name if they have di erent arguments. This is called overloading. When the
Duke - CPS - 100
CPS 100E - Program Design and Analysis I Prof. Rodger Section: Vectors in classes, Pointers handout Read A8.4, A12.1-12.3, W1 A class declaration does not create any memory. When variables of that type of class are de ned using the constructor then m
Duke - CPS - 100
CPS 100E - Program Design and Analysis I Prof. Rodger Section: Balanced Trees and Hu man Coding handout Read Chap 12.1Balanced TreesAVL Trees 2-3 trees, B-trees Red-Black TreeRed-Black TreeBinary search tree properties every node is red or blac
BYU - CATALOG - 0406
Programs of Study and Course DescriptionsFollowing is a list of undergraduate courses and programs for Stern College for Women and Sy Syms School of Business. Unless otherwise noted, courses meet for the same number of hours per week as the credit v
Duke - CPS - 100
From bits to bytes to intsHow are data stored?At some level everything is stored as either a zero or a one A bit is a binary digit a byte is a binary term (8 bits) We should be grateful we can deal with Strings rather than sequences of 0's
Duke - CPS - 100
Intro to GraphsDefinitions and VocabularyA graph consists of a set of vertices (or nodes) and a set of edges (or arcs) where each edge connects a pair of vertices. If the pair of vertices defining an edge is ordered, then it is a directed graph.
Duke - CPS - 100
Binary TreesLinked lists: efficient insertion/deletion, inefficient search ArrayList: search can be efficient, insertion/deletion not Binary trees: efficient insertion, deletion, and search trees used in many contexts, not just for searching, e.g.
Duke - CPS - 100
Graphical User Interfaces (GUIs) Components Flat Layouts Hierarchical Layouts Designing a GUI Coding a GUI(These notes come from CompSci 4, Java for Video Games)CompSci 100E30.1Components JLabel text/image display JTextField sin
Duke - CPS - 100
Inheritance and Interfaces Single inheritance in JavaInheritance models an "is-a" relationshipA class can extend only one class in Java A dog is a mammal, an ArrayList is a List, a square is a shape, Write general programs to understand
Duke - CPS - 100
Java 5 New Features Generics Generics Enhanced for loop Autoboxing/unboxing Typesafe enums Other Allows classes to store objects whose type is irrelevant to storing class, while allowing type-safe retrieval E.g., Collection SyntaxArr
Duke - CPS - 100
Binary TreesFrom doubly-linked lists to binary treesLinked lists: efficient insertion/deletion, inefficient search ArrayList: search can be efficient, insertion/deletion not Binary trees: efficient insertion, deletion, and search trees used i
Duke - CPS - 100
Balanced Binary Search TreesBalanced Binary Search TreesPathological BST Keeping BSTrees Balanced Insert nodes from ordered list Search: O(_) ? Binary Tree is balanced if height of left and right subtree differ by no more than one, recurs
BYU - CATALOG - 0204
Sy Syms School of Businessy Syms School of Business offers business programs for undergraduate men and women. It was established in 1987 through major gifts by Sy Syms, a member of the Universitys Board of Trustees, and other business leaders. The S
BYU - CATALOG - 0204
Irving I.Stone Beit Midrash ProgramEstablished in 1995, the Irving I. Stone Beit Midrash Program offers undergraduate men a structured Jewish studies program designed for students with special scheduling needs and interests. It maintains a high l
Duke - CPS - 100
Data and InformationOrganizing Data: ideas and issues!How and why do we organize data? Differences between data and information? What about knowledge?!Often there is a time/space tradeoff ! If we use more space (memory) we can solve a data/ i
Duke - CPS - 100
Loop Invariants!Bean Can game! !!Want to reason about the correctness of a proposed iterative solution Loop invariants provide a means to effectively about the correctness of codeCan contains N black beans and M white beans initially Emptie
Duke - CPS - 108
LibrariesqIn C+ it's possible to create static libraries and shared libraries Static libraries (end in .a) are combined/linked into an executable Executables are large. If library is updated in a binary compatible way, programs still need to be
Duke - CPS - 108
Overloading operatorsqWhy overload operators? (=, =, <, >, +=, ) notational convenience match user expectations because we can (except : and . and .*) Remember, overloaded operators are just function calls operands are parameters, thus subject
Duke - CPS - 108
Software DesignSee Alan Cooper, The Essentials of User Interface Design q who designs the software?Implentation modelworsebetterusers modelqqImplementation is view of software developer, users view is mental model, software designer ha
Duke - CPS - 100
Backtracking, Search, HeuristicsqClassic problem: N queensqMany problems require an approach similar to solving a maze Certain mazes can be solved using the "right-hand" rule Other mazes, e.g., with islands, require another approach If you h
Duke - CPS - 100
Heaps, Priority Queues, CompressionqPriority QueueqCompression is a high-profile application .zip, .mp3, .jpg, .gif, .gz, Why is compression important? Whats the difference between compression for .mp3 files and compression for .zip files?
Duke - CPS - 100
cps 100 "Green I do not Lack" as sung to the tune of Sir-mix alot's " Baby's got back" Intro-oh my god, Joey look at this apt it is so big uhh it looks like one of those big time programs but u know who understands those programs they only work becau
Duke - CPS - 140
CPS 140Project 3 Project Due: Saturday, April 24, 8am 50 pointsSpring 1999No LATE projects accepted after Thursday, April 29, 8am.The purpose of this assignment is to write an interpretor for the LSYS programming language see the project 1 and
Duke - CPS - 140
Section: Turing Machines Review Regular Languages FA, RG, RE recognize Context Free Languages PDA, CFG recognize1DFA:input tape a tape head current state 0 5 4 3 1 2 b b a bhead moves2Turing Machine:input tape a tape head current state
Duke - CPS - 140
CPS 140 - Mathematical Foundations of CS Dr. S. Rodger Section: The Structure of a Compiler 1.1 What is a Compiler? I. Translator Definition: program in language X - translator for X - program in language YExamples: Source Language High Level Assem
Duke - CPS - 140
CPS 140 - Mathematical Foundations of CS Dr. S. Rodger Section: Transforming Grammars Ch. 6 handoutMethods for Transforming Grammars Read Ch 6 in Linz BookWe will consider CFL without . It would be easy to add to any grammar by adding a new start
Duke - CPS - 140
Section: Turing Machines - Building Blocks 1. Given Turing Machines M1 and M2 Notation for Run M1 Run M2M1 M2SHSHM1M2SHz;z,Rz;z,LSHz represents any symbol in12. Given Turing Machines M1 and M2M1 M2SHSHM1x
Duke - CPS - 140
Grammars unrestricted grammarAutomata Turing machineAll Languages Rec. Enum. Lang.CFGContext-free Lang. Regular Lang.pushdown automataregular grammarfinite automata1Power of Machines automata Can do? FA PDA TM integers arith exprC
Duke - CPS - 140
CPS 140 - Mathematical Foundations of CS Dr. Susan Rodger Section: Introduction Ch. 1 handoutgrammarsall languagesautomataunrestricted grammarrecursively enumerable languagesTuring machineCFGcontext-free languages regular languagesp