Custo social de oportunidade na trajetória de acesso ao ensino superior: o caso dos ingressantes na UFRN nos vestibulares de 2006 a 2010

Access is a problem of higher education in Brazil that has existed since the formalization of this has occurred since the installation of the Portuguese court in Brazil in 1808. Only 10% of young people between 18 and 24 years of age attending this level of education in 2000, arriving in 2010 just 15%, far from that determined the National Education Plan in 2001, triple that percentage by the year 2010. In addition, a majority of seats of public HEIs is populated by students from the private network, especially in high-demand courses. In this context, this study aims to identify the costs related to the trajectories of students who were successful in the vestibular UFRN editions from 2006 to 2010. Presents an overview of higher education in Brazil, a brief history of vestibular, as well as new forms of access, and some of the policies to expand such access, highlighting the argument Inclusion UFRN. Focusing on the theme of the paper presents the concepts of opportunity costs and social. After collecting data through a questionnaire and consultation of databases COMPERVE was developed to search for a descriptive and analytical, with the participation of 3,995 students, of whom 1642 (41.1%) had completed secondary education in schools public, and 2,078 (52%) in private schools. The profile indicates that 90% are single, about 50% are 21 years of age, are white and female. In the course of preparation for college entrance exams, 80% chose the course during or after completion of the last year of high school, and almost 70% said they had started preparing at that time. Findings related to the costs involved with this preparation indicate that, in most cases there were school fees and disbursements and workshops, and the purchase of books and other materials, with parents primarily responsible for this cost, the amount disbursed each month was up $ 300 for 64% of respondents and only 7% of them exceeded $ 1,000, the major non-financial costs were characterized by the following resignations: job opportunities (24%) or temporary work (20%) courses of languages (26%), leisure activities (48%), leisure travel (43%), and parties and / or shows (54%). Of social investments by the government, stand out in the tax waiver scholarships for study in private institutions, grant exemption from the registration fee of vestibular, the preparatory courses UFRN, and seminars by COMPERVE / UFRN with networks of high school. From the junction of the opportunity costs (private costs) and social costs (public costs), a new concept: the social opportunity cost, which measures the combined efforts of families and government to finance the opportunity to access higher education of an individual. This concept can and should be incorporated as a strategic vector for the sake of democratic university, which reflects the social model that is sought

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

Heurísticas usando construção de vocabuilário aplicadas ao problema da atribuição de localidades a anéis em redes SONET/SDH

The SONET/SDH Ring Assignment Problem (PALAS) treats to group localities in form of some rings, being respected the traffic's limitations of the equipment. Each ring uses a DXC (Digital Cross Connect) to make the communication with the others, being the DXC the equipment most expensive of the net, minimizing the number total of rings, will minimize the total net cost, problem's objective . This topology in rings provides a bigger capacity of regeneration. The PALAS is a problem in Combinatorial Optimization of NP-hard Class. It can be solved through Heuristics and Metaheuristics. In this text, we use Taboo Search while we keep a set of elite solutions to be used in the formation of a part of the collection of vocabulary's parts that in turn will be used in the Vocabulary Building. The Vocabulary Building will be started case Taboo Search does not reach the best solution for the instance. Three approaches had been implemented: one that only uses vocabulary's parts deriving of Taboo Search, one that it only uses vocabulary's parts randomly generated and a last one that it uses half come of the elite and half randomly generated

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

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

Algoritmo treansgenético na solução do problema do Caixeiro Viajante

The Traveling Purchaser Problem is a variant of the Traveling Salesman Problem, where there is a set of markets and a set of products. Each product is available on a subset of markets and its unit cost depends on the market where it is available. The objective is to buy all the products, departing and returning to a domicile, at the least possible cost defined as the summation of the weights of the edges in the tour and the cost paid to acquire the products. A Transgenetic Algorithm, an evolutionary algorithm with basis on endosymbiosis, is applied to the Capacited and Uncapacited versions of this problem. Evolution in Transgenetic Algorithms is simulated with the interaction and information sharing between populations of individuals from distinct species. The computational results show that this is a very effective approach for the TPP regarding solution quality and runtime. Seventeen and nine new best results are presented for instances of the capacited and uncapacited versions, respectively

Uma abordagem através de algoritmos transgenéticos para o problema da configuração do traçado de uma rede de distribuição de gás natural

