1,505 research outputs found

    PARISROC, a Photomultiplier Array Integrated Read Out Chip

    Get PDF
    PARISROC is a complete read out chip, in AMS SiGe 0.35 !m technology, for photomultipliers array. It allows triggerless acquisition for next generation neutrino experiments and it belongs to an R&D program funded by the French national agency for research (ANR) called PMm2: ?Innovative electronics for photodetectors array used in High Energy Physics and Astroparticles? (ref.ANR-06-BLAN-0186). The ASIC (Application Specific Integrated Circuit) integrates 16 independent and auto triggered channels with variable gain and provides charge and time measurement by a Wilkinson ADC (Analog to Digital Converter) and a 24-bit Counter. The charge measurement should be performed from 1 up to 300 photo- electrons (p.e.) with a good linearity. The time measurement allowed to a coarse time with a 24-bit counter at 10 MHz and a fine time on a 100ns ramp to achieve a resolution of 1 ns. The ASIC sends out only the relevant data through network cables to the central data storage. This paper describes the front-end electronics ASIC called PARISROC.Comment: IEEE Nuclear Science Symposium an Medical Imaging Conference (2009 NSS/MIC

    Software for cut-generating functions in the Gomory--Johnson model and beyond

    Full text link
    We present software for investigations with cut generating functions in the Gomory-Johnson model and extensions, implemented in the computer algebra system SageMath.Comment: 8 pages, 3 figures; to appear in Proc. International Congress on Mathematical Software 201

    Alarm-Based Prescriptive Process Monitoring

    Full text link
    Predictive process monitoring is concerned with the analysis of events produced during the execution of a process in order to predict the future state of ongoing cases thereof. Existing techniques in this field are able to predict, at each step of a case, the likelihood that the case will end up in an undesired outcome. These techniques, however, do not take into account what process workers may do with the generated predictions in order to decrease the likelihood of undesired outcomes. This paper proposes a framework for prescriptive process monitoring, which extends predictive process monitoring approaches with the concepts of alarms, interventions, compensations, and mitigation effects. The framework incorporates a parameterized cost model to assess the cost-benefit tradeoffs of applying prescriptive process monitoring in a given setting. The paper also outlines an approach to optimize the generation of alarms given a dataset and a set of cost model parameters. The proposed approach is empirically evaluated using a range of real-life event logs

    Stable Control of Pulse Speed in Parametric Three-Wave Solitons

    Get PDF
    We analyze the control of the propagation speed of three wave packets interacting in a medium with quadratic nonlinearity and dispersion. We found analytical expressions for mutually trapped pulses with a common velocity in the form of a three-parameter family of solutions of the three-wave resonant interaction. The stability of these novel parametric solitons is simply related to the value of their common group velocity

    Will-they-won't-they: A very large dataset for stance detection on twitter

    Get PDF
    We present a new challenging stance detection dataset, called Will-They-Won’t-They (WT--WT), which contains 51,284 tweets in English, making it by far the largest available dataset of the type. All the annotations are carried out by experts; therefore, the dataset constitutes a high-quality and reliable benchmark for future research in stance detection. Our experiments with a wide range of recent state-of-the-art stance detection systems show that the dataset poses a strong challenge to existing models in this domain.Keynes Fund, Cambridg

    STANDER: An expert-annotated dataset for news stance detection and evidence retrieval

    Get PDF
    N/

    Arboricity, h-Index, and Dynamic Algorithms

    Get PDF
    In this paper we present a modification of a technique by Chiba and Nishizeki [Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J. Comput. 14(1), pp. 210--223 (1985)]. Based on it, we design a data structure suitable for dynamic graph algorithms. We employ the data structure to formulate new algorithms for several problems, including counting subgraphs of four vertices, recognition of diamond-free graphs, cop-win graphs and strongly chordal graphs, among others. We improve the time complexity for graphs with low arboricity or h-index.Comment: 19 pages, no figure

    Euclid: Superluminous supernovae in the Deep Survey

    Get PDF
    Context. In the last decade, astronomers have found a new type of supernova called superluminous supernovae (SLSNe) due to their high peak luminosity and long light-curves. These hydrogen-free explosions (SLSNe-I) can be seen to z ~ 4 and therefore, offer the possibility of probing the distant Universe. Aims. We aim to investigate the possibility of detecting SLSNe-I using ESA’s Euclid satellite, scheduled for launch in 2020. In particular, we study the Euclid Deep Survey (EDS) which will provide a unique combination of area, depth and cadence over the mission. Methods. We estimated the redshift distribution of Euclid SLSNe-I using the latest information on their rates and spectral energy distribution, as well as known Euclid instrument and survey parameters, including the cadence and depth of the EDS. To estimate the uncertainties, we calculated their distribution with two different set-ups, namely optimistic and pessimistic, adopting different star formation densities and rates. We also applied a standardization method to the peak magnitudes to create a simulated Hubble diagram to explore possible cosmological constraints. Results. We show that Euclid should detect approximately 140 high-quality SLSNe-I to z ~ 3.5 over the first five years of the mission (with an additional 70 if we lower our photometric classification criteria). This sample could revolutionize the study of SLSNe-I at z > 1 and open up their use as probes of star-formation rates, galaxy populations, the interstellar and intergalactic medium. In addition, a sample of such SLSNe-I could improve constraints on a time-dependent dark energy equation-of-state, namely w(a), when combined with local SLSNe-I and the expected SN Ia sample from the Dark Energy Survey. Conclusions. We show that Euclid will observe hundreds of SLSNe-I for free. These luminous transients will be in the Euclid data-stream and we should prepare now to identify them as they offer a new probe of the high-redshift Universe for both astrophysics and cosmology.Acknowledgements. We thank the internal EC referees (P. Nugent and J. Brichmann) as well as the many comments from our EC colleagues and friends. C.I. thanks Chris Frohmaier and Szymon Prajs for useful discussions about supernova rates. C.I. and R.C.N. thank Mark Cropper for helpful information about the V IS instrument. C.I. thanks the organisers and participants of the Munich Institute for Astro- and Particle Physics (MIAPP) workshop “Superluminous supernovae in the next decade” for stimulating discussions and the provided online material. The Euclid Consortium acknowledges the European Space Agency and the support of a number of agencies and institutes that have supported the development of Euclid. A detailed complete list is available on the Euclid web site (http://www.euclid-ec.org). In particular the Agenzia Spaziale Italiana, the Centre National dEtudes Spatiales, the Deutsches Zentrum für Luft- and Raumfahrt, the Danish Space Research Institute, the Fundação para a Ciênca e a Tecnologia, the Ministerio de Economia y Competitividad, the National Aeronautics and Space Administration, The Netherlandse Onderzoekschool Voor Astronomie, the Norvegian Space Center, the Romanian Space Agency, the State Secretariat for Education, Research and Innovation (SERI) at the Swiss Space Office (SSO), the United Kingdom Space Agency, and the University of Helsinki. R.C.N. acknowledges partial support from the UK Space Agency. D.S. acknowledges the Faculty of Technology of the University of Portsmouth for support during his PhD studies. C.I. and S.J.S. acknowledge funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC Grant agreement No. [291222]. C.I. and M.S. acknowledge support from EU/FP7-ERC grant No. [615929]. E.C. acknowledge financial contribution from the agreement ASI/INAF/I/023/12/0. The work by KJ and others at MPIA on NISP was supported by the Deutsches Zentrum für Luft- und Raumfahrt e.V. (DLR) under grant 50QE1202. M.B. and S.C. acknowledge financial contribution from the agreement ASI/INAF I/023/12/1. R.T. acknowledges funding from the Spanish Ministerio de Economía y Competitividad under the grant ESP2015-69020-C2- 2-R. I.T. acknowledges support from Fundação para a Ciência e a Tecnologia (FCT) through the research grant UID/FIS/04434/2013 and IF/01518/2014. J.R. was supported by JPL, which is run under a contract for NASA by Caltech and by NASA ROSES grant 12-EUCLID12-0004

    Graphical Encoding of a Spatial Logic for the pi-Calculus

    Get PDF
    This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the denotation is fully abstract with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of π-calculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula
    corecore