135 resultados para metadata schemes
Resumo:
En aquest treball es realitza una descripció dels llenguatges que constitueixen la base de la construcció de la Web Semàntica: l'XML, l'RDF i l'OWL. En concret, es realitza un estudi de la base de dades lèxica WordNet. Finalment, es presenta el disseny i la implementació d'una ontologia per representar les relacions lèxiques dels mots del català. A partir d'aquesta ontologia es crea una petita base de dades basada en la temàtica dels animals de companyia. Aquest cas pràctic permet extreure conclusions sobre els avantatges d'introduir metadades en els documents electrònics, i sobre les facilitats que ofereixen les aplicacions actuals pel desenvolupament d'aquest tipus de documents.
Resumo:
El present projecte final de carrera vol assolir un entorn web per a administrar un videoclub i que els usuaris puguin fer reserves on-line. Així dons l'aplicació es pot dividir en dos mòduls, un d'administració i un altre de gestió de reserves. La implementació s'ha fet sobre l'arquitectura J2EE, la qual proporciona totes les eines per fer una aplicació robusta i escalable.
Resumo:
Aquest projecte avalua diferents BD:XML natives per a desar i recuperar documents XML basats en l'estàndard MPEG-7. Es tracta d'un estàndard que proposa un llenguatge per descriure el contingut (metadades) de documents multimèdia, és a dir, àudio i vídeo. El seu format de representació és XML i es basa en un esquema ja predefinit (XMLSchema d'MPEG-7).
Resumo:
Aquest projecte vol estudiar la qualitat de les metadades presents en els documents que representen objectes de coneixement LOM (
Resumo:
En aquest projecte s'ha implementat una capa de persistència basada en metadades sota la plataforma .NET, utilitzant el llenguatge de programació C#.
Resumo:
La finalitat d'aquest projecte, consisteix en estudiar detalladament el funcionament del llenguatge d'intercanvi XMI (de l'anglès XML Metadata Interchange), cosí del XML, que transporta al seu codi especificacions del llenguatge UML, de manera que ens permet compartir i enviar aquest UML entre diferents plataformes i eines de manipulació d'aquest llenguatge.
Resumo:
Multimèdia, vídeo, foto, metadades, mediateca, catalogació, cerca, visualització, paraulesclau.
Resumo:
Actualmente se pretende que los ordenadores puedan entender la semántica de la información que hay en la Web y que sea posible integrar diversas fuentes de información independientemente de la procedencia y formato de éstas, haciendo así una Web Semántica. Uno de los mayores problemas que tiene la Web Semántica es la falta de contenidos semánticos, principalmente debido a la falta de métodos de anotación automáticos existentes. Una forma de resolver este problema se basa en esconder tras aplicaciones que la gente usa diariamente, como los juegos on-line, estos procesos de generación de metadatos semánticos. El objetivo de este proyecto es estudiar diferentes iniciativas que tratan de enmascarar la generación de metadatos semánticos a través de los juegos on-line y el desarrollo de un prototipo de casual game para anotar semánticamente recursos. Se trata de un juego sencillo de pregunta-respuesta, donde dos usuarios concurrentes contestan a preguntas preestablecidas y definidas dentro de una ontología de dominio, obteniendo puntos en aquellas preguntas donde hayan dado la misma respuesta.
Resumo:
Personalization in e-learning allows the adaptation of contents, learning strategiesand educational resources to the competencies, previous knowledge or preferences of the student. This project takes a multidisciplinary perspective for devising standards-based personalization capabilities into virtual e-learning environments, focusing on the conceptof adaptive learning itinerary, using reusable learning objects as the basis of the system and using ontologies and semantic web technologies.
Resumo:
Over the past year, the Open University of Catalonia library has been designing its new website with this question in mind. Our main concern has been how to integrate the library in the student day to day study routine to not to be only a satellite tool. We present the design of the website that, in a virtual library like ours, it is not only a website but the whole library itself. The central point of the web is my library, a space that associates the library resources with the student's curriculum and their course subjects. There the students can save the resources as favourites, comment or share them. They have also access to all the services the library offers them. The resources are imported from multiple tools such as Millennium, SFX, Metalib and Dspace to the Drupal CMS. Then the resources' metadata can be enriched with other contextual information from other sources, for example the course subjects. And finally they can be exported in standard, open data formats making them available for linked data applications.
Resumo:
IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection
Resumo:
This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics
Resumo:
In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio
Resumo:
This paper focuses on QoS routing with protection in an MPLS network over an optical layer. In this multi-layer scenario each layer deploys its own fault management methods. A partially protected optical layer is proposed and the rest of the network is protected at the MPLS layer. New protection schemes that avoid protection duplications are proposed. Moreover, this paper also introduces a new traffic classification based on the level of reliability. The failure impact is evaluated in terms of recovery time depending on the traffic class. The proposed schemes also include a novel variation of minimum interference routing and shared segment backup computation. A complete set of experiments proves that the proposed schemes are more efficient as compared to the previous ones, in terms of resources used to protect the network, failure impact and the request rejection ratio
Resumo:
A condition needed for testing nested hypotheses from a Bayesianviewpoint is that the prior for the alternative model concentratesmass around the small, or null, model. For testing independencein contingency tables, the intrinsic priors satisfy this requirement.Further, the degree of concentration of the priors is controlled bya discrete parameter m, the training sample size, which plays animportant role in the resulting answer regardless of the samplesize.In this paper we study robustness of the tests of independencein contingency tables with respect to the intrinsic priors withdifferent degree of concentration around the null, and comparewith other “robust” results by Good and Crook. Consistency ofthe intrinsic Bayesian tests is established.We also discuss conditioning issues and sampling schemes,and argue that conditioning should be on either one margin orthe table total, but not on both margins.Examples using real are simulated data are given