<!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>Evaluation and Selection of Context Information</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maria Chantzara</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Miltiades Anagnostou</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Networks Laboratory, School of Electrical &amp; Computer Engineering, National Technical University of Athens (NTUA)</institution>
          ,
          <addr-line>9 Heroon Polytechniou Str, 157 73 Zografou, Athens</addr-line>
          ,
          <country country="GR">GREECE</country>
        </aff>
      </contrib-group>
      <fpage>73</fpage>
      <lpage>84</lpage>
      <abstract>
        <p>The easy creation of context-aware services requires the support of management facilities that provide ways to more easily acquire, represent and distribute context information. The contribution of this paper refers to the challenge of evaluating and selecting the context information that is used by the services. It proposes an approach that trades off economic cost, user preferences and offered context information. According to this, there is no need to know beforehand the context providers to obtain the required information, but a more ad-hoc discovery and organization of the providers is envisioned.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The advances in wireless communications and user mobility have given quite a boost
to the research about new classes of applications, namely the Context-Aware Services
(CASs) that get aware of the execution environment such as location, time, user’s
activities, devices’ capabilities in order to tune their intended functionalities and adapt
to the changing environment and user requirements. The development and
provisioning of CASs need to be supported by management facilities capable of
collecting, manipulating, reasoning and disseminating context information. In this
respect, researchers have been building tools and architectures to tackle these issues
and facilitate the easy creation of CASs. The contribution of this paper refers to the
challenge of evaluating and selecting the context information to be used by the CASs.</p>
      <p>As research on context-awareness evolves, new context sources are expected to
come and go rapidly, and context requests will increase. To make matters worse,
among the available context information sources, there are sets of sources that provide
information referring to the same entity, but are produced based on different sensing
technology or/and processing technique under the administration of different business
entities. As a result, even though the information may refer to the same entity, it
varies in its update frequency, its accuracy, its format of representation, and its price.
Moreover, the sensed context information can be inaccurate or unavailable due to
sensor or connectivity failures, while user-supplied information is subject to human
error and staleness. The reliance of CASs to imperfect information can often cause
usability problems [0]. On the other hand, CASs are characterized by a higher level
of mobility since CAS users tend to move among different heterogeneous
environments where different context providers operate and provide information.</p>
      <p>Furthermore, the provisioning of the same context information with different
characteristics calls for advanced personalization features that can lead to the
provisioning of sophisticated CASs. Specifically, during subscription the user enters
the parameters that personalize the service operation. These parameters form the
user’s service profile that encompasses his/her needs from the CAS. For example, a
user that subscribes to a context-aware restaurant finder service could specify that
he/she wishes the weather conditions to be taken into account in contrast to another
user that just wants to find what are the restaurants in the city that match his/her taste
preferences. In addition to the profile, the user identifies the price ceiling for the
personalized service provisioning and awaits best possible service delivery within
his/her price range [2]. From service management point of view this connotes a
complete inversion: not the service defines the price but the price causes the type of
service provisioning. The price ceiling along with the subscription parameters
determines the type of service to be offered and the information to be obtained.</p>
      <p>As a consequence of the aforementioned issues, a new challenge referring to the
evaluation and dynamic selection of the context information to be utilized by the
CASs arises. Even though many research efforts [3] have been conducted to specify
and materialize frameworks and toolkits for context-awareness, these efforts lack to
deal with the provisioning of CASs in multiple environments that reveals the
necessity to elaborate on issues that have to do with the collection of data from
multiple context sources maintained by different administrative entities [4]. In
addition, these efforts either assume that CASs rely on the context information that is
accurate and up-to-date [5], not taking into consideration the quality of context
information at all, or just deal with data quality as properties of the information to be
collected [6]. Additionally, many researchers try to deal with imperfect context
utilizing various techniques mostly coming from artificial intelligence consuming
resources. A careful assessment trading-off their success in removing context
ambiguity and their cost should be made in order to determine whether these
techniques worth be used on behalf a specific CAS.</p>
      <p>In this paper, we explore a novel approach for the evaluation and selection of
