Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Results of the Photometric LSST Astronomical Time-series Classification Challenge (PLAsTiCC)

  • Hložek, Renee
  • Galbany, Lluís
Hložek et al., Next-generation surveys like the Legacy Survey of Space and Time (LSST) on the Vera C. Rubin Observatory (Rubin) will generate orders of magnitude more discoveries of transients and variable stars than previous surveys. To prepare for this data deluge, we developed the Photometric LSST Astronomical Time-series Classification Challenge (PLAsTiCC), a competition that aimed to catalyze the development of robust classifiers under LSST-like conditions of a nonrepresentative training set for a large photometric test set of imbalanced classes. Over 1000 teams participated in PLAsTiCC, which was hosted in the Kaggle data science competition platform between 2018 September 28 and 2018 December 17, ultimately identifying three winners in 2019 February. Participants produced classifiers employing a diverse set of machine-learning techniques including hybrid combinations and ensemble averages of a range of approaches, among them boosted decision trees, neural networks, and multilayer perceptrons. The strong performance of the top three classifiers on Type Ia supernovae and kilonovae represent a major improvement over the current state of the art within astronomy. This paper summarizes the most promising methods and evaluates their results in detail, highlighting future directions both for classifier development and simulation needs for a next-generation PLAsTiCC data set., The DESC acknowledges ongoing support from the Institut National de Physique Nucléaire et de Physique des Particules in France; the Science and Technology Facilities Council in the United Kingdom; and the Department of Energy, the National Science Foundation, and the LSST Corporation in the United States. DESC uses resources of the IN2P3 Computing Center (CC-IN2P3–Lyon/Villeurbanne–France) funded by the Centre National de la Recherche Scientifique; the National Energy Research Scientific Computing Center, a DOE Office of Science User Facility supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231; STFC DiRAC HPC Facilities, funded by UK BIS National E-infrastructure capital grants; and the UK particle physics grid, supported by the GridPP Collaboration. This work was performed in part under DOE Contract DE-AC02-76SF00515. R. H. acknowledges support from CIFAR, and the Azrieli and Alfred. P. Sloan Foundations. A.I.M. acknowledges support during this work from the Max Planck Society and the Alexander von Humboldt Foundation in the framework of the Max Planck-Humboldt Research Award endowed by the Federal Ministry of Education and Research. A.I.M. is a member of the LSST Interdisciplinary Network for Collaboration and Computing (LINCC) Frameworks team; LINCC Frameworks is supported by Schmidt Futures, a philanthropic initiative founded by Eric and Wendy Schmidt, as part of the Virtual Institute of Astrophysics (VIA). K.A.P. acknowledges support from the Berkeley Center for Cosmological Physics; the Director, Office of Science, Office of High Energy Physics of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231; and U.S. Department of Energy Office of Science under Contract No.DE-AC02-76SF00515. E.E.O.I. acknowledges support from CNRS 2017 MOMENTUM grant. L.G. acknowledges financial support from the Spanish Ministerio de Ciencia e Innovacíon (MCIN), the Agencia Estatal de Investigacíon (AEI) 10.13039/501100011033, and the European Social Fund (ESF) "Investing in your future" under the 2019 Ramón y Cajal program RYC2019-027683-I and the PID2020-115253GA-I00 HOSTFLOWS project, from Centro Superior de Investigaciones Científicas (CSIC) under the PIE project 20215AT016, and the program Unidad de Excelencia María de Maeztu CEX2020-001058-M. J.R.M.G acknowledges funding from the Chandra Science Research project code 40716015HH4600, under a contract with NASA. D.O.J. acknowledges the support provided by NASA Hubble Fellowship grant HST-HF2-51462.001 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555. D.O.J. also acknowledges support from the Gordon and Betty Moore Foundation. This work has been partially supported by the Spanish grant PGC2018-095317-B-C21 within the European Funds for Regional Development (FEDER). C.N.S., R.B., and H.V.P. were partially supported by the research environment grant "Gravitational Radiation and Electromagnetic Astrophysical Transients (GREAT)" funded by the Swedish Research Council (VR) under Dnr 2016-06012. R.B. and H.V.P. were additionally supported by the research project grant "Understanding the Dynamic Universe" funded by the Knut and Alice Wallenberg Foundation under Dnr KAW 2018.0067. M.D. acknowledges support from the Horizon Fellowship at Johns Hopkins University. At Rutgers University (M.D., S.W.J.), this research was supported by NSF award AST-1615455 and DOE award DE-SC0011636. A.G acknowledges ERC grant PCG- 336983, Basque Government grant IT974-16, and MINECO grant PID2019-107444GA-I00., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2020-001058-M)., Peer reviewed
idUS. Depósito de Investigación de la Universidad de Sevilla
Publicación Artículo científico (JournalArticle)

Cryptography with right-angled Artin groups

  • Flores Díaz, Ramón Jesús
  • Kahrobaei, Delaram
In this paper we propose right-angled Artin groups as a platform for secret sharingschemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we de ne two new problems: SubgroupIsomorphism Problem and Group Homomorphism Problem. Based on them, we also proposetwo new authentication schemes. For right-angled Artin groups, the Group Homomorphismand Graph Homomorphism problems are equivalent, and the later is known to be NP-complete.In the case of the Subgroup Isomorphism problem, we bring some results due to Bridson whoshows there are right-angled Artin groups in which this problem is unsolvable., Professional Staff Congress-City University of New York, City Tech Foundation, Office of Naval Research, European Research Council, National Science Foundation, Ministerio de Ciencia e Innovación