@article{11623, abstract = {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.}, author = {Santos, A. R. G. and García, R. A. and Mathur, S. and Bugnet, Lisa Annabelle and van Saders, J. L. and Metcalfe, T. S. and Simonian, G. V. A. and Pinsonneault, M. H.}, issn = {0067-0049}, journal = {The Astrophysical Journal Supplement Series}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, methods: data analysis, stars: activity, stars: low-mass, stars: rotation, starspots, techniques: photometric}, number = {1}, publisher = {IOP Publishing}, title = {{Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars}}, doi = {10.3847/1538-4365/ab3b56}, volume = {244}, year = {2019}, } @unpublished{11627, abstract = {For a solar-like star, the surface rotation evolves with time, allowing in principle to estimate the age of a star from its surface rotation period. Here we are interested in measuring surface rotation periods of solar-like stars observed by the NASA mission Kepler. Different methods have been developed to track rotation signals in Kepler photometric light curves: time-frequency analysis based on wavelet techniques, autocorrelation and composite spectrum. We use the learning abilities of random forest classifiers to take decisions during two crucial steps of the analysis. First, given some input parameters, we discriminate the considered Kepler targets between rotating MS stars, non-rotating MS stars, red giants, binaries and pulsators. We then use a second classifier only on the MS rotating targets to decide the best data analysis treatment.}, author = {Breton, S. N. and Bugnet, Lisa Annabelle and Santos, A. R. G. and Saux, A. Le and Mathur, S. and Palle, P. L. and Garcia, R. A.}, booktitle = {arXiv}, keywords = {asteroseismology, rotation, solar-like stars, kepler, machine learning, random forest}, title = {{Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques}}, doi = {10.48550/arXiv.1906.09609}, year = {2019}, } @unpublished{11630, abstract = {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.}, author = {Saux, A. Le and Bugnet, Lisa Annabelle and Mathur, S. and Breton, S. N. and Garcia, R. A.}, booktitle = {arXiv}, keywords = {asteroseismology - methods, data analysis - thecniques, machine learning - stars, oscillations}, title = {{Automatic classification of K2 pulsating stars using machine learning techniques}}, doi = {10.48550/arXiv.1906.09611}, year = {2019}, } @inproceedings{11826, abstract = {The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive. This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported. This paper provides a comprehensive study of the dynamic approximation of Diameter, Radius and Eccentricities, providing both conditional lower bounds, and new algorithms whose bounds are optimal under popular hypotheses in fine-grained complexity. Some of the highlights include: - Under popular hardness hypotheses, there can be no significantly better fully dynamic approximation algorithms than recomputing the answer after each update, or maintaining full APSP. - Nearly optimal partially dynamic (incremental/decremental) algorithms can be achieved via efficient reductions to (incremental/decremental) maintenance of Single-Source Shortest Paths. For instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2. This nearly matches the static 3/2-approximation algorithm for the problem that is known to be conditionally optimal.}, author = {Ancona, Bertie and Henzinger, Monika H and Roditty, Liam and Williams, Virginia Vassilevska and Wein, Nicole}, booktitle = {46th International Colloquium on Automata, Languages, and Programming}, isbn = {978-3-95977-109-2}, issn = {1868-8969}, location = {Patras, Greece}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Algorithms and hardness for diameter in dynamic graphs}}, doi = {10.4230/LIPICS.ICALP.2019.13}, volume = {132}, year = {2019}, } @inproceedings{11850, abstract = {Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.}, author = {Henzinger, Monika H and Neumann, Stefan and Schmid, Stefan}, booktitle = {SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems}, isbn = {978-1-4503-6678-6}, location = {Phoenix, AZ, United States}, pages = {43–44}, publisher = {Association for Computing Machinery}, title = {{Efficient distributed workload (re-)embedding}}, doi = {10.1145/3309697.3331503}, year = {2019}, }