A guide to finance for Social Enterprises in South Africa

The global economic crisis and its aftermath deepen the challenge of decent employment creation. The Global Jobs Pact developed in response to the crisis sets out a framework that ensures linkages between social progress and economic development. In this context, there is increasing interest in the social economy as a way to combine social and economic goals. The Ouagadougou Symposium on the Global Jobs Pact as it relates to Africa included a recommendation to increase support to the social economy. A regional conference in October 2009 on the social economy as a response to the economic crisis in Africa defined the social economy as "a concept designating enterprises and organizations, in particular cooperatives, mutual benefit societies, associations, foundations and social enterprises, which have the specific feature of producing goods, services and knowledge while pursuing both economic and social aims and fostering solidarity.

Dictionary matching in a stream

We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream. We present a randomised algorithm which takes O(log log(k + m)) time per arriving character and uses O(k log m) words of space, where k is the number of strings in the dictionary and m is the length of the longest string in the dictionary

The Suffix Tree of a Tree and Minimizing Sequential Transducers

This paper gives a linear-time algorithm for the construction of thesuffix tree of a tree. The suffix tree of a tree is used to obtain an efficientalgorithm for the minimization of sequential transducers

On Competitive On-Line Paging with Lookahead

This paper studies two methods for improving the competitive efficiency of on-line paging algorithms: in the first, the on-line algorithm canuse more pages; in the second, it is allowed to have a look-ahead, or inother words, some partial knowledge of the future. The paper considers anew measure for the look-ahead size as well as Young's resource-boundedlook-ahead and proves that both measures have the attractive propertythat the competitive efficiency of an on-line algorithm with k extra pagesand look-ahead l depends on k+l. Hence, under these measures, an on-linealgorithm has the same benefit from using an extra page or knowing anextra bit of the future

Efficient String Matching on Coded Texts

The so called "four Russians technique'' is often used to speed up algorithms by encoding several data items in a single memory cell. Given a sequence of n symbols over a constant size alphabet, one can encode the sequence into O(n / lambda) memory cells in O(log(lambda) ) time using n / log(lambda) processors. This paper presents an efficient CRCW-PRAM string-matching algorithm for coded texts that takes O(log log(m/lambda)) time making only O(n / lambda ) operations, an improvement by a factor of lambda = O(log n) on the number of operations used in previous algorithms. Using this string-matching algorithm one can test if a string is square-free and find all palindromes in a string in O(log log n) time using n / log log n processors