Este trabalho apresenta um algoritmo transgenético híbrido para a solução de um Problema de Configuração de uma Rede de Distribuição de Gás Natural. O problema da configuração dessas redes requer a definição de um traçado por onde os dutos devem ser colocados para atender aos clientes. É estudada neste trabalho uma maneira de conectar os clientes em uma rede com arquitetura em forma de árvore. O objetivo é minimizar o custo de construção da rede, mesmo que para isso alguns clientes que não proporcionam lucros deixem de ser atendidos. Esse problema pode ser formulado computacionalmente através do Problema de Steiner com Prêmios. Este é um problema de otimização combinatória da classe dos NPÁrduos. Este trabalho apresenta um algoritmo heurístico para a solução do problema. A abordagem utilizada é chamada de Algoritmos Transgenéticos, que se enquadram na categoria dos algoritmos evolucionários. Para a geração de soluções inicias é utilizado um algoritmo primaldual, e pathrelinking é usado como intensificador

Cloud query manager: uso de web semântica para evitar o problema de aprisionamento em IaaS

Cloud computing can be defined as a distributed computational model by through resources (hardware, storage, development platforms and communication) are shared, as paid services accessible with minimal management effort and interaction. A great benefit of this model is to enable the use of various providers (e.g a multi-cloud architecture) to compose a set of services in order to obtain an optimal configuration for performance and cost. However, the multi-cloud use is precluded by the problem of cloud lock-in. The cloud lock-in is the dependency between an application and a cloud platform. It is commonly addressed by three strategies: (i) use of intermediate layer that stands to consumers of cloud services and the provider, (ii) use of standardized interfaces to access the cloud, or (iii) use of models with open specifications. This paper outlines an approach to evaluate these strategies. This approach was performed and it was found that despite the advances made by these strategies, none of them actually solves the problem of lock-in cloud. In this sense, this work proposes the use of Semantic Web to avoid cloud lock-in, where RDF models are used to specify the features of a cloud, which are managed by SPARQL queries. In this direction, this work: (i) presents an evaluation model that quantifies the problem of cloud lock-in, (ii) evaluates the cloud lock-in from three multi-cloud solutions and three cloud platforms, (iii) proposes using RDF and SPARQL on management of cloud resources, (iv) presents the cloud Query Manager (CQM), an SPARQL server that implements the proposal, and (v) comparing three multi-cloud solutions in relation to CQM on the response time and the effectiveness in the resolution of cloud lock-in.

Distribuição de derivados de petróleo por redes de polidutos: uma abordagem através de algoritmos evolucionários híbridos para um problema triobjetivo

An important problem faced by the oil industry is to distribute multiple oil products through pipelines. Distribution is done in a network composed of refineries (source nodes), storage parks (intermediate nodes), and terminals (demand nodes) interconnected by a set of pipelines transporting oil and derivatives between adjacent areas. Constraints related to storage limits, delivery time, sources availability, sending and receiving limits, among others, must be satisfied. Some researchers deal with this problem under a discrete viewpoint in which the flow in the network is seen as batches sending. Usually, there is no separation device between batches of different products and the losses due to interfaces may be significant. Minimizing delivery time is a typical objective adopted by engineers when scheduling products sending in pipeline networks. However, costs incurred due to losses in interfaces cannot be disregarded. The cost also depends on pumping expenses, which are mostly due to the electricity cost. Since industrial electricity tariff varies over the day, pumping at different time periods have different cost. This work presents an experimental investigation of computational methods designed to deal with the problem of distributing oil derivatives in networks considering three minimization objectives simultaneously: delivery time, losses due to interfaces and electricity cost. The problem is NP-hard and is addressed with hybrid evolutionary algorithms. Hybridizations are mainly focused on Transgenetic Algorithms and classical multi-objective evolutionary algorithm architectures such as MOEA/D, NSGA2 and SPEA2. Three architectures named MOTA/D, NSTA and SPETA are applied to the problem. An experimental study compares the algorithms on thirty test cases. To analyse the results obtained with the algorithms Pareto-compliant quality indicators are used and the significance of the results evaluated with non-parametric statistical tests.

Algoritmos meta-heurísticos para a solução do problema do caixeiro viajante com múltiplas caronas

