I authored the following in my capacity as Director of FFII-UK as the FFII statement at WIPO IIM on the Development Agenda.
Submission of the Foundation for a Free Information Infrastructure, WIPO IIM 11th to 13th April 2005First, at the outset Mr Chairman we would like to congratulate you, as well as the distinguished [...]
Feature Importance Comments Centralized remote repository 3 Can work offline (with syncing when back online) 3 xml (rdf?) storage format 3 make our own (can’t use vcal/ical unfortunately) export to html and …. 2 trivial (use some xsl) integration with a calendar app … 1 difficult and in that case we might as well try [...]
A while ago I was at a conference with a bunch of people and we were standing around in the lobby of the hotel waiting to set off for supper. From arrival of the first of us to actual departure took about half an hour. First a couple of those who were supposed to be coming hadn’t turned up so a posse went off to search for them. Next no-one had yet agreed where to go so a whole discussion ensued as to what kind of food was wanted, what was the price range and who had the local knowledge suited to making quality/price recommendations. Finally by the time this had got resolved and the two people originally missing had been located some of those orginally present had wandered off to the bar to check email via wifi and grab a drink. Prising them loose took another five mintues. But eventually we did set off — half an hour late mind you.
1. Uncodified knowledge cannot be transferred except by f2f interaction (apprenticeship etc)
2. But knowledge codification is very time and space consuming (and much still remains implicit)
3. As the amount of codified knowledge grows it becomes harder to find what you want
Hypothesis: Value of Information in Databank = Value of Information if it could be Accessed Perfectly x Ease of Finding Any Particular Item
Plausible to assume Ease of Finding Information = h(Amount) where h’ < 0. * Let Amount = n * In standard Computer Science if we could sort items in some manner (by which we could also search). h(N) = log(n) (and sorting costs are n log(n) – bubble sort) [[TODO: check this]]
About
Dr. Rufus Pollock is co-Founder and Director of the Open Knowledge Foundation, a Shuttleworth Foundation Fellow, and an Associate of the Centre for Intellectual Property and Information Law at the University of Cambridge.
Categories
- *nix (9)
- Academic (73)
- Activity Updates (20)
- Books (55)
- Cinema (112)
- Code (15)
- Command Line (9)
- Copyright (23)
- Culture and Society (27)
- Data Digging (4)
- Economics (155)
- EUPD (10)
- External (3)
- Filesharing (11)
- Governance (14)
- Hacks (21)
- Happiness (16)
- Hardware (1)
- History (15)
- Innovation and Intellectual Property (66)
- Intellectual Myths (12)
- Javascript (3)
- Knowledge Systems (17)
- Miscellaneous (17)
- Musings (15)
- Notes (14)
- Open Bibliographic Data (2)
- Open Data (29)
- Open Knowledge Foundation (66)
- Openness (41)
- Own Work (59)
- Papers (4)
- People (1)
- Photos (1)
- Platforms (1)
- Poetry (1)
- Policy (18)
- PSI (8)
- Python (24)
- Quote (1)
- RDF (2)
- Shuttleworth Fellow (56)
- Software (47)
- Sysadmin (2)
- Talks (34)
- Transaction Costs (5)
- Work In Progress (2)
