Genetic diversity of environmental Aspergillus flavus strains in the state of São Paulo, Brazil by random amplified polymorphic DNA

Aspergillus flavus is a very important toxigenic fungus that produces aflatoxins, a group of extremely toxic substances to man and animals. Toxigenic fungi can grow in feed crops, such as maize, peanuts, and soybeans, being thus of high concern for public health. There are toxigenic and non-toxigenic A. flavus variants, but the necessary conditions for expressing the toxigenic potential are not fully understood. Therefore, we have studied total-DNA polymorphism from toxigenic and non toxigenic A. flavus strains isolated from maize crops and soil at two geographic locations, 300 km apart, in the Southeast region of Brazil. Total DNA from each A. flavus isolate was extracted and subjected to polymerase chain reaction amplification with five randomic primers through the RAPD (random amplified polymorphic DNA) technique. Phenetic and cladistic analyses of the data, based on bootstrap analyses, led us to conclude that RAPD was not suitable to discriminate toxigenic from non toxigenic strains. But the present results support the use of RAPD for strain characterization, especially for preliminary evaluation over extensive collections.

Predicting random level and seasonality of hotel prices. A structural equation growth curve approach

This article examines the effect on price of different characteristics of holiday hotels in the sun-and-beach segment, under the hedonic function perspective. Monthly prices of the majority of hotels in the Spanish continental Mediterranean coast are gathered from May to October 1999 from the tour operator catalogues. Hedonic functions are specified as random-effect models and parametrized as structural equation models with two latent variables, a random peak season price and a random width of seasonal fluctuations. Characteristics of the hotel and the region where they are located are used as predictors of both latent variables. Besides hotel category, region, distance to the beach, availability of parking place and room equipment have an effect on peak price and also on seasonality. 3- star hotels have the highest seasonality and hotels located in the southern regions the lowest, which could be explained by a warmer climate in autumn

Distinguishing general concepts from individuals: an automatic coarse-grained classifier

Named entity recognizers are unable to distinguish if a term is a general concept as "scientist" or an individual as "Einstein". In this paper we explore the possibility to reach this goal combining two basic approaches: (i) Super Sense Tagging (SST) and (ii) YAGO. Thanks to these two powerful tools we could automatically create a corpus set in order to train the SuperSense Tagger. The general F1 is over 76% and the model is publicly available.

Medical image registration based on random line sampling

One of the key aspects in 3D-image registration is the computation of the joint intensity histogram. We propose a new approach to compute this histogram using uniformly distributed random lines to sample stochastically the overlapping volume between two 3D-images. The intensity values are captured from the lines at evenly spaced positions, taking an initial random offset different for each line. This method provides us with an accurate, robust and fast mutual information-based registration. The interpolation effects are drastically reduced, due to the stochastic nature of the line generation, and the alignment process is also accelerated. The results obtained show a better performance of the introduced method than the classic computation of the joint histogram

Error and complexity of random walk Monte Carlo radiosity

The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown

The average inter-crossing number of equilateral random walks and polygons

In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a = (3 In 2)/(8) approximate to 0.2599. In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance p apart and p is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of p. Our simulation result shows that the model in fact works very well for the entire range of p. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well.

Litterfall and mineral return in two cork-oak forests in northeast spain

Seasonal trends in littertall and potential mineral return were studied in two cork-oak forest sites in the northeastern Iberian peninsula. The estimated average litter production was 3.9.M- gy.e1ahar for one site and 4.6 .M- gy.e1ahar for the other; these figures are similar to those reported for holm-oak (Quercus ilex) forests in the same area. Seasonal litterfall patterns were typical of Mediterranean forest ecosystems. Leaves accounted for 46 to 78% of the total dry matter. Their annual weighted-average mineral composition was low in macronutrients (N 8-9; K 4-5; Mg 0.8-1.3; Ca 9-10 and P 0.4-1 m-)g.1g and relatively high in micronutrients such as Mn (2-2.2 m-)g.1g or Fe (0.3-0.4 m)-g..1g Minimum N and P concentrations were found during the growth period. Estimates of potential mineral return for an annual cycle were N 38-52, P 2.1-5.2, K 20-28, Ca 44-53 and Mg 5.4-5.0 k-,g.1ha depending on the site biomass and fertility

Subknots in ideal knots, random knots, and knotted proteins.

We introduce disk matrices which encode the knotting of all subchains in circular knot configurations. The disk matrices allow us to dissect circular knots into their subknots, i.e. knot types formed by subchains of the global knot. The identification of subknots is based on the study of linear chains in which a knot type is associated to the chain by means of a spatially robust closure protocol. We characterize the sets of observed subknot types in global knots taking energy-minimized shapes such as KnotPlot configurations and ideal geometric configurations. We compare the sets of observed subknots to knot types obtained by changing crossings in the classical prime knot diagrams. Building upon this analysis, we study the sets of subknots in random configurations of corresponding knot types. In many of the knot types we analyzed, the sets of subknots from the ideal geometric configurations are found in each of the hundreds of random configurations of the same global knot type. We also compare the sets of subknots observed in open protein knots with the subknots observed in the ideal configurations of the corresponding knot type. This comparison enables us to explain the specific dispositions of subknots in the analyzed protein knots.

Cell size distribution in a random tessellation of space governed by the Kolmogorov-Johnson-Mehl-Avrami model: Grain size distribution in crystallization

The space subdivision in cells resulting from a process of random nucleation and growth is a subject of interest in many scientific fields. In this paper, we deduce the expected value and variance of these distributions while assuming that the space subdivision process is in accordance with the premises of the Kolmogorov-Johnson-Mehl-Avrami model. We have not imposed restrictions on the time dependency of nucleation and growth rates. We have also developed an approximate analytical cell size probability density function. Finally, we have applied our approach to the distributions resulting from solid phase crystallization under isochronal heating conditions

Detecció automàtica de punts facials característics utilitzant Random Ferns i el criteri de la información mútua simplificada

En aquest article comparem el rendiment que presenten dos sistemes de reconeixement de punts característics en imatges: en el primer utilitzem la tècnica Random Ferns bàsica i en el segon (que anomenem Ferns amb Informació Mútua o FIM) apliquem una tècnica d'obtenció de Ferns utilitzant un criteri simplificat de la informació mútua.

Optimization of floor cleaning coverage performance of a random path-planning mobile robot

Floor cleaning is a typical robot application. There are several mobile robots aviable in the market for domestic applications most of them with random path-planning algorithms. In this paper we study the cleaning coverage performances of a random path-planning mobile robot and propose an optimized control algorithm, some methods to estimate the are of the room, the evolution of the cleaning and the time needed for complete coverage.

Sistema de votació electrònica sobre corbes el·líptques amb mescla de vots mitjançant Random Group Full Checking

L'objectiu del treball és dissenyar i implementar un sistema de simulació de votació electrònica, emprant una adaptació sobre corbes el·líptiques del criptosistema ElGamal, per tal d'estudiar-ne la viabilitat, centrant l'atenció en temes de seguretat, especialment en el procés de mescla de vots per tal de desvincular un vot de la persona que l'ha emès.