Sign in to use this feature.

Years

Between: -

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (22,505)

Search Parameters:
Journal = Mathematics

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
17 pages, 2216 KiB  
Article
An Anomaly Detection Method for Multivariate Time Series Data Based on Variational Autoencoders and Association Discrepancy
by Haodong Wang and Huaxiong Zhang
Mathematics 2025, 13(7), 1209; https://doi.org/10.3390/math13071209 (registering DOI) - 7 Apr 2025
Abstract
Driven by rapid advancements in big data and Internet of Things (IoT) technologies, time series data are now extensively utilized across diverse industrial sectors. The precise identification of anomalies in time series data—especially within intricate and ever-changing environments—has emerged as a key focus [...] Read more.
Driven by rapid advancements in big data and Internet of Things (IoT) technologies, time series data are now extensively utilized across diverse industrial sectors. The precise identification of anomalies in time series data—especially within intricate and ever-changing environments—has emerged as a key focus in contemporary research. This paper proposes a multivariate anomaly detection framework that synergistically combines variational autoencoders with association discrepancy analysis. By incorporating prior knowledge of associations and sequence association mechanisms, the model can capture long-term dependencies in time series and effectively model the association discrepancy between different time points. Through reconstructing time series data, the model enhances the distinction between normal and anomalous points, learning the association discrepancy during reconstruction to strengthen its ability to identify anomalies. By combining reconstruction errors and association discrepancy, the model achieves more accurate anomaly detection. Extensive experimental validation demonstrates that the proposed methodological framework achieves statistically significant improvements over existing benchmarks, attaining superior F1 scores across diverse public datasets. Notably, it exhibits enhanced capability in modeling temporal dependencies and identifying nuanced anomaly patterns. This work establishes a novel paradigm for time series anomaly detection with profound theoretical implications and practical implementations. Full article
Show Figures

Figure 1

13 pages, 2207 KiB  
Article
Irreversibility Analysis of Hydromagnetic Casson Fluid Flow Through an Inclined Channel with Isothermal Boundary Conditions
by Bernard Ejugu Njor, Ramoshweu Solomon Lebelo and Samuel Olumide Adesanya
Mathematics 2025, 13(7), 1208; https://doi.org/10.3390/math13071208 (registering DOI) - 7 Apr 2025
Abstract
Fluid flow along an inclined channel phenomenon is crucial in several geophysical, environmental, engineering, biological, and industrial processes, and in aerodynamics and hemodynamics. This present study examines the effect of a constant magnetic field on the entropy production rate in a steady flow [...] Read more.
Fluid flow along an inclined channel phenomenon is crucial in several geophysical, environmental, engineering, biological, and industrial processes, and in aerodynamics and hemodynamics. This present study examines the effect of a constant magnetic field on the entropy production rate in a steady flow of Casson fluid along an inclined heated channel. The governing equations for the flow of velocity, temperature, and entropy generation are formulated based on the Casson constitutive relations and thermodynamics’ first and second laws. The exact solutions are constructed for the dimensionless equations and validated with previous results in the literature. The effects of various fluid parameters on the flow, heat transfer, and entropy production rate are conducted and reported graphically with adequate discussion. The impact of the Hartmann number parameter reveals a decrease in both flow velocity and entropy generation rate, meanwhile it also enhances the fluid temperature distribution across the inclined channel. An opposite trend is, however, observed with the Casson fluid parameter. Full article
(This article belongs to the Special Issue Advanced Computational Methods for Fluid Dynamics and Applications)
Show Figures

Figure 1

