Orientador: Jose Claudio Geromel / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-10T01:06:21Z (GMT). No. of bitstreams: 1 Fioravanti_AndreRicardo_M.pdf: 793181 bytes, checksum: 6f60b78faabe194cc22f2cc3157f0d90 (MD5) Previous issue date: 2007 / Resumo: Esta dissertação tem par principal objetivo o estudo do problema de projeto de filtros H2 e Hoo de sistemas lineares discretos com parâmetros sujeitos a saltos markovianos. Inicialmente, sob a hipótese de que o parâmetro da cadeia de Markov é mensurável, fornecemos a caracterização de todos os filtros tais que o erro de estimação é limitado por uma norma, produzindo a solução completa do problema de projeto dependente do modo da cadeia. Baseado neste resultado, consideramos o projeto do filtro robusto capaz de lidar com incertezas paramétricas. Em seguida, propomos um procedimento de projeto de filtros sem o conhecimento da cadeia. Todos os problemas de filtragem são expressos em termos de desigualdades matriciais lineares. Os resultados teóricos são ilustrados através de uma aplicação prática que consiste na comunicação de dados através de um canal markoviano / Abstract: This thesis addresses the H2 and Hoo filtering design problem of discrete-time Markov jump linear systems. First, under the assumption that the Markov parameter is measurable, we provide the characterization of all filters such that the estimation errar remains bounded by a given narm leveI, yielding the complete solution of the mode-dependent filtering design problem. Based on this result, a robust filter design to deal with convex bounded parameter uncertainty is considered. In the sequeI, a design procedure for modeindependent filtering design is proposed. All filters are designed by solving linear matrix inequalities. The theory is illustrated by means of a practical example, consisting the data communication through a markovian channel / Mestrado / Automação / Mestre em Engenharia Elétrica

Social networking has encouraged users to find new ways to create, post, search, collaborate and share information of various forms. Unfortunately there is a lot of data in social networks that is not well-managed, which makes the experience within these networks less than optimal. Therefore people generally need more and more time as well as advanced tools that are used for seeking relevant information. A new search paradigm is emerging, where the user perspective is completely reversed: from finding to being found. The aim of present thesis research is to evaluate two approaches of identifying content of interest: user-initiated and system-initiated. The most suitable approaches will be implemented. Various recommendation systems for system-initiated content recommendations will also be investigated, and the best suited ones implemented. The analysis that was performed demonstrated that the users have used all of the implemented approaches and have provided positive and negative comments for all of them, which reinforces the belief that the methods for the implementation were selected correctly. The results of the user testing of the methods were evaluated based on the amount of time it took the users to find the desirable content and on the correspondence of the result compared to the user expectations.

La navigation dans les environnements contraints tels que les zones portuaires ou les zones urbainesdenses est souvent exposée au problème du masquage des satellites GPS. Dans ce cas, le recours auxcapteurs proprioceptifs est généralement la solution envisagée pour localiser temporairement le véhiculesur une carte. Cependant, la dérive de ces capteurs met rapidement en défaut le système de navigation.Pour localiser le véhicule, on utilise dans cette thèse, un magnétomètre pour la mesure du cap dans unrepère absolu, un capteur de vitesse et une carte numérique du réseau de routes.Dans ce contexte, le premier apport de ce travail est de proposer la mise en correspondance desmesures de cap avec la carte numérique (map matching) pour localiser le véhicule. La technique proposéefait appel à un filtre particulaire défini dans le domaine circulaire et à un préfiltrage circulairedes mesures de cap. On montre que cette technique est plus performante qu’un algorithme de map matchingtopologique classique et notamment dans le cas problématique d’une jonction de route en Y. Ledeuxième apport de ce travail est de proposer un filtre circulaire multi-modèles CIMM défini dans uncadre bayésien à partir de la distribution circulaire de von Mises. On montre que l’intégration de cettenouvelle approche dans le préfiltrage et l’analyse des mesures de cap permet d’améliorer la robustesse del’estimation de la direction pendant les virages ainsi que d’augmenter la qualité du map matching grâce àune meilleure propagation des particules du filtre sur le réseau de routes. Les performances des méthodesproposées sont évaluées sur des données synthétiques et réelles. / Navigation in constrained areas such as ports or dense urban environments is often exposed to theproblem of non-line-of-sight to GPS satellites. In this case, proprioceptive sensors are generally used totemporarily localize the vehicle on a map. However, the drift of these sensors quickly cause the navigationsystem to fail. To localize the vehicle, a magnetometer is used in this thesis for heading measurementunder an absolute reference together with a velocity sensor and a digital map of the road network.In this context, the first contribution of this work is to provide a matching of the vehicle’s headingwith the digital map (map matching) to localize the vehicle. The proposed technique uses a particle filterdefined in the circular domain and a circular pre-filtering on the heading measurements. It is shown thatthis technique is more efficient than a conventional topological map matching algorithm, particularly inambiguous cases like a Y-shape road junction. The second contribution of this work is to propose a circularmultiple model filter CIMM defined in a Bayesian framwork from the von Mises circular distribution.It is shown that the integration of this new approach in the pre-filtering and analysis of the heading observationsimproves the robustness of the heading’s estimation during cornering and increases the mapmatching’s quality through a better propagation of the particles on the road network. The performancesof the proposed methods are evaluated on synthetic and real data.

