To see the other types of publications on this topic, follow the link: RFF.
Dissertations / Theses on the topic 'RFF'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'RFF.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Stephanie-victoire, Noémie. "Les marchés de la SNCF depuis la création de RFF." Paris 13, 2000. http://www.theses.fr/2000PA131039.
Full textAbstract:
Ladirective 93/38/CEE du conseil du 14 juin 1993 impose la mise en concurrence et la publicité aux marchés conclus dans les secteurs de l'eau, de l'energie, des transports et des télécommunications afin de mettre en eouvre des pratiques commerciales loyales. Cependant, les entreprises qui exploitent ces secteurs, ont la possibilité de choisir entre les différentes procédures de passation des marchés (ouvertes, restreintes ou négociées). Cette fléxibilité est appliquée par la Société Nationale des Chemins de Fer Français (SNCF). Exclue du champs d'application du code des marchés publics, cet établissement public industriel et commercial a crée son propre cadre juridique composé de cahiers de clauses et de conditions générales, justifié par la particularité de ses marchés. Ainsi, dans le domaone ferroviaire, l'exploitant du service de transport de voyageurs et de marchandises ainsi que la gestion des infrastructures ferroviaires exigent des compétences spécifiques de la part des entrepreneurs, des fournisseurs et des prestataires de services. Cette spécificité limite le nombre d'entreprises soumissionnaire. La création du Réseau Ferré de France (RFF) par la loi du 13 février 1997 complique le régime juridique applicable aux marchés de la SNCF. En effet, en application de la directive 91/440/CEE du conseil du 29 juillet 1991, relative au développement des chemeins de fer communautaires, la création de RFF répond aux besoins d'assurer un désendettement de la SNCF et de séparer la gestion de l'infrastructure et l'exploitation du service de transport ferroviaire. Par conséquent, cette loi du 13 février 1997 prévoit une nouvelle répartition des compétences entre la SNCF et RFF qui a plusieurs conséquences sur les procédues de passation des marchés conclus dans le domaine ferroviaire. Dans le domaine de la gestion de l'infrastructure ferroviaire, RFF est maître d'ouvrage des nouveaux investissements et confie à la SNCF un mandat de maîtrise d'ouvrage pour des ensembles d'opérations. Cet établissement public industriel et commercial attribue les marchés alors que les procédures de passation et de sélection des entreprises soumissionnaires sont menées par la SNCF. Dans le domaine de l'exploitation du service de transport, la SNCF conserve son ancien cadre juridique.
2
Lovett, Victoria Anne. "Voice Features of Sjogren's Syndrome: Examination of Relative Fundamental Frequency (RFF) During Connected Speech." BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/5749.
Full textAbstract:
The purpose of this study was to examine the effectiveness of relative fundamental frequency (RFF) in quantifying voice disorder severity and possible change with treatment in individuals with Primary Sjögren's Syndrome (SS). Participants completed twice-daily audio recordings during an ABAB within-subjects experimental study investigating the effects of nebulized saline on voice production in this population. Voice samples of the Rainbow Passage from seven of the eight individuals with Primary SS involved in a larger investigation met inclusion criteria for analysis, for a total of 555 tokens. The results indicated that RFF values for this sample were similar to previously reported RFF values for individuals with voice disorders. RFF values improved with nebulized saline treatment but did not fall within the normal range for typical speakers. These findings were similar to other populations of voice disorders who experienced improvement, but not complete normalization, of RFF with treatment. Patient-based factors, such as age and diagnosis as well as measurement and methodological factors, might affect RFF values. The results from this study indicate that RFF is a potentially useful measure in quantifying voice production and disorder severity in individuals with Primary SS.
3
Chraibi, Sarrah. "Faire ou faire-faire les Achats : le modèle de RFF et de SNCF Réseau à l’épreuve des faits." Thesis, Lorient, 2017. http://www.theses.fr/2017LORIL443.
Full textAbstract:
L’externalisation peut s’avérer une épée à double tranchant : face aux opportunités qu’elle présente, les dangers qu’elle engendre, s’ils ne sont pas suffisamment maitrisés, peuvent aller jusqu’à menacer la pérennité de l’entreprise. L'externalisation des Achats à caractère stratégique est de son côté assez émergente et nécessite donc la mise en place d’une nouvelle méthode organisationnelle dans les pratiques de l’entreprise. Cette recherche démontre qu’un modèle de management mixte (vertical et horizontal) peut s’avérer efficace pour l’externalisation des Achats à caractère stratégique et s’intéresse ensuite à tous les Achats de l’entreprise en développant un modèle d’aide à la décision du faire ou faire-faire des Achats. La méthodologie suivie est qualitative se basant sur une étude de cas approfondie et des entretiens d’expertsA great deal of attention has been paid to the performance of business networks in supply chain management, firms are collaborating more to develop long term business relationships. However, limited empirical evidence exists to validate a plural management model as a key success factor in a strategic supplier relationship. The purpose of this research is to enrich our understanding about how to manage an external provider relationship in case of outsourcing strategic procurement by providing empirical evidence. Then this research draws a decision making process for the Make-or-Buy of procurement activities which includes: Analysis of the current situation, Preparation for the Make-or-Buy choice, Scope of Make-or-Buy, Make-or-Buy analysis and Make-or-Buy choice. This research examines an in-depth qualitative case and contributes to the literature by providing empirical evidence
4
Barradas, Pedro Jorge Rodrigues. "Um sistema de controlo de gestão automatizado como forma de obter maior qualidade, eficiência e eficácia na gestão dos recursos financeiros." Master's thesis, Instituto Superior de Ciências Sociais e Políticas, 2013. http://hdl.handle.net/10400.5/5182.
Full textAbstract:
Trabalho de Projeto para obtenção de grau de Mestre em MPA – Administração PúblicaTrabalho no Gabinete de Gestão Financeira do Ministério da Educação desde 2006, na Direção de Serviços de Sistemas de Informação, desempenhando funções nas áreas do desenvolvimento e gestão de Bases de Dados. Ao longo destes anos, tem-se verificado uma sobrecarga crescente de informação, que tem vindo a originar vários problemas, nomeadamente: a) existência de muita informação para o mesmo facto; b) existência de soluções não integradas que impossibilita a partilha da informação; c) dificuldade em saber que informação está correta; d) dificuldade em saber onde se encontra a informação correta; e) existência de trabalho repetitivo e redundante no tratamento da informação; f) a utilização massiva do suporte papel em detrimento do formato digital; g) enorme esforço de compatibilização das informações que apresentam infraestruturas de base diferentes; h) decisor confronta-se com muita informação sobre o mesmo assunto. O desafio que abraçamos com este trabalho de investigação foi o de apontar e sugerir aspetos que devem ser observados pelo GGF para “adapta-lo” aos modernos conceitos de gestão. Concluímos que a adoção de “políticas” que fomentem a centralização da informação por um lado, a desmaterialização por outro lado, e a racionalização de outros serviços potencializados pelas TIC, corresponderá a uma possível solução.
Since 2006 I’ve been working for the Ministry of Education, at the Financial Administration Department at Direção de Serviços de Sistemas de Informação, in development and Database administration. During all these years an overloaded increasing of information has been being recognized, causing some problems, such as: a)the existence of lots of information about the same fact; b)the existence of non-integrated solutions which make it impossible to share information; c)difficulty in recognizing the right information; d)difficulty in recognizing where the right information is; e)the existence of a repeated and redundant work in the information’s treatment; f)a wasteful use of paper support instead of the use of the digital form; g)a hard effort to make compatible information coming from different bases; h)the one who most decide is confronted by too much information at the same time. With this work we intended to focus on aspects that must be carefully observed by GGF in order to adapt it to the modern concepts of management. We inferred that the use of polities that, on the one hand increase the information centralization and, on the other hand provide its dematerialization and, yet, the rationalization of other services empowered by CIT, can be a possible solution.
5
Smith, Travis R. "Comparing RF Fingerprinting Performance of Hobbyist and Commercial-Grade SDRs." Wright State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=wright1608139109925131.
Full text
6
Signé, Elisabeth. "Réactivité radicalaire de RFI, RFH et RFC2H4I : application à la synthèse." Montpellier 2, 1992. http://www.theses.fr/1992MON20253.
Full textAbstract:
Un chapitre bibliographique situe la reactivite radicalaire des composes r#fi, r#fh et r#fch#2ch#2i (r#f: c#nf#2#n#+#1 lineaire, n = 2,4,6,8). Il est ensuite decrit la synthese originale de r#fbr et r#fcl a partir de r#fi et r#fh mis en presence a 160 et 300c d'agents bromants et chlorants notamment cbr#4 et ccl#4 (chapitre 2). Enfin, une synthese amelioree de r#fch#2ch#2oh a pu etre effectuee par reaction de r#fch#2ch#2i avec des amides en presence d'initiateurs radicalaires (etudes cinetiques aspects mecanistique) (chapitre 3)
7
Castilho, Sara Isabel Pereira. "Estudo da frequência fundamental relativa na tensão laríngea." Master's thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/13589.
Full textAbstract:
Mestrado em Ciências da Fala e da AudiçãoNeste estudo analisou-se o comportamento da frequência fundamental relativa (RFF) em indivíduos com nódulos vocais (N=9), com Edema de Reinke (N=15) e sem patologia vocal ( N=24), procurando perceber a relação entre este parâmetro e a tensão laríngea. Selecionaram-se dez sequências do tipo VCV do texto foneticamente equilibrado “O Vento Norte e o Sol”. Destas sequências extraíram-se os valores de RFF. Ainda no texto, numa das vogais selecionadas, extraíram-se os parâmetros F0, Jitter, Shimmer e HNR. Estes parâmetros foram também calculados a partir de uma vogal sustentada. Para avaliar a tensão, recorreu-se à avaliação percetiva, pela escala GRBAS.Com os valores de RFF dos informantes dos diferentes grupos aplicou-se uma ANOVA onde não se encontraram diferenças significativas para o fator diagnóstico e encontraram-se diferenças no fator ciclos. Os valores de RFF obtidos dentro de cada grupo apresentam uma grande dispersão. Estudou-se também a correlação entre o RFF e a tensão medida percetivamente mas os resultados não foram estatisticamente significativos. Analisaram-se também os parâmetros de tensão, F0, Jitter, Shimmer e HNR e encontraram-se diferenças entre os grupos com a tensão, a F0 e o HNR. Neste estudo não foi possível estabelecer uma relação clara entre o RFF e a tensão laríngea, sendo esta medida de difícil aplicabilidade clínica.
In this study the behaviour of the relative fundamental frequency (RFF) in healthy speakers (N=24) and speakers with voice disorders (vocal fold nodules N=9; Reinke’s edema N=15), and the relation between this measure and laryngeal tension, were analysed. Ten phonetic VCV sequencies from the phonetically balance text ”The North Wind and the Sun” were selected, to calculate RFF measures. In the same text, in one selected vowel, and in one sustained vowel, the following acoustic measures were extracted: F0, Jitter, Shimmer and HNR. Strain was also perceptually assessed with the GRBAS scale. An ANOVA of RFF values from the different groups, was used but no statistically significant differences between the three groups were found. However there were statistical differences between the cycles. The RFF values within each group were widely dispersed. There was no correlation between RFF and strain. Fundamental frequency (F0), Jitter, Shimmer and HNR values were also analysed, and results revealed that there were differences between strain, F0 and HNR. In this study we could conclude that it was not possible to establish a correlation between RFF and laryngeal tension, and that it is hard to see the aplicability of the RFF measure in a clinical context.
8
Costa, Rejane. "RGF." Florianópolis, SC, 2001. http://repositorio.ufsc.br/xmlui/handle/123456789/79713.
Full textAbstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.Made available in DSpace on 2012-10-18T06:49:18Z (GMT). No. of bitstreams: 0Bitstream added on 2014-09-26T00:16:49Z : No. of bitstreams: 1 184619.pdf: 5727628 bytes, checksum: 0955df269add80ead8969a0c2c5a413b (MD5)
Sabemos que as crianças sentem-se motivadas a estudar com o auxílio de recursos computacionais. Com o surgimento das novas tecnologias podemos destacar a mais inovadora delas, a Hipermídia, com um grande poder de aplicabilidade na Educação.
9
Wu, Lingling. "Surface processing by RFI PECVD and RFI PSII." W&M ScholarWorks, 2000. https://scholarworks.wm.edu/etd/1539623997.
Full textAbstract:
An RFI plasma enhanced chemical vapor deposition (PECVD) system and a large-scale RF plasma source immersion ion implantation (PSII) system were designed and built to study two forms of 3-D surface processing, PECVD and PSII. Using the RFI PECVD system, Ti-6Al-4V substrates were coated with diamond-like carbon films with excellent tribological and optical properties. as an innovation, variable angle spectroscopic ellipsometry (VASE) was successfully applied for non-destructive, 3-D, large-area tribological coatings quality investigation.;Based on the experience with the RFI PECVD system, a large-scale RFICP source was designed and built for the PSIL Langmuir probe and optical emission spectroscopy studies indicated that the RFI source produced stable, uniform, and clean plasma. MAGIC code was for the first time used to model PSII process, addressing different target geometries and boundaries, materials, plasma parameters, illustrated sheath formation and evolution, field distribution, ion and electron trajectories, ion incident angles, and dose distributions, which are critical for PSII design and understanding.;The RF PSII system was developed into a versatile large-area, uniform, 3-D surface processing apparatus, capable of PSII, PVD, PECVD, and in situ surface cleaning and interface properties modification, for multilayer, multi-step, and high performance surface engineering. Using the RFI PSII system, for the first time, PSII was studied as a mask-based surface layer conversion technique, for pattern writing by implantation as an alternative to current deposition-based and ink-based direct write technologies. It operates at low substrate temperature, keeps the original surface finish and dimensions, and avoids adhesion problem. A different operating mode of the RF source was discovered to perform biased sputtering of high purity quartz, which turned the RFI PSII system into a novel integrated RF PSII/PVD system for large-area, uniform, nitrogen-doped, and hydrogen-free SiO2 films deposition at low substrate temperatures. Nitrogen-doped SiO2 films with excellent optical properties were deposited on semiconductor, metal, and polymer substrates with excellent adhesion. Ellipsometry was used again for non-destructive SiO2 coatings investigation. FEL test electrodes processed by PSII/PVD showed suppressed field emission. A group of transition metals and an FEL test electrode were also implanted by nitrogen using the PSII mode and analyzed.
10
Yong, Iparraguirre Cristian Alfredo, Pajar Giovanna Leonidas Palacios, Ríos Magaly Paola Peña, and Vellon Juan Pablo Baldeon. "Ruta Ruff." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2020. http://hdl.handle.net/10757/653804.
Full textAbstract:
En el presente trabajo se detectó una problemática para los dueños de los canes que no tenían tiempo para pasear a sus mascotas y/o no tener con quien dejarlos cuando ellos salían por periodos largos de tiempo, para el cual presentamos esta solución un medio de intermediación digital Ruta Ruff. Este medio digital pone a disposición una cartera amplia de paseadores en donde podrán escoger al paseador que más se asemeja a sus necesidades. Las instalaciones se encontrarán en Calle Los Guacamayos 197 Of. 102 Urb. Limatambo Surquillo, Lima – Perú.
Para iniciar las opresiones la empresa Ruta Ruff necesitara una inversión de S/. 60,201.00 para la implementación de los activos fijos y S/. 16,256 para la publicidad del primer mes, obteniendo utilidades a partir del octavo mes de haber iniciado sus operaciones y con una tasa de crecimiento de usuarios de 100% en el primer año, para lo cual contamos dentro de los miembros un equipo con experiencia en el campo de la administración, marketing y contabilidad.
Este proyecto tiene mucho potencial debido al crecimiento de la población que cuenta con una mascota en casa, asimismo muchas de ellas cada vez más y con más frecuencias usan aplicativos móviles para adquirir productos y servicios, entonces esta propuesta de negocio encaja muy bien con el nuevo estilo de consumo del ciudadano de Lima Metropolitana.In this work, a problem was detected for the owners of the dogs who did not have time to walk their pets and / or have no one to leave them with when they went out for long periods of time, for which we present this solution as a means of intermediation. Ruff Route digital. This digital medium offers a wide portfolio of walkers where they can choose the walker that most closely matches their needs. The facilities will be located at Calle Los Guacamayos 197 Of. 102 Urb. Limatambo Surquillo, Lima - Peru. To start the oppressions, the Ruta Ruff company will need an investment of S /. 60,201.00 for the implementation of fixed assets and S /. 16,256 for the advertising of the first month, obtaining profits from the eighth month of starting operations and with a growth rate of 100% users in the first year, for which we have within the team a team with experience in field of administration, marketing and accounting. This project has a lot of potential due to the growth of the population that has a pet at home, also many of them more and more and more frequently use mobile applications to acquire products and services, so this business proposal fits very well with the new consumption style of the citizen of Metropolitan Lima.
Trabajo de investigación
11
Desmaris, Christian. "Le transport ferroviaire régional de voyageurs en France : à la lumière de la théorie néo-institutionnaliste et des comptes de surplus." Phd thesis, Université Lumière - Lyon II, 2010. http://tel.archives-ouvertes.fr/tel-00472091.
Full textAbstract:
Cette thèse, qui s'inscrit dans le questionnement économique général sur la recherche d'outils de régulation des industries de réseaux, questionne la pertinence du choix français de régionalisation ferroviaire. Ce dernier, depuis la réforme introduite par la loi SRU, associe le maintien du monopole d'exploitation de la SNCF pour le Transport Express Régional (TER) avec la décentralisation aux Régions d'une prérogative jusqu'alors assurée de manière bureaucratique et centralisée. Dans cet environnement institutionnel, original au regard du mouvement européen, les Régions françaises ont-elles réussi à écrire et à gouverner le "système SNCF-TER" ? Pour répondre à cette double interrogation, l'auteur mobilise la théorie néo-institutionnelle, à partir de laquelle il propose une matrice interprétative de l'architecture économique des conventions TER et présente une transposition de la méthode des comptes de surplus (MCS), pour l'étude de la performance économique de ces contrats. Les résultats obtenus, sur l'échantillon des sept régions qui ont expérimenté la régionalisation, ne confirment que partiellement les déductions habituelles obtenues à partir de la théorie standard du monopole et de la capture du réglementateur par la firme régulée. Si la contractualisation SNCF / Régions, très éloignée du modèle « net cost », exprime l'acceptation par le Législateur d'une large couverture des risques industriels, commerciaux, et plus encore sur investissements, par la Collectivité, la régionalisation s'est traduite par une grande diversité contractuelle. Une analyse fine montre le caractère hybride des modes de gouvernance que l'auteur qualifie de « fiduciaro-autoritaires ». La MCS révèle que si l'effet du monopole est bien présent et s'impose aux Régions, il ne profite guère à la SNCF, mais plutôt à RFF. Tendanciellement, les voyageurs sont devenus « gagnants » de la régionalisation ferroviaire.
12
Ticona, Herrera Regina Paola. "Towards RDF normalization." Thesis, Pau, 2016. http://www.theses.fr/2016PAUU3015/document.
Full textAbstract:
Depuis ces dernières décennies, des millions d'internautes produisent et échangent des données sur le Web. Ces informations peuvent être structurées, semi-structurées et/ou non-structurées, tels que les blogs, les commentaires, les pages Web, les contenus multimédias, etc. Afin de faciliter la publication ainsi que l'échange de données, le World Wide Web Consortium (ou W3C) a défini en 1999 le standard RDF. Ce standard est un modèle qui permet notamment de structurer une information sous la forme d'un réseau de données dans lequel il est possible d'y attacher des descriptions sémantiques. Ce modèle permet donc d'améliorer l'interopérabilité entre différentes applications exploitant des données diverses et variées présentes sur le Web.Actuellement, une grande quantité de descriptions RDF est disponible en ligne, notamment grâce à des projets de recherche qui traitent du Web de données liées, comme par exemple DBpedia et LinkedGeoData. De plus, de nombreux fournisseurs de données ont adopté les technologies issues de cette communauté du Web de données en partageant, connectant, enrichissant et publiant leurs informations à l'aide du standard RDF, comme les gouvernements (France, Canada, Grande-Bretagne, etc.), les universités (par exemple Open University) ainsi que les entreprises (BBC, CNN, etc.). Il en résulte que de nombreux acteurs actuels (particuliers ou organisations) produisent des quantités gigantesques de descriptions RDF qui sont échangées selon différents formats (RDF/XML, Turtle, N-Triple, etc.). Néanmoins, ces descriptions RDF sont souvent verbeuses et peuvent également contenir de la redondance d'information. Ceci peut concerner à la fois leur structure ou bien leur sérialisation (ou le format) qui en plus souffre de multiples variations d'écritures possibles au sein d'un même format. Tous ces problèmes induisent des pertes de performance pour le stockage, le traitement ou encore le chargement de ce type de descriptions. Dans cette thèse, nous proposons de nettoyer les descriptions RDF en éliminant les données redondantes ou inutiles. Ce processus est nommé « normalisation » de descriptions RDF et il est une étape essentielle pour de nombreuses applications, telles que la similarité entre descriptions, l'alignement, l'intégration, le traitement des versions, la classification, l'échantillonnage, etc. Pour ce faire, nous proposons une approche intitulée R2NR qui à partir de différentes descriptions relatives à une même information produise une et une seule description normalisée qui est optimisée en fonction de multiples paramètres liés à une application cible. Notre approche est illustrée en décrivant plusieurs cas d'étude (simple pour la compréhension mais aussi plus réaliste pour montrer le passage à l'échelle) nécessitant l'étape de normalisation. La contribution de cette thèse peut être synthétisée selon les points suivants :i. Produire une description RDF normalisée (en sortie) qui préserve les informations d'une description source (en entrée),ii. Éliminer les redondances et optimiser l'encodage d'une description normalisée,iii. Engendrer une description RDF optimisée en fonction d'une application cible (chargement rapide, stockage optimisée...),iv. Définir de manière complète et formelle le processus de normalisation à l'aide de fonctions, d'opérateurs, de règles et de propriétés bien fondées, etc.v. Fournir un prototype RDF2NormRDF (avec deux versions : en ligne et hors ligne) permettant de tester et de valider l'efficacité de notre approche.Afin de valider notre proposition, le prototype RDF2NormRDF a été utilisé avec une batterie de tests. Nos résultats expérimentaux ont montré des mesures très encourageantes par rapport aux approches existantes, notamment vis-à-vis du temps de chargement ou bien du stockage d'une description normalisée, tout en préservant le maximum d'informationsOver the past three decades, millions of people have been producing and sharing information on the Web, this information can be structured, semi-structured, and/or non-structured such as blogs, comments, Web pages, and multimedia data, etc., which require a formal description to help their publication and/or exchange on the Web. To help address this problem, the Word Wide Web Consortium (or W3C) introduced in 1999 the RDF standard as a data model designed to standardize the definition and use of metadata, in order to better describe and handle data semantics, thus improving interoperability, and scalability, and promoting the deployment of new Web applications. Currently, billions of RDF descriptions are available on the Web through the Linked Open Data cloud projects (e.g., DBpedia and LinkedGeoData). Also, several data providers have adopted the principles and practices of the Linked Data to share, connect, enrich and publish their information using the RDF standard, e.g., Governments (e.g., Canada Government), universities (e.g., Open University) and companies (e.g., BBC and CNN). As a result, both individuals and organizations are increasingly producing huge collections of RDF descriptions and exchanging them through different serialization formats (e.g., RDF/XML, Turtle, N-Triple, etc.). However, many available RDF descriptions (i.e., graphs and serializations) are noisy in terms of structure, syntax, and semantics, and thus may present problems when exploiting them (e.g., more storage, processing time, and loading time). In this study, we propose to clean RDF descriptions of redundancies and unused information, which we consider to be an essential and required stepping stone toward performing advanced RDF processing as well as the development of RDF databases and related applications (e.g., similarity computation, mapping, alignment, integration, versioning, clustering, and classification, etc.). For that purpose, we have defined a framework entitled R2NR which normalizes different RDF descriptions pertaining to the same information into one normalized representation, which can then be tuned both at the graph level and at the serialization level, depending on the target application and user requirements. We illustrate this approach by introducing use cases (real and synthetics) that need to be normalized.The contributions of the thesis can be summarized as follows:i. Producing a normalized (output) RDF representation that preserves all the information in the source (input) RDF descriptions,ii. Eliminating redundancies and disparities in the normalized RDF descriptions, both at the logical (graph) and physical (serialization) levels,iii. Computing a RDF serialization output adapted w.r.t. the target application requirements (faster loading, better storage, etc.),iv. Providing a mathematical formalization of the normalization process with dedicated normalization functions, operators, and rules with provable properties, andv. Providing a prototype tool called RDF2NormRDF (desktop and online versions) in order to test and to evaluate the approach's efficiency.In order to validate our framework, the prototype RDF2NormRDF has been tested through extensive experimentations. Experimental results are satisfactory show significant improvements over existing approaches, namely regarding loading time and file size, while preserving all the information from the original description
13
Bell, Brendan Bernard. "Regulation of HIV-1 transcription by RBF-1 and RBF-2." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq25015.pdf.
Full text
14
Kim, Jiyoung. "Functional analysis of RFC and RFC-like complexes in fission yeast." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/12375.
Full textAbstract:
RFC plays an essential role in DNA replication by loading the sliding clamp PCNA onto DNA in order to tether DNA polymerase δ to DNA. RFC consists of five subunits, one large subunit and four small subunits. The large subunit of RFC contains an extended C-terminal domain that is not present in the small subunits and whose function remains unknown. In addition to RFC, eukaryotic cells contain two more putative PCNA loaders known as RLCs. These other PCNA loaders have similar structures to RFC and contains the RFC small subunits, however the large subunit is replaced with a different protein, either Elg1 or Ctf18. The function of the three PCNA loaders is not clear. In this work the function of the Rfcl C-terminal domain (CTD) was examined. The analysis of an Rfcl CTD deletion mutant showed that the domain is essential for cell viability. rfcl-44, a temperature-sensitive mutant with a mutation in the C-terminal domain, displayed sensitivity to DNA damaging agents, abnormal chromosome structure and a synthetic lethal phenotype when combined with DNA replication mutants. rfc5 mutants were isolated as suppressors of rfcl-44 suggesting that the defect in rfcl-44 may be in the Rfcl-Rfc5 interaction. Ctf18, Dccl and Ctf8, components of Ctf18-RLC, were required for the viability of rfc1-44 whilst Elg1 was not. Deletion of Elg1 restored the viability of rfc1-44 ctf18Δ double mutant cells, suggesting that Elg1 plays a negative role. The negative role of Elg1 was confirmed by over-expression of Elg1 in rfc1-44 cells showing a lethal phenotype at permissive temperature. These results suggest that RFC plays a key role in DNA replication and that Elg1-RLC and Ctf18-RLC can play negative and positive roles respectively when RFC function is impaired.
15
Rushworth, Linda K. "Functional analysis of B-Raf complexes and the role of Raf heterodimers." Thesis, University of Glasgow, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.432860.
Full text
16
Dongo, Escalante Irvin Franco Benito. "Anonymisation de documents RDF." Thesis, Pau, 2017. http://www.theses.fr/2017PAUU3045/document.
Full textAbstract:
Avec l'avancée du Web Sémantique et des initiatives Open Linked Data, une grande quantité de documents RDF sont disponibles sur Internet. L'objectif est de rendre ces données lisibles pour les humains et les machines, en adoptant des formats spéciaux et en les connectant à l'aide des IRIs (International Resource Identifier), qui sont des abstractions de ressources réelles du monde. L’augmentation du nombre de données publiées et partagées augmente également le nombre d’informations sensibles diffusées. En conséquence, la confidentialité des entités d'intérêts (personnes, entreprises, etc.) est un véritable défi, nécessitant des techniques spéciales pour assurer la confidentialité et la sécurité adéquate des données disponibles dans un environnement où chaque utilisateur a accès à l'information sans aucune restriction (Web).Ensuite, trois aspects principaux sont considérés pour assurer la protection de l'entité: (i) Préserver la confidentialité, en identifiant les données qui peuvent compromettre la confidentialité des entités (par exemple, les identifiants, les quasi-identifiants); (ii) Identifier l'utilité des données publiques pour diverses applications (par exemple, statistiques, tests, recherche); et (iii) Les connaissances antérieures du modèle qui peuvent être utilisées par les pirates informatiques (par exemple, le nombre de relations, une relation spécifique, l'information d'un nœud).L'anonymisation est une technique de protection de la confidentialité qui a été appliquée avec succès dans les bases de données et les graphes. Cependant, les études sur l'anonymisation dans le contexte des documents RDF sont très limitées. Ces études sont les travaux initiaux de protection des individus sur des documents RDF, puisqu'ils montrent les approches pratiques d'anonymisation pour des scénarios simples comme l'utilisation d'opérations de généralisation et d'opérations de suppression basées sur des hiérarchies. Cependant, pour des scénarios complexes, où une diversité de données est présentée, les approches d'anonymisations existantes n'assurent pas une confidentialité suffisante.Ainsi, dans ce contexte, nous proposons une approche d'anonymisation, qui analyse les voisins en fonction des connaissances antérieures, centrée sur la confidentialité des entités représentées comme des nœuds dans les documents RDF. Notre approche de l'anonymisation est capable de fournir une meilleure confidentialité, car elle prend en compte la condition de la diversité de l'environnement ainsi que les voisins (nœuds et arêtes) des entités d'intérêts. En outre, un processus d'anonymisation automatique est assuré par l'utilisation d'opérations d'anonymisations associées aux types de donnéesWith the advance of the Semantic Web and the Open Linked Data initiatives, a huge quantity of RDF data is available on Internet. The goal is to make this data readable for humans and machines, adopting special formats and connecting them by using International Resource Identifiers (IRIs), which are abstractions of real resources of the world. As more data is published and shared, sensitive information is also provided. In consequence, the privacy of entities of interest (e.g., people, companies) is a real challenge, requiring special techniques to ensure privacy and adequate security over data available in an environment in which every user has access to the information without any restriction (Web). Then, three main aspects are considered to ensure entity protection: (i) Preserve privacy, by identifying and treating the data that can compromise the privacy of the entities (e.g., identifiers, quasi-identifiers); (ii) Identify utility of the public data for diverse applications (e.g., statistics, testing, research); and (iii) Model background knowledge that can be used for adversaries (e.g., number of relationships, a specific relationship, information of a node). Anonymization is one technique for privacy protection that has been successfully applied in practice for databases and graph structures. However, studies about anonymization in the context of RDF data, are really limited. These studies are initial works for protecting individuals on RDF data, since they show a practical anonymization approach for simple scenarios as the use of generalization and suppression operations based on hierarchies. However, for complex scenarios, where a diversity of data is presented, the existing anonymization approaches does not ensure an enough privacy. Thus, in this context, we propose an anonymization framework, which analyzes the neighbors according to the background knowledge, focused on the privacy of entities represented as nodes in the RDF data. Our anonymization approach is able to provide better privacy, since it takes into account the l-diversity condition as well as the neighbors (nodes and edges) of entities of interest. Also, an automatic anonymization process is provided by the use of anonymization operations associated to the datatypes
17
Nilsson, Ulrika. "RÅ 2008 ref. 24 vs RÅ 2010 ref. 112 : Tax treaty override på svenska?" Thesis, Internationella Handelshögskolan, Högskolan i Jönköping, IHH, Rättsvetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-15057.
Full textAbstract:
Sammanfattning För att underlätta gränsöverskridande transaktioner ingår stater idag internationella överenskommelser av olika slag. Traktat som de även kallas utgör en del av folkrätten och är reglerade i Wienkonventionen om traktaträtten från 1969. En av de vanligaste formerna av traktat är idag dubbelbeskattningsavtal vilka huvudsakligen syftar till att fördela beskattningsrätt mellan stater för att undvika en dubbelbeskattningssituation. Sveriges dubbelbeskattningsavtal inkorporeras i intern rätt vilket ger uttryck för det dualistiska synsättet. Inom folkrätten är principen att avtal ska hållas en viktig grundsats som kommer till uttryck i artikel 26 Wienkonventionen. Wienkonventionens artikel 27 stadgar vidare att en part inte kan åberopa sin interna rätt som grund för sin underlåtenhet att fullgöra ett avtal. Likväl väljer vissa stater att ge den interna rätten företräde vid en kollision och detta ses således som ett avtalsbrott, en tax treaty override enligt folkrätten. Att en nationell domstol åsidosätter bestämmelser i ett dubbelbeskattningsavtal har en negativ effekt på det inhemska såväl som det internationella skattesystemet, vilket oundvikligen leder till en osäkerhet för skattskyldiga. HFD meddelade 2008 en dom som utgjorde en treaty override. Domen ledde till många debatter och allt tyder på att det var ett misstag från HFD:s sida. Då HFD endast två år senare meddelade en dom med motsatt utfall uppkommer fråga hur förhållandet mellan dubbelbeskattningsavtal och svensk rätt egentligen ser ut idag samt vilka konsekvenser HFD:s motsägelsefulla domar kan leda till. Risk för att andra nationer kommer avstå från att ingå dubbelbeskattningsavtal med Sverige uppkommer då det föreligger en osäkerhet om Sverige har för avsikt att följa ingångna avtal då stater ingår bilaterala avtal baserat på en tilltro till motpartens ambitioner och vilja att leva upp till sina åtaganden.
18
Thompson, Nicholas Christopher. "RFI mitigation in radio astronomy." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86637.
Full textAbstract:
Thesis (MEng)--Stellenbosch University, 2014.ENGLISH ABSTRACT: Technical advances in electromagnetics, signal processing and processing power have led to a significant increase in sensitivity and accuracy in radio telescopes. With this increase in sensitivity, radio frequency interference (RFI) has become a much larger problem. The notable growth in wireless communication as well as self generated RFI has further escalated this problem. In order to utilise the full capabilities of modern radio telescopes, RFI mitigation is required on the captured signals. With the enormous data rates of modern radio telescopes, managing RFI has become increasingly difficult, and in order to utilise the full captured radio spectrum, more accurate RFI mitigation strategies will be necessary. The use of different RFI mitigation strategies is studied in the form of online and offline techniques. This includes Spectral Kurtosis, Spectral Flatness and the Var/SumThreshold method. The special case for RFI mitigation in timing pulsars will also be studied. These techniques are well known in the radio astronomy community; here, spectral kurtosis and spectral flatness will be implemented on the raw data as well as the post correlated data. System speed and accuracy will be the deciding factors when testing these methods as possible solutions to this problem.
AFRIKAANSE OPSOMMING: ‘n Toename in die sensitiwiteit van hedendagse radioteleskope kan toegedra word aan die tegniese bevordering in elktromagnetika en seinverwerking. Die toename in sensitiwiteit het egter tot die gevolg dat radiofrekwensiesteuring ‘n groter rol speel in hedendaagse radioteleskope. Die groei in die gebruik van radioverbindings asook die gevolge van self gei¨nduseerde radiofrekwensiesteuring dra ook verder by tot hierdie probleem. Radiofrekwensiesteuring matiging word toegepas op die opgevangde seine, om sodoende gebruik te maak van die volle kapasiteit van moderne radioteleskope. Die bestuur van radiofrekwensiesteuring word bemoeilik deur die groot hoeveelheid intydse data van die radioteleskope. Meer akurate radiofrekwensiesteuring matigingstegnieke word vereis om die bandwydte ten volle te hanteer. Daar word op ‘n aantal verskillende matingstegnieke gefokus. Hierdie tegenieke kan in twee kategorieë verdeel word, naamlik aanlyn- en aflyntegenieke. Onderafdelings van hierdie kategorieë sluit in: spektrale kurtose, spektrale matheid en “Var/SumThreshold”. Daar word ook na ‘n spesiale geval van radiofrekwensiesteuring matiging gekyk, in die opmeeting van tydsberekening-pulsars. Alhoewel hierdie tegnieke bekend is in die radioastronomie gemeenskap, word spektrale kurtose en spektrale matheid egter toegepas op die rou data sowel as postgekorreleerde data. Daar sal op stelsel spoed en akuratheid gefokus word, om vas te stel of hierdie metodes wel moontlike oplossings bied tot die probleem bespreek.
19
Sinnott, Colin Sydney. "RAF operational requirements 1923-1939." Thesis, King's College London (University of London), 1998. https://kclpure.kcl.ac.uk/portal/en/theses/raf-operational-requirements-19231939(efdd2957-e226-4edf-bcfc-65a4483ce340).html.
Full text
20
Schätzle, Alexander [Verfasser], and Georg [Akademischer Betreuer] Lausen. "Distributed RDF Querying on Hadoop." Freiburg : Universität, 2017. http://d-nb.info/1128574187/34.
Full text
21
RODRIGUES, DANILO MORET. "DISTRIBUTED RDF GRAPH KEYWORD SEARCH." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2013. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23832@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO
O objetivo desta dissertação é melhorar a busca por palavra-chave em formato RDF. Propomos uma abordagem escalável, baseada numa representação tensorial, que permite o armazenamento distribuído e, como consequência, o uso de técnicas de paralelismo para agilizar a busca sobre grandes bases de RDF, em particular, as publicadas como Linked Data. Um volume sem precedentes de informação está sendo disponibilizado seguindo os princípios de Linked Data, formando o que chamamos de Web of Data. Esta informação, tipicamente codificada como triplas RDF, costuma ser representada como um grafo, onde sujeitos e objetos são vértices, e predicados são arestas ligando os vértices. Em consequência da ampla adoção de mecanismos de busca na World Wide Web, usuários estão familiarizados com a busca por palavra-chave. No caso de grafos RDF, no entanto, a extração de uma partição coerente de grafos para enriquecer os resultados da busca é uma tarefa cara, demorada, e cuja expectativa do usuário é de que seja executada em tempo real. Este trabalho tem como objetivo o tratamento deste problema. Parte de uma solução proposta recentemente prega a indexação do grafo RDF como uma matriz esparsa, que contém um conjunto de informações pré-computadas para agilizar a extração de seções do grafo, e o uso de consultas baseadas em tensores sobre a matriz esparsa. Esta abordagem baseada em tensores permite que se tome vantagem de técnicas modernas de programação distribuída, e.g., a utilização de bases de dados não-relacionais fracionadas e o modelo de MapReduce. Nesta dissertação, propomos o desenho e exploramos a viabilidade da abordagem baseada em tensores, com o objetivo de construir um depósito de dados distribuído e agilizar a busca por palavras-chave com uma abordagem paralela.
The goal of this dissertation is to improve RDF keyword search. We propose a scalable approach, based on a tensor representation that allows for distributed storage, and thus the use of parallel techniques to speed up the search over large linked data sets, in particular those published as Linked Data. An unprecedented amount of information is becoming available following the principles of Linked Data, forming what is called the Web of Data. This information, typically codified as RDF subject-predicate-object triples, is commonly abstracted as a graph which subjects and objects are nodes, and predicates are edges connecting them. As a consequence of the widespread adoption of search engines on the World Wide Web, users are familiar with keyword search. For RDF graphs, however, extracting a coherent subset of data graphs to enrich search results is a time consuming and expensive task, and it is expected to be executed on-the-fly at user prompt. The dissertation s goal is to handle this problem. A recent proposal has been made to index RDF graphs as a sparse matrix with the pre-computed information necessary for faster retrieval of sub-graphs, and the use of tensor-based queries over the sparse matrix. The tensor approach can leverage modern distributed computing techniques, e.g., nonrelational database sharding and the MapReduce model. In this dissertation, we propose a design and explore the viability of the tensor-based approach to build a distributed datastore and speed up keyword search with a parallel approach.
22
Silva, Alan Castro. "Implementação inicial da RFC 6897." Universidade Federal de São Carlos, 2016. https://repositorio.ufscar.br/handle/ufscar/8806.
Full textAbstract:
Submitted by Milena Rubi (milenarubi@ufscar.br) on 2017-06-01T14:58:47Z
No. of bitstreams: 1
SILVA_Alan_2016.pdf: 14722594 bytes, checksum: 0c8346924c434318f6c349f7ed8112d9 (MD5)Approved for entry into archive by Milena Rubi (milenarubi@ufscar.br) on 2017-06-01T14:58:54Z (GMT) No. of bitstreams: 1 SILVA_Alan_2016.pdf: 14722594 bytes, checksum: 0c8346924c434318f6c349f7ed8112d9 (MD5)
Approved for entry into archive by Milena Rubi (milenarubi@ufscar.br) on 2017-06-01T14:58:59Z (GMT) No. of bitstreams: 1 SILVA_Alan_2016.pdf: 14722594 bytes, checksum: 0c8346924c434318f6c349f7ed8112d9 (MD5)
Made available in DSpace on 2017-06-01T14:59:06Z (GMT). No. of bitstreams: 1 SILVA_Alan_2016.pdf: 14722594 bytes, checksum: 0c8346924c434318f6c349f7ed8112d9 (MD5) Previous issue date: 2016-12-06
Não recebi financiamento
The Multipath TCP (MPTCP) protocol allows applications to better explore the network resources available to multi-connected devices such as mobile phones or multi-homed systems. Here, some advantages are envisioned: bandwidth aggregation, the ability to maintain the connection, if one of the network path fails and the use of multiple paths. To extend these capabilities to the application, RFC 6897 defines an API to better control each of MPTCP’s subflows, so that these can be added or removed as needed. This work presents an initial API implementation as defined in RFC 6897. We implemented some functions described in the document, such as protocol on/o, check existent subflows and add new subflows. To test the API and validate our implementation we built an HTTP application that detects elephant flows and uses the API for open new subflows using the original TCP connection. Some tests were performed in a network using a cubic topology and showed that the API utilization decreased the Flow Completion time of TCP connections.
O protocolo Multipath TCP (MPTCP) permite que as aplicações possam explorar melhor os recursos de rede disponíveis para dispositivos multiconectados como os telefones móveis ou sistemas multi-homed. Aqui, algumas vantagens são previstas: agregação de banda, a habilidade de manter a conexão estabelecida se houver falha em um dos caminhos de rede e a utilização de múltiplos caminhos. Para estender essas capacidades para a aplicação, a RFC 6897 define uma API que permite um melhor controle de cada subfluxo MPTCP, de modo que esses possam ser adicionados ou removidos conforme necessário. Este trabalho apresenta uma implementação inicial da API descrita na RFC 6897 para o protocolo MPTCP. Sendo assim, implementamos algumas das funções de manipulação do protocolo MPTCP descritas no documento, quais sejam: ligar e desligar o protocolo, verificar subfluxos existentes e adicionar novos subfluxos. Para testar a API e validar a nossa implementação, nós desenvolvemos uma aplicação HTTP que detecta fluxos elefantes e utiliza a API para abrir novos subfluxos a partir da conexão TCP original. Testes de desempenho foram realizados em uma topologia cúbica e mostraram que a utilização da API pela aplicação diminuiu o Flow Completion Time das conexões TCP.
23
Molino, Elisabeth. "Le mouvement alternatif en R. F. A." Nice, 1990. http://www.theses.fr/1990NICE2016.
Full textAbstract:
Le mouvement alternatif est un ensemble de communautés qui, par leur pratique quotidienne, entendent montrer que sont possibles des genres de vie et des modes de production différents de ceux qu'imposent les sociétés industrielles contemporaines. Cette étude met en évidence ce que le mouvement alternatif en RFA a en commun avec les mouvements alternatifs antécédents, du début du siècle à la fin des années 70, et montre aussi ce en quoi il en diffère. Le mouvement alternatif suggéré par ses expériences (ou projets) des solutions concrètes aux crises économiques et sociales de la société dite "établie" et constitue le ferment qui permet à celle-ci d'évoluerThe alternative movement is an alliance of several groups which want to show in their way of living and in their acting that other forms of living and production than the ones prescribed by modern industrial societies are possible. This thesis shows what the nowadays alternative movement in the fgr and earlier alternative movements from the turn of the century till the end of the seventies have in common, but also in which points they differ from each other. The alternative movement presents experiments (or projects) as concrete solutions of economic and social crises and forms the ferment to enable the so-called "established" society to develop
24
Lachman, Jakub. "Roštový kotel na spalování RDF." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2019. http://www.nusl.cz/ntk/nusl-401492.
Full textAbstract:
The master’s thesis deals with the design of a boiler for RDF combustion, based on the required power output and superheated steam parameters. The first part of the thesis focuses on combustion calculations. Boiler efficiency is also calculated in this chapter, using the heat balance efficiency method. The main part of the thesis consists of dimensional design and heat transfer calculations. The precision of the calculations is checked at the end of the thesis along with the chlorine corrosion, which is considered because of the higher amount of chlorine in the fuel. The thesis comes with a basic schematic of the designed boiler.
25
Šušlík, Martin. "Knihovna pro zpracování dokumentů RTF." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237231.
Full textAbstract:
The goal of this work is design and implementation of library for RTF processing. The library contains classes for conversion of RTF files to XHTML files. Implementation of library is made in Java programming language and it is tested by using proposed set of tests. Application interface of the library is a subset of the DOM standard and allows to manipulate with final XHTML document.
26
Qiao, Shi. "QUERYING GRAPH STRUCTURED RDF DATA." Case Western Reserve University School of Graduate Studies / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=case1447198654.
Full text
27
Easton, Matthew Joseph. "RFQ design for PAMELA injector." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/9826.
Full textAbstract:
This thesis describes a new design method for a radio frequency quadrupole (RFQ), and its application to the first stage of acceleration for carbon ions in the PAMELA injector. Radiotherapy is a valuable form of cancer treatment, but current methods using photons or electrons make it difficult to deliver an adequate dose to the tumour without damaging healthy surrounding tissue and organs. Charged hadron beams, such as protons and carbon, deposit most of the dose at the Bragg peak, which can be aligned with the tumour. This allows higher doses to treat the cancer while minimising damage to healthy surrounding tissue and organs. The PAMELA project (part of the BASROC consortium) aims to design new charged particle therapy (CPT) facilities using non-scaling fixed-field alternating-gradient accelerators (ns-FFAGs). This new technology offers significant advantages over both cyclotrons and synchrotrons for CPT. The injector for the PAMELA FFAG accelerator includes separate pre-acceleration chains for protons and carbon ions, culminating in a shared injection system into the first FFAG ring. Carbon ions are pre-accelerated by an RFQ and a short linear accelerator (linac). This thesis details the creation of an integrated system of software packages and custom code, which facilitates the design of RFQ vane tips, utilising computer-aided design (CAD) models for both simulation and manufacture, accurate multi-physics modelling of the electric field and particle tracking simulations. This design process is described, along with benchmark results for the Front- End Test Stand (FETS ) RFQ and application of the code in optimising a new RFQ design for PAMELA.
28
Veiga, Frédéric Daniel Jacinto. "Implementation of the RIF-PRD." Master's thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/6310.
Full textAbstract:
Dissertação para obtenção do Grau de Mestre em
Engenharia InformáticaO Rule Interchange Format (RIF) é uma recomendação da W3C que define um conjunto de dialectos para promover a interoperabilidade entre sistemas de regras. A necessidade destes dialectos proveio de um crescente número de linguagens de regras (lógicas ou de produção), com algumas tão específicas que o intercãmbio de regras entre sistemas diferentes é uma tarefa quase impossível. A criação de uma linguagem de regras convencional não seria bem aceite, como tal, a W3C optou por desenvolver o RIF, com o objectivo de fornecer uma solução para o intercãmbio de regras entre diferentes sistemas. Um dos dialectos do RIF é o Rule Interchange Format Production Rule Dialect (RIFPRD), que define uma linguagem de regras de produção orientada para a SemanticWeb. Até à data actual, não é conhecida nenhuma implementação completa de RIF-PRD, mas uma primeira especificação declarativa completa do RIF-PRD baseada em programação por conjuntos de resposta foi proposta na nona conferência internacional de Semantic Web (ISWC2010). Nesta dissertação implementamos um motor de RIF-PRD baseando-nos nessa especificação, e desenvolveremos outras duas implementações, uma utilizando o sistema de regras de produção Jess, e outra recorrendo ao sistema de programação em lógica XSB. Após terminadas as três implementações, foi feita uma comparação entre elas, com o intuito de verificar se há benefícios em utilizar programação por conjuntos de resposta para implementar RIF-PRD, e concomitantemente detectar eventuais limitações na utilização de programação por conjuntos de resposta.
29
Baljuls, Angela. "Differences and Similarities in the Regulation of RAF Isoforms: Identification of Novel A-RAF Phosphorylation Sites." kostenfrei, 2008. http://www.opus-bayern.de/uni-wuerzburg/volltexte/2009/3613/.
Full text
30
Schulenburg, Sven. "Analyse der RDF-Produktion in Vietnam." Master's thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-38577.
Full textAbstract:
A simplified RDF production was made, together with a waste characterization of MSW from Hanoi area. Three experiments were done, two with active aeration and one without. A high water content was determined at all RDF, which has a negative influence on the lower heating value and a saving-effect. A accumulation of the heating value to the higher class (>40mm), was not completely possible, also no complete transfer of mineral contents to the lower class (<10mm). The RDF reach in most cases the criteria for a fuel for different limit values, heavy metals, chloride and sulfur. An economic benefit could be possible with a surplus income by using RDF instead of coal (lignite), also by avoiding landfill gas and sell emission rights via CDM. More and detailed investigations seem to be necessary to confirm these results.
31
Fischer, Philipp. "Ein Hochleistungs-RFQ-Beschleuniger für Deuteronen." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=98342604X.
Full text
32
Bang, Ole Petter, and Tormod Fjeldskår. "Storing and Querying RDF in Mars." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8971.
Full textAbstract:
As part of the Semantic Web movement, the Resource Description Framework (RDF) is gaining momentum as a format for storing data, particularly metadata. The SPARQL Protocol and RDF Query Language is a SQL-like query language, recommended by W3C for querying RDF data. FAST is exploring the possibilities of supporting storage and querying of RDF data in their Mars search engine. To facilitate this, a SPARQL parser has been created for the Microsoft .NET Framework, using the MPLex and MPPG tools from Microsoft's Managed Babel package. This thesis proposes a solution for efficiently storing and retrieving RDF data in Mars, based on decomposition and B+ Tree indexing. Further, a method for transforming SPARQL queries into Mars operator graphs is described. Finally, the implementation of a prototype implementation is discussed. The prototype has been developed in collaboration with FAST and has required customized indexing in Mars. Some deviations from the proposed solution were made in order to create a working prototype within the available time frame. The focus has been on exploring possibilities, and performance has thus not been a priority, neither in indexing nor in evaluation.
33
Jain, Kamna. "D-RDF Dynamic Resource Description Framework /." [Ames, Iowa : Iowa State University], 2007.
Find full text
34
Rech, Matthew Falko. "A critical geopolitics of RAF recruitment." Thesis, University of Newcastle Upon Tyne, 2012. http://hdl.handle.net/10443/1743.
Full textAbstract:
This PhD thesis investigates the geopolitics of Royal Air Force (RAF) recruitment practices. Set at the interface between military and civilian life, RAF recruitment represents an important site from which particular imaginations of the military are consumed, enacted and performed. Drawing primarily on critical geopolitical theory and military geography, along with more-than-representational approaches to popular culture, the thesis uncovers how RAF recruitment necessitates an understanding of, and participation within, certain military-political narratives and imaginaries. It shows that these imaginaries – variously associated with the role, utility and legitimacy of state-sanctioned military violence – are powerful in their ability to affect popular understandings of the military, and to affect certain bodily and material engagements within the immediate spaces of recruitment. Furthermore, with a specific focus on the RAF, it demonstrates how certain ideas around the role and utility of military airpower are represented, enacted and performed. The thesis approaches the geopolitics of RAF recruitment in three ways. Firstly, focussing on the representative tenets of recruitment, the thesis examines both the historical and contemporary design of recruiting texts, images and documents. Using a socio-historical analysis of recruiting images, and drawing upon interviews with the military and corporate producers of recruitment, it demonstrates how recruitment emerges from particular structures, knowledges and experiences. Secondly, focussing on the visualities of military public-relations, the thesis demonstrates how large-scale public and private events, such as military airshows, provide spaces in which military-political narratives and imaginaries are enacted in and through regimes of seeing and sighting. Based on ethnographic research at military airshows, the thesis works to uncover the ways in which techniques of vision at spectacular events tie the potential recruit into particular imaginations of military legitimacy, efficacy, heritage and power. Thirdly, the thesis examines how the more mundane, quotidian sites of RAF recruitment are powerful in their ability to affect bodily predispositions and material engagements. Focussing on RAF recruiting games, military fitness regimes and the material, ephemeral nature of the airshow in particular, the thesis provides an insight into why the material and bodily cultures of militarism matter, and how they work persuasively to entrain particular imaginations of military life and culture. x The thesis raises important questions about the presence of military narratives and imaginaries in the public, civilian sphere, and in popular culture in particular. Set at the interface between military and civilian life, RAF recruitment demonstrates how popular geopolitical discourses of the military sometimes work not only to script imaginations of military violence, but to affect, mark and alter civilian lives and futures.
35
Emuss, Victoria Louise. "C-RAF Mutations in human cancer." Thesis, Institute of Cancer Research (University Of London), 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.511164.
Full text
36
Ruff, Alexander [Verfasser]. "Polare Eigenschaften multiferroischer Materialien / Alexander Ruff." München : Verlag Dr. Hut, 2019. http://d-nb.info/1181514290/34.
Full text
37
Yee, Ka-chi, and 余家智. "Keyword search on huge RDF graph." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B46288478.
Full text
38
Abedjan, Ziawasch. "Improving RDF data with data mining." Phd thesis, Universität Potsdam, 2014. http://opus.kobv.de/ubp/volltexte/2014/7133/.
Full textAbstract:
Linked Open Data (LOD) comprises very many and often large public data sets and knowledge bases. Those datasets are mostly presented in the RDF triple structure of subject, predicate, and object, where each triple represents a statement or fact. Unfortunately, the heterogeneity of available open data requires significant integration steps before it can be used in applications. Meta information, such as ontological definitions and exact range definitions of predicates, are desirable and ideally provided by an ontology. However in the context of LOD, ontologies are often incomplete or simply not available. Thus, it is useful to automatically generate meta information, such as ontological dependencies, range definitions, and topical classifications.
Association rule mining, which was originally applied for sales analysis on transactional databases, is a promising and novel technique to explore such data. We designed an adaptation of this technique for min-ing Rdf data and introduce the concept of “mining configurations”, which allows us to mine RDF data sets in various ways. Different configurations enable us to identify schema and value dependencies that in combination result in interesting use cases. To this end, we present rule-based approaches for auto-completion, data enrichment, ontology improvement, and query relaxation. Auto-completion remedies the problem of inconsistent ontology usage, providing an editing user with a sorted list of commonly used predicates. A combination of different configurations step extends this approach to create completely new facts for a knowledge base. We present two approaches for fact generation, a user-based approach where a user selects the entity to be amended with new facts and a data-driven approach where an algorithm discovers entities that have to be amended with missing facts.
As knowledge bases constantly grow and evolve, another approach to improve the usage of RDF data is to improve existing ontologies. Here, we present an association rule based approach to reconcile ontology and data. Interlacing different mining configurations, we infer an algorithm to discover synonymously used predicates. Those predicates can be used to expand query results and to support users during query formulation.
We provide a wide range of experiments on real world datasets for each use case. The experiments and evaluations show the added value of association rule mining for the integration and usability of RDF data and confirm the appropriateness of our mining configuration methodology.Linked Open Data (LOD) umfasst viele und oft sehr große öffentlichen Datensätze und Wissensbanken, die hauptsächlich in der RDF Triplestruktur bestehend aus Subjekt, Prädikat und Objekt vorkommen. Dabei repräsentiert jedes Triple einen Fakt. Unglücklicherweise erfordert die Heterogenität der verfügbaren öffentlichen Daten signifikante Integrationsschritte bevor die Daten in Anwendungen genutzt werden können. Meta-Daten wie ontologische Strukturen und Bereichsdefinitionen von Prädikaten sind zwar wünschenswert und idealerweise durch eine Wissensbank verfügbar. Jedoch sind Wissensbanken im Kontext von LOD oft unvollständig oder einfach nicht verfügbar. Deshalb ist es nützlich automatisch Meta-Informationen, wie ontologische Abhängigkeiten, Bereichs-und Domänendefinitionen und thematische Assoziationen von Ressourcen generieren zu können. Eine neue und vielversprechende Technik um solche Daten zu untersuchen basiert auf das entdecken von Assoziationsregeln, welche ursprünglich für Verkaufsanalysen in transaktionalen Datenbanken angewendet wurde. Wir haben eine Adaptierung dieser Technik auf RDF Daten entworfen und stellen das Konzept der Mining Konfigurationen vor, welches uns befähigt in RDF Daten auf unterschiedlichen Weisen Muster zu erkennen. Verschiedene Konfigurationen erlauben uns Schema- und Wertbeziehungen zu erkennen, die für interessante Anwendungen genutzt werden können. In dem Sinne, stellen wir assoziationsbasierte Verfahren für eine Prädikatvorschlagsverfahren, Datenvervollständigung, Ontologieverbesserung und Anfrageerleichterung vor. Das Vorschlagen von Prädikaten behandelt das Problem der inkonsistenten Verwendung von Ontologien, indem einem Benutzer, der einen neuen Fakt einem Rdf-Datensatz hinzufügen will, eine sortierte Liste von passenden Prädikaten vorgeschlagen wird. Eine Kombinierung von verschiedenen Konfigurationen erweitert dieses Verfahren sodass automatisch komplett neue Fakten für eine Wissensbank generiert werden. Hierbei stellen wir zwei Verfahren vor, einen nutzergesteuertenVerfahren, bei dem ein Nutzer die Entität aussucht die erweitert werden soll und einen datengesteuerten Ansatz, bei dem ein Algorithmus selbst die Entitäten aussucht, die mit fehlenden Fakten erweitert werden. Da Wissensbanken stetig wachsen und sich verändern, ist ein anderer Ansatz um die Verwendung von RDF Daten zu erleichtern die Verbesserung von Ontologien. Hierbei präsentieren wir ein Assoziationsregeln-basiertes Verfahren, der Daten und zugrundeliegende Ontologien zusammenführt. Durch die Verflechtung von unterschiedlichen Konfigurationen leiten wir einen neuen Algorithmus her, der gleichbedeutende Prädikate entdeckt. Diese Prädikate können benutzt werden um Ergebnisse einer Anfrage zu erweitern oder einen Nutzer während einer Anfrage zu unterstützen. Für jeden unserer vorgestellten Anwendungen präsentieren wir eine große Auswahl an Experimenten auf Realweltdatensätzen. Die Experimente und Evaluierungen zeigen den Mehrwert von Assoziationsregeln-Generierung für die Integration und Nutzbarkeit von RDF Daten und bestätigen die Angemessenheit unserer konfigurationsbasierten Methodologie um solche Regeln herzuleiten.
39
Harrisingh, Marie. "RAS/RAF signalling in primary cells." Thesis, University College London (University of London), 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399336.
Full text
40
Aballagh, Mohamed. ""Raf Al-Hijāb" d'Ibn Al-Bannā." Lille 3 : ANRT, 1989. http://catalogue.bnf.fr/ark:/12148/cb376110700.
Full text
41
Schreiber, Alexander. "Einsatz von RDF/XML in MONARCH." [S.l. : s.n.], 2000. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB9494958.
Full text
42
Waldhoff, Axel. "Hygienisierung von Mischwasser in Retentionsbodenfiltern (RBF)." Kassel Kassel Univ. Press, 2008. http://d-nb.info/993286135/04.
Full text
43
JACYNTHO, MARK DOUGLAS DE AZEVEDO. "A MULTIGRANULARITY LOCKING MODEL FOR RDF." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2012. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=20236@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Em aplicações Web, sessões cliente são organizadas em transações, envolvendo requisições que leem e atualizam dados compartilhados. Executando concorrentemente, estas sessões podem invalidar os dados umas das outras. O advento do movimento Linked Data vem estimulando sobremaneira a criação de aplicações que empregam o modelo de dados RDF em sua camada de informação. Além de consultas aos dados RDF, também se faz presente o requisito de atualizações online, com adequado controle de concorrência. Este trabalho apresenta um modelo de bloqueio, inspirado no protocolo de bloqueio multigranular, voltado para isolamento entre transações que manipulam dados RDF, considerando quatro problemas de concorrência, a saber: lost updates, dirty reads, non-repeatable read e phantoms reads. São oferecidos quatro grânulos hierarquicamente relacionados, bem como novos tipos de bloqueio de escrita e leitura, especificamente criados para o modelo RDF. Por fim, o desempenho do modelo de bloqueio proposto é avaliado por meio de simulação.
Client sessions in Web applications are organized as transactions involving requests that read and write shared data. Executing concurrently, these sessions may invalidate each other s data. The advent of Linked Data is spurring the deployment of applications that use the RDF data model at the information tier. In addition to querying RDF data, there is also the requirement for online updates with suitable concurrency control. This work presents a locking model, inspired by the multigranularity locking protocol, to address isolation between transactions that manipulate RDF data, considering four concurrency-related issues, namely: lost updates, dirty reads, non-repeatable reads and phantom reads. Four hierarchically related granules are offered, as well as new read and write lock modes, specifically created for the RDF data model. Finally, the performance assessment of the proposed locking model is done through simulation.
44
Potter, Anthony. "Query answering in distributed RDF databases." Thesis, University of Oxford, 2017. http://ora.ox.ac.uk/objects/uuid:2ed8a003-7850-4699-bdbf-38be68673813.
Full textAbstract:
To simplify data integration and exchange, modern applications often represent their data using the Resource Description Framework (RDF). As the amount of the available data keeps increasing, many RDF datasets cannot be processed using centralised RDF stores. A common solution is to distribute RDF data in a cluster of shared-nothing servers, and to query the data using a distributed query algorithm. Existing approaches typically use a variant of the data exchange operator to shuffle partial query answers between servers and thus ensure that every query answer is produced. Decisions as to when and where to shuffle the data are usually made statically - that is, at query compile time. In this thesis, we argue that such approaches can miss opportunities for local computation and thus incur considerable overheads. Moreover, we present a novel distributed query evaluation algorithm for RDF based on dynamic data exchange, where all computation that can be done locally is guaranteed to be performed on a single server. Our approach can successfully process any query even if the memory available at each server is bounded, and we argue that this is critical in distributed systems where intermediate results can easily exceed the capacity of each server. We also present a new query planning approach that balances the cost of communication against the cost of local processing at each server, as well as a new approach to partitioning RDF data that aims to increase locality in each server. We have implemented our approach in the well-known RDFox data store, and our empirical evaluation suggests that our techniques can outperform the state of the art by orders of magnitude in terms of query evaluation times, network communication, and memory use.
45
El, Hassad Sara. "Learning commonalities in RDF & SPARQL." Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S011/document.
Full textAbstract:
La recherche de points communs entre des descriptions de données ou de connaissances est un problème de raisonnement fondamental en Machine Learning, qui a été formalisé par G. Plotkin dans les années 70s sous la forme du calcul du plus petit généralisant de ces descriptions. L'identification des plus petits généralisants a un large panel d'applications qui vont de l'optimisation de requêtes (e.g., pour matérialiser les points communs entre des requêtes lors de la sélection de vues ou pour factoriser leur exécution dans un contexte d'accès concurrentiel), à la recommandation dans le contexte des réseaux sociaux (e.g. pour créer de liens entre des utilisateurs basées sur leurs points communs selon leur profil ou leurs recherches). Dans cette thèse nous avons revisité la notion du plus petit généralisant dans le contexte de Resource Description Framework (RDF) et le fragment conjonctif de son langage de requêtes associé SPARQL, alias Basic Graph Pattern (BGP) queries. Contrairement à l'état de l'art, nous ne considérons aucune restriction, ni structurelle ni sémantique, sur les graphes et les requêtes. Nos contributions incluent la définition et le calcul des plus petits généralisants dans ces deux formalismes ce qui revient à trouver le plus grand ensemble de points communs entre des bases de données incomplètes et des requêtes conjonctives en présence de contraintes déductives. Nous proposons également une évaluation expérimentale de nos contributionsFinding commonalities between descriptions of data or knowledge is a fundamental task in Machine Learning. The formal notion characterizing precisely such commonalities is known as least general generalization of descriptions and was introduced by G. Plotkin in the early 70's, in First Order Logic. Identifying least general generalizations has a large scope of database applications ranging from query optimization (e.g., to share commonalities between queries in view selection or multi-query optimization), to recommendation in social networks (e.g., to establish connections between users based on their commonalities between proles or searches), through exploration (e.g., to classify/categorize datasets and to identify common social graph patterns between organizations (e.g., criminal ones)). In this thesis we revisit the notion of least general generalizations in the entire Resource Description Framework (RDF) and popular conjunctive fragment of SPARQL, a.k.a. Basic Graph Pattern (BGP) queries. By contrast to the literature, we do not restrict the structure nor semantics of RDF graphs and BGPQs. Our contributions include the denition and the computation of least general generalizations in these two settings, which amounts to nding the largest set of commonalities between incomplete databases and conjunctive queries, under deductive constraints. We also provide an experimental assessment of our technical contributions
46
Fujisawa, Hiroshi. "A cw 4-rod RFQ Linac." 京都大学 (Kyoto University), 1994. http://hdl.handle.net/2433/86446.
Full text
47
Rodrigues, Neto Abner Cardoso. "Intervalo de Predição em redes RBF." reponame:Repositório Institucional da UFSC, 2012. http://repositorio.ufsc.br/xmlui/handle/123456789/94199.
Full textAbstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Ciência da Computação, Florianópolis, 2010Made available in DSpace on 2012-10-25T07:31:33Z (GMT). No. of bitstreams: 1 285592.pdf: 942677 bytes, checksum: d27da8f48b91079aee8d81b72ef01712 (MD5)
Redes Neurais são amplamente empregadas em problemas de classificaçao e regressão, porém os modelos mais comuns fornecem apenas a estimação de regressão sem nenhuma medida de confiança associada à saída da rede. Medidas de desempenho global como o Erro Médio Quadrático não são capazes de reconhecer regiões onde a resposta da rede possa estar contaminada com incertezas, devido ao ruído presente nos dados ou à baixa densidade de dados de treinamento nessas regiões. Incorporar medidas de confiança na saída da rede, como intervalos de predição, valida a regressão e auxilia tomadores de decisão a estabelecerem critérios de risco, necessários em muitas aplicações práticas. Entretanto, existe uma série de restrições para o calculo do Intervalo de Predição nas redes neurais, que são dificeis de serem cumpridas em problemas reais. Neste trabalho, estudou-se as medidas de confiança fornecida pela rede de função de base radial, algumas das suas deficiencias foram tratadas com o objetivo de obter medidas de confiança mais satisfatórias e com menos restrições sobre o modelo, que possam ajudar os tomadores de decisão em aplicações reais.
48
Frommhold, Marvin, Piris Rubén Navarro, Natanael Arndt, Sebastian Tramp, Niklas Petersen, and Michael Martin. "Towards versioning of arbitrary RDF data." Universität Leipzig, 2016. https://ul.qucosa.de/id/qucosa%3A15777.
Full textAbstract:
Coherent and consistent tracking of provenance data and in particular update history information is a crucial building block for any serious information system architecture. Version Control Systems can be a part of such an architecture enabling users to query and manipulate versioning information as well as content revisions. In this paper, we introduce an RDF versioning approach as a foundation for a full featured RDF Version Control System. We argue that such a system needs support for all concepts of the RDF specification including support for RDF datasets and blank nodes. Furthermore, we placed special emphasis on the protection against unperceived history manipulation by hashing the resulting patches. In addition to the conceptual analysis and an RDF vocabulary for representing versioning information, we present a mature implementation which captures versioning information for changes to arbitrary RDF datasets.
49
Mou, Zhi-Jian. "Filtrage RIF rapide : algorithmes et architectures." Paris 11, 1989. http://www.theses.fr/1989PA112406.
Full textAbstract:
Le filtre à réponse impulsionnelle finie (RIF) joue un rôle des plus importants dans le traitement numérique du signal et représente souvent la principale charge de calcul dans une application soit en logiciel soit en matériel. Cette thèse est divisée en deux parties. La première partie de la thèse traite le problème de la réduction de la complexité arithmétique du filtre RIF. Nous fournissons un ensemble d'algorithmes permettant de 'casser' le filtre habituel en plusieurs sous-filtres échantillonnés, de telle manière que le nombre d'opérations à effectuer se trouve réduit. La deuxième partie étudie non seulement l'implantation de ces sous-filtres mais plus généralement l'architecture des filtres RIF en vue de leur intégration VLSI. Nous présentons une approche unifiée pour tous les algorithmes rapides de filtrage RIF. Le théorème du reste chinois (TRC) constitue la base de l'approche. Tout d'abord nous formulons le filtrage RIF comme un produit polynomial. Ensuite l'application du TRC se fait en trois étapes : 1) interpolation ; 2) filtrage ; 3) reconstruction. L'approche se termine par recouvrement. Sous une présentation pseudocyclique, il est facile de démontrer quelques propriétés utiles des algorithmes. Les algorithmes classiques sont examinés dans ce cadre. Mais l'unification de ces algorithmes n'est pas notre seul objectif. Nous présentons aussi des nouvelles possibilités apportées par cette approche, qui permet d'établir en particulier tous les algorithmes intermédiaires entre traitements temporels et fréquentiels. Nous traitons les algorithmes de petite longueur en détail. Ces algorithmes permettent de réduire la complexité arithmétique en gardant comme brique de base des filtres RIF d'ordre plus petit. Ils sont donc ouverts à diverses implantations. Nous étudions ensuite l'aspect arithmétique du multiplieur-accumulateur d'une part, et de nouvelles architectures d'autre part. Une conception compacte et régulière de l'arbre de Wallace est proposée pour surmonter les difficultés qui empêchaient l'application de cette structure par ailleurs très efficace au niveau du temps de calcul. Nous présentons quelques nouveaux accumulateurs rapides. L'architecture du filtre RIF par l'arithmétique distribuée est analysée en détail. Nous présentons de nouvelles structures ayant les caractéristiques suivantes : sans ROM ; avec l'additionneur carry-save comme brique de base; avec accumulation rapide. En particulier, un nouveau codage est proposé pour profiter de la symétrie des coefficients afin de réduire la quantité de matériel et d'accélérer le calcul.
50
Škrobánek, Kristián. "Vizualizace RDF dat ve webových prohlížečích." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445511.
Full textAbstract:
This diploma thesis focuses on graph database data visualization, where data is stored in RDF format. Standard visualisation of RDF data in tables does not offer sufficiently usable user view. One of the goals of this work is to show RDF data in interactive graph, which is ideal form of viewing data considering lucidity and information value. The graph gives good view of not only the data itself but also relationships between the data. Another goal is to test ability of browsers to visualize large amounts of data.