Governos locais e políticas de promoção econômica: uma análise da promoção econômica nos municípios brasileiros com população acima de 50 mil habitantes

This work aims to analyze the policy of economic promotion in the Brazilian cities of medium and great size (with population above of 50.000 hab.). The objective of the research is to launch light in the debate on the regional and municipal development, presenting the recent hypotheses supplied by literature. Of complementary form, had for specific objective presents the results of the Research of Basic Information of Cities - PIM, of Brazilian Institute of Geography and Statistics (IBGE), in two surveys carried through together to the Brazilian local governments (1999 and 2009). It analyzes the instruments of economic promotion used by local governments and the influence of the development variables, as the Local Human Index of Development (HID-L) and the Local Gross Domestic Product (GDP-L). The research sample that factors as HID-L and GDP-L has significant influence in economic promotion of cities and must be taken in account in the definition of the local strategies of development

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

O problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic structure of costs. This quadratic structure models interaction effects between pairs of edges. Linear and quadratic costs are added up to constitute the total cost of the spanning tree, which must be minimized. When these interactions are restricted to adjacent edges, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). AQMST and QMST are NP-hard problems that model several problems of transport and distribution networks design. In general, AQMST arises as a more suitable model for real problems. Although, in literature, linear and quadratic costs are added, in real applications, they may be conflicting. In this case, it may be interesting to consider these costs separately. In this sense, Multiobjective Optimization provides a more realistic model for QMST and AQMST. A review of the state-of-the-art, so far, was not able to find papers regarding these problems under a biobjective point of view. Thus, the objective of this Thesis is the development of exact and heuristic algorithms for the Biobjective Adjacent Only Quadratic Spanning Tree Problem (bi-AQST). In order to do so, as theoretical foundation, other NP-hard problems directly related to bi-AQST are discussed: the QMST and AQMST problems. Bracktracking and branch-and-bound exact algorithms are proposed to the target problem of this investigation. The heuristic algorithms developed are: Pareto Local Search, Tabu Search with ejection chain, Transgenetic Algorithm, NSGA-II and a hybridization of the two last-mentioned proposals called NSTA. The proposed algorithms are compared to each other through performance analysis regarding computational experiments with instances adapted from the QMST literature. With regard to exact algorithms, the analysis considers, in particular, the execution time. In case of the heuristic algorithms, besides execution time, the quality of the generated approximation sets is evaluated. Quality indicators are used to assess such information. Appropriate statistical tools are used to measure the performance of exact and heuristic algorithms. Considering the set of instances adopted as well as the criteria of execution time and quality of the generated approximation set, the experiments showed that the Tabu Search with ejection chain approach obtained the best results and the transgenetic algorithm ranked second. The PLS algorithm obtained good quality solutions, but at a very high computational time compared to the other (meta)heuristics, getting the third place. NSTA and NSGA-II algorithms got the last positions

Um modelo conceitual baseado em MDD e padrões para evolução de sistemas OA

Aspect-Oriented Software Development (AOSD) is a technique that complements the Object- Oriented Software Development (OOSD) modularizing several concepts that OOSD approaches do not modularize appropriately. However, the current state-of-the art on AOSD suffers with software evolution, mainly because aspect definition can stop to work correctly when base elements evolve. A promising approach to deal with that problem is the definition of model-based pointcuts, where pointcuts are defined based on a conceptual model. That strategy makes pointcut less prone to software evolution than model-base elements. Based on that strategy, this work defines a conceptual model at high abstraction level where we can specify software patterns and architectures that through Model Driven Development techniques they can be instantiated and composed in architecture description language that allows aspect modeling at architecture level. Our MDD approach allows propagate concepts in architecture level to another abstraction levels (design level, for example) through MDA transformation rules. Also, this work shows a plug-in implemented to Eclipse platform called AOADLwithCM. That plug-in was created to support our development process. The AOADLwithCM plug-in was used to describe a case study based on MobileMedia System. MobileMedia case study shows step-by-step how the Conceptual Model approach could minimize Pointcut Fragile Problems, due to software evolution. MobileMedia case study was used as input to analyses evolutions on software according to software metrics proposed by KHATCHADOURIAN, GREENWOOD and RASHID. Also, we analyze how evolution in base model could affect maintenance on aspectual model with and without Conceptual Model approaches

