A produção das desigualdades: análise da relação entre trabalho infantil e indicadores sociais

The International Labor Organization (OIT) estimates that there are around 118 million children subjected to child labor around the world. In Brazil, there are 3.5 million workers aged between 5 and 17. This exploitation practice constitutes a serious social problem, including of Public Health, since these workers are exposed to a wide range of risks, such as those related to health, physical integrity and even to life, which may cause them to become sick adults and/or interrupt their lives prematurely. Therefore, this research aims to investigate the relationship between the frequency of child labor in the age group of 10 to 13 years and some socio-economic indicators. It is a quantitative research in an ecological study whose levels of analysis are the Brazilian municipalities grouped in 161 regions, defined from socioeconomic criteria. The dependent variable of this study was the prevalence of child labor in the age group of 10 to 13 years. The independent variables were selected after a correlation between the 2010 Census of child labor in the age group of 10 to 13 years and secondary data had been conducted, adopting two main independent variables: funds from the Family Allowance Program (PBF) per 1,000 inhabitants and Funds from the Child Labor Eradication Program (PETI) per a thousand inhabitants. Initially, it was conducted a descriptive analysis of the variables of the study, then, a bivariate analysis, and the correlation matrix was built. At last, the Multiple Linear Regression stratified analysis was performed. The results of this survey indicate that public policies , like the Bolsa Familia Program Features per 1000 inhabitants and Resources Program for the Eradication of Child Labour to be allocated to municipalities with HDI < 0.697 represent a decrease in the rate of child labor ; These programs have the resources to be invested in municipalities with HDI > = 0.697 have no effect on the rate of child labor. Other adjustment variables showed significance, among these the municipal Human Development Index (IDH), years of schooling at 18 years of age, illiteracy at 15 years of age or more, employees without employment contract at 18 years of age and the Gini Index. It is understood that the child labor issue is complex. The problem is associated, although not restricted to, poverty, the social exclusion and inequality that exist in Brazil, but other factors of cultural and economic nature, as well as of organization of production, also account for its aggravation. Fighting child labor involves a wide intersectoral articulation, shared and integrated with several public policies, among them health, sports, culture, agriculture, labor and human rights, with a view to guaranteeing the integrality of the rights of children and adolescents in situation of labor and of their respective families

O problema do caixeiro viajante alugador : um estudo algorítmico

The Car Rental Salesman Problem (CaRS) is a variant of the classical Traveling Salesman Problem which was not described in the literature where a tour of visits can be decomposed into contiguous paths that may be performed in different rental cars. The aim is to determine the Hamiltonian cycle that results in a final minimum cost, considering the cost of the route added to the cost of an expected penalty paid for each exchange of vehicles on the route. This penalty is due to the return of the car dropped to the base. This paper introduces the general problem and illustrates some examples, also featuring some of its associated variants. An overview of the complexity of this combinatorial problem is also outlined, to justify their classification in the NPhard class. A database of instances for the problem is presented, describing the methodology of its constitution. The presented problem is also the subject of a study based on experimental algorithmic implementation of six metaheuristic solutions, representing adaptations of the best of state-of-the-art heuristic programming. New neighborhoods, construction procedures, search operators, evolutionary agents, cooperation by multi-pheromone are created for this problem. Furtermore, computational experiments and comparative performance tests are conducted on a sample of 60 instances of the created database, aiming to offer a algorithm with an efficient solution for this problem. These results will illustrate the best performance reached by the transgenetic algorithm in all instances of the dataset

Otimização do controle do diagrama de radiação de radares de varredura para rastreio de foguetes usando o método GAMMC para o Caso Planar (GAMMC-P)

Launching centers are designed for scientific and commercial activities with aerospace vehicles. Rockets Tracking Systems (RTS) are part of the infrastructure of these centers and they are responsible for collecting and processing the data trajectory of vehicles. Generally, Parabolic Reflector Radars (PRRs) are used in RTS. However, it is possible to use radars with antenna arrays, or Phased Arrays (PAs), so called Phased Arrays Radars (PARs). Thus, the excitation signal of each radiating element of the array can be adjusted to perform electronic control of the radiation pattern in order to improve functionality and maintenance of the system. Therefore, in the implementation and reuse projects of PARs, modeling is subject to various combinations of excitation signals, producing a complex optimization problem due to the large number of available solutions. In this case, it is possible to use offline optimization methods, such as Genetic Algorithms (GAs), to calculate the problem solutions, which are stored for online applications. Hence, the Genetic Algorithm with Maximum-Minimum Crossover (GAMMC) optimization method was used to develop the GAMMC-P algorithm that optimizes the modeling step of radiation pattern control from planar PAs. Compared with a conventional crossover GA, the GAMMC has a different approach from the conventional one, because it performs the crossover of the fittest individuals with the least fit individuals in order to enhance the genetic diversity. Thus, the GAMMC prevents premature convergence, increases population fitness and reduces the processing time. Therefore, the GAMMC-P uses a reconfigurable algorithm with multiple objectives, different coding and genetic operator MMC. The test results show that GAMMC-P reached the proposed requirements for different operating conditions of a planar RAV.

Busca heurística através de algoritmo genético e memético com construção de vocábulos para o problema de atribuição de localidades a anéis Sonet

Telecommunications play a key role in contemporary society. However, as new technologies are put into the market, it also grows the demanding for new products and services that depend on the offered infrastructure, making the problems of planning telecommunications networks, despite the advances in technology, increasingly larger and complex. However, many of these problems can be formulated as models of combinatorial optimization, and the use of heuristic algorithms can help solving these issues in the planning phase. In this project it was developed two pure metaheuristic implementations Genetic algorithm (GA) and Memetic Algorithm (MA) plus a third hybrid implementation Memetic Algorithm with Vocabulary Building (MA+VB) for a problem in telecommunications that is known in the literature as Problem SONET Ring Assignment Problem or SRAP. The SRAP arises during the planning stage of the physical network and it consists in the selection of connections between a number of locations (customers) in order to meet a series of restrictions on the lowest possible cost. This problem is NP-hard, so efficient exact algorithms (in polynomial complexity ) are not known and may, indeed, even exist

Algoritmo evolutivo paralelo para o problema de atribuição de localidades a anéis em redes sonet/sdh

The telecommunications play a fundamental role in the contemporary society, having as one of its main roles to give people the possibility to connect them and integrate them into society in which they operate and, therewith, accelerate development through knowledge. But as new technologies are introduced on the market, increases the demand for new products and services that depend on the infrastructure offered, making the problems of planning of telecommunication networks become increasingly large and complex. Many of these problems, however, can be formulated as combinatorial optimization models, and the use of heuristic algorithms can help solve these issues in the planning phase. This paper proposes the development of a Parallel Evolutionary Algorithm to be applied to telecommunications problem known in the literature as SONET Ring Assignment Problem SRAP. This problem is the class NP-hard and arises during the physical planning of a telecommunication network and consists of determining the connections between locations (customers), satisfying a series of constrains of the lowest possible cost. Experimental results illustrate the effectiveness of the Evolutionary Algorithm parallel, over other methods, to obtain solutions that are either optimal or very close to it