Searcharxiv⌕ Search

arXiv subjects

Antonio Leon

Publications and source records attributed to Antonio Leon.

16 recordsLinked to original sources
arXiv2026

MLDAS: Machine Learning Dynamic Algorithm Selection for Software-Defined Networking Security

Network security is a critical concern in the digital landscape of today, with users demanding secure browsing experiences and protection of their personal data. This study explores the dynamic integration of Machine Learning (ML) algorithms with Software-Defined Networking (SDN) controllers to enhance network security through adaptive decision mechanisms. The proposed approach enables the system to dynamically choose the most suitable ML algorithm based on the characteristics of the observed network traffic. This work examines the role of Intrusion Detection Systems (IDS) as a fundamental component of secure communication networks and discusses the limitations of SDN-based attack detection mechanisms. The proposed framework uses adaptive model selection to maintain reliable intrusion detection under varying network conditions. The study highlights the importance of analyzing traffic-type-based metrics to define effective classification rules and enhance the performance of ML models. Additionally, it addresses the risks of overfitting and underfitting, underscoring the critical role of hyperparameter tuning in optimizing model accuracy and generalization. The central contribution of this work is an automated mechanism that adaptively selects the most suitable ML algorithm according to real-time network conditions, prioritizing detection robustness and operational feasibility within SDN environments.

cs.NI↗
arXiv2012

Superswapping

Supertask theory is used here to prove a contradictory result which involves the consistency of w-order and the Axiom of Infinity.

math.GM↗
arXiv2012

A disturbing supertask

This paper examines the consistency of w-order by means of a supertask that functions as a supertrap for the assumed existence of w-ordered collections, which are simultaneously complete (as is required by the Actual infinity) and uncompletable (because no last element completes them).

math.GM↗
arXiv2012

Recursion and the Axiom of Infinity

This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the successively defined nested sets. The consequence is a contradiction involving the consistency of w-order and then that of the Axiom of Infinity.

math.GM↗
arXiv2012

Cantor versus Cantor

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain restrictive conditions are satisfied, both extensions are possible. It is therefore indispensable to prove that those conditions are in fact satisfied in Cantor's theory of transfinite sets. Otherwise that theory would be inconsistent.

math.GM↗
arXiv2012

On Bifurcated supertasks and related questions

Bifurcated supertasks entail the actual infinite division of time (accelerated system of reference) as well as the existence of half-curves of infinite length (supertask system of reference). This paper analyzes both issues from a critique perspective. It also analyzes a conflictive case of hypercomputation performed by means of a bifurcated supertask. The results of these analyzes suggest the convenience of reviewing certain foundational aspects of infinitist theories.

math.GM↗
arXiv2012

Nested-set inconsistency

This paper examines a denumerable version of the nested-set theorem and derives from it a contradiction involving the formal consistency of the actual infinity assumed by the Axiom of Infinity.

math.GM↗
arXiv2012

Extending Cantor Paradox

The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to be an exhaustible source of paradoxes and contradictions. It seems therefore legitimate to pose some questions concerning their formal consistency. This is just the objective of this paper. Starting from an extension of Cantor's paradox that suggests the inconsistency of the actual infinity, the paper makes a short review of its controversial history and proposes a new way of criticism based on w-order. Self-reference is also examined from a critique perspective which includes syntactic and semantic considerations. The critique affects the formal sentence involved in Godel's first incompleteness theorem and its ordinary language interpretation.

math.GM↗
arXiv2009

The Aleph-zero or zero dichotomy

This paper proves the existence of a dichotomy which being formally derived from the topological successiveness of w-order leads to the same absurdity of Zeno's Dichotomy II. It also derives a contradictory result from the first Zeno's Dichotomy.

math.GM↗
arXiv2009

Hilbert's machine and w-order

Hilbert's machine is a supertask machine inspired by Hilbert's Hotel whose functioning leads to a contradictory result involving w-ordering.

math.GM↗
arXiv2008

Coevolution. Extending Prigogine Theorem

The formal consideration of the concept of interaction in thermodynamic analysis makes it possible to deduce, in the broadest terms, new results related to the coevolution of interacting systems, irrespective of their distance from thermodynamic equilibrium. In this paper I prove the existence of privileged coevolution trajectories characterized by the minimum joint production of internal entropy, a conclusion that extends Prigogine theorem to systems evolving far from thermodynamic equilibrium. Along these trajectories of minimum internal entropy production one of the system goes always ahead of the other with respect to equilibrium.

q-bio.PE↗
arXiv2008

Beyond Chaos

The first part of this paper defines recursive interactions by means of logistic functions and derives a general result on the way interacting systems evolve in attractors. It also defines the notion of coevolution trajectory and presents a new family of attractors: orbital attractors (including single, irregular, folded, complex and discontinuous orbits). The second part summarizes the results of a first experimental analysis of recursive interactions in both binary and multiple interactions. Among other results, this analysis reveals that interacting systems may easily evolve from chaos to order.

math.GM↗
arXiv2006

Living beings as informed systems: towards a physical theory of information

I propose here a new concept of information based on two relevant aspects of its expression. The first related to the undeniable fact that the expression of information modifies the physical state of its receiver. The second to the arbitrariness of such physical changes. In fact, these changes are not deducible from physical laws but from a code established arbitrarily. Thus, physical information is proposed here as the capacity of producing arbitrary changes. Once defined physical information from this physical point of view, I deduce some basic properties of informed systems. These properties (renewal, self-reproducing, evolution, diversification) are immediately recognized as the attributes most characteristic of living beings, the only natural informed systems we know. I also propose here a double evaluation of information. The former is an absolute measure of the physical effects of its expression based on Einstein's probability. The second is a functional measure based on the probability that an informed systems attain a given objective as consequence of the expression of its information.

q-bio.PE↗