Contribution to the ground-based follow-up of the Gaia space mission

The Gaia Space Mission [Mignard, F., 2005. The three-dimensional universe with Gaia. ESA/SP-576; Perryman, M., 2005. The three-dimensional universe with Gaia. ESA/SP-576] will observe several transient events as supernovae, microlensing, gamma ray bursts and new Solar System objects. The satellite, due to its scanning law, will detect these events but will not be able to monitor them. So, to take these events into consideration and to perform further studies it is necessary to follow them with Earth-based observations. These observations could be efficiently done by a ground-based network of well-equipped telescopes scattered in both hemispheres. Here we focus our attention at the new Solar System objects to be discovered and observed by the Gaia satellite [Mignard, F., 2002. Observations of Solar System objects by Gaia I. Detection of NEOS. Astron. Astrophys. 393, 727] mainly asteroids, NEOs and comets. A dedicated ground-based network of telescopes as proposed by Thuillot [2005. The three-dimensional universe with Gaia. ESA/SP-576] will allow to monitor those events, to avoid losing them and to perform a quick characterization of some physical properties which will be important for the identification of these objects in further measurements by Gaia. We present in this paper, the beginning of the organization of a Latin-American ground-based network of telescopes and observers joining several institutions in Argentina, Bolivia, Brazil and other Latin-American countries aiming to contribute to the follow-up of Gaia science alerts for Solar System objects. (C) 2008 Elsevier Ltd. All rights reserved.

Arrest of root formation in a permanent maxillary central incisor subsequent to trauma and pulp necrosis to the primary predecessor

This paper reports a case in which a previous traumatic injury at the age of 2 and pulp necrosis to a primary incisor resulted in a rare injury to the permanent successor tooth. The radiographic examination at the age of 9 showed the arrest of root formation of the permanent maxillary right central incisor, which did not erupt. Tooth 11 was extracted and a functional removable space maintainer was prepared. At the age of 17, the patient received an anterior fixed prosthesis for re-establishment of the esthetics, phonetics and deglutition.

Unilateral Correction of Space Loss in the Mixed Dentition

Distalization of maxillary molars is indicated for correction of Class II dental malocclusion and for space gain in cases of space deficiency. The ideal treatment with an intraoral fixed appliance for molar distalization should fulfill the following requirements: patient compliance; acceptable esthetics; comfort; minimum anterior anchor loss (as evidenced by inclination of incisors); bodily movement of the molars to avoid undesirable effects and unstable outcomes; and minimum time required during sessions for placement and activations. The purpose of this paper was to present an alternative treatment for space recovery in the area of the maxillary right second premolar when there has been significant mesial movement of the permanent maxillary right first molar. We used a modified appliance that allows unilateral molar distalization in cases of unilateral tooth/arch size discrepancy using the opposite side as anchor, thus reducing the mesialization of the anterior teeth. (Pediatr Dent 2008;30:334-41) Received August 17, 2006 / Last Revision October 17, 2007 / Revision Accepted October 17, 2007

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.