3 pages, 151 KiB  
Editorial
Preface to the Special Issue on “Recent Advances in Business and Industry: Mathematical Analysis, Sustainability Assessment Instruments and Methods”
by Cristina Raluca Gh. Popescu
Mathematics 2025, 13(7), 1207; https://doi.org/10.3390/math13071207 (registering DOI) - 7 Apr 2025
Abstract
Recently, it has become pivotal to include mathematics in all domains and crucial to offer a better and more in-depth understanding of mathematics in the forms in which it has been associated with all fields [...] Full article
32 pages, 406 KiB  
Article
On the Essential Decreasing of the Summation Order in the Abel-Lidskii Sense
by Maksim V. Kukushkin
Mathematics 2025, 13(7), 1205; https://doi.org/10.3390/math13071205 (registering DOI) - 7 Apr 2025
Abstract
In this paper, we consider a problem of decreasing the summation order in the Abel-Lidskii sense. The problem has a significant prehistory since 1962 created by such mathematicians as Lidskii V.B., Katsnelson V.E., Matsaev V.I., Agranovich M.S. As a main result, we will [...] Read more.
In this paper, we consider a problem of decreasing the summation order in the Abel-Lidskii sense. The problem has a significant prehistory since 1962 created by such mathematicians as Lidskii V.B., Katsnelson V.E., Matsaev V.I., Agranovich M.S. As a main result, we will show that the summation order can be decreased from the values more than a convergence exponent, in accordance with the Lidskii V.B. results, to an arbitrary small positive number. Additionally, we construct a qualitative theory of summation in the Abel-Lidkii sense and produce a number of fundamental propositions that may represent the interest themselves. Full article
(This article belongs to the Section C: Mathematical Analysis)
1 pages, 124 KiB  
Correction
Correction: Alanazi et al. An Improved Fick’s Law Algorithm Based on Dynamic Lens-Imaging Learning Strategy for Planning a Hybrid Wind/Battery Energy System in Distribution Network. Mathematics 2023, 11, 1270
by Mohana Alanazi, Abdulaziz Alanazi, Ahmad Almadhor and Hafiz Tayyab Rauf
Mathematics 2025, 13(7), 1206; https://doi.org/10.3390/math13071206 (registering DOI) - 7 Apr 2025
Abstract
In the published publication [...] Full article
1 pages, 122 KiB  
Correction
Correction: Aziz et al. Geo-Spatial Mapping of Hate Speech Prediction in Roman Urdu. Mathematics 2023, 11, 969
by Samia Aziz, Muhammad Shahzad Sarfraz, Muhammad Usman, Muhammad Umar Aftab and Hafiz Tayyab Rauf
Mathematics 2025, 13(7), 1204; https://doi.org/10.3390/math13071204 (registering DOI) - 7 Apr 2025
Abstract
In the published publication [...] Full article
18 pages, 1110 KiB  
Article
Differential Quadrature Method for Bending Analysis of Asymmetric Circular Organic Solar Cells Resting on Kerr Foundation in Hygrothermal Environment
by Mohammad A. Abazid, Muneer Alali and Mohammed Sobhy
Mathematics 2025, 13(7), 1203; https://doi.org/10.3390/math13071203 (registering DOI) - 6 Apr 2025
Abstract
This article presents the first theoretical analysis of the bending behavior of circular organic solar cells (COSCs). The solar cell under investigation is built on a flexible Kerr foundation and has five layers of Al, P3HT:PCBM, PEDOT:PSS, ITO, and Glass. The cell is [...] Read more.
This article presents the first theoretical analysis of the bending behavior of circular organic solar cells (COSCs). The solar cell under investigation is built on a flexible Kerr foundation and has five layers of Al, P3HT:PCBM, PEDOT:PSS, ITO, and Glass. The cell is exposed to hygrothermal conditions. The related Kerr foundation lessens displacements and supports the cell. The principle of virtual work is used to generate the basic partial differential equations, which are then solved using the differential quadrature method (DQM). The results of the present theory are validated by comparing them with published ones. The effects of the temperature, humidity, elastic foundation factors, and geometric configuration characteristics on the deflection and stresses of the COSC are examined. Full article
Show Figures

Figure 1