context providers that tries to balance quality of information, economic cost and user
preferences. This approach requires the enhancement of context management
frameworks with the Context Matching Engine (CME) that performs the proposed
multicriteria decision making. Therefore, there is no need to know beforehand the
providers to obtain the required information, but a more ad-hoc discovery and
organization of the context providers is envisioned. It also enables flexibility to
failures of context providers or appearance of new ones. In the rest of the paper, we
present the proposed approach. The paper is organized as follows: In Section 2 the
functionality of Context Matching Engine is analyzed. In Section 3, the problem of
selecting the context information to be utilized by a CAS is modeled and formally
described. The problem solution and some initial results are presented in section 4.
Finally, Section 5 provides some conclusive remarks and future plans.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Context Matching Engine</title>
      <p>Context information goes through four lifecycle phases till a CAS can access it. The
first phase is context sensing that represents the acquisition of context from the
Context Information Sources e.g. sensors or network resources. Until the CASs can
actually use the data, context processing and dissemination take place. Context
processing includes the generation of high-level context information from primitive
data by enforcing functions of interpretation, filtering, aggregation and inference.
Context dissemination refers to the efficient distribution of context to the CASs. The
context lifecycle ends with the context usage that describes the utilization of context
by CASs in order to trigger the appropriate actions. The aforementioned phases
introduce new opportunities in the market arising out of the exploitation of context
information trade. The different business roles participating in CAS provision are
depicted in Fig.1.</p>
      <sec id="sec-2-1">
        <title>CAS Customer</title>
      </sec>
      <sec id="sec-2-2">
        <title>CCAASS PPrroovviiddeerr</title>
      </sec>
      <sec id="sec-2-3">
        <title>CCoonntteexxtt BBrrookkeerr</title>
      </sec>
      <sec id="sec-2-4">
        <title>CCoonntteexxtt PPrroovviiddeerr</title>
        <p>Context
Usage</p>
        <p>Context
Dissemination</p>
        <p>Context
Processing</p>
        <p>Context
Sensing</p>
        <p>Context</p>
        <p>Mgmt</p>
        <p>A CAS Provider is responsible for providing CASs to the customers/users and
managing them. The Context Provider deploys and operates the various Context
Information Services that communicate with the sources and sense or process
information. Finally, the role of Context Broker is responsible for handling the
distribution of context data to the CAS Providers or directly to the CASs. This role
provides efficiency and reduces time-to-market for CASs. CASs could interact with
the Context Providers to acquire the necessary context information, but this would
acquire more programming effort for the CAS developers. We have implemented
such architecture accommodating the role of Context Broker as part of our work in
the CONTEXT project [7]. According to this, the Context Broker offers the Context
Information Provider Interface that enables context providers to declare and supply
the context information they expect to provide and the Context Information User
Interface that enables CASs to request the information they want to consume. Context
Brokers act as a federation that cooperates to answer context requests. A common
model of context information is required so that producers and consumers of
information have the same understanding. For this reason, CONTEXT has introduced
the notion of Context Modules, which are XML-based descriptions containing the
properties of the context information supplied by the Context Providers. As in
datacentric approaches, it is not required CASs to name a specific Context Provider from
which they wish to retrieve some information but just the information they wish to
obtain. Finally, the Context Broker is responsible for discovering and then interacting
with the appropriate information producer at runtime.</p>
        <p>As it is already mentioned in previous section, the richness of context information
gathered from sensors and human users as well as the need to execute CASs in
multiple environments require decision-making regarding the exact information that a
CAS should use. In order to tackle these issues, we introduce the Context Matching
Engine (CME) operating in each domain under the administration of Context Broker.
The selection balances the fulfillment of the service objectives defined by the users
and the services, and the constraints imposed by the given price ceiling. In order to
perform the selection of context information, the CME accommodates the process of
Context Validation that monitors the validity of the offered context information and
concludes about the fidelity and the time response of the context producer as well as
the Context Evaluation process that considers the selected service profile, the user
subscription data, and the outcomes of the context validation process and computes
the expected utility of each offered context information. The results of the
aforementioned processes along with the imposed constraints facilitate as input data
to a decision-making algorithm that determines the appropriate information to be
utilized by the context-aware service. It should be mentioned that after the selection is
made, the CME monitors the status of the offered context information and decides the
switch of context providers on behalf of the CAS when new context providers are
registered or one of the already selected fails or one of the non selected is upgraded.
The logical decomposition of the CME is depicted in Fig. 2.</p>
        <p>Person1
