A Decade of Reoccurring Software Weaknesses.

The Common Weakness Enumeration (CWE) community publishes an aggregate metric to calculate the 'Most Dangerous Software Errors.' However, the used equation highly biases frequency over exploitability and impact. We provide a metric to mitigate this bias and discuss the most significant software weaknesses over the last ten years.

Linear Time Algorithms to Restrict Insider Access using Multi-Policy Access Control Systems.

An important way to limit malicious insiders from distributing sensitive information is to as tightly as possible limit their access to information. This has always been the goal of access control mechanisms, but individual approaches have been shown to be inadequate. Ensemble approaches of multiple methods instantiated simultaneously have been shown to more tightly restrict access, but approaches to do so have had limited scalability (resulting in exponential calculations in some cases).

On the Internet Connectivity in Africa.

This study measures growth of Internet connectivity in Africa from 2010 to 2014 with a focus on inter-country relationships. An initial analysis reveals a modest increase in the number of participating countries but an explosive increase in the number of routers and network links. We then form the first country level topology maps of the African Internet and evaluate the robustness of the network.

Linear Time Vertex Partitioning on Massive Graphs.

The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds of nodes and less optimal but faster techniques that function on up to thousands of nodes. In this work, we analyze how to perform vertex partitioning on massive graphs of tens of millions of nodes.