[{"volume":52,"acknowledgement":"We are grateful for the hospitality at the Mittag-Leffler Institute, where part of this work has been done. The work of the authors was supported by the European Research Council (ERC)under the European Union's Horizon 2020 research and innovation programme grant 694227.","ddc":["510"],"arxiv":1,"doi":"10.1137/19m126284x","day":"12","abstract":[{"text":"We consider the Pekar functional on a ball in ℝ3. We prove uniqueness of minimizers, and a quadratic lower bound in terms of the distance to the minimizer. The latter follows from nondegeneracy of the Hessian at the minimum.","lang":"eng"}],"date_updated":"2023-09-07T13:30:11Z","year":"2020","citation":{"ama":"Feliciangeli D, Seiringer R. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. <i>SIAM Journal on Mathematical Analysis</i>. 2020;52(1):605-622. doi:<a href=\"https://doi.org/10.1137/19m126284x\">10.1137/19m126284x</a>","apa":"Feliciangeli, D., &#38; Seiringer, R. (2020). Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial &#38; Applied Mathematics . <a href=\"https://doi.org/10.1137/19m126284x\">https://doi.org/10.1137/19m126284x</a>","chicago":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial &#38; Applied Mathematics , 2020. <a href=\"https://doi.org/10.1137/19m126284x\">https://doi.org/10.1137/19m126284x</a>.","ieee":"D. Feliciangeli and R. Seiringer, “Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 52, no. 1. Society for Industrial &#38; Applied Mathematics , pp. 605–622, 2020.","mla":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 52, no. 1, Society for Industrial &#38; Applied Mathematics , 2020, pp. 605–22, doi:<a href=\"https://doi.org/10.1137/19m126284x\">10.1137/19m126284x</a>.","short":"D. Feliciangeli, R. Seiringer, SIAM Journal on Mathematical Analysis 52 (2020) 605–622.","ista":"Feliciangeli D, Seiringer R. 2020. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 52(1), 605–622."},"isi":1,"external_id":{"arxiv":["1904.08647 "],"isi":["000546967700022"]},"publisher":"Society for Industrial & Applied Mathematics ","article_type":"original","page":"605-622","quality_controlled":"1","ec_funded":1,"publication_status":"published","date_created":"2021-08-06T07:34:16Z","article_processing_charge":"No","department":[{"_id":"RoSe"}],"title":"Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball","intvolume":"        52","_id":"9781","scopus_import":"1","author":[{"id":"41A639AA-F248-11E8-B48F-1D18A9856A87","last_name":"Feliciangeli","first_name":"Dario","full_name":"Feliciangeli, Dario","orcid":"0000-0003-0754-8530"},{"last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"issue":"1","main_file_link":[{"url":"https://arxiv.org/abs/1904.08647","open_access":"1"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","related_material":{"record":[{"id":"9733","relation":"dissertation_contains","status":"public"}]},"publication_identifier":{"eissn":["1095-7154"],"issn":["0036-1410"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"date_published":"2020-02-12T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"oa_version":"Preprint","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"month":"02","publication":"SIAM Journal on Mathematical Analysis","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics","Analysis"],"oa_version":"Preprint","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"month":"06","publication":"Discrete and Continuous Dynamical Systems","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.04156"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["1553-5231"]},"oa":1,"date_published":"2019-06-01T00:00:00Z","type":"journal_article","publisher":"American Institute of Mathematical Sciences","article_type":"original","page":"3037-3067","quality_controlled":"1","publication_status":"published","article_processing_charge":"No","date_created":"2022-03-18T12:33:34Z","department":[{"_id":"JaMa"}],"title":"A mean-field model with discontinuous coefficients for neurons with spatial interaction","intvolume":"        39","_id":"10878","scopus_import":"1","author":[{"full_name":"Flandoli, Franco","last_name":"Flandoli","first_name":"Franco"},{"full_name":"Priola, Enrico","last_name":"Priola","first_name":"Enrico"},{"full_name":"Zanco, Giovanni A","last_name":"Zanco","first_name":"Giovanni A","id":"47491882-F248-11E8-B48F-1D18A9856A87"}],"issue":"6","acknowledgement":"The second author has been partially supported by INdAM through the GNAMPA Research\r\nProject (2017) “Sistemi stocastici singolari: buona posizione e problemi di controllo”. The third\r\nauthor was partly funded by the Austrian Science Fund (FWF) project F 65.","volume":39,"doi":"10.3934/dcds.2019126","arxiv":1,"day":"01","abstract":[{"lang":"eng","text":"Starting from a microscopic model for a system of neurons evolving in time which individually follow a stochastic integrate-and-fire type model, we study a mean-field limit of the system. Our model is described by a system of SDEs with discontinuous coefficients for the action potential of each neuron and takes into account the (random) spatial configuration of neurons allowing the interaction to depend on it. In the limit as the number of particles tends to infinity, we obtain a nonlinear Fokker-Planck type PDE in two variables, with derivatives only with respect to one variable and discontinuous coefficients. We also study strong well-posedness of the system of SDEs and prove the existence and uniqueness of a weak measure-valued solution to the PDE, obtained as the limit of the laws of the empirical measures for the system of particles."}],"date_updated":"2023-09-08T11:34:45Z","citation":{"ama":"Flandoli F, Priola E, Zanco GA. A mean-field model with discontinuous coefficients for neurons with spatial interaction. <i>Discrete and Continuous Dynamical Systems</i>. 2019;39(6):3037-3067. doi:<a href=\"https://doi.org/10.3934/dcds.2019126\">10.3934/dcds.2019126</a>","apa":"Flandoli, F., Priola, E., &#38; Zanco, G. A. (2019). A mean-field model with discontinuous coefficients for neurons with spatial interaction. <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences. <a href=\"https://doi.org/10.3934/dcds.2019126\">https://doi.org/10.3934/dcds.2019126</a>","ieee":"F. Flandoli, E. Priola, and G. A. Zanco, “A mean-field model with discontinuous coefficients for neurons with spatial interaction,” <i>Discrete and Continuous Dynamical Systems</i>, vol. 39, no. 6. American Institute of Mathematical Sciences, pp. 3037–3067, 2019.","chicago":"Flandoli, Franco, Enrico Priola, and Giovanni A Zanco. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” <i>Discrete and Continuous Dynamical Systems</i>. American Institute of Mathematical Sciences, 2019. <a href=\"https://doi.org/10.3934/dcds.2019126\">https://doi.org/10.3934/dcds.2019126</a>.","mla":"Flandoli, Franco, et al. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” <i>Discrete and Continuous Dynamical Systems</i>, vol. 39, no. 6, American Institute of Mathematical Sciences, 2019, pp. 3037–67, doi:<a href=\"https://doi.org/10.3934/dcds.2019126\">10.3934/dcds.2019126</a>.","short":"F. Flandoli, E. Priola, G.A. Zanco, Discrete and Continuous Dynamical Systems 39 (2019) 3037–3067.","ista":"Flandoli F, Priola E, Zanco GA. 2019. A mean-field model with discontinuous coefficients for neurons with spatial interaction. Discrete and Continuous Dynamical Systems. 39(6), 3037–3067."},"year":"2019","isi":1,"external_id":{"isi":["000459954800003"],"arxiv":["1708.04156"]}},{"publication":"Monthly Notices of the Royal Astronomical Society","oa_version":"Preprint","month":"06","language":[{"iso":"eng"}],"keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology","methods: data analysis","techniques: image processing","stars: oscillations","stars: statistics"],"date_published":"2019-06-01T00:00:00Z","type":"journal_article","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.00115"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"11615","scopus_import":"1","author":[{"first_name":"Marc","last_name":"Hon","full_name":"Hon, Marc"},{"full_name":"Stello, Dennis","last_name":"Stello","first_name":"Dennis"},{"last_name":"García","first_name":"Rafael A","full_name":"García, Rafael A"},{"first_name":"Savita","last_name":"Mathur","full_name":"Mathur, Savita"},{"full_name":"Sharma, Sanjib","last_name":"Sharma","first_name":"Sanjib"},{"first_name":"Isabel L","last_name":"Colman","full_name":"Colman, Isabel L"},{"full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"}],"issue":"4","publication_status":"published","article_processing_charge":"No","date_created":"2022-07-18T14:26:03Z","title":"A search for red giant solar-like oscillations in all Kepler data","intvolume":"       485","page":"5616-5630","quality_controlled":"1","publisher":"Oxford University Press","article_type":"original","date_updated":"2022-08-22T07:35:19Z","citation":{"ista":"Hon M, Stello D, García RA, Mathur S, Sharma S, Colman IL, Bugnet LA. 2019. A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. 485(4), 5616–5630.","short":"M. Hon, D. Stello, R.A. García, S. Mathur, S. Sharma, I.L. Colman, L.A. Bugnet, Monthly Notices of the Royal Astronomical Society 485 (2019) 5616–5630.","mla":"Hon, Marc, et al. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 485, no. 4, Oxford University Press, 2019, pp. 5616–30, doi:<a href=\"https://doi.org/10.1093/mnras/stz622\">10.1093/mnras/stz622</a>.","ieee":"M. Hon <i>et al.</i>, “A search for red giant solar-like oscillations in all Kepler data,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 485, no. 4. Oxford University Press, pp. 5616–5630, 2019.","chicago":"Hon, Marc, Dennis Stello, Rafael A García, Savita Mathur, Sanjib Sharma, Isabel L Colman, and Lisa Annabelle Bugnet. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2019. <a href=\"https://doi.org/10.1093/mnras/stz622\">https://doi.org/10.1093/mnras/stz622</a>.","ama":"Hon M, Stello D, García RA, et al. A search for red giant solar-like oscillations in all Kepler data. <i>Monthly Notices of the Royal Astronomical Society</i>. 2019;485(4):5616-5630. doi:<a href=\"https://doi.org/10.1093/mnras/stz622\">10.1093/mnras/stz622</a>","apa":"Hon, M., Stello, D., García, R. A., Mathur, S., Sharma, S., Colman, I. L., &#38; Bugnet, L. A. (2019). A search for red giant solar-like oscillations in all Kepler data. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stz622\">https://doi.org/10.1093/mnras/stz622</a>"},"year":"2019","external_id":{"arxiv":["1903.00115"]},"arxiv":1,"doi":"10.1093/mnras/stz622","day":"01","abstract":[{"text":"The recently published Kepler mission Data Release 25 (DR25) reported on ∼197 000 targets observed during the mission. Despite this, no wide search for red giants showing solar-like oscillations have been made across all stars observed in Kepler’s long-cadence mode. In this work, we perform this task using custom apertures on the Kepler pixel files and detect oscillations in 21 914 stars, representing the largest sample of solar-like oscillating stars to date. We measure their frequency at maximum power, νmax, down to νmax≃4μHz and obtain log (g) estimates with a typical uncertainty below 0.05 dex, which is superior to typical measurements from spectroscopy. Additionally, the νmax distribution of our detections show good agreement with results from a simulated model of the Milky Way, with a ratio of observed to predicted stars of 0.992 for stars with 10<νmax<270μHz. Among our red giant detections, we find 909 to be dwarf/subgiant stars whose flux signal is polluted by a neighbouring giant as a result of using larger photometric apertures than those used by the NASA Kepler science processing pipeline. We further find that only 293 of the polluting giants are known Kepler targets. The remainder comprises over 600 newly identified oscillating red giants, with many expected to belong to the Galactic halo, serendipitously falling within the Kepler pixel files of targeted stars.","lang":"eng"}],"volume":485,"acknowledgement":"Funding for this Discovery mission is provided by NASA’s Science mission Directorate. We thank the entire Kepler team without whom this investigation would not be possible. DS is the recipient of an Australian Research Council Future Fellowship (project number FT1400147). RAG acknowledges the support from CNES. SM acknowledges support from NASA grant NNX15AF13G, NSF grant AST-1411685, and the Ramon y Cajal fellowship number RYC-2015-17697. ILC acknowledges scholarship support from the University of Sydney. We would like to thank Nicholas Barbara and Timothy Bedding for providing us with a list of variable stars that helped to validate a number of detections in this study. We also thank the group at the University of Sydney for fruitful discussions. Finally, we gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan Xp GPU used for this research.","extern":"1"},{"type":"journal_article","date_published":"2019-09-19T00:00:00Z","oa":1,"publication_identifier":{"issn":["0067-0049"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.05222"}],"publication":"The Astrophysical Journal Supplement Series","article_number":"21","month":"09","oa_version":"Preprint","keyword":["Space and Planetary Science","Astronomy and Astrophysics","methods: data analysis","stars: activity","stars: low-mass","stars: rotation","starspots","techniques: photometric"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1908.05222"]},"year":"2019","citation":{"ieee":"A. R. G. Santos <i>et al.</i>, “Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars,” <i>The Astrophysical Journal Supplement Series</i>, vol. 244, no. 1. IOP Publishing, 2019.","chicago":"Santos, A. R. G., R. A. García, S. Mathur, Lisa Annabelle Bugnet, J. L. van Saders, T. S. Metcalfe, G. V. A. Simonian, and M. H. Pinsonneault. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” <i>The Astrophysical Journal Supplement Series</i>. IOP Publishing, 2019. <a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">https://doi.org/10.3847/1538-4365/ab3b56</a>.","ama":"Santos ARG, García RA, Mathur S, et al. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. <i>The Astrophysical Journal Supplement Series</i>. 2019;244(1). doi:<a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">10.3847/1538-4365/ab3b56</a>","apa":"Santos, A. R. G., García, R. A., Mathur, S., Bugnet, L. A., van Saders, J. L., Metcalfe, T. S., … Pinsonneault, M. H. (2019). Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. <i>The Astrophysical Journal Supplement Series</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">https://doi.org/10.3847/1538-4365/ab3b56</a>","ista":"Santos ARG, García RA, Mathur S, Bugnet LA, van Saders JL, Metcalfe TS, Simonian GVA, Pinsonneault MH. 2019. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 244(1), 21.","short":"A.R.G. Santos, R.A. García, S. Mathur, L.A. Bugnet, J.L. van Saders, T.S. Metcalfe, G.V.A. Simonian, M.H. Pinsonneault, The Astrophysical Journal Supplement Series 244 (2019).","mla":"Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” <i>The Astrophysical Journal Supplement Series</i>, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:<a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">10.3847/1538-4365/ab3b56</a>."},"date_updated":"2022-08-22T08:10:38Z","abstract":[{"text":"Brightness variations due to dark spots on the stellar surface encode information about stellar surface rotation and magnetic activity. In this work, we analyze the Kepler long-cadence data of 26,521 main-sequence stars of spectral types M and K in order to measure their surface rotation and photometric activity level. Rotation-period estimates are obtained by the combination of a wavelet analysis and autocorrelation function of the light curves. Reliable rotation estimates are determined by comparing the results from the different rotation diagnostics and four data sets. We also measure the photometric activity proxy Sph using the amplitude of the flux variations on an appropriate timescale. We report rotation periods and photometric activity proxies for about 60% of the sample, including 4431 targets for which McQuillan et al. did not report a rotation period. For the common targets with rotation estimates in this study and in McQuillan et al., our rotation periods agree within 99%. In this work, we also identify potential polluters, such as misclassified red giants and classical pulsator candidates. Within the parameter range we study, there is a mild tendency for hotter stars to have shorter rotation periods. The photometric activity proxy spans a wider range of values with increasing effective temperature. The rotation period and photometric activity proxy are also related, with Sph being larger for fast rotators. Similar to McQuillan et al., we find a bimodal distribution of rotation periods.","lang":"eng"}],"day":"19","doi":"10.3847/1538-4365/ab3b56","arxiv":1,"extern":"1","volume":244,"acknowledgement":"The authors thank Róbert Szabó Paul G. Beck, Katrien Kolenberg, and Isabel L. Colman for helping on the classification of stars. This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the National Aeronautics and Space Administration (NASA) Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. A.R.G.S. acknowledges the support from NASA under grant NNX17AF27G. R.A.G. and L.B. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges the support from the Ramon y Cajal fellowship number RYC-2015-17697. T.S.M. acknowledges support from a Visiting Fellowship at the Max Planck Institute for Solar System Research. This research has made use of the NASA Exoplanet Archive, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program.\r\n\r\nSoftware: KADACS (García et al. 2011), NumPy (van der Walt et al. 2011), SciPy (Jones et al. 2001), Matplotlib (Hunter 2007).\r\n\r\nFacilities: MAST - , Kepler Eclipsing Binary Catalog - , Exoplanet Archive. -","issue":"1","author":[{"full_name":"Santos, A. R. G.","first_name":"A. R. G.","last_name":"Santos"},{"first_name":"R. A.","last_name":"García","full_name":"García, R. A."},{"full_name":"Mathur, S.","first_name":"S.","last_name":"Mathur"},{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"last_name":"van Saders","first_name":"J. L.","full_name":"van Saders, J. L."},{"last_name":"Metcalfe","first_name":"T. S.","full_name":"Metcalfe, T. S."},{"first_name":"G. V. A.","last_name":"Simonian","full_name":"Simonian, G. V. A."},{"last_name":"Pinsonneault","first_name":"M. H.","full_name":"Pinsonneault, M. H."}],"scopus_import":"1","_id":"11623","intvolume":"       244","title":"Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars","date_created":"2022-07-19T09:21:58Z","article_processing_charge":"No","publication_status":"published","quality_controlled":"1","article_type":"original","publisher":"IOP Publishing"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.09611"}],"oa":1,"abstract":[{"lang":"eng","text":"The second mission of NASA’s Kepler satellite, K2, has collected hundreds of thousands of lightcurves for stars close to the ecliptic plane. This new sample could increase the number of known pulsating stars and then improve our understanding of those stars. For the moment only a few stars have been properly classified and published. In this work, we present a method to automaticly classify K2 pulsating stars using a Machine Learning technique called Random Forest. The objective is to sort out the stars in four classes: red giant (RG), main-sequence Solar-like stars (SL), classical pulsators (PULS) and Other. To do this we use the effective temperatures and the luminosities of the stars as well as the FliPer features, that measures the amount of power contained in the power spectral density. The classifier now retrieves the right classification for more than 80% of the stars."}],"day":"23","doi":"10.48550/arXiv.1906.09611","arxiv":1,"external_id":{"arxiv":["1906.09611"]},"type":"preprint","date_published":"2019-06-23T00:00:00Z","citation":{"apa":"Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., &#38; Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>","ama":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>","ieee":"A. L. Saux, L. A. Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia, “Automatic classification of K2 pulsating stars using machine learning techniques,” <i>arXiv</i>. .","chicago":"Saux, A. Le, Lisa Annabelle Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>.","mla":"Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” <i>ArXiv</i>, 1906.09611, doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>.","short":"A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.).","ista":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611."},"year":"2019","date_updated":"2022-08-22T08:20:29Z","keyword":["asteroseismology - methods","data analysis - thecniques","machine learning - stars","oscillations"],"language":[{"iso":"eng"}],"article_number":"1906.09611","title":"Automatic classification of K2 pulsating stars using machine learning techniques","month":"06","date_created":"2022-07-21T06:57:10Z","article_processing_charge":"No","publication_status":"submitted","oa_version":"Preprint","author":[{"last_name":"Saux","first_name":"A. Le","full_name":"Saux, A. Le"},{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"full_name":"Mathur, S.","first_name":"S.","last_name":"Mathur"},{"last_name":"Breton","first_name":"S. N.","full_name":"Breton, S. N."},{"full_name":"Garcia, R. A.","first_name":"R. A.","last_name":"Garcia"}],"_id":"11630","publication":"arXiv"},{"date_published":"2019-03-12T00:00:00Z","type":"journal_article","oa":1,"publication_identifier":{"issn":["0003-9527","1432-0673"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"url":"https://doi.org/10.1007/s00205-019-01368-7","open_access":"1"}],"publication":"Archive for Rational Mechanics and Analysis","month":"03","oa_version":"Published Version","language":[{"iso":"eng"}],"keyword":["Mechanical Engineering","Mathematics (miscellaneous)","Analysis"],"date_updated":"2021-01-12T08:19:09Z","year":"2019","citation":{"chicago":"Guardia, Marcel, Vadim Kaloshin, and Jianlu Zhang. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00205-019-01368-7\">https://doi.org/10.1007/s00205-019-01368-7</a>.","ieee":"M. Guardia, V. Kaloshin, and J. Zhang, “Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 233, no. 2. Springer Nature, pp. 799–836, 2019.","apa":"Guardia, M., Kaloshin, V., &#38; Zhang, J. (2019). Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-019-01368-7\">https://doi.org/10.1007/s00205-019-01368-7</a>","ama":"Guardia M, Kaloshin V, Zhang J. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. <i>Archive for Rational Mechanics and Analysis</i>. 2019;233(2):799-836. doi:<a href=\"https://doi.org/10.1007/s00205-019-01368-7\">10.1007/s00205-019-01368-7</a>","ista":"Guardia M, Kaloshin V, Zhang J. 2019. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. Archive for Rational Mechanics and Analysis. 233(2), 799–836.","mla":"Guardia, Marcel, et al. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 233, no. 2, Springer Nature, 2019, pp. 799–836, doi:<a href=\"https://doi.org/10.1007/s00205-019-01368-7\">10.1007/s00205-019-01368-7</a>.","short":"M. Guardia, V. Kaloshin, J. Zhang, Archive for Rational Mechanics and Analysis 233 (2019) 799–836."},"abstract":[{"lang":"eng","text":"For the Restricted Circular Planar 3 Body Problem, we show that there exists an open set U in phase space of fixed measure, where the set of initial points which lead to collision is O(μ120) dense as μ→0."}],"doi":"10.1007/s00205-019-01368-7","day":"12","extern":"1","volume":233,"author":[{"full_name":"Guardia, Marcel","last_name":"Guardia","first_name":"Marcel"},{"id":"FE553552-CDE8-11E9-B324-C0EBE5697425","first_name":"Vadim","last_name":"Kaloshin","orcid":"0000-0002-6051-2628","full_name":"Kaloshin, Vadim"},{"first_name":"Jianlu","last_name":"Zhang","full_name":"Zhang, Jianlu"}],"issue":"2","_id":"8418","title":"Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem","intvolume":"       233","publication_status":"published","date_created":"2020-09-17T10:41:51Z","article_processing_charge":"No","page":"799-836","quality_controlled":"1","article_type":"original","publisher":"Springer Nature"},{"citation":{"mla":"Bogomolov, Sergiy, et al. “JuliaReach: A Toolbox for Set-Based Reachability.” <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>, vol. 22, ACM, 2019, pp. 39–44, doi:<a href=\"https://doi.org/10.1145/3302504.3311804\">10.1145/3302504.3311804</a>.","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, ACM, 2019, pp. 39–44.","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2019. JuliaReach: A toolbox for set-based reachability. Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems Computation and Control vol. 22, 39–44.","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. JuliaReach: A toolbox for set-based reachability. In: <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>. Vol 22. ACM; 2019:39-44. doi:<a href=\"https://doi.org/10.1145/3302504.3311804\">10.1145/3302504.3311804</a>","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &#38; Schilling, C. (2019). JuliaReach: A toolbox for set-based reachability. In <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i> (Vol. 22, pp. 39–44). Montreal, QC, Canada: ACM. <a href=\"https://doi.org/10.1145/3302504.3311804\">https://doi.org/10.1145/3302504.3311804</a>","chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “JuliaReach: A Toolbox for Set-Based Reachability.” In <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>, 22:39–44. ACM, 2019. <a href=\"https://doi.org/10.1145/3302504.3311804\">https://doi.org/10.1145/3302504.3311804</a>.","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “JuliaReach: A toolbox for set-based reachability,” in <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>, Montreal, QC, Canada, 2019, vol. 22, pp. 39–44."},"year":"2019","date_updated":"2023-08-24T14:47:21Z","external_id":{"isi":["000516713900005"],"arxiv":["1901.10736"]},"isi":1,"day":"16","doi":"10.1145/3302504.3311804","arxiv":1,"abstract":[{"lang":"eng","text":"We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of reachability algorithms for continuous and hybrid systems, and LazySets, a standalone library that implements state-of-the-art algorithms for calculus with convex sets. The library offers both concrete and lazy set representations, where the latter stands for the ability to delay set computations until they are needed. The choice of the programming language Julia and the accompanying documentation of our toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages. Combining lazy operations in high dimensions and explicit computations in low dimensions, JuliaReach can be applied to solve complex, large-scale problems."}],"volume":22,"ddc":["000"],"scopus_import":"1","_id":"6035","author":[{"first_name":"Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"last_name":"Potomkin","first_name":"Kostiantyn","full_name":"Potomkin, Kostiantyn"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065"}],"article_processing_charge":"No","date_created":"2019-02-18T14:43:28Z","department":[{"_id":"ToHe"}],"publication_status":"published","intvolume":"        22","title":"JuliaReach: A toolbox for set-based reachability","ec_funded":1,"quality_controlled":"1","page":"39-44","file_date_updated":"2020-07-14T12:47:17Z","publisher":"ACM","type":"conference","date_published":"2019-04-16T00:00:00Z","publication_identifier":{"isbn":["9781450362825"]},"oa":1,"file":[{"file_size":3784414,"checksum":"28ed56439aea5991c3122d4730fd828f","date_created":"2019-03-05T09:27:18Z","content_type":"application/pdf","file_name":"hscc19.pdf","date_updated":"2020-07-14T12:47:17Z","access_level":"open_access","relation":"main_file","creator":"cschilli","file_id":"6067"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","has_accepted_license":"1","publication":"Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"oa_version":"Submitted Version","month":"04","keyword":["reachability analysis","hybrid systems","lazy computation"],"language":[{"iso":"eng"}],"conference":{"end_date":"2019-04-18","location":"Montreal, QC, Canada","start_date":"2019-04-16","name":"HSCC: Hybrid Systems Computation and Control"}},{"publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","has_accepted_license":"1","oa_version":"Submitted Version","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"month":"06","language":[{"iso":"eng"}],"keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"conference":{"end_date":"2019-06-26","location":"Phoenix, AZ, United States","start_date":"2019-06-22","name":"PLDI: Conference on Programming Language Design and Implementation"},"date_published":"2019-06-08T00:00:00Z","type":"conference","oa":1,"file":[{"access_level":"open_access","relation":"main_file","file_id":"6176","creator":"akafshda","date_created":"2019-03-25T10:11:22Z","file_size":4051066,"checksum":"703a5e9b8c8587f2a44085ffd9a4db64","date_updated":"2020-07-14T12:47:20Z","file_name":"paper.pdf","content_type":"application/pdf"}],"related_material":{"record":[{"id":"5457","relation":"earlier_version","status":"public"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6175","scopus_import":"1","author":[{"full_name":"Wang, Peixin","first_name":"Peixin","last_name":"Wang"},{"full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qin, Xudong","first_name":"Xudong","last_name":"Qin"},{"last_name":"Shi","first_name":"Wenjun","full_name":"Shi, Wenjun"}],"publication_status":"published","department":[{"_id":"KrCh"}],"date_created":"2019-03-25T10:13:25Z","article_processing_charge":"No","title":"Cost analysis of nondeterministic probabilistic programs","page":"204-220","ec_funded":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:47:20Z","publisher":"Association for Computing Machinery","date_updated":"2025-06-02T08:53:45Z","year":"2019","citation":{"mla":"Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2019, pp. 204–20, doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>.","short":"P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220.","ista":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.","apa":"Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., &#38; Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>","ama":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2019:204-220. doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>","chicago":"Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 204–20. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>.","ieee":"P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Phoenix, AZ, United States, 2019, pp. 204–220."},"isi":1,"external_id":{"arxiv":["1902.04659"],"isi":["000523190300014"]},"doi":"10.1145/3314221.3314581","arxiv":1,"day":"08","abstract":[{"text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds.","lang":"eng"}],"ddc":["000"]},{"ddc":["004"],"abstract":[{"lang":"eng","text":"Single cells are constantly interacting with their environment and each other, more importantly, the accurate perception of environmental cues is crucial for growth, survival, and reproduction. This communication between cells and their environment can be formalized in mathematical terms and be quantified as the information flow between them, as prescribed by information theory. \r\nThe recent availability of real–time dynamical patterns of signaling molecules in single cells has allowed us to identify encoding about the identity of the environment in the time–series. However, efficient estimation of the information transmitted by these signals has been a data–analysis challenge due to the high dimensionality of the trajectories and the limited number of samples. In the first part of this thesis, we develop and evaluate decoding–based estimation methods to lower bound the mutual information and derive model–based precise information estimates for biological reaction networks governed by the chemical master equation. This is followed by applying the decoding-based methods to study the intracellular representation of extracellular changes in budding yeast, by observing the transient dynamics of nuclear translocation of 10 transcription factors in response to 3 stress conditions. Additionally, we apply these estimators to previously published data on ERK and Ca2+ signaling and yeast stress response. We argue that this single cell decoding-based measure of information provides an unbiased, quantitative and interpretable measure for the fidelity of biological signaling processes. \r\nFinally, in the last section, we deal with gene regulation which is primarily controlled by transcription factors (TFs) that bind to the DNA to activate gene expression. The possibility that non-cognate TFs activate transcription diminishes the accuracy of regulation with potentially disastrous effects for the cell. This ’crosstalk’ acts as a previously unexplored source of noise in biochemical networks and puts a strong constraint on their performance. To mitigate erroneous initiation we propose an out of equilibrium scheme that implements kinetic proofreading. We show that such architectures are favored  over their equilibrium counterparts for complex organisms despite introducing noise in gene expression. "}],"day":"23","doi":"10.15479/AT:ISTA:6473","degree_awarded":"PhD","year":"2019","citation":{"ista":"Cepeda Humerez SA. 2019. Estimating information flow in single cells. Institute of Science and Technology Austria.","mla":"Cepeda Humerez, Sarah A. <i>Estimating Information Flow in Single Cells</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6473\">10.15479/AT:ISTA:6473</a>.","short":"S.A. Cepeda Humerez, Estimating Information Flow in Single Cells, Institute of Science and Technology Austria, 2019.","chicago":"Cepeda Humerez, Sarah A. “Estimating Information Flow in Single Cells.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6473\">https://doi.org/10.15479/AT:ISTA:6473</a>.","ieee":"S. A. Cepeda Humerez, “Estimating information flow in single cells,” Institute of Science and Technology Austria, 2019.","apa":"Cepeda Humerez, S. A. (2019). <i>Estimating information flow in single cells</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6473\">https://doi.org/10.15479/AT:ISTA:6473</a>","ama":"Cepeda Humerez SA. Estimating information flow in single cells. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6473\">10.15479/AT:ISTA:6473</a>"},"date_updated":"2025-05-28T11:57:00Z","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:31Z","page":"135","alternative_title":["ISTA Thesis"],"title":"Estimating information flow in single cells","department":[{"_id":"GaTk"}],"date_created":"2019-05-21T00:11:23Z","article_processing_charge":"No","publication_status":"published","author":[{"id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","full_name":"Cepeda Humerez, Sarah A","first_name":"Sarah A","last_name":"Cepeda Humerez"}],"_id":"6473","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"6900","status":"public"},{"status":"public","relation":"dissertation_contains","id":"281"},{"status":"public","id":"2016","relation":"dissertation_contains"},{"id":"1576","relation":"dissertation_contains","status":"public"}]},"file":[{"date_created":"2019-05-23T11:18:16Z","file_size":23937464,"checksum":"75f9184c1346e10a5de5f9cc7338309a","date_updated":"2020-07-14T12:47:31Z","file_name":"Thesis_Cepeda.zip","content_type":"application/zip","access_level":"closed","relation":"source_file","file_id":"6480","creator":"scepeda"},{"file_size":16646985,"checksum":"afdc0633ddbd71d5b13550d7fb4f4454","date_created":"2019-05-23T11:18:13Z","content_type":"application/pdf","file_name":"CepedaThesis.pdf","date_updated":"2020-07-14T12:47:31Z","access_level":"open_access","relation":"main_file","creator":"scepeda","file_id":"6481"}],"oa":1,"supervisor":[{"orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","first_name":"Gašper","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","date_published":"2019-05-23T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"keyword":["Information estimation","Time-series","data analysis"],"language":[{"iso":"eng"}],"month":"05","oa_version":"Published Version","has_accepted_license":"1"},{"title":"FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants","intvolume":"       620","publication_status":"published","date_created":"2022-07-18T14:37:39Z","article_processing_charge":"No","author":[{"id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000"},{"last_name":"García","first_name":"R. A.","full_name":"García, R. A."},{"full_name":"Davies, G. R.","first_name":"G. R.","last_name":"Davies"},{"full_name":"Mathur, S.","last_name":"Mathur","first_name":"S."},{"full_name":"Corsaro, E.","last_name":"Corsaro","first_name":"E."},{"last_name":"Hall","first_name":"O. J.","full_name":"Hall, O. J."},{"full_name":"Rendle, B. M.","first_name":"B. M.","last_name":"Rendle"}],"_id":"11618","scopus_import":"1","article_type":"original","publisher":"EDP Sciences","quality_controlled":"1","abstract":[{"lang":"eng","text":"Asteroseismology provides global stellar parameters such as masses, radii, or surface gravities using mean global seismic parameters and effective temperature for thousands of low-mass stars (0.8 M⊙ < M < 3 M⊙). This methodology has been successfully applied to stars in which acoustic modes excited by turbulent convection are measured. Other methods such as the Flicker technique can also be used to determine stellar surface gravities, but only works for log g above 2.5 dex. In this work, we present a new metric called FliPer (Flicker in spectral power density, in opposition to the standard Flicker measurement which is computed in the time domain); it is able to extend the range for which reliable surface gravities can be obtained (0.1 < log g < 4.6 dex) without performing any seismic analysis for stars brighter than Kp < 14. FliPer takes into account the average variability of a star measured in the power density spectrum in a given range of frequencies. However, FliPer values calculated on several ranges of frequency are required to better characterize a star. Using a large set of asteroseismic targets it is possible to calibrate the behavior of surface gravity with FliPer through machine learning. This calibration made with a random forest regressor covers a wide range of surface gravities from main-sequence stars to subgiants and red giants, with very small uncertainties from 0.04 to 0.1 dex. FliPer values can be inserted in automatic global seismic pipelines to either give an estimation of the stellar surface gravity or to assess the quality of the seismic results by detecting any outliers in the obtained νmax values. FliPer also constrains the surface gravities of main-sequence dwarfs using only long-cadence data for which the Nyquist frequency is too low to measure the acoustic-mode properties."}],"doi":"10.1051/0004-6361/201833106","arxiv":1,"day":"01","external_id":{"arxiv":["1809.05105"]},"date_updated":"2022-08-22T07:41:07Z","year":"2018","citation":{"ama":"Bugnet LA, García RA, Davies GR, et al. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. <i>Astronomy &#38; Astrophysics</i>. 2018;620. doi:<a href=\"https://doi.org/10.1051/0004-6361/201833106\">10.1051/0004-6361/201833106</a>","apa":"Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Corsaro, E., Hall, O. J., &#38; Rendle, B. M. (2018). FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/201833106\">https://doi.org/10.1051/0004-6361/201833106</a>","ieee":"L. A. Bugnet <i>et al.</i>, “FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants,” <i>Astronomy &#38; Astrophysics</i>, vol. 620. EDP Sciences, 2018.","chicago":"Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, E. Corsaro, O. J. Hall, and B. M. Rendle. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2018. <a href=\"https://doi.org/10.1051/0004-6361/201833106\">https://doi.org/10.1051/0004-6361/201833106</a>.","short":"L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, E. Corsaro, O.J. Hall, B.M. Rendle, Astronomy &#38; Astrophysics 620 (2018).","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” <i>Astronomy &#38; Astrophysics</i>, vol. 620, A38, EDP Sciences, 2018, doi:<a href=\"https://doi.org/10.1051/0004-6361/201833106\">10.1051/0004-6361/201833106</a>.","ista":"Bugnet LA, García RA, Davies GR, Mathur S, Corsaro E, Hall OJ, Rendle BM. 2018. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy &#38; Astrophysics. 620, A38."},"extern":"1","volume":620,"acknowledgement":"We thank the anonymous referee for the very useful comments. We would also like to thank M. Benbakoura for his help in analyzing the light curves of several binary systems included in our set of stars. L.B. and R.A.G. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges support from the National Aeronautics and Space Administration under Grant NNX15AF13G, the National Science Foundation grant AST-1411685, and the Ramon y Cajal fellowship no. RYC-2015-17697. E.C. is funded by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement no. 664931. O.J.H and B.M.R. acknowledge the support of the UK Science and Technology Facilities Council (STFC). Funding for the Stellar Astrophysics Centre is provided by the Danish National Research Foundation (Grant DNRF106). This research has made use of NASA’s Astrophysics Data System. Data presented in this paper were obtained from the Mikulski Archive for Space Telescopes (MAST). STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555.","month":"12","article_number":"A38","oa_version":"Preprint","publication":"Astronomy & Astrophysics","language":[{"iso":"eng"}],"keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology / methods","data analysis / stars","oscillations"],"oa":1,"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"date_published":"2018-12-01T00:00:00Z","type":"journal_article","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.05105"}]},{"day":"29","doi":"10.48550/arXiv.1811.12140","arxiv":1,"oa":1,"abstract":[{"text":"The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission is going to collect lightcurves for a few hundred million of stars and we expect to increase the number of pulsating stars to analyze compared to the few thousand stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS targets have not yet been properly classified and characterized. In order to improve the analysis of the TESS data, it is crucial to determine the type of stellar pulsations in a timely manner. We propose an automatic method to classify stars attending to their pulsation properties, in particular, to identify solar-like pulsators among all TESS targets. It relies on the use of the global amount of power contained in the power spectrum (already known as the FliPer method) as a key parameter, along with\r\nthe effective temperature, to feed into a machine learning classifier. Our study, based on TESS simulated datasets, shows that we are able to classify pulsators with a 98% accuracy.","lang":"eng"}],"citation":{"chicago":"Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle. “FliPer: Classifying TESS Pulsating Stars.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1811.12140\">https://doi.org/10.48550/arXiv.1811.12140</a>.","ieee":"L. A. Bugnet, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle, “FliPer: Classifying TESS pulsating stars,” <i>arXiv</i>. .","apa":"Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Hall, O. J., &#38; Rendle, B. M. (n.d.). FliPer: Classifying TESS pulsating stars. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1811.12140\">https://doi.org/10.48550/arXiv.1811.12140</a>","ama":"Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1811.12140\">10.48550/arXiv.1811.12140</a>","ista":"Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv, 1811.12140.","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.” <i>ArXiv</i>, 1811.12140, doi:<a href=\"https://doi.org/10.48550/arXiv.1811.12140\">10.48550/arXiv.1811.12140</a>.","short":"L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle, ArXiv (n.d.)."},"year":"2018","date_updated":"2022-08-22T08:41:55Z","external_id":{"arxiv":["1811.12140"]},"type":"preprint","date_published":"2018-11-29T00:00:00Z","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1811.12140"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","extern":"1","article_processing_charge":"No","date_created":"2022-07-21T07:05:23Z","publication_status":"submitted","oa_version":"Preprint","article_number":"1811.12140","month":"11","title":"FliPer: Classifying TESS pulsating stars","publication":"arXiv","_id":"11631","author":[{"first_name":"Lisa Annabelle","last_name":"Bugnet","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"R. A.","last_name":"García","full_name":"García, R. A."},{"full_name":"Davies, G. R.","first_name":"G. R.","last_name":"Davies"},{"full_name":"Mathur, S.","last_name":"Mathur","first_name":"S."},{"first_name":"O. J.","last_name":"Hall","full_name":"Hall, O. J."},{"first_name":"B. M.","last_name":"Rendle","full_name":"Rendle, B. M."}],"keyword":["asteroseismology - methods","data analysis - stars","oscillations"],"language":[{"iso":"eng"}]},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1705.10601","open_access":"1"}],"date_published":"2018-03-18T00:00:00Z","type":"journal_article","oa":1,"publication_identifier":{"issn":["1016-443X","1420-8970"]},"language":[{"iso":"eng"}],"keyword":["Geometry and Topology","Analysis"],"publication":"Geometric and Functional Analysis","month":"03","oa_version":"Preprint","extern":"1","volume":28,"external_id":{"arxiv":["1705.10601"]},"date_updated":"2021-01-12T08:19:11Z","year":"2018","citation":{"ama":"Huang G, Kaloshin V, Sorrentino A. Nearly circular domains which are integrable close to the boundary are ellipses. <i>Geometric and Functional Analysis</i>. 2018;28(2):334-392. doi:<a href=\"https://doi.org/10.1007/s00039-018-0440-4\">10.1007/s00039-018-0440-4</a>","apa":"Huang, G., Kaloshin, V., &#38; Sorrentino, A. (2018). Nearly circular domains which are integrable close to the boundary are ellipses. <i>Geometric and Functional Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00039-018-0440-4\">https://doi.org/10.1007/s00039-018-0440-4</a>","ieee":"G. Huang, V. Kaloshin, and A. Sorrentino, “Nearly circular domains which are integrable close to the boundary are ellipses,” <i>Geometric and Functional Analysis</i>, vol. 28, no. 2. Springer Nature, pp. 334–392, 2018.","chicago":"Huang, Guan, Vadim Kaloshin, and Alfonso Sorrentino. “Nearly Circular Domains Which Are Integrable Close to the Boundary Are Ellipses.” <i>Geometric and Functional Analysis</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/s00039-018-0440-4\">https://doi.org/10.1007/s00039-018-0440-4</a>.","mla":"Huang, Guan, et al. “Nearly Circular Domains Which Are Integrable Close to the Boundary Are Ellipses.” <i>Geometric and Functional Analysis</i>, vol. 28, no. 2, Springer Nature, 2018, pp. 334–92, doi:<a href=\"https://doi.org/10.1007/s00039-018-0440-4\">10.1007/s00039-018-0440-4</a>.","short":"G. Huang, V. Kaloshin, A. Sorrentino, Geometric and Functional Analysis 28 (2018) 334–392.","ista":"Huang G, Kaloshin V, Sorrentino A. 2018. Nearly circular domains which are integrable close to the boundary are ellipses. Geometric and Functional Analysis. 28(2), 334–392."},"abstract":[{"text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of an ellipse of small eccentricity which preserves integrability near the boundary, is itself an ellipse. This extends the result in Avila et al. (Ann Math 184:527–558, ADK16), where integrability was assumed on a larger set. In particular, it shows that (local) integrability near the boundary implies global integrability. One of the crucial ideas in the proof consists in analyzing Taylor expansion of the corresponding action-angle coordinates with respect to the eccentricity parameter, deriving and studying higher order conditions for the preservation of integrable rational caustics.","lang":"eng"}],"arxiv":1,"doi":"10.1007/s00039-018-0440-4","day":"18","page":"334-392","quality_controlled":"1","article_type":"original","publisher":"Springer Nature","author":[{"full_name":"Huang, Guan","first_name":"Guan","last_name":"Huang"},{"last_name":"Kaloshin","first_name":"Vadim","full_name":"Kaloshin, Vadim","orcid":"0000-0002-6051-2628","id":"FE553552-CDE8-11E9-B324-C0EBE5697425"},{"first_name":"Alfonso","last_name":"Sorrentino","full_name":"Sorrentino, Alfonso"}],"issue":"2","_id":"8422","title":"Nearly circular domains which are integrable close to the boundary are ellipses","intvolume":"        28","publication_status":"published","date_created":"2020-09-17T10:42:30Z","article_processing_charge":"No"},{"month":"01","title":"Data Check IOP Scopus vs. Publisher","date_created":"2018-12-12T12:31:37Z","department":[{"_id":"E-Lib"}],"article_processing_charge":"No","oa_version":"Submitted Version","datarep_id":"86","author":[{"id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","first_name":"Márton","last_name":"Villányi","orcid":"0000-0001-8126-0426","full_name":"Villányi, Márton"}],"has_accepted_license":"1","_id":"5574","publisher":"Institute of Science and Technology Austria","keyword":["Publication analysis","Bibliography","Open Access"],"file_date_updated":"2020-07-14T12:47:05Z","oa":1,"abstract":[{"lang":"ger","text":"Comparison of Scopus' and publisher's data on Austrian publication output at IOP. "}],"day":"16","doi":"10.15479/AT:ISTA:86","type":"research_data","date_published":"2018-01-16T00:00:00Z","year":"2018","citation":{"ista":"Villányi M. 2018. Data Check IOP Scopus vs. Publisher, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:86\">10.15479/AT:ISTA:86</a>.","mla":"Villányi, Márton. <i>Data Check IOP Scopus vs. Publisher</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:86\">10.15479/AT:ISTA:86</a>.","short":"M. Villányi, (2018).","chicago":"Villányi, Márton. “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:86\">https://doi.org/10.15479/AT:ISTA:86</a>.","ieee":"M. Villányi, “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018.","ama":"Villányi M. Data Check IOP Scopus vs. Publisher. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:86\">10.15479/AT:ISTA:86</a>","apa":"Villányi, M. (2018). Data Check IOP Scopus vs. Publisher. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:86\">https://doi.org/10.15479/AT:ISTA:86</a>"},"date_updated":"2024-02-21T13:42:21Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"status":"public","ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"part_of_dissertation","id":"278","status":"public"}]},"file":[{"date_created":"2018-12-12T13:05:14Z","file_size":12283857,"checksum":"c7a61147bd15cb4ae45878d270628c06","date_updated":"2020-07-14T12:47:05Z","content_type":"application/zip","file_name":"IST-2018-86-v1+1_Data_Check_IOP_Scopus_vs._Publisher.zip","relation":"main_file","access_level":"open_access","file_id":"5642","creator":"system"}]},{"has_accepted_license":"1","_id":"5575","datarep_id":"87","author":[{"first_name":"Márton","last_name":"Villányi","orcid":"0000-0001-8126-0426","full_name":"Villányi, Márton","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-12T12:31:37Z","department":[{"_id":"E-Lib"}],"article_processing_charge":"No","oa_version":"Submitted Version","title":"Data Check RSC Scopus vs. FWF","month":"01","keyword":["Publication analysis","Bibliography","Open Access"],"file_date_updated":"2020-07-14T12:47:05Z","publisher":"Institute of Science and Technology Austria","year":"2018","citation":{"apa":"Villányi, M. (2018). Data Check RSC Scopus vs. FWF. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:87\">https://doi.org/10.15479/AT:ISTA:87</a>","ama":"Villányi M. Data Check RSC Scopus vs. FWF. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:87\">10.15479/AT:ISTA:87</a>","ieee":"M. Villányi, “Data Check RSC Scopus vs. FWF.” Institute of Science and Technology Austria, 2018.","chicago":"Villányi, Márton. “Data Check RSC Scopus vs. FWF.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:87\">https://doi.org/10.15479/AT:ISTA:87</a>.","mla":"Villányi, Márton. <i>Data Check RSC Scopus vs. FWF</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:87\">10.15479/AT:ISTA:87</a>.","short":"M. Villányi, (2018).","ista":"Villányi M. 2018. Data Check RSC Scopus vs. FWF, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:87\">10.15479/AT:ISTA:87</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:43:25Z","type":"research_data","date_published":"2018-01-16T00:00:00Z","day":"16","doi":"10.15479/AT:ISTA:87","oa":1,"abstract":[{"text":"Comparison of Scopus' and FWF's data on Austrian publication output at RSC. ","lang":"ger"}],"file":[{"file_size":277078,"checksum":"563cc5266c0bac354007873c92be777b","date_created":"2018-12-12T13:02:44Z","file_name":"IST-2018-87-v1+1_Data_Check_RSC_Scopus_vs._FWF.zip","content_type":"application/zip","date_updated":"2020-07-14T12:47:05Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5610"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"278","relation":"part_of_dissertation"}]},"status":"public","ddc":["020"]},{"file":[{"file_id":"5598","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:05Z","file_name":"IST-2018-88-v1+1_Data_Check_T_F_Scopus_vs._FWF.zip","content_type":"application/zip","date_created":"2018-12-12T13:02:32Z","file_size":741195,"checksum":"a887246c2b41b98df90ccbc1d62b4487"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"status":"public","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"278"}]},"citation":{"short":"M. Villányi, (2018).","mla":"Villányi, Márton. <i>Data Check T&#38;F Scopus vs. FWF</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:88\">10.15479/AT:ISTA:88</a>.","ista":"Villányi M. 2018. Data Check T&#38;F Scopus vs. FWF, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:88\">10.15479/AT:ISTA:88</a>.","ama":"Villányi M. Data Check T&#38;F Scopus vs. FWF. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:88\">10.15479/AT:ISTA:88</a>","apa":"Villányi, M. (2018). Data Check T&#38;F Scopus vs. FWF. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:88\">https://doi.org/10.15479/AT:ISTA:88</a>","ieee":"M. Villányi, “Data Check T&#38;F Scopus vs. FWF.” Institute of Science and Technology Austria, 2018.","chicago":"Villányi, Márton. “Data Check T&#38;F Scopus vs. FWF.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:88\">https://doi.org/10.15479/AT:ISTA:88</a>."},"year":"2018","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:43:10Z","type":"research_data","date_published":"2018-01-16T00:00:00Z","day":"16","doi":"10.15479/AT:ISTA:88","oa":1,"abstract":[{"text":"Comparison of Scopus' and FWF's data on Austrian publication output at T&F.","lang":"ger"}],"keyword":["Publication analysis","Bibliography","Open Access"],"file_date_updated":"2020-07-14T12:47:05Z","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","_id":"5576","datarep_id":"88","author":[{"id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8126-0426","full_name":"Villányi, Márton","first_name":"Márton","last_name":"Villányi"}],"date_created":"2018-12-12T12:31:37Z","department":[{"_id":"E-Lib"}],"article_processing_charge":"No","oa_version":"Submitted Version","title":"Data Check T&F Scopus vs. FWF","month":"01"},{"keyword":["Publication analysis","Bibliography","Open Access"],"file_date_updated":"2020-07-14T12:47:06Z","publisher":"Institute of Science and Technology Austria","datarep_id":"89","author":[{"id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426","last_name":"Villányi","first_name":"Márton"}],"has_accepted_license":"1","_id":"5577","title":"Emerald Austrian Publications 2013-2017","month":"01","date_created":"2018-12-12T12:31:37Z","article_processing_charge":"No","department":[{"_id":"E-Lib"}],"oa_version":"Submitted Version","ddc":["020"],"related_material":{"record":[{"status":"public","id":"278","relation":"part_of_dissertation"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"file_size":222011,"checksum":"786b599abfae6c355dee87835f414549","date_created":"2018-12-12T13:02:39Z","file_name":"IST-2018-89-v1+1_Emerald_Austrian_Publications_2013-2017.zip","content_type":"application/zip","date_updated":"2020-07-14T12:47:06Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5604"}],"type":"research_data","date_published":"2018-01-16T00:00:00Z","citation":{"short":"M. Villányi, (2018).","mla":"Villányi, Márton. <i>Emerald Austrian Publications 2013-2017</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:89\">10.15479/AT:ISTA:89</a>.","ista":"Villányi M. 2018. Emerald Austrian Publications 2013-2017, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:89\">10.15479/AT:ISTA:89</a>.","ama":"Villányi M. Emerald Austrian Publications 2013-2017. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:89\">10.15479/AT:ISTA:89</a>","apa":"Villányi, M. (2018). Emerald Austrian Publications 2013-2017. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:89\">https://doi.org/10.15479/AT:ISTA:89</a>","chicago":"Villányi, Márton. “Emerald Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:89\">https://doi.org/10.15479/AT:ISTA:89</a>.","ieee":"M. Villányi, “Emerald Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018."},"year":"2018","date_updated":"2024-02-21T13:41:32Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"oa":1,"abstract":[{"text":"Data on Austrian open access publication output at Emerald from 2013-2017 including data analysis.","lang":"ger"}],"day":"16","doi":"10.15479/AT:ISTA:89"},{"date_published":"2018-01-16T00:00:00Z","type":"research_data","date_updated":"2024-02-21T13:42:36Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"year":"2018","citation":{"mla":"Villányi, Márton. <i>IOP Austrian Publications 2012-2015</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:90\">10.15479/AT:ISTA:90</a>.","short":"M. Villányi, (2018).","ista":"Villányi M. 2018. IOP Austrian Publications 2012-2015, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:90\">10.15479/AT:ISTA:90</a>.","apa":"Villányi, M. (2018). IOP Austrian Publications 2012-2015. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:90\">https://doi.org/10.15479/AT:ISTA:90</a>","ama":"Villányi M. IOP Austrian Publications 2012-2015. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:90\">10.15479/AT:ISTA:90</a>","ieee":"M. Villányi, “IOP Austrian Publications 2012-2015.” Institute of Science and Technology Austria, 2018.","chicago":"Villányi, Márton. “IOP Austrian Publications 2012-2015.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:90\">https://doi.org/10.15479/AT:ISTA:90</a>."},"abstract":[{"lang":"ger","text":"Data on Austrian open access publication output at IOP from 2012-2015 including data analysis."}],"oa":1,"doi":"10.15479/AT:ISTA:90","day":"16","status":"public","related_material":{"record":[{"status":"public","id":"278","relation":"part_of_dissertation"}]},"ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":237067,"checksum":"a4f1bf041ccd4c35912e2d595b0c2883","date_created":"2018-12-12T13:03:06Z","file_name":"IST-2018-90-v1+1_IOP_Austrian_Publications_2012-2015.zip","content_type":"application/zip","date_updated":"2020-07-14T12:47:06Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5624"}],"author":[{"full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426","last_name":"Villányi","first_name":"Márton","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87"}],"datarep_id":"90","_id":"5578","has_accepted_license":"1","month":"01","title":"IOP Austrian Publications 2012-2015","oa_version":"Submitted Version","article_processing_charge":"No","date_created":"2018-12-12T12:31:38Z","department":[{"_id":"E-Lib"}],"file_date_updated":"2020-07-14T12:47:06Z","keyword":["Publication analysis","Bibliography","Open Access"],"publisher":"Institute of Science and Technology Austria"},{"title":"RSC Austrian Publications 2013-2017","month":"01","oa_version":"Submitted Version","department":[{"_id":"E-Lib"}],"article_processing_charge":"No","date_created":"2018-12-12T12:31:38Z","author":[{"orcid":"0000-0001-8126-0426","full_name":"Villányi, Márton","first_name":"Márton","last_name":"Villányi","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87"}],"datarep_id":"91","_id":"5579","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:06Z","keyword":["Publication analysis","Bibliography","Open Access"],"abstract":[{"text":"Data on Austrian open access publication output at RSC from 2013-2017 including data analysis.","lang":"eng"}],"oa":1,"doi":"10.15479/AT:ISTA:91","day":"16","date_published":"2018-01-16T00:00:00Z","type":"research_data","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:42:53Z","citation":{"apa":"Villányi, M. (2018). RSC Austrian Publications 2013-2017. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:91\">https://doi.org/10.15479/AT:ISTA:91</a>","ama":"Villányi M. RSC Austrian Publications 2013-2017. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:91\">10.15479/AT:ISTA:91</a>","ieee":"M. Villányi, “RSC Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018.","chicago":"Villányi, Márton. “RSC Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:91\">https://doi.org/10.15479/AT:ISTA:91</a>.","mla":"Villányi, Márton. <i>RSC Austrian Publications 2013-2017</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:91\">10.15479/AT:ISTA:91</a>.","short":"M. Villányi, (2018).","ista":"Villányi M. 2018. RSC Austrian Publications 2013-2017, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:91\">10.15479/AT:ISTA:91</a>."},"year":"2018","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"278","relation":"part_of_dissertation"}]},"ddc":["020"],"file":[{"date_created":"2018-12-12T13:02:40Z","checksum":"2a73efc5f94f8deb00e2b08c3dff8547","file_size":791408,"date_updated":"2020-07-14T12:47:06Z","content_type":"application/zip","file_name":"IST-2018-91-v1+1_RSC_Austrian__Publications_2013-2017.zip","access_level":"open_access","relation":"main_file","file_id":"5605","creator":"system"}]},{"doi":"10.15479/AT:ISTA:92","day":"16","abstract":[{"text":"Data on Austrian open access publication output at SAGE from 2013-2017 including data analysis.","lang":"ger"}],"oa":1,"date_updated":"2024-02-21T13:44:07Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"year":"2018","citation":{"ieee":"M. Villányi, “SAGE Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018.","chicago":"Villányi, Márton. “SAGE Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:92\">https://doi.org/10.15479/AT:ISTA:92</a>.","ama":"Villányi M. SAGE Austrian Publications 2013-2017. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:92\">10.15479/AT:ISTA:92</a>","apa":"Villányi, M. (2018). SAGE Austrian Publications 2013-2017. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:92\">https://doi.org/10.15479/AT:ISTA:92</a>","ista":"Villányi M. 2018. SAGE Austrian Publications 2013-2017, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:92\">10.15479/AT:ISTA:92</a>.","mla":"Villányi, Márton. <i>SAGE Austrian Publications 2013-2017</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:92\">10.15479/AT:ISTA:92</a>.","short":"M. Villányi, (2018)."},"date_published":"2018-01-16T00:00:00Z","type":"research_data","file":[{"relation":"main_file","access_level":"open_access","file_id":"5619","creator":"system","date_created":"2018-12-12T13:03:01Z","checksum":"1ed83efc33aab2fc5dbe5ffe95de5c2b","file_size":724017,"date_updated":"2020-07-14T12:47:06Z","file_name":"IST-2018-92-v1+1_SAGE_Austrian_Publications_2013-2017.zip","content_type":"application/zip"}],"related_material":{"record":[{"status":"public","id":"278","relation":"part_of_dissertation"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"status":"public","oa_version":"Submitted Version","article_processing_charge":"No","department":[{"_id":"E-Lib"}],"date_created":"2018-12-12T12:31:38Z","month":"01","title":"SAGE Austrian Publications 2013-2017","_id":"5580","has_accepted_license":"1","author":[{"id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426","last_name":"Villányi","first_name":"Márton"}],"datarep_id":"92","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:06Z","keyword":["Publication analysis","Bibliography","Open Access"]},{"type":"research_data","date_published":"2018-01-16T00:00:00Z","citation":{"ama":"Villányi M. Springer Austrian Publications 2013-2016. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:93\">10.15479/AT:ISTA:93</a>","apa":"Villányi, M. (2018). Springer Austrian Publications 2013-2016. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:93\">https://doi.org/10.15479/AT:ISTA:93</a>","ieee":"M. Villányi, “Springer Austrian Publications 2013-2016.” Institute of Science and Technology Austria, 2018.","chicago":"Villányi, Márton. “Springer Austrian Publications 2013-2016.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:93\">https://doi.org/10.15479/AT:ISTA:93</a>.","short":"M. Villányi, (2018).","mla":"Villányi, Márton. <i>Springer Austrian Publications 2013-2016</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:93\">10.15479/AT:ISTA:93</a>.","ista":"Villányi M. 2018. Springer Austrian Publications 2013-2016, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:93\">10.15479/AT:ISTA:93</a>."},"year":"2018","date_updated":"2024-02-21T13:43:53Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"oa":1,"abstract":[{"text":"Data on Austrian open access publication output at Springer from 2013-2016 including data analysis.","lang":"ger"}],"day":"16","doi":"10.15479/AT:ISTA:93","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["020"],"related_material":{"record":[{"relation":"part_of_dissertation","id":"278","status":"public"}]},"file":[{"file_size":304018,"checksum":"7cc8274975162a99ea4681dc344b927d","date_created":"2018-12-12T13:05:20Z","content_type":"application/zip","file_name":"IST-2018-93-v1+1_Springer_Austrian_Publications_2013-2016.zip","date_updated":"2020-07-14T12:47:06Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5646"}],"datarep_id":"93","author":[{"id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8126-0426","full_name":"Villányi, Márton","first_name":"Márton","last_name":"Villányi"}],"has_accepted_license":"1","_id":"5581","title":"Springer Austrian Publications 2013-2016","month":"01","article_processing_charge":"No","department":[{"_id":"E-Lib"}],"date_created":"2018-12-12T12:31:39Z","oa_version":"Submitted Version","keyword":["Publication analysis","Bibliography","Open Access"],"file_date_updated":"2020-07-14T12:47:06Z","publisher":"Institute of Science and Technology Austria"}]