CAS SP</p>
        <p>Person1</p>
        <p>Person1
CAS SP</p>
        <p>CAS</p>
        <p>SP
Context Information User Interface</p>
        <p>Context Selection
Context Validation</p>
        <p>Process</p>
        <p>Context Evaluation</p>
        <p>Process
Context Information Provider Interface</p>
        <p>DQ</p>
      </sec>
      <sec id="sec-2-5">
        <title>Context</title>
      </sec>
      <sec id="sec-2-6">
        <title>Provider</title>
        <p>DQ</p>
      </sec>
      <sec id="sec-2-7">
        <title>Context</title>
      </sec>
      <sec id="sec-2-8">
        <title>Provider</title>
        <p>…
DQ</p>
      </sec>
      <sec id="sec-2-9">
        <title>Context</title>
      </sec>
      <sec id="sec-2-10">
        <title>Provider</title>
        <p>Context providers utilize the “Context Information Provider Interface” offered by
the Context Broker to register the type of information they provide accompanied with
the data quality attributes (DQ) that characterize it. The different nature of the context
information complicates the identification of general quality parameters [8].
Considering work in [9],[10], we conclude to the following attributes that characterize
context information and may affect context-aware service behavior: (a) Accuracy: It
describes how the information describes the reality. It depends on the resolution
pattern that is used and the smallest perceivable element. (b) Precision: It describes
the degree of confidence that the given value of context and the corresponding
accuracy is given. It shows how often context information is unintentionally wrong
because of internal problems. (c) Time refresh: It describes the time period that a new
measurement of the specific data attribute is done. It is of special interest for the case
that the information is highly dynamic in time. (d) Time sample: This attribute
describes the exact time point that the value has been obtained. It is obvious that the
complete list of attributes does not refer to all types of context information.
Specifically, it mostly characterizes dynamic information that changes frequently over
time and is produced by physical or logical sensors. On the other hand, the quality of
static information such as user’s profiles and preferences is determined by the time
sample. Additionally, it is essential to determine some quality parameters that
characterize the producers of the information and vary with time, network topology
and characteristics. These are: (a) Fidelity: It depicts the ambiguity of the registration
parameters that the context provider specifies. In specific, it is a probability of
correctness that is calculated by the Context Validation Process based on the previous
behavior of the context provider. Accordingly, those producers that have not been
detected as incorrect tend to be more trusted by the consumers. Therefore, statistics of
context provider’s behavior need to be gathered in order to determine its fidelity. (b)
Time response: It corresponds to the time interval that is required by the producer of
information in order to reply to the application’s request. It is particularly useful for
time criticality issues. Apart from the technical details of the context provider, this
parameter depends to the topological properties of context consumer and provider and
the intermediate Context Brokers.</p>
        <p>CASs utilize the “Context Information User Interface” and declare the context
information to be retrieved as specified by the service profile (SP). Along with the
context information to be collected, the services indicate the constraints regarding the
data quality of the context information, as well the time reaction of the service and the
economic cost. In addition to these, the CAS also specifies the service policies that
describe how CME should behave in case user requirements can not be satisfied by
the available context sources. In response to the context request, the CME triggers the
Context Evaluation Process that evaluates the available context sources and finally the
optimal sources to provide the requested data is determined. Based on this decision
the appropriate source is contacted and the required data are retrieved.The context
sources deliver the requested piece of information accompanied with its quality
characteristics in order that the information is verified. Furthermore, the service is
informed about the information characteristics in order to be able to adapt its behavior
accordingly e.g. inform the user that the context information is possibly inaccurate or
imprecise. The time sample or timestamp that describes the production time of the
data is also provided. By monitoring the behaviour of the context providers and
comparing the quality attributes that each of them gives during registration phase with
the ones accompanying the context data, the Context Validation Process estimates the
fidelity and the time response. This estimation per each context provider facilitates the
optimal context source selection of the next context requests.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Context Information Selection Problem</title>
      <p>In this section we formulate the optimization problem referring to the selection of
