We prove an asymptotic estimate for the number of m×n non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate the volume of the polytope of m × n non-negative real matrices with prescribed row and column sums. Our estimates are solutions of convex optimization proble...

In this work we present various metrics to measure diversity of a domain-speci c crawl. We evaluate these metrics using domainspeci c crawl originated from ODP URLs and nd that these metrics are indeed able to capture diversity. We argue that these metrics can be used for comparing seed sets and crawling strategies with respect to diversity.

The RM-ODP definition of interaction is subtle and difficult to understand. On closer inspection, we find that it is in fact invalid. We then attempt to establish the author’s original intentions for this concept, and to provide an effective definition. Our investigations lead us to discover some fundamental flaws in the definitions of interface and of behaviour of an object.

Introduction Conclusions References Tables Figures