From: cvs@openprivacy.orgCVS update: openprivacy/htdocs/notes/reputations
Date: Tuesday January 23, 19101 @ 14:20
Author: burton
CVSWEB Options: -------------------
Main CVSWeb: http://openprivacy.org/cgi-bin/cvsweb/cvsweb.cgi
View this module: http://openprivacy.org/cgi-bin/cvsweb/cvsweb.cgi/openprivacy/htdocs/notes/reputations
-----------------------------------
Update of /usr/local/cvs/public/openprivacy/htdocs/notes/reputations
In directory giga:/tmp/cvs-serv6039
Modified Files:
protocol.txt
Log Message:
...
*****************************************************************
File: openprivacy/htdocs/notes/reputations/protocol.txt
CVSWEB Options: -------------------
CVSWeb: Annotate this file: http://openprivacy.org/cgi-bin/cvsweb/cvsweb.cgi/openprivacy/htdocs/notes/reputations/protocol.txt?annotate=1.17
CVSWeb: View this file: http://openprivacy.org/cgi-bin/cvsweb/cvsweb.cgi/openprivacy/htdocs/notes/reputations/protocol.txt?rev=1.17&content-type=text/x-cvsweb-markup
CVSWeb: Diff to previous version: http://openprivacy.org/cgi-bin/cvsweb/cvsweb.cgi/openprivacy/htdocs/notes/reputations/protocol.txt.diff?r1=1.17&r2=1.16
-----------------------------------
Index: openprivacy/htdocs/notes/reputations/protocol.txt
diff -u openprivacy/htdocs/notes/reputations/protocol.txt:1.16 openprivacy/htdocs/notes/reputations/protocol.txt:1.17
--- openprivacy/htdocs/notes/reputations/protocol.txt:1.16 Tue Jan 23 10:08:09 2001
+++ openprivacy/htdocs/notes/reputations/protocol.txt Tue Jan 23 14:20:55 2001
@@ -1,4 +1,4 @@
-$Id: protocol.txt,v 1.16 2001/01/23 18:08:09 burton Exp $
+$Id: protocol.txt,v 1.17 2001/01/23 22:20:55 burton Exp $
protocol requirements:
@@ -46,40 +46,31 @@
notes from burton@relativity.yi.org 18 Jan 2001 09:12:19 -0800:
-- Given an ontology... determine the X best (or worst) things... sorted. A
- good example. Show me the top 10 Open Source projects, Show me the best
- RSS channels. It would be nice if http://apps.kde.com had this.
-
- Given a bias, calculate it and optionally return all the users that made
opinions (so I can cast my own opinions).
- In order to build a tree structure we need a way to 'audit' the Reputation
that was returned. This would be the second node level.. This could be a
- lot of data so we need a fast way to return it.
-
-
+ lot of data so we need a fast way to return it. (this could be XPATH, we
+ could return a count() first
- We need to have an optional <description> field. This is meta-info for
human agents. This might just be accomplished via additional RDF. A good
example of why this is necessary is that a human agent might add reasoning
to an opinion they create:
Northwest Airlines -> Reliability -> BAD
+
<description>
They lost my luggage 5/5 times.
</description>
Of course this data is repudiatable but is still valid if you really trusts
its creator.
-
-- should the "popularity" of a URL also be published? This could be the total
- number of opinions cast... this might need to have a start and end date.
+
- another way to do this could be to have all the information exposed and
XQL/XPATH queries ran... of course this is a data problem... we wouldn't want
to just spit this data back because it could be a lot of data...
-- ability to calculate reputation sets (arrays) based on threshold... "show me
- all Reputation objects for URI1 with a opinion > X..
-
- I think that we need might need to define some basic API calls getReputation()
etc but also have a base method like query() and pass it an XPath query and
this returns an XML Document. Reputations should be forced into an XMLSchema
@@ -87,3 +78,28 @@
impl... (or reuse one).
- seems like a cool way to use HTTP and XPointer...
+
+
+- TIME??? How do we handle this??? This currently isn't in HTTP so maybe we
+ shouldn't worry..
+
+
+
+
+
+
+
+
+
+
+
+- should the "popularity" of a URL also be published? This could be the total
+ number of opinions cast... this might need to have a start and end date.
+
+- ability to calculate reputation sets (arrays) based on threshold... "show me
+ all Reputation objects for URI1 with a opinion > X..
+
+ - Given an ontology... determine the X best (or worst) things... sorted. A
+ good example. Show me the top 10 Open Source projects, Show me the best
+ RSS channels. It would be nice if http://apps.kde.com had this.
+
This archive was generated by hypermail 2b30 : Tue Jan 23 2001 - 14:20:56 PST