[pt] Dentro do processo de publicação de dados na Web recomenda-se interligar os dados entre diferentes fontes, através de recursos similares que descrevam um domínio em comum. No entanto, com o crescimento do número dos conjuntos de dados publicados na Web de Dados, as tarefas de descoberta e seleção de dados tornam-se cada vez mais complexas. Além disso, a natureza distribuída e interconectada dos dados, fazem com que a sua análise e entendimento sejam muito demorados. Neste sentido, este trabalho visa oferecer uma arquitetura Web para a identificação de fontes de dados em RDF, com o objetivo de prover melhorias nos processos de publicação, interconex ão, e exploração de dados na Linked Open Data. Para tal, nossa abordagem utiliza o modelo de MapReduce sobre o paradigma de computa ção nas nuvens. Assim, podemos efetuar buscas paralelas por palavraschave sobre um índice de dados semânticos existente na Web. Estas buscas permitem identificar fontes candidatas para ligar os dados. Por meio desta abordagem, foi possível integrar diferentes ferramentas da web semântica em um processo de busca para descobrir fontes de dados relevantes, e relacionar tópicos de interesse denidos pelo usuário. Para atingir nosso objetivo foi necessária a indexação e análise de texto para aperfeiçoar a busca de recursos na Linked Open Data. Para mostrar a ecácia de nossa abordagem foi desenvolvido um estudo de caso, utilizando um subconjunto de dados de uma fonte na Linked Open Data, através do seu serviço SPARQL endpoint. Os resultados do nosso trabalho revelam que a geração de estatísticas sobre os dados da fonte é, de fato, um grande diferencial no processo de busca. Estas estatísticas ajudam ao usuário no processo de escolha de indivíduos. Um processo especializado de extração de palavras-chave é aplicado para cada indivíduo com o objetivo de gerar diferentes buscas sobre o índice semântico. Mostramos a escalabilidade de nosso processo de recomendação de fontes RDF através de diferentes amostras de indivíduos. / [en] In the Web publishing process of data it is recommended to link the data from different sources using similar resources that describe a domain in common. However, the growing number of published data sets on the Web have made the data discovery and data selection tasks become increasingly complex. Moreover, the distributed and interconnected nature of the data causes the understanding and analysis to become too prolonged. In this context, this work aims to provide a Web architecture for identifying RDF data sources with the goal of improving the publishing, interconnection, and data exploration processes within the Linked Open Data. Our approach utilizes the MapReduce computing model on top of the cloud computing paradigm. In this manner, we are able to make parallel keyword searches over existing semantic data indexes available on the web. This will allow to identify candidate sources to link the data. Through this approach, it was possible to integrate different semantic web tools and relevant data sources in a search process, and also to relate topics of interest denied by the user. In order to achieve our objectives it was necessary to index and analyze text to improve the search of resources in the Linked Open Data. To show the effectiveness of our approach we developed a case study using a subset of data from a source in the Linked Open Data through its SPARQL endpoint service. The results of our work reveal that the generation and usage of data source s statistics do make a great difference within the search process. These statistics help the user within the choosing individuals process. Furthermore, a specialized keyword extraction process is run for each individual in order to create different search processes using the semantic index. We show the scalability of our RDF recommendation process by sampling several individuals.

