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.

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.

Current interest in fractal dimensions of networks is the result of more than a century of previous research on dimensions. 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.  Since almost all of the major concepts in fractal dimensions originated in the study of sets, the book achieves this goal by first clearly presenting, with an abundance of examples and illustrations, the theory and algorithms for sets, and then showing how the theory and algorithms have been applied to networks. Thus, the book presents the classical theory and algorithms for the box counting dimension for sets, and then presents the box counting dimension for networks. All the major fractal dimensions are studied, e.g., the correlation dimension, the information dimension, the Hausdorff dimension, the multifractal spectrum, as well as many lesser known dimensions.  Algorithm descriptions are accompanied by worked examples, many applications of the methods are presented, and many exercises, ranging in difficulty from easy to research level, are included.

Current interest in fractal dimensions of networks is the result of more than a century of previous research on dimensions. 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.  Since almost all of the major concepts in fractal dimensions originated in the study of sets, the book achieves this goal by first clearly presenting, with an abundance of examples and illustrations, the theory and algorithms for sets, and then showing how the theory and algorithms have been applied to networks. Thus, the book presents the classical theory and algorithms for the box counting dimension for sets, and then presents the box counting dimension for networks. All the major fractal dimensions are studied, e.g., the correlation dimension, the information dimension, the Hausdorff dimension, the multifractal spectrum, as well as many lesser known dimensions.  Algorithm descriptions are accompanied by worked examples, many applications of the methods are presented, and many exercises, ranging in difficulty from easy to research level, are included.

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.

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.

Scientific Essay from the year 2011 in the subject History - Miscellaneous, grade: 93.00, Vanderbilt University, language: English, abstract: With almost utmost certainty, the sun will rise in the east, set in the west, and Major League Baseball will begin a new season in the spring. Such has been assured since 1871, as professional baseball first complemented everyday American life by virtue of the National Association of Professional Base Ball Player's (NAPBBP) inaugural season. The formation of the NAPBBP denoted a fundamental separation of amateur and professional baseball clubs, and the eternal intertwining of sport and business. This moment in history would more broadly beget a critical juncture in the development of the modern American identity as this era of the nineteenth century is characterized by a generation of citizens who have only known an autonomous United States, thereby distinguishable as the first purely born and bred American population. With this new status came the need to comprehend what constituted wholly American values beyond just regional, economic, and social distinctions, the remnants of a fractious colonial past. Baseball quickly became part of this new sense of American similitude, labeled the "e;national pastime"e; for nearly its entire existence. As baseball grew from a regional game into a nationwide phenomenon, more drastic change accompanied, by means of money permeating the sport. The five seasons of NAPBBP play from 1871 to 1876 transpired during a decidedly dynamic period of American history. The societal identity formation occurring during the early stages of the Gilded Age corresponds both in time, and essence, with baseball's maturation process, culminating in a purely professional NAPBBP. Through analyzing these simultaneous processes, their relation to one another, and the notion of baseball as a microcosm of American society, what characteristics became inherently American, who had the power to actually establish these allegedly universal ideals, and the implications such principles had on the nation's population become apparent. Baseball, and more specifically the NAPBBP, offered the principal values of late nineteenth century collective American society.