IMPLEMENTATION OF PROTECTED AREAS FORCENTRAL CORRIDOR OF ATLANTIC FORESTIN BAHIA: CHALLENGES AND LIMITS

In Brazil, Protected Areas (PAs) are considered the cornerstone for development of national strategies for biodiversity conservation. Considering this point of view we analyzed thirty protected areas belonging to Atlantic Central Corridor of Atlantic Forest in Bahia, aiming to identify and analyze its current level of implementation. Lemos de Sa and Ferreira (2000) methodology which consist of applying a standard scale, where the variation of the level of implementation conforms to a range of 0 to 5 points was used, with appropriate adaptations. After obtaining the data from the implementation level we use the aggregation method of Ward to help visualize the dissimilarity between the protected areas studied. We used an international classification proposed by IUCN (International Union for Conservation of Nature) for that the UCs to be compared with works done in another countries, the UCs considered are in the groups Ia, II, V and VI da IUCN. As results, 50% of protected areas analyzed are reasonably implemented, 40% inadequately implemented, 6.7% are presented only on paper and only 3.3% can be classified as satisfactorily implemented. These areas presents problems in their regularization; deficiency in infrastructure, human and financial resources. Given the results its clear the recurrent fact that conservation areas under study must be effectively implemented and for this to occur environmental policies should be focused on actions to consolidate the goals of conservation strategy.

STABLE PIECEWISE POLYNOMIAL VECTOR FIELDS

Let N = {y > 0} and S = {y < 0} be the semi-planes of R-2 having as common boundary the line D = {y = 0}. Let X and Y be polynomial vector fields defined in N and S, respectively, leading to a discontinuous piecewise polynomial vector field Z = (X, Y). This work pursues the stability and the transition analysis of solutions of Z between N and S, started by Filippov (1988) and Kozlova (1984) and reformulated by Sotomayor-Teixeira (1995) in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields Z(epsilon), defined by averaging X and Y. This family approaches Z when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002) providing conditions on (X, Y) for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on R-2. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.

Combining meta-learning and search techniques to select parameters for support vector machines

Support Vector Machines (SVMs) have achieved very good performance on different learning problems. However, the success of SVMs depends on the adequate choice of the values of a number of parameters (e.g., the kernel and regularization parameters). In the current work, we propose the combination of meta-learning and search algorithms to deal with the problem of SVM parameter selection. In this combination, given a new problem to be solved, meta-learning is employed to recommend SVM parameter values based on parameter configurations that have been successfully adopted in previous similar problems. The parameter values returned by meta-learning are then used as initial search points by a search technique, which will further explore the parameter space. In this proposal, we envisioned that the initial solutions provided by meta-learning are located in good regions of the search space (i.e. they are closer to optimum solutions). Hence, the search algorithm would need to evaluate a lower number of candidate solutions when looking for an adequate solution. In this work, we investigate the combination of meta-learning with two search algorithms: Particle Swarm Optimization and Tabu Search. The implemented hybrid algorithms were used to select the values of two SVM parameters in the regression domain. These combinations were compared with the use of the search algorithms without meta-learning. The experimental results on a set of 40 regression problems showed that, on average, the proposed hybrid methods obtained lower error rates when compared to their components applied in isolation.

The r-matrix of the Alday-Arutyunov-Frolov model

We investigate the classical integrability of the Alday-Arutyunov-Frolov model, and show that the Lax connection can be reduced to a simpler 2 x 2 representation. Based on this result, we calculate the algebra between the L-operators and find that it has a highly non-ultralocal form. We then employ and make a suitable generalization of the regularization technique proposed by Mail let for a simpler class of non-ultralocal models, and find the corresponding r- and s-matrices. We also make a connection between the operator-regularization method proposed earlier for the quantum case, and the Mail let's symmetric limit regularization prescription used for non-ultralocal algebras in the classical theory.