Bacharelado em Sistemas de Informação (Sede)
URI permanente desta comunidadehttps://arandu.ufrpe.br/handle/123456789/12
Siglas das Coleções:
APP - Artigo Publicado em Periódico
TAE - Trabalho Apresentado em Evento
TCC - Trabalho de Conclusão de Curso
Navegar
4 resultados
Resultados da Pesquisa
Item Modelo e algoritmos para seleção de sensores como serviço(2019) Verçosa, Nichene Joslin; Gonçalves, Glauco Estácio; Medeiros, Victor Wanderley Costa de; http://lattes.cnpq.br/7159595141911505; http://lattes.cnpq.br/6157118581200722; http://lattes.cnpq.br/3645909376039196The Internet of Things (IoT) plays a key role in the future of the Internet, as it will inte-grate billions of smart devices which will present sensing, actuation and data processingcapabilities. Thus, each integrated device may have one or more built-in sensors thatwill potentially generate huge amounts of data. This scenario raises the challenge ofefficiently searching and selecting the most appropriate sensors within a set that canpresent similar functionalities and capabilities. In this context, this work presents a math-ematical model for sensor selection able to maximize the attendance to user input re-quirements, such as accuracy, robustness, and availability for different types of sensors(such as temperature, pressure, humidity, wind speed, and so on) in a limited budget.This model was tested through two algorithms, the first being an optimization algorithmand the second a greedy heuristic. These solutions were evaluated and compared interms of three criteria: the optimization time, the amount of budget being utilized, andthe optimal value. The best solutions were found by the optimization algorithm but, thegreedy heuristic found close results. In some cases, the greedy heuristic found solu-tions more than 10x faster when compared to the Optimal Algorithm.Item Método para Estimativa de Trajeto Baseado em Dados de Unidades de Medição Inercial(2019) Silva, Lucas Filipe Vieira da; Medeiros, Victor Wanderley Costa de; Gonçalves, Glauco Estácio; http://lattes.cnpq.br/6157118581200722; http://lattes.cnpq.br/7159595141911505; http://lattes.cnpq.br/1223833449629855The Internet of Things (IoT) has emerged as a new vision for the Internet, where awide range of devices can connect to the network. This concept is directly related tothe technological advances experienced in the development of semiconductors andintegrated circuits. These devices became cheaper, smaller, and more power efficient.These advances also enable the emergence of new applications, like real-time localiza-tion. Precise location through orientation plays a critical role in estimating the tracking ofa sensor attached to an object. The main objective of this work is to evaluate, through ex-perimentation, a trajectory estimation method based on the gradient descent algorithmand acceleration and rotation data activated by a low-cost Inertial Measurement Unit(IMU). The experiment was performed by collecting data in a straight walk, performed30 times, at a frequency of 100Hz and 50Hz. The equipment used was an MPU-6050sensor coupled to a TTGO T-Beam development board. The localization estimationswere calculated by an algorithm written in Python language. The results have shownthat it is possible to use an IMU to estimate a trajectory performed by a person withreasonable accuracy, adopting a sample rate of 50Hz.Item Um algoritmo para geração de Navigation Meshes em mapas bidimensionais homogêneos: uma aplicação no jogo Dragon Age: Origins(2019) Costa, Ingrid Danielle Vilela; Bocanegra, Silvana; http://lattes.cnpq.br/4596111202208863; http://lattes.cnpq.br/6113606913639280In the field of electronic gaming and more recently in robotics, autonomous agent soften need to repeatedly solve the problem of searching for the smallest path. This need can eventually consume a lot of resources and demands optimizations to make these searches more efficient. Such optimizations may include improvements in search algorithms, map representation, data structures used. This work presents an optimization for search algorithms based on the reduction of the search space by means of an automatic Navigation Meshes generation algorithm which are networks of walka blemap areas implying in a reduction of the search space and consequently improving the search processing time. The generation of Navigation Meshes is a problem with no consolidated solution. To prove the heuristic, path finding problems were solved on 156 benchmark maps. The path findings were performmed by the A* algorithm and the solutions were compared between the original maps and the optimized ones. An average search space reduction of 97.42% was achieved, with a standard deviation of 0.026and the search had an average marginal reduction in execution time of 46.76%.Item Aspect term extraction in aspect-based sentiment analysis(2019) Francisco, Alesson Delmiro; Lima, Rinaldo José de; http://lattes.cnpq.br/7645118086647340The increasing use of the Internet in many directions has created a necessity to analyze alarge quantity of data. A large amount of data is presented as Natural Language Text,which is unstructured, with many ways to express the same information. It is an importanttask to extract information and meaning from those unstructured content, such as opinionson products or services. The need to extract and analyze the large amount of data createdevery day on the Internet surpassed the capabilities of human ability, as a result, manytext mining applications that extract and analyze textual data produced by humans areavailable today, one of such kind of applications is Sentiment Analysis, viewed as a vitaltask both to the academic and commercial fields, so that companies and service providerscan use that knowledge extracted from textual documents to better understand how theircustomers think about them or to know how their products and services are appreciated ornot by their customers. However, the task of analysing unstructured text is a difficult one,that is why it is necessary to provide coherent information and concise summaries to thoserevisions. Sentiment Analysis is the process of computationally identifying and categorizingopinions expressed in a piece of text, especially in order to determine the writer’s attitudetowards a particular topic or product. Aspect-Based Sentiment Analysis is a sub-field ofSentiment Analysis that aims to extract more refined and exact opinions, by breakingdown text into aspects. Most of the current work in the literature does not take profitof either semantic-based resources or NLP-based analysis in the preprocessing stage. Tocountermeasure these limitations, a study on these resources is done aiming to extract thefeatures needed to execute the task, and to make the best combination for ATE. This workhas the main goal of implementing and analysing a method of Aspect Term Extraction(ATE) of users reviews (restaurants and laptops). The proposed method is based on asupervised approach called Conditional Random Fields (CRF) which is able to optimizethe use of features for classification, this choice was justified by previous related work thatdemonstrate the effectiveness of CRF for ATE. Also, we are investigating the existingmethods and features for ABSA, as well as proposing new features and experimentingwith feature combinations in order to find the best features combinations, that are not yetcovered in the state of art. The detailed study is done by experimenting with word features,n-grams and custom made features using an CRF supervised algorithm to accomplish thetask of Aspect Term Extraction with results in terms of Precision, Recall and F-measure,the standard evaluation metrics adopted in the field. Finally, a comparative assessmentbetween the proposal method for ATE against other related work presented in the literaturehas shown that the method presented by this work is competitive.