Superconducting Quantum Metamaterials from High Pressure Melt Infiltration of Metals into Block Copolymer Double Gyroid Derived Ceramic Templates

Mesoscale order can lead to emergent properties including phononic bandgaps or topologically protected states. Block copolymers offer a route to mesoscale periodic architectures, but their use as structure directing agents for metallic materials has not been fully realized. A versatile approach to mesostructured metals via bulk block copolymer self-assembly derived ceramic templates, is demonstrated. Molten indium is infiltrated into mesoporous, double gyroidal silicon nitride templates under high pressure to yield bulk, 3D periodic nanocomposites as free-standing monoliths which exhibit emergent quantum-scale phenomena. Vortices are artificially introduced when double gyroidal indium metal behaves as a type II superconductor, with evidence of strong pinning centers arrayed on the order of the double gyroid lattice size. Sample behavior is reproducible over months, showing high stability. High pressure infiltration of bulk block copolymer self-assembly based ceramic templates is an enabling tool for studying high-quality metals with previously inaccessible architectures, and paves the way for the emerging field of block-copolymer derived quantum metamaterials.     

A wavelet transform algorithm for peak detection and application to powder x-ray diffraction data

Peak detection is ubiquitous in the analysis of spectral data. While many noise-filtering algorithms and peak identification algorithms have been developed, recent work [P. Du, W. Kibbe, and S. Lin, Bioinformatics 22, 2059 (2006); A. Wee, D. Grayden, Y. Zhu, K. Petkovic-Duran, and D. Smith, Electrophoresis 29, 4215 (2008)] has demonstrated that both of these tasks are efficiently performed through analysis of the wavelet transform of the data. In this paper, we present a wavelet-based peak detection algorithm with user-defined parameters that can be readily applied to the application of any spectral data. Particular attention is given to the algorithm's resolution of overlapping peaks. The algorithm is implemented for the analysis of powder diffraction data, and successful detection of Bragg peaks is demonstrated for both low signal-to-noise data from theta-theta diffraction of nanoparticles and combinatorial x-ray diffraction data from a composition spread thin film. These datasets have different types of background signals which are effectively removed in the wavelet-based method, and the results demonstrate that the algorithm provides a robust method for automated peak detection.     

Enhanced photocatalytic performance and impact of annealing temperature on TiO2/Gd2O3:Fe composite

Journal of Materials Science: Materials in Electronics - This work relates to an experimental study concerning the elaboration of the composite material TiO2/Gd2O3:Fe (TiO–Gd:Fe) from powders...     

Three-dimensional X-ray microscopy with accurate registration of tomographic sections

X-ray microtomography has been used to study the internal flaws and external shape of a 0.75 × 1 mm copper sulphate crystal at a resolution of 25 μm. The problems of accurate tomographic reconstruction and the subsequent registration of the reconstructed sections to give a complete 3-D image are considered when the position of the axis of rotation of the specimen varies slightly between projections.     

Characterization of Secure Multiparty Computation Without Broadcast

A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work is the necessity of a broadcast channel for securely computing symmetric functionalities (where all the parties receive the same output) when one third of the parties, or more, might be corrupted. Assuming all parties are connected via a point-to-point network, but no broadcast channel (nor a secure setup phase) is available, we prove the following characterization:

• A symmetric n-party functionality can be securely computed facing \(n/3\le t<n/2\) corruptions (i.e., honest majority), if and only if it is \((n-2t)\) -dominated; a functionality is k-dominated, if any k-size subset of its input variables can be set to determine its output to some predetermined value.
• Assuming the existence of one-way functions, a symmetric n-party functionality can be securely computed facing \(t\ge n/2\) corruptions (i.e., no honest majority), if and only if it is 1-dominated and can be securely computed with broadcast.

It follows that, in case a third of the parties might be corrupted, broadcast is necessary for securely computing non-dominated functionalities (in which “small” subsets of the inputs cannot determine the output), including, as interesting special cases, the Boolean XOR and coin-flipping functionalities.

     

Completeness for Symmetric Two-Party Functionalities: Revisited

Understanding the minimal assumptions required for carrying out cryptographic tasks is one of the fundamental goals of theoretic cryptography. A rich body of work has been dedicated to understanding the complexity of cryptographic tasks in the context of (semi-honest) secure two-party computation. Much of this work has focused on the characterization of trivial and complete functionalities (resp., functionalities that can be securely implemented unconditionally, and functionalities that can be used to securely compute all functionalities). Most previous works define reductions via an ideal implementation of the functionality; i.e., f reduces to g if one can implement f using a black-box (or oracle) that computes the function g and returns the output to both parties. Such a reduction models the computation of f as an atomic operation. However, in the real world, protocols proceed in rounds, and the output is not learned by the parties simultaneously. In this paper, we show that this distinction is significant. Specifically, we show that there exist symmetric functionalities (where both parties receive the same outcome) that are neither trivial nor complete under “black-box reductions,” and yet the existence of a constant-round protocol for securely computing such a functionality implies infinitely often oblivious transfer (meaning that it is secure for infinitely many values of the security parameter). In light of the above, we propose an alternative definitional infrastructure for studying the triviality and completeness of functionalities.     

Fatigue analysis of offshore platforms subject to sea wave loadings

The fatigue damage calculation for random loading on offshore platforms takes the form of a rainflow analysis of the dynamic response of individual members to various sea states. This procedure is lengthu and consequently this paper attempts to provide a theoretical method for determining random load fatigue damage. This dynamic response for many joints leads to a broad band random loading but despite this, previous theoretical methods have simplified the loading to narrow band. This has not been done in the present case; instead, an analysis based on broad band random loading has been produced. This theoretical approach gives a fatigue life estimate which is slightly (6.6%) more conservative, for a typical example, than a rainflow analysis.