<!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>Thoughts on exploiting instability in lattices for assessing the discrimination adequacy of a taxonomy</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Antony K Cooper?</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Derrick G Kourie</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serena Coetzee</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Pretoria</institution>
          ,
          <addr-line>Pretoria, South Africa acooperatcsir.co.za,dkourieatcs.up.ac.za,scoetzeeatcs.up.ac.za</addr-line>
        </aff>
      </contrib-group>
      <fpage>338</fpage>
      <lpage>343</lpage>
      <abstract>
        <p>Conventionally in formal concept analysis (FCA), concept stability is preferred in the lattice, because instability (i.e. low stability) represents noise that clouds the analysis of the data. High stability means there are many objects with the same intent or many attributes with the same extent, which could be interpreted as redundant or absent objects or attributes. The di erences between redundancy or absence need to be assessed quantitatively, a process that could be described as stability exploration. We have used FCA to analyse different taxonomies for user-generated content. For example, redundancy amongst attributes represents taxonomy classes unable to di erentiate adequately the objects being classi ed. Absent attributes, redundant objects and absent objects can have various implications. Hence, instability in a lattice is desirable for some types of analysis.</p>
      </abstract>
      <kwd-group>
        <kwd>formal concept analysis</kwd>
        <kwd>stability</kwd>
        <kwd>taxonomy</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        (SABAP2) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]; in-car navigation systems allowing users to submit corrections;
and geocoded photographs on virtual globes such as Google Earth [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        We conducted an assessment amongst some geographical information
professionals of their perceptions of virtual globes, VGI and SDIs [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], and we are in the
process of developing a taxonomy of VGI, which we are modelling formally. We
are using formal concept analysis (FCA) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] to assess the characteristics of
existing taxonomies of UGC, such as their discrimination adequacy. The intention
is to improve the understanding of UGC, in respect of, for example, assessing
UGC quality or catering for VGI in a metadata standard.
      </p>
      <p>FCA uses a lattice of concepts with objects and attributes, and the linkages
between them. We use the standard FCA terminology and notation: a context is
written as: K := (G; M; I), where G is a set of objects and M a set of attributes . I
is the binary relation between the sets of objects and attributes: I (G M ).
(A; B) represents a concept whose extent is A G and whose intent is B M .
For (A; B) to be a formal concept, B must contain all those attributes that the
objects in A have in common, and only those attributes: denoted by A0 = B.
Conversely, A must also contain all those objects that share the attributes B,
and only those objects: denoted by B0 = A. See [10{15].
2</p>
    </sec>
    <sec id="sec-2">
      <title>Stability in a lattice</title>
      <p>
        The intensional stability of a concept indicates how much its intent depends on
individual objects in the extent. It is a measure of the likelihood that
removing a random set of objects from the concept's extent would change its intent.
Similarly, the extensional stability indicates how much the extent depends on
individual attributes in the intent. Formally, [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] de nes the intensional stability
index , i, and extensional stability index , e, of concept (A; B):
i((A; B)) = j fC
e((A; B)) = j fD
      </p>
      <p>A j C0 = Bg j
2jAj
B j D0 = Ag j
2jBj</p>
      <p>Each concept (A; B) has jAj objects in its extent. The intentional stability
index is the proportion of the 2jAj subsets of A which have the following property:
the attributes C0 shared by the objects in any such subset, say C, correspond to
the concept's intent, that is, C0 = B. In a lattice built with objects in C instead
of A, there will be a concept (C; B), and in this sense the intent, B, of concept
(A; B) is \stable". The notion of extensional stability is similar, but with the
roles of extents and intents reversed.</p>
      <p>The more objects (or attributes) covered by a formal concept, the more
likely it will be intensionally (or extensionally) stable, because of the greater
likelihood of \redundant" objects (or attributes). Figure 1 shows a very stable
lattice, because a lattice built from any subset of attributes (objects) would
yield a concept whose extent (intent, respectively) is unchanged from that of
the concept in Figure 1. That is, i(A; B) 1 and e(A; B) 1. While this</p>
      <p>
        attribute b
attribute a
object Z
object Y
attribute e
attribute d
object W
object V
is an extreme example, it illustrates why stability can mean redundancy and
why it can be considered \boring" in some applications [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], because of the
low information content. We appreciate that for machine learning (e.g. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]),
concepts with high stability indicate robust input data with little noise.
      </p>
      <p>
        We have not used FCA to classify data, but to assess the discrimination
