grouptheory

casper

Computer aided student performance evaluation reporting

ecstc

This software implements a new method for obtaining network properties from incomplete data sets. Problems associated with missing data represent well-known stumbling blocks in Social Network Analysis. The method of “estimating connectivity from spanning tree completions” (ECSTC) is specifically designed to address situations where only spanning tree(s) of a network are known, such as those obtained through respondent driven sampling (RDS). Using repeated random completions derived from degree information, this method forgoes the usual step of trying to obtain final edge or vertex rosters, and instead aims to estimate network-centric properties of vertices probabilistically from the spanning trees themselves. In this paper, we discuss the problem of missing data and describe the protocols of our completion method, and finally the results of an experiment where ECSTC was used to estimate graph dependent vertex properties from spanning trees sampled from a graph whose characteristics were known ahead of time. The results show that ECSTC methods hold more promise for obtaining network-centric properties of individuals from a limited set of data than researchers may have previously assumed. Such an approach represents a break with past strategies of working with missing data which have mainly sought means to complete the graph, rather than ECSTC's approach, which is to estimate network properties themselves without deciding on the final edge set.

EPIC

EPIC-SOLVER - Economic Proxy and Indirect Constraints Solver

MKSolver

Miasnikov Kharlampovich's algorithm for solving equations in Free Groups, based on the Makanin-Razborov process.

moadb

Software that models and explores system dynamics of double auction between a parametrizable population of traders

ncd-snapshot

A tool for guided navigation of files based on similarity -- using normalized compression distance

petri

Simulator to evaluate the design of a new and comprehensive solution for automated worm detection and immunization. The system engages a peer-to-peer network of untrusted machines on the Internet to detect new worms and facilitate rapid preventative response. We evaluate the efficacy and scalability of the proposed system through large-scale simulations and assessments of a functional real-world prototype. We find that the system enjoys scalability in terms of network coverage, faulttolerance, security, and maintainability. It proves effective against new worms, and supports collaboration among among mutually mistrusting parties.

PRouST

PNNI Routing and Simulation Toolkit

SEAN

Signaling Entity for ATM networks

Sousa

grouptheory/ecstc

This software implements a new method for obtaining network properties from incomplete data sets. Problems associated with missing data represent well-known stumbling blocks in Social Network Analysis. The method of “estimating connectivity from spanning tree completions” (ECSTC) is specifically designed to address situations where only spanning tree(s) of a network are known, such as those obtained through respondent driven sampling (RDS). Using repeated random completions derived from degree information, this method forgoes the usual step of trying to obtain final edge or vertex rosters, and instead aims to estimate network-centric properties of vertices probabilistically from the spanning trees themselves. In this paper, we discuss the problem of missing data and describe the protocols of our completion method, and finally the results of an experiment where ECSTC was used to estimate graph dependent vertex properties from spanning trees sampled from a graph whose characteristics were known ahead of time. The results show that ECSTC methods hold more promise for obtaining network-centric properties of individuals from a limited set of data than researchers may have previously assumed. Such an approach represents a break with past strategies of working with missing data which have mainly sought means to complete the graph, rather than ECSTC's approach, which is to estimate network properties themselves without deciding on the final edge set.

grouptheory/MKSolver

Miasnikov Kharlampovich's algorithm for solving equations in Free Groups, based on the Makanin-Razborov process.

grouptheory/casper

Computer aided student performance evaluation reporting

grouptheory/EPIC

EPIC-SOLVER - Economic Proxy and Indirect Constraints Solver

grouptheory/moadb

Software that models and explores system dynamics of double auction between a parametrizable population of traders

grouptheory/ncd-snapshot

A tool for guided navigation of files based on similarity -- using normalized compression distance

grouptheory/petri

Simulator to evaluate the design of a new and comprehensive solution for automated worm detection and immunization. The system engages a peer-to-peer network of untrusted machines on the Internet to detect new worms and facilitate rapid preventative response. We evaluate the efficacy and scalability of the proposed system through large-scale simulations and assessments of a functional real-world prototype. We find that the system enjoys scalability in terms of network coverage, faulttolerance, security, and maintainability. It proves effective against new worms, and supports collaboration among among mutually mistrusting parties.

grouptheory/PRouST

PNNI Routing and Simulation Toolkit

grouptheory/SEAN

Signaling Entity for ATM networks

grouptheory/Sousa

grouptheory/telefunken

grouptheory/telefunken-data

grouptheory/telefunken-support

Supporting materials for the paper "One-step Estimation of Networked Population Size: Respondent-Driven Capture-Recapture with Anonymity"

grouptheory/transdiscipline