context information. The problem objective is to find the preferable context provider
to acquire the needed context that results to the maximization of the expected utility.
Our model exploits the following input data: First, the selected service profile in order
to obtain the properties of context information to be gathered; Second, the upper
bound of the economic cost as identified by the CAS customer to be spent for
information gathering; Third, the context information provided by the available
context sources and the cost for obtaining it. Additionally there are constraints
referring to the maximum time and cost for obtaining the required context.
4.1</p>
      <sec id="sec-3-1">
        <title>Formal Problem Description</title>
        <p>The market of context information consists of the set of context providers CPij that
sell context information Iij that is of type i  1, N , where N is the total number of
the available context items, and of the data quality j  (1, M i ) , where M i denotes the
total number of the available quality levels of context items of type i. For every I ij
and the corresponding CPij , the quality properties, depicted in Table 1, are defined.</p>
        <sec id="sec-3-1-1">
          <title>Accuracy of I ij measured by the same metric units as I ij</title>
        </sec>
        <sec id="sec-3-1-2">
          <title>Precision of I ij measured by probability</title>
          <p>Time refresh of I ij measured by time metrics</p>
        </sec>
        <sec id="sec-3-1-3">
          <title>Time sample of I ij measured by date and time metrics</title>
        </sec>
        <sec id="sec-3-1-4">
          <title>Time response of CPij measured by time metrics</title>
        </sec>
        <sec id="sec-3-1-5">
          <title>Fidelity of CPij measured by probability Therefore, for each I ij and CPij , i  1, N , j  (1, M i ) we define the Information Quality Properties Vector IQPVij Aij , Prij ,Trij ,Tsij ! and the Context Provider</title>
        </sec>
        <sec id="sec-3-1-6">
          <title>Quality Properties Vector CPPVij</title>
        </sec>
        <sec id="sec-3-1-7">
          <title>Trespij , Fij ! . Finally, Pij represents the cost of purchasing information I ij .</title>
          <p>During the subscription phase, the CAS customer selects one of the predefined
service profiles and enters the parameters that customize the service. The selected
service profile requires the acquisition of L specific context items of
^ k1, k2 ,..., k`L  1, N types. For each k z , z  (1, L) requested context item the
Acceptable Properties Vector APVkz A max kz ,Tr max kz is specified as well as the
Properties Weight Vector PWV kz akz , bkz , ckz , d kz , ekz , f kz , that weight the
importance of quality in terms of accuracy, precision, time validity, producer’s time
response and fidelity and comply with the following equation:
akz bkz ckz d kz ekz f kz 1 . Both APV and PWV are determined by statistics
produced by the provisioning of the service. Moreover the CAS customer specifies
the amount of money that the specific CAS subscription should cost him/her. Based
on this value, the maximum cost Pmax of purchasing the necessary context
information is calculated. Furthermore, the selected service profile suggests the upper
bound of the time period Tmax for obtaining the information. The problem’s input data
are summarized in Table 2.</p>
          <p>Having described the parameters of the problem, a formal statement of the problem
is as follows: “Given a market of context information consisting of the set of context
providers CPij ( i  1, N , j  (1, M i ) ) that they are selling context information I ij , the
corresponding characteristics such as the quality vectors IQPVij and CPPVij , the cost
Pij for obtaining information I ij , a finite number of L context items of distinct types
forming the set ^ k1, k2 ,..., k`L  1, N that need to be obtained for the CAS that
operates under a specific service profile, the constraints imposed by the selected
service profile depicted with the vectors APVkz , PWVkz k z , z  (1, L) as well as the
maximum acceptable amount of money Pmax that can be spent for purchasing the
required context information and the maximum acceptable time frame Tmax for
obtaining the information, the objective is to determine the context producers that will
provide the required information so as to maximize the expected utility under the
constraints imposed by the service profile.”
4.2</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Mathematical formulation</title>
        <p>The Utility Function U I ij</p>
        <p>computes the utilization of information Iij for the
specific service and service profile and is comprised by six factors that measure the
utility in terms of accuracy, precision, time validity, producer’s time response and
fidelity. The utility function increases as the context item is more accurate, precise, as
it is quicker available to the context consumer, and as it remains valid for a longer
period. Regarding accuracy and time refresh, the utility of a context item increases as
the properties Aij ,Trij decrease respectively. The formulation of the factors considers
the quality constraints imposed by the selected service profile, namely A maxi ,Tr maxi .
The factors take values in [0,1] and are listed below:
- U A (I ij ) 1 Aij , measuring utility in terms of accuracy.</p>
        <p>A maxi
