Quantum Inverse Square Interaction

Hamiltonians with inverse square interaction potential occur in the study of a variety of physical systems and exhibit a rich mathematical structure. In this talk we briefly mention some of the applications of such Hamiltonians and then analyze the case of the N-body rational Calogero model as an example. This model has recently been shown to admit novel solutions, whose properties are discussed.Comment: Talk presented at the conference "Space-time and Fundamental Interactions: Quantum Aspects" in honour of Prof. A.P.Balachandran's 65th birthday, Vietri sul Mare, Italy, 26 - 31 May, 2003, Latex file, 9 pages. Some references added in the replaced versio

Real-time reverse transcription polymerase chain reaction development for rapid detection of Tomato brown rugose fruit virus and comparison with other techniques

Background: Tomato brown rugose fruit virus (ToBRFV) is a highly infectious tobamovirus that causes severe disease in tomato (Solanum lycopersicum L.) crops. In Italy, the first ToBRFV outbreak occurred in 2018 in several provinces of the Sicily region. ToBRFV outbreak represents a serious threat for tomato crops in Italy and the Mediterranean Basin. Methods: Molecular and biological characterisation of the Sicilian ToBRFV ToB-SIC01/19 isolate was performed, and a sensitive and specific Real-time RT-PCR TaqMan minor groove binder probe method was developed to detect ToBRFV in infected plants and seeds. Moreover, four different sample preparation procedures (immunocapture, total RNA extraction, direct crude extract and leaf-disk crude extract) were evaluated. Results: The Sicilian isolate ToB-SIC01/19 (6,391 nt) showed a strong sequence identity with the isolates TBRFV-P12-3H and TBRFV-P12-3G from Germany, Tom1-Jo from Jordan and TBRFV-IL from Israel. The ToB-SIC01/19 isolate was successfully transmitted by mechanical inoculations in S. lycopersicum L. and Capsicum annuum L., but no transmission occurred in S. melongena L. The developed real-time RT-PCR, based on the use of a primer set designed on conserved sequences in the open reading frames3, enabled a reliable quantitative detection. This method allowed clear discrimination of ToBRFV from other viruses belonging to the genus Tobamovirus, minimising false-negative results. Using immunocapture and total RNA extraction procedures, the real-time RT-PCR and end-point RT-PCR gave the same comparable results. Using direct crude extracts and leaf-disk crude extracts, the end-point RT-PCR was unable to provide a reliable result. This developed highly specific and sensitive real-time RT-PCR assay will be a particularly valuable tool for early ToBRFV diagnosis, optimising procedures in terms of costs and time

Computing Quantiles in Markov Reward Models

Probabilistic model checking mainly concentrates on techniques for reasoning about the probabilities of certain path properties or expected values of certain random variables. For the quantitative system analysis, however, there is also another type of interesting performance measure, namely quantiles. A typical quantile query takes as input a lower probability bound p and a reachability property. The task is then to compute the minimal reward bound r such that with probability at least p the target set will be reached before the accumulated reward exceeds r. Quantiles are well-known from mathematical statistics, but to the best of our knowledge they have not been addressed by the model checking community so far. In this paper, we study the complexity of quantile queries for until properties in discrete-time finite-state Markov decision processes with non-negative rewards on states. We show that qualitative quantile queries can be evaluated in polynomial time and present an exponential algorithm for the evaluation of quantitative quantile queries. For the special case of Markov chains, we show that quantitative quantile queries can be evaluated in time polynomial in the size of the chain and the maximum reward.Comment: 17 pages, 1 figure; typo in example correcte

A Multi-Membership Catalogue for 1876 Open Clusters using UCAC4 data

