Ángel Luis Muñoz Castañeda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ángel Luis Muñoz Castañeda has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Noemí DeCastro-García
Universidad de León
9 shared publications - Miguel V. Carriegos
Universidad de León
7 shared publications - David Escudero García
Universidad de León
4 shared publications - Francisco Jose Plaza Martín
Universidad de Salamanca
4 shared publications - Héctor Alaiz-Moretón
Universidad de León
2 shared publications - Jose Aveleira-Mata
University of Leon
2 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (1) , 141-154
Construction of observable and MDP convolutional codes with good decodable properties by ISO representations
This paper addresses the construction of observable and maximum distance profile convolutional codes over finite fields that exhibit good performance with some available decoding algorithms for convolutional codes. Our construction is based on the use of input/state/output representations and the invariance of certain properties of linear systems under various group actions. This framework allows us to systematically generate new convolutional codes from existing ones while preserving key decoding and distance properties.
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (1) , 141-154
Open AccessConstruction of observable and MDP convolutional codes with good decodable properties by ISO representations
This paper addresses the construction of observable and maximum distance profile convolutional codes over finite fields that exhibit good performance with some available decoding algorithms for convolutional codes. Our construction is based on the use of input/state/output representations and the invariance of certain properties of linear systems under various group actions. This framework allows us to systematically generate new convolutional codes from existing ones while preserving key decoding and distance properties.
- 4 July 2024
- Published by Elsevier in Journal of Algebra
- Vol. 659, 395-433
On the subalgebra of invariant elements: Finiteness and immersions
- 4 July 2024
- Published by Elsevier in Journal of Algebra
- Vol. 659, 395-433
On the subalgebra of invariant elements: Finiteness and immersions
- Open Access
On the subalgebra of invariant elements: finiteness and immersions
Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation $\rho:\underline{G}_{R}\rightarrow \underline{\textrm{Aut}}_{\textrm{Mod}(R)}(M)$. For the graded $T$-algebra $A$, defined as $ A := \left( S_{T}^{\bullet} (M^{\vee} \otimes_{R}N )\right)^{G}, $ we determine the conditions under which the graded $T$-algebra $A$ is finitely generated, finitely presented, or flat. Furthermore, we establish the conditions under which a closed embedding of $\textrm{Proj} \ A$ into a projective space exists. Since we do not impose any Noetherian hypotheses, our results generalize those in the literature, providing new powerful tools regarding moduli problems.Open AccessOn the subalgebra of invariant elements: finiteness and immersions
Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation $\rho:\underline{G}_{R}\rightarrow \underline{\textrm{Aut}}_{\textrm{Mod}(R)}(M)$. For the graded $T$-algebra $A$, defined as $ A := \left( S_{T}^{\bullet} (M^{\vee} \otimes_{R}N )\right)^{G}, $ we determine the conditions under which the graded $T$-algebra $A$ is finitely generated, finitely presented, or flat. Furthermore, we establish the conditions under which a closed embedding of $\textrm{Proj} \ A$ into a projective space exists. Since we do not impose any Noetherian hypotheses, our results generalize those in the literature, providing new powerful tools regarding moduli problems. - Open Access
- 17 March 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (5) , 5281-5296
Characterization of threats in IoT from an MQTT protocol-oriented dataset
Nowadays, the cybersecurity of Internet of Thing (IoT) environments is a big challenge. The analysis of network traffic and the use of automated estimators built up with machine learning techniques have been useful in detecting intrusions in traditional networks. Since the IoT networks require new and particular protocols to control the communications between the different devices involved in the networks, the knowledge acquired in the study of general networks may be unuseful some times. The goal of this paper is twofold. On the one hand, we aim to obtain a consistent dataset of the network traffic of an IoT system based on the Message Queue Telemetry Transport protocol (MQTT) and undergoing certain type of attacks. On the other hand, we want to characterize each of these attacks in terms of the minimum possible number of significant variables allowed by this protocol. Obtaining the data set has been achieved by studying the MQTT protocol in depth, while its characterization has been addressed through a hybrid (filter/wrapper) feature selection algorithm based on the idea behind the minimum-redundancy maximum-relevance (mRMR) algorithm. The dataset, together with the feature selection algorithm, carries out a characterization of the different attacks which is optimal in terms of the accuracy of the machine learning models trained on it as well as in terms of the capability of explaining their underlying nature. This confirms the consistency of the dataset.
- 17 March 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (5) , 5281-5296
Open AccessCharacterization of threats in IoT from an MQTT protocol-oriented dataset
Nowadays, the cybersecurity of Internet of Thing (IoT) environments is a big challenge. The analysis of network traffic and the use of automated estimators built up with machine learning techniques have been useful in detecting intrusions in traditional networks. Since the IoT networks require new and particular protocols to control the communications between the different devices involved in the networks, the knowledge acquired in the study of general networks may be unuseful some times. The goal of this paper is twofold. On the one hand, we aim to obtain a consistent dataset of the network traffic of an IoT system based on the Message Queue Telemetry Transport protocol (MQTT) and undergoing certain type of attacks. On the other hand, we want to characterize each of these attacks in terms of the minimum possible number of significant variables allowed by this protocol. Obtaining the data set has been achieved by studying the MQTT protocol in depth, while its characterization has been addressed through a hybrid (filter/wrapper) feature selection algorithm based on the idea behind the minimum-redundancy maximum-relevance (mRMR) algorithm. The dataset, together with the feature selection algorithm, carries out a characterization of the different attacks which is optimal in terms of the accuracy of the machine learning models trained on it as well as in terms of the capability of explaining their underlying nature. This confirms the consistency of the dataset.
- Open Access
- 10 December 2022
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 202 (3) , 1469-1500
Generalized parabolic structures over smooth curves with many components and principal bundles over reducible nodal curves
- 10 December 2022
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 202 (3) , 1469-1500
Open AccessGeneralized parabolic structures over smooth curves with many components and principal bundles over reducible nodal curves
- 2 September 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 212
An effectiveness analysis of transfer learning for the concept drift problem in malware detection
- 2 September 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 212
An effectiveness analysis of transfer learning for the concept drift problem in malware detection
- Open Access
- 18 February 2022
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 19 (2) , 1-23
A Compactification of the Universal Moduli Space of Principal G-Bundles
Let G be a semisimple linear algebraic group, $$\rho :G\hookrightarrow \text {SL}(V)$$ a finite-dimensional faithful representation, $$g\ge 2$$ a natural number, and $$\delta $$ a positive rational number. We prove the existence of a compactification of the universal moduli space of semistable principal G-bundles over $$\overline{\text {M}}_{g}$$ , provided that $$\delta $$ is sufficiently large, having the following property: the fibers over singular curves are the moduli spaces of $$\delta $$ -semistable singular principal G-bundles.- 18 February 2022
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 19 (2) , 1-23
Open AccessA Compactification of the Universal Moduli Space of Principal G-Bundles
Let G be a semisimple linear algebraic group, $$\rho :G\hookrightarrow \text {SL}(V)$$ a finite-dimensional faithful representation, $$g\ge 2$$ a natural number, and $$\delta $$ a positive rational number. We prove the existence of a compactification of the universal moduli space of semistable principal G-bundles over $$\overline{\text {M}}_{g}$$ , provided that $$\delta $$ is sufficiently large, having the following property: the fibers over singular curves are the moduli spaces of $$\delta $$ -semistable singular principal G-bundles. - Open Access
- 20 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (22) , 2962
On the State Approach Representations of Convolutional Codes over Rings of Modular Integers
In this study, we prove the existence of minimal first-order representations for convolutional codes with the predictable degree property over principal ideal artinian rings. Further, we prove that any such first-order representation leads to an input/state/output representation of the code provided the base ring is local. When the base ring is a finite field, we recover the classical construction, studied in depth by J. Rosenthal and E. V. York. This allows us to construct observable convolutional codes over such rings in the same way as is carried out in classical convolutional coding theory. Furthermore, we prove the minimality of the obtained representations. This completes the study of the existence of input/state/output representations of convolutional codes over rings of modular integers.
- 20 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (22) , 2962
Open AccessOn the State Approach Representations of Convolutional Codes over Rings of Modular Integers
In this study, we prove the existence of minimal first-order representations for convolutional codes with the predictable degree property over principal ideal artinian rings. Further, we prove that any such first-order representation leads to an input/state/output representation of the code provided the base ring is local. When the base ring is a finite field, we recover the classical construction, studied in depth by J. Rosenthal and E. V. York. This allows us to construct observable convolutional codes over such rings in the same way as is carried out in classical convolutional coding theory. Furthermore, we prove the minimality of the obtained representations. This completes the study of the existence of input/state/output representations of convolutional codes over rings of modular integers.
- 1 October 2021
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 75
On the existence and construction of maximum distance profile convolutional codes
- 1 October 2021
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 75
On the existence and construction of maximum distance profile convolutional codes
- Open Access
- 20 September 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (18) , 2334
RHOASo: An Early Stop Hyper-Parameter Optimization Algorithm
This work proposes a new algorithm for optimizing hyper-parameters of a machine learning algorithm, RHOASo, based on conditional optimization of concave asymptotic functions. A comparative analysis of the algorithm is presented, giving particular emphasis to two important properties: the capability of the algorithm to work efficiently with a small part of a dataset and to finish the tuning process automatically, that is, without making explicit, by the user, the number of iterations that the algorithm must perform. Statistical analyses over 16 public benchmark datasets comparing the performance of seven hyper-parameter optimization algorithms with RHOASo were carried out. The efficiency of RHOASo presents the positive statistically significant differences concerning the other hyper-parameter optimization algorithms considered in the experiments. Furthermore, it is shown that, on average, the algorithm needs around of the iterations needed by other algorithms to achieve competitive performance. The results show that the algorithm presents significant stability regarding the size of the used dataset partition.- 20 September 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (18) , 2334
Open AccessRHOASo: An Early Stop Hyper-Parameter Optimization Algorithm
This work proposes a new algorithm for optimizing hyper-parameters of a machine learning algorithm, RHOASo, based on conditional optimization of concave asymptotic functions. A comparative analysis of the algorithm is presented, giving particular emphasis to two important properties: the capability of the algorithm to work efficiently with a small part of a dataset and to finish the tuning process automatically, that is, without making explicit, by the user, the number of iterations that the algorithm must perform. Statistical analyses over 16 public benchmark datasets comparing the performance of seven hyper-parameter optimization algorithms with RHOASo were carried out. The efficiency of RHOASo presents the positive statistically significant differences concerning the other hyper-parameter optimization algorithms considered in the experiments. Furthermore, it is shown that, on average, the algorithm needs around of the iterations needed by other algorithms to achieve competitive performance. The results show that the algorithm presents significant stability regarding the size of the used dataset partition.