Algorithms for Constructing Overlay Networks For Live Streaming

We present a polynomial time approximation algorithm for constructing an overlay multicast network for streaming live media events over the Internet. The class of overlay networks constructed by our algorithm include networks used by Akamai Technologies to deliver live media events to a global audience with high fidelity. We construct networks consisting of three stages of nodes. The nodes in the first stage are the entry points that act as sources for the live streams. Each source forwards each of its streams to one or more nodes in the second stage that are called reflectors. A reflector can split an incoming stream into multiple identical outgoing streams, which are then sent on to nodes in the third and final stage that act as sinks and are located in edge networks near end-users. As the packets in a stream travel from one stage to the next, some of them may be lost. A sink combines the packets from multiple instances of the same stream (by reordering packets and discarding duplicates) to form a single instance of the stream with minimal loss. Our primary contribution is an algorithm that constructs an overlay network that provably satisfies capacity and reliability constraints to within a constant factor of optimal, and minimizes cost to within a logarithmic factor of optimal. Further in the common case where only the transmission costs are minimized, we show that our algorithm produces a solution that has cost within a factor of 2 of optimal. We also implement our algorithm and evaluate it on realistic traces derived from Akamai's live streaming network. Our empirical results show that our algorithm can be used to efficiently construct large-scale overlay networks in practice with near-optimal cost

Capital and Punishment: Resource Scarcity Increases Endorsement of the Death Penalty

Faced with punishing severe offenders, why do some prefer imprisonment whereas others impose death? Previous research exploring death penalty attitudes has primarily focused on individual and cultural factors. Adopting a functional perspective, we propose that environmental features may also shape our punishment strategies. Individuals are attuned to the availability of resources within their environments. Due to heightened concerns with the costliness of repeated offending, we hypothesize that individuals tend toward elimination-focused punishments during times of perceived scarcity. Using global and United States data sets (studies 1 and 2), we find that indicators of resource scarcity predict the presence of capital punishment. In two experiments (studies 3 and 4), we find that activating concerns about scarcity causes people to increase their endorsement for capital punishment, and this effect is statistically mediated by a reduced willingness to risk repeated offenses. Perceived resource scarcity shapes our punishment preferences, with important policy implications

Effects of ionizing radiation on charge-coupled imagers

The effects of ionizing radiation on three different charge coupled imagers have been investigated. Device performance was evaluated as a function of total gamma ray dose. The principal failure mechanisms have been identified for each particular device structure. The clock and bias voltages required for high total dose operation of the devices are presented

Discussion on the Paper by Neumann, Evett and Skerrett

Neumann, Evett, and Skerrett have made a major contribution to the art and science of fingerprint identification. This is an important—perhaps historic—step forward in the intellectual history of fingerprint identification and perhaps other fields of pattern matching forensic science. Their work deals ingeniously with the elusive problem of placing forensic identification on an empirically sound, quantitative foundation

Discussion on the Paper by Neumann, Evett and Skerrett

Neumann, Evett, and Skerrett have made a major contribution to the art and science of fingerprint identification. This is an important—perhaps historic—step forward in the intellectual history of fingerprint identification and perhaps other fields of pattern matching forensic science. Their work deals ingeniously with the elusive problem of placing forensic identification on an empirically sound, quantitative foundation

Maximum induced trees in graphs

AbstractLet t(G) be the maximum size of a subset of vertices of a graph G that induces a tree. We investigate the relationship of t(G) to other parameters associated with G: the number of vertices and edges, the radius, the independence number, maximum clique size and connectivity. The central result is a set of upper and lower bounds for the function f(n, ϱ), defined to be the minimum of t(G) over all connected graphs with n vertices and n − 1′ + ϱ edges. The bounds obtained yield an asymptotic characterization of the function correct to leading order in almost all ranges. The results show that f(n, ϱ) is surprisingly small; in particular f(n, cn) = 2 loglogn + O(logloglogn) for any constant c > 0, and f(n, n1 + γ) = 2 log(1 + 1γ) ± 4 for 0 < γ < 1 and n sufficiently large. Bounds on t(G) are obtained in terms of the size of the largest clique. These are used to formulate bounds for a Ramsey-type function, N(k, t), the smallest integer so that every connected graph on N(k, t) vertices has either a clique of size k or an induced tree of size t. Tight bounds for t(G) from the independence number α(G) are also proved. It is shown that every connected graph with radius r has an induced path, and hence an induced tree, on 2r − 1 vertices

