2 resultados para Asymptotic Analysis

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

60.00% 60.00%

Publicador:

Resumo:

The viscosity of AOT/water/decane water-in-oil microemulsions exhibits a well-known maximum as a function of water/AOT molar ratio, which is usually attributed to increased attractions among nearly spherical droplets. The maximum can be removed by adding salt or by changing the oil to CCl4. Systematic small-angle X-ray scattering (SAXS) measurements have been used to monitor the structure of the microemulsion droplets in the composition regime where the maximum appears. On increasing the droplet concentration, the scattering intensity is found to scale with the inverse of the wavevector, a behavior which is consistent with cylindrical structures. The inverse wavevector scaling is not observed when the molar ratio is changed, moving the system away from the value corresponding to the viscosity maximum. It is also not present in the scattering from systems containing enough added salt to essentially eliminate the viscosity maximum. An asymptotic analysis of the SAXS data, complemented by some quantitative modeling, is consistent with cylindrical growth of droplets as their concentration is increased. Such elongated structures are familiar from related AOT systems in which the sodium counterion has been exchanged for a divalent one. However, the results of this study suggest that the formation of non-spherical aggregates at low molar ratios is an intrinsic property of AOT.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

The attributes describing a data set may often be arranged in meaningful subsets, each of which corresponds to a different aspect of the data. An unsupervised algorithm (SCAD) that simultaneously performs fuzzy clustering and aspects weighting was proposed in the literature. However, SCAD may fail and halt given certain conditions. To fix this problem, its steps are modified and then reordered to reduce the number of parameters required to be set by the user. In this paper we prove that each step of the resulting algorithm, named ASCAD, globally minimizes its cost-function with respect to the argument being optimized. The asymptotic analysis of ASCAD leads to a time complexity which is the same as that of fuzzy c-means. A hard version of the algorithm and a novel validity criterion that considers aspect weights in order to estimate the number of clusters are also described. The proposed method is assessed over several artificial and real data sets.