Dense packing crystal structures of physical tetrahedra

We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal mathematical tetrahedron into a less ideal, physical, tetrahedron and all the way to the sphere. Thus, we also connect the two well studied problems of sphere packing and tetrahedron packing on a single axis. Our numerical results uncover a rich optimal-packing behavior, compared to that of other continuous families of particles previously studied. We present four structures as candidates for the optimal packing at different values of the parameter, providing an atlas of crystal structures which might be observed in systems of nano-particles with tetrahedral symmetry

An in vitro assessment using transverse microradiography of the effect on mineral loss of etching enamel for in situ studies.

OBJECTIVES: To test the hypothesis that etching enamel with 37% phosphoric acid for 30 s does not lead to detectable mineral loss when measured with transverse microradiography (TMR). DESIGN: An in vitro laboratory investigation. EXPERIMENTAL VARIABLE: Forty bovine incisors were used in the experiment. The crowns of the teeth were covered with acid resistant varnish except for a rectangular area on the labial surface approximately 10 x 12 mm. On the exposed labial surface of 20 teeth an enamel lesion similar to that used in the in situ caries model was induced. Twenty teeth were left without a lesion. The exposed area was divided into three areas of equal size. The control area (C) was covered with acid resistant varnish throughout the experiment. The first experimental area (E1) was etched with 37% phosphoric acid for 30 s and a simulated bracket was bonded to the surface with composite resin. The second experimental area (E2) was left exposed for the remainder of the experiment. The teeth were placed in a demineralizing solution for 24, 48, 72 or 96 h to replicate different cariogenic challenges. OUTCOME MEASURE: Mineral loss as measured with TMR. RESULTS: There were no significant differences in the mineral loss between etched (E1) and etched (C) areas of enamel. There were significant differences in mineral loss between E1 and E2 for the 48 h (p < 0.001) and 72 h (p = 0.001) exposures without a pre-formed enamel lesion. CONCLUSION: There is no detectable mineral loss with TMR when enamel has been etched for 37% phosphoric acid for 30 s. The use of in situ enamel specimens with acid etch retained simulated brackets to investigate demineralization during orthodontics will not significantly affect the outcome compared with unetched specimens

Information mobility in complex networks

The concept of information mobility in complex networks is introduced on the basis of a stochastic process taking place in the network. The transition matrix for this process represents the probability that the information arising at a given node is transferred to a target one. We use the fractional powers of this transition matrix to investigate the stochastic process at fractional time intervals. The mobility coefficient is then introduced on the basis of the trace of these fractional powers of the stochastic matrix. The fractional time at which a network diffuses 50% of the information contained in its nodes (1/ k50 ) is also introduced. We then show that the scale-free random networks display better spread of information than the non scale-free ones. We study 38 real-world networks and analyze their performance in spreading information from their nodes. We find that some real-world networks perform even better than the scale-free networks with the same average degree and we point out some of the structural parameters that make this possible

Tetrisation of triangular meshes and its application in shape blending

The As-Rigid-As-Possible (ARAP) shape deformation framework is a versatile technique for morphing, surface modelling, and mesh editing. We discuss an improvement of the ARAP framework in a few aspects: 1. Given a triangular mesh in 3D space, we introduce a method to associate a tetrahedral structure, which encodes the geometry of the original mesh. 2. We use a Lie algebra based method to interpolate local transformation, which provides better handling of rotation with large angle. 3. We propose a new error function to compile local transformations into a global piecewise linear map, which is rotation invariant and easy to minimise. We implemented a shape blender based on our algorithm and its MIT licensed source code is available online

Algorithms and literate programs for weighted low-rank approximation with missing data

Linear models identification from data with missing values is posed as a weighted low-rank approximation problem with weights related to the missing values equal to zero. Alternating projections and variable projections methods for solving the resulting problem are outlined and implemented in a literate programming style, using Matlab/Octave's scripting language. The methods are evaluated on synthetic data and real data from the MovieLens data sets

On the security of a new image encryption scheme based on chaotic map lattices

This paper reports a detailed cryptanalysis of a recently proposed encryption scheme based on the logistic map. Some problems are emphasized concerning the key space definition and the implementation of the cryptosystem using floating-point operations. It is also shown how it is possible to reduce considerably the key space through a ciphertext-only attack. Moreover, a timing attack allows the estimation of part of the key due to the existent relationship between this part of the key and the encryption/decryption time. As a result, the main features of the cryptosystem do not satisfy the demands of secure communications. Some hints are offered to improve the cryptosystem under study according to those requirements.Comment: 8 pages, 8 Figure

An algorithm to compute the polar decomposition of a 3 × 3 matrix

We propose an algorithm for computing the polar decomposition of a 3 × 3 real matrix that is based on the connection between orthogonal matrices and quaternions. An important application is to 3D transformations in the level 3 Cascading Style Sheets specification used in web browsers. Our algorithm is numerically reliable and requires fewer arithmetic operations than the alternative of computing the polar decomposition via the singular value decomposition

Solution of the Multi-Channel Anderson Impurity Model: Ground state and thermodynamics

We present the solution of the SU(N) x SU(M) Anderson impurity model using the Bethe-Ansatz. We first explain what extensions to the formalism were required for the solution. Subsequently we determine the ground state and derive the thermodynamics over the full range of temperature and fields. We identify the different regimes of valence fluctuation at high temperatures, followed by moment formation or intrinsic mixed valence at intermediate temperatures and a low temperature non-Fermi liquid phase. Among other things we obtain the impurity entropy, charge valence and specific heat over the full range of temperature. We show that the low-energy physics is governed by a line of fixed points. This describes non-Fermi-liquid behavior in the integral valence regime, associated with moment formation, as well as in the mixed valence regime where no moment forms.Comment: 28 pages, 8 figures, 1 tabl

Googling the brain: discovering hierarchical and asymmetric network structures, with applications in neuroscience

Hierarchical organisation is a common feature of many directed networks arising in nature and technology. For example, a well-defined message-passing framework based on managerial status typically exists in a business organisation. However, in many real-world networks such patterns of hierarchy are unlikely to be quite so transparent. Due to the nature in which empirical data is collated the nodes will often be ordered so as to obscure any underlying structure. In addition, the possibility of even a small number of links violating any overall “chain of command” makes the determination of such structures extremely challenging. Here we address the issue of how to reorder a directed network in order to reveal this type of hierarchy. In doing so we also look at the task of quantifying the level of hierarchy, given a particular node ordering. We look at a variety of approaches. Using ideas from the graph Laplacian literature, we show that a relevant discrete optimization problem leads to a natural hierarchical node ranking. We also show that this ranking arises via a maximum likelihood problem associated with a new range-dependent hierarchical random graph model. This random graph insight allows us to compute a likelihood ratio that quantifies the overall tendency for a given network to be hierarchical. We also develop a generalization of this node ordering algorithm based on the combinatorics of directed walks. In passing, we note that Google’s PageRank algorithm tackles a closely related problem, and may also be motivated from a combinatoric, walk-counting viewpoint. We illustrate the performance of the resulting algorithms on synthetic network data, and on a real-world network from neuroscience where results may be validated biologically