Algoritmos científicos

The Scientific Algorithms are a new metaheuristics inspired in the scientific research process. The new method introduces the idea of theme to search the solution space of hard problems. The inspiration for this class of algorithms comes from the act of researching that comprises thinking, knowledge sharing and disclosing new ideas. The ideas of the new method are illustrated in the Traveling Salesman Problem. A computational experiment applies the proposed approach to a new variant of the Traveling Salesman Problem named Car Renter Salesman Problem. The results are compared to state-of-the-art algorithms for the latter problem

O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico

This paper introduces a new variant of the Traveling Car Renter Problem, named Prizecollecting Traveling Car Renter Problem. In this problem, a set of vertices, each associated with a bonus, and a set of vehicles are given. The objective is to determine a cycle that visits some vertices collecting, at least, a pre-defined bonus, and minimizing the cost of the tour that can be traveled with different vehicles. A mathematical formulation is presented and implemented in a solver to produce results for sixty-two instances. The proposed problem is also subject of an experimental study based on the algorithmic application of four metaheuristics representing the best adaptations of the state of the art of the heuristic programming.We also provide new local search operators which exploit the neighborhoods of the problem, construction procedures and adjustments, created specifically for the addressed problem. Comparative computational experiments and performance tests are performed on a sample of 80 instances, aiming to offer a competitive algorithm to the problem. We conclude that memetic algorithms, computational transgenetic and a hybrid evolutive algorithm are competitive in tests performed

Gênero, sexualidade e educação formal no Brasil: uma análise preliminar da produção acadêmica entre 1990 e 2006

Cet article présente les résultats de la recherche Démocratisation de la connaissance: recherche de pointe sur le genre et l'éducation formelle comme soutien pour formuler des agendas et des actions de politiques gouvernementales et non gouvernementales. Développée entre 2006 et 2007, elle visait à met re à jour, systématiser et diffuser la connaissance accumulée dans la production universitaire brésilienne sur les liens entre l'éducation formelle et les thématiques du genre, des femmes et/ou de la sexualité. Une banque de données contenant le titre et le résumé de 1 213 dissertations, thèses et articles a été constituée. Nous soulignons autant les défis théoriques, concernant une meilleure compréhension des concepts étudiés par cete enquête, que les défis méthodologique, comme la définition des descripteurs et des sources devant être examinées. Sa conclusion présente des tableaux et graphiques qui tracent un portrait initial des documents disponibles dans la base de données et indiquent que ces thématiques ont été l'objet d'un intérêt croissant sur la période étudiée.

Programação linear por partes: revisão teórica e aplicações

Procura-se resgatar a importância de uma subárea da Programação Matemática conhecida como Programação Linear Por Partes - PLP. de fato a PLP tem inúmeras aplicações tanto na área teórica como em situações reais. Este trabalho apresenta os resultados de uma pesquisa bibliográfica, efetuada nas principais revistas técnicas e livros disponíveis relacionados com Pesquisa Operacional, que visou situar o estado da'arte da Programação Linear por Partes, bem como a abrangência de sua aplicabilidade. Particularmente, no contexto da PLP, este texto deslaca a Programação em Redes Lineares por Partes devido a sua relevância em muitas situações práticas.

Reformas estructurales, productividad y conducta tecnológica en América Latina

Incluye Bibliografía

Envejecimiento, solidaridad y protección social en América Latina y el Caribe: La hora de avanzar hacia la igualdad

Incluye Bibliografía

La transformación de puntos de acceso en nodos de conocimiento: análisis de diez experiencias de telecentros comunitarios en América Latina

Incluye Bibliografía

Economías de escala en los servicios de agua potable y alcantarillado

Incluye bibliografía

Control de precios de transferencia en la industria de agua potable y alcantarillado

Incluye bibliografía

Energía solar termodinámica en América Latina: los casos del Brasil, Chile y México

Incluye bibliografía

El papel de las tecnologías de la información y las comunicaciones en la educación inclusiva

Incluye bibliografía