The Traveling Salesman with Multiple Ridesharing (TSP-MR) is a type of the Capacitated Traveling Salesman, which presents the possibility of sharing seats with passengers taking advantage of the paths the salesman travels through his cycle. The salesman shares the cost of a path with the boarded passengers. This model can portray a real situation in which, for example, drivers are willing to share parts of a trip with tourists that wish to move between two locations visited by the driver’s route, accepting to share the vehicle with other individuals visiting other locations within the cycle. This work proposes a mathematical formulation for the problem, and an exact and metaheuristics algorithms for its solution, comparing them.

Algoritmos meta-heurísticos para a solução do problema do caixeiro viajante com múltiplas caronas

The Traveling Salesman with Multiple Ridesharing (TSP-MR) is a type of the Capacitated Traveling Salesman, which presents the possibility of sharing seats with passengers taking advantage of the paths the salesman travels through his cycle. The salesman shares the cost of a path with the boarded passengers. This model can portray a real situation in which, for example, drivers are willing to share parts of a trip with tourists that wish to move between two locations visited by the driver’s route, accepting to share the vehicle with other individuals visiting other locations within the cycle. This work proposes a mathematical formulation for the problem, and an exact and metaheuristics algorithms for its solution, comparing them.

Caracterização socio-econômico-cultural de raizeiros e procedimentos pós-colheita de plantas medicinais comercializadas em Maceió, AL

ARAUJO, Afranio Cesar de et al. Caracterização socio-econômico-cultural de raizeiros e procedimentos pós-colheita de plantas medicinais comercializadas em Maceió, AL. Rev. Bras. Pl. Med, Botucatu, v. 11, n. 01, p.81-91, 2009. Disponível em: . Acesso em: 04 out. 2010.

Análise do custo-benefício de sistemas de cobertas em edificações comerciais para o clima de Natal/RN visando eficiência energética

This research consists in studying the influence of the various type of construction systems of roofs with their energy efficiency as well as on the cost benefit for the commercial buildings on the temperatures condition of the city of Natal/RN. The main goal of this research is to analyze the cost benefit of the construction systems of roofs available on the market, taking into consideration the energy efficiency of the commercial buildings artificially air conditioned in order to be used by the projectors and to be adequated to the temperatures condition of the city of Natal/RN. The method of valuation of the cost benefit of roof systems consists in six steps: Features and simulation of the reference building; Analyze of sensitivity; Analyzes, features and simulation of alternatives of roof construction systems; Analyze of the cost of implementation; Analyze of the benefits of the alternatives comparing to the base case; And finally the analyze of the cost benefit. The model type chosen as reference was stores with pre molded buildings and system of roof with fiber ciment and ceiling . The thermal results showed the influence of the roof system on the energy efficiency of the building. The Final results of the simulations of the alternatives comes to a conclusion that the absortance is the variable that presents the best cost benefit relation and the reduction on the thermal transmittance still has limitations because of the high cost

Remoção de metais pesados em efluentes sintéticos utilizando vermiculita como adsorvente

Heavy metals are used in many industrial processestheirs discard can harm fel effects to the environment, becoming a serious problem. Many methods used for wastewater treatment have been reported in the literature, but many of them have high cost and low efficiency. The adsorption process has been used as effective for the metal remoal ions. This paper presents studies to evaluate the adsorption capacity of vermiculite as adsorbent for the heavy metals removal in a synthetic solution. The mineral vermiculite was characterized by differents techniques: specific surface area analysis by BET method, X-ray diffraction, raiosX fluorescence, spectroscopy in the infraredd region of, laser particle size analysis and specific gravity. The physical characteristics of the material presented was appropriate for the study of adsorption. The adsorption experiments weredriveal finite bath metod in synthetic solutions of copper, nickel, cadmium, lead and zinc. The results showed that the vermiculite has a high potential for adsorption, removing about 100% of ions and with removal capacity values about 85 ppm of metal in solution, 8.09 mg / g for cadmium, 8.39 mg/g for copper, 8.40 mg/g for lead, 8.26 mg/g for zinc and 8.38 mg/g of nickel. The experimental data fit in the Langmuir and Freundlich models. The kinetic datas showed a good correlation with the pseudo-second order model. It was conducteas a competition study among the metals using vermiculiti a adsorbent. Results showed that the presence of various metals in solution does not influence their removal at low concentrations, removing approximat wasely 100 % of all metals present in solutions