2012

  • User Requirements for Effective Access to Digital Archives of Manuscripts.

  • M. Agosti, N. Orio.
  • In: Journal of Multimedia, Vol 7, No 2 (2012), Apr 2012, pp. 217-222.
  • Abstract: The availability of digital multimedia resources for cultural heritage poses challenging questions about the kind of interaction that is necessary to foresee to make them available to distinct categories of users. We report on a study on user requirements carried out on two groups of users: domain professional researchers, who need to carry out their research exploiting the functions of digital archives, and non-domain researchers, who need to enhance their experience of digital content and do not have a specific research interest for the digital content. A digital archive of illuminated manuscripts, called IPSA, has been used as a case study for recollecting user requirements. The results highlighted a number of additional requirements by specialized and by non-domain users. The relations between these outcomes provide relevant insights into the role of digital resources for the study and dissemination of cultural heritage.
  • BibTex Link
  • The 1641 Depositions and Portadown Bridge

  • M. Ó Siochrú, M. Sweetnam.
  • In Seanchas Ard Mhacha , 24, (1), 2012, pp. 72 - 103
  • Some algebraic properties of alignments of words.

  • S. Gerdjikov
  • Comptes rendus de l'académie bulgare des science (to appear).
  • Abstract: In the current paper we consider an algebraic approach to the approximate search problem in arbitrary regular languages L. We show how the Myers' divide and conquer algorithm, combined with the Ukkonen's algorithm can be expressed in this framework, thus suggesting a new searching technique for regular languages in general. Another interesting feature of the proposed approach is that it allows relating the efficiency of the arising algorithms with the algebraic structure of the language and the characteristic of the edit-distance. We consider that this technique can be useful when studying the average- case complexity of different approximate search algorithms.
  • BibTex Link