Network flow recording is an important tool with applications that range from legal compliance and security auditing to network forensics, troubleshooting, and marketing. Unfortunately, current network flow recording technologies do not allow network operators to enforce a privacy policy on the data that is recorded, in particular how this data is stored and used within the organization. Challe...

Introduction. The problem discussed in this paper was formulated by T. Harris as follows: "Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other." While this can be set up as a linear prog...

1 Basic definitions and properties Definition 1.1. A flow network is a directed graph D = (V,E) with two distinguished vertices s and t called the source and the sink, respectively. Moreover, each arc (u, v) ∈ E has a certain capacity c(u, v) ≥ 0 assigned to it. If (u, v) / ∈ E (including pairs of the form (u, u)), we assume c(u, v) = 0. In this note, we shall restrict ourselves to the case whe...

In query based Web search, a significant percentage of user queries are underspecified, most likely by naive users. Collaborative ranking helps the naive user by exploiting the collective expertise. We present a novel algorithmic model inspired by the network flow theory, which constructs a search network based on search engine logs to describe the relationship between the relevant entities in ...

Network Coding (NC) is a means to improve network performance in various ways. Most evaluations so far were done with simplified assumptions about the application scenario, namely equal data rates and packet sizes for traffic to be encoded. Traffic in real networks, however, does not have this property. Hence, as deterministic and random NC require these properties, flows have to be synchronize...

In this network we have two special vertices: a source vertex s and a sink vertex t. Our goal is to send the maximum amount of flow from s to t; flow can only travel along arcs in the right direction, and is constrained by the arc capacities. This “flow” could be many things: imagine sending water along pipes, with the capacity representing the size of the pipe; or traffic, with the capacity be...

Recently, particular attention has been paid to the stepped spillways due to the increasing effect of energy dissipation and the reduction of cavitations risks with the development of Roller Compacted Concrete (RCC) technique. Flow regimes on the spillways divide into three groups, namely skimming, jet and transition flow. Compared to the numerical methods, the majority of performed studies in ...