Information Technology Reference
In-Depth Information
(a) we require each module to be classified (directly or indirectly) to a particular
class, so we define certain facets and require classification with respect to these
(furthermore some of the attributes of these classes could be mandatory),
(b) we define some dependency types as mandatory and provide notification ser-
vices returning all those objects which do not have any dependency of that
type,
(c) we require that the dependencies of the objects should (directly or indirectly)
point to one of several certain profiles.
Below we elaborate on policy (c).
u,
if
Nr
∗
(
→
t
)
∩
Definition 5
A module
t
is
related
withaprofile
u
, denoted by
t
Nr
∗
(
T
(
u
))
=
Ø
This means that the direct/indirect dependencies of a module
t
lead to one or
more elements of the profile
u
. At the application level, for each object
t
we can
show all
related
and
unrelated
profiles, defined as:
)
=
{
}
RelProf
(
t
u
∈
U
|
t
→
u
and
UnRelProf
(
t
)
= {
u
∈
U
|
t not
→
u
}
respectively .
Note that
Gap(t, u)
is empty if either
t
does not have any recorded dependency
or if
t
has dependencies but they are known by the profile
u
. The computation of the
related profiles allows the curators to distinguish these two cases (
RelProf(t)
=
Øin
the first and
RelProf(t)
=
Ø in the second).
RelProf(t)
then this is just an indication that
t
has been described with
respect to profile
u
, but it does not guarantee that its description is complete with
respect to that profile.
If dependencies are interpreted disjunctively, to identify if a module is related
with a profile we can compute the intelligibility gap with respect to that profile
and with respect to an empty profile (a profile that contains no facts at all). Since
dependencies are disjunctive there might exist more than one intelligibility gaps, so
let
gap1
and
gap2
be the union of all possible intelligibility gaps or each case. If the
two sets contain the same modules (the same facts) then the module is not be related
with that profile. If
gap1
is a subset of
gap2
, this means that the profile contains
some facts that are used to decide the intelligibility of the module and therefore the
module is related with that profile.
As an example, Fig.
8.11
shows the disjunctive dependencies of a digital video
file regarding reproduction. Suppose that we want to find if that module is related
with the profile
u
which contains the module WindowsOS. To this end we must
compute the union of all intelligibility gaps with respect to
u
and with respect to an
empty profile,
gap1
and
gap2
respectively. Since there are two ways to reproduce
(i.e. render or play) the file, there will be two intelligibility gaps whose unions will
contain:
If
u
∈
