Aportes teóricos e metodológicos para a constituição de um grupo de planejamento conjunto com docentes da licenciatura em física

We present in this paper parts of the results of a research that had the intention to promote a space of communicative interaction among teachers of an undergraduate Course of Physics Teaching so they could plan their courses together. From the theoretical recommendations of the Theory of Communicative Action , by Jürgen Habermas , it was possible to draw a way of rationality crisis in training degree in physics in Brazil and then propose the creation of a Joint Planning Group (JPG) with teachers of specific nature disciplines of physics and disciplines about physics teaching. They start a joint discussion about the relationship among the disciplines in delivering of a project for future high school teachers' training. All meetings developed over a school year in the GPC were recorded, transcribed and analyzed with a part of a methodological analysis feature of the intersubjective interactions. This methodology was developed specifically for the research. The conclusions are related to the joint constructions developed by the JPG, its local contexts and the possibility of extension of this group. The joint constructions undertaken in the group point to the defense of the formation of JPG in the formation of the professors who teach these courses.

Dynamical erosion of asteroid groups in the region of the Phocaea family

In a previous paper, the current state of knowledge of the region containing the Phocaea dynamical family was revised. Here, the dynamical evolution and possible origin of the Phocaea dynamical family and asteroid groups in the region are investigated. First, I study the case of asteroids at high eccentricity (e > 0.31). I find that these objects are unstable because of encounters with Mars on time-scales of up to 270 Myr. The minimum time needed by members of the Phocaea classical family to reach the orbital locations of these objects, 370 Myr, can be used to set a lower limit on the age of the Phocaea family.Next, attention is focused on the chaotic layer previously identified near the nu(6) secular resonance border. Using analytical and numerical tools, I find that the presence of the nu(6) secular resonance forces asteroids with vertical bar g-g(6)vertical bar < 2.55 arcsec yr(-1) to reach eccentricities high enough to allow them to experience deep, close encounters with Mars. Results of the analytical model of Yoshikawa and of my numerical simulations fully explain the low-inclination chaotic region found by Carruba.Finally, I investigate the long-term stability of the minor families and clumps identified in the previous paper, with particular emphasis on a clump only identifiable in the domain of proper frequencies (n, g, g - s) around (6246) Komurotoru. I find that while the clumps identified in the space of proper elements quickly disperse when the Yarkovsky effect is considered, the family around (19536) is still observable for time-scales of more than 50 Myr. The (6246) clump, characterized by its interaction with the nu(5) + nu(16) and 2 nu(6) - nu(16) secular resonances, is robust on time-scales of 50 Myr. I confirm that this group may be the first clump ever detected in the frequency domain that can be associated with a real collisional event.

Multistage and coordinated planning of the expansion of transmission systems

In this paper, an efficient genetic algorithm (GA) is presented to solve the problem of multistage and coordinated transmission expansion planning. This is a mixed integer nonlinear programming problem, difficult for systems of medium and large size and high complexity. The GA presented has a set of specialized genetic operators and an efficient form of generation of the initial population that finds high quality suboptimal topologies for large size and high complexity systems. In these systems, multistage and coordinated planning present a lower investment than static planning. Tests results are shown in one medium complexity system and one large size high complexity system.

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

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

Free actions of abelian p-groups on the n-torus

In this work we make some contributions to the theory of actions of abelian p-groups on the n-Torus T-n. Set congruent to Z(pk1)(h1) x Z(pk2)(h2) x...x Z(pkr)(hr), r >= 1, k(1) >= k(2) >=...>= k(r) >= 1, p prime. Suppose that the group H acts freely on T-n and the induced representation on pi(1)(T-n) congruent to Z(n) is faithful and has first Betti number b. We show that the numbers n, p, b, k(i) and h(i) (i = 1,..,r) satisfy some relation. In particular, when H congruent to Z(p)(h), the minimum value of n is phi(p) + b when b >= 1. Also when H congruent to Z(pk1) x Z(p) the minimum value of n is phi(p(k1)) + p - 1 + b for b >= 1. Here phi denotes the Euler function.

