893 resultados para Error diffusion


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Capítulos de este documento disponibles separadamente (3611.00, 4912.00 y 3336.00)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

El documento contiene una lista de errores detectados por el compilador WATFOR/360

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Semi-supervised learning is applied to classification problems where only a small portion of the data items is labeled. In these cases, the reliability of the labels is a crucial factor, because mislabeled items may propagate wrong labels to a large portion or even the entire data set. This paper aims to address this problem by presenting a graph-based (network-based) semi-supervised learning method, specifically designed to handle data sets with mislabeled samples. The method uses teams of walking particles, with competitive and cooperative behavior, for label propagation in the network constructed from the input data set. The proposed model is nature-inspired and it incorporates some features to make it robust to a considerable amount of mislabeled data items. Computer simulations show the performance of the method in the presence of different percentage of mislabeled data, in networks of different sizes and average node degree. Importantly, these simulations reveals the existence of the critical points of the mislabeled subset size, below which the network is free of wrong label contamination, but above which the mislabeled samples start to propagate their labels to the rest of the network. Moreover, numerical comparisons have been made among the proposed method and other representative graph-based semi-supervised learning methods using both artificial and real-world data sets. Interestingly, the proposed method has increasing better performance than the others as the percentage of mislabeled samples is getting larger. © 2012 IEEE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work we analyze the convergence of solutions of the Poisson equation with Neumann boundary conditions in a two-dimensional thin domain with highly oscillatory behavior. We consider the case where the height of the domain, amplitude and period of the oscillations are all of the same order, and given by a small parameter e > 0. Using an appropriate corrector approach, we show strong convergence and give error estimates when we replace the original solutions by the first-order expansion through the Multiple-Scale Method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Context. Close encounters with (1) Ceres and (4) Vesta, the two most massive bodies in the main belt, are known to be a mechanism of dynamical mobility able to significantly alter proper elements of minor bodies, and they are the main source of dynamical mobility for medium-sized and large asteroids (D > 20 km, approximately). Recently, it has been shown that drift rates caused by close encounters with massive asteroids may change significantly on timescales of 30 Myr when different models (i.e., different numbers of massive asteroids) are considered. Aims. So far, not much attention has been given to the case of diffusion caused by the other most massive bodies in the main belt: (2) Pallas, (10) Hygiea, and (31) Euphrosyne, the third, fourth, and one of the most massive highly inclined asteroids in the main belt, respectively. Since (2) Pallas is a highly inclined object, relative velocities at encounter with other asteroids tend to be high and changes in proper elements are therefore relatively small. It was thus believed that the scattering effect caused by highly inclined objects in general should be small. Can diffusion by close encounters with these asteroids be a significant mechanism of long-term dynamical mobility? Methods. By performing simulations with symplectic integrators, we studied the problem of scattering caused by close encounters with (2) Pallas, (10) Hygiea, and (31) Euphrosyne when only the massive asteroids (and the eight planets) are considered, and the other massive main belt asteroids and non-gravitational forces are also accounted for. Results. By finding relatively small values of drift rates for (2) Pallas, we confirm that orbital scattering by this highly inclined object is indeed a minor effect. Unexpectedly, however, we obtained values of drift rates for changes in proper semi-major axis a caused by (10) Hygiea and (31) Euphrosyne larger than what was previously found for scattering by (4) Vesta. These high rates may have repercussions on the orbital evolution and age estimate of their respective families. © 2013 ESO.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a family of two-dimensional nonlinear area-preserving mappings that generalize the Chirikov standard map and model a variety of periodically forced systems. The action variable diffuses in increments whose phase is controlled by a negative power of the action and hence effectively uncorrelated for small actions, leading to a chaotic sea in phase space. For larger values of the action the phase space is mixed and contains a family of elliptic islands centered on periodic orbits and invariant Kolmogorov-Arnold-Moser (KAM) curves. The transport of particles along the phase space is considered by starting an ensemble of particles with a very low action and letting them evolve in the phase until they reach a certain height h. For chaotic orbits below the periodic islands, the survival probability for the particles to reach h is characterized by an exponential function, well modeled by the solution of the diffusion equation. On the other hand, when h reaches the position of periodic islands, the diffusion slows markedly. We show that the diffusion coefficient is scaling invariant with respect to the control parameter of the mapping when h reaches the position of the lowest KAM island. © 2013 American Physical Society.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.