Matraz IA
¡Hola! Soy Dr. Farbot, un farmacéutico profesional. ¿En qué puedo ayudarte hoy?
300 / 300

Artículos

Artículos: 5

Linear Regression Techniques for Car Accident Prediction

Miguel Angel Alejandro Islas Toski
Revista Applications of Hybrid Metaheuristic Algorithms for Image ProcessingEditorial Springer International PublishingVolumen 89024 páginas

This chapter explains the basics of simple linear regression. Showing different approaches to solve a prediction problem of this type. First, we explain the theory, then, it is solved by the algebraic method of least squares, checking the procedure and results through MATLAB. Finally, a basic example of the field of evolutionary computing is shown, using several evolutionary techniques such as PSO, DE, ABC, CS and the classical method of descending gradient. Which optimize the function to find the best coefficients for an estimated straight line. This is applied to a set of fatal traffic accident data in the U.S. states.

Ver más

A new metaheuristic approach based on agent systems principles

Miguel Angel Alejandro Islas Toski
Revista Journal of Computational ScienceEditorial ElsevierVolumen 47101244 páginas

Agent-based modeling is a relatively new approach to model complex systems composed of agents whose behavior is described using simple rules. As a consequence of the agent interactions emerges a complex global behavioral pattern not explicitly programmed. In the last decade, an increasing number of metaheuristic techniques have been reported in the literature where authors claim their novelty and their abilities to perform as powerful optimization methods. Although these schemes emulate very different processes or systems, the rules used to model individual behavior are very similar. The idea behind the design of many metaheuristic methods is to configure a recycled set of rules that has demonstrated to be successful in previous approaches for producing new optimization schemes. Such common rules have been designed without considering the final global result obtained by the individual interactions. On the other hand, agent-based systems provide a solid theory and a set of consistent models that allow characterizing global behavioral patterns produced by the collective interaction of the individuals from a set of simple rules. Under this perspective, several agent-based concepts and models that generate very complex global search behaviors can be used to produce or improve efficient optimization algorithms. In this paper, a new metaheuristic algorithm based on agent systems principles is presented. The proposed method is based on the agent-based model known as “Heroes and Cowards”. This model involves a small set of rules to produce two emergent global patterns that can be considered in terms of the metaheuristic literature as exploration and exploitation stages. To evaluate its performance, the proposed algorithm has been tested in a set of representative benchmark functions, including multimodal, unimodal, and hybrid benchmark formulations. The competitive results demonstrate the promising association between both paradigms.

Ver más

Evolutionary-Mean shift algorithm for dynamic multimodal function optimization

Miguel Angel Alejandro Islas Toski
Revista Applied Soft ComputingEditorial ElsevierVolumen 113107880 páginas

Recently, many dynamic optimization algorithms based on metaheuristic methods have been proposed. Although these schemes are highly efficient in determining a single global optimum, they fail in locating multiple optimal solutions. The central goal of dynamic multimodal optimization is to detect multiple optimal solutions for an optimization problem where its objective function is modified over time. Locating many optimal solutions (global and local) in a dynamic multimodal optimization problem is particularly crucial for several applications since the best solution could not always be the best implementable alternative due to various practical limitations. In spite of its importance, the problem of dynamic multimodal optimization through evolutionary principles has been scarcely considered in the literature. On the other hand, mean shift is a non-parametric and iterative process for detecting local maxima in a density function represented by a set of samples. Mean shift maintains interesting adaptive characteristics that allow it to find local maxima under dynamic environments. In this paper, the mean shift scheme is proposed to detect global and local optima in dynamic optimization problems. In the proposed method, the search strategy of the mean shift is modified to consider not only the density but also the fitness value of the candidate solutions. A competitive memory, along with a dynamic strategy, has also been added to accelerate the convergence process by using important information from previous environments. As a result, the proposed approach can effectively identify most of the global and local optima in dynamic environments. To demonstrate the performance of the proposed algorithm, a set of comparisons with other well-known dynamic optimization methods has been conducted. The study considers the benchmark generator of the CEC competition for dynamic optimization. The experimental results suggest a very competitive performance of the proposed scheme in terms of accuracy and robustness.

Ver más

Enhancing Bicycle Trajectory Planning in Urban Environments through Complex Network Optimization

Miguel Angel Alejandro Islas Toski
Revista Journal of Urban Planning and DevelopmentEditorial American Society of Civil EngineersVolumen 15004024023 páginas

This paper introduces a novel methodology for devising bike trajectory plans. In this approach, the entire trip is associated with a complex network or graph, where the nodes and edges correspond to potential trajectory segments. Utilizing the information collected from a bike-sharing system, the cost attributed to each segment is determined using the multinomial logistic regression (MLR) technique by analyzing its usage frequency and other user preferences. Consequently, segments with high usage and strong preferences entail lower costs, whereas those with limited use and weaker predilection assume higher costs. After assigning costs to all segments within the network, the subsequent step involves generating the trajectory with the lowest accumulated cost. Unlike other approaches, our method considers realistic conditions and user preferences without inconsistencies imposed by the techniques based on surveys. To validate the performance of the proposed method, a set of extensive experiments and case studies were conducted considering the urban model from downtown Guadalajara, Mexico. As a result, this approach improves the efficiency of the bike trajectory planning system by providing shorter and safer routes for both cyclists and motor vehicle drivers.

Ver más

Aplicación de la microscopia electrónica en la bioseguridad: El caso de los virus

Santiago Jose Guevara Martinez
Revista Revista de divulgación científica iBIOEditorial -Volumen 5132 páginas

El microscopio electrónico hace posible acceder al fascinante micromundo que nos rodea. La microscopia presenta gran importancia en la bioseguridad, debido a su capacidad para identificar organismos patógenos, así como agentes dañinos como pueden ser virus, bacterias, hongos y parásitos, desde el punto de vista de un profesional de la salud. El uso de la microscopia para detectar patógenos induce la mejora continua de la bioseguridad en equipos, productos y el medio ambiente, evitando la propagación de enfermedades infecciosas y previniendo la infestación de plagas y otras formas de contaminación biológica, mejorando así la calidad de vida de todos.

Ver más