<!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>Privacy Enforcement in Data Analysis Workflows</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yolanda Gil</string-name>
          <email>gil@isi.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>William K. Cheung</string-name>
          <email>william@comp.hkbu.edu.hk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Varun Ratnakar</string-name>
          <email>varunr@isi.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kai-kin Chan</string-name>
          <email>kkchan@comp.hkbu.edu.hk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, Hong Kong Baptist University</institution>
          ,
          <addr-line>Kowloon Tong</addr-line>
          ,
          <country country="HK">Hong Kong</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Information Sciences Institute, University of Southern California 4676 Admiralty Way</institution>
          ,
          <addr-line>Marina del Rey CA 90292</addr-line>
          ,
          <country country="US">United States</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Collaborative e-Science projects commonly require data analysis to be performed on distributed data sets which may contain sensitive information. In addition to the credential-based privacy protection, ensuring proper handling of computerized data for disclosure and analysis is particularly essential in eScience. In this paper, we propose a semantic approach for enforcing it through workflow systems. We define privacy preservation and analysis-relevant terms as ontologies and incorporate them into a proposed policy framework to represent and enforce the policies. We believe that workflow systems with the proposed privacy-awareness incorporated could ease the scientists in setting up privacy polices that suit for different types of collaborative research projects and can help them in safeguarding the privacy of sensitive data throughout the data analysis lifecycle.</p>
      </abstract>
      <kwd-group>
        <kwd>Workflow generation</kwd>
        <kwd>scientific workflows</kwd>
        <kwd>privacy</kwd>
        <kwd>trust</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Trust and security were always central to the vision of the Semantic Web [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In a
recent paper, Weitzner et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] argue for a policy-aware infrastructure for the Web
that ensures privacy and other social needs that would encourage people to share
information freely. They also propose developing systems that are transparent and
accountable [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] regarding their use of sensitive data from individuals and therefore
can demonstrate their compliance with existing privacy laws.
      </p>
      <p>
        The Web has always raised concerns for privacy data. There is concern about the
