Trajetórias tecnológicas e sistemas agrários: qualificação territorial utilizando geoprocessamento em Paragominas e Santarém/PA

A Amazônia tem sido observada principalmente por meio do fenômeno do desmatamento, utilizando recursos tradicionais do sensoriamento remoto como a quantificação de área desflorestada e seu posterior incremento anual, que parece se constituir em uma metodologia eficaz. Ratificando este raciocínio, constatei num levantamento de 16.591 multas aplicadas pelo IBAMA/PA no período de 2000 até 2008, que mais de 85,0% das autuações estavam relacionadas apenas à componente flora;e na jurisdição da Gerência do IBAMA em Santarém, oeste do Pará, em 2008, quase 60% das multas se deu por conta de desflorestamento, identificados via sensoriamento remoto. Ressalta-se que as análises de imagens de satélites por si só não definem elementos da superfície terrestre, contribuindo pouco para o entendimento e posterior intervenção da realidade. Nesse contexto, foram investigados e vetorizados 479 estabelecimentos rurais nas regiões de Paragominas e Santarém, estado do Pará, que possuem históricos de uso e ocupação distintos, qualificando-os segundo suas trajetórias tecnológicas prevalentes, na perspectiva apresentada por Costa, concretizando um importante passo para correção das distorções no desenvolvimento econômico, agregando informação ao dado de sensoriamento remoto. Aplicaram-se recursos geotecnológicos de métricas de paisagem, construíram-se banco de dados celular integrado com estatísticas e algoritmos de otimização probabilística, associando dados de classificação não supervisionada isodata (validadas com kappa= 0,87, classificação considerada“excelente”) com os tipos de produção coletados em campo, gerando uma classificação final "integrada"(kappa= 0,78, classificação “muito boa”). Na região de Paragominas, foram qualificadas 3 tipos de trajetórias tecnológicas, a camponesa T8 (domínio de culturas temporárias), a camponesa T3 e patronal T4 (especializadas em pecuária de corte). Em Santarém, revelaram-se 2 trajetórias, a camponesa T2 (forte presença de culturas permanentes, temporárias e sistemas agro florestais) e a patronal T7 (mutação da T4, aumentando a participação das culturas temporárias). A metodologia aplicada logrou êxito, espacializando as propriedades rurais segundo seus tipos de trajetórias tecnológicas e gerando classes de uso mais representativas, como cultura temporária e pastagem, mas que na classificação via sensoriamento remoto isodata é englobada pela classe “agropecuária”, possibilitando uma visão mais realista das atividades de produção desenvolvidas na área investigada, concretizando a geração de informações espaciais integrando dados de diferentes fontes e o aumento do poder de leitura do pixel.

NodePM: A Remote Monitoring Alert System for Energy Consumption Using Probabilistic Techniques

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

Discovering promising regions to help global numerical optimization algorithms

We have developed an algorithm using a Design of Experiments technique for reduction of search-space in global optimization problems. Our approach is called Domain Optimization Algorithm. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. The Domain Optimization Algorithm approach is based on eliminating non-promising search-space regions, which are identifyed using simple models (linear) fitted to the data. Then, we run a global optimization algorithm starting its population inside the promising region. The proposed approach with this heuristic criterion of population initialization has shown relevant results for tests using hard benchmark functions.

A new probabilistic canopy dynamics model (SLCD) that is suitable for evergreen and deciduous forest ecosystems

There are strong uncertainties regarding LAI dynamics in forest ecosystems in response to climate change. While empirical growth & yield models (G&YMs) provide good estimations of tree growth at the stand level on a yearly to decennial scale, process-based models (PBMs) use LAI dynamics as a key variable for enabling the accurate prediction of tree growth over short time scales. Bridging the gap between PBMs and G&YMs could improve the prediction of forest growth and, therefore, carbon, water and nutrient fluxes by combining modeling approaches at the stand level.Our study aimed to estimate monthly changes of leaf area in response to climate variations from sparse measurements of foliage area and biomass. A leaf population probabilistic model (SLCD) was designed to simulate foliage renewal. The leaf population was distributed in monthly cohorts, and the total population size was limited depending on forest age and productivity. Foliage dynamics were driven by a foliation function and the probabilities ruling leaf aging or fall. Their formulation depends on the forest environment.The model was applied to three tree species growing under contrasting climates and soil types. In tropical Brazilian evergreen broadleaf eucalypt plantations, the phenology was described using 8 parameters. A multi-objective evolutionary algorithm method (MOEA) was used to fit the model parameters on litterfall and LAI data over an entire stand rotation. Field measurements from a second eucalypt stand were used to validate the model. Seasonal LAI changes were accurately rendered for both sites (R-2 = 0.898 adjustment, R-2 = 0.698 validation). Litterfall production was correctly simulated (R-2 = 0.562, R-2 = 0.4018 validation) and may be improved by using additional validation data in future work. In two French temperate deciduous forests (beech and oak), we adapted phenological sub-modules of the CASTANEA model to simulate canopy dynamics, and SLCD was validated using LAI measurements. The phenological patterns were simulated with good accuracy in the two cases studied. However, IA/max was not accurately simulated in the beech forest, and further improvement is required.Our probabilistic approach is expected to contribute to improving predictions of LAI dynamics. The model formalism is general and suitable to broadleaf forests for a large range of ecological conditions. (C) 2014 Elsevier B.V. All rights reserved.

