[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (1,577)

Search Parameters:
Keywords = convex function

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
19 pages, 5115 KiB  
Article
Geometric Nature of the Turánian of Modified Bessel Function of the First Kind
by Samanway Sarkar, Dimiter Prodanov, Anish Kumar and Sourav Das
Axioms 2024, 13(12), 874; https://doi.org/10.3390/axioms13120874 (registering DOI) - 15 Dec 2024
Viewed by 264
Abstract
This work explores the geometric properties of the Turanian of the modified Bessel function of the first kind (TMBF). Using the properties of the digamma function, we establish conditions under which the normalized TMBF satisfies starlikeness, convexity, k-starlikeness, k-uniform convexity, pre-starlikeness, [...] Read more.
This work explores the geometric properties of the Turanian of the modified Bessel function of the first kind (TMBF). Using the properties of the digamma function, we establish conditions under which the normalized TMBF satisfies starlikeness, convexity, k-starlikeness, k-uniform convexity, pre-starlikeness, lemniscate starlikeness, and convexity, and under which exponential starlikeness and convexity are obtained. By combining methods from complex analysis, inequalities, and functional analysis, the article advances the theory of Bessel functions and hypergeometric functions. The established results could be useful in approximation theory and bounding the behavior of functions. Full article
(This article belongs to the Special Issue Special Functions and Related Topics)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>4.34082</mn> </mrow> </semantics></math>; (<b>b</b>) Image of <math display="inline"><semantics> <msub> <mi mathvariant="double-struck">D</mi> <mstyle> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </mstyle> </msub> </semantics></math> under <math display="inline"><semantics> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mo>−</mo> <mn>0.29268</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mi>z</mi> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mo>′</mo> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mstyle> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>39.1153</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>(<b>a</b>) Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mi>z</mi> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mo>′</mo> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mstyle> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>8.91725</mn> </mrow> </semantics></math>; (<b>b</b>) Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mi>z</mi> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mo>′</mo> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mstyle> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>12.5405</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mrow> <msub> <mi>h</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>6.36988</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>δ</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>ρ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>(<b>a</b>) Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>17.0225</mn> </mrow> </semantics></math>; (<b>b</b>) Image of <math display="inline"><semantics> <msub> <mi mathvariant="double-struck">D</mi> <mstyle> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </mstyle> </msub> </semantics></math> under <math display="inline"><semantics> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>ν</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>2.56836</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>+</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mi>z</mi> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mrow> <mo>″</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mo>′</mo> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mstyle> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>48.5893</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>(<b>a</b>) Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>+</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mi>z</mi> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mrow> <mo>″</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mo>′</mo> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mstyle> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>25.4344</mn> </mrow> </semantics></math>; (<b>b</b>) Image of <math display="inline"><semantics> <mi mathvariant="double-struck">D</mi> </semantics></math> under <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>+</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mi>z</mi> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mrow> <mo>″</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msubsup> <mi mathvariant="script">T</mi> <mi>ν</mi> <mo>′</mo> </msubsup> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> </mrow> </mfrac> </mstyle> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>28.3269</mn> </mrow> </semantics></math>.</p>
Full article ">
17 pages, 304 KiB  
Article
Quasi-Lower C2 Functions and Their Application to Nonconvex Variational Problems
by Messaoud Bounkhel
Axioms 2024, 13(12), 870; https://doi.org/10.3390/axioms13120870 - 13 Dec 2024
Viewed by 272
Abstract
This study presents a novel category of nonconvex functions in Banach spaces, referred to as quasi-lower C2 functions on nonempty closed sets. We establish the existence of solutions for nonconvex variational problems involving quasi-lower C2 functions defined in Banach spaces. To [...] Read more.
This study presents a novel category of nonconvex functions in Banach spaces, referred to as quasi-lower C2 functions on nonempty closed sets. We establish the existence of solutions for nonconvex variational problems involving quasi-lower C2 functions defined in Banach spaces. To illustrate the applicability of our findings, an example is provided in Lp spaces. Full article
21 pages, 483 KiB  
Article
New Inequalities for GA–h Convex Functions via Generalized Fractional Integral Operators with Applications to Entropy and Mean Inequalities
by Asfand Fahad, Zammad Ali, Shigeru Furuichi, Saad Ihsan Butt, Ayesha and Yuanheng Wang
Fractal Fract. 2024, 8(12), 728; https://doi.org/10.3390/fractalfract8120728 - 12 Dec 2024
Viewed by 319
Abstract
We prove the inequalities of the weighted Hermite–Hadamard type the and Hermite–Hadamard–Mercer type for an extremely rich class of geometrically arithmetically-h-convex functions (GA-h-CFs) via generalized Hadamard–Fractional integral operators (HFIOs). The two generalized fractional integral operators (FIOs) are Hadamard proportional [...] Read more.
We prove the inequalities of the weighted Hermite–Hadamard type the and Hermite–Hadamard–Mercer type for an extremely rich class of geometrically arithmetically-h-convex functions (GA-h-CFs) via generalized Hadamard–Fractional integral operators (HFIOs). The two generalized fractional integral operators (FIOs) are Hadamard proportional fractional integral operators (HPFIOs) and Hadamard k-fractional integral operators (HKFIOs). Moreover, we also present the results for subclasses of GA-h-CFs and show that the inequalities proved in this paper unify the results from the recent related literature. Furthermore, we compare the two generalizations in view of the fractional operator parameters that contribute to the generalizations of the results and assess the better approximation via graphical tools. Finally, we present applications of the new inequalities via HPFIOs and HKFIOs by establishing interpolation relations between arithmetic mean and geometric mean and by proving the new upper bounds for the Tsallis relative operator entropy. Full article
(This article belongs to the Special Issue Fractional Integral Inequalities and Applications, 3rd Edition)
Show Figures

Figure 1

Figure 1
<p>HHI for <math display="inline"><semantics> <mrow> <mi>f</mi> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mi>z</mi> <mn>2</mn> </msup> </mrow> </semantics></math> bounded below by 2 and above by <math display="inline"><semantics> <mrow> <mn>2.5</mn> </mrow> </semantics></math> with respect to the parameters <span class="html-italic">p</span> and <span class="html-italic">k</span>.</p>
Full article ">Figure 2
<p>Difference between the HHI obtained via HPFIOs and HKFIOs.</p>
Full article ">Figure 3
<p>HPFIOs and HKFIOs coincide.</p>
Full article ">
17 pages, 8493 KiB  
Article
Copper Nodule Defect Detection in Industrial Processes Using Deep Learning
by Zhicong Zhang, Xiaodong Huang, Dandan Wei, Qiqi Chang, Jinping Liu and Qingxiu Jing
Information 2024, 15(12), 802; https://doi.org/10.3390/info15120802 - 11 Dec 2024
Viewed by 288
Abstract
Copper electrolysis is a crucial process in copper smelting. The surface of cathodic copper plates is often affected by various electrolytic process factors, resulting in the formation of nodule defects that significantly impact surface quality and disrupt the downstream production process, making the [...] Read more.
Copper electrolysis is a crucial process in copper smelting. The surface of cathodic copper plates is often affected by various electrolytic process factors, resulting in the formation of nodule defects that significantly impact surface quality and disrupt the downstream production process, making the prompt detection of these defects essential. At present, the detection of cathode copper plate nodules is performed by manual identification. In order to address the issues with manual convex nodule identification on the surface of industrial cathode copper plates in terms of low accuracy, high effort, and low efficiency in the manufacturing process, a lightweight YOLOv5 model combined with the BiFormer attention mechanism is proposed in this paper. The model employs MobileNetV3, a lightweight feature extraction network, as its backbone, reducing the parameter count and computational complexity. Additionally, an attention mechanism is introduced to capture multi-scale information, thereby enhancing the accuracy of nodule recognition. Meanwhile, the F-EIOU loss function is employed to strengthen the model’s robustness and generalization ability, effectively addressing noise and imbalance issues in the data. Experimental results demonstrate that the improved YOLOv5 model achieves a precision of 92.71%, a recall of 91.24%, and a mean average precision (mAP) of 92.69%. Moreover, a single-frame detection time of 4.61 ms is achieved by the model, which has a size of 2.91 MB. These metrics meet the requirements of practical production and provide valuable insights for the detection of cathodic copper plate surface quality issues in the copper electrolysis production process. Full article
(This article belongs to the Section Information Applications)
Show Figures

Figure 1

Figure 1
<p>Schematic diagram of the copper electrolytic process.</p>
Full article ">Figure 2
<p>Network structure of the YOLOv5s algorithm.</p>
Full article ">Figure 3
<p>Basic network unit of MobileNetV3.</p>
Full article ">Figure 4
<p>(<b>a</b>) Traditional convolution process diagram; (<b>b</b>) Depthwise separable convolution process diagram.</p>
Full article ">Figure 5
<p>(<b>a</b>) Inverted residual structure of MobileNetV3; (<b>b</b>) Schematic diagram of SE network structure.</p>
Full article ">Figure 6
<p>Network structure diagram of the BiFormer’s attention mechanism.</p>
Full article ">Figure 7
<p>Schematic diagram of EIOU loss.</p>
Full article ">Figure 8
<p>Comparison of loss functions: (<b>a</b>) obj_loss comparison; (<b>b</b>) box_loss comparison.</p>
Full article ">Figure 9
<p>Legend for nodule defects on cathode copper plates.</p>
Full article ">Figure 10
<p>Graphs produced during training of the improved YOLOv5.</p>
Full article ">Figure 11
<p>Model detection effect diagram: (<b>a</b>) The original image; (<b>b</b>) The image after model detection.</p>
Full article ">Figure 12
<p>Performance Comparison of YOLO Models: (<b>a</b>) Precision Comparison of YOLO Models; (<b>b</b>) Recall Comparison of YOLO Models; (<b>c</b>) mAP Comparison of YOLO Models.</p>
Full article ">Figure 13
<p>Nodule detection system.</p>
Full article ">
23 pages, 3374 KiB  
Article
Multi-Layered Interactive Target Guidance with Visual Safety in Convex-Shaped Obstacle Environments
by Kodai Kanno, Junya Yamauchi and Masayuki Fujita
Appl. Sci. 2024, 14(24), 11544; https://doi.org/10.3390/app142411544 - 11 Dec 2024
Viewed by 276
Abstract
In this paper, we consider a control architecture for a mobile robot equipped with visual sensors to pursue a target object in an environment with convex-shaped obstacles. The pursuit involves crucial occlusion avoidance and field of view maintenance, referred to as visual safety. [...] Read more.
In this paper, we consider a control architecture for a mobile robot equipped with visual sensors to pursue a target object in an environment with convex-shaped obstacles. The pursuit involves crucial occlusion avoidance and field of view maintenance, referred to as visual safety. Our goal is to achieve this safety through a multi-layered control architecture consisting of a planning layer and a safety layer. We propose functions that represent occlusion avoidance and field of view maintenance and derive conditions for these to act as control barrier functions. Utilizing these functions, we implement an optimal control at the planning layer and an optimization-based control at the safety layer. The effectiveness of this method is verified through two tasks: guiding the target object into a target location and preventing the target object from entering a target location. Full article
Show Figures

Figure 1

Figure 1
<p>The field of view of the camera. The point <math display="inline"><semantics> <msub> <mi>p</mi> <mrow> <mi>o</mi> <mi>i</mi> </mrow> </msub> </semantics></math> denotes the coordinate of a feature point with respect to the target-fixed frame <math display="inline"><semantics> <msub> <mo>Σ</mo> <mi>o</mi> </msub> </semantics></math>.</p>
Full article ">Figure 2
<p>Configuration of the camera robot, target, and obstacle.</p>
Full article ">Figure 3
<p>Interactive guiding.</p>
Full article ">Figure 4
<p>The architecture of the multi-layered control.</p>
Full article ">Figure 5
<p>The block diagram of the safety layer.</p>
Full article ">Figure 6
<p>Parameters for each simulation.</p>
Full article ">Figure 7
<p>Average trajectory computation time.</p>
Full article ">Figure 8
<p>Guiding task results. (<b>a</b>) Trajectories of the target and the camera robot are shown by the red and blue lines, respectively. The final positions and orientations of each are represented by cones, and the target location <math display="inline"><semantics> <msub> <mi>p</mi> <mrow> <mi>t</mi> <mi>a</mi> <mi>s</mi> <mi>k</mi> </mrow> </msub> </semantics></math> is marked by a star. (<b>b</b>) Distance between the target object and the target location <math display="inline"><semantics> <msub> <mi>p</mi> <mrow> <mi>t</mi> <mi>a</mi> <mi>s</mi> <mi>k</mi> </mrow> </msub> </semantics></math>. (<b>c</b>) Value of the control barrier function <math display="inline"><semantics> <mrow> <msub> <mi>h</mi> <mrow> <mi>f</mi> <mi>o</mi> <mi>v</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mrow> <mi>p</mi> <mi>e</mi> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </semantics></math>. (<b>d</b>) Distance between each obstacle and the line of sight.</p>
Full article ">Figure 9
<p>Guarding task result. (<b>a</b>) Trajectories of the camera robot and target; (<b>b</b>) Distance <math display="inline"><semantics> <mrow> <mrow> <mo>∥</mo> </mrow> <msub> <mi>p</mi> <mrow> <mi>w</mi> <mi>o</mi> </mrow> </msub> <mo>−</mo> <msub> <mi>p</mi> <mrow> <mi>t</mi> <mi>a</mi> <mi>s</mi> <mi>k</mi> </mrow> </msub> <mrow> <mo>∥</mo> </mrow> </mrow> </semantics></math>; (<b>c</b>) Value of <math display="inline"><semantics> <mrow> <msub> <mi>h</mi> <mrow> <mi>f</mi> <mi>o</mi> <mi>v</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mrow> <mi>p</mi> <mi>e</mi> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </semantics></math>; (<b>d</b>) Distance between each obstacle and the line of sight.</p>
Full article ">Figure 10
<p>Comparison between cases with and without the safety layer. (<b>a</b>) Trajectories of the camera robot and target without the safety layer; (<b>b</b>) Distance between the obstacles and the line of sight without the safety layer; (<b>c</b>) Trajectories of the camera robot and target with the safety layer; (<b>d</b>) Distance between the obstacles and the line of sight with the safety layer.</p>
Full article ">
26 pages, 413 KiB  
Article
On Fractal–Fractional Simpson-Type Inequalities: New Insights and Refinements of Classical Results
by Fahad Alsharari, Raouf Fakhfakh and Abdelghani Lakhdari
Mathematics 2024, 12(24), 3886; https://doi.org/10.3390/math12243886 - 10 Dec 2024
Viewed by 359
Abstract
In this paper, we introduce a novel fractal–fractional identity, from which we derive new Simpson-type inequalities for functions whose first-order local fractional derivative exhibits generalized s-convexity in the second sense. This work introduces an approach that uses the first-order local fractional derivative, [...] Read more.
In this paper, we introduce a novel fractal–fractional identity, from which we derive new Simpson-type inequalities for functions whose first-order local fractional derivative exhibits generalized s-convexity in the second sense. This work introduces an approach that uses the first-order local fractional derivative, enabling the treatment of functions with lower regularity requirements compared to earlier studies. Additionally, we present two distinct methodological frameworks, one of which achieves greater precision by refining classical outcomes in the existing literature. The paper concludes with several practical applications that demonstrate the utility of our results. Full article
(This article belongs to the Special Issue Fractional Calculus and Mathematical Applications, 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>Comparison between Theorem 3 and Corollary 4.</p>
Full article ">Figure 2
<p>Comparison between Theorem 3, Corollary 4, and Corollary 5.</p>
Full article ">
32 pages, 4118 KiB  
Article
Mutual-Energy Inner Product Optimization Method for Constructing Feature Coordinates and Image Classification in Machine Learning
by Yuanxiu Wang
Mathematics 2024, 12(23), 3872; https://doi.org/10.3390/math12233872 - 9 Dec 2024
Viewed by 430
Abstract
As a key task in machine learning, data classification is essential to find a suitable coordinate system to represent the data features of different classes of samples. This paper proposes the mutual-energy inner product optimization method for constructing a feature coordinate system. First, [...] Read more.
As a key task in machine learning, data classification is essential to find a suitable coordinate system to represent the data features of different classes of samples. This paper proposes the mutual-energy inner product optimization method for constructing a feature coordinate system. First, by analyzing the solution space and eigenfunctions of the partial differential equations describing a non-uniform membrane, the mutual-energy inner product is defined. Second, by expressing the mutual-energy inner product as a series of eigenfunctions, it shows the significant advantage of enhancing low-frequency features and suppressing high-frequency noise, compared to the Euclidean inner product. And then, a mutual-energy inner product optimization model is built to extract the data features, and the convexity and concavity properties of its objective function are discussed. Next, by combining the finite element method, a stable and efficient sequential linearization algorithm is constructed to solve the optimization model. This algorithm only solves positive definite symmetric matrix equations and linear programming with a few constraints, and its vectorized implementation is discussed. Finally, the mutual-energy inner product optimization method is used to construct feature coordinates, and multi-class Gaussian classifiers are trained on the MINST training set. Good prediction results of the Gaussian classifiers are achieved on the MINST test set. Full article
(This article belongs to the Special Issue Advances in Machine Learning and Graph Neural Networks)
Show Figures

Figure 1

Figure 1
<p>The means of the samples.</p>
Full article ">Figure 2
<p>Design variables.</p>
Full article ">Figure 3
<p>Reference feature coordinate.</p>
Full article ">Figure 4
<p>Sample distribution.</p>
Full article ">Figure 5
<p>Confusion Matrix.</p>
Full article ">Figure 6
<p>Confusion Matrix.</p>
Full article ">Figure 7
<p>Confusion Matrix.</p>
Full article ">
11 pages, 271 KiB  
Article
On Qi’s Normalized Remainder of Maclaurin Power Series Expansion of Logarithm of Secant Function
by Hong-Chao Zhang, Bai-Ni Guo and Wei-Shih Du
Axioms 2024, 13(12), 860; https://doi.org/10.3390/axioms13120860 - 8 Dec 2024
Viewed by 396
Abstract
In the study, the authors introduce Qi’s normalized remainder of the Maclaurin power series expansion of the function lnsecx=lncosx; in view of a monotonicity rule for the ratio of two Maclaurin power series and by [...] Read more.
In the study, the authors introduce Qi’s normalized remainder of the Maclaurin power series expansion of the function lnsecx=lncosx; in view of a monotonicity rule for the ratio of two Maclaurin power series and by virtue of the logarithmic convexity of the function (2x1)ζ(x) on (1,), they prove the logarithmic convexity of Qi’s normalized remainder; with the aid of a monotonicity rule for the ratio of two Maclaurin power series, the authors present the monotonic property of the ratio between two Qi’s normalized remainders. Full article
16 pages, 1257 KiB  
Article
A Novel Sine Step Size for Warm-Restart Stochastic Gradient Descent
by Mahsa Soheil Shamaee and Sajad Fathi Hafshejani
Axioms 2024, 13(12), 857; https://doi.org/10.3390/axioms13120857 - 6 Dec 2024
Viewed by 318
Abstract
This paper proposes a novel sine step size for warm-restart stochastic gradient descent (SGD). For the SGD based on the new proposed step size, we establish convergence rates for smooth non-convex functions with and without the Polyak–Łojasiewicz (PL) condition. To assess the effectiveness [...] Read more.
This paper proposes a novel sine step size for warm-restart stochastic gradient descent (SGD). For the SGD based on the new proposed step size, we establish convergence rates for smooth non-convex functions with and without the Polyak–Łojasiewicz (PL) condition. To assess the effectiveness of the new step size, we implemented it across several datasets, including FashionMNIST, CIFAR10, and CIFAR100. This implementation was compared against eight distinct existing methods. The experimental results demonstrate that the proposed sine step size improves the test accuracy of the CIFAR100 dataset by 1.14%. This improvement highlights the efficiency of the new step size when compared to eight other popular step size methods. Full article
Show Figures

Figure 1

Figure 1
<p>Comparison of the new step size with the <math display="inline"><semantics> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mn>1</mn> <mi>t</mi> </mfrac> </mstyle> </semantics></math> step size in SGD convergence.</p>
Full article ">Figure 2
<p>Warm-restart strategy with the proposed new step size for <math display="inline"><semantics> <mrow> <mi>T</mi> <mo>=</mo> <mn>100</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>T</mi> <mo>=</mo> <mn>200</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>T</mi> <mo>=</mo> <mn>400</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>Comparison of new proposed step size and four other step sizes on FashionMNIST, CIFAR10, and CIFAR100 datasets.</p>
Full article ">Figure 4
<p>Comparison of new proposed step size and four other step sizes on FashionMNIST, CIFAR10, and CIFAR100 datasets.</p>
Full article ">
22 pages, 3483 KiB  
Article
A Flexible Framework for Decentralized Composite Optimization with Compressed Communication
by Zhongyi Chang, Zhen Zhang, Shaofu Yang and Jinde Cao
Fractal Fract. 2024, 8(12), 721; https://doi.org/10.3390/fractalfract8120721 - 5 Dec 2024
Viewed by 408
Abstract
This paper addresses the decentralized composite optimization problem, where a network of agents cooperatively minimize the sum of their local objective functions with non-differentiable terms. We propose a novel communication-efficient decentralized ADMM framework, termed as CE-DADMM, by combining the ADMM framework with the [...] Read more.
This paper addresses the decentralized composite optimization problem, where a network of agents cooperatively minimize the sum of their local objective functions with non-differentiable terms. We propose a novel communication-efficient decentralized ADMM framework, termed as CE-DADMM, by combining the ADMM framework with the three-point compressed (3PC) communication mechanism. This framework not only covers existing mainstream communication-efficient algorithms but also introduces a series of new algorithms. One of the key features of the CE-DADMM framework is its flexibility, allowing it to adapt to different communication and computation needs, balancing communication efficiency and computational overhead. Notably, when employing quasi-Newton updates, CE-DADMM becomes the first communication-efficient second-order algorithm based on compression that can efficiently handle composite optimization problems. Theoretical analysis shows that, even in the presence of compression errors, the proposed algorithm maintains exact linear convergence when the local objective functions are strongly convex. Finally, numerical experiments demonstrate the algorithm’s impressive communication efficiency. Full article
(This article belongs to the Section Optimization, Big Data, and AI/ML)
Show Figures

Figure 1

Figure 1
<p>Distribution of samples across agents for the a9a dataset (<b>left</b>) and ijcnn1 (<b>right</b>).</p>
Full article ">Figure 2
<p>Random communication graph of network with 10 agents.</p>
Full article ">Figure 3
<p>Performance comparison of distributed logistic regression the on a9a dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 4
<p>Performance comparison of distributed logistic regression the on ijcnn1 dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 5
<p>Performance comparison of distributed ridge regression on the a9a dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 6
<p>Performance comparison of distributed ridge regression on the ijcnn1 dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 7
<p>Performance comparison of distributed LASSO on the a9a dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">Figure 8
<p>Performance comparison of distributed LASSO on the ijcnn1 dataset: Plots of iteration number (<b>left</b>) and total communication bits (<b>right</b>) versus distance error.</p>
Full article ">
22 pages, 448 KiB  
Article
The Continuity and Convexity of a Nonlinear Scalarization Function with Applications in Set Optimization Problems Involving a Partial Order Relation
by Zi-Ru Zhang and Yang-Dong Xu
Mathematics 2024, 12(23), 3839; https://doi.org/10.3390/math12233839 - 4 Dec 2024
Viewed by 345
Abstract
In this paper, we deal with the properties and applications of a nonlinear scalarization function for sets by using the Minkowski difference. Under some suitable assumptions, the continuity and convexity concerned with the nonlinear scalarization function for sets are presented. As applications, the [...] Read more.
In this paper, we deal with the properties and applications of a nonlinear scalarization function for sets by using the Minkowski difference. Under some suitable assumptions, the continuity and convexity concerned with the nonlinear scalarization function for sets are presented. As applications, the path connectedness of the solution sets to set optimization problems and the continuity of the solution mappings of parametric set optimization problems are established. The results achieved do not impose the monotonicity of the set-valued objective mapping, which are obviously different from the related ones in the literature. Full article
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications II)
Show Figures

Figure 1

Figure 1
<p>Set <span class="html-italic">A</span>, Set <span class="html-italic">B</span>, and Set <span class="html-italic">D</span>.</p>
Full article ">Figure 2
<p><math display="inline"><semantics> <mrow> <mi>A</mi> <mspace width="0.277778em"/> <mover accent="true"> <mo>−</mo> <mo>˙</mo> </mover> <mspace width="0.277778em"/> <mi>B</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>A</mi> <mspace width="0.277778em"/> <mover accent="true"> <mo>−</mo> <mo>˙</mo> </mover> <mspace width="0.277778em"/> <mi>D</mi> </mrow> </semantics></math>.</p>
Full article ">
14 pages, 3478 KiB  
Article
Physics-Informed Generative Adversarial Network Solution to Buckley–Leverett Equation
by Xianlin Ma, Chengde Li, Jie Zhan and Yupeng Zhuang
Mathematics 2024, 12(23), 3833; https://doi.org/10.3390/math12233833 - 4 Dec 2024
Viewed by 445
Abstract
Efficient and economical hydrocarbon extraction relies on a clear understanding of fluid flow dynamics in subsurface reservoirs, where multiphase flow in porous media poses complex modeling challenges. Traditional numerical methods for solving the governing partial differential equations (PDEs) provide effective solutions but struggle [...] Read more.
Efficient and economical hydrocarbon extraction relies on a clear understanding of fluid flow dynamics in subsurface reservoirs, where multiphase flow in porous media poses complex modeling challenges. Traditional numerical methods for solving the governing partial differential equations (PDEs) provide effective solutions but struggle with the high computational demands required for accurately capturing fine-scale flow dynamics. In response, this study introduces a physics-informed generative adversarial network (GAN) framework for addressing the Buckley–Leverett (B-L) equation with non-convex flux functions. The proposed framework consists of two novel configurations: a Physics-Informed Generator GAN (PIG-GAN) and Dual-Informed GAN (DI-GAN), both of which are rigorously tested in forward and inverse problem settings for the B-L equation. We assess model performance under noisy data conditions to evaluate robustness. Our results demonstrate that these GAN-based models effectively capture the B-L shock front, enhancing predictive accuracy while embedding fluid flow equations to ensure model interpretability. This approach offers a significant advancement in modeling complex subsurface environments, providing an efficient alternative to traditional methods in fluid dynamics applications. Full article
Show Figures

Figure 1

Figure 1
<p>A reservoir model illustrating water frontal advance using the B-L equation.</p>
Full article ">Figure 2
<p>Water saturation profiles at different hours.</p>
Full article ">Figure 3
<p>Determination of water shock front saturation by Welge’s approach.</p>
Full article ">Figure 4
<p>Schematic representation of PIG-GAN for solving B-L equation.</p>
Full article ">Figure 5
<p>Water saturation profiles obtained using Welge’s graphic method. (<b>a</b>) Distribution of water saturation; (<b>b</b>) solutions of B-L equation at different moments.</p>
Full article ">Figure 6
<p>Data-driven GAN solutions with different numbers of training samples (500, 2000, 4000), (dashed red) and analytical solution (solid blue) at three different moments.</p>
Full article ">Figure 7
<p>Comparison between PIG-GAN (dashed red) and analytical solution (solid blue) at three different moments.</p>
Full article ">Figure 8
<p>Comparison between DI-GAN (dashed red) and analytical solution (solid blue) at three different moments.</p>
Full article ">Figure 9
<p>Comparison between the PIG-GAN (dashed red) results with the inferred parameters and analytical solutions (solid blue).</p>
Full article ">Figure 10
<p>Distribution of initial water saturation.</p>
Full article ">Figure 11
<p>Comparison between PIG-GAN (dashed red) results with inferred parameters and analytical solutions (solid blue) under noisy training data.</p>
Full article ">
14 pages, 1496 KiB  
Article
How Habitat Simplification Shapes the Morphological Characteristics of Ant Assemblages (Hymenoptera: Formicidae) in Different Biogeographical Contexts
by Ana Cristina da Silva Utta, Gianpasquale Chiatante, Enrico Schifani, Alberto Meriggi, Itanna Oliveira Fernandes, Paulo A. V. Borges, Ricardo R. C. Solar, Fabricio Beggiato Baccaro and Donato Antonio Grasso
Insects 2024, 15(12), 961; https://doi.org/10.3390/insects15120961 - 3 Dec 2024
Viewed by 708
Abstract
Human-driven changes in land cover and use can significantly impact species ants community structures, often leading to a decline in taxonomic diversity or species homogenization. Ant morphology, used as a proxy for ecological function, offers a valuable framework for understanding the effects of [...] Read more.
Human-driven changes in land cover and use can significantly impact species ants community structures, often leading to a decline in taxonomic diversity or species homogenization. Ant morphology, used as a proxy for ecological function, offers a valuable framework for understanding the effects of anthropogenic disturbances on ant diversity. This study explored the morphological diversity of ant assemblages in agricultural ecosystems and secondary forests in Italy and the Brazilian Amazon, analyzing how these communities are structured and adapted to different environments. The research aims to understand the ecological interactions and the role of ants in maintaining biodiversity in these contexts. The study was conducted in the Ticino River Natural Park, Italy, and the Paragominas mosaic in Pará, Brazil. The ants were sampled using epigean pitfall traps at 15 agricultural and 13 forest sites. In the secondary forests, the species richness was significantly higher in both countries compared to agricultural areas. In general, the Community Weighted Mean (CWM) of the selected traits (head length, head width, interocular distance, mandible length, eye width, Weber’s length, and tibia length) of Brazilian ants was higher than those of Italian. However, the CWM of agricultural areas of the two countries was more similar. We noticed the convex hull (i.e., the volume of an assemblage in the morphological space) of Brazilian secondary forests was still larger than Italian secondary forests when both assemblages have the same number of species. Morphological homogenization was more pronounced in agricultural settings, whereas secondary forests showed more variability, highlighting the role of environmental filtering in shaping ant communities across land use types. Full article
(This article belongs to the Section Insect Ecology, Diversity and Conservation)
Show Figures

Figure 1

Figure 1
<p>Species rarefaction curves for ants sampled in agricultural and secondary forests in Brazil and Italy. The solid and stippled lines represent the interpolated and extrapolated values, respectively. Shaded areas around the lines represent the 95% confidence intervals.</p>
Full article ">Figure 2
<p>Mean (±95% confidence intervals) effect sizes (Hedge’s g) between Brazilian and Italian CWM for seven morphological traits measured for two distinct contexts. The dashed line represents the Italian CWM. When 95% CI did not overlap 0 (Italian CWMs), the difference in CWM was significant. Points on the right side of the dashed line indicate that the CWM of Brazilian ants is larger than the Italian ant species.</p>
Full article ">Figure 3
<p>Convex hull projection of morphological trait space for Brazilian (purple) and Italian (yellow) agricultural and secondary forest ant communities.</p>
Full article ">Figure 4
<p>Convex hull volumes of traits between two land uses. The points indicate the means of convex hull volumes. The bars represent 95% confidence intervals calculated after 999 bootstrap resampling.</p>
Full article ">
11 pages, 252 KiB  
Article
Similar Classes of Convex and Close-to-Convex Meromorphic Functions Obtained Through Integral Operators
by Luminiţa-Ioana Cotîrlă and Elisabeta-Alina Totoi
Symmetry 2024, 16(12), 1604; https://doi.org/10.3390/sym16121604 - 2 Dec 2024
Viewed by 412
Abstract
We define new classes of meromorphic p-valent convex functions, respectively, meromorphic close-to-convex functions, by using an extension of Wanas operator in order to study the preservation properties of these classes, when a well-known integral operator is used. We find the conditions which allow [...] Read more.
We define new classes of meromorphic p-valent convex functions, respectively, meromorphic close-to-convex functions, by using an extension of Wanas operator in order to study the preservation properties of these classes, when a well-known integral operator is used. We find the conditions which allow this operator to preserve the classes mentioned above, and we will remark the symmetry between these classes. Full article
(This article belongs to the Special Issue Geometric Function Theory and Special Functions II)
19 pages, 317 KiB  
Article
Sharp Second-Order Hankel Determinants Bounds for Alpha-Convex Functions Connected with Modified Sigmoid Functions
by Muhammad Abbas, Reem K. Alhefthi, Daniele Ritelli and Muhammad Arif
Axioms 2024, 13(12), 844; https://doi.org/10.3390/axioms13120844 - 1 Dec 2024
Viewed by 513
Abstract
The study of the Hankel determinant generated by the Maclaurin series of holomorphic functions belonging to particular classes of normalized univalent functions is one of the most significant problems in geometric function theory. Our goal in this study is first to define a [...] Read more.
The study of the Hankel determinant generated by the Maclaurin series of holomorphic functions belonging to particular classes of normalized univalent functions is one of the most significant problems in geometric function theory. Our goal in this study is first to define a family of alpha-convex functions associated with modified sigmoid functions and then to investigate sharp bounds of initial coefficients, Fekete-Szegö inequality, and second-order Hankel determinants. Moreover, we also examine the logarithmic and inverse coefficients of functions within a defined family regarding recent issues. All of the estimations that were found are sharp. Full article
(This article belongs to the Special Issue Recent Advances in Complex Analysis and Related Topics)
Back to TopTop