51 pages, 2433 KiB  
Article
A Hubness Information-Based k-Nearest Neighbor Approach for Multi-Label Learning
by Zeyu Teng, Shanshan Tang, Min Huang and Xingwei Wang
Mathematics 2025, 13(7), 1202; https://doi.org/10.3390/math13071202 (registering DOI) - 5 Apr 2025
Viewed by 34
Abstract
Multi-label classification (MLC) plays a crucial role in various real-world scenarios. Prediction with nearest neighbors has achieved competitive performance in MLC. Hubness, a phenomenon in which a few points appear in the k-nearest neighbor (kNN) lists of many points in high-dimensional spaces, may [...] Read more.
Multi-label classification (MLC) plays a crucial role in various real-world scenarios. Prediction with nearest neighbors has achieved competitive performance in MLC. Hubness, a phenomenon in which a few points appear in the k-nearest neighbor (kNN) lists of many points in high-dimensional spaces, may significantly impact machine learning applications and has recently attracted extensive attention. However, it has not been adequately addressed in developing MLC algorithms. To address this issue, we propose a hubness-aware kNN-based MLC algorithm in this paper, named multi-label hubness information-based k-nearest neighbor (MLHiKNN). Specifically, we introduce a fuzzy measure of label relevance and employ a weighted kNN scheme. The hubness information is used to compute each training example’s membership in relevance and irrelevance to each label and calculate weights for the nearest neighbors of a query point. Then, MLHiKNN exploits high-order label correlations by training a logistic regression model for each label using the kNN voting results with respect to all possible labels. Experimental results on 28 benchmark datasets demonstrate that MLHiKNN is competitive among the compared methods, including nine well-established MLC algorithms and three commonly used hubness reduction techniques, in dealing with MLC problems. Full article
31 pages, 10965 KiB  
Article
Joint Event Density and Curvature Within Spatio-Temporal Neighborhoods-Based Event Camera Noise Reduction and Pose Estimation Method for Underground Coal Mine
by Wenjuan Yang, Jie Jiang, Xuhui Zhang, Yang Ji, Le Zhu, Yanbin Xie and Zhiteng Ren
Mathematics 2025, 13(7), 1198; https://doi.org/10.3390/math13071198 (registering DOI) - 5 Apr 2025
Viewed by 27
Abstract
Aiming at the problems of poor image quality of traditional cameras and serious noise interference of event cameras under complex lighting conditions in coal mines, an event denoising algorithm fusing spatio-temporal information and a method of denoising event target pose estimation is proposed. [...] Read more.
Aiming at the problems of poor image quality of traditional cameras and serious noise interference of event cameras under complex lighting conditions in coal mines, an event denoising algorithm fusing spatio-temporal information and a method of denoising event target pose estimation is proposed. The denoising algorithm constructs a spherical spatio-temporal neighborhood to enhance the spatio-temporal denseness and continuity of valid events, and combines event density and curvature to achieve event stream denoising. The attitude estimation framework adopts the noise reduction event and global optimal perspective-n-line (OPNL) methods to obtain the initial target attitude, and then establishes the event line correlation model through the robust estimation, and achieves the attitude tracking by minimizing the event line distance. The experimental results show that compared with the existing methods, the noise reduction algorithm proposed in this paper has a noise reduction rate of more than 99.26% on purely noisy data, and the event structure ratio (ESR) is improved by 47% and 5% on DVSNoise20 dataset and coal mine data, respectively. The maximum absolute trajectory error of the localization method is 2.365 cm, and the mean square error is reduced by 2.263% compared with the unfiltered event localization method. Full article
Show Figures

Figure 1