No description available.

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2017-07-12T13:47:04Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) risethesis.pdf: 1393384 bytes, checksum: f5f2fb9182ce60a9c5d2b0cd95f2893a (MD5) / Made available in DSpace on 2017-07-12T13:47:04Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) risethesis.pdf: 1393384 bytes, checksum: f5f2fb9182ce60a9c5d2b0cd95f2893a (MD5) Previous issue date: 2016-06-29 / Em meio a grande sobrecarga de dados disponíveis na internet, sistemas de recomendação tornam-se ferramentas indispensáveis para auxiliar usuários no encontro de itens ou conteúdos relevantes. Diversas técnicas de recomendação são aplicadas em diversos tipos de domínios diferentes. Seja na recomendação de filmes, música, amigos, lugares ou notícias, sistemas de recomendação exploram diversas informações disponíveis para aprender as preferências dos usuários e promover recomendações úteis. Uma das estratégias mais utilizadas é a de filtragem colaborativa. A qualidade dessa estratégia depende da quantidade de avaliações disponíveis e da qualidade do algoritmo utilizado para predição de avaliação. Estudos recentes demonstram que informações provenientes de redes sociais podem ser muito úteis para aumentar a precisão das recomendações. Assim como acontece no mundo real, no mundo virtual usuários buscam recomendações e conselhos de amigos antes de comprar um item ou consumir algum serviço, informações desse tipo podem ser úteis para definição do contexto social da recomendação. Além do social, informações físicas e temporais passaram a ser utilizadas para definição do contexto físico de cada recomendação. A companhia, a localização e as condições climáticas são bons exemplos de elementos físicos que levam um usuário a preferir certos itens. Um processo de recomendação que não leve em consideração elementos contextuais pode fazer com que o usuário tenha uma péssima experiência consumindo determina do item recomendado equivocadamente. Esta dissertação tem como objetivo investigar técnicas de filtragem colaborativa que utilizam contexto a fim de realizar recomendações que auxiliem usuários no encontro de itens relevantes. Nesse tipo de técnica, um sistema de recomendação base é utilizando para fornecer recomendações para o usuário alvo. Em seguida, são filtrados apenas os itens considerados relevantes para contextos previamente identificados nas preferências do usuário alvo. As técnicas implementadas foram aplicadas em dois experimentos com duas bases de dados de domínios diferentes: uma base composta por eventos e outra por filmes. Na recomendação de eventos, investigamos o uso de contextos físicos (i.e., tempo e local) e de contextos sociais (i.e., amigos na rede social) associados aos itens sugeridos aos usuários. Na recomendação de filmes, por sua vez, investigamos novamente o uso de contexto social. A partir da aplicação de pós-filtragem em três algoritmos de filtragem colaborativa usados como base, foi possível recomendar itens de forma mais precisa, como demonstrado nos experimentos realizados. / The overload of data available on the internet makes recommendation systems become indispensable tools to assist users in meeting items or relevant content. Several recommendation techniques were has been userd in many different types of domains. Those systems can recommend movies, music, friends, places or news; recommender systems can exploit different information available to learn preferences of users and promote more useful recommendations. The collaborative filtering strategy is one of the most used. The quality of this technique depends on the number of available ratings and the algorithm used to predict. Recent studies show that information from social networks can be very useful to increase the accuracy recommendations. Just as in the real world, the virtual world users ask recommendations and advice from friends before buying an item or consume a service. Furthermore, the context of each rating may be crucial for the definition of new ratings. Location, date time and weather conditions are good examples of useful elements to define what should be the best items to recommend for some user. A recommendation process that does not respect those elements can provide a user a bad experience. This dissertation investigates collaborative filtering techniques based on context, and more specifically techniques based on post-filtering. First, a recommendation system was used to provide recommendations for a specific user. Then, only relevant items according to context preferences for the target user will be recommended. The techniques implemented was applied in two case studies with two different domains databases: one base composed of events and another of movies. In the event of recommendation, we investigated the use of physical contexts (i.e., time and place) and social contexts (i.e., friends in the social network) associated with items suggested to users. On the recommendation of movies, in turn, again we investigated the use of social context. From the application of post-filtering in three collaborative filtering algorithms used as a baseline, it was possible to recommend items more accurately, as demonstrated in the experiments.

