Copernicus observations of Betelgeuse and Antares

Copernicus observations of the M-supergiants, alpha Ori and alpha Sco, are presented. The MgII h and k resonance lines are strongly in emission in both stars. The k line is highly asymmetric in both stars but the h line is symmetric. Upper limits for several other resonance lines are given for alpha Ori. The possibility is explored that the k line asymmetry is caused by overlying resonance lines of MnI and FeI formed in the cool circumstellar gas shells around these stars. Observations of the MnI 4030-4033 A lines are used to show that circumstellar shell absorption is too weak to explain the asymmetry. It is suggested that the absorption occurs in a cool turbulent region between the base of the circumstellar shell and the top of the chromosphere

RC Autonomous Circuits with Chaotic Behavior

The paper presents obtained results with applying the "Semi-systematic procedure for producing the chaos from quasi-sinusoidal oscillators". We applied this procedure to RC autonomous circuit and obtained two new autonomous circuits with chaotic behaviour. The two obtained circuits are presented. The usage of various non-linear devices is examined

Single mechanosensitive and ca(2+)-sensitive channel currents recorded from mouse and human embryonic stem cells

Cell-attached and inside-out patch clamp recording was used to compare the functional expression of membrane ion channels in mouse and human embryonic stem cells (ESCs). Both ESCs express mechanosensitive Ca(2+) permeant cation channels (MscCa) and large conductance (200 pS) Ca(2+)-sensitive K(+) (BK(Ca2+)) channels but with markedly different patch densities. MscCa is expressed at higher density in mESCs compared with hESCs (70 % vs. 3 % of patches), whereas the BK(Ca2+) channel is more highly expressed in hESCs compared with mESCs (~50 % vs. 1 % of patches). ESCs of both species express a smaller conductance (25 pS) nonselective cation channel that is activated upon inside-out patch formation but is neither mechanosensitive nor strictly Ca(2+)-dependent. The finding that mouse and human ESCs express different channels that sense membrane tension and intracellular [Ca(2+)] may contribute to their different patterns of growth and differentiation in response to mechanical and chemical cues.OH was supported by a travel/stay Grant from Ministerio de Educación y Ciencia (SAB2006-0211) and in the United States by grants from the National Cancer Institute and the Department of Defense. BS and AH are supported by the Fundación Progreso y Salud, Consejería de Salud, Junta de Andalucía (PI-0022/ 2008); Consejería de Innovación Ciencia y Empresa, Junta de Andalucía (CTS-6505; INP-2011-1615-900000); FEDER cofunded grants from Instituto de Salud Carlos III (Red TerCel-RD06/0010/0025; PI10/00964), and the Ministry of Health and Consumer Affairs (Advanced Therapies Program TRA-120). CIBERDEM is an initiative of the Instituto de Salud Carlos III.Peer Reviewe

Tuning struggle strategy in genetic algorithms for scheduling in computational grids

