SearcharxivSearch

arXiv subjects

Gerardo L. Febres

Publications and source records attributed to Gerardo L. Febres.

5 recordsLinked to original sources

Characterizing Open-Ended Evolution Through Undecidability Mechanisms in Random Boolean Networks

Discrete dynamical models underpin systems biology, but we still lack substrate-agnostic diagnostics for identifying finite-horizon dynamical signatures that may be relevant to open-ended evolution (OEE), such as the recurrent production of novel phenotypic states rather than rapid settling or unstructured noise. We introduce a simple, model-independent metric, {\Omega}, that summarizes the residence-time-weighted contribution of attractor cycle lengths across the sequence of recurrent episodes realized within a finite observation window. {\Omega} is zero for single-attractor dynamics and also vanishes for pure novelty without recurrence, while increasing when trajectories repeatedly enter multiple persistent cyclic phenotypes. Using Random Boolean Networks (RBNs) as a controlled testbed, we compare classical Boolean dynamics with biologically motivated non-classical mechanisms (probabilistic context switching, annealed rule mutation, paraconsistent logic, modal necessary/possible gating, and quantum-inspired superposition/paired-state coupling) under homogeneous and heterogeneous updating schemes. Our results support the view that undecidability-adjacent, state-dependent mechanisms -- implemented as probabilistic context switching, modal necessity/possibility gating, paraconsistent logic, or quantum-inspired correlated branching -- are enabling conditions for sustained novelty. At the end of our manuscript we outline a practical extension of {\Omega} to continuous/hybrid state spaces, positioning {\Omega} as a portable proxy for OEE in biological modeling and a guide for engineering evolvable synthetic circuits.

q-bio.PE

Complementing the Linear-Programming Learning Experience with the Design and Use of Computerized Games: The Formula 1 Championship Game

This document focuses on modeling a complex situations to achieve an advantage within a competitive context. Our goal is to devise the characteristics of games to teach and exercise non-easily quantifiable tasks crucial to the math-modeling process. A computerized game to exercise the math-modeling process and optimization problem formulation is introduced. The game is named The Formula 1 Championship, and models of the game were developed in the computerized simulation platform MoNet. It resembles some situations in which team managers must make crucial decisions to enhance their racing cars up to the feasible, most advantageous conditions. This paper describes the game's rules, limitations, and five Formula 1 circuit simulators used for the championship development. We present several formulations of this situation in the form of optimization problems. Administering the budget to reach the best car adjustment to a set of circuits to win the respective races can be an approach. Focusing on the best distribution of each Grand Prix's budget and then deciding how to use the assigned money to improve the car is also the right approach. In general, there may be a degree of conflict among these approaches because they are different aspects of the same multi-scale optimization problem. Therefore, we evaluate the impact of assigning the highest priority to an element, or another, when formulating the optimization problem. Studying the effectiveness of solving such optimization problems turns out to be an exciting way of evaluating the advantages of focusing on one scale or another. Another thread of this research directs to the meaning of the game in the teaching-learning process. We believe applying the Formula 1 Game is an effective way to discover opportunities in a complex-system situation and formulate them to finally extract and concrete the related benefit to the context described.

cs.AI

Assessing the impact of social activity permissiveness on the COVID-19 infection curve of several countries

This document aims to estimate and describe the effects of the social distancing measures implemented in several countries with the expectancy of controlling the spread of COVID-19. The procedure relies on the classic Susceptible-Infected-Removed (SIR) model, which is modified to incorporate a permissiveness index, representing the isolation achieved by the social distancing and the future development of vaccination campaigns and allowing the math model to reproduce more than one infection wave. The adjusted SIR models are used to study the compromise between the economy's reactivation and the resulting infection spreading increase. The document presents a graphical-abacus that describes the convenience of progressively relax social distancing measures while a feasible vaccination campaign develops

q-bio.PE

Basis to develop a platform for multiple-scale complex systems modeling and visualization: MoNet

This work presents some characteristics of MoNet, a digital platform for the modeling and visualization of complex systems. Emphasis is on the ideas that allowed the successful progressive development of this modeling platform, which goes along with the implementation of applications to the modeling of several studied systems. The platform can represent different aspects of systems modeled at different observation scales. This tool offers advantages in the sense of favoring the perception of the phenomenon of the emergence of information, associated with changes of scale. This paper also includes some criteria used for the construction of this modeling platform. The power of current computers has made practical representing graphic resources such as shapes, line thickness, overlaying-text tags, colors, and transparencies, in the graphical modeling of systems. By visualizing diagrams conveniently designed to highlight contrasts, these modeling platforms allow the recognition of patterns that drive our understanding of systems and their structure. Graphs reflecting the benefits of the tool regarding the visualization of systems at different scales of observation are presented to illustrate the application of the platform.

cs.SE

A non-iterative method for optimizing linear functions in convex linearly constrained spaces

This document introduces a strategy to solve linear optimization problems. The strategy is based on the bounding condition each constraint produces on each one of the problem's dimension. The solution of a linear optimization problem is located at the intersection of the constraints defining the extreme vertex. By identifying the constraints that limit the growth of the objective function value, we formulate linear equations system leading to the optimization problem's solution.The most complex operation of the algorithm is the inversion of a matrix sized by the number of dimensions of the problem. Therefore, the algorithm's complexity is comparable to the corresponding to the classical Simplex method and the more recently developed Linear Programming algorithms. However, the algorithm offers the advantage of being non-iterative.

math.OC