On the complexity of strongly connected components in directed hypergraphs

We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergraphs to computational tropical geometry. We also discuss the problem of computing all SCCs. We establish a superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs, showing that it is combinatorially more complex than in directed graphs. Besides, we prove a linear time reduction from the well-studied problem of finding all minimal sets among a given family to the problem of computing the SCCs. Only subquadratic time algorithms are known for the former problem. These results strongly suggest that the problem of computing the SCCs is harder in directed hypergraphs than in directed graphs.Comment: v1: 32 pages, 7 figures; v2: revised version, 34 pages, 7 figure

Large Extra Dimensions, Sterile neutrinos and Solar Neutrino Data

Solar, atmospheric and LSND neutrino oscillation results require a light sterile neutrino, $\nu_B$, which can exist in the bulk of extra dimensions. Solar $\nu_e$, confined to the brane, can oscillate in the vacuum to the zero mode of $\nu_B$ and via successive MSW transitions to Kaluza-Klein states of $\nu_B$. This new way to fit solar data is provided by both low and intermediate string scale models. From average rates seen in the three types of solar experiments, the Super-Kamiokande spectrum is predicted with 73% probability, but dips characteristic of the 0.06 mm extra dimension should be seen in the SNO spectrum.Comment: 4 pages, 2 figure

Tests of Lorentz violation in muon antineutrino to electron antineutrino oscillations

A recently developed Standard-Model Extension (SME) formalism for neutrino oscillations that includes Lorentz and CPT violation is used to analyze the sidereal time variation of the neutrino event excess measured by the Liquid Scintillator Neutrino Detector (LSND) experiment. The LSND experiment, performed at Los Alamos National Laboratory, observed an excess, consistent with neutrino oscillations, of ${\bar\nu}_e$ in a beam of ${\bar\nu}_\mu$. It is determined that the LSND oscillation signal is consistent with no sidereal variation. However, there are several combinations of SME coefficients that describe the LSND data; both with and without sidereal variations. The scale of Lorentz and CPT violation extracted from the LSND data is of order $10^{-19}$ GeV for the SME coefficients $a_L$ and $E \times c_L$. This solution for Lorentz and CPT violating neutrino oscillations may be tested by other short baseline neutrino oscillation experiments, such as the MiniBooNE experiment.Comment: 10 pages, 10 figures, 2 tables, uses revtex4 replaced with version to be published in Physical Review D, 11 pages, 11 figures, 2 tables, uses revtex

Search for π0→νμνˉμ\pi^0 \to \nu_{\mu}\bar\nu_{\mu} Decay in LSND

We observe a net beam-excess of $8.7 \pm 6.3$ (stat) $\pm 2.4$ (syst) events, above 160 MeV, resulting from the charged-current reaction of $\nu_{\mu}$ and/or $\bar\nu_{\mu}$ on C and H in the LSND detector. No beam related muon background is expected in this energy regime. Within an analysis framework of $\pi^0 \to \nu_{\mu}\bar\nu_{\mu}$, we set a direct upper limit for this branching ratio of $\Gamma(\pi^0 \to \nu_\mu \bar\nu_\mu) / \Gamma(\pi^0 \to all) < 1.6 \times 10^{-6}$ at 90% confidence level.Comment: 4 pages, 4 figure

Tau Be or not Tau Be? - A Perspective on Service Compatibility and Substitutability

One of the main open research issues in Service Oriented Computing is to propose automated techniques to analyse service interfaces. A first problem, called compatibility, aims at determining whether a set of services (two in this paper) can be composed together and interact with each other as expected. Another related problem is to check the substitutability of one service with another. These problems are especially difficult when behavioural descriptions (i.e., message calls and their ordering) are taken into account in service interfaces. Interfaces should capture as faithfully as possible the service behaviour to make their automated analysis possible while not exhibiting implementation details. In this position paper, we choose Labelled Transition Systems to specify the behavioural part of service interfaces. In particular, we show that internal behaviours (tau transitions) are necessary in these transition systems in order to detect subtle errors that may occur when composing a set of services together. We also show that tau transitions should be handled differently in the compatibility and substitutability problem: the former problem requires to check if the compatibility is preserved every time a tau transition is traversed in one interface, whereas the latter requires a precise analysis of tau branchings in order to make the substitution preserve the properties (e.g., a compatibility notion) which were ensured before replacement.Comment: In Proceedings WCSI 2010, arXiv:1010.233