abstract: For the last 50 years, oscillator modeling in ranging systems has received considerable attention. Many components in a navigation system, such as the master oscillator driving the receiver system, as well the master oscillator in the transmitting system contribute significantly to timing errors. Algorithms in the navigation processor must be able to predict and compensate such errors to achieve a specified accuracy. While much work has been done on the fundamentals of these problems, the thinking on said problems has not progressed. On the hardware end, the designers of local oscillators focus on synthesized frequency and loop noise bandwidth. This does nothing to mitigate, or reduce frequency stability degradation in band. Similarly, there are not systematic methods to accommodate phase and frequency anomalies such as clock jumps. Phase locked loops are fundamentally control systems, and while control theory has had significant advancement over the last 30 years, the design of timekeeping sources has not advanced beyond classical control. On the software end, single or two state oscillator models are typically embedded in a Kalman Filter to alleviate time errors between the transmitter and receiver clock. Such models are appropriate for short term time accuracy, but insufficient for long term time accuracy. Additionally, flicker frequency noise may be present in oscillators, and it presents mathematical modeling complications. This work proposes novel H∞ control methods to address the shortcomings in the standard design of time-keeping phase locked loops. Such methods allow the designer to address frequency stability degradation as well as high phase/frequency dynamics. Additionally, finite-dimensional approximants of flicker frequency noise that are more representative of the truth system than the tradition Gauss Markov approach are derived. Last, to maintain timing accuracy in a wide variety of operating environments, novel Banks of Adaptive Extended Kalman Filters are used to address both stochastic and dynamic uncertainty. / Dissertation/Thesis / Doctoral Dissertation Electrical Engineering 2020

Recommendation Systems or Recommender Systems have become widely popular due to surge of information at present time and consumer centric environment. Researchers have looked into a wide range of recommendation systems leveraging a wide range of algorithms. This study investigates three popular recommendation systems in existence, Collaborative Filtering, Content-Based Filtering, and Hybrid recommendation system. The famous MovieLens dataset was utilized for the purpose of this study. The evaluation looked into both quantitative and qualitative aspects of the recommendation systems. We found that from both the perspectives, the hybrid recommendation system performs comparatively better than standalone Collaborative Filtering or Content-Based Filtering recommendation system

The thesis deals with possibilities of using wavelet transform in applications dealing with noise reduction, primarily in the field of ECG signals denoising. We assess the impact of the various filtration parameters setting as the thresholding wavelet coefficients method, thresholds level setting and the selection of decomposition and reconstruction filter banks.. Our results are compared with the results of linear filtering. The results of wavelet Wieners filtration with pilot estimation are described below. Mainly, we tested a combination of decomposition and reconstruction filter banks. All the filtration methods described here are tested on real ECG records with additive myopotential noise character and are implemented in the Matlab environment.

