--- _id: '11630' 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.' article_number: '1906.09611' article_processing_charge: No author: - first_name: A. Le full_name: Saux, A. Le last_name: Saux - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: S. N. full_name: Breton, S. N. last_name: Breton - first_name: R. A. full_name: Garcia, R. A. last_name: Garcia citation: ama: Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09611 apa: Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., & Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09611 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.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09611. 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,” arXiv. . ista: Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611. mla: Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” ArXiv, 1906.09611, doi:10.48550/arXiv.1906.09611. short: A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.). date_created: 2022-07-21T06:57:10Z date_published: 2019-06-23T00:00:00Z date_updated: 2022-08-22T08:20:29Z day: '23' doi: 10.48550/arXiv.1906.09611 extern: '1' external_id: arxiv: - '1906.09611' keyword: - asteroseismology - methods - data analysis - thecniques - machine learning - stars - oscillations language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1906.09611 month: '06' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Automatic classification of K2 pulsating stars using machine learning techniques type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11826' abstract: - lang: eng text: "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.\r\nThis 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:\r\n- 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.\r\n- 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." alternative_title: - LIPIcs article_number: '13' article_processing_charge: No author: - first_name: Bertie full_name: Ancona, Bertie last_name: Ancona - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Liam full_name: Roditty, Liam last_name: Roditty - first_name: Virginia Vassilevska full_name: Williams, Virginia Vassilevska last_name: Williams - first_name: Nicole full_name: Wein, Nicole last_name: Wein citation: ama: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness for diameter in dynamic graphs. In: 46th International Colloquium on Automata, Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13' apa: 'Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13' chicago: Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In 46th International Colloquium on Automata, Languages, and Programming, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13. ieee: B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132. ista: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms and hardness for diameter in dynamic graphs. 46th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 132, 13.' mla: Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.” 46th International Colloquium on Automata, Languages, and Programming, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13. short: B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-07-12 location: Patras, Greece name: 'ICALP: International Colloquium on Automata, Languages, and Programming' start_date: 2019-07-09 date_created: 2022-08-12T08:14:51Z date_published: 2019-07-04T00:00:00Z date_updated: 2023-02-16T10:48:24Z day: '04' doi: 10.4230/LIPICS.ICALP.2019.13 extern: '1' external_id: arxiv: - '811.12527' intvolume: ' 132' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ICALP.2019.13 month: '07' oa: 1 oa_version: Published Version publication: 46th International Colloquium on Automata, Languages, and Programming publication_identifier: isbn: - 978-3-95977-109-2 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Algorithms and hardness for diameter in dynamic graphs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 132 year: '2019' ... --- _id: '11850' abstract: - lang: eng text: '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.' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Stefan full_name: Neumann, Stefan last_name: Neumann - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding. In: SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503' apa: 'Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503' chicago: 'Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, 43–44. Association for Computing Machinery, 2019. https://doi.org/10.1145/3309697.3331503.' ieee: 'M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.' ista: 'Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding. SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 43–44.' mla: 'Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.” SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.' short: 'M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44.' conference: end_date: 2019-06-28 location: Phoenix, AZ, United States name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems' start_date: 2019-06-24 date_created: 2022-08-16T07:14:57Z date_published: 2019-06-20T00:00:00Z date_updated: 2023-02-17T09:41:45Z day: '20' doi: 10.1145/3309697.3331503 extern: '1' external_id: arxiv: - '1904.05474' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.05474 month: '06' oa: 1 oa_version: Preprint page: 43–44 publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling of Computer Systems' publication_identifier: isbn: - 978-1-4503-6678-6 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Efficient distributed workload (re-)embedding type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11847' abstract: - lang: eng text: This paper serves as a user guide to the Vienna graph clustering framework. We review our general memetic algorithm, VieClus, to tackle the graph clustering problem. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. After giving a description of the algorithms employed, we establish the connection of the graph clustering problem to protein–protein interaction networks and moreover give a description on how the software can be used, what file formats are expected, and how this can be used to find functional groups in protein–protein interaction networks. alternative_title: - Methods in Molecular Biology article_processing_charge: No author: - first_name: Sonja full_name: Biedermann, Sonja last_name: Biedermann - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Bernhard full_name: Schuster, Bernhard last_name: Schuster citation: ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Vienna Graph Clustering. In: Canzar S, Rojas Ringeling F, eds. Protein-Protein Interaction Networks. Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:10.1007/978-1-4939-9873-9_16' apa: Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2019). Vienna Graph Clustering. In S. Canzar & F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks (Vol. 2074, pp. 215–231). Springer Nature. https://doi.org/10.1007/978-1-4939-9873-9_16 chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Vienna Graph Clustering.” In Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature, 2019. https://doi.org/10.1007/978-1-4939-9873-9_16. ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231. ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering. In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074, 215–231.' mla: Biedermann, Sonja, et al. “Vienna Graph Clustering.” Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074, Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16. short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature, 2019, pp. 215–231. date_created: 2022-08-16T06:54:48Z date_published: 2019-10-04T00:00:00Z date_updated: 2023-02-17T09:34:26Z day: '04' doi: 10.1007/978-1-4939-9873-9_16 editor: - first_name: Stefan full_name: Canzar, Stefan last_name: Canzar - first_name: Francisca full_name: Rojas Ringeling, Francisca last_name: Rojas Ringeling extern: '1' external_id: pmid: - '31583641' intvolume: ' 2074' language: - iso: eng month: '10' oa_version: None page: 215–231 pmid: 1 publication: Protein-Protein Interaction Networks publication_identifier: eisbn: - '9781493998739' eissn: - 1940-6029 isbn: - '9781493998722' issn: - 1064-3745 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: MIMB status: public title: Vienna Graph Clustering type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2074 year: '2019' ... --- _id: '11853' abstract: - lang: eng text: We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed. article_processing_charge: No author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: 'Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033' apa: 'Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033' chicago: Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on Foundations of Computer Science, 406–23. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/focs.2019.00033. ieee: S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer Science, Baltimore, MD, United States, 2019, pp. 406–423. ista: 'Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 406–423.' mla: Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033. short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423. conference: end_date: 2019-11-12 location: Baltimore, MD, United States name: 'FOCS: Annual Symposium on Foundations of Computer Science' start_date: 2019-11-09 date_created: 2022-08-16T08:00:00Z date_published: 2019-11-01T00:00:00Z date_updated: 2023-02-17T09:50:37Z day: '01' doi: 10.1109/focs.2019.00033 extern: '1' external_id: arxiv: - '1909.11600' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1909.11600 month: '11' oa: 1 oa_version: Preprint page: 406-423 publication: 60th Annual Symposium on Foundations of Computer Science publication_identifier: eisbn: - 978-1-7281-4952-3 isbn: - 978-1-7281-4953-0 issn: - 2575-8454 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: A new deterministic algorithm for dynamic set cover type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ...