Juan Carlos Seck-Tuoh-Mora

ORCID: 0000-0003-3678-1120
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cellular Automata and Applications
  • DNA and Biological Computing
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Theoretical and Computational Physics
  • Computability, Logic, AI Algorithms
  • Metaheuristic Optimization Algorithms Research
  • Assembly Line Balancing Optimization
  • Mathematical Dynamics and Fractals
  • Petri Nets in System Modeling
  • Business, Education, Mathematics Research
  • Modular Robots and Swarm Intelligence
  • semigroups and automata theory
  • Business, Innovation, and Economy
  • Evolutionary Algorithms and Applications
  • Stochastic processes and statistical mechanics
  • Neural Networks and Applications
  • Optimization and Search Problems
  • Mathematical and Theoretical Epidemiology and Ecology Models
  • Advanced Multi-Objective Optimization Algorithms
  • Slime Mold and Myxomycetes Research
  • Evolutionary Game Theory and Cooperation
  • Coding theory and cryptography
  • Error Correcting Code Techniques
  • Flexible and Reconfigurable Manufacturing Systems

Universidad Autónoma del Estado de Hidalgo
2016-2025

University of the West of England
2007

Universidad Nacional Autónoma de México
2007

Center for Research and Advanced Studies of the National Polytechnic Institute
2002

COP21 represents a starting point for several nations to develop and implement energy transition strategies face mitigate climate change, making the electrical power sector crucial in achieving established goals commitments. This research presents an analysis identify key factors system planning by integrating economic dispatch model (ED) based on linear programming determine vulnerable aspects of generation transmission strategic scenarios that could jeopardize country’s transition. The is...

10.3390/en18061316 article EN cc-by Energies 2025-03-07

Cast resin medium voltage instrument transformer are highly used because of several benefits over other type transformers. Nevertheless, the high operating temperatures affects their performance and durability. It is important to forecast hot spots in transformer. The aim this study develop a model based on Artificial Neural Networks (ANN) theory be able temperature seven points, taking into account twenty-six input data design features. 792 simulations were carried out COMSOL Multiphysics...

10.1109/access.2020.3021673 article EN cc-by IEEE Access 2020-01-01

In this work was to evaluate the conidiospores production of Trichoderma harzianum using barley straw as substrate. Four growth conditions were used; washed and unwashed supplemented with mineral salts. The highest spore observed when salts 1.56 × 1010 conidiospores/gram dry matter (gdm) at 216 h cultivation used. effect substrate moisture on studied, three initial levels tested it that a humidity 80 % improves reaching concentration 2.35 conidiospores/gdm 136 h. Finally, viability evaluated...

10.1016/j.btre.2020.e00445 article EN cc-by-nc-nd Biotechnology Reports 2020-03-12

This article finds feasible solutions to the travelling salesman problem, obtaining route with shortest distance visit n cities just once, returning starting city. The problem addressed is clustering cities, then using NEH heuristic, which provides an initial solution that refined a modification of metaheuristic Multi-Restart Iterated Local Search MRSILS; finally, clusters are joined end minimum problem. contribution this research use MRSILS, in our knowledge had not been used solve...

10.1371/journal.pone.0201868 article EN cc-by PLoS ONE 2018-08-22

We study a binary-cell-state eight-cell neighborhood two-dimensional cellular automaton model of quasi-chemical system with substrate and reagent. Reactions are represented by semi-totalistic transitions rules: every cell switches from state 0 to 1 depending on if the sum neighbors in belongs some specified interval, remains belong another interval. investigate space-time dynamics 1296 automata, establish morphology-bases classification rules, explore precipitating excitatory cases...

10.1142/s0218127406016598 article EN International Journal of Bifurcation and Chaos 2006-10-01

The Flexible Job Shop Scheduling Problem (FJSP) is a combinatorial problem that continues to be studied extensively due its practical implications in manufacturing systems and emerging new variants, order model optimize more complex situations reflect the current needs of industry better. This work presents metaheuristic algorithm called global-local neighborhood search (GLNSA), which concepts cellular automaton are used, so set leading solutions smart-cells generates shares information...

10.7717/peerj-cs.574 article EN cc-by PeerJ Computer Science 2021-05-27

This work presents a novel hybrid algorithm called GA-RRHC based on genetic algorithms (GAs) and random-restart hill-climbing (RRHC) for the optimization of flexible job shop scheduling problem (FJSSP) with high flexibility (where every operation can be completed by number machines). In particular, different GA crossover simple mutation operators are used cellular automata (CA)-inspired neighborhood to perform global search. method is refined local search RRHC, making computational...

10.3390/app12168050 article EN cc-by Applied Sciences 2022-08-11

Abstract Using Rule 126 elementary cellular automaton (ECA), we demonstrate that a chaotic discrete system — when enriched with memory hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced from original information the ahistorical system. First, analyze classic ECA to identify basic characteristics mean field theory, basins, and de Bruijn diagrams. To derive this dynamics, use kind 126; here interactions between gliders are studied for...

10.1002/cplx.20311 article EN Complexity 2010-02-09

In cellular automata with memory, the unchanged maps of conventional are applied to cells endowed memory their past states in some specified interval. We implement Rule 30 a majority and show that using function we can transform quasi-chaotic dynamics classical into domains travelling structures predictable behaviour. analyse morphological complexity classify gliders (particle, self-localizations) memory-enriched 30. provide formal ways encoding classifying glider de Bruijn diagrams, soliton...

10.25088/complexsystems.18.3.345 article EN Complex Systems 2009-10-15

An electrocardiogram (ECG) is a non-invasive study used for the diagnosis of cardiac arrhythmias (CAs). The identification arrhythmia depends on its classification. This classification has been approached through different strategies, both mathematical and computational. In this work, new computational model based particle swarm optimization (PSO) algorithm convolutional neural network (CNN) proposed five classes CAs obtained from MIT-BIH Arrhythmia Dataset (MITDB). goal PSO to optimize...

10.1109/access.2023.3282315 article EN cc-by-nc-nd IEEE Access 2023-01-01

This paper examines the claim that cellular automata (CA) belonging to Class III (in Wolfram's classification) are capable of (Turing universal) computation. We explore some chaotic CA (believed belong III) reported over course history, may be candidates for universal computation, hence spurring discussion on Turing universality both classes and IV.

10.48550/arxiv.1304.1242 preprint EN other-oa arXiv (Cornell University) 2013-01-01

Permutation flow shop scheduling problem deals with the production planning of a number jobs processed by set machines in same order.Several metaheuristics have been proposed for minimizing makespan this problem.Taking as basis previous Alternate Two-Phase PSO (ATPPSO) method and neighborhood concepts Cellular algorithm continuous problems, paper proposes improvement ATPPSO simple adaptive local search strategy (called CAPSO-SALS) to enhance its performance.CAPSO-SALS keeps simplicity boosts...

10.24425/acs.2019.129378 article EN cc-by-nc-nd Archives of Control Sciences 2023-07-20

The one-dimensional cutting-stock problem (1D-CSP) consists of obtaining a set items different lengths from stocks one or lengths, where the minimization waste is main objectives to be achieved. This arises in several industries like wood, glass, and paper, among others similar. Different approaches have been designed deal with this ranging exact algorithms hybrid methods heuristics metaheuristics. African Buffalo Optimization (ABO) algorithm used work address 1D-CSP. has recently introduced...

10.7717/peerj-cs.1728 article EN cc-by PeerJ Computer Science 2023-12-08
Coming Soon ...