Aggregation in the generalized transportation problem

Aggregation disaggregation is used to reduce the analysis of a large generalized transportation problem to a smaller one. Bounds for the actual difference between the aggregated objective and the original optimal value are used to quantify the error due to aggregation and estimate the quality of the aggregation. The bounds can be calculated either before optimization of the aggregated problem (a priori) or after (a posteriori). Both types of the bounds are derived and numerically compared. A computational experiment was designed to (a) study the correlation between the bounds and the actual error and (b) quantify the difference of the error bounds from the actual error. The experiment shows a significant correlation between some a priori bounds, the a posteriori bounds and the actual error. These preliminary results indicate that calculating the a priori error bound is a useful strategy to select the appropriate aggregation level, since the a priori bound varies in the same way that the actual error does. After the aggregated problem has been selected and optimized, the a posteriori bound provides a good quantitative measure for the error due to aggregation.

Static electric fields interfere in the viability of cells exposed to ionising radiation

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Anomalous metamagnetic-like transition in a FeRh/Fe3Pt interface occurring at T approximate to 120 K in the field-cooled-cooling curves for low magnetic fields

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Scaling in the BCS to Bose crossover problem in different partial waves

The BCS superconductivity to Bose condensation crossover problem is studied in two dimensions in S, P, and D waves, for a simple anisotropic pairing, with a finite-range separable potential at zero temperature. The gap parameter and the chemical potential as a function of Cooper-pair binding B c exhibit universal scaling. In the BCS limit the results for coherence length ξ and the critical temperature T c are appropriate for highT c cuprate superconductors and also exhibit universal scaling as a function of B c.

Optimization procedures in the design of continuous induction hardening and tempering installations for magnetic steel bars

An inverse problem concerning the industrial process of steel bars hardening and tempering is considered. The associated optimization problem is formulated in terms of membership functions and, for the sake of comparison, also in terms of quadratic residuals; both geometric and electromagnetic design variables have been considered. The numerical solution is achieved by coupling a finite difference procedure for the calculation of the electromagnetic and thermal fields to a deterministic strategy of minimization based on modified Flctcher and Reeves method. © 1998 IEEE.

Concept of Matching Parallelepiped and its use in the correspondence problem

In this paper, the concept of Matching Parallelepiped (MP) is presented. It is shown that the volume of the MP can be used as an additional measure of `distance' between a pair of candidate points in a matching algorithm by Relaxation Labeling (RL). The volume of the MP is related with the Epipolar Geometry and the use of this measure works as an epipolar constraint in a RL process, decreasing the efforts in the matching algorithm since it is not necessary to explicitly determine the equations of the epipolar lines and to compute the distance of a candidate point to each epipolar line. As at the beginning of the process the Relative Orientation (RO) parameters are unknown, a initial matching based on gradient, intensities and correlation is obtained. Based on this set of labeled points the RO is determined and the epipolar constraint included in the algorithm. The obtained results shown that the proposed approach is suitable to determine feature-point matching with simultaneous estimation of camera orientation parameters even for the cases where the pair of optical axes are not parallel.

Variational studies and replica symmetry breaking in the generalization problem of the binary perceptron

We analyze the average performance of a general class of learning algorithms for the nondeterministic polynomial time complete problem of rule extraction by a binary perceptron. The examples are generated by a rule implemented by a teacher network of similar architecture. A variational approach is used in trying to identify the potential energy that leads to the largest generalization in the thermodynamic limit. We restrict our search to algorithms that always satisfy the binary constraints. A replica symmetric ansatz leads to a learning algorithm which presents a phase transition in violation of an information theoretical bound. Stability analysis shows that this is due to a failure of the replica symmetric ansatz and the first step of replica symmetry breaking (RSB) is studied. The variational method does not determine a unique potential but it allows construction of a class with a unique minimum within each first order valley. Members of this class improve on the performance of Gibbs algorithm but fail to reach the Bayesian limit in the low generalization phase. They even fail to reach the performance of the best binary, an optimal clipping of the barycenter of version space. We find a trade-off between a good low performance and early onset of perfect generalization. Although the RSB may be locally stable we discuss the possibility that it fails to be the correct saddle point globally. ©2000 The American Physical Society.

Confinement and soliton solutions in the SL(3) Toda model coupled to matter fields

We consider an integrable conformally invariant two-dimensional model associated to the affine Kac-Moody algebra sl3(ℂ). It possesses four scalar fields and six Dirac spinors. The theory does not possesses a local Lagrangian since the spinor equations of motion present interaction terms which are bilinear in the spinors. There exists a submodel presenting an equivalence between a U(1) vector current and a topological current, which leads to a confinement of the spinors inside the solitons. We calculate the one-soliton and two-soliton solutions using a procedure which is a hybrid of the dressing and Hirota methods. The soliton masses and time delays due to the soliton interactions are also calculated. We give a computer program to calculate the soliton solutions. © 2002 Published by Elsevier Science B.V.

The income distribution problem in Latin America and the Caribbean

Includes bibliography

Trafficking in persons, especially women and children in the countries of the Americas. A regional report on the scope of the problem and the governmental and non-governmental response

Includes bibliography

The housing problem in Latin America in relation to structural development factors

Includes bibliography