entropy, software systems, structure, metric How does one measure a large software system to determine if it is "well-structured"? This report proposes a metric for doing just that, based on the concept of entropy from information theory. A tool that automatically extracts the metric from source code was built and used to compare two large software systems (each about 500,00 lines of source cod...

We present a new class of MDS array codes of size n n (n a prime number) called X-Code. The X-Codes are of minimum column distance 3, namely, they can correct either one column error or two column erasures. The key novelty in X-Code is that it has a simple geometrical construction which achieves encoding/update optimal complexity, i.e., a change of any single information bit a ects exactly two ...

We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below with the number of vertices minus the size of the graph’s shortest index code. We show that the Network Coding solvability of each specific multiple unicast n...

there are dierent ways to code the geodesic flows on surfaces with negative curvature. such code spaces give a useful tool to verify the dynamical properties of geodesic flows. here we consider special subspaces of geodesic flows on hecke surface whose arithmetic codings varies on a set with innite alphabet. then we will compare the topological complexity of them by computing their topologica...

Csiszár’s forward -cutoff rate (given a fixed 0) for a discrete source is defined as the smallest number such that for every , there exists a sequence of fixed-length codes of rate with probability of error asymptotically vanishing as . For a discrete memoryless source (DMS), the forward -cutoff rate is shown by Csiszár [6] to be equal to the source Rényi entropy. An analogous concept of revers...

There are dierent ways to code the geodesic flows on surfaces with negative curvature. Such code spaces give a useful tool to verify the dynamical properties of geodesic flows. Here we consider special subspaces of geodesic flows on Hecke surface whose arithmetic codings varies on a set with innite alphabet. Then we will compare the topological complexity of them by computing their topological ...

Conformational entropy for atomic-level, three dimensional biomolecules is known experimentally to play an important role in protein-ligand discrimination, yet reliable computation of entropy remains a difficult problem. Here we describe the first two accurate and efficient algorithms to compute the conformational entropy for RNA secondary structures, with respect to the Turner energy model, wh...