- UPr (Iij ) Prij , measuring utility in terms of precision
- UT I ij
- UTresp I ij
- UTr Iij
1
1</p>
        <p>Tcurrent</p>
        <p>Tsij
Trij</p>
        <p>Trespij or</p>
        <p>UT I ij
1
max</p>
        <p>Tcurrent
k i, j Mi</p>
        <p>Tcurrent</p>
        <p>Tsij</p>
        <p>Tskj
, measuring
Tmax
Trij
k i, j 1
utility of dynamic and static context information in terms of time validity.
1 Trespij , measuring utility in terms of producer’s time response.</p>
        <p>, measuring utility in terms of time refresh.</p>
        <p>Tr maxi</p>
        <p>Fij , measuring utility in terms of producer’s fidelity
- U F Iij
The utility function of Iij taking into account the ranking of the utility factors as
suggested by the selected service profile PWVi
ai , bi , ci , di , ei , fi , is formulated as
in the following:</p>
        <p>U Iij aiU A Iij biU Pr Iij ciUT Iij diUTresp Iij eiUTr Iij fiU F Iij</p>
        <p>In case a quality attribute is not available for the specific context item, the
corresponding utility factor equals zero. For example, for the static information the
utility function depends only on the time validity of the information, the response
time and the fidelity of the producer.</p>
        <p>Taking into account the formal description of the problem, the utility function that
has to be maximized is the following:
xij  ^ 0,1` is the decision variable describing if the information of type i is being
acquired from the context producer CPij or not. Moreover, the following constraints
should be met in order to find the optimal solution:</p>
        <p>UF ¦ ii¦ kk1L j mU Iij xij</p>
        <p>j 0
¦ ii¦ kk1L jj 0Mi P x d Pmax</p>
        <p>ij ij
¦ ii¦ kk1L jj 0mTrespij xij d Tmax
i  ^ k1, k2 ,..., k`L , ¦
jj 0Mi xij</p>
        <p>1
i  ^ k1 , k 2 ,..., k`L , ¦</p>
        <p>
          jj 0M i Aij xij d A max i
i  ^ k1, k2 ,..., k`L , ¦
jj 0Mi Trij xij d Tr max i
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
(
          <xref ref-type="bibr" rid="ref4">4</xref>
          )
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5 Problem Solution and Results</title>
      <p>An important class of combinatorial optimization problems is the Knapsack Problem
[11] and its variants. Numerous problems of different fields such as capital budgeting,
cargo loading and resource allocation are modeled as a variant of the knapsack
problem. The objective of the original Knapsack Problem is to optimize resource
allocation, or more precisely, how to distribute a fixed amount of resources among
several actions in order to obtain a maximum payoff. Due to the high applicability of
it, it has been widely studied and many algorithms for solving it have been proposed.
The problem of context provider selection that has been analyzed in the previous
section belongs to the category of Multi-Choice Multi-Dimensional Knapsack
Problem (MMKP). The definition of MMKP is: There are n groups of items. Group i
contains li items. Each item has a particular value and it requires m resources. The
objective is to pick exactly one item from each group in order to achieve maximum
total value of the collected items, subject to the m resource constraints. In the case of
the context provider selection problem, each group represents a requested type of info
while the items in it represent the available context items. The resource constraints
refer to the cost and the required time for obtaining the information. Finally, the value
that needs to be maximized is the expected utility of the picked context items.</p>
      <p>
        According to our current work, in order to select the context providers for
acquiring the requested information, we apply an exhaustive algorithm. This
algorithm computes all possible combinations in order to find the optimal one.
Regarding the case that no feasible solution can be found due to constraints (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) or (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ),
the service policies are considered in order to relax the relevant constraint, namely
increase Pmax or Tmax respectively. In case there is no available context item satisfying
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) or (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) to be obtained for a specific context request for information i, CME selects
the one that is expected to provide better satisfaction to the user, namely the one that
minimizes the violation of (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) and (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ).
      </p>
      <p>In order to demonstrate the proposed approach, we have performed some
