• Research dataclose
• Other research productsclose
• Open Access close
• EU close
• English close
• OpenAIRE close

Let Substr_k(X) denote the set of length-k substrings of a given string X for a given integer k > 0. We study the following basic string problem, called z-Shortest 𝒮_k-Equivalent Strings: Given a set 𝒮_k of n length-k strings and an integer z > 0, list z shortest distinct strings T₁,…,T_z such that Substr_k(T_i) = 𝒮_k, for all i ∈ [1,z]. The z-Shortest 𝒮_k-Equivalent Strings problem arises naturally as an encoding problem in many real-world applications; e.g., in data privacy, in data compression, and in bioinformatics. The 1-Shortest 𝒮_k-Equivalent Strings, referred to as Shortest 𝒮_k-Equivalent String, asks for a shortest string X such that Substr_k(X) = 𝒮_k. Our main contributions are summarized below: - Given a directed graph G(V,E), the Directed Chinese Postman (DCP) problem asks for a shortest closed walk that visits every edge of G at least once. DCP can be solved in 𝒪̃(|E||V|) time using an algorithm for min-cost flow. We show, via a non-trivial reduction, that if Shortest 𝒮_k-Equivalent String over a binary alphabet has a near-linear-time solution then so does DCP. - We show that the length of a shortest string output by Shortest 𝒮_k-Equivalent String is in 𝒪(k+n²). We generalize this bound by showing that the total length of z shortest strings is in 𝒪(zk+zn²+z²n). We derive these upper bounds by showing (asymptotically tight) bounds on the total length of z shortest Eulerian walks in general directed graphs. - We present an algorithm for solving z-Shortest 𝒮_k-Equivalent Strings in 𝒪(nk+n²log²n+zn²log n+|output|) time. If z = 1, the time becomes 𝒪(nk+n²log²n) by the fact that the size of the input is Θ(nk) and the size of the output is 𝒪(k+n²). LIPIcs, Vol. 223, 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), pages 16:1-16:17

In early 2020, the EOSC Community took another crucial step on the road to the development and implementation of the European Open Science Cloud, as seven key EOSC-related Horizon 2020 projects signed a Collaboration Agreement in support of the EOSC Governance. The Agreement involves all the projects supported within the INFRAEOSC-05-2018-2019 call. The Agreement provides a useful framework for all parties to collaborate on a wide range of topics, in order to enhance synergies in all mutual activities related to the EOSC. The projects also agreed on a Joint Activity Plan, which will guide them towards the first iteration of EOSC. Overlaps and complementarities among projects were identified, as well as specific areas for potential cooperation, ultimately aimed at the development of a common strategy to synchronise activities with the EOSC Working Groups. Between April and May 2020, EOSCsecretariat.eu collected the position papers on EOSC compiled by the INFRAEOSC 5b projects, the subgroup that specifically includes the four regional projects covering all corners of Europe, as well as the thematic project ExPaNDS. We would like to thank the five Horizon 2020 projects which have contributed to the making of this compilation of EOSC position papers: EOSC-Nordic (GA No. 857652), EOSC-Pillar (GA No. 857650), EOSC-synergy (GA No. 857647), ExPaNDS (GA No. 857641), and NI4OS-Europe (GA No. 857645).

This is the abstract volume of the Citizen Science SDG Conference titled "Knowledge for Change: A decade of Citizen Science (2020-2030) in support of the SDGs" that took place on 14.-15. October 2020 as a hybrid conference (in Berlin and online). This conference was an official event of Germany’s 2020 EU Council presidency. The conference took place as part of the CS-SDG project, which has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 101000014.

This is the conference programme of the Citizen Science SDG Conference titled "Knowledge for Change: A decade of Citizen Science (2020-2030) in support of the SDGs" that took place on 14.-15. October 2020 as a hybrid conference (in Berlin and online). This conference was an official event of Germany’s 2020 EU Council presidency. The conference took place as part of the CS-SDG project, which has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 101000014.

An article about the Powerskin+ project published in the European Energy Innovation Magazine.

Our third newsletter including information about our main achievements during the second 6 months project period.

An article about the Powerskin+ project in the Open Access Government publication.

In this article, we present Cellulo, a novel robotic platform that investigates the intersection of three ideas for robotics in education: designing the robots to be versatile and generic tools; blending robots into the classroom by designing them to be pervasive objects and by creating tight interactions with (already pervasive) paper; and finally considering the practical constraints of real classrooms at every stage of the design. Our platform results from these considerations and builds on a unique combination of technologies: groups of handheld haptic-enabled robots, tablets and activity sheets printed on regular paper. The robots feature holonomic motion, haptic feedback capability and high accuracy localization through a microdot pattern overlaid on top of the activity sheets, while remaining affordable (robots cost about EUR 125 at the prototype stage) and classroom-friendly. We present the platform and report on our first interaction studies, involving about 230 children.

This is the first issue of the GERONTE H2020 project newsletter. The newsletter aims to communicate to all interested project research and innovation news and activities as they happen. The GERONTE Newsletter is published twice a year and archived on ZENODO for long-term open accessibility. To receive GERONTE newsletter by email on first publication, please subscribe on GERONTE website at https://geronteproject.eu