wide availability of yellow pages and other directory information, and the fact that
protected or sensitive information may become available over the Web perhaps
unintentionally [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Of particular concern are record linkage techniques to
crossreference independent data sources and data mining algorithms that detect patterns,
associate them with individuals, and reveal private or sensitive information about
individuals that may violate basic privacy rights.
1.1
      </p>
    </sec>
    <sec id="sec-2">
      <title>Motivation: Privacy in e-Science</title>
      <p>
        Although privacy has broader interest and applicability, our research arises and
focuses in the context of e-Science applications. Many areas in biomedical sciences
envision benefit from clinical records (e.g., cabig.nci.nih.gov), phenotype
information, and health history. In social and behavioral sciences, widely available
on-line information can be integrated and analyzed to reveal significant patterns that
emerge in specific communities, influential groups and individuals within a social
network, and trends or events of interest. Much of this research is hindered because of
the concern of individuals with their privacy and therefore their reluctance to allow
the use of their personal data. Yet, many people would choose to give up their privacy
for some greater good such as advancing medical research, especially when they are
provided with mechanisms to protect the privacy of their data [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>A variety of mechanisms are being investigated to ensure data privacy including
secure data storage, data access control, auditing mechanisms, and securing lines of
communication. Also, laws and policies for protecting and enforcing health
information privacy will need to be formulated in order to determine how those
technologies need to be used to implement the law. These mechanisms are important
and necessary to control the access and release of data. However, they will not
necessarily support the anticipated sophistication of people’s wishes over the
finegrained control over the uses of their sensitive data, say, for clinical data analysis
conducted by some third parties. Furthermore, the control is further complicated by
the recent trend that the uses of sensitive data are no longer confined to the institution
that collected or owns the data but highly distributed (e.g., cabig.nci.nih.gov).
1.2</p>
    </sec>
    <sec id="sec-3">
      <title>Privacy Protection in Workflow Systems</title>
      <p>
        In recent years, a variety of workflow systems have been developed to manage
complex scientific analysis processes [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. We see workflows as an artifact that
captures, among other things, how data is being transmitted, pre-processed and
analyzed, and for what purpose. Of particular concern for us is to enforce privacy
protection in workflows by enabling workflow systems with privacy-awareness.
Workflow systems can represent detailed models of the individual computations
performed in the data, and be extended to express their privacy-related properties. In
recent years, a variety of algorithms and approaches for privacy-preserving data
analysis are being developed [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], where some transform data into privacy-preserved
versions before putting together for subsequent analysis while some compute
intermediate analysis results via a distributed and secure protocol. With these kinds of
approaches, data sets can be processed and analyzed with well-defined guarantees as
well as risks about the preservation of privacy of individuals. Thus, the already
complex data analysis processes are now further complicated by the need and at the
same time possibility to have data privacy protection integrated. The use of the
semantic approach has been demonstrated to be effective in assisting users in creating
and validating complex data analysis workflows, e.g., for large-scale earthquake data
analysis [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
1.3
      </p>
    </sec>
    <sec id="sec-4">
      <title>Our Contributions</title>
      <p>
        We take a semantic approach to incorporate privacy awareness into workflow
architectures and our implementation in the Wings/Pegasus workflow system [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
The focus of our work to date has been on privacy policies that need to be addressed
when workflows are designed and created. In particular, we show how the workflow
systems could be extended to be able to detect privacy policy violation and to provide
corrective actions for revising the workflows before the data analysis process can be
safely executed.
      </p>
      <p>The paper begins with ontological representations for privacy-relevant terms in
data analysis workflows and illustrate how those ontologies could be used to describe
workflow systems that incorporate traditional data analysis algorithms and
privacypreserving algorithms for analyzing sensitive data. To support automatic privacy
policy enforcement in data analysis workflows, we propose a particular policy
representation which has components describing applicable context, data usage
requirement, privacy protection requirement, and corrective actions if the policy is
violated. We present initial results on extending a workflow system to include
representations of privacy policies that can be enforced by the system. We finalize
with a discussion of related work and possible avenues for future research in this area.</p>
      <sec id="sec-4-1">
        <title>2 Ontological Representations of Privacy-Relevant Terms in Data</title>
      </sec>
      <sec id="sec-4-2">
        <title>Analysis Workflows</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Privacy Preservation Ontology. This ontology includes a PrivacyPreservation class</title>
      <p>
        of privacy preservation methods that convert the input into privacy preserved forms.
Privacy preservation methods can process on each attribute individually or the data set
as a whole. PrivacyPreservationPerAttribute contains component types such as
Anonymization (e.g., masking, substitution) and PrivacyPreservationPerDataset
contains Generalization (e.g., k-anonymity [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]).
      </p>
      <p>Data Analysis Ontology. It provides a separate taxonomy of data analysis methods.
We consider here statistical data analysis algorithms that are widely used in many
domains. In our ontology, DataAnalysis is the root class with subclasses like
Clustering (e.g., Gaussian mixture model ), Classification, etc.</p>
      <p>Extensions of the file ontology. We extend the ontology to describe data protection
up to per-attribute level. Some additional properties and classes added include:
• hasAttribute whose range captures data attributes described as Attribute.
• hasAuthorizedUse which refers to the intended use or purpose of the File.
• Attribute which models file attributes and has a property protectedBy (with
subproperties, e.g. anonymizedBy) to indicate the adopted privacy preservation method.
• special types of File, e.g., DataSet for raw data files and Clusters for clustering
results which can go with data items (ClustersWithDataItems) or just per-cluster
statistics (ClustersWithStatistics). The latter is needed when data privacy is an issue.</p>
    </sec>
    <sec id="sec-6">
      <title>Extensions of workflow template ontology. Some properties added include:</title>
      <p>• hasPurpose which refers to data analysis purpose.
• hasOutputQuality which refers to overall output quality descriptors, e.g. accuracy.
Extensions of component ontology. Some properties and subclasses added include:
• hasParameterSet which refers to the set of parameters needed by the component.
• PPComponentType which contains privacy preservation methods as its sub-classes,
e.g., Generalizer (which in turn has sub-classes, e.g. k-anonymity), and has a
property hasLevelOfProtection for describing the level that its output is protected.
• DAComponentType which contains data analysis methods as its sub-classes, e.g.,
Clustering (which in turn has sub-classes, e.g. GMM), and has supportPPType and
supportDataType to indicate its supporting types of privacy preservation and data.</p>
      <p>
        To illustrate how a domain-specific data analysis workflow can be described, we
adopt a hypothetic clinical data analysis task. Like many other domains, clinical data
can contain patents’ personal identification and demographic information as well as
sensitive ones including medical measurements, medical treatment, drug dosage,
diagnosis, etc. We assume data collected from patient records archived at different
clinic to (1) have the personal identification fields anonymized, (2) be generalized
into groups based on their demographic information by k-anonymity and (3) be
abstracted up to an agreed level of details based on the numerical medical attributes
(e.g., by GMM [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]). Clustering is then carried out to identify patterns in different
patient groups. Fig. 2 shows a related workflow together with a corresponding
domain-specific workflow template created using Wings.
      </p>
      <sec id="sec-6-1">
        <title>A Privacy Policy Representation and Its Enforcement</title>
        <p>We represent data privacy policies semantically based on the derived ontologies so
as to support automatic policy enforcement in data analysis workflows via reasoning.
Note that the privacy awareness being considered here is not conventional
credentialbased authentication and authorization. Instead we require a policy language that is
flexible enough to describe conditions reflecting different relationships among data
sets, components, and their privacy-relevant properties. Such a flexibility requirement
naturally leads us to the use of rule-based representation. Note that other than
expecting the users to specify the rules, rule-based policies carefully created by
experts of the respective field can always be adopted.</p>
        <p>In our current design, a policy representation contains four parts, namely (1)
context, (2) usage requirement, (3) protection requirement, (4) corrective action.
Informally, context specifies what workflows the policy applies. As we are dealing
with data privacy, the context refers to some types of links, data or components where
the policy is applicable. Usage requirements and protection requirements are for
detecting policy violation within the context. Finally, corrective actions are
suggestions for remedy of the policy violation, typically referring to the statements
mentioned in the protection requirements. We further characterize requirements to be
of positive and negative types. Positive requirements specify compliance conditions
and policy violations occur when the conditions ARE NOT satisfied. Negative
requirements specify non-compliance conditions and policy violations occur when the
conditions ARE satisfied. As seen in the following, both types of requirements are
essential for policy representation.</p>
        <p>Context refers to the condition where the underlying policy is relevant. In other
words, the policy applies only if this condition is satisfied.
• Example C1: “Input files of a workflow containing medical images.”</p>
        <p>InLink(?l) ^ hasFile(?l, ?d) ^ hasAttribute(?d, ?a) ^ MedicalImage(?a)
Usage requirement refers to the non-amendable condition under which the use of data
is required (+ve) or not allowed (-ve).
• Example UR1 (+ve): “It is required that the purpose of the workflow should be
equal to the authorized usage of the inputs that match the context.”
for(?w, ?pw) ^ hasAuthorizedUse(?d, ?pw) ^ equal(?pw, ?pd)
Protection requirement refers to the condition when the use of data is required (+ve)
or not allowed (-ve) with respect to data protection and analysis quality.
• Example PR3 (-ve): “It is not allowed that the nodes that match the context
have inputs with attributes in common.”
hasAttribute(?d1, ?a1) ^ hasAttribute(?d2, ?a2) ^ equal(?a1, ?a2))
Corrective action refers to the remedies recommended to fix policy violation. For
“usage requirement” violation, only a printed message stating the violating policy is
expected as no remedy is possible. For “protection requirement” violation, a
corresponding recommended action for fixing the violation will also be provided.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Policy Compliance Checking Via Reasoning We create 2 rules for each policy: a</title>
      <p>context component rule to locate where the policy applies and a requirement
component rule to determine if non-compliance conditions occur within the context.</p>
      <p>For the policy with a negative requirement, its context component rule and
requirement component rule can simply be combined by conjunction and applied to a
workflow description. Thus, the overall rule becomes [context rule] ^ [requirement rule] -&gt;
invalid (?l). Matched results will correspond to the policy violation situations.</p>
      <p>
        For the policy with a positive requirement, the overall rule for detection problematic
parts can be represented as [context rule] ^ not [requirement] -&gt; invalid (?l). However, the
rule becomes not a horn clause and thus cannot be easily represented using SWRL.
Thus, instead of applying directly the overall rule, we apply the context rule first to
the workflow and the matched results form a set with items of concern. Then, we
applied the requirement rule to the set. The newly matched items are removed from
the set in context and the remaining ones are the violation situations. This treatment
works when the policies are free of conflicts among them. If there are some parts in
the workflow with more than one policies applicable, policy conflicts will occur. We
are currently investigating algorithms for policy conflict detection and resolution [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
A Compliance Checking Walkthrough Given the workflow templates discussed in
Section 4.1, two particular policy rules expressed in SWRL are considered:
      </p>
      <p>General Policy G1:“For all the inputs, it is required that the purpose of the
workflow should be equal to the authorized usage of the inputs.”
context:
usage:
protection: NULL
correction: prompt [workflow and data purpose mismatch]</p>
      <p>WorkflowTemplate(?w) ^ for(?w, ?l) ^ hasFile(?l, ?d)
+ve: for(?w, ?pw) ^ hasAuthorizedUse(?d, ?pdl) ^ equal(?pw, ?pd)</p>
      <p>Domain Specific Policy S1: “For data that contain dosage information, it is not
allowed that they are not first anonymized before being used for analysis.”
context:
usage:
hasLink(?w, ?l) ^ hasFile(?l,?d) ^ hasAttribute(?d, ?a) ^ Dosage(?a)
hasDestinationNode(?l, ?n) ^ hasComponent(?n, ?c) ^ DAComponent(?c)</p>
      <p>
        NULL
protection: -ve: anonymized(?d, ?aVal) ^ equal(?aVal, false)
correction: prompt [add an anonymization step right after (?d) found at (?l) ]
Suppose a researcher creates a simple workflow template that takes directly all the
raw clinical datasets and feeds them into a basic GMM clustering component to
perform a clinical study. The workflow system would find that policy G1 applies and
is respected. However, policy S1 is fired as the aggregate dataset fed to the
GMMbasic was found not to be anonymized. Fig. 3 shows the detection of the violation of
the policy S1. The workflow in Fig. 2 complies with all these policies. In [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] we
describe an interactive scenario where users would be assisted during workflow
construction to create workflows that comply with a set of privacy policies.
4
      </p>
      <sec id="sec-7-1">
        <title>Related Work</title>
        <p>
          To the best of our knowledge, there has not been prior work on extending
workflow systems with data privacy awareness. Some policy frameworks like KAoS
[
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and Rei [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] have recently been proposed for security and privacy on the
Semantic Web. To contrast with KAoS and Rei, our data privacy policies in data
analysis workflows need to refer to properties of data, components, etc. In addition,
the policies of concern are not credential-based ones as those in KAoS and Rei. Also,
the policies we use not only are aimed to detect violations but also to suggest
corrective actions in terms of how to fix the causes of violation.
5
        </p>
      </sec>
      <sec id="sec-7-2">
        <title>Conclusions</title>
        <p>In this paper, we motivated the need for a new type of privacy policies that
constrain processing on data. We described our initial work on a semantic approach to
represent privacy policies relevant to data analysis. We argued the validity of the
approach by showing how privacy-preserving data analysis processes can be defined
using ontologies, and how the ontologies can be combined with a policy framework to
represent the policies. We discussed how those policies can be applied via examples.
Future work includes conflict detection algorithms for the proposed policy framework
and incorporation of the policy enforcement module in the Wings system.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgement</title>
      <p>This research was supported in part by the Air Force Office of Scientific Research
(AFOSR) through grant FA9550-06-1-0031. The second author was a Visiting
Scholar at ISI, USC while this paper was written, and he thanks Hong Kong Baptist
University for a sabbatical leave.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hendler</surname>
            , J.,
            <given-names>O</given-names>
          </string-name>
          <string-name>
            <surname>'Hara</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shadbolt</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weitzner</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          “
          <article-title>A Framework for Web Science</article-title>
          .
          <source>” Foundations and Trends in Web Science</source>
          , Vol
          <volume>1</volume>
          , No 1 (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Weitzner</surname>
            ,
            <given-names>D.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hendler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Connolly</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Creating a Policy-Aware Web: Discretionary, Rule-Based Access for the World-Wide Web</article-title>
          . In Web and Information
          <string-name>
            <surname>Security</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Ferrari</surname>
            and
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Thuraisingham</surname>
          </string-name>
          (Eds), IRM Press (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Weitzner</surname>
            ,
            <given-names>D.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abelson</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T</given-names>
          </string-name>
          , Hanson,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Hendler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Kagal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>McGuinness</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.L.</given-names>
            ,
            <surname>Sussman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.J.</given-names>
            ,
            <surname>Waterman</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.K.</surname>
          </string-name>
          :
          <article-title>Transparent Accountable Data Mining: New Strategies for Privacy Protection</article-title>
          .
          <source>Technical Report</source>
          , MIT-CSAIL
          <string-name>
            <surname>-TR-</surname>
          </string-name>
          2006-007, MIT (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Sweeney</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Finding Lists of People on the Web</article-title>
          .
          <source>ACM Computers and Society</source>
          ,
          <volume>34</volume>
          (
          <issue>1</issue>
          ) (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , I.J.,
          <string-name>
            <surname>Deelman</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gannon</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Shields M.S</surname>
          </string-name>
          . (eds.).
          <source>Workflows for e-Science</source>
          . Springer Verlag (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Mandl</surname>
            ,
            <given-names>K.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szolovits</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Kohane</surname>
            ,
            <given-names>I.S.</given-names>
          </string-name>
          :
          <article-title>Public Standards and Patients' Control: How To Keep Electronic Medical Records Accessible But Private”</article-title>
          .
          <source>British Medical Journal</source>
          , Vol.
          <volume>322</volume>
          , No.
          <volume>7281</volume>
          (
          <year>2001</year>
          )
          <fpage>283</fpage>
          -
          <lpage>287</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Deelman</surname>
            <given-names>E.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <source>Final Report of the NSF Workshop on the Challenges of Scientific Workflows</source>
          . (http://vtcpc.isi.edu/wiki/images/3/3a/NSFWorkflowFinal.pdf) (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Sweeney</surname>
          </string-name>
          , L.:
          <string-name>
            <surname>k-Anonymity</surname>
          </string-name>
          :
          <article-title>A Model For Protecting Privacy</article-title>
          .
          <source>International Journal on Uncertainty, Fuzziness and Knowledge-based Systems</source>
          ,
          <volume>10</volume>
          (
          <issue>5</issue>
          ),
          <year>2002</year>
          ;
          <fpage>557</fpage>
          -
          <lpage>570</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Clifton</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kantarcioglu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vaidya</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Tools for Privacy Preserving Distributed Data Mining</article-title>
          .
          <source>ACM SIGKDD Explorations</source>
          ,
          <volume>4</volume>
          (
          <issue>2</issue>
          ) (
          <year>2003</year>
          )
          <fpage>19</fpage>
          -
          <lpage>26</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ratnakar</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deelman</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehta</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kim</surname>
          </string-name>
          , J.:
          <article-title>Wings for Pegasus: Creating Large-Scale Scientific Representations of Computational Workflows</article-title>
          .
          <source>Proceedings of the 19th Annual Conference on Innovative Applications of Artificial Intelligence</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Ratnakar</surname>
          </string-name>
          , V.:
          <article-title>Semantic Metadata Generation for Large Scientific Workflows</article-title>
          .
          <source>In Proceedings of the Fifth International Semantic Web Conference</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Cheung</surname>
            ,
            <given-names>W.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wong</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            And
            <surname>Tong</surname>
          </string-name>
          ,
          <string-name>
            <surname>F:</surname>
          </string-name>
          <article-title>Service-oriented Distributed Data Mining</article-title>
          .
          <source>IEEE Internet Computing</source>
          ,
          <volume>10</volume>
          (
          <issue>4</issue>
          ) (
          <year>2006</year>
          )
          <fpage>44</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Cheung</surname>
            ,
            <given-names>W.K.</given-names>
          </string-name>
          , and Gil.,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          :
          <article-title>Towards Privacy Aware Data Analysis Workflows for e-Science</article-title>
          .
          <source>Proceedings of 2007 Workshop on Semantic e-Science</source>
          (
          <article-title>SeS2007), held in conjunction with the Twenty-Second Conference of the Association for the Advancement of Artificial Intelligence (</article-title>
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Bradshaw</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uszok</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jeffers</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suri</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burstein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Acquisti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benyo</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Breedy</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carvalho</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diller</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Johnson,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Kulkarni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Lott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Sierhuis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            and
            <surname>Van Hoof</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          :
          <article-title>Representation and Reasoning For DAML-based Policy and Domain Services in KAoS and Nomads</article-title>
          .
          <source>In Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems</source>
          . ACM Press, New York (
          <year>2003</year>
          )
          <fpage>835</fpage>
          -
          <lpage>842</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Kagal</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A Policy Language for Pervasive Systems</article-title>
          .
          <source>In Proceedings of the Fourth IEEE International Workshop on Policies for Distributed Systems and Networks</source>
          , (
          <year>2003</year>
          )
          <fpage>63</fpage>
          -
          <lpage>76</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>