44 research outputs found

    Structure and spatial distribution of Ge nanocrystals subjected to fast neutron irradiation

    Get PDF
    The influence of fast neutron irradiation on the structure and spatial distribution of Ge nanocrystals (NC) embedded in an amorphous SiO2 matrix has been studied. The investigation was conducted by means of laser Raman Scattering (RS), High Resolution Transmission Electron Microscopy (HR-TEM) and X-ray photoelectron spectroscopy (XPS). The irradiation of NC-Ge samples by a high dose of fast neutrons lead to a partial destruction of the nanocrystals. Full reconstruction of crystallinity was achieved after annealing the radiation damage at 800 deg. C, which resulted in full restoration of the RS spectrum. HR-TEM images show, however, that the spatial distributions of NC-Ge changed as a result of irradiation and annealing. A sharp decrease in NC distribution towards the SiO2 surface has been observed. This was accompanied by XPS detection of Ge oxides and elemental Ge within both the surface and subsurface region

    Regret Minimization for Branching Experts

    No full text
    We study regret minimization bounds in which the dependence on the number of experts is replaced by measures of the realized complexity of the expert class. The measures we consider are defined in retrospect given the realized losses. We concentrate on two interesting cases. In the first, our measure of complexity is the number of different "leading experts", namely, experts that were best at some point in time. We derive regret bounds that depend only on this measure, independent of the total number of experts. We also consider a case where all experts remain grouped in just a few clusters in terms of their realized cumulative losses. Here too, our regret bounds depend only on the number of clusters determined in retrospect, which serves as a measure of complexity. Our results are obtained as special cases of a more general analysis for a setting of branching experts, where the set of experts may grow over time according to a tree-like structure, determined by an adversary. For this setting of branching experts, we give algorithms and analysis that cover both the full information and the bandit scenarios

    Regret minimization for branching experts

    No full text
    We study regret minimization bounds in which the dependence on the number of experts is replaced by measures of the realized complexity of the expert class. The measures we consider are defined in retrospect given the realized losses. We concentrate on two interesting cases. In the first, our measure of complexity is the number of different "leading experts", namely, experts that were best at some point in time. We derive regret bounds that depend only on this measure, independent of the total number of experts. We also consider a case where all experts remain grouped in just a few clusters in terms of their realized cumulative losses. Here too, our regret bounds depend only on the number of clusters determined in retrospect, which serves as a measure of complexity. Our results are obtained as special cases of a more general analysis for a setting of branching experts, where the set of experts may grow over time according to a tree-like structure, determined by an adversary. For this setting of branching experts, we give algorithms and analysis that cover both the full information and the bandit scenarios

    A Mesoporous Iron−Titanium Oxide Composite Prepared Sonochemically

    No full text
    corecore