A SEARCH FOR FIELD HORIZONTAL-BRANCH STARS NEAR THE SOUTH GALACTIC POLE

Searches for field horizontal-branch (FHB) stars in the halo of the Galaxy in the past have been carried out by several techniques, such as objective-prism surveys and visual or infrared photometric surveys. By choosing adequate color criteria, it is possible to improve the efficiency of identifying bona fide FHB stars among the other objects that exhibit similar characteristics, such as main-sequence A-stars, blue stragglers, subdwarfs, etc. In this work, we report the results of a spectroscopic survey carried out near the south Galactic pole intended to validate FHB stars originally selected from the HK objective-prism survey of Beers and colleagues, based on near-infrared color indices. A comparison between the stellar spectra obtained in this survey with theoretical stellar atmosphere models allows us to determine T(eff), log g, and [Fe/H] for 13 stars in the sample. Stellar temperatures were calculated from measured (B-V)(o), when this measurement was available (16 stars). The color index criteria adopted in this work are shown to correctly classify 30% of the sample as FHB, 25% as non-FHB (main-sequence stars and subdwarfes), whereas 40% could not be distinguished between FHB and main-sequence stars. We compare the efficacy of different color criteria in the literature intended to select FHB stars, and discuss the use of the Mg II 4481 line to estimate the metallicity.

Li-rich red giant branch stars in the Galactic bulge

Aims. We present lithium abundance determination for a sample of K giant stars in the Galactic bulge. The stars presented here are the only 13 stars with a detectable lithium line (6767.18 angstrom) among similar to 400 stars for which we have spectra in this wavelength range, half of them in Baade's Window (b = -4 degrees) and half in a field at b = -6 degrees. Methods. The stars were observed with the GIRAFFE spectrograph of FLAMES mounted on VLT, with a spectral resolution of R similar to 20 000. Abundances were derived from spectral synthesis and the results are compared with those of stars with similar parameters, but no detectable Li line. Results. We find 13 stars with a detectable Li line, among which 2 have abundances A(Li) > 2.7. No clear correlations were found between the Li abundance and those of other elements. With the exception of the two most Li rich stars, the others follow a fairly tight A(Li) - T(eff) correlation. Conclusions. There is strong indication of a Li production phase during the red giant branch (RGB), acting either on a very short timescale, or selectively only in some stars. That the proposed Li production phase is associated with the RGB bump cannot be excluded, although our targets are significantly brighter than the predicted RGB bump magnitude for a population at 8 kpc.

Offline Detection, Identification, and Correction of Branch Parameter Errors Based on Several Measurement Snapshots

This paper proposes a three-stage offline approach to detect, identify, and correct series and shunt branch parameter errors. In Stage 1 the branches suspected of having parameter errors are identified through an Identification Index (II). The II of a branch is the ratio between the number of measurements adjacent to that branch, whose normalized residuals are higher than a specified threshold value, and the total number of measurements adjacent to that branch. Using several measurement snapshots, in Stage 2 the suspicious parameters are estimated, in a simultaneous multiple-state-and-parameter estimation, via an augmented state and parameter estimator which increases the V - theta state vector for the inclusion of suspicious parameters. Stage 3 enables the validation of the estimation obtained in Stage 2, and is performed via a conventional weighted least squares estimator. Several simulation results (with IEEE bus systems) have demonstrated the reliability of the proposed approach to deal with single and multiple parameter errors in adjacent and non-adjacent branches, as well as in parallel transmission lines with series compensation. Finally the proposed approach is confirmed on tests performed on the Hydro-Quebec TransEnergie network.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Dorsal cutaneous branch of the ulnar nerve: a light and electron microscopy histometric study

This study describes the normal morphology and morphometry of the dorsal cutaneous branch of the ulnar nerve (DCBU) in humans. Fourteen nerves of eight donors were prepared by conventional techniques for paraffin and epoxy resin embedding. Semiautomatic morphometric analysis was performed by means of specific computer software. Histograms of the myelinated and unmyelinated fiber population and the G-ratio distribution of fibers were plotted. Myelinated fiber density per nerve varied from 5,910 to 10,166 fibers/mm(2), with an average of 8,170 +/- 393 fibers/mm(2). The distribution was bimodal with peaks at 4.0 and 9.5 mu m. Unmyelinated fiber density per nerve varied from 50,985 to 127,108, with an average of 78,474 +/- 6, 610 fibers/mm(2), with a unimodal distribution displaying a peak at 0.8 mu m. This study thus adds information about the fascicles and myelinated and unmyelinated fibers of DCBU nerves in normal people, which may be useful in further studies concerning ulnar nerve neuropathies, mainly leprosy neuropathy.

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.