A non-LTE abundance analysis of the post-AGB star ROA 5701

An analysis of high-resolution Anglo-Australian Telescope (AAT)/University College London Echelle Spectrograph (UCLES) optical spectra for the ultraviolet (UV)-bright star ROA 5701 in the globular cluster omega Cen (NGC 5139) is performed, using non-local thermodynamic equilibrium (non-LTE) model atmospheres to estimate stellar atmospheric parameters and chemical composition. Abundances are derived for C, N, O, Mg, Si and S, and compared with those found previously by Moehler et al. We find a general metal underabundance relative to young B-type stars, consistent with the average metallicity of the cluster. Our results indicate that ROA 5701 has not undergone a gas-dust separation scenario as previously suggested. However, its abundance pattern does imply that ROA 5701 has evolved off the asymptotic giant branch (AGB) prior to the onset of the third dredge-up.

Are they adicctied to college students social networks?

The development of the Internet and in particular of social networks has supposedly given a new view to the different aspects that surround human behavior. It includes those associated with addictions, but specifically the ones that have to do with technologies. Following a correlational descriptive design we present the results of a study, which involved university students from Social and Legal Sciences as participants, about their addiction to the Internet and in particular to social networks. The sample was conformed of 373 participants from the cities of Granada, Sevilla, Málaga, and Córdoba. To gather the data a questionnaire that was design by Young was translated to Spanish. The main research objective was to determine if university students could be considered social network addicts. The most prominent result was that the participants don’t consider themselves to be addicted to the Internet or to social networks; in particular women reflected a major distance from the social networks. It’s important to know that the results differ from those found in the literature review, which opens the question, are the participants in a phase of denial towards the addiction?

A method for determining generators’ shares in loads, line flows and losses

This paper presents a new method for calculating the individual generators’ shares in line flows, line losses and loads. The method is described and illustrated on active power flows, but it can be applied in the same way to reactive power flows. Starting from a power flow solution, the line flow matrix is formed. This matrix is used for identifying node types, tracing the power flow from generators downstream to loads, and to determine generators’ participation factors to lines and loads. Neither exhaustive search nor matrix inversion is required. Hence, the method is claimed to be the least computationally demanding amongst all of the similar methods.

Combining multiple prioritized knowledge bases by negotiation.

Recently, several belief negotiation models have been introduced to deal with the problem of belief merging. A negotiation model usually consists of two functions: a negotiation function and a weakening function. A negotiation function is defined to choose the weakest sources and these sources will weaken their point of view using a weakening function. However, the currently available belief negotiation models are based on classical logic, which makes them difficult to define weakening functions. In this paper, we define a prioritized belief negotiation model in the framework of possibilistic logic. The priority between formulae provides us with important information to decide which beliefs should be discarded. The problem of merging uncertain information from different sources is then solved by two steps. First, beliefs in the original knowledge bases will be weakened to resolve inconsistencies among them. This step is based on a prioritized belief negotiation model. Second, the knowledge bases obtained by the first step are combined using a conjunctive operator which may have a reinforcement effect in possibilistic logic.

Las Comisiones del Mapa de España en la década de 1850

La necesidad de contar con un mapa de base científica que cubriera todo el territorio español llevó al Estado a crear en paralelo varias Comisiones con cometidos geodésicos, topográficos y cartográficos durante la década de 1850. La labor simultánea de estas Comisiones se prolongó hasta 1859, cuando se aprobó la Ley de Medición del Territorio, que las fusionó en un único organismo. Este artículo analiza aspectos técnicos de los trabajos que realizaron estas Comisiones a partir de la información contenida en algunos documentos que custodia el Archivo Topográfico del IGN. Las conclusiones que se extraen son que estas Comisiones acometieron operaciones geodésicas que resultaron cruciales en el establecimiento ulterior de la red de triangulación peninsular, realizaron mediciones topográficas que fueron reutilizadas veinte años después en el levantamiento del Mapa Topográfico Nacional, e idearon las características catastrales que fueron adoptadas durante todo el siglo posterior para el Catastro de España.

A recursive rule base adjustment algorithm for a fuzzy logic controller

This paper introduces a recursive rule base adjustment to enhance the performance of fuzzy logic controllers. Here the fuzzy controller is constructed on the basis of a decision table (DT), relying on membership functions and fuzzy rules that incorporate heuristic knowledge and operator experience. If the controller performance is not satisfactory, it has previously been suggested that the rule base be altered by combined tuning of membership functions and controller scaling factors. The alternative approach proposed here entails alteration of the fuzzy rule base. The recursive rule base adjustment algorithm proposed in this paper has the benefit that it is computationally more efficient for the generation of a DT, and advantage for online realization. Simulation results are presented to support this thesis. (c) 2005 Elsevier B.V. All rights reserved.

Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems

In this paper, we present a random iterative graph based hyper-heuristic to produce a collection of heuristic sequences to construct solutions of different quality. These heuristic sequences can be seen as dynamic hybridisations of different graph colouring heuristics that construct solutions step by step. Based on these sequences, we statistically analyse the way in which graph colouring heuristics are automatically hybridised. This, to our knowledge, represents a new direction in hyper-heuristic research. It is observed that spending the search effort on hybridising Largest Weighted Degree with Saturation Degree at the early stage of solution construction tends to generate high quality solutions. Based on these observations, an iterative hybrid approach is developed to adaptively hybridise these two graph colouring heuristics at different stages of solution construction. The overall aim here is to automate the heuristic design process, which draws upon an emerging research theme on developing computer methods to design and adapt heuristics automatically. Experimental results on benchmark exam timetabling and graph colouring problems demonstrate the effectiveness and generality of this adaptive hybrid approach compared with previous methods on automatically generating and adapting heuristics. Indeed, we also show that the approach is competitive with the state of the art human produced methods.