International Conference Papers

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/4

Browse

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    CSP-based adaptation of multimedia document composition
    (Mohan S. Kankanhalli, Tao Li, Wei Wang, 2015-02) Maredj, Azze-Eddine; Tonkin, Nourredine
    We propose an approach for the dynamic adaptation of multimedia documents modeled by an over-constrained constraint satisfaction problem (OCSP). In addition the solutions that it provides for the problem of determining the relations that do not comply with the user profile and the problem of the combinatorial explosion when searching for alternative relations, it insures a certain quality of service to the presentation of the adapted document: (i) If the required constraints are not satisfied, no document is generated, unlike other approaches that generates even if the presentation of the adapted document is completely different from the initial one, (ii) The definition of the constraints hierarchy (strong constraints and medium constraints) maintains as much as possible of the initial document relations in the adapted one. As result, the adapted presentations are consistent and close to those of the initial ones.
  • Thumbnail Image
    Item
    Weighting of the Conceptual Neighborhood Graph for Multimedia Document Temporal Adaptation
    (2010-12) Maredj, Azze-Eddine; Tonkin, Nourredine
    In the approaches of the semantic adaptation of a multimedia document, where this last is represented by an abstract structure of a relations graph that expresses all the relations that exist between its contained media objects, the adaptation consists in modifying this abstract structure in a minimal way to lead it to satisfy the target profile. The profile defines constraints that must be satisfied by the document to be played. At this level, the transgressive adaptation becomes necessary when no specification model exists to satisfy this profile. In this paper, we propose a conceptual neighborhood graph based approach where the weighting of this graph is also proposed for from one side, reduce substantially the adaptation time and from the other side, find the closest substitution relations to those to be replaced.