Repairable Replication-based Storage Systems Using Resolvable Designs

We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in prior work and consist of an outer MDS code followed by an inner fractional repetition (FR) code where copies of the coded symbols are placed on the storage nodes. The main challenge in this domain is the design of the inner FR code. In our work, we consider generalizations of FR codes, by establishing their connection with a family of combinatorial structures known as resolvable designs. Our constructions based on affine geometries, Hadamard designs and mutually orthogonal Latin squares allow the design of systems where a new node can be exactly regenerated by downloading $\beta \geq 1$ packets from a subset of the surviving nodes (prior work only considered the case of $\beta = 1$). Our techniques allow the design of systems over a large range of parameters. Specifically, the repetition degree of a symbol, which dictates the resilience of the system can be varied over a large range in a simple manner. Moreover, the actual table needed for the repair can also be implemented in a rather straightforward way. Furthermore, we answer an open question posed in prior work by demonstrating the existence of codes with parameters that are not covered by Steiner systems

Hydrogenated and deuterated iron clusters: Infrared spectra and density functional calculations

Iron clusters react sequentially with hydrogen molecules to form multiply hydrogenated products. The increases in cluster ionization potential upon reaction verify that hydrogen chemisorbs dissociatively to form iron cluster–hydride complexes, FenHm. At low source temperatures, the cluster–hydride complexes take up additional hydrogen molecules which are shown to be physisorbed onto the underlying FenHm complexes to form FenHm(H2)p species. The infrared spectra of FenHm and FenDm (n = 9–20) were obtained by the photodissociation action spectroscopic method in which depletion of the FenHm(H2)p and FenDm(D2)p species was the signature of absorption. The spectra, recorded in the 885–1090 cm−1 region, consist of several overlapping bands, each approximately 20 cm−1 in width. The dissimilarity of each FenHm(H2)p spectrum with the corresponding FenDm(D2)p spectrum indicates that the carrier involves hydrogen and is not merely due to absorption by the underlying iron cluster. Density functional calculations were performed on model complexes, Fe13H14 and Fe13D14, the iron portion of which was assumed to have Th symmetry. The infrared-active vibrational frequencies involving hydrogen bending and deuterium stretching are predicted to lie within the experimental frequency range of the experiment, well removed from the skeletal modes of the underlying iron cluster. The complexity of the observed spectra as compared to simulations based on the assumed (high-symmetry) model imply that the experimentally produced complexes possess low symmetry

Fully three-dimensional sound speed-corrected multi-wavelength photoacoustic breast tomography

Photoacoustic tomography is a contrast agent-free imaging technique capable of visualizing blood vessels and tumor-associated vascularization in breast tissue. While sophisticated breast imaging systems have been recently developed, there is yet much to be gained in imaging depth, image quality and tissue characterization capability before clinical translation is possible. In response, we have developed a hybrid photoacoustic and ultrasound-transmission tomographic system PAM3. The photoacoustic component has for the first time three-dimensional multi-wavelength imaging capability, and implements substantial technical advancements in critical hardware and software sub-systems. The ultrasound component enables for the first time, a three-dimensional sound speed map of the breast to be incorporated in photoacoustic reconstruction to correct for inhomogeneities, enabling accurate target recovery. The results demonstrate the deepest photoacoustic breast imaging to date namely 48 mm, with a more uniform field of view than hitherto, and an isotropic spatial resolution that rivals that of Magnetic Resonance Imaging. The in vivo performance achieved, and the diagnostic value of interrogating angiogenesis-driven optical contrast as well as tumor mass sound speed contrast, gives confidence in the system's clinical potential.Comment: 33 pages Main Body, 9 pages Supplementary Materia

A design for the generation of temporally-coherent radiation pulses in the VUV and beyond by a self-seeding high-GaIn free electron laser amplifier

A proposal for a self-seeding, tunable free-electron laser amplifier operating in the vacuum ultra-violet (VUV) region of the spectrum is presented. Full three-dimensional (3D) modelling of the free electron laser and the optical feedback system has been carried out. Simulations demonstrate the generation of near transform limited radiation pulses with peak powers in the hundreds of megawatts. Preliminary 1D simulations show that by using a similar system it may be possible to extend such operation beyond the VUV to higher photon energies

Dagstuhl Reports : Volume 1, Issue 2, February 2011

Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn

Algorithms to Exploit Data Sparsity

While data in the real world is very high-dimensional, it generally has some underlying structure; for instance, if we think of an image as a set of pixels with associated color values, most possible settings of color values correspond to something more like random noise than what we typically think of as a picture. With an appropriate transformation of basis, this underlying structure can often be converted into sparsity in data, giving an equivalent representation of the data where the magnitude is large in only a few directions relative to the ambient dimension. This motivates a variety of theoretical questions around designing algorithms that can exploit this data sparsity to achieve better performance than what would be possible naively, and in this thesis we tackle several such questions.We first examine the question of simply approximating the level of sparsity of a signal under several different measurement models, a natural first step if the sparsity is to be exploited by other algorithms. Second, we look at a particular sparse signal recovery problem called nonadaptive probabilistic group testing, and investigate the question of exactly how sparse the signal needs to be before the methods used for recovering sparse signals outperform those used for non-sparse signals. Third, we prove novel upper bounds on the number of measurements needed to recover a sparse signal in the universal one-bit compressed sensing model of sparse signal recovery. Fourth, we give some approximations of an information-theoretic quantity called the index coding rate of a network modeled by a graph, in the special case that the graph is sparse or otherwise highly structured. For each of the problems considered, we also discuss some remaining open questions and conjectures, as well as possible directions towards their solutions