<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The Ariadne Registry of LORs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jose Luis Santos</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Joris Klerkx</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Erik Duval</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>joseluis.santos, joris.klerkx, erik.duval @cs.kuleuven.be Dept. Computerwetenschappen K.U.Leuven Celestijnenlaan 200A B-3000 Leuven Belgium</institution>
        </aff>
      </contrib-group>
      <fpage>13</fpage>
      <lpage>22</lpage>
      <abstract>
        <p>The ARIADNE registry is one of the core components in an architecture that promotes interoperability of networks of repositories that facilitates the access to the learning content and encouraging the share and reuse of digital content. This paper explains the development of the ARIADNE registry of learning object repositories (LORs) and the role played by standards and speci cations.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        One of the problems of Technology Enhanced Learning (TEL) is that creating
Learning Objects (LOs) is expensive and time-consuming [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Sharing is one
of the possibilities to address this problem. When content creators search for
materials to reuse, they typically do not care about where the resource is located,
but want to nd the best quality materials that satisfy their needs [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        LOs are typically stored in Learning Objects Repositories (LORs). In
ARIADNE, considerable e ort has been spent on the development of standards and
speci cations for LORs [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], including IEEE LOM [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], SQI [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], SPI [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], OAI-PMH
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and PLQL [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. These allow e ective share and reuse of LOs between di erent
LORs and networks of LORs.
      </p>
      <p>One of the problems for managing all these repositories within a network
is the scalability. Currently, every repository is added manuallyin the harvester
or in the federated search layer service. However, this time consuming process
requires that one person con gures the targets and its parameters such as the
requirements (e.g. query languages for querying or metadata formats for
harvesting).</p>
      <p>In addition, some extra information about the content inside of the
repositories can be useful for managing this architecture. For instance, if we know
that one repository contains LOs focused on mathematics, and we are interested
in them, we can select this target to be harvested. To enable the sharing and
exchange of this information with other networks of repositories, the information
needs to be structured and managed.</p>
      <p>
        This paper focuses on how the ARIADNE implements the ARIADNE
Registry that has been integrated in the GLOBE architecture [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and how ARIADNE
addresses the problems described above by:
1. using a reference implementation developed for the ASPECT project [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
based on the concept of content collection. This content collection contains
relevant information about the content of the collections and technical
information for accessing them;
2. creating a registry for managing this information;
3. using standards and speci cations for increasing the interoperability within
networks of the repositories;
4. creating a network of registries in order to exchange the information between
them and to be able to access the LOs of other networks. In this way, all the
modi cations done in a network can be widespread through all the networks
of the registries.
      </p>
      <p>The paper is organized as follows: section 2 which shows a possible use case
of the approach. Section 3 introduces an explanation of the Registry Data Model
co-developed in ASPECT project. Section 4 explains the Registry Architecture.
Some statistics and data are presented in section 5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Use Case. ARIADNE Foundation integrates the</title>
    </sec>
    <sec id="sec-3">
      <title>ARIADNE registry in its infrastructure</title>
      <p>This section focuses on a use case for the ARIADNE registry and discusses:
(i) the integration of the ARIADNE Registry in existing architectures and (ii)
increasing the collaboration between di erent institutions for exposing their LOs.
Also, we introduce some technical details about the implementation. The nal
goal is to explain the use of the registry in a non formal way.</p>
      <p>ARIADNE Foundation has several repositories where the LOs are described
by Learning Object Metadata. They expose the metadata using SQI and
OAIPMH. However, they have noticed that the number of repositories is increasing
and it's di cult to manage all the information from other content providers.
These content providers describe their LOs using di erent speci cations like
LOM and Dublin Core(DC), on the other hand some content providers expose
the LOs using OAI-PMH and/or SQI. Looking for a good solution, they decide
to integrate the ARIADNE Registry to manage this information because:
1. The ARIADNE Registry allows the de nition of LORs using IMS LODE.</p>
      <p>That is open in terms of using speci cations.
2. The ARIADNE Registry exposes the information using SQI, RSS and
OAIPMH. SQI allows to query the registry. RSS alerts subscribers when a new
target is added. OAI-PMH allows to harvest all information from the
ARIADNE Registry. These three speci cations allow to integrate their
ARIADNE Federated Search Layer which queries di erent repositories to obtain
di erent LOs from di erent repositories, the ARIADNE harvester which
harvests metadata from di erent repositories and to build a federation of
registries which allows to collaborate with di erent institutions.</p>
      <p>The bene ts that they obtain from the integration of the ARIADNE Registry
are:
1. They have centralized all the information from all the repositories where
they harvest from. It saves time in terms of administration tasks.
2. They can implement other services on top of the registry to check the
availability of the di erent services. This service allows that other services can
check this information before trying to access the targets. This information
optimizes the performance behavior of these services.
3. The integration of the registry allows that new targets added are widespread
by di erent network of LORs which are federated with ARIADNE network.
3</p>
    </sec>
    <sec id="sec-4">
      <title>ARIADNE Registry Data model</title>
      <p>
        The ASPECT project [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] has co-developed an application pro le of IMS LODE[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
It is based on IMS Dublin Core Collections Application Pro le speci cation and
complemented with ISO 2146 and IEEE LOM [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. This speci cation uses the
concept of content collections. A content collection is de ned as a group of
digital content which is exposed to the world through some protocols based on
standards or speci cations.
      </p>
      <p>ARIADNE has chosen this speci cation, because it is not restrictive in terms
of use of speci cations, and it increases the possibilities of interoperatibility
between architectures. In addition, the model does not restrict how the content
collections are created. This is an important issue, because the content providers
can choose how they create them and can o er metadata information about the
collections that they are interested in.</p>
      <p>This model is represented by a schema that contains three main elements
Content Collection, Metadata Collection and Protocol.
1. Content Collection contains information about access rights, authoring, title
description, keywords, etc. This is information about the content itself.
2. Metadata Collection contains information about how the metadata is
exposed. Here, the content provider has to de ne which speci cation are used
to expose metadata. This part of the speci cation has an element for de ning
the speci cation called Protocol Implementation Description which is used
for de ning extra information like the query language supported by an SQI
interface or sets supported by an OAI-PMH interface.
3. Protocol contains speci c information about the speci cation used like the
URL of the schema, namespace or the binding location.</p>
      <p>
        Several examples can be found at the ARIADNE Registry site [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
    </sec>
    <sec id="sec-5">
      <title>ARIADNE Registry Architecture</title>
      <p>The implementation of the registry enables ARIADNE to build a federation of
registries, to provide access to collection information using SQI and to publish
new content collections using SPI.</p>
      <p>Connections to all the networks</p>
      <p>querying one registry
Federated Search</p>
      <p>Harvester</p>
      <p>Registry 2
MC OAI-PMH</p>
      <p>CC
CC
CC</p>
      <p>MC SQI
MC SSPQII
MC SRU/W</p>
      <p>SQI
OAI-PMH</p>
      <p>RSS
SPI</p>
      <p>Synchronization</p>
      <p>A registry can contain metadata collections (MC in the gure 1) or content
collections (CC). The latter contain metadata collections (MC).</p>
      <p>The nal goal of the registry is to create a network of networks of
repositories, similar to current DNS functionality on the internet. All the registries
are synchronized so if a harvester or a federated search service queries a registry,
they can access all the content collections or metadata collections in the di erent
networks. This approach is important: it allows automated discovery, decreases
time spent managing repository information, and allows automated widespread
updates.</p>
      <p>This architecture shows how the registry can be synchronized with other
registries. The registry exposes its contents using OAI-PMH so that other registries
can harvest its content. In addition, the registry exposes its updates also using
the RSS 2.0 speci cation, so that registries can be synchronized also with RSS
feed readers. This RSS system can be used as a noti cation system, as it contains
all the targets published.</p>
      <p>The registry uses SQI for querying because it is neutral in terms of query
language or results formats. Consequently, all SQI clients can query the registry.
The registry supports di erent query languages like PLQL, VSQL and Lucene
Query Language.</p>
      <p>Finally, the registry implements an SPI interface for publishing content
collections. For instance, when other content collections are harvested, they are
inserted using SPI to publish content by reference, because the metadata in this
case de nes a content collection already published elsewhere.</p>
      <p>One of the main advantages of this implementation is that ARIADNE
Registry is based on the ARIADNE Repository. This software is a exible
implementation that allows di erent models of metadata. For instance, it supports
LOM, ILOX, Dublin Core and this paper explains how it supports IMS LODE
Registry speci cation. The idea behind this software is that we can index all
kind of xml document. However, the nal goal is that we can built combined
queries, for instance, using PLQL, based on the content of di erent tags.</p>
      <p>Trying to validate this architecture, we have integrated the ARIADNE
harvester with the registry. The following sequencing diagram 2 shows how a
system administrator can con gure the harvester using the current implementation
where the system administration can query the registry and add the targets that
he/she is interested in.
5</p>
    </sec>
    <sec id="sec-6">
      <title>Related Work</title>
      <p>One of the main goals of ARIADNE is to encourage sharing and reusing LOs.
For this purpose, we have implemented a registry using the concept of content
collection, integrating some technical information in the data model and
allowing the federation of registries. Table 1 shows the similarities between existing
approaches and the ARIADNE approach.</p>
      <p>
        Domain Name System (DNS)[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] has conceptual similarities with the
approach explained in this paper. While DNS translates a name identi er to a
number identi er, the registry translate abstract information contained by the
content collection to a technical information contained in the metadata
collection. In addition, the federation of DNS allows the propagation between them of
the new sites. It is a similar approach that ARIADNE Registry implements with
User interface
      </p>
      <p>ARIADNE
Harvester</p>
      <p>To Send keywords
Forms for adding/update/delete
new targets</p>
      <p>Request
Forms updated</p>
      <p>To complete the query with (1)</p>
      <p>Results
the federation of the registries (the new content collections should be propagated
among them)</p>
      <p>
        METEOR's Web Service Discovery Infrastructure (MWSDI) uses UDDI
speci cation for de ning the interfaces (web services) and it de nes an ontology for
providing support to the infrastructure using OWL. MWSDI is based on the
need to decentralize an architecture for several reasons such as geographical
location, nature of registered services, business functionality, technical speci
cations and so on [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ][
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. For this reason, it contains an ontology with details
of the domain, Registries, Ontologies and Registries federation and network of
relationship among them. The main di erence is that MWSDI doesn't contain
a content collection approach and the ARIADNE registry doesn't implement an
hierarchical architecture of registries.
      </p>
      <p>
        JISC Information Environment Service Registry (IESR)[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and OCKHAM
NSF / NSDL Registry [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] are developed under Global initiatives Registries [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
They introduce the concept of content collection approach, while IESR uses
Research Support Libraries Programme Collection Description schema (RLSPCD)
and Dublin Core, which allows the de nition of some technical details of the
services which provide access to the collections[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], OCKHAM NSF/NSDL uses
Dublin Core. They consider the de nition of how the repositories expose the
metadata considering protocols like Z39.50, Web Service SOAP, SRW and
OAIPMH. However, they don't provide extra information in their implementations
such as sets supported by OAI-PMH or query languages. The registries expose
their metadata through a SRU client [
        <xref ref-type="bibr" rid="ref16 ref19">19, 16</xref>
        ].
      </p>
      <p>
        CORDRA / ADL registry (ADL-R) merges the concepts or MWSDI and
IESR/OCKHAM, introduces a hierarchical structure of registries and the
concept of content collection based on repositories which accept LOM as a metadata
of LOs [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] .
      </p>
      <p>At the end, we can conclude that Ariadne Registry incorporate the best
characteristics from other approaches:
1. Conceptually, we implement similar approach to DNS widespread
functionality.
2. IMS LODE Registry allows the de nition of the services like UDDI speci
cation concept do.
3. IMS LODE Registry allows the content collection approach like the above
approaches mentioned do.
4. ARIADNE Registry allows the federation of the registries.
6</p>
    </sec>
    <sec id="sec-7">
      <title>Statistics</title>
      <p>In this section, we include some information about the metadata collections
inserted and how they expose the metadata. It includes the number of records
harvested using the OAI-PMH protocol. However, SQI or SRU/W don't provide
a way to get all the possible results, thus the SQI and SRU/W targets do not
contain information in date and records harvested eld (table 2).</p>
      <p>Table 2 shows that the registry contains fourteen repositories which
support SQI, one repository which supports SRU/W, twenty- ve which support
OAI-PMH and one which supports SPI. As the ARIADNE harvester relies on
the registry, we know how many objects are exposed through OAI-PMH. The
information is shown in the table.</p>
      <p>The result is that we expose 1151000 metadata instances through the
ARIADNE registry so far, although, we have to remark that some of them are
duplicated, because some targets harvest other targets. But it means that we can
expose a large amount of metadata instances specifying the protocol to access
to them. All the harvesters which implement OAI-PMH can connect easily to
the registry, using an SQI client for nding the targets and harvesting all the
metadata from all the repositories described in the registry.
7</p>
    </sec>
    <sec id="sec-8">
      <title>Conclusions and future work</title>
      <p>We have developed a LOR registry, which enables us to set up a federation
of registries. Di erent federations of repositories can easily obtain information
from other federations through the registries. In this context, we will deploy the
ARIADNE Registry in the ASPECT project, and we will evaluate the pros and
cons of the federation.</p>
      <p>In the scope of this work, we have considered some of the main speci cations
about querying, harvesting and publishing like SQI, OAI-PMH and SPI. We have
spent some e orts to de ne extra information for the SRU/W. However, we have
to validate this speci cation. Also, we would like to consider more speci cations
such as OKI OSID.</p>
      <p>Now, we have integrated the ARIADNE harvester with the registry, in
addition, we have to work on the Federate Search Layer to allow querying based on
the content of the registries.</p>
      <p>Acknowledgment The ARIADNE Registry has been funded partially by the
ASPECT project: Adopting Standards and Speci cations for Educational
Content (Grant agreement number ECP-2007- EDU-417008) and by the CEN/ISSS
workshop on Learning Technologies (WS-LT). Thanks also to our colleagues
Ivana Bosnic and Katrien Verbert for helping us in this work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ochoa</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
          </string-name>
          , E.:
          <article-title>Measuring learning object reuse</article-title>
          .
          <source>In: EC-TEL '08: Proceedings of the 3rd European conference on Technology Enhanced Learning</source>
          , Berlin, Heidelberg, Springer-Verlag (
          <year>2008</year>
          )
          <volume>322</volume>
          {
          <fpage>325</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Ternier</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bosman</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Metzger</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Halm</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thorne</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kahn</surname>
          </string-name>
          , J.:
          <article-title>Connecting oki and sqi: One small piece of code, a giant leap for reusing learning objects</article-title>
          .
          <source>Proceedings of World Conference on Educational Multimedia, Hypermedia and Telecommunications</source>
          (
          <year>2006</year>
          )
          <volume>825</volume>
          {
          <fpage>831</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Duval</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Forte</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cardinaels</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verhoeven</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van</surname>
            <given-names>Durm</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Hendrikx</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Forte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.W.</given-names>
            ,
            <surname>Ebel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Macowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Warkentyne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Haenni</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>The ariadne knowledge pool system</article-title>
          .
          <source>Commun. ACM</source>
          <volume>44</volume>
          (
          <issue>5</issue>
          ) (
          <year>2001</year>
          )
          <volume>72</volume>
          {
          <fpage>78</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Neven</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
          </string-name>
          , E.:
          <article-title>Reusable learning objects: a survey of lom-based repositories</article-title>
          .
          <source>In: MULTIMEDIA '02: Proceedings of the tenth ACM international conference on Multimedia</source>
          , New York, NY, USA, ACM (
          <year>2002</year>
          )
          <volume>291</volume>
          {
          <fpage>294</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bernd</surname>
            <given-names>Simon</given-names>
          </string-name>
          , Daniel Olmedilla, N.S.e., ed.:
          <article-title>A Simple Query Interface for Interoperable Learning Repositories</article-title>
          . Volume
          <volume>11</volume>
          -
          <fpage>18</fpage>
          ., Chiba, Japan (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ternier</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Massart</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Assche</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simon</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
          </string-name>
          , E.:
          <article-title>A simple publishing interface for learning object repositories</article-title>
          .
          <source>Proc. World Conf. Educational Multimedia</source>
          , Hypermedia, and
          <article-title>Telecommunications, Assoc. for the Advancement of Computing in Education (</article-title>
          <year>2008</year>
          )
          <year>1840</year>
          {
          <fpage>1845</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Lagoze</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lagoze</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , Van de Sompel, H.:
          <article-title>The open archives initiative: Building a low-barrier interoperability framework</article-title>
          .
          <source>IN PROCEEDINGS OF THE ACM/IEEE JOINT CONFERENCE ON DIGITAL LIBRARIES</source>
          (
          <year>2001</year>
          )
          <volume>54</volume>
          {
          <fpage>62</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ternier</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Massart</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Campi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guinea</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ceri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
          </string-name>
          , E.:
          <article-title>Interoperability for searching learning object repositories: The prolearn query language</article-title>
          .
          <source>D-Lib Magazine</source>
          <volume>14</volume>
          (
          <issue>1-2</issue>
          ) (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Klerkx</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vandeputte</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parra</surname>
          </string-name>
          , G.,
          <string-name>
            <surname>Van Assche</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duval</surname>
          </string-name>
          , E.:
          <article-title>How to share and reuse learning resources: the ariadne experience</article-title>
          .
          <source>In: Proceedings ECTEL Conference</source>
          <year>2010</year>
          .
          <article-title>Accepted for publication</article-title>
          . (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>project</surname>
          </string-name>
          , A.: http://www.aspect-project.org/ (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>LODE</surname>
          </string-name>
          , I.: http://www.imsglobal.org/lode/spec/imslodev1p0bd.html (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Massart</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tice</surname>
          </string-name>
          , R.:
          <article-title>Design of data model and architecture for a registry of learning object repositories and application pro les. deliverable 2.2 from aspect project</article-title>
          .
          <source>ASPECT PROJECT</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Example Registry Instance</surname>
          </string-name>
          , I.: http://ariadne.cs.kuleuven.be/ariadneregistry/search/showmetadata.jsp?query=metadatacollection.identi er.entry
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Mockapetris</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dunlap</surname>
            ,
            <given-names>K.J.</given-names>
          </string-name>
          :
          <article-title>Development of the domain name system</article-title>
          .
          <source>SIGCOMM Comput. Commun. Rev</source>
          .
          <volume>18</volume>
          (
          <issue>4</issue>
          ) (
          <year>1988</year>
          )
          <volume>123</volume>
          {
          <fpage>133</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Sivashanmugam</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verma</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Discovery of web services in a federated registry environment</article-title>
          .
          <source>In: ICWS '04: Proceedings of the IEEE International Conference on Web Services</source>
          , Washington, DC, USA, IEEE Computer Society (
          <year>2004</year>
          )
          <fpage>270</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Xiang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morgan</surname>
          </string-name>
          , E.:
          <article-title>Exploiting 'light-weight' protocols and open source tools to implement digital library collections</article-title>
          and services.
          <source>D-Lib Magazine</source>
          <volume>12</volume>
          (
          <issue>10</issue>
          ) (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Apps</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A registry of collections and their services: from metadata to implementation</article-title>
          .
          <source>In: DCMI '04: Proceedings of the 2004 international conference on Dublin Core and metadata applications</source>
          , Dublin Core Metadata Initiative (
          <year>2004</year>
          )
          <volume>1</volume>
          {
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Registries</surname>
            ,
            <given-names>G.I.</given-names>
          </string-name>
          : http://www.globalregistries.org/ (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Morgan</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frumkin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fox</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>The ockham initiative - building componentbased digital library services and collections</article-title>
          .
          <source>D-Lib Magazine</source>
          <volume>10</volume>
          (
          <issue>11</issue>
          ) (
          <year>2004</year>
          )
          <volume>51</volume>
          {
          <fpage>59</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Jerez</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manepalli</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blanchi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lannom</surname>
            ,
            <given-names>L.W.</given-names>
          </string-name>
          :
          <article-title>Adl-r: The rst instance of a cordra registry</article-title>
          .
          <source>D-Lib Magazine</source>
          <volume>12</volume>
          (
          <issue>2</issue>
          ) (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>