fixed build

macro.tex

@@ -9,7 +9,7 @@
 \newcommand{\coalition}[1]{\ensuremath{C_{#1}}}
 \newcommand{\org}[1]{\ensuremath{o_{#1}}}
 \newcommand{\Org}[1]{\ensuremath{O_{#1}}}
-\newcommand{\s[1]}{\ensuremath{s_{}}}
+\newcommand{\s}[1]{\ensuremath{s_{#1}}}
 \newcommand{\si}[1]{\ensuremath{s_{#1}}}
 \newcommand{\sii}[1]{\ensuremath{s'_{#1}}}
 \newcommand{\dataset}[1]{\ensuremath{D_{#1}}}

pipeline_instance_example.tex

@@ -6,12 +6,12 @@
 
 As presented in Table~\ref{tab:exisnt}(a), each vertex is labeled with policies (column \emph{candidate--$>$policy}), and then associated with different candidate services (column \emph{candidate}) and corresponding profile (column \emph{profile}). The filtering algorithm matches each candidate service profile with the policies in Table~\ref{tab:anonymization} annotating the corresponding vertex. It returns the set of services whose profile matches a policy (column \emph{filtering}):
 \begin{enumerate*}[label=\textit{\roman*})]
-  \item vertex \vi{5}, the filtering algorithm produces the set $S'_1=\{s_{51},s_{52}\}$. Assuming that the dataset owner is ``CT'', the service profile of \s_{51} matches \p{1} and the one of \s_{52} matches \p{2}. For \s_{53}, there is no policy match and, thus, it is discarded;
-  \item vertex \vi{6}, the filtering algorithm returns the set $S'_2=\{s_{62},s_{63}\}$. Assuming that the dataset region is ``CT'', the service profile of \s_{62} matches \p{5} and the one of \s_{63} matches \p{6}. For \s_{61}, there is no policy match and, thus, it is discarded;
+  \item vertex \vi{5}, the filtering algorithm produces the set $S_{1}=\{s_{51},s_{52}\}$. Assuming that the dataset owner is ``CT'', the service profile of \s{51} matches \p{1} and the one of $\s{52}$ matches \p{2}. For $\s{53}$, there is no policy match and, thus, it is discarded;
+  \item vertex \vi{6}, the filtering algorithm returns the set $S'_2=\{s_{62},s_{63}\}$. Assuming that the dataset region is ``CT'', the service profile of $\s{62}$ matches \p{5} and the one of $\s{63}$ matches \p{6}. For $\s{61}$, there is no policy match and, thus, it is discarded;
   \item vertex \vi{7}, the filtering algorithm returns the set $S'_3=\{s_{71},s_{72}\}$. Since policy \p{7} matches with any subject, the filtering algorithm keeps all services.
 \end{enumerate*}
 
-For each vertex \vii{i}, we select the matching service \sii{j} from $S'_i$ and incorporate it into a valid instance. For instance, we select \s_{51} for \vi{5}; \s_{62} for \vi{6}, and \s_{71} for \vi{7}
+For each vertex \vii{i}, we select the matching service \sii{j} from $S'_i$ and incorporate it into a valid instance. For instance, we select $\s{51}$ for \vi{5}; $\s{62}$ for \vi{6}, and $\s{71}$ for \vi{7}
 as depicted in \cref{tab:instance_example_valid}(a) (column \emph{instance}). We note that to move from a valid to an optimal instance, it is mandatory to evaluate candidate services based on specific quality metrics that reflect their impact on data quality, as discussed in the following of this paper.
 %In the next sections, we will introduce the metrics that we use to evaluate the quality of services and the results of the experiments conducted to evaluate the performance of our approach.