Ciencias Exactas y Ciencias de la Salud
Permanent URI for this collectionhttps://hdl.handle.net/11285/551039
Pertenecen a esta colección Tesis y Trabajos de grado de las Maestrías correspondientes a las Escuelas de Ingeniería y Ciencias así como a Medicina y Ciencias de la Salud.
Browse
Search Results
- PassID: A Modular System for Pass Detection with Integrated Player Identification in Football(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2024-12) Gutiérrez Padilla, Benjamín; Monroy Borja, Raúl; emimmayorquin; Gutiérrez Rodríguez, Andrés Eduardo; School of Engineering and Sciences; Campus Monterrey; Conant Pablos, Santiago EnriqueThe analysis of football passes plays a crucial role in understanding team tactics and improving performance. However, current methods for capturing and analyzing this data are often inaccessible due to high costs and reliance on proprietary datasets. This thesis presents the development of an automated system designed to detect passes in football matches using video as the source of information. The system integrates computer vision and machine learning techniques across mul tiple modules, including player and ball detection, object tracking, team identification, and pass detection. Using a hybrid approach with YOLOv9 for player detection, FasterRCNN for the ball, and Norfair for tracking, the system assigns unique identifiers to players and determines passes based on proximity and ball possession changes. Team identification is achieved through color histogram analysis, allowing the system to distinguish valid passes between players of the same team. The modular design enables independent improvements in each component, providing a flexible framework that can be adapted to different match conditions. This work represents a step forward in automating football pass detection, contributing to the growing field of sports analysis with a scalable and efficient solution.
- Characterisation of visitors and description of their navigation behaviour using web log mining techniques(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2021-02) Huidobro Espejel, Alicia; MONROY BORJA, RAUL; 12232; Monroy Borja, Raúl; hermlugo, emipsanchez; Loyola González, Octavio; Graff Guerrero, Mario; Escuela de Ingeniería y Ciencias; Campus Estado de México; Cervantes González, BárbaraThe value of a company’s website depends on visitors performing actions that add value for the company. Those actions are called conversions. We present techniques for both characterising website visitors in terms of the conversions they make, and describing their navigation behaviour in an abstract way, with the aim of making them more amenable to interpretation. Existing web analytics techniques have not been designed to highlight the distinguishing characteristics of a class of visitors. There are no approaches for characterising classes of visitors that take into account specific business goals; further, the navigation behaviour of a visitor, let alone a class of visitors, is conveyed as a sequence of visited pages, without giving this an abstract meaning. In this thesis, we introduce a means of characterising website visitors. To find what the different segments of visitors have or do not have in common, we first separate visitor sessions in terms of conversions and then for each class we mine patterns to contrast one another. We also introduce a simplified description of visitor navigation behaviour. Our technique works by identifying subsequences of visited pages of common occurrence, called ``rules'', and then by shrinking a session replacing those rules with a symbol that is given a representative name. Further, we extended this to an entire class of visitors, creating a graph that collects the class sessions, summarising the class navigation behaviour and enabling an easier contrast of classes. Our results show that a few patterns are enough to characterise a visitor class; since each class is associated with a conversion, an expert can easily draw conclusions as to what makes two classes different from one another. Also, with our abstract representation, a session can be shrinked so that the behaviour of an entire visitor class can be depicted in a moderately small graph. Further work is concerned with incorporating information from other sales channels and completing the analysis provided by existing techniques.
- Algoritmo ID3 en la detección de ataques en aplicaciones Web(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2005-07-01) García Pichardo, Víctor Hugo; MONROY BORJA, RAUL; 720773; Monroy Borja, Raúl; Quintana López, Marisela; Gómez Cárdenas, Roberto; Mac Kinney Romero, René; Campus Estado de MéxicoActualmente con el propósito de tener presencia en el mercado mundial, toda empresa cuenta con una página en Internet donde exhibe información sobre sus servicios y aplicaciones. Una empresa de esta índole al menos cuenta con un cortafuegos1 como esquema de protección, permitiendo circular el tráfico HTTP o HTTPS (puertos 80 y 443 respectivamente).En diciembre del 2003, la empresa de seguridad informática española S2ISEC realizó un estudio durante los últimos cinco meses (junio-noviembre), en el que pudo establecerse que de 2113 vulnerabilidades publicadas, 1320 vulnerabilidades tienen su origen en aplicaciones web [1]. Lo cual representa un 62.5% de las vulnerabilidades reportadas. Dicho porcentaje refleja no sólo la gran cantidad de problemas de seguridad en las aplicaciones que soportan o manejan este tipo de servicio, sino también el alto riesgo al que están expuestas las organizaciones con una presencia Web hacia Internet. Las empresas, con la finalidad de disminuir los riesgos que implica exponer sus recursos a usuarios no autorizados, se valen de mecanismos para proteger sus recursos entre ellos se encuentran los sistemas de detección de intrusos2. Una intrusión se define como un conjunto de acciones que intentan poner en riesgo la integridad, la confidencialidad o la disponibilidad de un recurso. Un buen IDS puede tener un gran impacto positivo en la seguridad de la organización. El objetivo de un IDS es identificar posibles intrusiones de manera oportuna, es decir detectar el posible ataque antes que llegue a su destino e identificar el origen del ataque.
- On an efficient and scalable architecture for mimicry attacks detection using probabilistic methods(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2004-11-19) Godínez Delgado, Fernando; MONROY BORJA, RAUL; 720773; Monroy Borja, Raúl; Hutter, Dieter; Giles, Lee; Nolazco, Juan A.; Mex, Carlos; Programa de Graduados en Computación, Información y Comunicaciones; Campus MonterreyAn intrusion detection system (IDS) aims at signalling an alarm for every activity that compromises a secure state of an IT system. It often amounts to detecting a known pattern of computer misuse, a deviation to ordinary, expected user behaviour, or a combination thereof. Regardless of which of these approaches is adopted, current Intrusion Detection Systems (IDSs) are easy to bypass. This thesis addresses about the three most important limitations of existing IDSs: i) current IDSs are easily overwhelmed by the the amount of information they ought to analyse; ii) current IDSs are not sufficient to monitor dynamic environments where the monitored services are changed according to the needs of the organisation; and iii) current IDSs are easy to bypass using a mimicry attack (attacks that simulate normal sequences of system calls). These kinds of attacks simulate normal activity (eg traffic, interaction) by varying an attack signature in a way that does not affect the harmfulness of the attack. Instead of creating a lightweight detection method capable of dealing with large volumes of information, at the probable cost of loss of accuracy, we focus on making intrusion detection more tractable, scalable and efficient (without compromising accuracy). We make intrusion detection more tractable by pre- processing the information. Whether it is a sequence of network packets or a sequence of system calls, the information an IDS analyses is often redundant in at least, two respects: first, every entry in the sequence may contain spurious information; second, any sequence may contain redundant subsequences. To make probabilistic intrusion detection more scalable, efficient and flexible, we propose a novel architecture that includes a service selection mechanism. Instead of analysing a single stream of data, the stream is partitioned in services, each of which is analysed by a very specialised sensor. New sensors can be added on demand; if a new service needs to be monitored another sensor is placed. To make mimicry attack intrusion detection more accurate (reduce false positives) we propose to divide attacks into smaller segments. For each segmentwe will create a detector that classifies the segment and all its variants. By combining these smaller detectors we hope to detect all variations of an attack. By using rough sets we have identified key attributes to eliminate spurious information, without missing chief details. Using n-gram theory we have identified the most redundant subsequences within a sequence, substitution of these subsequences with a fresh tag results in a reduction of the sequence length. To approach service selection, we suggest the use of hidden Markov models (HMMs), trained to detect a specific service described by a family of n-gram.s In this thesis, we introduce a method which is capable of successfully detecting a significant, interesting sub-class of mimicry attacks. The key behind our method's effectiveness lies on the use of a word network [Pereira and Riley, 1997, Young et al., 2002]. A word network conveniently decomposes a pattern matching problem into a chain of smaller, noise- tolerant pattern matchers, thereby making it more tractable and robust. A word network is realised as a finite state machine, where every state is an HMM. In our experiments, our mechanism shows an accuracy of 93%. .By contrast., the rate of false positive occurrence is only 3%. Our log reduction methods are among the best in reduction ratio and features a minimal loss of information. Ours is one of the first techniques to successfully detect a sub-class of mimicry attacks.
- Verificación formal de protocolos de seguridad en HOL a partir del método inductivo(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2003) López Pimentel, Juan Carlos; Monroy Borja, Raúl; Sánchez Velázquez, Erika; Rodríguez Lucatero, CarlosMuchos protocolos de seguridad han presentado fallas sutiles que han sido descubiertos a través de los métodos formales. De ahí que la principal razón por formalizarlos es para eliminar errores humanos. Sin embargo, muchos modelos se han limitado en demostrar sólo propiedades de autentificación. Ahora por la enorme cantidad de transacciones electrónicas y por personas malignas en la red, necesitamos métodos más potentes que también permitan verificar propiedades como confidencialidad, frescura y posibilidad. Uno de ellos es el Método inductivo desarrollado por Lawrence C. Paulson [ 16]. Sin embargo, este método está orientado a una comunidad específica (usuarios de Isabelle). La principal motivación para desarrollar el presente trabajo es proporcionar el método inductivo de Paulson a otra gran comunidad de usuarios que utilizan la herramienta del Sistema HOL1 [20, 40]. Con esto lograremos popularizar el método para que mayor número de usuarios puedan utilizar la verificación formal de protocolos de seguridad en HOL a partir del método inductivo. El método inductivo se basa específicamente de cuatro teorías: la de mensajes, eventos, llaves compartidas y llaves públicas. La teoría de mensajes contiene la definición de los tipos de agentes, de los mensajes, tipos de operadores para modelar el tráfico existente en la red. La teoría de eventos, contiene la definición de los tipos de eventos que pueden suceder al enviar un mensaje por la red o al recibirlos. Se modela el conocimiento de cada uno de los tipos de agentes y la frescura de los mensajes. Las teorías de llaves compartidas y llaves públicas proporcionan propiedades del conocimiento inicial de los agentes, características propias de las llaves y garantías sobre el suministro de llaves. Cada una de las teorías contiene propiedades específicas y son representados en forma de teoremas matemáticos. Al finalizar cada una de las teorías desarrolladas en HOL, hemos verificado el protocolo OtwayRees, demostrando entre otras propiedades autenticación. Por último, se dan las conclusiones y los trabajos futuros propuestos para la continuidad de este trabajo.
- Modelo de un sistema inmunológico natural en álgebra de procesos(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2002) Saab Asbun, Rosa; Monroy Borja, Raúl; Vallejo Clemente, Edgar Emmanuel; Coello Coello, Carlos
- Análisis formal de TLS v 1.0(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2001) Alberto Calixto Simón; ALBERTO CALIXTO SIMÓN; Monroy Borja, Raúl; Gómez Cardenas, Roberto; Sánchez Gómez, Jesús
- Sistema de monitoreo experto aplicado a equipos de cómputo(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2000) Castro Loera, Arturo Rodolfo; ARTURO RODOLFO CASTRO LOERA:3176042; Monroy Borja, Raúl; González, Marco; Vázquez, Jesús; Camargo, FranciscoLa administración de servicios de cómputo se enfoca principalmente a mantenerlos en operación continua. Por eso gran parte del tiempo del administrador se enfoca principalmente al monitoreo, o la revisión de los servicios de cómputo para garantizar su funcionamiento correcto la mayor parte del tiempo. Existen muchas herramientas que ayudan al administrador a realizar esta labor, sobre todo, cuando el administrador no está presente para solucionar un problema de mal funcionamiento del servicio. No existe la herramienta perfecta para un monitoreo efectivo, por eso en esta tesis presentamos una solución que puede ayudar a la labor de monitoreo del administrador. La idea es obtener la experiencia de administradores expertos en un sistema de cómputo dado y administrar ese conocimiento para realizar un monitoreo efectivo, tal y como lo haría el propio administrador. Este conocimiento puede aplicarse en otros sistemas de cómputo similares, ya que solo es el conocimiento lo que se está aplicando.
- Reconocimiento de patrones aplicado a la exposición fotográfica(Instituto Tecnológico y de Estudios Superiores de Monterrey, 1999) Navarrete Paredes, Enrique Alejandro; ENRIQUE ALEJANDRO NAVARRETE PAREDES; García García, Eduardo de Jesús; Monroy Borja, Raúl; emipsanchez; Corona Burgueño, Juan Francisco; Vallejo Clemente, Edgar EmmanuelLa exposición fotográfica es un problema complejo que aún las cámaras fotográficas más sofisticadas (sistemas de zonas con forma predefinida) no resuelven satisfactoriamente en todos los casos. En esta tesis se desarrolla un sistema capaz de calcular la exposición fotográfica para escenas de tipo "paisaje" extrayendo las características de la imagen para alimentar una red neuronal. La extracción de los datos característicos de la imagen se hace mediante una segmentación de la misma, para obtener regiones con la forma de los elementos que componen la escena. Se hacen conjuntos de patrones (validación y entrenamiento) en función de la entropía de cada imagen. Estos conjuntos se usan para el proceso de entrenamiento y validación de la red neuronal. Se emplea el método de entrenamiento "Propagación hacia atrás con momentum y eliminación de punto plano".
- Videogame Crowdsourcing Approach to Find Strategies Using Repeated Sub-Sequences(Instituto Tecnológico y de Estudios Superiores de Monterrey) Silva Gálvez, Arturo; MONROY BORJA, RAUL; 12232; Monroy Borja, Raúl; emipsanchez; Mac Kinney Romero, Rene; Medina Pérez, Miguel Angel; Ramírez Márquez, José EmmanuelCrowdsourcing surged as a new problem-solving model to better knowledge on how to solve a specific problem. The procedure starts by externalizing the problem from the group that is trying to solve it. Then, people with a variety of skills can help design solutions. The motivation for persons to participate is the key that makes the model work. From giving money to socialization, many options exist to encourage people to contribute to a crowdsourcing model. Studies tested the use of videogames to motivate people to participate in the solution to problems from different domains. These studies report that people can provide competitive solutions, against the experts, even for complex problems. Until now, Videogame Crowdsourcing helped to complement the solution space, but mining the strategies from the users is an area of opportunity. This thesis studies the application of Videogame Crowdsourcing for mining strategies from players’ solutions for a problem. It focuses on a specific one: the Housing Development Problem; it is of interest to the architecture community. It is a single objective problem that consists of placing as many houses as possible, given the land, subject to restrictions of connectivity (from the entrance of the land to all houses). We represented a match of our videogame as a sequence of movements. Each move consists of placing a house on a square of the land, represented as a grid, followed by displacement to another square in which the player puts the next one. This representation abstracts out two types of plays: the ones made to fulfill the restrictions of connectivity and the ones that belong to a correction of a previous one. Our underlying hypothesis is that a player strategy lies within a grammar expression; in particular, it is embedded in the recurrent sub-sequences of the expression. We used the videogame to collect 113 matches. With Sequitur, we found recurrent sub-sequences for each match, a larger sequence. Analyzing the sub-sequences, we have successfully identified the following strategies: Bottom-Left, Top-Right, Top-Left, and others that are not found as heuristics for optimization problems like the one on the videogame. Our results show that the strategy of a player is in the grammar expression of his/her movements. They encourage us to think that recurrent sub-sequences can build the strategies people use for the Housing Development Problem and lead to new algorithms.
