Artigos
URI permanente para esta coleçãohttps://rigalileo.itegam.org.br/handle/123456789/219
Artigos produzidos de convênios e parcerias com IES
Navegar
3 resultados
Resultados da Pesquisa
Item Keystroke-Based Biometric Authentication in Mobile Devices: Autenticação Biométrica Baseada em Dinâmica de Digitação em Dispositivos Móveis(INSTITUTO DE TECNOLOGIA, 2011) URTIGA, Edma Valleria Cunha; MORENO, Edward David; Prof. Dr. Carlos Tavares da Costa JúniorThis paper presents a model for biometric authentication based on keystroke dynamics in mobile devices. The model captures the time taken to press and release keys when a user types a password, comparing this information with previously stored data. Using the Euclidean distance method, the results achieved were a False Acceptance Rate (FAR) of 12.97% and a False Rejection Rate (FRR) of 2.25%. The study demonstrates that keystroke dynamics can be an effective tool for enhancing security in mobile authentication systems.Item Modelo para el análisis de la negociación en los proyectos de sistemas en una fábrica de software basado en puntos de casos de uso(INSTITUTO DE TECNOLOGIA, 2011) MACIEL, Paulo Henrique de Lima; LEITE, Jandecy Cabral; MEDEIROS, Adelson Bezerra de; Prof Dr. Walter Barra JuniorSystem modeling is increasingly used in academia to estimate team size, effort, software size, and total project cost. This article proposes a model based on Use Case Points (UCP), supported by techniques such as LOC, COCOMO, and Function Points. The model aims to assist managers in negotiations with clients, improving cost and time estimation. The model proved effective in simulating changes in system requirements and automatically calculating updated estimates.Item Uso de Algoritmo Cultural com uma Nova Abordagem Memética por meio do Simulated Annealing para o Problema do Caixeiro Viajante(INSTITUTO DE TECNOLOGIA, 2014) SILVA, Deam J. A.; SILVA, Joaquim A. L.; AFFONSO, Carolina M.; OLIVEIRA, Roberto C. L.; MAGALHÃES, Edilson MarquesThe paper proposes a hybrid algorithm combining Cultural Algorithms (CAs) and Genetic Algorithms (GAs), with local search via simulated annealing and 2-opt/3-opt heuristics, to solve the Traveling Salesman Problem (TSP). The aim is to overcome premature convergence and local optima traps common in traditional metaheuristics. Experiments with 442 and 532-city instances showed that the approach achieved solutions close to the known optimum, outperforming other methods in the literature.