Made in Carcere: Scaling a Social Enterprise Business Model

"Officina Creativa" (Creative Workshop) is a social enterprise giving female convicts a second change: to produce fashion accessories branded as \u201cMade in Carcere\u201d (Made in Jail). The case deals with the struggles and the challenges that the founder of the company had to deal with as the business started to flourish and gaining social legitimation. Some questions were crowding her mind: Was it really possible to further scale up the organization\u2019s operations and impact? And if so, how? And why growing was so difficult for the organization

Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables

This paper proposes round-hashing, which is suitable for data storage on distributed servers and for implementing external-memory tables in which each lookup retrieves at most one single block of external memory, using a stash. For data storage, round-hashing is like consistent hashing as it avoids a full rehashing of the keys when new servers are added. Experiments show that the speed to serve requests is tenfold or more than the state of the art. In distributed data storage, this guarantees better throughput for serving requests and, moreover, greatly reduces decision times for which data should move to new servers as rescanning data is much faster

Oii-web: An interactive online programming contest training system

In this paper we report our experience, related to the online training for the Italian and International Olympiads in Informatics. We developed an interactive online system, based on CMS, the grading system used in several major programming contests including the International Olympiads in Informatics (IOI), and used it in three distinct context: training students for the Italian Olympiads in Informatics (OII), training teachers in order to be able to assist students for the OII, and training the Italian team for the IOI. The system, that is freely available, proved to be a game changer for the whole italian olympiads in informatics ecosystem: in one year, we almost doubled the participation to OII, from 13k to 21k secondary school students. The system is developed basing on the Contest Management System (CMS, http://cms- dev.github.io/), so it is highly available to extensions supporting, for instance, the pro- duction of feedback on problems solutions submitted by trainees. The system is also freely available, with the idea of allowing for support to alternative necessities and developmen

Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques

Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This paper presents efficient algorithms for listing maximum cliques in networks, providing the first sublinear-space bounds with guaranteed delay per enumerated clique, thus comparing favorably with the known literature

Listing Subgraphs by Cartesian Decomposition

We investigate a decomposition technique for listing problems in graphs and set systems. It is based on the Cartesian product of some iterators, which list the solutions of simpler problems. Our ideas applies to several problems, and we illustrate one of them in depth, namely, listing all minimum spanning trees of a weighted graph G. Here iterators over the spanning trees for unweighted graphs can be obtained by a suitable modification of the listing algorithm by [Shioura et al., SICOMP 1997], and the decomposition of G is obtained by suitably partitioning its edges according to their weights. By combining these iterators in a Cartesian product scheme that employs Gray coding, we give the first algorithm which lists all minimum spanning trees of G in constant delay, where the delay is the time elapsed between any two consecutive outputs. Our solution requires polynomial preprocessing time and uses polynomial space

Efficient Algorithms for Listing k Disjoint st-Paths in Graphs

International audienceGiven a connected graph G of m edges and n vertices, we consider the basic problem of listing all the choices of k vertex-disjoint st-paths, for any two input vertices s, t of G and a positive integer k. Our algorithm takes O(m) time per solution, using O(m) space and requiring O(F k (G)) setup time, where $F k (G) = O(m min{k, n 2/3 log n, √ m log n})$ is the cost of running a max-flow algorithm on G to compute a flow of size k. The proposed techniques are simple and apply to other related listing problems discussed in the paper