Eric Rosenberg – författare

The latest volume in the "Defining Moments in American Photography" series, "Trauma and Documentary Photography of the FSA" proposes that we reconsider the work of the Farm Security Administration and its most beloved photographers in light of various forms of trauma in the 1930s. The authors offer new ways to understand this body of work by exploring a more variable idea of documentary photography than what the New Dealers proposed. Taking a critical look at the FSA photography project, they identify its goals, biases, contradictions, and ambivalences, while discerning strikingly independent directions among its photographers. Blair and Rosenberg discuss how, in the hands of socially minded photographers seeking to address and publicize suffering, photography and trauma mixed. In the volatility of that mixture, they argue, competing ideas for documentary took shape. Among the key figures studied here are some of the most beloved in American photography, including Walker Evans, Ben Shahn, and Aaron Siskind.

Whereas unicast routing determines a path from one source node to one destination node, multicast routing determines a path from one source to many destinations, or from many sources to many destinations. We survey multicast routing methods for when the set of destinations is static, and for when it is dynamic. While most of the methods we review are tree based, some non-tree methods are also discussed. We survey results on the shape of multicast trees, delay constrained multicast routing, aggregation of multicast traffic, inter-domain multicast, and multicast virtual private networks. We focus on basic algorithmic principles, and mathematical models, rather than implementation level protocol details. Many historically important methods, even if not currently used, are reviewed to give perspective on the evolution of multicast routing.

Fractal Dimensions of Networks ties the theory and methods for computing fractal dimensions of networks to the “classic” theory of dimensions of geometric objects.The goal of the book is to provide a unified treatment of fractal dimensions of sets and networks.

Fractal Dimensions of Networks ties the theory and methods for computing fractal dimensions of networks to the “classic” theory of dimensions of geometric objects.The goal of the book is to provide a unified treatment of fractal dimensions of sets and networks.

Many different fractal dimensions have been proposed for networks. In A Survey of Fractal Dimensions of Networks the theory and computation of the most important of these dimensions are reviewed, including the box counting dimension, the correlation dimension, the mass dimension, the transfinite fractal dimension, the information dimension, the generalized dimensions (which provide a way to describe multifractals), and the sandbox method (for approximating the generalized dimensions). The book describes the use of diameter-based and radius-based boxes, and presents several heuristic methods for box counting, including greedy coloring, random sequential node burning, and a method for computing a lower bound. We also discuss very recent results on resolving ambiguity in the calculation of the information dimension and the generalized dimensions, and on the non-monotonicity of the generalized dimensions. Anyone interested in the theory and application of networks will want to read this Brief. This includes anyone studying, e.g., social networks, telecommunications networks, transportation networks, ecological networks, food chain networks, network models of the brain, or financial networks.