Merlin: A Language for Provisioning Network Resources

This paper presents Merlin, a new framework for managing resources in software-defined networks. With Merlin, administrators express high-level policies using programs in a declarative language. The language includes logical predicates to identify sets of packets, regular expressions to encode forwarding paths, and arithmetic formulas to specify bandwidth constraints. The Merlin compiler uses a combination of advanced techniques to translate these policies into code that can be executed on network elements including a constraint solver that allocates bandwidth using parameterizable heuristics. To facilitate dynamic adaptation, Merlin provides mechanisms for delegating control of sub-policies and for verifying that modifications made to sub-policies do not violate global constraints. Experiments demonstrate the expressiveness and scalability of Merlin on real-world topologies and applications. Overall, Merlin simplifies network administration by providing high-level abstractions for specifying network policies and scalable infrastructure for enforcing them

Two-dimensional ranking of Wikipedia articles

The Library of Babel, described by Jorge Luis Borges, stores an enormous amount of information. The Library exists {\it ab aeterno}. Wikipedia, a free online encyclopaedia, becomes a modern analogue of such a Library. Information retrieval and ranking of Wikipedia articles become the challenge of modern society. While PageRank highlights very well known nodes with many ingoing links, CheiRank highlights very communicative nodes with many outgoing links. In this way the ranking becomes two-dimensional. Using CheiRank and PageRank we analyze the properties of two-dimensional ranking of all Wikipedia English articles and show that it gives their reliable classification with rich and nontrivial features. Detailed studies are done for countries, universities, personalities, physicists, chess players, Dow-Jones companies and other categories.Comment: RevTex 9 pages, data, discussion added, more data at http://www.quantware.ups-tlse.fr/QWLIB/2drankwikipedia

The Influence of Early Respondents: Information Cascade Effects in Online Event Scheduling

Sequential group decision-making processes, such as online event scheduling, can be subject to social influence if the decisions involve individuals’ subjective preferences and values. Indeed, prior work has shown that scheduling polls that allow respondents to see others’ answers are more likely to succeed than polls that hide other responses, suggesting the impact of social influence and coordination. In this paper, we investigate whether this difference is due to information cascade effects in which later respondents adopt the decisions of earlier respondents. Analyzing more than 1.3 million Doodle polls, we found evidence that cascading effects take place during event scheduling, and in particular, that early respondents have a larger influence on the outcome of a poll than people who come late. Drawing on simulations of an event scheduling model, we compare possible interventions to mitigate this bias and show that we can optimize the success of polls by hiding the responses of a small percentage of low availability respondents.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/134703/1/Romero et al 2017 (WSDM).pd

Outcomes of Fusions From the Cervical Spine to the Pelvis.

Study designRetrospective cohort study.ObjectiveDetermine the indications, complications, and clinical outcomes in patients requiring fusions from the cervical spine to the pelvis. Several investigators have examined fusions from the thoracic spine to the sacrum, but no similar study has been performed for cervical-to-pelvis fusions.MethodsPatients from 2003 to 2014 with an upper instrumented vertebrae (UIV) in the cervical spine (any level) and a lower instrumented vertebrae (LIV) in the sacrum or pelvis were included in the study. Those with infectious or acute trauma-related deformities were excluded. Patient demographics, medical history, diagnosis, operative procedure, and health-related quality of life measures were analyzed. Student's t test, Kruskal-Wallis test, and χ2 test were used as appropriate; significance was set at P < .05 for all tests.ResultsFifty-five patients met inclusion criteria for the study. Average follow-up was 2.8 years. Proximal junctional kyphosis was the most common indication for cervical-to-pelvis fusions (36%). The most common UIV was C2 (29%) followed by C7 (24%). There was an average 31° correction in maximum kyphosis and a 3.3 cm improvement in sagittal vertical axis. In adults, the rate of complication was 71.4%, with a major complication rate of 39.3% and reoperation rate of 53.6%. There was significant improvement in the Scoliosis Research Society (SRS-22r) score (3.0 to 3.5; P < .01).ConclusionProximal junctional kyphosis is the most common indication for patients requiring fusion to the cervical spine. Adult patients incur a significant risk of major complications and reoperations. However, significant improvement in SRS-22r outcomes are noted in these patients

A Game Theoretic Model for the Formation of Navigable Small-World Networks

Kleinberg proposed a family of small-world networks to ex-plain the navigability of large-scale real-world social net-works. However, the underlying mechanism that drives real networks to be navigable is not yet well understood. In this paper, we present a game theoretic model for the for-mation of navigable small world networks. We model the network formation as a game in which people seek for both high reciprocity and long-distance relationships. We show that the navigable small-world network is a Nash Equilib-rium of the game. Moreover, we prove that the navigable small-world equilibrium tolerates collusions of any size and arbitrary deviations of a large random set of nodes, while non-navigable equilibria do not tolerate small group collu-sions or random perturbations. Our empirical evaluation further demonstrates that the system always converges to the navigable network even when limited or no information about other players ’ strategies is available. Our theoretical and empirical analyses provide important new insight on the connection between distance, reciprocity and navigability in social networks

Self-organized Emergence of Navigability on Small-World Networks

This paper mainly investigates why small-world networks are navigable and how to navigate small-world networks. We find that the navigability can naturally emerge from self-organization in the absence of prior knowledge about underlying reference frames of networks. Through a process of information exchange and accumulation on networks, a hidden metric space for navigation on networks is constructed. Navigation based on distances between vertices in the hidden metric space can efficiently deliver messages on small-world networks, in which long range connections play an important role. Numerical simulations further suggest that high cluster coefficient and low diameter are both necessary for navigability. These interesting results provide profound insights into scalable routing on the Internet due to its distributed and localized requirements.Comment: 3 figure

Measuring user influence, susceptibility and cynicalness in sentiment diffusion

National Research Foundation (NRF) Singapore under International Research Centre @ Singapore Funding Initiativ

A consideration of the challenges involved in supervising international masters students

This paper explores the challenges facing supervisors of international postgraduate students at the dissertation stage of the masters programme. The central problems of time pressure, language difficulties, a lack of critical analysis and a prevalence of personal problems among international students are discussed. This paper makes recommendations for the improvement of language and critical thinking skills, and questions the future policy of language requirements at HE for international Masters students