Distortion

Chemical and structural variability in cubic spinel oxides

The empirical relations between cubic spinel oxides of different compositions were investigated using data from 349 refined crystal structures. The results show that the spinel structure is able to tolerate many constituents (at least 36) by enlarging and decreasing the tetrahedra and octahedra. This is reflected in a large variation in tetrahedral and octahedral bond distances. The oxygen positional parameter (u) may be regarded as a measure of the distortion of the spinel structure from cubic close packing or of the angular distortion of the octahedron.

Distortional effect on global buckling and post-buckling behaviour of steel box beams

The homotopy perturbation method (HPM) to predict the pre- and post-buckling behaviour of simply supported steel beams with rectangular hollow section (RHS) is presented in this paper. The non-linear differential equations solved by HPM derive from a kinematics where large twist and cross-sections distortions are considered. The results (linear and non-linear paths) given by the present HPM are compared to those provided by the Newton–Raphson algorithm with arc length and by the commercial FEM code Abaqus.

On the distortion of locality sensitive hashing

Given a notion of pairwise similarity between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects hash to the same value is their similarity. LSH is a powerful algorithmic tool for large scale applications and much work has been done to understand LSHable similarities, i.e., similarities that admit an LSH. In this paper we focus on similarities that are provably non-LSHable and propose a notion of distortion to capture the approximation of such a similarity by an LSHable similarity.

The distortion of locality sensitive hashing

Given a pairwise similarity notion between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects hash to the same value is their similarity. LSH is a powerful algorithmic tool for large-scale applications and much work has been done to understand LSHable similarities, i.e., similarities that admit an LSH. In this paper we focus on similarities that are provably non-LSHable and propose a notion of distortion to capture the approximation of such a similarity by a similarity that is LSHable.

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma