— This paper presents the progress and final state of CAIN-21, an extensible and metadata driven multimedia adaptation in the MPEG-21 framework. CAIN-21 facilitates the integration of pluggable multimedia adaptation tools, automatically chooses the chain of adaptations to perform and manages its execution. To drive the adaptation, it uses the description tools and implied ontology established b...

In this paper, we present our work on two aspects of multimedia adaptation: knowledge-based single media adaptation and semantic adaptation of multimedia documents. For the former, we propose support of adaptation by direct hinting in the scope of MPEG-21. For the latter, which is the main part of the presented work, we introduce the description of semantic dependencies between media objects of...

Within an MPEG-21 architecture, the two key concepts are the Digital Item, representing multimedia content, and Users, interacting with this content. MPEG-21 introduced Digital Item Processing to allow content authors to describe suggested processing of their Digital Items. It standardizes ways to insert functionality into a Digital Item, as such, creating a dynamic and interactive multimedia f...

Abstract Aim The aim of this retrospective study was to analyse the discrepancy between preoperative MRI staging and post-operative histopathology rectal cancer patients who had primary surgery. Methods A cohort analysed records 47 with histology confirmed over period 5 years from 2017 2022. Data collected hospital database. Results Forty-seven were evaluated. mean age presentation 72 years. Ou...

Genetic modification of whole-cell cancer vaccines to augment their efficacies has a history of over two and a half decades. Various genes and gene combinations, targeting different aspects of immune responses have been tested in pursuit of potent adjuvant effects. Here we show that co-expression of two cytokine members of the common cytokine receptor γ-chain family, IL-21 and IL-7, in whole-ce...

Let L(n, d) denote the minimum possible number of leaves in a tree order n and diameter d. Lesniak (1975) gave lower bound B(n,d) = ⌈2(n − 1)/d⌉ for L(n,d). When d is even, But when odd, smaller than L(n,d) general. For example, B(21, 3) 14 while L(21, 19. In this note, we determine using new ideas. We also consider converse problem with given leaves.