A combined measure for quantifying and qualifying the topology preservation of growing self-organizing maps

The Self-OrganizingMap (SOM) is a neural network model that performs an ordered projection of a high dimensional input space in a low-dimensional topological structure. The process in which such mapping is formed is defined by the SOM algorithm, which is a competitive, unsupervised and nonparametric method, since it does not make any assumption about the input data distribution. The feature maps provided by this algorithm have been successfully applied for vector quantization, clustering and high dimensional data visualization processes. However, the initialization of the network topology and the selection of the SOM training parameters are two difficult tasks caused by the unknown distribution of the input signals. A misconfiguration of these parameters can generate a feature map of low-quality, so it is necessary to have some measure of the degree of adaptation of the SOM network to the input data model. The topologypreservation is the most common concept used to implement this measure. Several qualitative and quantitative methods have been proposed for measuring the degree of SOM topologypreservation, particularly using Kohonen's model. In this work, two methods for measuring the topologypreservation of the Growing Cell Structures (GCSs) model are proposed: the topographic function and the topology preserving ma

Algorithms on Ideal over Complex Multiplication order

We show in this paper that the Gentry-Szydlo algorithm for cyclotomic orders, previously revisited by Lenstra-Silverberg, can be extended to complex-multiplication (CM) orders, and even to a more general structure. This algorithm allows to test equality over the polarized ideal class group, and finds a generator of the polarized ideal in polynomial time. Also, the algorithm allows to solve the norm equation over CM orders and the recent reduction of principal ideals to the real suborder can also be performed in polynomial time. Furthermore, we can also compute in polynomial time a unit of an order of any number field given a (not very precise) approximation of it. Our description of the Gentry-Szydlo algorithm is different from the original and Lenstra- Silverberg's variant and we hope the simplifications made will allow a deeper understanding. Finally, we show that the well-known speed-up for enumeration and sieve algorithms for ideal lattices over power of two cyclotomics can be generalized to any number field with many roots of unity.Comment: Full version of a paper submitted to ANT

Semi phenomenological modelling of the behavior of TRIP steels

The authors are grateful to ArcelorMittal R&D for supporting this research.A new semi-phenomenological model is developed based on a mean-field description of the TRIP behavior for the simulation of multiaxial loads. This model intends to reduce the number of internal variables of crystalline models that cannot be used for the moment in metal forming simulations. Starting from local and crystallographic approaches, the mean-field approach is obtained at the phase level with the concept of Mean Instantaneous Transformation Strain (MITS) accompanying martensitic transformation. Within the framework of the thermodynamics of irreversible processes, driving forces, martensitic volume fraction evolution and an expression of the TRIP effect are determined for this new model. A classical self-consistent scheme is used to model the behavior of multiphased TRIP steels. The model is tested for cooling at constant loads and for multiaxial loadings at constant temperatures. The predictions reproduce the increase in ductility, the dynamic softening effect and the multiaxial behavior of a multiphased TRIP stee

Decoding by Embedding: Correct Decoding Radius and DMT Optimality

The closest vector problem (CVP) and shortest (nonzero) vector problem (SVP) are the core algorithmic problems on Euclidean lattices. They are central to the applications of lattices in many problems of communications and cryptography. Kannan's \emph{embedding technique} is a powerful technique for solving the approximate CVP, yet its remarkable practical performance is not well understood. In this paper, the embedding technique is analyzed from a \emph{bounded distance decoding} (BDD) viewpoint. We present two complementary analyses of the embedding technique: We establish a reduction from BDD to Hermite SVP (via unique SVP), which can be used along with any Hermite SVP solver (including, among others, the Lenstra, Lenstra and Lov\'asz (LLL) algorithm), and show that, in the special case of LLL, it performs at least as well as Babai's nearest plane algorithm (LLL-aided SIC). The former analysis helps to explain the folklore practical observation that unique SVP is easier than standard approximate SVP. It is proven that when the LLL algorithm is employed, the embedding technique can solve the CVP provided that the noise norm is smaller than a decoding radius $\lambda_1/(2\gamma)$, where $\lambda_1$ is the minimum distance of the lattice, and $\gamma \approx O(2^{n/4})$. This substantially improves the previously best known correct decoding bound $\gamma \approx {O}(2^{n})$. Focusing on the applications of BDD to decoding of multiple-input multiple-output (MIMO) systems, we also prove that BDD of the regularized lattice is optimal in terms of the diversity-multiplexing gain tradeoff (DMT), and propose practical variants of embedding decoding which require no knowledge of the minimum distance of the lattice and/or further improve the error performance.Comment: To appear in IEEE Transactions on Information Theor

Marginal Fermi Liquid Theory in the Hubbard Model

We find Marginal Fermi Liquid (MFL) like behavior in the Hubbard model on a square lattice for a range of hole doping and on-site interaction parameter U. Thereby we use a self-consistent projection operator method. It enables us to compute the momentum and frequency dependence of the single-particle excitations with high resolution. The Fermi surface is found to be hole-like in the underdoped and electron-like in the overdoped regime. When a comparison is possible we find consistency with finite temperature quantum Monte Carlo results. We also find a discontinuous change with doping concentration from a MFL to Fermi liquid behavior resulting from a collapse of the lower Hubbard band. This renders Luttinger's theorem inapplicable in the underdoped regime.Comment: 8 pages, 6 figure

A single molecule switch based on two Pd nanocrystals linked by a conjugated dithiol

Tunneling spectroscopy measurements have been carried out on a single molecule device formed by two Pd nanocrystals (dia, $\sim$5 nm) electronically coupled by a conducting molecule, dimercaptodiphenylacetylene. The I-V data, obtained by positioning the tip over a nanocrystal electrode, exhibit negative differential resistance (NDR) on a background M-I-M characteristics. The NDR feature occurs at $\sim$0.67 V at 300 K and shifts to a higher bias of 1.93 V at 90 K. When the tip is held in the middle region of the device, a coulomb blockade region is observed ($\pm\sim$0.3 V).Comment: Accepted in Praman

Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14].1

AbstractIn this paper we study a reactive extension of constraint logic programming (CLP). Our primary concerns are search problems in a dynamic environment, where interactions with the user (e.g. in interactive multi-criteria optimization problems) or interactions with the physical world (e.g. in time evolving problems) can be modeled and solved efficiently. Our approach is based on a complete set of query manipulation commands for both the addition and the deletion of constraints and atoms in the query. We define a fully incremental model of execution which, contrary to other proposals, retains as much information as possible from the last derivation preceding a query manipulation command. The completeness of the execution model is proved in a simple framework of transformations for CSLD derivations, and of constraint propagation seen as chaotic iteration of closure operators. A prototype implementation of this execution model is described and evaluated on two applications