Editing AlMeta:QuiteUnusual:Concept mapping design doc
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 2: | Line 2: | ||
[[File:UIdm.png]] | [[File:UIdm.png]] | ||
| − | + | Users can selec their version, the version specified in the map/article that they followed to that node, the most popular version(one they are most likely to approve of that they haven't approved, ether directly of through a proxy), or 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) | 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) | ||
| Line 24: | Line 12: | ||
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. | 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. | ||
---- | ---- | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | = | + | = users = |
| − | == | + | == recommended display name == |
| − | == | + | == full name == |
| − | == | + | == articles == |
| − | + | === comments === | |
| − | + | === tags === | |
| − | + | Can be agree that the tag aplies unset or disagree's that the tag aplies | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | === | ||
| − | |||
| − | === | ||
| − | |||
| − | Can be agree that the tag | ||
=== if they approved the article ==== | === if they approved the article ==== | ||
| − | Could be just another tag but needs to calculate the | + | Could be just another tag but needs to calculate the likelyhood of them disagreeing that it's aproved not just the likelyhood that it is approved but is that just 1=(approve likelyhood)? |
| − | + | === 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 | 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 | + | 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 authoritie list. |
Example with this graph: | Example with this graph: | ||
| Line 102: | Line 65: | ||
| − | = | + | = 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 | ||
| + | |||
| + | = Nodes = | ||
== ?title == | == ?title == | ||
== ?List of articles == | == ?List of articles == | ||
| Line 109: | Line 80: | ||
== ?What links connect to/from them == | == ?What links connect to/from them == | ||
| − | = | + | = articles = |
== @title == | == @title == | ||
Title that this article was written for | Title that this article was written for | ||
| Line 123: | Line 94: | ||
== ?successors == | == ?successors == | ||
Articles what have this article as their "Based on" | 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 == |
| − | = | + | = Links = |
== @Author == | == @Author == | ||
== @node1 == | == @node1 == | ||
| − | == @ | + | === @Article === |
| − | the version | + | the version that they where referring when they made the link |
== @node2 == | == @node2 == | ||
| − | == @ | + | === @Article === |
| − | the version | + | the version that they where referring when they made the link |
== @Type of link == | == @Type of link == | ||
== ?What maps are they in? == | == ?What maps are they in? == | ||
== ?Comments == | == ?Comments == | ||
| − | Chatroom to discuss the | + | Chatroom to discuss the article |
== ?tags == | == ?tags == | ||
The tags or link to the users that have put them on it? | The tags or link to the users that have put them on it? | ||
| Line 153: | Line 124: | ||
== @after == | == @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 | the last message on this board that the user had when thru posted this message. should be after that message and sorted by time | ||
| − | |||
| − | |||
== @replying to == | == @replying to == | ||
| − | + | ||
| − | + | = Maps = | |
| − | = | + | == @Nodes == |
| − | == @ | + | === @Article === |
| − | === @ | + | the version that they where refering when they made the link |
| − | |||
== @links between them nodes == | == @links between them nodes == | ||
== ?Layouts for this maps === | == ?Layouts for this maps === | ||
== @Based off of == | == @Based off of == | ||
| − | Map that this map is based off | + | Map that this map is based off ot |
| − | |||
| − | |||
= layout = | = layout = | ||
== @map this layout is for == | == @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 | 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 === | === @node1 === | ||
=== @node2 === | === @node2 === | ||
=== @Left, overlaping, or right === | === @Left, overlaping, or right === | ||
| − | == @ | + | == @Vertical orderings == |
=== @node1 === | === @node1 === | ||
=== @node2 === | === @node2 === | ||
=== @Above,overlaping, below === | === @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. | 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. | ||
=== @node1 === | === @node1 === | ||
=== @node2 === | === @node2 === | ||
=== @position of node1 reletive to node2 === | === @position of node1 reletive to node2 === | ||
