Full-field stress analysis by holographic phase-stepping implementation of the photoelastic-coating method

In this paper, we describe a system for polariscopic and holographic phase-shifting implementation of the photoelastic-coating method for a full-field stress analysis. The easiest way to build the combined system is to employ a laser light source. However, coherent illumination introduces a signal-dependent speckle noise which worsens the accurate phase estimation and unwrapping. To answer the question of how it affects the phase retrieval of isochromatics, isoclinics and isopachics, we modeled in the present paper the phase-shifting photoelastic measurement in the presence of speckle noise through the calculation of the complex amplitudes in a Mach-Zender interferometer combined with a circular polariscope and made denoising of simulated and experimental fringe patterns. The latter were recorded at pure tensile load for PhotoStress (R)-coated samples with a mechanical stress concentrator

An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes

We propose a private information retrieval (PIR) protocol for distributed storage systems with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the maximum distance separable (MDS) PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus MDS-PIR capacity-achieving.Comment: To be presented at 2018 IEEE International Symposium on Information Theory (ISIT). arXiv admin note: substantial text overlap with arXiv:1712.0389

Chemoinformatics Research at the University of Sheffield: A History and Citation Analysis

This paper reviews the work of the Chemoinformatics Research Group in the Department of Information Studies at the University of Sheffield, focusing particularly on the work carried out in the period 1985-2002. Four major research areas are discussed, these involving the development of methods for: substructure searching in databases of three-dimensional structures, including both rigid and flexible molecules; the representation and searching of the Markush structures that occur in chemical patents; similarity searching in databases of both two-dimensional and three-dimensional structures; and compound selection and the design of combinatorial libraries. An analysis of citations to 321 publications from the Group shows that it attracted a total of 3725 residual citations during the period 1980-2002. These citations appeared in 411 different journals, and involved 910 different citing organizations from 54 different countries, thus demonstrating the widespread impact of the Group's work

Simultaneous reconstruction of outer boundary shape and admittivity distribution in electrical impedance tomography

The aim of electrical impedance tomography is to reconstruct the admittivity distribution inside a physical body from boundary measurements of current and voltage. Due to the severe ill-posedness of the underlying inverse problem, the functionality of impedance tomography relies heavily on accurate modelling of the measurement geometry. In particular, almost all reconstruction algorithms require the precise shape of the imaged body as an input. In this work, the need for prior geometric information is relaxed by introducing a Newton-type output least squares algorithm that reconstructs the admittivity distribution and the object shape simultaneously. The method is built in the framework of the complete electrode model and it is based on the Fr\'echet derivative of the corresponding current-to-voltage map with respect to the object boundary shape. The functionality of the technique is demonstrated via numerical experiments with simulated measurement data.Comment: 3 figure

Coherence retrieval using trace regularization

The mutual intensity and its equivalent phase-space representations quantify an optical field's state of coherence and are important tools in the study of light propagation and dynamics, but they can only be estimated indirectly from measurements through a process called coherence retrieval, otherwise known as phase-space tomography. As practical considerations often rule out the availability of a complete set of measurements, coherence retrieval is usually a challenging high-dimensional ill-posed inverse problem. In this paper, we propose a trace-regularized optimization model for coherence retrieval and a provably-convergent adaptive accelerated proximal gradient algorithm for solving the resulting problem. Applying our model and algorithm to both simulated and experimental data, we demonstrate an improvement in reconstruction quality over previous models as well as an increase in convergence speed compared to existing first-order methods.Comment: 28 pages, 10 figures, accepted for publication in SIAM Journal on Imaging Science

Systems analysis for DSN microwave antenna holography

Proposed systems for Deep Space Network (DSN) microwave antenna holography are analyzed. Microwave holography, as applied to antennas, is a technique which utilizes the Fourier Transform relation between the complex far-field radiation pattern of an antenna and the complex aperture field distribution to provide a methodology for the analysis and evaluation of antenna performance. Resulting aperture phase and amplitude distribution data are used to precisely characterize various crucial performance parameters, including panel alignment, subreflector position, antenna aperture illumination, directivity at various frequencies, and gravity deformation. Microwave holographic analysis provides diagnostic capacity as well as being a powerful tool for evaluating antenna design specifications and their corresponding theoretical models

Exploiting sparsity to build efficient kernel based collaborative filtering for top-N item recommendation

The increasing availability of implicit feedback datasets has raised the interest in developing effective collaborative filtering techniques able to deal asymmetrically with unambiguous positive feedback and ambiguous negative feedback. In this paper, we propose a principled kernel-based collaborative filtering method for top-N item recommendation with implicit feedback. We present an efficient implementation using the linear kernel, and we show how to generalize it to kernels of the dot product family preserving the efficiency. We also investigate on the elements which influence the sparsity of a standard cosine kernel. This analysis shows that the sparsity of the kernel strongly depends on the properties of the dataset, in particular on the long tail distribution. We compare our method with state-of-the-art algorithms achieving good results both in terms of efficiency and effectiveness