AlMeta:QuiteUnusual:Concept mapping design doc
This is for the AntiWikipedia side. for the game side see:YMO_Prototype_Design_Doc
Contents
- 1 what version of node to show
- 2 all objects
- 3 tag
- 4 user
- 5 Node
- 6 article
- 7 Link
- 8 Chatroom/board
- 9 Message
- 10 Map
- 11 layout
what version of node to show
user
breath first search starting at the user then his authorities.
popular
he most popular version(one they are most likely to approve of that they haven't approved, ether directly of through a proxy)
auther
the version that the author would see, many put at top of user's
specified
the version specified in the map/article that they followed to that node,
user's
the version that select a user to see their version.
Should show versions that they are linkly to revise. show under user's menu(at the top of the list)(just use a randum unaprroved version in MVP. the one that has the highest likelyhood of being disaproved(disagree that the aproved tag aplies) of)
Pairs of students were put in one of three conditions. In one condition, they were asked to collaboratively construct a diagram, using the following labels for the viewpoint and arguments (boxes): viewpoint, argument in favour, argument against, support, rebuttal, and example. In the second condition, students were asked to collaboratively construct a diagram using the following labels for relations (arrows) between arguments (boxes): because, but, and, thus, such as.
all objects
A property that Starts with @ is static. A node that starts with ? can be add to.
@author
user that made node
@Timestamp
Time when the object is reportedly created
tag
user
?recommended display name
?full name
?#Tags
Display name
?#chatroom =
Filter
?#users
?Display name
?tags
?#articles
?comments
messages this user has made in the articles corresponding comment chatroom
?#tags
?applies
Can be agree that the tag applies unset or disagree's that the tag applies
if they approved the article =
Could be just another tag but needs to calculate the likelihood of them disagreeing that it's approved not just the likelihood that it is approved but is that just 1=(approve likelihood)?
?#links
?comments
messages this user has made in link corresponding comment chatroom
?#tags
?applies
?Nodes that they have edited
?friends list
?ignore list
ignore list takes priority over friends list when deciding to show a node to the user
?Authorities
order list of users. when deciding on which article to show for their version start with ones they approved then go their their authorities list look for one that they approved select the newest one if none of them have approved an article for that node do the same thing to their authorities authorities list.
Example with this graph:
- a
- b
- c
- d
- b
- e
- f
- d
- c
- x
- y
- z
- d
- e
- q
- r
- s
- for a get a's, b's, c's and d's aproves articles for the node, if it not empty selevt the newest one.
- if it is empty get b's authlist's( e's, f's and d's) approved articles for the node, if it not empty select the newest one.
- if it is empty get c's authlist's( x's, y's and z's) approved articles for the node, if it not empty select the newest one.
- if it is empty get d's authlist's approved articles for the node, since it's empty get e's authlist's (q's, r's, s's) approved articles for the node, if it not empty select the newest one.
- if it's empty get f's dauthlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get d's authlist's approved articles for the node, it's empty so get x's authlist's apprived articles for the node, if it not empty select the newest one.
- if it's empty get y's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get z's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get q's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get r's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get s's authlist's approved articles for the node, if it not empty select the newest one.
- continue crawling the web of authority with the the first of q's authlist. continue through q's authlist
- continue crawling the web of authority with the the first of r's authlist. continue through r's authlist
- continue crawling the web of authority with the the first of s's authlist. continue through s's authlist
Node
?title
?List of articles
versions of the node
?What maps are they in
?What links connect to/from them
article
@title
Title that this article was written for
@Wikibody
@Templates
@Update
If set to a user id it should use the current(display time) version of the node that that specified user would see if they went to the linked node.
If not a user id(false? undefined?) use the specific article linked in the template
?Nodes and Messages that link to this article
@based on
immediate previous version
?successors
Articles what have this article as their "Based on"
?What links connect to/from them
?users that have approved this node(another tag?)
?users that have made comments and tags
Link
@Author
@node1
@Article1
the version of node1 that they where referring when they made the link
@node2
@Article2
the version of node2 that they where referring when they made the link
@Type of link
?What maps are they in?
?Comments
Chatroom to discuss the link
?tags
The tags or link to the users that have put them on it?
Chatroom/board
?Messages
list of messages on this board
Message
?edits
Only author should be able to add edits.
the article that makes up the body of the message. list of all the edits
@after
the last message on this board that the user had when thru posted this message. should be after that message and sorted by time
?befores
massages that have this message as their after.
@replying to
?replies
Map
@#Nodes
@title
title of node used in this map
@links between them nodes
?Layouts for this maps =
@Based off of
Map that this map is based off of.
?successors
maps that have this map as their based off of.
layout
@map this layout is for
Should be able to apply layouts to different maps. layering them ontop of the current node relations and ignoring relations that refer to nodes that aren't in the map
@#Horizontal orderings
@node1
@node2
@Left, overlaping, or right
@#Vertical orderings
@node1
@node2
@Above,overlaping, below
@#relitive positions
if a node has already been moved by a relative move the one that hasn't else find the center between them and move the nodes reletive to that.