The main objective of this work is to determine the cluster members of 1876 open clusters, using positions and proper motions of the astrometric catalogue UCAC4. For this purpose we apply three different methods, all them based on a Bayesian approach, but with different formulations: a purely parametric method, another completely non-parametric algorithm, and a third, recently developed by Sampedro & Alfaro, using both formulations at different steps of the whole process. The first and second statistical moments of the members phase-space subspace, obtained after applying the three methods, are compared for every cluster. Although, on average, the three methods yield similar results, specific differences between them, as well as for some particular clusters, are also present. The comparison with other published catalogues shows good agreement. We have also estimated for the first time the mean proper motion for a sample of 18 clusters. The results are organized in a single catalogue formed by two main files, one with the most relevant information for each cluster, partially including that in UCAC4, and the other showing the individual membership probabilities for each star in the cluster area. The final catalogue, with an interface design that enables an easy interaction with the user, is available in electronic format at SSG-IAA (http://ssg.iaa.es/en/content/sampedro-cluster-catalog) website.Comment: Accepted for publication in MNRAS. 9 pages, 3 figures, 6 table

Discounting in LTL

In recent years, there is growing need and interest in formalizing and reasoning about the quality of software and hardware systems. As opposed to traditional verification, where one handles the question of whether a system satisfies, or not, a given specification, reasoning about quality addresses the question of \emph{how well} the system satisfies the specification. One direction in this effort is to refine the "eventually" operators of temporal logic to {\em discounting operators}: the satisfaction value of a specification is a value in $[0,1]$, where the longer it takes to fulfill eventuality requirements, the smaller the satisfaction value is. In this paper we introduce an augmentation by discounting of Linear Temporal Logic (LTL), and study it, as well as its combination with propositional quality operators. We show that one can augment LTL with an arbitrary set of discounting functions, while preserving the decidability of the model-checking problem. Further augmenting the logic with unary propositional quality operators preserves decidability, whereas adding an average-operator makes some problems undecidable. We also discuss the complexity of the problem, as well as various extensions

New insight into WDVV equation

We show that Witten-Dijkgraaf-Verlinde-Verlinde equation underlies the construction of N=4 superconformal multi--particle mechanics in one dimension, including a N=4 superconformal Calogero model.Comment: 16 pages, no figures, LaTeX file, PACS: 04.60.Ds; 11.30.P

BV formulation of higher form gauge theories in a superspace

We discuss the extended BRST and anti-BRST symmetry (including shift symmetry) in the Batalin-Vilkovisky (BV) formulation for two and three form gauge theories. Further we develop the superspace formulation for the BV actions for these theories. We show that the extended BRST invariant BV action for these theories can be written manifestly covariant manner in a superspace with one Grassmann coordinate. On the hand a superspace with two Grassmann coordinates are required for a manifestly covariant formulation of the extended BRST and extended anti-BRST invariant BV actions for higher form gauge theories.Comment: 30 pages, No figure, version to appear in EPJ

Spacetime Emergence in the Robertson-Walker Universe from a Matrix model

Using a novel, string theory-inspired formalism based on a Hamiltonian constraint, we obtain a conformal mechanical system for the spatially flat four-dimensional Robertson-Walker Universe. Depending on parameter choices, this system describes either a relativistic particle in the Robertson-Walker background, or metric fluctuations of the Robertson-Walker geometry. Moreover we derive a tree-level M-theory matrix model in this time-dependent background. Imposing the Hamiltonian constraint forces the spacetime geometry to be fuzzy near the big bang, while the classical Robertson-Walker geometry emerges as the Universe expands. From our approach we also derive the temperature of the Universe interpolating between the radiation and matter dominated eras.Comment: 4 pages - accepted for publication in Physical Review Letter

An Algorithm for Probabilistic Alternating Simulation

In probabilistic game structures, probabilistic alternating simulation (PA-simulation) relations preserve formulas defined in probabilistic alternating-time temporal logic with respect to the behaviour of a subset of players. We propose a partition based algorithm for computing the largest PA-simulation, which is to our knowledge the first such algorithm that works in polynomial time, by extending the generalised coarsest partition problem (GCPP) in a game-based setting with mixed strategies. The algorithm has higher complexities than those in the literature for non-probabilistic simulation and probabilistic simulation without mixed actions, but slightly improves the existing result for computing probabilistic simulation with respect to mixed actions.Comment: We've fixed a problem in the SOFSEM'12 conference versio