This study was conducted to investigate how well deep learning can be applied to the field of tag recommender systems. In the context of an image item, tag recommendations can be given based on tags already existing on the item, or on item content information. In the current literature, there are no works which jointly models the tags and the item content information using deep learning. Two tag recommender systems were developed. The first one was a highly optimized hybrid baseline model based on matrix factorization and Bayesian classification. The second one was based on deep learning. The two models were trained and evaluated on a dataset of user-tagged images and videos from Flickr. A percentage of the tags were withheld, and the evaluation consisted of predicting them. The deep learning model attained the same prediction recall as the baseline model in the main evaluation scenario, when half of the tags were withheld. However, the baseline model generalized better to the sparser scenarios, when a larger number of tags were withheld. Furthermore, the computations of the deep learning model were much more time-consuming than the computations of the baseline model. These results led to the conclusion that the baseline model was more practical, but that there is much potential in using deep learning for the purpose of tag recommendation. / Den här studien genomfördes i syfte att undersöka hur effektivt djupinlärning kan användas för att konstruera rekommendationssystem för taggar. När det gäller bildobjekt så kan taggar rekommenderas baserat på taggar som redan förekommer på objektet, samt på information om objektet. I dagens forskning finns det inte några publikationer som presenterar ett rekommendationssystem baserat på djupinlärning som bygger på att gemensamt använda taggarna och objektsinformationen. I studien har två rekommendationssystem utvecklats. Det första var en referensmodell, ett väloptimerat hybridsystem baserat på matrisfaktorisering och bayesiansk klassificering. Det andra systemet baserades på djupinlärning. De två modellerna tränades och utvärderades på en datamängd med bilder och videor taggade av användare från Flickr. En procentandel av taggarna var undanhållna, och utvärderingen gick ut på att förutsäga dem. Djupinlärningsmodellen gav förutsägelser av samma kvalitet som referensmodellen i det primära utvärderingsscenariot, där hälften av taggarna var undanhållna. Referensmodellen gav dock bättre resultat i de scenarion där alla eller nästan alla taggar var undanhållna. Dessutom så var beräkningarna mycket mer tidskrävande för djupinlärningsmodellen jämfört med referensmodellen. Dessa resultat ledde till slutsatsen att referensmodellen var mer praktisk, men att det finns mycket potential i att använda djupinlärningssystem för att rekommendera taggar.

With an overwhelming number of movies available globally, it can be a daunting task for users to find movies that cater to their individual preferences. The vast selection can often leave people feeling overwhelmed, making it challenging to pick a suitable movie. As a result, movie service providers need to offer a recommendation system that adds value to their customers. A movie recommendation system can help customers in this regard by providing a process that assists in finding movies that match their preferences. Previous studies on recommendation systems that use Machine Learning (ML) algorithms have demonstrated that these algorithms outperform some of the existing recommendation methods regarding recommendation strategy. However, there is still room for further improvement, especially when it comes to exploring scenarios where users need to spend a considerable amount of time finding movies related to their preferred genres. This prolonged search for the right movies can give rise to problems such as data sparsity and cold start. To address these issues, we propose a machine learning-based recommender system for movie genres using the K-nearest Neighbours (KNN) algorithm. Our final system utilizes a slider bar on a Streamlit web app, allowing users to select their preferred movies and see recommendations for similar movies. By incorporating user preferences, our system provides personalized recommendations that are more likely to meet the user's interests and preferences. To address our research question: “How and to what extent can a machine learning-based recommender system be developed focusing on movie genres where movie popularity can be predicted based on its content?” we propose three main research objectives. Firstly, we investigate the employment of a classification algorithm in recommending movies focusing on interest genres. Secondly, we evaluate the performance of our classification algorithm concerning movie viewers. Thirdly, we represent the popularity of movie genres based on the content and investigate how this representation can inform the movie recommendation algorithm. On the heels of an experimental strategy, we extract and pre-process a dataset of movies and their associated genre labels from Kaggle. The dataset consists of two files derived from The Movie Database (TMDB) 5000 Movie Dataset. We develop a machine learning-based recommender system based on the similarity of movie genres using the extracted and pre-processed dataset. We vary the KNN algorithm with a slider bar to recommend movies of varying similarity to the selected movie, ranging from similar to diverse in genre. This approach can suggest movies with different titles for users with diverse preferences. We evaluate the performance of the KNN classification algorithm using a user's interest genres, measuring its accuracy, precision, recall, and F1-score. The algorithm's accuracy ranges from low to moderate across different values of K, indicating its moderate effectiveness in predicting user preferences. The algorithm's precision ranges from moderate to high, implying that it provides accurate recommendations to the user. The recall score improves with increasing K and reaches its maximum at K=15, demonstrating its ability to retrieve relevant recommendations. The algorithm achieves a good balance between precision and recall, with an average F1-score of 0.60. This means that the algorithm can accurately identify relevant movies and recommend them to users with a high degree of accuracy. Furthermore, our result shows that the popularity visualization technique using KNN is a powerful tool for analysing and understanding the popularity of different movie genres, which can inform important decisions related to marketing, distribution, and production in the movie industry. In conclusion, our machine learning-based recommender system using KNN for movie genres is a game changer. It allows users to select their preferred movies and see recommendations for similar movies using a slider bar on a Streamlit web app. If confirmed by future research, the promising findings of this thesis can pave the way for developing and incorporating other classification algorithms and features for movie recommendation and evaluation. Furthermore, the adjustable slider bar ranges on the Streamlit web app allow users to customize their movie preferences and receive tailored recommendations.