Probabilistic ictal EEG sources and temporal lobe epilepsy surgical outcome

Objective - For patients with medication refractory medial temporal lobe epilepsy (MTLE), surgery offers the hope of a cure. However, up to 30% of patients with MTLE continue to experience disabling seizures after surgery. The reasons why some patients do not achieve seizure freedom are poorly understood. A promising theory suggests that epileptogenic networks are broadly distributed in surgically refractory MTLE, involving regions beyond the medial temporal lobe. In this retrospective study, we aimed to investigate the distribution of epileptogenic networks in MTLE using Bayesian distributed EEG source analysis from preoperative ictal onset recordings. This analysis has the advantage of generating maps of source probability, which can be subjected to voxel-based statistical analyses.Methods - We compared 10 patients who achieved post-surgical seizure freedom with 10 patients who continued experiencing seizures after surgery. Voxel-based Wilcoxon tests were employed with correction for multiple comparisons.Results - We observed that ictal EEG source intensities were significantly more likely to occur in lateral temporal and posterior medial temporal regions in patients with continued seizures post-surgery.Conclusions - Our findings support the theory of broader spatial distribution of epileptogenic networks at seizure onset in patients with surgically refractory MTLE.

Algorithms for automatic segmentation of bovine embryos produced

In vitro production has been employed in bovine embryos and quantification of lipids is fundamental to understand the metabolism of these embryos. This paper presents a unsupervised segmentation method for histological images of bovine embryos. In this method, the anisotropic filter was used in the differents RGB components. After pre-processing step, the thresholding technique based on maximum entropy was applied to separate lipid droplets in the histological slides in different stages: early cleavage, morula and blastocyst. In the postprocessing step, false positives are removed using the connected components technique that identify regions with excess of dye near pellucid zone. The proposed segmentation method was applied in 30 histological images of bovine embryos. Experiments were performed with the images and statistical measures of sensitivity, specificity and accuracy were calculated based on reference images (gold standard). The value of accuracy of the proposed method was 96% with standard deviation of 3%.

Using Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment Algorithms

Sao Paulo State Research Foundation-FAPESP

A hybrid method for the probabilistic maximal covering location-allocation problem

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

A comparison about evolutionary algorithms for optimum-path forest clustering optimization

In this paper we deal with the problem of boosting the Optimum-Path Forest (OPF) clustering approach using evolutionary-based optimization techniques. As the OPF classifier performs an exhaustive search to find out the size of sample's neighborhood that allows it to reach the minimum graph cut as a quality measure, we compared several optimization techniques that can obtain close graph cut values to the ones obtained by brute force. Experiments in two public datasets in the context of unsupervised network intrusion detection have showed the evolutionary optimization techniques can find suitable values for the neighborhood faster than the exhaustive search. Additionally, we have showed that it is not necessary to employ many agents for such task, since the neighborhood size is defined by discrete values, with constrain the set of possible solution to a few ones.

OntoSDM: an approach to improve quality on spatial data mining algorithms

The increase in new electronic devices had generated a considerable increase in obtaining spatial data information; hence these data are becoming more and more widely used. As well as for conventional data, spatial data need to be analyzed so interesting information can be retrieved from them. Therefore, data clustering techniques can be used to extract clusters of a set of spatial data. However, current approaches do not consider the implicit semantics that exist between a region and an object’s attributes. This paper presents an approach that enhances spatial data mining process, so they can use the semantic that exists within a region. A framework was developed, OntoSDM, which enables spatial data mining algorithms to communicate with ontologies in order to enhance the algorithm’s result. The experiments demonstrated a semantically improved result, generating more interesting clusters, therefore reducing manual analysis work of an expert.

Evaluation of operational SSM/I ice-concentration algorithms

The United States National Ice Center (NIC) provides weekly ice analyses of the Arctic and Antarctic using information from ice reconnaissance, ship reports and high-resolution satellite imagery. In cloud-covered areas and regions lacking imagery, the higher-resolution sources are augmented by ice concentrations derived from Defense Meteorological Satellite Program (DMSP) Special Sensor Microwave/Imager (SSMII) passive-microwave imagery. However, the SSMII-derived ice concentrations are limited by low resolution and uncertainties in thin-ice regions. Ongoing research at NIC is attempting to improve the utility of these SSMII products for operational sea-ice analyses. The refinements of operational algorithms may also aid future scientific studies. Here we discuss an evaluation of the standard operational ice-concentration algorithm, Cal/Val, with a possible alternative, a modified NASA Team algorithm. The modified algorithm compares favorably with CallVal and is a substantial improvement over the standard NASA Team algorithm in thin-ice regions that are of particular interest to operational activities.

Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Routing Algorithms for All-Optical Networks with Power Considerations: The Unicast Case

In this paper, we investigate the problem of routing connections in all-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.

Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks

The emergence of Wavelength Division Multiplexing (WDM) technology provides the capability for increasing the bandwidth of Synchronous Optical Network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add-drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom in the traffic and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently.