GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Initial analysis from a Lidar observation campaign of sugar cane fires in the central and western portion of the S̃ao Paulo State - Brazil

The central and western portion of the S̃ao Paulo State has large areas of sugar cane plantations, and due to the growing demand for biofuels, the production is increasing every year. During the harvest period some plantation areas are burnt a few hours before the manual cutting, causing significant quantities of biomass burning aerosol to be injected into the atmosphere. During August 2010, a field campaign has been carried out in Ourinhos, situated in the south-western region of S̃ao Paulo State. A 2-channel Raman Lidar system and two meteorological S-Band Doppler Radars are used to indentify and quantify the biomass burning plumes. In addiction, CALIPSO Satellite observations were used to compare the aerosol optical properties detected in that region with those retrieved by Raman Lidar system. Although the campaign yielded 30 days of measurements, this paper will be focusing only one case study, when aerosols released from nearby sugar cane fires were detected by the Lidar system during a CALIPSO overpass. The meteorological radar, installed in Bauru, approximately 110 km northeast from the experimental site, had recorded echoes (dense smoke comprising aerosols) from several fires occurring close to the Raman Lidar system, which also detected an intense load of aerosol in the atmosphere. HYSPLIT model forward trajectories presented a strong indication that both instruments have measured the same air masss parcels, corroborated with the Lidar Ratio values from the 532 nm elastic and 607 nm Raman N2 channel analyses and data retrieved from CALIPSO have indicated the predominance of aerosol from biomass burning sources. © 2011 SPIE.

On data-centric misbehavior detection in VANETs

Detecting misbehavior (such as transmissions of false information) in vehicular ad hoc networks (VANETs) is a very important problem with wide range of implications, including safety related and congestion avoidance applications. We discuss several limitations of existing misbehavior detection schemes (MDS) designed for VANETs. Most MDS are concerned with detection of malicious nodes. In most situations, vehicles would send wrong information because of selfish reasons of their owners, e.g. for gaining access to a particular lane. It is therefore more important to detect false information than to identify misbehaving nodes. We introduce the concept of data-centric misbehavior detection and propose algorithms which detect false alert messages and misbehaving nodes by observing their actions after sending out the alert messages. With the data-centric MDS, each node can decide whether an information received is correct or false. The decision is based on the consistency of recent messages and new alerts with reported and estimated vehicle positions. No voting or majority decisions is needed, making our MDS resilient to Sybil attacks. After misbehavior is detected, we do not revoke all the secret credentials of misbehaving nodes, as done in most schemes. Instead, we impose fines on misbehaving nodes (administered by the certification authority), discouraging them to act selfishly. This reduces the computation and communication costs involved in revoking all the secret credentials of misbehaving nodes. © 2011 IEEE.

Determination of onboard coplanar orbital maneuvers with orbits determined using GPS

In the present paper a study is made in order to find an algorithm that can calculate coplanar orbital maneuvers for an artificial satellite. The idea is to find a method that is fast enough to be combined with onboard orbit determination using GPS data collected from a receiver that is located in the satellite. After a search in the literature, three algorithms are selected to be tested. Preliminary studies show that one of them (the so called Minimum Delta-V Lambert Problem) has several advantages over the two others, both in terms of accuracy and time required for processing. So, this algorithm is implemented and tested numerically combined with the orbit determination procedure. Some adjustments are performed in this algorithm in the present paper to allow its use in real-time onboard applications. Considering the whole maneuver, first of all a simplified and compact algorithm is used to estimate in real-time and onboard the artificial satellite orbit using the GPS measurements. By using the estimated orbit as the initial one and the information of the final desired orbit (from the specification of the mission) as the final one, a coplanar bi-impulsive maneuver is calculated. This maneuver searches for the minimum fuel consumption. Two kinds of maneuvers are performed, one varying only the semi major axis and the other varying the semi major axis and the eccentricity of the orbit, simultaneously. The possibilities of restrictions in the locations to apply the impulses are included, as well as the possibility to control the relation between the processing time and the solution accuracy. Those are the two main reasons to recommend this method for use in the proposed application.

Particle competition and cooperation to prevent error propagation from mislabeled data in semi-supervised learning

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.

Molecular and morphological data support the existence of a sexual cycle in species of the genus Paracoccidioides

The genus Paracoccidioides includes the thermodimorphic species Paracoccidioides brasiliensis and P. lutzii, both of which are etiologic agents of paracoccidioidomycosis, a systemic mycosis that affects humans in Latin America. Despite the common occurrence of a sexual stage among closely related fungi, this has not been observed with Paracoccidioides species, which have thus been considered asexual. Molecular evolutionary studies revealed recombination events within isolated populations of the genus Paracoccidioides, suggesting the possible existence of a sexual cycle. Comparative genomic analysis of all dimorphic fungi and Saccharomyces cerevisiae demonstrated the presence of conserved genes involved in sexual reproduction, including those encoding mating regulators such as MAT, pheromone receptors, pheromone-processing enzymes, and mating signaling regulators. The expression of sex-related genes in the yeast and mycelial phases of both Paracoccidioides species was also detected by realtime PCR, with nearly all of these genes being expressed preferentially in the filamentous form of the pathogens. In addition, the expression of sex-related genes was responsive to the putative presence of pheromone in the supernatants obtained from previous cocultures of strains of two different mating types. In vitro crossing of isolates of different mating types, discriminated by phylogenetic analysis of the α-box (MAT1-1) and the high-mobility-group (HMG) domain (MAT1-2), led to the identification of the formation of young ascocarps with constricted coiled hyphae related to the initial stage of mating. These genomic and morphological analyses strongly support the existence of a sexual cycle in species of the genus Paracoccidioides. © 2013, American Society for Microbiology.

Multivariate models for correlated count data

In this study, we deal with the problem of overdispersion beyond extra zeros for a collection of counts that can be correlated. Poisson, negative binomial, zero-inflated Poisson and zero-inflated negative binomial distributions have been considered. First, we propose a multivariate count model in which all counts follow the same distribution and are correlated. Then we extend this model in a sense that correlated counts may follow different distributions. To accommodate correlation among counts, we have considered correlated random effects for each individual in the mean structure, thus inducing dependency among common observations to an individual. The method is applied to real data to investigate variation in food resources use in a species of marsupial in a locality of the Brazilian Cerrado biome. © 2013 Copyright Taylor and Francis Group, LLC.

The integrated lot sizing and cutting stock problem in a furniture factory

This work studies the integrated lot sizing and cutting stock problem, where the goal is to capture the dependency that exists between two important decisions in the production process, in order to economize raw materials and also reduce production and inventory costs. The integrated lot sizing and cutting stock problem is studied in a small furniture factory that produces wardrobes, dressing tables and cupboards and the lot sizing and cutting stock decisions are taken by the production manager. A column-generation technique is used to solve a linear relaxation of the proposed model. The computational results, using real data from the factory, show that it is possible to reduce total inventory and raw material costs when integrated planning is used. © 2013 IFAC.

A redistricting problem applied to meter reading in power distribution networks

The capacitated redistricting problem (CRP) has the objective to redefine, under a given criterion, an initial set of districts of an urban area represented by a geographic network. Each node in the network has different types of demands and each district has a limited capacity. Real-world applications consider more than one criteria in the design of the districts, leading to a multicriteria CRP (MCRP). Examples are found in political districting, sales design, street sweeping, garbage collection and mail delivery. This work addresses the MCRP applied to power meter reading and two criteria are considered: compactness and homogeneity of districts. The proposed solution framework is based on a greedy randomized adaptive search procedure and multicriteria scalarization techniques to approximate the Pareto frontier. The computational experiments show the effectiveness of the method for a set of randomly generated networks and for a real-world network extracted from the city of São Paulo. © 2013 Elsevier Ltd.

Times assíncronos inicializadores para o planejamento da expansão da transmissão de energia elétrica baseados no modelo híbrido linear

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Procedimentos pedagógicos no ensino fundamental voltados para a prevenção de quedas acidentais

Pós-graduação em Educação - FFC

Conhecimentos e práticas de professores que ensinam Matemática na infância e suas relações com ampliação do Ensino fundamental

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Sentimentos e percepções de mulheres no ciclo gravídico-puerperal que sobreviveram à morbidade materna grave

Pós-graduação em Enfermagem (mestrado profissional) - FMB

O ensino universitário de Química em descompasso: dificuldades de futuros professores na construção do pensamento químico

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

Na companhia do vírus: concepções e vivências de adolescentes portadores do HIV/Aids

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)