Largest Digraphs Contained IN All N-tournaments

Let f(n) (resp. g(n)) be the largest m such that there is a digraph (resp. a spanning weakly connected digraph) on n-vertices and m edges which is a subgraph of every tournament on n-vertices. We prove that n log2 n--cxn&gt;=f(n) ~_g(n) ~- n log ~ n--c..n loglog n

Orthogonal representations and connectivity of graphs

AbstractIt is proved that a graph on n nodes is k-connected if and only if its nodes can be represented by real vectors in dimension n – k such that (a) nonadjacent nodes are represented by orthogonal vectors and (b) any n – k of them are linearly independent. We show that the closure of the set of all representations with properties (a) and (b) is irreducible as an algebraic variety, and study the question of irreducibility of the variety of all representations with property (a)

DARIS : a low-frequency distributed aperture array for radio astronomy in space

The frequency band below 30 MHz is one of the last unexplored bands in radio astronomy. This band is well suited for studying the early cosmos at high hydrogen redshifts, the so-called dark ages, extragalactic surveys, (extra) solar planetary bursts, and high energy particle physics. In addition, space research such as space weather tomography, are also areas of scientific interest. \ud \ud Due to ionospheric scintillation (below 30MHz) and its opaqueness (below 15MHz), earth-bound radio astronomy observations in these bands are either severely limited in sensitivity and spatial resolution or entirely impossible. A radio telescope in space obviously would not be hampered by the Earth's ionosphere. In the past, several (limited) studies have been conducted to explore possibilities for such an array in space. These studies considered aperture synthesis arrays in space, at the back-side of the Moon, or a satellite constellation operating in a coherent mode. \u

Histological Chages of Testis and Caput Epididymis in the Goat after Cannulation of the Rete Testis

雄ヤギ5頭を用い, 精巣網カテーテル装着手術後の精巣および精巣上体頭の組織構造を観察するとともに精巣静脈血中のテストステロン濃度を調べた。カテーテル装着手術後の精巣は, いずれも萎縮し, 正常な精子形成過程が観察される精細管は少なかった。また, ライディヒ細胞の形態や染色性には異常は認められなかった。一方, 精巣上体頭では, 精巣上体管が萎縮し, 主細胞の高さは無傷のものよりも有意に減少した。同様の組織構造の変化は, 精巣輸出管を切除した場合の精巣および精巣上体頭でも認められた。精巣静脈血中のテストステロン濃度は無傷の場合94.4ng/mlであり, カテーテル装着手術後では86.5&acd;342.8ng/mlであった。 / The testis and caput epididymis of the goat after cannulation of the rete testis or efferentiectomy were examined histologically. The concentration of testosterone in testicular venous blood collected from the same animals was also measured by radioimmunoassay. After cannulation, seminiferous tubules showed a sign of degeneration, although no morphological change of Leydig cells was observed. Epididymal ducts were severely atrophied and the height of principal epithelial cells was significantly decreased. A similar damage was observed in the testis and epididymis after efferentiectomy. When the efferent duct bundle had been incompletely ligated at cannulation, or rete testis catheter was kept in place until sampling time, damages in the testis were less severe. And in the former case the epididymis was impaired less severely. The concentration of testosterone in testicular venous blood collected from an intact animal was 94.4ng/ml, while that obtained after cannulation was 86.5-342.8ng/ml. These results suggest that degeneration of germ cells in seminiferous tubules observed after cannulation of the rete testis or efferentiectomy may be caused by stagnation of rete testicular fluid in the tubules, and that testosterone in the fluid plays important roles in the maintenance of morphology and function of the principal cells in the caput epididymis