Nebular gas drag and planetary accretion with eccentric high-mass planets

Aims.We investigate the dynamics of pebbles immersed in a gas disk interacting with a planet on an eccentric orbit. The model has a prescribed gap in the disk around the location of the planetary orbit, as is expected for a giant planet with a mass in the range of 0.1-1 Jupiter masses. The pebbles with sizes in the range of 1 cm to 3 m are placed in a ring outside of the giant planet orbit at distances between 10 and 30 planetary Hill radii. The process of the accumulation of pebbles closer to the gap edge, its possible implication for the planetary accretion, and the importance of the mass and the eccentricity of the planet in this process are the motivations behind the present contribution. Methods. We used the Bulirsch-Stoer numerical algorithm, which is computationally consistent for close approaches, to integrate the Newtonian equations of the planar (2D), elliptical restricted three-body problem. The angular velocity of the gas disk was determined by the appropriate balance between the gravity, centrifugal, and pressure forces, such that it is sub-Keplerian in regions with a negative radial pressure gradient and super-Keplerian where the radial pressure gradient is positive. Results. The results show that there are no trappings in the 1:1 resonance around the L 4 and L5 Lagrangian points for very low planetary eccentricities (e2 < 0.07). The trappings in exterior resonances, in the majority of cases, are because the angular velocity of the disk is super-Keplerian in the gap disk outside of the planetary orbit and because the inward drift is stopped. Furthermore, the semi-major axis location of such trappings depends on the gas pressure profile of the gap (depth) and is a = 1.2 for a planet of 1 MJ. A planet on an eccentric orbit interacts with the pebble layer formed by these resonances. Collisions occur and become important for planetary eccentricity near the present value of Jupiter (e 2 = 0.05). The maximum rate of the collisions onto a planet of 0.1 MJ occurs when the pebble size is 37.5 cm ≤ s < 75 cm; for a planet with the mass of Jupiter, it is15 cm ≤ s < 30 cm. The accretion stops when the pebble size is less than 2 cm and the gas drag dominates the motion. © 2013 ESO.

Possibilidades e limites da aprendizagem baseada em problemas no ensino médio

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

A metodologia de resolução de problemas: concepções e práticas pedagógicas de professores de matemática do ensino fundamental

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

O ensino dos conceitos de área e perímetro através da resolução de problemas

When I set out to attend degree in mathematics was because I believed that mathematics could be taught to students in a way closer to their daily lives, thereby making it a more attractive school discipline, gradually, eliminating its reputation of a difficult school subject. Then, during my observations in supervised, I realized that one of the greatest difficulties in mathematics was related with geometry, in which the concepts of area and perimeter were often confused. Using the methodological tool of problem solving, something to bring the concept to be developed and the cultural context in which the student is in, I developed some educational activities in which, using concrete materials, students were encouraged to construct their own knowledge about the concepts of area and perimeter. Moreover, such activities were designed to place the student as the center of attention in the classroom. The main objective of this work is to encourage and observe how this methodology, based on the solving problem process, can be used within the classroom, to better understand the concepts to be taught, always looking for improvement of the student learning

Aplicações da função logarítmica em sala de aula no ensino médio: uma proposta de solução de problemas pela transposição para a linguagem matemática

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

Resolução de problemas com aplicações em funções

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

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

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

A modified Hopfield model for solving the N-Queens problem

A neural network model for solving the N-Queens problem is presented in this paper. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points. The network is shown to be completely stable and globally convergent to the solutions of the N-Queens problem. Simulation results are presented to validate the proposed approach.

C programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

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

Combining artificial intelligence and human problem solving: Proposing a new architecture for ITS's

This paper shows a comparative study between the Artificial Intelligence Problem Solving and the Human Problem Solving. The study is based on the solution by many ways of problems proposed via multiple-choice questions. General techniques used by humans to solve this kind of problems are grouped in blocks and each block is divided in steps. A new architecture for ITS - Intelligent Tutoring System is proposed to support experts' knowledge representation and novices' activities. Problems are represented by a text and feasible answers with particular meaning and form, to be rigorously analyzed by the solver to find the right one. Paths through a conceptual space of states represent each right solution.

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Concept of Matching Parallelepiped and its use in the correspondence problem

In this paper, the concept of Matching Parallelepiped (MP) is presented. It is shown that the volume of the MP can be used as an additional measure of `distance' between a pair of candidate points in a matching algorithm by Relaxation Labeling (RL). The volume of the MP is related with the Epipolar Geometry and the use of this measure works as an epipolar constraint in a RL process, decreasing the efforts in the matching algorithm since it is not necessary to explicitly determine the equations of the epipolar lines and to compute the distance of a candidate point to each epipolar line. As at the beginning of the process the Relative Orientation (RO) parameters are unknown, a initial matching based on gradient, intensities and correlation is obtained. Based on this set of labeled points the RO is determined and the epipolar constraint included in the algorithm. The obtained results shown that the proposed approach is suitable to determine feature-point matching with simultaneous estimation of camera orientation parameters even for the cases where the pair of optical axes are not parallel.

On the resolution of the generalized nonlinear complementarity problem

Minimization of a differentiable function subject to box constraints is proposed as a strategy to solve the generalized nonlinear complementarity problem (GNCP) defined on a polyhedral cone. It is not necessary to calculate projections that complicate and sometimes even disable the implementation of algorithms for solving these kinds of problems. Theoretical results that relate stationary points of the function that is minimized to the solutions of the GNCP are presented. Perturbations of the GNCP are also considered, and results are obtained related to the resolution of GNCPs with very general assumptions on the data. These theoretical results show that local methods for box-constrained optimization applied to the associated problem are efficient tools for solving the GNCP. Numerical experiments are presented that encourage the use of this approach.

Comparison of algorithms for loss allocation in transmission networks considering power redispatch

An analysis of the performances of three important methods for generators and loads loss allocation is presented. The discussed methods are: based on pro-rata technique; based on the incremental technique; and based on matrices of circuit. The algorithms are tested considering different generation conditions, using a known electric power system: IEEE 14 bus. Presented and discussed results verify: the location and the magnitude of generators and loads; the possibility to have agents well or poorly located in each network configuration; the discriminatory behavior considering variations in the power flow in the transmission lines. © 2004 IEEE.