2001
Journal article
Metadata Only Access
ADELPHOS: un servente ad oggetti con prefetching logico
Amato G, Mainetto G, Rossini G
An abstract is not available.Source: RIVISTA DI INFORMATICA, vol. XXXI (issue 3), pp. 121-157
Amato G, Mainetto G, Rossini G
An abstract is not available.Source: RIVISTA DI INFORMATICA, vol. XXXI (issue 3), pp. 121-157
See at:
dl.acm.org 
| CNR IRIS
2006
Conference article
Restricted
Image Classifiers for Scene Analysis
Le Saux B, Amato G
The semantic interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. We intend to design classifiers able to annotate images with keywords. Firstly, we propose an image representation appropriate for scene description: images are segmented into regions and indexed according to the presence of given region types. Secondly, we propound a classification scheme de- signed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.DOI: 10.1007/1-4020-4179-9
Metrics:
Le Saux B, Amato G
The semantic interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. We intend to design classifiers able to annotate images with keywords. Firstly, we propose an image representation appropriate for scene description: images are segmented into regions and indexed according to the presence of given region types. Secondly, we propound a classification scheme de- signed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.DOI: 10.1007/1-4020-4179-9
Metrics:
2004
Conference article
Restricted
Image recognition for digital libraries
Le Saux B, Amato G
The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. To allow the search of image-based documents in digital libraries, we propose to design classifiers able to annotate images with keywords. First, we propose an image representation appropriate for scene description. Images are segmented into regions, and then indexed according to the presence of given region types. Second, we propound a classification scheme designed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.DOI: 10.1145/1026711.1026727
Metrics:
Le Saux B, Amato G
The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. To allow the search of image-based documents in digital libraries, we propose to design classifiers able to annotate images with keywords. First, we propose an image representation appropriate for scene description. Images are segmented into regions, and then indexed according to the presence of given region types. Second, we propound a classification scheme designed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.DOI: 10.1145/1026711.1026727
Metrics:
See at:
dl.acm.org | doi.org | CNR IRIS | CNR IRIS | www.scopus.com
2007
Other
Restricted
Similarity search - The metric space approach
Zezula P, Amato G, Dohnal V
Similarity searching has become a fundamental computational task in a variety of application areas, including multimedia information retrieval, data mining, pattern recognition, machine learning, computer vision, biomedical databases, data compression and statistical data analysis. In such environments, an exact match has little meaning, and proximity/distance (similarity/dissimilarity) concepts are typically much more fruitful for searching. In this tutorial, we review the state of the art in developing similarity search mechanisms that accept the metric space paradigm. We explain the high extensibility of the metric space approach and demonstrate its capability with examples of distance functions. After a survey of specialized partitioning and pruning concepts, we introduce the main indexing representatives and provide performance comparison. The efforts to further speed up retrieval are demonstrated by a class of approximated techniques and the very recent proposals of scalable and distributed structures based on the P2P communication paradigm.
Zezula P, Amato G, Dohnal V
Similarity searching has become a fundamental computational task in a variety of application areas, including multimedia information retrieval, data mining, pattern recognition, machine learning, computer vision, biomedical databases, data compression and statistical data analysis. In such environments, an exact match has little meaning, and proximity/distance (similarity/dissimilarity) concepts are typically much more fruitful for searching. In this tutorial, we review the state of the art in developing similarity search mechanisms that accept the metric space paradigm. We explain the high extensibility of the metric space approach and demonstrate its capability with examples of distance functions. After a survey of specialized partitioning and pruning concepts, we introduce the main indexing representatives and provide performance comparison. The efforts to further speed up retrieval are demonstrated by a class of approximated techniques and the very recent proposals of scalable and distributed structures based on the P2P communication paradigm.
2006
Book
Restricted
Similarity Search: the metric space approach
Zezula P, Amato G, Dohnal V, Bako M
In the Information Society, information holds the master key to economic inuence and success. But the usefulness of information depends critically upon its quality and the speed at which it can be transferred. In domains as diverse as multimedia, molecular biology, computer-aided design and marketing and purchasing assistance, the number of data resources is growing rapidly, both with regard to database size and the variety of forms in which data comes packaged. To cope with the resulting information overkill, it is vital to nd tools to search these resources efciently and effectively. Hence the intense interest in Computer Science in searching digital data repositories. But traditional retrieval techniques, typically based upon sorting routines and hash tables, are not appropriate for a growing number of newly-emerging data domains. More exible methods must be found instead which take into account the needs of particular users and particular application domains. This book is about nding efcient ways to locate user-relevant information in collections of objects which have been quantied using a pairwise distance measure between object instances. It is written in direct response to recent advances in computing, communication and storage which have led to the current ood of digital libraries, data warehouses and the limitless heterogeneity of Internet resources. The scale of the problem can be gauged by noting that almost everything we see, hear, read, write or measure will soon be available to computerized information systems. In such an environment, varied data modalities such as multimedia objects, scientic observations and measurements, statistical analyses and many others, are massively extending more traditional attribute-like data types.
Zezula P, Amato G, Dohnal V, Bako M
In the Information Society, information holds the master key to economic inuence and success. But the usefulness of information depends critically upon its quality and the speed at which it can be transferred. In domains as diverse as multimedia, molecular biology, computer-aided design and marketing and purchasing assistance, the number of data resources is growing rapidly, both with regard to database size and the variety of forms in which data comes packaged. To cope with the resulting information overkill, it is vital to nd tools to search these resources efciently and effectively. Hence the intense interest in Computer Science in searching digital data repositories. But traditional retrieval techniques, typically based upon sorting routines and hash tables, are not appropriate for a growing number of newly-emerging data domains. More exible methods must be found instead which take into account the needs of particular users and particular application domains. This book is about nding efcient ways to locate user-relevant information in collections of objects which have been quantied using a pairwise distance measure between object instances. It is written in direct response to recent advances in computing, communication and storage which have led to the current ood of digital libraries, data warehouses and the limitless heterogeneity of Internet resources. The scale of the problem can be gauged by noting that almost everything we see, hear, read, write or measure will soon be available to computerized information systems. In such an environment, varied data modalities such as multimedia objects, scientic observations and measurements, statistical analyses and many others, are massively extending more traditional attribute-like data types.
2008
Software
Metadata Only Access
Flickr Image Search Engine
Amato G
Motore di ricerca visuale per immagini fornite da Flickr e contenute nella collezione Cophir
Amato G
Motore di ricerca visuale per immagini fornite da Flickr e contenute nella collezione Cophir
See at:
CNR IRIS
2002
Other
Open Access
Approximate similarity search in metric spaces
Amato G
There is an urgent need to improve the efficiency of similarity queries. For this reason, this thesis investigates approximate similarity search in the environment of metric spaces. Four different approximation techniques are proposed, each of which obtain high erformance at the price of tolerable imprecision in the results. Measures are defined to quantify the improvement of performance obtained and the quality of approximations. The proposed techniques were tested on various synthetic and real-life files. The results of the experiments confirm the hypothesis that high quality approximate similarity search can be performed at a much lower cost than exact similarity search. The approaches that we propose provide an improvement of efficiency of up to two orders of magnitude, guaranteeing a good quality of the approximation. The most promising of the proposed techniques exploits the measurement of the proximity of ball regions in metric spaces. The proximity of two ball regions is defined as the probability that data objects are contained in their intersection. This probability can be easily obtained in vector spaces but is very difficult to measure in generic metric spaces, where only distance distribution is available and data distribution cannot be used. Alternative techniques, which can be used to estimate such probability.
Amato G
There is an urgent need to improve the efficiency of similarity queries. For this reason, this thesis investigates approximate similarity search in the environment of metric spaces. Four different approximation techniques are proposed, each of which obtain high erformance at the price of tolerable imprecision in the results. Measures are defined to quantify the improvement of performance obtained and the quality of approximations. The proposed techniques were tested on various synthetic and real-life files. The results of the experiments confirm the hypothesis that high quality approximate similarity search can be performed at a much lower cost than exact similarity search. The approaches that we propose provide an improvement of efficiency of up to two orders of magnitude, guaranteeing a good quality of the approximation. The most promising of the proposed techniques exploits the measurement of the proximity of ball regions in metric spaces. The proximity of two ball regions is defined as the probability that data objects are contained in their intersection. This probability can be easily obtained in vector spaces but is very difficult to measure in generic metric spaces, where only distance distribution is available and data distribution cannot be used. Alternative techniques, which can be used to estimate such probability.
2004
Other
Open Access
Image Recognition for Digital Libraries
Le Saux B, Amato G
The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. To allow the search of image-based documents in digital libraries, we propose to design classifiers able to annotate images with keywords. First, we propose an image representation appropriate for scene description. Images are segmented into regions, and then indexed according to the presence of given region types. Second, we propound a classification scheme designed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.
Le Saux B, Amato G
The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. To allow the search of image-based documents in digital libraries, we propose to design classifiers able to annotate images with keywords. First, we propose an image representation appropriate for scene description. Images are segmented into regions, and then indexed according to the presence of given region types. Second, we propound a classification scheme designed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.
See at:
CNR IRIS 
| ISTI Repository | CNR IRIS
2012
Software
Metadata Only Access
Metric inverted file.
Amato G
MI-File (Metric Inverted File) allows you to perform approximate similarity search on huge datasets. As an example give a look at the Image Similarity Search Engine, which allows you searching in a dataset of more than 100 millions images, that was built using the MI-File library. The technique is based on the use of a space transformation where data objects are represented by ordered sequences of reference objects. The sequence of reference objects that represent a data object is ordered according to the distance of the reference objects from the data object being represented. Distance between two data objects is measured by computing the spearmann footrule distance between the two sequence of reference objects that represent them. The closer the two data objects the most similar the two sequence of reference objects. The index is based on the use of inverted files.
Amato G
MI-File (Metric Inverted File) allows you to perform approximate similarity search on huge datasets. As an example give a look at the Image Similarity Search Engine, which allows you searching in a dataset of more than 100 millions images, that was built using the MI-File library. The technique is based on the use of a space transformation where data objects are represented by ordered sequences of reference objects. The sequence of reference objects that represent a data object is ordered according to the distance of the reference objects from the data object being represented. Distance between two data objects is measured by computing the spearmann footrule distance between the two sequence of reference objects that represent them. The closer the two data objects the most similar the two sequence of reference objects. The index is based on the use of inverted files.
See at:
code.google.com | CNR IRIS
2004
Journal article
Metadata Only Access
Image annotation with Presence-Vector Classifiers
Bertrand Le Saux, Giuseppe Amato
The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. Efficient image recognition software would lead to technological advances in many areas, from effective security to intelligent information retrieval. We propose a system that can classify new images on the basis of information learnt from a training set of previously annotated images.Source: ERCIM NEWS, vol. 58
Bertrand Le Saux, Giuseppe Amato
The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. Efficient image recognition software would lead to technological advances in many areas, from effective security to intelligent information retrieval. We propose a system that can classify new images on the basis of information learnt from a training set of previously annotated images.Source: ERCIM NEWS, vol. 58
See at:
CNR IRIS
2000
Journal article
Open Access
Approximate similarity search
Amato G
Similarity searching is fundamental in various application areas. Recently it has attracted much attention in the database community because of the growing need to deal with large volume of data. Consequently, efficiency has become a matter of concern in design. Although much has been done to develop structures able to perform fast similarity search, results are still not satisfactory, and more research is needed. The performance of similarity search for complex features deteriorates and does not scale well to very large object collections. Given the intrinsically interactive nature of the similarity-based search process, the efficient execution of elementary queries has become even more important, and the notion of approximate search has emerged as an important research issue.Source: ERCIM NEWS, vol. 43, pp. 42-43
Amato G
Similarity searching is fundamental in various application areas. Recently it has attracted much attention in the database community because of the growing need to deal with large volume of data. Consequently, efficiency has become a matter of concern in design. Although much has been done to develop structures able to perform fast similarity search, results are still not satisfactory, and more research is needed. The performance of similarity search for complex features deteriorates and does not scale well to very large object collections. Given the intrinsically interactive nature of the similarity-based search process, the efficient execution of elementary queries has become even more important, and the notion of approximate search has emerged as an important research issue.Source: ERCIM NEWS, vol. 43, pp. 42-43
2012
Other
Restricted
VISITO Tuscany - Relazione avanzamento progetto VISITO Tuscany
Amato G
Questo documento descrive i risultati ottenuti dal progetto VISITO Tuscany nei mesi 17-27 di esecuzione delle attività. Esso integra il documento G3.1 e G3.2, in cui è stata riportata l'avanzamento delle attività rispettivamente nei primi otto e sedici mesi di progetto.
Amato G
Questo documento descrive i risultati ottenuti dal progetto VISITO Tuscany nei mesi 17-27 di esecuzione delle attività. Esso integra il documento G3.1 e G3.2, in cui è stata riportata l'avanzamento delle attività rispettivamente nei primi otto e sedici mesi di progetto.
2010
Other
Restricted
G2 - Piano di controllo della qualità
Amato G
Lo scopo di questo deliverable è quello di stabilire le procedure e metodologie da adottare durante l'esecuzione del progetto VISITO Tuscany. L'obbiettivo è quello di garantire un'efficace ed efficiente gestione del progetto, il raggiungimento degli obbiettivi , ed assicurare il consenso sulle attività da parte dei membri del progetto. Il PQ definisce un insieme di regole per la gestione del lavoro cooperativo nel progetto, includendo anche le procedure da adottare, i meccanismi di reportistica, l'organizzazione degli incontri, il controllo del flusso di informazione, l'affidabilità dei risultati, la preparazione della documentazione per la sottomissione alla Regione Toscana (RT).
Amato G
Lo scopo di questo deliverable è quello di stabilire le procedure e metodologie da adottare durante l'esecuzione del progetto VISITO Tuscany. L'obbiettivo è quello di garantire un'efficace ed efficiente gestione del progetto, il raggiungimento degli obbiettivi , ed assicurare il consenso sulle attività da parte dei membri del progetto. Il PQ definisce un insieme di regole per la gestione del lavoro cooperativo nel progetto, includendo anche le procedure da adottare, i meccanismi di reportistica, l'organizzazione degli incontri, il controllo del flusso di informazione, l'affidabilità dei risultati, la preparazione della documentazione per la sottomissione alla Regione Toscana (RT).
2004
Conference article
Restricted
Image classifiers for scene analysis
Le Saux B, Amato G
The semantic interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. We intend to design classifiers able to annotate images with keywords. Firstly, we propose an image representation appropriate for scene description: images are segmented into regions and indexed according to the presence of given region types. Secondly, we propound a classification scheme de- signed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.
Le Saux B, Amato G
The semantic interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. We intend to design classifiers able to annotate images with keywords. Firstly, we propose an image representation appropriate for scene description: images are segmented into regions and indexed according to the presence of given region types. Secondly, we propound a classification scheme de- signed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification.
2015
Journal article
Open Access
Application of graph theory to the elaboration of personal genomic data for genealogical research
Palleschi V, Pagani L, Pagnotta S, Amato G, Tofanelli S
In this communication a representation of the links between DNA-relatives based on Graph Theory is applied to the analysis of personal genomic data to obtain genealogical information. The method is tested on both simulated and real data and its applicability to the field of genealogical research is discussed. We envisage the proposed approach as a valid tool for a streamlined application to the publicly available data generated by many online personal genomic companies. In this way, anonymized matrices of pairwise genome sharing counts can help to improve the retrieval of genetic relationships between customers who provide explicit consent to the treatment of their data.Source: PEERJ. COMPUTER SCIENCE., vol. 2015 (issue 10)
DOI: 10.7717/peerj-cs.27
DOI: 10.7287/peerj.preprints.1201v1
Metrics:
Palleschi V, Pagani L, Pagnotta S, Amato G, Tofanelli S
In this communication a representation of the links between DNA-relatives based on Graph Theory is applied to the analysis of personal genomic data to obtain genealogical information. The method is tested on both simulated and real data and its applicability to the field of genealogical research is discussed. We envisage the proposed approach as a valid tool for a streamlined application to the publicly available data generated by many online personal genomic companies. In this way, anonymized matrices of pairwise genome sharing counts can help to improve the retrieval of genetic relationships between customers who provide explicit consent to the treatment of their data.Source: PEERJ. COMPUTER SCIENCE., vol. 2015 (issue 10)
DOI: 10.7717/peerj-cs.27
DOI: 10.7287/peerj.preprints.1201v1
Metrics:
See at:
doi.org | PeerJ Computer Science | CNR IRIS | ISTI Repository | PeerJ Computer Science | peerj.com | CNR IRIS
1996
Conference article
Restricted
Concurrent index management using shadow-paging
Amato G, Mainetto G
This paper provides a comprehensive treatment of concurrent index management in a database management system that uses shadw-paging technique for recovery purposes. The paper illustrates an original technique that uses a version B-link. Tree algorithm during the desceni phase ami an ad-hoc key locking strategy for allowing multiple index operations in a transaction, The original technique has been experimented in PIOS, an object server supporting physical independence. This technique has been validated by the performance tests that are reported in this paper.
Amato G, Mainetto G
This paper provides a comprehensive treatment of concurrent index management in a database management system that uses shadw-paging technique for recovery purposes. The paper illustrates an original technique that uses a version B-link. Tree algorithm during the desceni phase ami an ad-hoc key locking strategy for allowing multiple index operations in a transaction, The original technique has been experimented in PIOS, an object server supporting physical independence. This technique has been validated by the performance tests that are reported in this paper.
1998
Other
Restricted
ADELPHOS (ADvancED Logically Prefetched Object Server): un servente a oggetti con prefetching logico
Amato G, Mainetto G, Rossini G
An abstract is not available.
Amato G, Mainetto G, Rossini G
An abstract is not available.
2019
Journal article
Open Access
IDEA e la conservazione dei dati epigrafici di EAGLE
Liuzzo Pm, Zoppi F Felle A E, Amato G
Poche discipline possono vantare di aver digitalizzato la quasi integrità del patrimonio documentario di loro interesse come l'epigrafia latina e greca ([12];[13]). Con trent'anni di esperienza nella digitalizzazione delle iscrizioni, l'epigrafia può vantare di essere arrivata molto vicino a questo risultato, ma ha anche imparato molto sulla sostenibilità di tale impresa e sul continuo impegno che essa comporta. Nel corso del progetto EAGLE (Europeana Network for Ancient Greek and Latin Epigraphy, 2013-2016) è stato per esempio realizzato un modello, basato sull'affermato standard TEI/EpiDoc in grado di garantire una mappatura a CIDOC-CRM e all'EMD (Europeana Metadata Model). Questo lavoro ha reso possibile non solo lo sviluppo del portale EAGLE con le sue funzionalità fino ad allora solo auspicate dalla comunità internazionale degli epigrafisti, ma ha anche permesso di raccogliere un significativo consorzio di partner e di produrre risorse aggiuntive, come ad esempio la Virtual Exhibition "Signs of Life" che raccoglie link a progetti, 3D, infografica in una introduzione per non addetti ai lavori.Source: UMANISTICA DIGITALE, vol. 7, 2019, pp. 1-6
DOI: 10.6092/issn.2532-8816/8704
Project(s): Europeana network of Ancient Greek and Latin Epigraphy
Metrics:
Liuzzo Pm, Zoppi F Felle A E, Amato G
Poche discipline possono vantare di aver digitalizzato la quasi integrità del patrimonio documentario di loro interesse come l'epigrafia latina e greca ([12];[13]). Con trent'anni di esperienza nella digitalizzazione delle iscrizioni, l'epigrafia può vantare di essere arrivata molto vicino a questo risultato, ma ha anche imparato molto sulla sostenibilità di tale impresa e sul continuo impegno che essa comporta. Nel corso del progetto EAGLE (Europeana Network for Ancient Greek and Latin Epigraphy, 2013-2016) è stato per esempio realizzato un modello, basato sull'affermato standard TEI/EpiDoc in grado di garantire una mappatura a CIDOC-CRM e all'EMD (Europeana Metadata Model). Questo lavoro ha reso possibile non solo lo sviluppo del portale EAGLE con le sue funzionalità fino ad allora solo auspicate dalla comunità internazionale degli epigrafisti, ma ha anche permesso di raccogliere un significativo consorzio di partner e di produrre risorse aggiuntive, come ad esempio la Virtual Exhibition "Signs of Life" che raccoglie link a progetti, 3D, infografica in una introduzione per non addetti ai lavori.Source: UMANISTICA DIGITALE, vol. 7, 2019, pp. 1-6
DOI: 10.6092/issn.2532-8816/8704
Project(s): Europeana network of Ancient Greek and Latin Epigraphy
Metrics:
See at:
CNR IRIS | ISTI Repository | Umanistica Digitale | CNR IRIS
2006
Conference article
Open Access
The DELOS testbed for choosing a digital preservation strategy
Strodl S, Rauber A, Rauch C, Hofman H, Debole F, Amato G
With the rapid technological changes, digital preservation, i.e. the endeavor to provide long-term access to digital objects, is turning into one of the most pressing challenges to ensure the survival of our digital artefacts. A set of strategies has been proposed, with a range of tools supporting parts of digital preservation actions. Yet, with requirements on which strategy to follow and which tools to employ being different for each setting, depending e.g. on object characteristics or institutional requirements, deciding which solution to implement has turned into a crucial decision. This paper presents the DELOS Digital Preservation Testbed. It provides an approach to make informed and accountable decisions on which solution to implement in order to preserve digital objects for a given purpose. It is based on Utility Analysis to evaluate the performance of various solutions against well-defined objectives, and facilitates repeatable experiments in a standardized laboratory setting.DOI: 10.1007/11931584_35
Metrics:
Strodl S, Rauber A, Rauch C, Hofman H, Debole F, Amato G
With the rapid technological changes, digital preservation, i.e. the endeavor to provide long-term access to digital objects, is turning into one of the most pressing challenges to ensure the survival of our digital artefacts. A set of strategies has been proposed, with a range of tools supporting parts of digital preservation actions. Yet, with requirements on which strategy to follow and which tools to employ being different for each setting, depending e.g. on object characteristics or institutional requirements, deciding which solution to implement has turned into a crucial decision. This paper presents the DELOS Digital Preservation Testbed. It provides an approach to make informed and accountable decisions on which solution to implement in order to preserve digital objects for a given purpose. It is based on Utility Analysis to evaluate the performance of various solutions against well-defined objectives, and facilitates repeatable experiments in a standardized laboratory setting.DOI: 10.1007/11931584_35
Metrics:
See at:
CNR IRIS | link.springer.com | ISTI Repository | doi.org | CNR IRIS | CNR IRIS
2007
Conference article
Restricted
Evaluating preservation strategies for electronic theses and dissertations
Strodl S, Becker C, Neumayer R, Rauber A, Nicchiarelli Bettelli E, Kaiser M, Hofman H, Neuroth H, Strathmann S, Debole F, Amato G
Digital preservation has turned into a pressing challenge for institutions having the obligation to preserve digital objects over years. A range of tools exist today to support the variety of preservation strategies such as migration or emulation. Yet, di®erent preservation requirements across institutions and settings make the decision on which solution to implement very di±cult. The Austrian National Library will have to preserve electronic theses and dissertations provided as PDF ̄les and is thus investigating potential preservation solutions. The DELOS Digital Preservation Testbed is used to evaluate various alternatives with respect to speci ̄c requirements. It provides an approach to make informed and accountable decisions on which solution to implement in order to preserve digital objects for a given purpose.We analyse the performance of various preservation strategies with respect to the speci ̄ed requirements for the preservation of master theses and present the results.Source: LECTURE NOTES IN COMPUTER SCIENCE, vol. 4877, pp. 238-247
DOI: 10.1007/978-3-540-77088-6_23
Metrics:
Strodl S, Becker C, Neumayer R, Rauber A, Nicchiarelli Bettelli E, Kaiser M, Hofman H, Neuroth H, Strathmann S, Debole F, Amato G
Digital preservation has turned into a pressing challenge for institutions having the obligation to preserve digital objects over years. A range of tools exist today to support the variety of preservation strategies such as migration or emulation. Yet, di®erent preservation requirements across institutions and settings make the decision on which solution to implement very di±cult. The Austrian National Library will have to preserve electronic theses and dissertations provided as PDF ̄les and is thus investigating potential preservation solutions. The DELOS Digital Preservation Testbed is used to evaluate various alternatives with respect to speci ̄c requirements. It provides an approach to make informed and accountable decisions on which solution to implement in order to preserve digital objects for a given purpose.We analyse the performance of various preservation strategies with respect to the speci ̄ed requirements for the preservation of master theses and present the results.Source: LECTURE NOTES IN COMPUTER SCIENCE, vol. 4877, pp. 238-247
DOI: 10.1007/978-3-540-77088-6_23
Metrics:
See at:
doi.org | CNR IRIS | CNR IRIS | www.springerlink.com