53 25 1292 998 false false 6 235130130 110220120 23520090 185140240 150190210 190190140 6 1303030 3012040 15013030 11570140 7080110 10011060 255255255 0 0 0 100 100 2267 1840 0 0 1 3 collection 0 13 9 1067 981 190190140 10011060 1 false false false false false 0 0 0 Helvetica Bold 22 000 10 0 0 0 00 1289 1078 0 0 5 110 collection 3 1 778 391 153 150190210 7080110 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Definitions - from wikipedia.org 501 1066 0 0 2 89 collection 3 1 582 391 190 150190210 7080110 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Meta Information 497 935 0 0 4 19 collection 3 403 43 648 888 150190210 7080110 1 false false false false false 0 9 0 dialog 12 000 10 0 0 0 00 Content Information 2247 1657 9 0 3 4 object 3 1 1 1050 36 1021020 11570140 1 false false false false true 0 0 0 Helvetica Bold 24 000 10 0 0 0 00 1 Don't Link Me In: Set Based Hypermedia for Taxonomic Reasoning 5 collection 3 1 43 391 533 150190210 7080110 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Author Information 1102 781 0 0 3 112 object 110 2 49 373 72 23520090 15013030 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 In mathematics and computer science, ... a graph is a set of objects called vertices connected by links called edges. Typically, a graph is depicted as a set of dots (the vertices) connected by lines (the edges). 111 object 110 2 1 374 44 23520090 15013030 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 In mathematics, the arity of a function or an operator is the number of arguments or operands it takes 90 object 89 2 54 374 27 23520090 15013030 1 false false false false true 0 0 0 Dialog 12 000 10 0 0 0 00 1 Date: December, 1991 74 object 89 2 1 374 45 23520090 15013030 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Title:Don't Link Me In: Set Based Hypermedia for Taxonomic Reasoning 92 object 89 2 128 374 29 23520090 15013030 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Publisher: ACM 91 object 89 2 90 374 29 23520090 15013030 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Published in: Hypertext '91 Proceedings 95 collection 19 12 479 629 367 23520090 15013030 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Tools 1152 1085 0 0 6 88 collection 19 11 362 630 108 23520090 15013030 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Taxonomic Reasoning 1149 741 0 0 2 75 collection 19 11 0 631 356 23520090 15013030 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Two models of Hypertext 1147 607 0 0 2 109 object 95 1 295 614 30 204175240 11570140 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Set-based includes links of arbitrary arity (link travel results in set, not another node) 108 object 95 1 259 614 30 204175240 11570140 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Graph-based includes the concept of an anchor (multiple links originate at different points in one node) 107 object 95 1 224 614 30 204175240 11570140 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Both use same concept of node 106 object 95 1 188 614 31 185140240 11570140 1 false false false false true 0 0 0 Dialog 16 000 10 0 0 0 00 1 MODEL COMPARISON 96 collection 95 1 0 304 182 190190140 10011060 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Existing Tools 831 885 0 0 3 97 collection 95 313 0 302 182 190190140 10011060 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 HyperSets 1167 1860 0 0 4 101 object 96 0 108 291 41 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Hypercube Topologies: useful for finding characteristics that distinguish items, but difficult to process as classes 99 object 96 0 61 291 41 190190140 10011060 1 false false false false true 0 0 0 Dialog 12 000 10 0 0 0 00 1 Graph-based Hypermedia: difficult to perform set operations (show all members NOT in a set) 98 object 96 0 0 291 56 190190140 10011060 1 false false false false true 0 0 0 Dialog 12 000 10 0 0 0 00 1 Databases: poor interaction technique with data (form or query language); assumption of clearly defined fields in separate process from data entry 102 object 97 1 0 288 36 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Fundamental entities are sets, each containing zero or more artifacts (nodes) 105 object 97 1 115 288 36 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Supports union, intersection, complement, and symmetric difference operations 104 object 97 1 77 288 35 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Browsing happens not from node to node, but from artifact to set to artifact 103 object 97 1 39 288 35 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Initial view presents selectable list of all artifacts and defined sets 93 object 88 2 0 615 42 190190140 10011060 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Related objects are all very similar; Various dimensions of data definition emerge through the reasoning process 94 object 88 2 46 615 29 190190140 10011060 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Basic activities are essentially set operations (sorting, creating sub-sets, finding intersections, etc) 76 collection 75 3 1 296 323 190190140 10011060 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Hypertext as graph 822 512 0 0 2 77 collection 75 307 1 310 323 190190140 10011060 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Hypertext as intersecting sets 1125 504 0 0 2 13 object 76 14 0 257 64 190190140 10011060 5 false false false false true 0 0 0 Dialog 12 000 10 0 0 0 00 3 Documents are nodes; Travel between documents happens along the edges of the graph 79 collection 76 0 71 284 217 190190140 10011060 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Examples: 817 533 0 0 3 87 object 79 2 86 269 89 190190140 10011060 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Any system in which the associations between the objects are based on characteristics that are similar (where objects are mostly different, and shared characteristics create the link) 86 object 79 2 38 269 39 190190140 10011060 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 Card-based Hypertext systems, such as NoteCard 85 object 79 2 2 269 29 190190140 10011060 1 false false false false true 0 0 0 dialog 12 000 10 0 0 0 00 1 The World Wide Web 78 object 77 18 0 257 64 190190140 10011060 5 false false false false true 0 0 0 Dialog 12 000 10 0 0 0 00 2 Documents are grouped items in a set; Allows for collections of documents viewable as a single entity; 80 collection 77 2 70 294 218 190190140 10011060 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Examples: 1132 600 0 0 4 81 object 80 4 2 277 38 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Biologist with specimens, creating collections of like fungi through similar properties 84 object 80 3 121 277 62 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Any scenario in which the associations between objects are based more on their differences than their similarities (where objects have most characteristics in common) 83 object 80 3 79 277 38 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Consulting service organizing field reports from manufacturing audits 82 object 80 4 46 277 27 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 Linguist classifying a newly discovered language 6 collection 5 0 42 375 224 23520090 15013030 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Education 540 495 0 0 5 2 object 5 0 0 376 38 23520090 15013030 1 false false false false true 0 0 0 Dialog 20 000 10 0 0 0 00 1 H. Van Dyke Parunak 7 collection 5 0 270 375 231 23520090 15013030 1 false false false false false 0 0 0 dialog 12 000 10 0 0 0 00 Bio 491 717 0 0 6 11 object 6 0 165 362 26 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 AB (1969): Physics (Princeton University) 10 object 6 0 133 362 28 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 ThM (1973): Old Testament (Dallas Theological Seminary) 9 object 6 0 88 361 40 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 MA (1978): Palestinian Archaeology and Geography (Institute of Holy Land Studies) 1 object 6 0 0 360 38 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 MS (1982): Computer and Communication Sciences (University of Michigan) 8 object 6 0 44 361 39 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 AM, PhD (1978): Near Eastern Languages and Civilizations (Harvard University) 12 object 7 0 0 362 27 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 1999-Present: Chief Scientist, Altarum Institute 18 object 7 0 172 362 27 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 140+ Publications, various editorial positions and committees 17 object 7 0 130 362 38 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 1978-1979: Associate Investigator, ?Computer Methods for Studying Structure in Biblical Hebrew?, Divinity School, Harvard University 16 object 7 0 90 362 37 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 1979-1982: Assistant Professor, Dept. of Near Eastern Studies, University of Michigan 15 object 7 0 60 362 27 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 1982-1984: Comshare, Inc. 14 object 7 0 30 362 27 190190140 10011060 1 false false false false true 0 0 0 Dialog 10 000 10 0 0 0 00 1 1984-1999: Industrial Technology Institute, Ann Arbor, MI 0 59 0 null 0 112 1 In mathematics and computer science, ... a graph is a set of objects called vertices connected by links called edges. Typically, a graph is depicted as a set of dots (the vertices) connected by lines (the edges). 0 AttrNum[0]END 58 0 null 0 111 1 In mathematics, the arity of a function or an operator is the number of arguments or operands it takes 0 AttrNum[0]END 57 0 null 0 110 0 0 AttrNum[0]END 56 0 null 0 83 1 Consulting service organizing field reports from manufacturing audits 0 AttrNum[0]END 55 0 null 0 82 1 Linguist classifying a newly discovered language 0 AttrNum[0]END 54 0 null 0 107 1 Both use same concept of node 0 AttrNum[0]END 53 0 null 0 106 1 MODEL COMPARISON 0 AttrNum[0]END 52 0 null 0 105 1 Supports union, intersection, complement, and symmetric difference operations 0 AttrNum[0]END 51 0 null 0 104 1 Browsing happens not from node to node, but from artifact to set to artifact 0 AttrNum[0]END 50 0 null 0 103 1 Initial view presents selectable list of all artifacts and defined sets 0 AttrNum[0]END 9 0 null 0 9 1 MA (1978): Palestinian Archaeology and Geography (Institute of Holy Land Studies) 0 AttrNum[0]END 8 0 null 0 8 1 AM, PhD (1978): Near Eastern Languages and Civilizations (Harvard University) 0 AttrNum[0]END 19 0 null 0 19 0 0 AttrNum[0]END 7 0 null 0 7 0 0 AttrNum[0]END 18 0 null 0 18 1 140+ Publications, various editorial positions and committees 0 AttrNum[0]END 6 0 null 0 6 0 0 AttrNum[0]END 17 0 null 0 17 0 1 AttrNum[1]END 1978-1979 String 0 0 1 Associate Investigator, ?Computer Methods for Studying Structure in Biblical Hebrew?, Divinity School, Harvard University 0 49 0 null 0 102 1 Fundamental entities are sets, each containing zero or more artifacts (nodes) 0 AttrNum[0]END 5 0 null 0 5 0 0 AttrNum[0]END 16 0 null 0 16 0 1 AttrNum[1]END 1979-1982 String 0 0 1 Assistant Professor, Dept. of Near Eastern Studies, University of Michigan 0 48 0 null 0 101 1 Hypercube Topologies: useful for finding characteristics that distinguish items, but difficult to process as classes 0 AttrNum[0]END 4 0 null 0 4 1 Don't Link Me In: Set Based Hypermedia for Taxonomic Reasoning 0 AttrNum[0]END 15 0 null 0 15 0 1 AttrNum[1]END 1982-1984 String 0 0 1 Comshare, Inc. 0 47 0 null 0 100 0 0 AttrNum[0]END 46 0 null 0 99 1 Graph-based Hypermedia: difficult to perform set operations (show all members NOT in a set) 0 AttrNum[0]END 3 0 null 0 3 0 0 AttrNum[0]END 14 0 null 0 14 0 1 AttrNum[1]END 1984-1999 String 0 0 1 Industrial Technology Institute, Ann Arbor, MI 0 45 0 null 0 98 0 1 AttrNum[1]END Databases String 0 0 1 poor interaction technique with data (form or query language); assumption of clearly defined fields in separate process from data entry 0 2 0 null 0 2 1 H. Van Dyke Parunak 0 AttrNum[0]END 13 0 null 0 13 3 Documents are nodes; Travel between documents happens along the edges of the graph 0 AttrNum[0]END 44 0 null 0 97 0 0 AttrNum[0]END 1 0 null 0 1 1 MS (1982): Computer and Communication Sciences (University of Michigan) 0 AttrNum[0]END 12 0 null 0 12 0 1 AttrNum[1]END 1999-Present String 0 0 1 Chief Scientist, Altarum Institute 0 43 0 null 0 96 0 0 AttrNum[0]END 0 ROOT 0 null 0 -1 0 0 AttrNum[0]END 11 0 null 0 11 1 AB (1969): Physics (Princeton University) 0 AttrNum[0]END 42 0 null 0 95 0 0 AttrNum[0]END 10 0 null 0 10 1 ThM (1973): Old Testament (Dallas Theological Seminary) 0 AttrNum[0]END 40 0 null 0 93 1 Related objects are all very similar; Various dimensions of data definition emerge through the reasoning process 0 AttrNum[0]END 36 0 null 0 89 0 0 AttrNum[0]END 67 0 null 0 109 1 Set-based includes links of arbitrary arity (link travel results in set, not another node) 0 AttrNum[0]END 66 0 null 0 108 1 Graph-based includes the concept of an anchor (multiple links originate at different points in one node) 0 AttrNum[0]END 65 0 null 0 94 1 Basic activities are essentially set operations (sorting, creating sub-sets, finding intersections, etc) 0 AttrNum[0]END 64 0 null 0 92 0 1 AttrNum[1]END Publisher String 0 0 1 ACM 0 63 0 null 0 91 1 Published in: Hypertext '91 Proceedings 0 AttrNum[0]END 62 0 null 0 90 0 1 AttrNum[1]END Date String 0 0 1 December, 1991 0 61 0 null 0 88 0 0 AttrNum[0]END 60 0 null 0 87 1 Any system in which the associations between the objects are based on characteristics that are similar (where objects are mostly different, and shared characteristics create the link) 0 AttrNum[0]END 1200 800 0 0 0 0 0 Untitled