20 pages, 617 KiB  
Article
Feedforward Factorial Hidden Markov Model
by Zhongxing Peng, Wei Huang and Yinghui Zhu
Mathematics 2025, 13(7), 1201; https://doi.org/10.3390/math13071201 (registering DOI) - 5 Apr 2025
Viewed by 20
Abstract
This paper introduces a novel kind of factorial hidden Markov model (FHMM), specifically the feedforward FHMM (FFHMM). In contrast to traditional FHMMs, the FFHMM is capable of directly utilizing supplementary information from observations through predefined states, which are derived using an automatic feature [...] Read more.
This paper introduces a novel kind of factorial hidden Markov model (FHMM), specifically the feedforward FHMM (FFHMM). In contrast to traditional FHMMs, the FFHMM is capable of directly utilizing supplementary information from observations through predefined states, which are derived using an automatic feature filter (AFF). We investigate two variations of FFHMM models that integrate predefined states with the FHMM: the direct FFHMM and the embedded FFHMM. In the direct FFHMM, alterations to one sub-hidden Markov model (HMM) do not affect the others, enabling individual improvements in HMM estimation. On the other hand, the sub-HMM chains within the embedded FFHMM are interconnected, suggesting that adjustments to one HMM chain may enhance the estimations of other HMM chains. Consequently, we propose two algorithms for these FFHMM models to estimate their respective hidden states. Ultimately, experiments conducted on two real-world datasets validate the efficacy of the proposed models and algorithms. Full article
Show Figures

Figure 1

8 pages, 239 KiB  
Article
Geometric Properties of a General Kohn–Nirenberg Domain in ℂn
by Kejia Hu, Hongyi Li, Di Zhao, Yuan Jiang and Baozhu Li
Mathematics 2025, 13(7), 1200; https://doi.org/10.3390/math13071200 (registering DOI) - 5 Apr 2025
Viewed by 36
Abstract
The Kohn–Nirenberg domains are unbounded domains in Cn. In this article, we modify the Kohn–Nirenberg domain [...] Read more.
The Kohn–Nirenberg domains are unbounded domains in Cn. In this article, we modify the Kohn–Nirenberg domain ΩK,L=(z1,,zn)Cn:Rezn+gzn2+j=1n1(zjp+KjzjpqRezjq+Ljzjp2qImzj2q)<0} and discuss the existence of supporting surface and peak functions at the origin. Full article
(This article belongs to the Section E1: Mathematics and Computer Science)
27 pages, 331 KiB  
Article
Some Bounds for the Generalized Spherical Numerical Radius of Operator Pairs with Applications
by Najla Altwaijry, Silvestru Sever Dragomir, Kais Feki and Shigeru Furuichi
Mathematics 2025, 13(7), 1199; https://doi.org/10.3390/math13071199 (registering DOI) - 5 Apr 2025
Viewed by 26
Abstract
This paper investigates a generalization of the spherical numerical radius for a pair (B,C) of bounded linear operators on a complex Hilbert space H. The generalized spherical numerical radius is defined as [...] Read more.
This paper investigates a generalization of the spherical numerical radius for a pair (B,C) of bounded linear operators on a complex Hilbert space H. The generalized spherical numerical radius is defined as wp(B,C):=supxH,x=1|Bx,x|p+|Cx,x|p1p, p1. We derive lower bounds for wp2(B,C) involving combinations of B and C, where p>1. Additionally, we establish upper bounds in terms of operator norms. Applications include the cases where (B,C)=(A,A*), with A* denoting the adjoint of a bounded linear operator A, and (B,C)=(R(A),I(A)), representing the real and imaginary parts of A, respectively. We also explore applications to the so-called Davis–Wielandt p-radius for p1, which serves as a natural generalization of the classical Davis–Wielandt radius for Hilbert-space operators. Full article
11 pages, 7861 KiB  
Article
Chattering-Free PID-Nested Nonsingular Terminal Sliding Mode Controller Design for Electrical Servo Drives
by Nguyen Minh Trieu, Nguyen Tan No, Truong Nguyen Vu and Nguyen Truong Thinh
Mathematics 2025, 13(7), 1197; https://doi.org/10.3390/math13071197 (registering DOI) - 5 Apr 2025
Viewed by 40
Abstract
In this study, a PID-nested nonsingular terminal sliding controller is proposed to minimize the chattering phenomenon. By adding both integral and derivative errors of states into the nonsingular terminal sliding manifolds, a composite sliding manifold was created. Compared to nonsingular terminal sliding mode [...] Read more.
In this study, a PID-nested nonsingular terminal sliding controller is proposed to minimize the chattering phenomenon. By adding both integral and derivative errors of states into the nonsingular terminal sliding manifolds, a composite sliding manifold was created. Compared to nonsingular terminal sliding mode (NTSM) techniques, this sliding manifold can handle higher-order derivatives. The speed of the motor is controlled by a sliding control law determined through a higher-order integral, making the signal continuous, and the sliding manifold is achieved in finite time. A special full-order terminal sliding mode manifold is introduced, which allows the system to converge in finite time while being chattering-free and avoiding the singularity phenomenon of conventional and terminal sliding modes. The controller’s efficiency is demonstrated with faster convergence time and fewer errors than state-of-the-art controllers, which is demonstrated through both simulation and experiment. Full article
(This article belongs to the Topic Intelligent Control in Smart Energy Systems)
Show Figures

