Multicast packing problem: abordagem multiobjetivo

This work presents a algorithmic study of Multicast Packing Problem considering a multiobjective approach. The first step realized was an extensive review about the problem. This review serverd as a reference point for the definition of the multiobjective mathematical model. Then, the instances used in the experimentation process were defined, this instances were created based on the main caracteristics from literature. Since both mathematical model and the instances were definined, then several algoritms were created. The algorithms were based on the classical approaches to multiobjective optimization: NSGA2 (3 versions), SPEA2 (3 versions). In addition, the GRASP procedures were adapted to work with multiples objectives, two vesions were created. These algorithms were composed by three recombination operators(C1, C2 e C3), two operator for build solution, a mutation operator and a local search procedure. Finally, a long experimentation process was performed. This process has three stages: the first consisted of adjusting the parameters; the second was perfomed to indentify the best version for each algorithm. After, the best versions for each algorithm were compared in order to identify the best algorithm among all. The algorithms were evaluated based on quality indicators and Hypervolume Multiplicative Epsilon

O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico

The Hiker Dice was a game recently proposed in a software designed by Mara Kuzmich and Leonardo Goldbarg. In the game a dice is responsible for building a trail on an n x m board. As the dice waits upon a cell on the board, it prints the side that touches the surface. The game shows the Hamiltonian Path Problem Simple Maximum Hiker Dice (Hidi-CHS) in trays Compact Nth , this problem is then characterized by looking for a Hamiltonian Path that maximize the sum of marked sides on the board. The research now related, models the problem through Graphs, and proposes two classes of solution algorithms. The first class, belonging to the exact algorithms, is formed by a backtracking algorithm planed with a return through logical rules and limiting the best found solution. The second class of algorithms is composed by metaheuristics type Evolutionary Computing, Local Ramdomized search and GRASP (Greed Randomized Adaptative Search). Three specific operators for the algorithms were created as follows: restructuring, recombination with two solutions and random greedy constructive.The exact algorithm was teste on 4x4 to 8x8 boards exhausting the possibility of higher computational treatment of cases due to the explosion in processing time. The heuristics algorithms were tested on 5x5 to 14x14 boards. According to the applied methodology for evaluation, the results acheived by the heuristics algorithms suggests a better performance for the GRASP algorithm

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

Técnica e humanismo na poesia de Michel Deguy

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

A new method for extending the range of conductive polymer sensors for contact force

This paper describes a technique for extending the force range of thin conductive polymer force sensors used for measuring contact force. These sensors are conventionally used for measuring force by changing electrical resistance when they are compressed. The new method involves measuring change in electrical resistance when the flexible sensor, which is sensitive to both compression and bending, is sandwiched between two layers of spring steel, and the structure is supported on a thin metal ring. When external force is applied, the stiffened sensor inside the spring steel is deformed within the annular center of the ring, causing the sensor to bend in proportion to the applied force. This method effectively increases the usable force range, while adding little in the way of thickness and weight. Average error for loads between 10 N and 100 N was 2.2 N (SD = 1.7) for a conventional conductive polymer sensor, and 0.9 N (SD = 0.4) using the new approach. Although this method permits measurement of greater loads with an error less than 1 N, it is limited since the modified sensor is insensitive to loads less than 5 N. These modified sensors are nevertheless useful for directly measuring normal force applied against handles and tools and other situations involving forceful manual work activities, such as grasp, push, pull, or press that could not otherwise be measured in actual work situations.

Neonatal rat exposure to pyrethroid and organophosphate insecticides: A physiological and biochemical trial of progeny

A manufactured product (Ectoplus®) composed by a cypermethrin (44.7%) and dichlorvos (4.2%) mixture was administered (10mg/kg/day, orally, by gavage) to pregnant rats, during the periods of gestation+lactation, gestation, and lactation. Control mothers received vehicle aqueous solution during the gestation+lactation period. With the progeny, in the 1-15 post-natal days (PNDI-15) there were observed alterations in the periods of occurrence of teeth, hair, unfolding of ears, and in the developmental period for following reflexes: postural, palmar grasp, negative geotaxis, and acoustic startle reflex. After weaning (PND21), there were observed the presence of cypermethrin and dichlorvos in the blood brain and liver; decrease in weight of liver, of cholinesterase activity in the plasma, liver, and brain, and hepatic metabolizing activity of drugs; alterations of levels of gamma glutamyl transferase enzymes, of creatinine, and of potassium in the serum of the animals. In conclusion, neonatal exposure to a formulated mixture of cypermethrin and dichlorvos is inductive to alterations in characteristics that indicate somatic and neuromuscular development of the progeny, and in certain biochemical parameters. The results suggest that enzymatic assessment associated with somatic and neuromotor assessment can be important markers of developmental characteristics in neonatal toxicity by pesticide formulations based on mixtures of insecticides.

Foreign Investment in Latin America and the Caribbean 2000

Includes bibliography

National innovation surveys in Latin America: empirical evidence and policy implications

Includes bibliography

Trade in services in Latin America and the Caribbean: an analysis of recent trends

Includes bibliography

Evolutionary multi-move path-relinking for transmission network expansion planning

This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to generate a set of high quality initial solutions with different topologies. The population is evolved using a multi-move path-relinking with the objective of finding minimum investment cost for the transmission expansion planning problem employing the DC representation. The algorithm is tested on the southern Brazilian system, obtaining the optimal solution for the system with better performance than similar metaheuristics algorithms applied to the same problem. ©2010 IEEE.

Unveiling fieldbus network technology through project-based learning

Fieldbus communications networks are a fundamental part of modern industrial automation technique. This paperwork presents an application of project-based learning (PBL) paradigm to help electrical engineering students grasp the major concepts of fieldbus networks, while attending a one-term long, elective microcontroller course. © 2012 IEEE.

Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.

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.

Modelo estocástico de programação matemática de alocação de medidores de tensão em alimentadores radiais de distribuição de energia elétrica para localização de faltas e monitoramento do perfil de tensão

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

Restauração automática de redes de distribuição de energia elétrica de grande porte com geração distribuída

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