Job Scheduling on Computational Grids is gaining importance due to the need for efficient large-scale Grid-enabled applications. Among different optimization techniques addressed for the problem, Genetic Algorithm (GA) is a popular class of solution methods. As GAs are high level algorithms, specific algorithms can be designed by choosing the genetic operators as well as the evolutionary strategies. In this paper we focus on Struggle GAs and their tuning for the scheduling of independent jobs in computational grids. Our results showed that a careful hash implementation for computing the similarity of solutions was able to alleviate the computational burden of Struggle GA and perform better than standard similarity measures.Peer ReviewedPostprint (published version

The irreducible unitary representations of the extended Poincare group in (1+1) dimensions

We prove that the extended Poincare group in (1+1) dimensions is non-nilpotent solvable exponential, and therefore that it belongs to type I. We determine its first and second cohomology groups in order to work out a classification of the two-dimensional relativistic elementary systems. Moreover, all irreducible unitary representations of the extended Poincare group are constructed by the orbit method. The most physically interesting class of irreducible representations corresponds to the anomaly-free relativistic particle in (1+1) dimensions, which cannot be fully quantized. However, we show that the corresponding coadjoint orbit of the extended Poincare group determines a covariant maximal polynomial quantization by unbounded operators, which is enough to ensure that the associated quantum dynamical problem can be consistently solved, thus providing a physical interpretation for this particular class of representations.Comment: 12 pages, Revtex 4, letter paper; Revised version of paper published in J. Math. Phys. 45, 1156 (2004

Switcher-random-walks: a cognitive-inspired mechanism for network exploration

Semantic memory is the subsystem of human memory that stores knowledge of concepts or meanings, as opposed to life specific experiences. The organization of concepts within semantic memory can be understood as a semantic network, where the concepts (nodes) are associated (linked) to others depending on perceptions, similarities, etc. Lexical access is the complementary part of this system and allows the retrieval of such organized knowledge. While conceptual information is stored under certain underlying organization (and thus gives rise to a specific topology), it is crucial to have an accurate access to any of the information units, e.g. the concepts, for efficiently retrieving semantic information for real-time needings. An example of an information retrieval process occurs in verbal fluency tasks, and it is known to involve two different mechanisms: -clustering-, or generating words within a subcategory, and, when a subcategory is exhausted, -switching- to a new subcategory. We extended this approach to random-walking on a network (clustering) in combination to jumping (switching) to any node with certain probability and derived its analytical expression based on Markov chains. Results show that this dual mechanism contributes to optimize the exploration of different network models in terms of the mean first passage time. Additionally, this cognitive inspired dual mechanism opens a new framework to better understand and evaluate exploration, propagation and transport phenomena in other complex systems where switching-like phenomena are feasible.Comment: 9 pages, 3 figures. Accepted in "International Journal of Bifurcations and Chaos": Special issue on "Modelling and Computation on Complex Networks

Robustness of the European power grids under intentional attack

The power grid defines one of the most important technological networks of our times and sustains our complex society. It has evolved for more than a century into an extremely huge and seemingly robust and well understood system. But it becomes extremely fragile as well, when unexpected, usually minimal, failures turn into unknown dynamical behaviours leading, for example, to sudden and massive blackouts. Here we explore the fragility of the European power grid under the effect of selective node removal. A mean field analysis of fragility against attacks is presented together with the observed patterns. Deviations from the theoretical conditions for network percolation (and fragmentation) under attacks are analysed and correlated with non topological reliability measures.Comment: 7 pages, 4 figure

Exploring the randomness of Directed Acyclic Networks

The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems -such as some food-webs and electronic and neural wiring- can be described in terms of so-called directed acyclic graphs (DAGs). An important ingredient of the analysis of such networks is a proper comparison of their observed architecture against an ensemble of randomized graphs, thereby quantifying the {\em randomness} of the real systems with respect to suitable null models. This approximation is particularly relevant when the finite size and/or large connectivity of real systems make inadequate a comparison with the predictions obtained from the so-called {\em configuration model}. In this paper we analyze four methods of DAG randomization as defined by the desired combination of topological invariants (directed and undirected degree sequence and component distributions) aimed to be preserved. A highly ordered DAG, called \textit{snake}-graph and a Erd\:os-R\'enyi DAG were used to validate the performance of the algorithms. Finally, three real case studies, namely, the \textit{C. elegans} cell lineage network, a PhD student-advisor network and the Milgram's citation network were analyzed using each randomization method. Results show how the interpretation of degree-degree relations in DAGs respect to their randomized ensembles depend on the topological invariants imposed. In general, real DAGs provide disordered values, lower than the expected by chance when the directedness of the links is not preserved in the randomization process. Conversely, if the direction of the links is conserved throughout the randomization process, disorder indicators are close to the obtained from the null-model ensemble, although some deviations are observed.Comment: 13 pages, 5 figures and 5 table

Avances importantes en la recuperación de la jara de Cartagena en la Comunidad Valenciana

Avances importantes en la recuperación de la jara de Cartagena en la Comunidad Valencian