Figure 1

21 pages, 1379 KiB  
Article
Generalization of Ramsey Number for Cycle with Pendant Edges
by Jagjeet Jakhar, Monu Moun, Youngsoo Seol, Majeed Ahmad Yousif, Muhammad Amer Latif and Pshtiwan Othman Mohammed
Mathematics 2025, 13(7), 1196; https://doi.org/10.3390/math13071196 (registering DOI) - 4 Apr 2025
Viewed by 55
Abstract
This paper explores various Ramsey numbers associated with cycles with pendant edges, including the classical Ramsey number, the star-critical Ramsey number, the Gallai–Ramsey number, and the star-critical Gallai–Ramsey number. These Ramsey numbers play a crucial role in combinatorial mathematics, determining the minimum number [...] Read more.
This paper explores various Ramsey numbers associated with cycles with pendant edges, including the classical Ramsey number, the star-critical Ramsey number, the Gallai–Ramsey number, and the star-critical Gallai–Ramsey number. These Ramsey numbers play a crucial role in combinatorial mathematics, determining the minimum number of vertices required to guarantee specific monochromatic substructures. We establish upper and lower bounds for each of these numbers, providing new insights into their behavior for cycles with pendant edges—graphs formed by attaching additional edges to one or more vertices of a cycle. The results presented contribute to the broader understanding of Ramsey theory and serve as a foundation for future research on generalized Ramsey numbers in complex graph structures. Full article
Show Figures

Figure 1

18 pages, 2692 KiB  
Article
Unit Size Determination for Exploratory Brain Imaging Analysis: A Quest for a Resolution-Invariant Metric
by Jihnhee Yu, HyunAh Lee and Zohi Sternberg
Mathematics 2025, 13(7), 1195; https://doi.org/10.3390/math13071195 - 4 Apr 2025
Viewed by 73
Abstract
Defining an adequate unit size is often crucial in brain imaging analysis, where datasets are complex, high-dimensional, and computationally demanding. Unit size refers to the spatial resolution at which brain data is aggregated for analysis. Optimizing unit size in data aggregation requires balancing [...] Read more.
Defining an adequate unit size is often crucial in brain imaging analysis, where datasets are complex, high-dimensional, and computationally demanding. Unit size refers to the spatial resolution at which brain data is aggregated for analysis. Optimizing unit size in data aggregation requires balancing computational efficiency in handling large-scale data sets with the preservation of brain activity patterns, minimizing signal dilution. We propose using the Calinski–Harabasz index, demonstrating its invariance to sample size changes due to varying image resolutions when no distributional differences are present, while the index effectively identifies an appropriate unit size for detecting suspected regions in image comparisons. The resolution-independent metric can be used for unit size evaluation, ensuring adaptability across different imaging protocols and modalities. This study enhances the scalability and efficiency of brain imaging research by providing a robust framework for unit size optimization, ultimately strengthening analytical tools for investigating brain function and structure. Full article
(This article belongs to the Special Issue Mathematical Methods for Image Processing and Computer Vision)
Show Figures

Figure 1

Back to TopTop