Implementação de um sistema Collaborative Planning, Forecasting, and Replenishment em uma grande rede de fast food por meio de um prestador de serviços logísticos

A gestão colaborativa é, atualmente, um elemento-chave no contexto da gestão da cadeia de suprimentos. Neste artigo, o tema é abordado mediante a análise de um caso real, em que uma grande rede mundial de fast-food e seu prestador de serviço logístico (PSL) trabalharam conjuntamente no Brasil em um projeto-piloto para a implementação de um collaborative planning, forecasting, and replenishment (CPFR). O trabalho faz uso de uma metodologia de pesquisa-ação e apresenta as principais variáveis que influenciaram o projeto, abordando os processos necessários para a implementação e os pontos que favorecem o CPFR. Com base no caso estudado, o trabalho apresenta um conjunto de propostas sobre o papel dos agentes da cadeia em projetos dessa natureza. A gestão da cadeia de suprimentos por intermédio da coordenação direta de um PSL também permite demonstrar as possibilidades e dificuldades desse sistema, contribuindo com a visão colaborativa na cadeia de suprimentos a partir da relação entre seus agentes.

A heuristic method for reactive power planning

An approach for solving reactive power planning problems is presented, which is based on binary search techniques and the use of a special heuristic to obtain a discrete solution. Two versions were developed, one to run on conventional (sequential) computers and the other to run on a distributed memory (hypercube) machine. This latter parallel processing version employs an asynchronous programming model. Once the set of candidate buses has been defined, the program gives the location and size of the reactive sources needed(if any) in keeping with operating and security constraints.

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Integrated planning of electric power distribution networks

In this work, a heuristic model for integrated planning of primary distribution network and secondary distribution circuits is proposed. A Tabu Search (TS) algorithm is employed to solve the planning of primary distribution networks. Evolutionary Algorithms (EA) are used to solve the planning model of secondary networks. The planning integration of both networks is carried out by means a constructive heuristic taking into account a set of integration alternatives between these networks. These integration alternatives are treated in a hierarchical way. The planning of primary networks and secondary distribution circuits is carried out based on assessment of the effects of the alternative solutions in the expansion costs of both networks simultaneously. In order to evaluate this methodology, tests were performed for a real-life distribution system taking into account the primary and secondary networks.

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.

Wireless mesh networks planning based on parameters of quality of service

The use of QoS parameters to evaluate the quality of service in a mesh network is essential mainly when providing multimedia services. This paper proposes an algorithm for planning wireless mesh networks in order to satisfy some QoS parameters, given a set of test points (TPs) and potential access points (APs). Examples of QoS parameters include: probability of packet loss and mean delay in responding to a request. The proposed algorithm uses a Mathematical Programming model to determine an adequate topology for the network and Monte Carlo simulation to verify whether the QoS parameters are being satisfied. The results obtained show that the proposed algorithm is able to find satisfactory solutions.

Multiobjective short-term planning of electric power distribution systems using NSGA-II

This paper presents a mixed integer nonlinear programming multiobjective model for short-term planning of distribution networks that considers in an integrated manner the following planning activities: allocation of capacitor banks; voltage regulators; the cable replacement of branches and feeders. The objective functions considered in the proposed model are: to minimize operational and investment costs and minimize the voltage deviations in the the network buses, subject to a set of technical and operational constraints. A multiobjective genetic algorithm based on a Non-Dominated Sorting Genetic Algorithm (NSGA-II) is proposed to solve this model. The proposed mathematical model and solution methodology is validated testing a medium voltage distribution system with 135 buses. © 2013 Brazilian Society for Automatics - SBA.

Modelos geoestatísticos espaço-tempo aplicados a dados pluviométricos no oeste do Estado de São Paulo

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

Aplicações de sistemas multiagentes na previsão espacial de demanda elétrica em sistemas de distribuição

Pós-graduação em Engenharia Elétrica - FEIS