L’histoire des mots est souvent liée à l’histoire des Hommes ; à moins que ce ne soit l’inverse. Si la réparation n’avait pas réussi à s’émanciper de la sanction, le concept de responsabilité civile ne serait jamais né. Né par la réparation et pour la réparation, il lui a toujours été associé. Encore aujourd’hui, de nombreux auteurs tiennent ces deux notions pour synonymes . Pourtant, la responsabilité civile a muri et elle s’est montrée apte à remplir d’autres fonctions que la réparation des dommages causés ; des fonctions d’abord accessoires – normative, préventive et punitive –, puis des fonctions alternatives – comme la cessation de l’illicite et le paiement. A priori le tryptique – dommage, fait générateur, lien de causalité –, qui conditionne sa mise en jeu, était adapté à sa fonction de réparation ; il l’est peut être moins à ses nouvelles fonctions. C’est ce que nous tenterons d’éprouver dans une première partie.Une fois les frontières du tryptique – dommage, fait générateur, lien de causalité –clairement dessinées, nous nous intéresserons à son fonctionnement. La capacité qu’a une seule et même institution – la responsabilité civile – à remplir des fonctions si différentes que la réparation, la punition, la cessation de l’illicite, ou encore le paiement, interpelle nécessairement. Les relations existant entre les conditions de la responsabilité pourraient l’expliquer. C’est ce que nous tenterons de démontrer dans une seconde partie. / The history of words is often linked to the history of men; unless it's the other way around. If the remedy failed to break free of the penalty, the concept of civil liability would never be born. Born by repair and for repair, it has always been associated with it. Even today, many authors take these two notions for synonyms. However, civil liability has matured and it has shown itself capable of performing other functions than repairing the damage caused; functions first ancillary - normative, preventive and punitive - and then alternative functions - such as cessation of illicit and payment. A priori, the triptych - a damage, a generative event, a causal link - which conditions is putting into play, was adapted to its reparation function; he may be less so with his new duties. This is what we will try to test in the first part.Once the borders of the triptych - damage, generating fact, causal link - clearly drawn, we will focus on its operation. The ability of one and the same institution - civil liability - to perform functions so different that reparation, punishment, cessation of the wrongful act, or even payment, is necessary necessary. The relations existing between the conditions of the responsibility could explain it. This is what we will try to demonstrate in a second part.

This study focuses on students' link-making and the teachers' approaches to teach science in primary school. The purpose of the study is to analyze and illuminate the discursive mobility in students' teaching to be able to create meaning from the knowledge that in return leads to meaningful learning. The method used for the study has been observations, these have been performed in two classes at two different schools in two different towns. The students observed are Swedish fourth graders and the observations have been supplemented with audio recording for more secure transcription. The study examined when the link-making of the students took place and what discourses / contexts they moved between, but also what influence different structures of teaching have on the students' link-making. The study has shown that classical teacher-centered teaching seems to be under a less favorable category as the structure of the teaching affects the possibilities for link-making. The study also shows how important it is for active teachers to be aware of the importance of offering students opportunities for link-making between different domains. Teaching with planned discussion sessions has shown positive reactions for both the link building among the students and students' interest and commitment to the subject.

Computational drug repurposing aims at finding new medical uses for existing drugs. The identification of novel drug-target interactions (DTIs) can be a useful part of such a task. Computational determination of DTIs is a convenient strategy for systematic screening of a large number of drugs in the attempt to identify new DTIs at low cost and with reasonable accuracy. This necessitates development of accurate computational methods that can help focus on the follow-up experimental validation on a smaller number of highly likely targets for a drug. Although many methods have been proposed for computational DTI prediction, they suffer the high false positive prediction rate or they do not predict the effect that drugs exert on targets in DTIs. In this report, first, we present a comprehensive review of the recent progress in the field of DTI prediction from data-centric and algorithm-centric perspectives. The aim is to provide a comprehensive review of computational methods for identifying DTIs, which could help in constructing more reliable methods. Then, we present DDR, an efficient method to predict the existence of DTIs. DDR achieves significantly more accurate results compared to the other state-of-theart methods. As supported by independent evidences, we verified as correct 22 out of the top 25 DDR DTIs predictions. This validation proves the practical utility of DDR, suggesting that DDR can be used as an efficient method to identify 5 correct DTIs. Finally, we present DDR-FE method that predicts the effect types of a drug on its target. On different representative datasets, under various test setups, and using different performance measures, we show that DDR-FE achieves extremely good performance. Using blind test data, we verified as correct 2,300 out of 3,076 DTIs effects predicted by DDR-FE. This suggests that DDR-FE can be used as an efficient method to identify correct effects of a drug on its target.

