Shape preservation regions for six-dimensional spaces

We analyze the critical length for design purposes of six-dimensional spaces invariant under translations and reflections containing the functions 1, cos t and sin t. These spaces also contain the first degree polynomials as well as trigonometric and/or hyperbolic functions. We identify the spaces whose critical length for design purposes is greater than 2π and find its maximum 4π. By a change of variables, two biparametric families of spaces arise. We call shape preservation region to the set of admissible parameters in order that the space has shape preserving representations for curves. We describe the shape preserving regions for both families. To our friend Mariano Gasca on occasion of his 60th birthday Research partially supported by the Spanish Research Grant MTM2006-03388, by Gobierno de Aragón and Fondo Social Europeo.     

On the concentration and determination of plutonium in natural waters by adsorption on MnO2 filters

A new method of analysis of the efficiency of four filters of MnO₂ in series which takes into account the reactions induced in plutonium by the sorbent is described. The system of differential equations describing the behaviour of plutonium in water as it passes through the filters is solved and the parameters of the filters are determined for a best fitting of the solutions corresponding to the experimental uncertainties. The method is checked by numerical simulation and then applied to water solutions with a known plutonium concentration and to some experimental results given by other authors. In all occassions the results are consistent with the possibility of determining the contents of plutonium in sea and continental waters with uncertainties of the order of 10%.     

Polynomial Stability to Three-Dimensional Magnetoelastic Waves

In this work we show that the energy associated to the linear three-dimensional magneto-elastic system decays polynomially to zero as time goes to infinity, provided the initial data is smooth enough.     

A new technique for obtaining the activation energy distribution of a relaxing system

This paper describes a robust and fast fitting procedure applicable for relaxing processes that cannot be understood as a discrete sum of single processes but require an activation energy distribution. The method is based on a set of closed-form expressions that allow the computation of the relaxation parameters directly from the isochronal curves obtained experimentally. The usefulness of this method is checked by analyzing the isochronal curves given by a theoretical energy distribution and the magnetic disaccommodation spectra observed in yttrium iron garnet (YIG) samples. PACS 02.60.Ed; 75.60.Lr; 75.50.Gg     

Algebraic Formulation of Quantum Decoherence

An algebraic formalism for quantum decoherence in systems with continuous evolution spectrum is introduced. A certain subalgebra, dense in the characteristic algebra of the system, is defined in such a way that Riemann–Lebesgue theorem can be used to explain decoherence in a well defined final pointer basis.     

Discretization and resolution of the (<Emphasis Type="Italic">r</Emphasis>|<Emphasis Type="Italic">X</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>)-medianoid problem involving quality criteria

In this paper an extension of the (r|X _p )-medianoid on networks introduced by Hakimi (1983) is studied. In this extension the customer considers not only the distance but some characteristics of the facilities such as store size, quality of service and parking space. A new firm wants to establishr new facilities which have to compete with thep facilities that already exist in the market. The entry firm wants to find their locations and characteristics to maximize profits. Three different customer choice rules (binary, partially binary and proportional preferences) are considered. Some discretization results are obtained and a resolution procedure is proposed. The problem is solved combining a global search algorithm based on a branch and bound procedure with some combinatorial heuristics (greedy, interchange, and tabu search). Some computational experiences are presented. Partially supported by Ministerio de Ciencia y Tecnología (Spain) and FEDER, grant BFM2002-04525-C02-01.