Radio fiber bursts and fast magnetoacoustic wave trains

We present a model for dm-fiber bursts that is based on assuming fast sausage magnetoacoustic wave trains that propagate along a dense vertical filament or current sheet. Eight groups of dm-fiber bursts that were observed during solar flares were selected and analyzed by the wavelet analysis method. To model these fiber bursts we built a semi-empirical model. We also did magnetohydrodynamic simulations of a propagation of the magnetoacoustic wave train in a vertical and gravitationally stratified current sheet. In the wavelet spectra of the fiber bursts computed at different radio frequencies we found the wavelet tadpoles, whose head maxima have the same frequency drift as the drift of fiber bursts. It indicates that the drift of these fiber bursts can be explained by the propagating fast sausage magnetoacoustic wave train. Using new semi-empirical and magnetohydrodynamic models with a simple radio emission model we generated the artificial radio spectra of the fiber bursts, which are similar to the observed ones.Comment: 7 pages, 10 figure

BART 2001–2004: An intelligent robotic observatory

BART is a robotic observatory located at the Astronomical Institute in Ondrejov, Czech Republic. It is a relatively low-cost (25 cm + two wide-field lenses) device developed for rapid follow-ups of GRBs. Since 2001 when it started to observe, it has done several such observations. Meanwhile, photometric monitoring tasks are performed, using an intelligent selection algorithm. Not only the telescope is automatic, the entire observatory does not require human presence: system prepares the schedule, observes, registers the images and stores them into database without human intervention: human assistance is reduced to maintenance and weather checking. BART is a primary developing platform for RTS2, the robotic telescope operation software, which allows for unattended observation as well as control of the entire observatory

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.Comment: Accepted at GD '1

Searching for galactic sources in the Swift GRB catalog

Since the early 1990s Gamma Ray Bursts have been accepted to be of extra-galactic origin due to the isotropic distribution observed by BATSE and the redshifts observed via absorption line spectroscopy. Nevertheless, upon further examination at least one case turned out to be of galactic origin. This particular event presented a Fast Rise, Exponential Decay (FRED) structure which leads us to believe that other FRED sources might also be Galactic. This study was set out to estimate the most probable degree of contamination by galactic sources that certain samples of FREDs have. In order to quantify the degree of anisotropy the average dipolar and quadripolar moments of each sample of GRBs with respect to the galactic plane were calculated. This was then compared to the probability distribution of simulated samples comprised of a combination of isotropically generated sources and galactic sources. We observe that the dipolar and quadripolar moments of the selected subsamples of FREDs are found more than two standard deviations outside those of random isotropically generated samples.The most probable degree of contamination by galactic sources for the FRED GRBs of the Swift catalog detected until February 2011 that do not have a known redshift is about 21 out of 77 sources which is roughly equal to 27%. Furthermore we observe, that by removing from this sample those bursts that may have any type of indirect redshift indicator and multiple peaks gives the most probable contamination increases up to 34% (17 out of 49 sources). It is probable that a high degree of contamination by galactic sources occurs among the single peak FREDs observed by Swift.Comment: Published to A&A, 4 pages, 5 figures, this arXiv version includes appended table with all the bursts considered in this stud

Minimal Obstructions for Partial Representations of Interval Graphs

Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. Two linear-time algorithms are known for solving this problem. In this paper, we characterize the minimal obstructions which make partial representations non-extendible. This generalizes Lekkerkerker and Boland's characterization of the minimal forbidden induced subgraphs of interval graphs. Each minimal obstruction consists of a forbidden induced subgraph together with at most four pre-drawn intervals. A Helly-type result follows: A partial representation is extendible if and only if every quadruple of pre-drawn intervals is extendible by itself. Our characterization leads to a linear-time certifying algorithm for partial representation extension

Calculation Of Non-Adiabatic Coupling Vectors In A Local-Orbital Basis Set

The following article appeared in Journal of Chemical Physics 138.15 (2013): 154106 and may be found at http://scitation.aip.org/content/aip/journal/jcp/138/15/10.1063/1.4801511Most of today's molecular-dynamics simulations of materials are based on the Born-Oppenheimer approximation. There are many cases, however, in which the coupling of the electrons and nuclei is important and it is necessary to go beyond the Born-Oppenheimer approximation. In these methods, the non-adiabatic coupling vectors are fundamental since they represent the link between the classical atomic motion of the nuclei and the time evolution of the quantum electronic state. In this paper we analyze the calculation of non-adiabatic coupling vectors in a basis set of local orbitals and derive an expression to calculate them in a practical and computationally efficient way. Some examples of the application of this expression using a local-orbital density functional theory approach are presented for a few simple molecules: H3, formaldimine, and azobenzene. These results show that the approach presented here, using the Slater transition-state density, is a very promising way for the practical calculation of non-adiabatic coupling vectors for large systems.This work was partially supported by Spanish Ministerio de Economía y Competitividad (Contract No.FIS2010-16046), the Comunidad de Madrid (Contract No.S2009/MAT-1467), the Office of Science, Basic Energy Sciences in the US Department of Energy (Grant No. DEFG02-10ER16164), the Czech Science Foundation (GAČR)(Project No. 204/10/0952), the Grant of the MŠMT of the Czech Republic (Grant No. ME 09048), and COST-CMTS Action CM1002 (CODECS). J.O. gratefully acknowledges support from the Spanish Ministerio de Ciencia e Innovación (PR2008-0027). E.A. gratefully acknowledges financial support by the Consejería de Educación de la Comunidad de Madrid and Fondo Social Europeo

A new multi-center approach to the exchange-correlation interactions in ab initio tight-binding methods

A new approximate method to calculate exchange-correlation contributions in the framework of first-principles tight-binding molecular dynamics methods has been developed. In the proposed scheme on-site (off-site) exchange-correlation matrix elements are expressed as a one-center (two-center) term plus a {\it correction} due to the rest of the atoms. The one-center (two-center) term is evaluated directly, while the {\it correction} is calculated using a variation of the Sankey-Niklewski \cite{Sankey89} approach generalized for arbitrary atomic-like basis sets. The proposed scheme for exchange-correlation part permits the accurate and computationally efficient calculation of corresponding tight-binding matrices and atomic forces for complex systems. We calculate bulk properties of selected transition (W,Pd), noble (Au) or simple (Al) metals, a semiconductor (Si) and the transition metal oxide Ti$O_2$ with the new method to demonstrate its flexibility and good accuracy.Comment: 17 pages, 5 figure

Hierarchical Partial Planarity

In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.Comment: Conference version appeared in WG201