simulations of a simple context-aware restaurant finder service. Utilizing the
exhaustive approach, the context information that is offered by the context providers
is evaluated and finally the appropriate ones that best satisfy the customized service’s
is selected. The CAS scenario considers the user’s preferences along with user’s
location in order to determine the appropriate restaurant for the user to have lunch. In
case that the user would like weather conditions, namely temperature information, to
be also taken into account, the service retrieves location information of the user and
based on this data, it also collects the temperature information. In the Table 3, the
properties of the offered location and temperature information are shown.</p>
      <p>The CAS provider specifies the following weights regarding the gathering of
location and temperature information for the specific CAS:
PWV1={0.4,0.05,0.2,0.1,0.2,0.05} and PWV2= {0.2,0.05,0.3,0.1,0.3,0.05}. Regarding
location information, accuracy is of higher importance while regarding temperature
information accuracy and time specific properties have almost the same importance.
We consider two users A and B: User A wishes that temperature information is taken
into account while he/she does not have any requirements regarding the restaurant’s
location. In this case, the CAS is expected to work well if it retrieves user’s location
information with low quality as well as the temperature information of the town that
hosts the user. On the other hand, User B wishes to find the nearest restaurant that
matches his/her preferences. Therefore, for this user the service requires user’s
location information with greater detail. The two users select the corresponding
profiles that match their needs. The imposed constraints are: APV1= {1000, 240},
APV2= {3,10} for User A and APV1= {5,20} for User B. The price ceilings that are
defined by each user are P= 100, 170 respectively, while the maximum time response
is Tmax=4sec. Table 2 shows the expected Utility per context item for User A.
I11
0,995</p>
      <p>
        I12
