Ewa Kusmierek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ewa Kusmierek has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Arleta Nawrocka-Wysocka
Institute of Art of the Polish Academy of Sciences, Poland
1 shared publication David H.C. Du
1 shared publication- Ewa Łukasik
Institute of Computing Science, Poznan University of Technology, Poland
1 shared publication James C. Beyer
1 shared publication- Magdalena Chudy
Institute of Art of the Polish Academy of Sciences, Warsaw, Poland
1 shared publication - Tomasz Parkoła
Poznan Supercomputing and Networking Center, Poznan, Poland
1 shared publication
Latest Publications
- Open Access
- 10 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 30-34
Incorporating symbolic representations of traditional music into a digital library
This paper presents the outcomes of the recent development of the existing digital library dedicated to Polish traditional music, aimed at improving the discovery of musical heritage objects at the level of national and European digital content aggregators. Music transcriptions of over 4,000 traditional songs and melodies in symbolic formats (MIDI, MusicXML and MEI) were added to the library together with rich metadata adapted to Dublin Core standard. Both transcriptions and metadata were created by expert musicologists based on a published anthology book series on Polish traditional music. Subsequent library integration with the Polish metadata aggregator (Digital Libraries Federation) enabled improved folk tunes discovery thanks to implemented melodic-content search.
- 10 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 30-34
Open AccessIncorporating symbolic representations of traditional music into a digital library
This paper presents the outcomes of the recent development of the existing digital library dedicated to Polish traditional music, aimed at improving the discovery of musical heritage objects at the level of national and European digital content aggregators. Music transcriptions of over 4,000 traditional songs and melodies in symbolic formats (MIDI, MusicXML and MEI) were added to the library together with rich metadata adapted to Dublin Core standard. Both transcriptions and metadata were created by expert musicologists based on a published anthology book series on Polish traditional music. Subsequent library integration with the Polish metadata aggregator (Digital Libraries Federation) enabled improved folk tunes discovery thanks to implemented melodic-content search.
- 1 January 2008
- Published by Inderscience Publishers in International Journal of Sensor Networks
- Vol. 3 (3) , 175
Improved n 1-cover discovery using perimeter coverage information
Over-deploying sensors into a coverage region allows for coverage guarantees in the face of random deployments. Extending the lifetime of these deployments by only turning on a handful of sensors that cover the entire region is a viable means of conserving energy. In order to maximally extend the life of a sensor network, several problems must be solved. These are: the 1-cover, the k-cover and n 1-covers. The 1-cover and k-cover problems have been solved previously; however, the n 1-cover problem has proven more difficult to address. We present a perimeter-centric approach to the NP-complete n 1-covers problem, which chooses neighbours based on an optimal disk placement theory, but takes practical constraints into consideration. Simulation results have shown that our system outperforms both the critical field selection algorithm and an n 1-cover selection algorithm derived from Zhang and Hou's OGDC algorithm.
- 1 January 2008
- Published by Inderscience Publishers in International Journal of Sensor Networks
- Vol. 3 (3) , 175
Improved n 1-cover discovery using perimeter coverage information
Over-deploying sensors into a coverage region allows for coverage guarantees in the face of random deployments. Extending the lifetime of these deployments by only turning on a handful of sensors that cover the entire region is a viable means of conserving energy. In order to maximally extend the life of a sensor network, several problems must be solved. These are: the 1-cover, the k-cover and n 1-covers. The 1-cover and k-cover problems have been solved previously; however, the n 1-cover problem has proven more difficult to address. We present a perimeter-centric approach to the NP-complete n 1-covers problem, which chooses neighbours based on an optimal disk placement theory, but takes practical constraints into consideration. Simulation results have shown that our system outperforms both the critical field selection algorithm and an n 1-cover selection algorithm derived from Zhang and Hou's OGDC algorithm.