adequacy of taxonomies for UGC [
        <xref ref-type="bibr" rid="ref2 ref3 ref4 ref5">2, 3, 5, 4</xref>
        ]. The classes in these taxonomies
are the attributes for FCA, e.g. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] provides classes for copyright issues:
Userauthored content , User-derived content , User-copied content and Peer-to-peer as
UGC . The FCA objects are repositories of UGC, such as in-car navigation or
an open repository [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        We have used Concept Explorer (ConExp) [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]1 for FCA, because it is
opensource, robust and used by our colleagues (e.g. [
        <xref ref-type="bibr" rid="ref16 ref19">16, 19</xref>
        ]), and hence has a pool of
expertise readily available. ConExp provides attribute exploration, an interactive
process to see if each implication (set of \linked" attributes) can also apply to
objects not in the context of the implication. Questions are asked about
dependencies between di erent attributes (i.e. the exploration), and if a dependency
does not hold, the user has to provide a counterexample (e ectively, add a new
object) [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. This can reveal \absent" and \redundant" attributes and objects.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Absent and redundant attributes and objects</title>
      <p>FCA is applied here to determine the adequacy of taxonomies for discriminating
between repositories containing UGC in general, or VGI in particular. We lack
the space to provide detailed examples here, but will do so at the conference.
Instead, we provide a theoretical example in Figure 2, showing absent and
redundant attributes and objects. If a concept has objects, they are shown below
the node and if a concept has attributes, they are shown above the node. In terms
of reduced labelling , each concept inherits objects from its extent and attributes
from its intent. The following subsections refer to Figure 2.
3.1</p>
      <sec id="sec-3-1">
        <title>High intensional stability</title>
        <p>
          Concept A = (fObj1; Obj2; Obj3; Obj4; Obj5g; ;) has high intensional stability,
with i(A) = 0:84. Many (27) of the 32 subsets of A's extent yield a concept
1 Note: ConExp's author requests that users cite his Russian text, [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
whose intent is also ;. The object Obj5 is not described or di erentiated by
any attributes. For our analysis, this could be addressed by adding classes to
a taxonomy, so that it can di erentiate better between the repositories. The
taxonomy in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] extends the taxonomy in [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] (namely, Distribution platform and
Type), to cater for copyright issues. Without the classes of [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], the taxonomy of
[
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] does not really di erentiate repositories from one another.
        </p>
        <p>Concept C = (fObj3; Obj4g; fAttr4g) also has relatively high intensional
stability, with i(C) = 0:75. The objects Obj3 and Obj4 are not di erentiated
from one another by the attributes. E ectively, Obj3 = Obj4 and one of them is
redundant. In a comprehensive analysis of UGC repositories, one would expect
this, namely repositories that are equivalent and hence direct competitors of one
another. For example, referring to Figure 3, the objects shown are generic and
there could be many repositories that are speci c instances of each. Adding these
repositories as objects would create redundancies in the taxonomy.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>High extensional stability</title>
        <p>
          Concept E = (;; fAttr1; Attr2; Attr3; Attr4; Attr5g) has high extensional
stability, with i(E) = 0:84. Again, 27 of the 32 subsets of E's intent yield a concept
whose extent is also ;. The attribute Attr5 does not describe or di erentiate
any objects. This could be a weakness in the analysis, with an important type
of repository omitted, or it could indicate a type of repository that does not
yet exist and hence a potential \gap" in the market. While experimenting with
FCA and the taxonomy of [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], we realised the value of instability in a lattice.
It highlighted a potential \gap" in the market, namely repositories that do not
cater adequately for privacy: a widespread problem on the Internet.
        </p>
        <p>
          Concept D also has relatively high extensional stability, with e(D) = 0:75.
No objects are di erentiated from one another by the attributes Attr2 and Attr3 .
E ectively, Attr2 = Attr3 and one of them is redundant. This could be
coincidental, could re ect a set of objects that is too narrow (eg: other types of
repositories should also have been included), or could indicate that some classes
should be removed from the taxonomy because they add no value or even worse,
could cause confusion as users try to di erentiate between classes that are, in
essence, equivalent. We illustrate this in Figure 3 with a subset of the VGI
taxonomy from [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], for assessing the nature and motivation of produsers (users who are
also producers). For the objects, we use the generic examples of VGI repositories
given by [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. As can be seen, there are several redundancies in the attributes,
because these classes are inadequately de ned, or cannot be di erentiated in
practice, or other types of repositories should be included in this analysis.
While the approach outlined above di erentiates situations of absent attributes /
redundant objects from those of absent objects/redundant attributes, it does not
necessarily do so within these two groupings. This is because qualitative analysis
is probably required to di erentiate between absent attributes and redundant
objects, and between absent objects and redundant attributes. We would suggest
that when assessing the discrimination adequacy of a taxonomy, the absence or
redundancy of objects or attributes is undesirable. Such a taxonomy could be
improved by reducing the intensional and/or extensional stability. It appears that
this could be done in a manner similar to attribute exploration [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], starting with
the concept with the highest stability and then moving on to the next highest.
This process could be termed stability exploration.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>
        We are using FCA to assess the adequacy of taxonomies in discriminating
between di erent types of UGC repositories. In contrast to the usual FCA
applications, we have shown that instability can have value for analysis. High intensional
stability reveals missing classes from a taxonomy, or redundancy amongst the
repositories. High extensional stability reveals missing repositories or gaps in
the market, or taxonomy classes that are redundant. We are investigating how
stability exploration could be implemented to guide a user to reduce stability.
Future work could involve assessing the taxonomies in detail or taxonomies in
other domains, such as bloodstain pattern analysis [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>We would like to acknowledge the fruitful discussions we have had with our
colleagues and the very insightful comments of the anonymous referees.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Hjelmager</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moellering</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delgado</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rajabifard</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rapant</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Danko</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huet</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laurent</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aalders</surname>
            ,
            <given-names>H.J.G.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iwaniak</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abad</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Duren, U.,
          <string-name>
            <surname>Martynenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>An initial Formal Model for Spatial Data Infrastructures</article-title>
          .
          <source>Int J Geogr Inf Sci</source>
          ,
          <volume>22</volume>
          (
          <issue>11</issue>
          ), pp
          <fpage>1295</fpage>
          {
          <issue>1309</issue>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Wunsch-Vincent</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vickery</surname>
          </string-name>
          , G.:
          <article-title>Participative Web: User-Created Content</article-title>
          .
          <source>OECD report DSTI/ICCP/IE</source>
          (
          <year>2006</year>
          )
          <article-title>7/FINAL. Working Party on the Information Economy of the Committee for Information, Computer</article-title>
          and Communications
          <string-name>
            <surname>Policy</surname>
          </string-name>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Gervais</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>The Tangled Web of UGC: Making Copyright Sense of User-Generated Content</article-title>
          .
          <source>Vanderbilt JETL</source>
          ,
          <volume>11</volume>
          (
          <issue>4</issue>
          ), pp
          <fpage>841</fpage>
          {
          <issue>870</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Budhathoki</surname>
            ,
            <given-names>N.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nedovic-Budic</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bruce</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>An interdisciplinary frame for understanding volunteered geographic information</article-title>
          .
          <source>Geomatica</source>
          ,
          <volume>64</volume>
          (
          <issue>1</issue>
          ), pp
          <fpage>11</fpage>
          {
          <issue>26</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Coleman</surname>
            ,
            <given-names>D.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Georgiadou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Labonte</surname>
          </string-name>
          , J.:
          <source>Volunteered Geographic Information: The Nature and Motivation of Produsers. Int J of SDI Res</source>
          ,
          <volume>4</volume>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>6. OpenStreetMap: The Free Wiki World Map. http://www.openstreetmap.org/</mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Southern</given-names>
            <surname>African</surname>
          </string-name>
          <article-title>Bird Atlas Project 2</article-title>
          . http://sabap2.adu.org.za/
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Google</given-names>
            <surname>Earth</surname>
          </string-name>
          : Explore, Search, and Discover. http://earth.google.com/
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coetzee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kourie</surname>
            ,
            <given-names>D.G.</given-names>
          </string-name>
          :
          <article-title>Perceptions of virtual globes, volunteered geographical information and spatial data infrastructures</article-title>
          .
          <source>Geomatica</source>
          ,
          <volume>64</volume>
          (
          <issue>1</issue>
          ), pp
          <fpage>333</fpage>
          {
          <issue>348</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.:
          <article-title>Restructuring lattice theory: An approach based on hierarchies of concepts</article-title>
          .
          <source>In: Ordered sets, Rival, I. (ed)</source>
          , pp
          <fpage>445</fpage>
          <lpage>{</lpage>
          470,
          <string-name>
            <given-names>D</given-names>
            <surname>Reidel</surname>
          </string-name>
          Publishing Co (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.: Applied Lattice Theory:
          <article-title>Formal Concept Analysis</article-title>
          .
          <source>Preprints. 14pp</source>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Carpineto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romano</surname>
          </string-name>
          , G.:
          <article-title>Concept Data Analysis: Theory and Applications</article-title>
          . John Wiley &amp; Sons, Ltd (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Priss</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Formal concept analysis in information science</article-title>
          .
          <source>Annu Rev Inform Sci</source>
          ,
          <volume>40</volume>
          , pp
          <volume>521</volume>
          {
          <issue>543</issue>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>On stability of a formal concept</article-title>
          .
          <source>Ann Math Artif Intel</source>
          ,
          <volume>49</volume>
          (
          <issue>1</issue>
          {4), pp
          <fpage>101</fpage>
          {
          <issue>115</issue>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Klimushkin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Approaches to the Selection of Relevant Concepts in the Case of Noisy Data</article-title>
          .
          <source>In: ICFCA</source>
          <year>2010</year>
          , Agadir, Morocco, pp
          <volume>255</volume>
          {
          <fpage>266</fpage>
          ,
          <string-name>
            <surname>Springer</surname>
          </string-name>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kourie</surname>
            ,
            <given-names>D.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oosthuizen</surname>
          </string-name>
          , G.D.:
          <article-title>Lattices in machine learning: Complexity issues</article-title>
          .
          <source>Acta Informatica</source>
          ,
          <volume>35</volume>
          , pp
          <volume>269</volume>
          {
          <issue>292</issue>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Yevtushenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tane</surname>
          </string-name>
          , J.:
          <article-title>Concept Explorer The User Guide</article-title>
          . (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Yevtushenko</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          :
          <article-title>System of data analysis \Concept Explorer"</article-title>
          .
          <source>In: Proceedings of the 7th National Conference on Arti cial Intelligence KII-2000</source>
          , Russia (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Chan</surname>
            ,
            <given-names>K.S.M.</given-names>
          </string-name>
          :
          <article-title>Formal Methods for Web Services: A Taxonomic Approach</article-title>
          . In: ICSE'
          <fpage>10</fpage>
          ,
          <string-name>
            <surname>Cape</surname>
            <given-names>Town</given-names>
          </string-name>
          , South Africa,
          <volume>2</volume>
          , pp
          <volume>357</volume>
          {
          <fpage>360</fpage>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          <article-title>Thoughts on categorising bloodstain patterns</article-title>
          .
          <source>Technical Report 0442-0001-701-A1</source>
          , CSIR (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>