0,9
For User A, our approach concludes to the acquisition of information I16 and I22. In
this case, the quality function (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is maximized with value 0,386+0,597=0,983 while
all constraints are also satisfied. This solution costs 90. If we only considered the
constraints APV1, APV2 to perform the selection, the information that would be used
is I16 and I26, achieving total quality 0,949+0,307=1,256 with cost 60. However, this
solution would not satisfy constraint (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ). For User B, only I11 and I15 satisfy (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) or (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
constraints, and represent feasible solutions. Our approach decides that the optimal
choice is information I11 with utility 0,459 and cost 150. The highest utility is 0,79 and
is achieved by I15. However, this is not a feasible solution because it costs 190.
      </p>
      <p>The presented service scenario represents the initial evaluation of the proposed
model. The achievements from integrating context selection feature in context
management frameworks include the reduction of CAS’s cost and the imposed
network traffic for collecting information. Additionally, it is expected that both
service’s performance and user’s experience from service usage will be improved.
The computation complexity of the exhaustive algorithm isO M1 x M 2 x ... x M L . If we
assume that all groups of information have equal size M context items, the
computational complexity is O M L . Therefore, the exhaustive algorithm requires
high computation time and can prove critical for the context-aware services that
require real time decision making. As the number of context sources and context
requests increase, the required time for concluding to the selection increases. For this
reason, in our further work we intend to elaborate on algorithms that will optimize the
computational complexity. In [12],[13],[14] there are presented some heuristics for
solving the MMKP that can be exploited.</p>
      <p>6</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Plans</title>
      <p>This paper proposed a novel approach for ad-hoc discovery and organization of the
context providers supported by the Context Matching Engine that performs the online
evaluation and dynamic selection of context. The description of the proposed model
and an initial evaluation of it have been presented. New context sources can be added
on-the-fly, while the chosen approach also caters for the provision of different
versions of the same information type, with different update frequency, accuracy,
format of representation, and price, an especially useful feature for highly mobile
users, moving between different heterogeneous environments as well as unsteady
context sources. Our plans for future work in this area include the use of heuristics for
the optimization of the computational time, the development of an interactive context
quality agreement, and an intelligent context quality monitoring mechanism for
critical applications. Finally, we intend to demonstrate the benefits of our model
utilizing a real-life context-aware service.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Henricksen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Indulska</surname>
          </string-name>
          , J.:
          <source>Modelling and Using Imperfect Context Information. Reasoning and Management associated with the Sixth International Conference on Ubiquitous Computing (UbiComp</source>
          <year>2004</year>
          ). Nottingham/England. (
          <year>September 2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Hegering</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kupper</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Linnhoff-Popien</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reiser</surname>
          </string-name>
          , H.:
          <article-title>Management Challenges of Context-Aware Services in Ubiquitous Environments</article-title>
          . In: M.
          <string-name>
            <surname>Brunner</surname>
          </string-name>
          , A. Keller (Eds.):
          <source>Self-Managing Systems. 14th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management (DSOM</source>
          <year>2003</year>
          ). Heidelberg. Germany. (
          <year>October 2003</year>
          ). Springer-Verlag. Vol.
          <volume>2867</volume>
          . pp.
          <fpage>246</fpage>
          -
          <lpage>259</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Xynogalas</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chantzara</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sygkouna</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vrontis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roussaki</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anagnostou</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Context Management for the Provision of Adaptive Services to Roaming Users</article-title>
          .
          <source>IEEE Wireless Communications. (April</source>
          <year>2004</year>
          ). Vol.
          <volume>11</volume>
          . No.
          <issue>2</issue>
          . pp.
          <fpage>40</fpage>
          -
          <lpage>47</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Meneses</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Context Management for Heterogeneous Administrative Domains</article-title>
          . A.
          <string-name>
            <surname>Ferscha</surname>
          </string-name>
          et al. (eds.) Advances in Pervasive Computing. Austrian Computer Society. Austria. (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dey</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Providing Architectural Support for Building Context-Aware Applications</article-title>
          .
          <source>PhD thesis</source>
          . College of Computing. Georgia Institute of Technology (
          <year>December 2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Judd</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steenkiste</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Providing Contextual Information to Pervasive
          <source>Computing Applications. ǿ n Proceedings of the 1st IEEE International Conference on Pervasive Computing and Communications (PerCom'03)</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. CONTEXT:
          <article-title>Active Creation, Delivery and Management of efficient Context Aware Services</article-title>
          . IST-2001
          <string-name>
            <surname>-</surname>
          </string-name>
          38142- CONTEXT. http://context.upc.es
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Henricksen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Indulska</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rakotonirainy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Modeling Context Information in Pervasive Computing Systems</article-title>
          .
          <source>In Proceedings of the 1st International Conference on Pervasive Computing</source>
          ,
          <year>Pervasive 2002</year>
          . Springer-Verlag. Vol.
          <volume>2414</volume>
          , pp.
          <fpage>169</fpage>
          -
          <lpage>180</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Pipino</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Data Quality Assessment</article-title>
          .
          <source>Communications of the ACM (April</source>
          <year>2002</year>
          ). Vol.
          <volume>45</volume>
          , No. 4. pp.
          <fpage>211</fpage>
          -
          <lpage>218</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Buchholz</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Küpper</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schiffers</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Quality of Context: What it is and Why We Need It</article-title>
          .
          <source>In Proceedings of the Workshop of the HP OPenView University Association</source>
          <year>2003</year>
          (
          <article-title>HPOVUA 2003)</article-title>
          .
          <source>Genevy. (July</source>
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kellerer</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pferschy</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pisinger</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Knapsack Problems. Springer.
          <source>ISBN: 3-540- 40286-1</source>
          . p.
          <fpage>546</fpage>
          .(
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Khan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>E</given-names>
          </string-name>
          , Akbar,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Quality Adaptation in a multi-session adaptive multimedia system: model, algorithms and architecture</article-title>
          .
          <source>PhD Thesis</source>
          , Department of Electronical and Computer Engineering, University of Victoria, Canada. (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Moser</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jokanovic</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shiratori</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          :
          <article-title>An Algorithm for the multidimensional multiplechoice knapsack problem</article-title>
          .
          <source>IECE Trans Fundamentals Electron</source>
          , vol.
          <volume>80</volume>
          . pp:
          <fpage>582</fpage>
          -
          <lpage>589</lpage>
          . (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Hifi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Micrafy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sbihi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Heuristic algorithms for the multiple-choice multidimensional knapsack problem</article-title>
          .
          <source>Journal of the Operational Research Society</source>
          . vol.
          <volume>55</volume>
          . pp:
          <fpage>1323</fpage>
          -
          <lpage>1332</lpage>
          . (
          <year>December 2004</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>