sbp

The project is about the delivery of Espra -- an open source, web-based social platform that sets out to improve quality of life and create new market opportunities by helping to efficiently organise people, ideas and resources. Espra will significantly improve people's ability to function in the digital world by tackling information overload and allowing content creators to get paid for their work.

To this end Espra brings together innovative solutions built around Trust Maps, which will help people filter and overcome information overload, and a Reputation Economy, which will enable content creators to get rewarded for their works through aggregated micropayments.

Espra fulfills parts of the Technology Strategy Board's wider Digital Britain Strategy of enabling "a sustainable marketplace for intellectual property" and helping create "economic and social benefit from increasing volumes of information".

---

The ability to filter information flow through Trust Maps and the use of aggregated micropayments

sbp

Submission:

The Colloquial Web group evaluates existing practices amongst core web
technologies such as HTML, CSS, and JavaScript. It aims to provide users and
vendors with clear guidelines for deployment and innovation for web
applications. Example problem domains include continued use of deprecated
constructs, the rise in external services for hosting solutions such as Google
Web Fonts or MathJax, and comparing attitudes to RDFa and microdata.

The group will not produce languages, but may for example create profiles of

sbp

#!/usr/bin/env python

import time, os, sys, signal

sleeptime = waketime = 0.01

def send(signal, pids):
	for pid in pids:
		os.kill(pid, signal)

sbp

# Copyright (c) 2015 Tony Garnock-Jones <tonyg@leastfixedpoint.com>
# Copyright (c) 2015 Sean B. Palmer <inamidst.com>
# Licensed under the 2-Clause Simplified BSD License

def longest_common_subsequence(xs, ys):
    # Uses the Ukkonen-Myers algorithm
    t = len(xs) + len(ys)
    front = [0] * (2 * t + 1)
    candidates = [None] * (2 * t + 1)
    for d in range(t + 1):