The role of social media in the collaboration, interaction, co-creation and co-delivery of a social venture in an uncertain conflict environment

This research case study examines the creation and development of a bottom-up social enterprise immediately after the outbreak of a civil war in an Arab country by a group of young patriots in the aftermath of the Arab Spring uprisings in the 2010s. Drawing on Linders’ (2012) model of social action lifecycle, our study examines how different actors become involved and co-created a socially entrepreneurial venture (SEV), how these actors contributed to the coproduction and co-delivery of the social actions (values) over time, and how social media play roles in these processes. Drawing from the empirical evidences of citizen co-production within the existing literature, we found that SEVs operate in very different ways in which the role of social media is critical, both from their equivalents operating in a penurious but stable environment, and those intending to pursue political action within a conflict situation. In our case study, social media was not intended for mass-mobilisation, but for selected mobilisation amongst those within the network. This is due to the insecure environment and the fear of infiltration from opposing parties. We also examine how new actors were, over time, being carefully screened and selected, and potential harmful existing players being excluded, which in turn contributed to the evolving nature of the social enterprises

Laparoscopic liver resection for hepatocellular carcinoma in patients with cirrhosis

published_or_final_versio

Low cost DIY solar energy hot water system

Author name used in this publication: N. C. CheungRefereed conference paper2004-2005 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

Routing with locality in partitioned-bus meshes

We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing time by approximately one-third for permutation routing with locality. A matching time lower bound is also proved. The result can be generalized to multi-packet routing.published_or_final_versio

Clinical characteristics of viral infection of central nervous system in Queen Mary Hospital

published_or_final_versio

CLUDE: An Efficient Algorithm for LU Decomposition Over a Sequence of Evolving Graphs

Session: Matrix Factorization, Clustering and Probabilistic DataIn many applications, entities and their relationships are represented by graphs. Examples include the WWW (web pages and hyperlinks) and bibliographic networks (authors and co-authorship). A graph can be conveniently modeled by a matrix from which various quantitative measures are derived. Some example measures include PageRank and SALSA (which measure nodes’ importance), and Personalized PageRank and Random Walk with Restart (which measure proximities between nodes). To compute these measures, linear systems of the form Ax = b, where A is a matrix that captures a graph’s structure, need to be solved. To facilitate solving the linear system, the matrix A is often decomposed into two triangular matrices (L and U). In a dynamic world, the graph that models it changes with time and thus is the matrix A that represents the graph. We consider a sequence of evolving graphs and its associated sequence of evolving matrices. We study how LU-decomposition should be done over the sequence so that (1) the decomposition is efficient and (2) the resulting LU matrices best preserve the sparsity of the matrices A’s (i.e., the number of extra non-zero entries introduced in L and U are minimized.) We propose a cluster-based algorithm CLUDE for solving the problem. Through an experimental study, we show that CLUDE is about an order of magnitude faster than the traditional incremental update algorithm. The number of extra non-zero entries introduced by CLUDE is also about an order of magnitude fewer than that of the traditional algorithm. CLUDE is thus an efficient algorithm for LU decomposition that produces high-quality LU matrices over an evolving matrix sequence.published_or_final_versio

Reduction in stroke by statin therapy markedly increases its cost-effectiveness

published_or_final_versio

Plasma adrenomedullin level in patients with heart failure is related to systolic but not diastolic dysfunction

published_or_final_versio

Recommending anchor points in structure-preserving hypertext document retrieval

Traditional WWW search engines index and recommend individual Web pages to assist users in locating relevant documents. Users are often overwhelmed by the large answer set recommended by the search engines. The logical starting point of the hyper-document is thus hidden among the large basket of matching pages. Users need to spend a lot of effort browsing through the pages to locate the starting point, a very time consuming process. This paper studies the anchor point indexing problem. The anchor points of a given user query is a small set of key pages from which the larger set of documents that are relevant to the query can be easily reached. The use of anchor points help solve the problems of huge answer set and low precision suffered by most search engines by considering the hyper-link structures of the relevant documents, and by providing a summary view of the result set.published_or_final_versio

Granulin-epithelin precursor interacts with 78-kDa glucose-regulated protein in hepatocellular carcinoma

published_or_final_versio