In this thesis, we investigate two different system infrastructures in underlay cognitive radio network, in which two popular techniques, cross-layer design and cooperative communication, are considered, respectively. In particular, we introduce the Aggressive Adaptive Modulation and Coding (A-AMC) into the cross-layer design and achieve the optimal boundary points in closed form to choose the AMC and A-AMC transmission modes by taking into account the Channel State Information (CSI) from the secondary transmitter to both the primary receiver and the secondary receiver. What’s more, for the cooperative communication design, we consider three different relay selection schemes: Partial Relay Selection, Opportunistic Relay Selection and Threshold Relay Selection. The Probability Density Functions (PDFs) of the Signal-to- Noise Ratio (SNR) in each hop for different selection schemes are provided, and then the exact closed-form expressions for the end-to-end packet loss rate in the secondary link considering the cooperation of the Decode-and-Forward (DF) relay for different relay selection schemes are derived.

No description available.

This thesis deals with network substandards from the TSN group (IEEE 802.1Q), which deal with prioritization of network traffic in TSN networks. These sub-standards include 802.1QBV and 802.1QBU, which have been described in more detail and compared in terms of network permeability and latency. Substandard 802.1QBU was chosen for the design implementation in FPGA. The design was described in VHDL. The designed design was verified by simulations, using self-tests. The work includes synthesis and time analysis.

This thesis deals with network substandards from the TSN group (IEEE 802.1Q), which deal with prioritization of network traffic in TSN networks. These sub-standards include 802.1QBV and 802.1QBU, which have been described in more detail and compared in terms of network permeability and latency. Substandard 802.1QBU was chosen for the design implementation in FPGA. The design was described in VHDL. The devloped design was verified by simulations, using self-tests. The work includes synthesis and time analysis.

The aim of this work is a static analysis of the reinforced concrete frame structure loaded by the effects of seismic loading. The work deals with the solution of multi-storey reinforced concrete structure designed for common loading conditions and further for possibilities of strengthening of the structure on effect of seismic loading. In the first phase of the work, the static analysis and the design of the main load-bearing elements of the frame structure (columns and main girder) were carried out for the ultimate limit state for the standard design load. In the second phase, the static analysis of the structure for the effects of accidental actions from low and high seismicity was performed and it was assessed whether the main load-bearing elements of the structure would continue to comply. Given that the structure did not satisfy the accidental actions of seismic loading, various ways of structure strengthening were designed and analyzed for their impact on the global and local behaviour of the structure. Also the designing of additional steps for structural reliability were performed. Static analyzes were performed in Scia Engineering and RFEM Dlubal software.

This thesis concerns the mathematical modeling of transportation systems for improved decision support and analysis of transportation-related problems. The main purpose of this thesis is to develop and evaluate models and methods that exploit link flows. Link flows are straightforward to obtain by measurements or estimation methods and are commonly used to describe the traffic state. The models and methods used in this thesis apply mathematical optimization techniques, computer simulations, and probabilistic methods to gain insights into the transportation network under study and provide benefits for both traffic managers and road users.  First, we present an optimization model for allocating charging stations in a transportation network to serve owners of electric vehicles. The model utilizes a probabilistic route selection process to detect locations through which vehicles may pass. It also considers the limited driving range of electric vehicles. The iterative solution procedure finds the minimal number of minimal charging stations and their locations, which provides a lower bound of charging stations to cover each of the considered routes. Second, we present a case study, in which we argue that stationary and mobile measurement devices possess complementary characteristics. In that study, we investigate how speed cameras and probe vehicles can be used in conjunction with each other for the collection of detailed traffic data. The results show that the share of successfully observed and identified vehicles can be significantly improved by using both stationary and mobile measurement devices. Third, we present a simulation model with the intent of finding the most probable underlying routes based on hourly link flows. The model utilizes Dijkstra's algorithm to find the shortest paths and uses a straightforward statistical test procedure to find the most significant routes in the network based on replicated movements of trucks. Finally, we investigate the possibility to study how the traffic flow in one location reflects the flows in the surrounding area. The statistical basis of the proposed model is built upon measured link flows to study the dispersion of aggregate traffic flows in nodes. By considering the alternative ways vehicles can travel between locations, the model is able to determine the expected link flow that originates from a node in a nearby region. The results of the thesis show that the link flows, which are basic descriptors of the road segments in a transportation network, can be used to study a broad range of problems in transportation.