Prototip d'instal·lació d'un cluster de càlcul emprant programari lliure i de codi obert

Metodologia d'instal·lació d'un sistema operatiu i aplicacions orientada al seu ús en clusters de càlcul i enfocada principalment a la senzillesa de manteniment i a la compartició d'un màxim de programari entre equips.

MSISpIC: A Probabilistic Scan Matching Algorithm Using a Mechanical Scanned Imaging Sonar

This paper compares two well known scan matching algorithms: the MbICP and the pIC. As a result of the study, it is proposed the MSISpIC, a probabilistic scan matching algorithm for the localization of an Autonomous Underwater Vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), and the robot displacement estimated through dead-reckoning with the help of a Doppler Velocity Log (DVL) and a Motion Reference Unit (MRU). The proposed method is an extension of the pIC algorithm. Its major contribution consists in: 1) using an EKF to estimate the local path traveled by the robot while grabbing the scan as well as its uncertainty and 2) proposing a method to group into a unique scan, with a convenient uncertainty model, all the data grabbed along the path described by the robot. The algorithm has been tested on an AUV guided along a 600m path within a marina environment with satisfactory results

An Efficient Nominal Unification Algorithm

Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and Wegman for first-order unification. Second, we prove that solvability of these reduced problems may be checked in quadràtic time. Finally, we point out how using ideas of Brown and Tarjan for unbalanced merging, we could solve these reduced problems more efficiently

A fast Bayesian reconstruction algorithm for emission tomography with entropy prior converging to feasible images

The development and tests of an iterative reconstruction algorithm for emission tomography based on Bayesian statistical concepts are described. The algorithm uses the entropy of the generated image as a prior distribution, can be accelerated by the choice of an exponent, and converges uniformly to feasible images by the choice of one adjustable parameter. A feasible image has been defined as one that is consistent with the initial data (i.e. it is an image that, if truly a source of radiation in a patient, could have generated the initial data by the Poisson process that governs radioactive disintegration). The fundamental ideas of Bayesian reconstruction are discussed, along with the use of an entropy prior with an adjustable contrast parameter, the use of likelihood with data increment parameters as conditional probability, and the development of the new fast maximum a posteriori with entropy (FMAPE) Algorithm by the successive substitution method. It is shown that in the maximum likelihood estimator (MLE) and FMAPE algorithms, the only correct choice of initial image for the iterative procedure in the absence of a priori knowledge about the image configuration is a uniform field.

An analysis of the currently available calibrations inStromgren photometry by using open clusters

In recent years, several authors have revised the calibrations used to compute physical parameters (tex2html_wrap_inline498, tex2html_wrap_inline500, log g, [Fe/H]) from intrinsic colours in the tex2html_wrap_inline504 photometric system. For reddened stars, these intrinsic colours can be computed through the standard relations among colour indices for each of the regions defined by Strömgren (1966) on the HR diagram. We present a discussion of the coherence of these calibrations for main-sequence stars. Stars from open clusters are used to carry out this analysis. Assuming that individual reddening values and distances should be similar for all the members of a given open cluster, systematic differences among the calibrations used in each of the photometric regions might arise when comparing mean reddening values and distances for the members of each region. To classify the stars into Strömgren's regions we extended the algorithm presented by Figueras et al. (1991) to a wider range of spectral types and luminosity classes. The observational ZAMS are compared with the theoretical ZAMS from stellar evolutionary models, in the range tex2html_wrap_inline506 K. The discrepancies are also discussed.

Photometric and Spectroscopic Observations of the Cluster of Galaxies Abell 2390

Spectroscopic and photometric observations in a 6 arcmin x 6 arcmin field centered on the rich cluster of galaxies Abell 2390 are presented. The photometry concerns 700 objects and the spectroscopy 72 objects. The redshift survey shows that the mean redshift of the cluster is 0.232. An original method for automatic determination of the spectral type of galaxies is presented.

Photometric and spectroscopic survey of the cluster of galaxies Abell A2218

We present new photometric and spectroscopic observations of objects in the field of the cluster of galaxies Abell 2218. The photometric survey, centered on the cluster core, extends to a field of about 4 x 4 arcmin. It was performed in 5 bands (B,g,r,i and z filters). This sample, which includes 729 objects, is about three times larger than the survey made by Butcher and collaborators (Butcher et al., 1983, Butcher and Oemler, 1984) in the same central region of the field. Only 228 objects appear in both catalogues since our survey covers a smaller region. The spectral range covered by our filters is wider and the photometry is much deeper, up to magnitude 27 in r. The spectroscopic survey concerns 66 objects, on a field comparable to that of Butcher and collaborators. From our observations we calculate the mean redshift of the cluster, 0.1756, and its velocity dispersion, 1370 km/s. The spectral types are determined for many galaxies in the sample by comparing their spectra with synthetic ones from Rocca-Volmerange and Guiderdoni (1988).

Response of doped 4He droplets

In the framework of a finite-range density-functional theory, we compute the response of 4HeN clusters doped with a rare-gas molecule. For this purpose, the mean field for the 4He atoms, their wave functions and effective quasiparticle interaction, are self-consistently calculated for a variety of particle numbers in the cluster. The response function is then evaluated for several multipolarities in each drop and the collective states are consequently located from the peaks of the strength function. The spectra of pure droplets approach those previously extracted with a similar algorithm resorting to a zero-range density functional. The spectra of doped clusters are sensitive to the presence of the impurity and are worth a future systematic investigation.

Numerical algorithm for Ginzburg-Landau equations with multiplicative noise: Application to domain growth

We consider stochastic partial differential equations with multiplicative noise. We derive an algorithm for the computer simulation of these equations. The algorithm is applied to study domain growth of a model with a conserved order parameter. The numerical results corroborate previous analytical predictions obtained by linear analysis.

Majorization arrow in quantum-algorithm design

We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.

Numerical algorithm for spectroscopic ellipsometry of thick transparent films

We present a numerical method for spectroscopic ellipsometry of thick transparent films. When an analytical expression for the dispersion of the refractive index (which contains several unknown coefficients) is assumed, the procedure is based on fitting the coefficients at a fixed thickness. Then the thickness is varied within a range (according to its approximate value). The final result given by our method is as follows: The sample thickness is considered to be the one that gives the best fitting. The refractive index is defined by the coefficients obtained for this thickness.

Percolation and cluster Monte Carlo dynamics for spin models

A general scheme for devising efficient cluster dynamics proposed in a previous paper [Phys. Rev. Lett. 72, 1541 (1994)] is extensively discussed. In particular, the strong connection among equilibrium properties of clusters and dynamic properties as the correlation time for magnetization is emphasized. The general scheme is applied to a number of frustrated spin models and the results discussed.