Nothing Special   »   [go: up one dir, main page]

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
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
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
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
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
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
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (22,346)

Search Parameters:
Keywords = high-precision

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
16 pages, 467 KiB  
Article
Distributed Estimation for 0-Constrained Quantile Regression Using Iterative Hard Thresholding
by Zhihe Zhao and Heng Lian
Mathematics 2025, 13(4), 669; https://doi.org/10.3390/math13040669 - 18 Feb 2025
Abstract
Distributed frameworks for statistical estimation and inference have become a critical toolkit for analyzing massive data efficiently. In this paper, we present distributed estimation for high-dimensional quantile regression with 0 constraint using iterative hard thresholding (IHT). We propose a communication-efficient distributed estimator [...] Read more.
Distributed frameworks for statistical estimation and inference have become a critical toolkit for analyzing massive data efficiently. In this paper, we present distributed estimation for high-dimensional quantile regression with 0 constraint using iterative hard thresholding (IHT). We propose a communication-efficient distributed estimator which is linearly convergent to the true parameter up to the statistical precision of the model, despite the fact that the check loss minimization problem with an 0 constraint is neither strongly smooth nor convex. The distributed estimator we develop can achieve the same convergence rate as the estimator based on the whole data set under suitable assumptions. In our simulations, we illustrate the convergence of the estimators under different settings and also demonstrate the accuracy of nonzero parameter identification. Full article
(This article belongs to the Section D1: Probability and Statistics)
13 pages, 9723 KiB  
Article
Demagnetization Fault Diagnosis for PMSM Drive System with Dual Extended Kalman Filter
by Jiahan Wang, Chen Li and Zhanqing Zhou
World Electr. Veh. J. 2025, 16(2), 112; https://doi.org/10.3390/wevj16020112 - 18 Feb 2025
Abstract
Aiming at the irreversible demagnetization of permanent magnet synchronous motors (PMSMs) under extreme working conditions, a fault diagnosis method for permanent magnet demagnetization based on multi-parameter estimation is proposed in this paper. This scheme aims to provide technical support for enhancing the safety [...] Read more.
Aiming at the irreversible demagnetization of permanent magnet synchronous motors (PMSMs) under extreme working conditions, a fault diagnosis method for permanent magnet demagnetization based on multi-parameter estimation is proposed in this paper. This scheme aims to provide technical support for enhancing the safety and reliability of permanent magnet motor drive systems. In the proposed scheme, multiple operating states of the motor are acquired by injecting sinusoidal current signals into the d-axis, ensuring that the parameter estimation equation satisfies the full rank condition. Furthermore, the accurate dq-axis inductance parameters are obtained based on a recursive least square method. Subsequently, a dual extended Kalman filter is employed to acquire real-time permanent magnet flux linkage data of PMSMs, and the estimation data between the two algorithms are transferred to each other to eliminate the bias of permanent magnet flux estimation caused by a parameter mismatch. Finally, accurate evaluation of the remanence level of the rotor permanent magnet and demagnetization fault diagnosis can be achieved based on the obtained permanent magnet flux linkage parameters. The experimental results show that the relative estimation errors of the dq-axis inductance and permanent magnet flux linkage are within 5%, which can realize the effective diagnosis of demagnetization fault and high-precision condition monitoring of a permanent magnet health. Full article
Show Figures

Figure 1

Figure 1
<p>Block diagram of the demagnetization fault diagnosis based on DEKF.</p>
Full article ">Figure 2
<p>Control block diagram of the proposed demagnetization fault diagnosis method.</p>
Full article ">Figure 3
<p>Experimental platform.</p>
Full article ">Figure 4
<p>Experimental waveforms of the stator current and its spectrum. (<b>a</b>) M1. (<b>b</b>) M2. (<b>c</b>) M3.</p>
Full article ">Figure 5
<p>Experimental results of the proposed diagnosis method in M1.</p>
Full article ">Figure 6
<p>Experimental results of the proposed diagnosis method in M2.</p>
Full article ">Figure 7
<p>Experimental results of the proposed diagnosis method in M3.</p>
Full article ">Figure 8
<p>Experimental results of the proposed diagnosis method at 1.2 N·m (<b>a</b>) M1 (<b>b</b>) M2, (<b>c</b>) M3.</p>
Full article ">
34 pages, 942 KiB  
Article
Discrete Information Acquisition in Financial Markets
by Jingrui Pan, Shancun Liu, Qiang Zhang and Yaodong Yang
Mathematics 2025, 13(4), 666; https://doi.org/10.3390/math13040666 - 18 Feb 2025
Abstract
We study investors’ information acquisition strategies under arbitrary and discrete sets of information precision and derive conditions for the existence of equilibria. When investors face information choice from general precision sets, despite their homogeneity, the information market can exhibit asymmetric corner equilibria, where [...] Read more.
We study investors’ information acquisition strategies under arbitrary and discrete sets of information precision and derive conditions for the existence of equilibria. When investors face information choice from general precision sets, despite their homogeneity, the information market can exhibit asymmetric corner equilibria, where some investors acquire low-precision information and others acquire high-precision information. Conversely, in the case of high-precision sets, there is a symmetric and unique interior equilibrium where all informed agents opt for the same precision level. Furthermore, the impact of information technologies on price informativeness is uncertain: an improvement in information quality tends to reduce price informativeness due to more investors’ free ride on prices, whereas a reduction in information costs enhances price informativeness by encouraging more investors to acquire information. Our analysis has implications on the prevailing trend of robo-advising and the herding behavior of analysts. Full article
Show Figures

Figure 1

Figure 1
<p>Timeline. The whole market is separated into the information market and the financial market. Precision set <math display="inline"><semantics> <mrow> <mo>Γ</mo> <mo>=</mo> <mo>{</mo> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mn>2</mn> </mrow> </msub> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>J</mi> </mrow> </msub> <mo>}</mo> </mrow> </semantics></math>. Allocation <span class="html-italic">A</span> as a function of the precision set <math display="inline"><semantics> <mo>Γ</mo> </semantics></math> characterizes an assignment of a private signal to each rational investor.</p>
Full article ">Figure 2
<p>Precision partition. Two inflection points, designated as Point A and Point B, divides the red line into three regions. These regions correspond to the three precision sets in the partition. Besides, Point A is <math display="inline"><semantics> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mi>ε</mi> </msub> <mo>=</mo> <mn>0.83</mn> <mo>,</mo> <mrow/> <msub> <mi>μ</mi> <mi>ε</mi> </msub> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mrow/> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>μ</mi> <mi>ε</mi> </msub> <mo>,</mo> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </mrow> </mfenced> <mo>=</mo> <mn>0</mn> </mrow> </mfenced> </semantics></math> and Point B is <math display="inline"><semantics> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mi>ε</mi> </msub> <mo>=</mo> <mn>1.07</mn> <mo>,</mo> <mrow/> <msub> <mi>μ</mi> <mi>ε</mi> </msub> <mo>=</mo> <mn>0</mn> <mo>,</mo> <mrow/> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>μ</mi> <mi>ε</mi> </msub> <mo>,</mo> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </mrow> </mfenced> <mo>=</mo> <mn>0</mn> </mrow> </mfenced> </semantics></math>.</p>
Full article ">Figure 3
<p>Equilibrium boundary and precision sets in precision partition.</p>
Full article ">Figure 4
<p>Optimal information acquisition in Proposition 2. (<b>a</b>) In panel <b>a</b>, the blue line illustrates the relationship between the net expected gain <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mi>ε</mi> </msub> <mo>|</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </semantics></math> and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>3</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. Point <span class="html-italic">M</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.1</mn> <mo>,</mo> <mn>0.08</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>, Point <span class="html-italic">N</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.2</mn> <mo>,</mo> <mn>0.14</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>, and Point <span class="html-italic">O</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.3</mn> <mo>,</mo> <mn>0.17</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>. (<b>b</b>) In panel <b>b</b>, the blue line illustrates the relationship between the net expected gain <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mi>ε</mi> </msub> <mo>|</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </semantics></math> and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mn>1</mn> <mo>,</mo> <mn>2</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. Point <span class="html-italic">M</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.3</mn> <mo>,</mo> <mn>0.14</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>, Point <span class="html-italic">N</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.6</mn> <mo>,</mo> <mn>0.14</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>, and Point <span class="html-italic">O</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.8</mn> <mo>,</mo> <mn>0.07</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>. In addition, we use the following parameters in both Panel <b>a</b> and Panel <b>b</b>. The precision of the fundamental value is <math display="inline"><semantics> <mrow> <msub> <mi>τ</mi> <mi>v</mi> </msub> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, the precision of noise trading is <math display="inline"><semantics> <mrow> <msub> <mi>τ</mi> <mi>u</mi> </msub> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, the risk tolerance coefficient is <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, and the function of information acquisition cost is <math display="inline"><semantics> <mrow> <mi>B</mi> <mfenced separators="" open="(" close=")"> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </mfenced> <mo>=</mo> <mn>0.5</mn> <msubsup> <mi>τ</mi> <mi>ε</mi> <mn>2</mn> </msubsup> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>Optimal information acquisition in Proposition 3. In the figure, the information precision set <math display="inline"><semantics> <mrow> <mo>Γ</mo> <mo>=</mo> <mo>{</mo> <mn>0.85</mn> <mo>,</mo> <mn>0.9</mn> <mo>,</mo> <mn>1.0</mn> <mo>}</mo> </mrow> </semantics></math>, and the corresponding allocation in equilibrium is <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>1</mn> <mi>I</mi> </msubsup> </semantics></math>, where <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>1</mn> <mi>I</mi> </msubsup> </semantics></math> represents that all informed agents acquire information precision <math display="inline"><semantics> <mrow> <mn>0.85</mn> </mrow> </semantics></math>. The blue line illustrates the relationship between <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mi>ε</mi> </msub> <mo>|</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>1</mn> <mi>I</mi> </msubsup> </semantics></math>. Point <span class="html-italic">M</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.85</mn> <mo>,</mo> <mn>0</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>, Point <span class="html-italic">N</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>0.9</mn> <mo>,</mo> <mo>−</mo> <mn>0.03</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>, and Point <span class="html-italic">O</span> is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mn>1.0</mn> <mo>,</mo> <mo>−</mo> <mn>0.06</mn> <mo stretchy="false">)</mo> </mrow> </semantics></math>. Other parameters is same as in <a href="#mathematics-13-00666-f004" class="html-fig">Figure 4</a>.</p>
Full article ">Figure 6
<p>Optimal information acquisition in Proposition 4. In the figure, from Panels (<b>a</b>–<b>c</b>), the blue line illustrates the relationship between the net expected gain <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mo stretchy="false">(</mo> <msub> <mi>τ</mi> <mi>ε</mi> </msub> <mo>|</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </semantics></math> and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given allocations <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>2</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>, <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mn>12</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>, and <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mn>12</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>, respectively. The information precision set <math display="inline"><semantics> <mrow> <mo>Γ</mo> <mo>=</mo> <mo>{</mo> <mn>0.2</mn> <mo>,</mo> <mn>0.3</mn> <mo>,</mo> <mn>0.9</mn> <mo>}</mo> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>0.3</mn> <mo>,</mo> <mn>0.6</mn> <mo>,</mo> <mn>0.9</mn> <mo>}</mo> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>0.1</mn> <mo>,</mo> <mn>0.85</mn> <mo>,</mo> <mn>1.0</mn> <mo>}</mo> </mrow> </semantics></math> in Panels <b>a</b>, <b>b</b>, and <b>c</b>, respectively. In addition, we set parameters in Panels (<b>a</b>–<b>c</b>): The precision of the fundamental value is <math display="inline"><semantics> <mrow> <msub> <mi>τ</mi> <mi>v</mi> </msub> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, the precision of noise trading is <math display="inline"><semantics> <mrow> <msub> <mi>τ</mi> <mi>u</mi> </msub> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, the risk tolerance coefficient is <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, and the function of information acquisition cost is <math display="inline"><semantics> <mrow> <mi>B</mi> <mfenced separators="" open="(" close=")"> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </mfenced> <mo>=</mo> <mn>0.5</mn> <msubsup> <mi>τ</mi> <mi>ε</mi> <mn>2</mn> </msubsup> </mrow> </semantics></math>.</p>
Full article ">Figure A1
<p>The relationship between the net expected gain and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given two different types of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>1</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. Panels (<b>a</b>,<b>b</b>) characterize the first and second types of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>1</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>, respectively. In both panels, the position of the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> </semantics></math> is higher in vertical height than the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> </semantics></math> given an allocation <span class="html-italic">A</span>, implying <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> <mo>&gt;</mo> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> </mrow> </semantics></math>.</p>
Full article ">Figure A2
<p>The relationship between the net expected gain and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given the third type of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>1</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. In the figure, the orange lines denote potential evolutionary routes. An allocation in bold black in an evolutionary route indicates an information market equilibrium. For instance, allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>2</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math> in bold black in route a is a non-zero corner equilibrium. Specifically, allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mn>1</mn> <mo>,</mo> <mn>2</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math> denotes that a part of the rational investors acquire <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mn>1</mn> </mrow> </msub> </semantics></math> and others acquire <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mn>2</mn> </mrow> </msub> </semantics></math>. Moreover, the position of the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> </semantics></math> is higher in vertical height than the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> </semantics></math> given an allocation <span class="html-italic">A</span>, implying <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> <mo>&gt;</mo> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> </mrow> </semantics></math>.</p>
Full article ">Figure A3
<p>The relationship between the net expected gain and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given the fourth type of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>1</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. In the figure, the orange lines denote potential evolutionary routes. An allocation in bold black in an evolutionary route indicates an information market equilibrium. For instance, allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mn>2</mn> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math> in bold black in route a is a non-zero corner equilibrium. Specifically, allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mn>1</mn> <mo>,</mo> <mn>2</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math> denotes that a part of the rational investors acquire <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mn>1</mn> </mrow> </msub> </semantics></math> and others acquire <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mn>2</mn> </mrow> </msub> </semantics></math>. Moreover, the position of the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> </semantics></math> is higher in vertical height than the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> </semantics></math> given an allocation <span class="html-italic">A</span>, implying <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> <mo>&gt;</mo> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> </mrow> </semantics></math>.</p>
Full article ">Figure A4
<p>The relationship between the net expected gain and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given two different types of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mi>h</mi> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. In the figure, Panels (<b>a</b>,<b>b</b>) represent the first and second types of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mi>h</mi> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>, respectively. In both panels, the position of the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> </semantics></math> is higher in vertical height than the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> </semantics></math> given an allocation <span class="html-italic">A</span>, implying <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> <mo>&gt;</mo> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> </mrow> </semantics></math>. Points between <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>h</mi> </mrow> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mo>,</mo> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> </msub> </semantics></math> are ignored.</p>
Full article ">Figure A5
<p>The relationship between the net expected gain and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given two different types of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. In the figure, Panels (<b>a</b>,<b>b</b>) represent the first and second types of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>, respectively. In both panels, the position of the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mo>,</mo> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> </msub> </semantics></math> is higher in vertical height than the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> </semantics></math> given <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>, implying <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mo>,</mo> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo>|</mo> </mrow> <msubsup> <mi>A</mi> <mrow> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </mrow> </mfenced> <mo>&gt;</mo> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>|</mo> </mrow> <msubsup> <mi>A</mi> <mrow> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </mrow> </mfenced> </mrow> </semantics></math>.</p>
Full article ">Figure A6
<p>The relationship between the net expected gain and information precision <math display="inline"><semantics> <msub> <mi>τ</mi> <mi>ε</mi> </msub> </semantics></math> given the third type of allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math>. In the figure, the orange lines denote potential evolutionary routes. An allocation in bold black in an evolutionary route indicates an information market equilibrium. For instance, allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mi>j</mi> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math> in bold black in route a is a non-zero corner equilibrium. Specifically, allocation <math display="inline"><semantics> <msubsup> <mi>A</mi> <mrow> <mi>j</mi> <mo>−</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> </mrow> <mrow> <mi>N</mi> <mi>C</mi> </mrow> </msubsup> </semantics></math> denotes that a part of the rational investors acquire <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mo>,</mo> <mi>j</mi> <mo>−</mo> <mn>1</mn> </mrow> </msub> </semantics></math> and others acquire <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> </semantics></math>. Moreover, the position of the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> </semantics></math> is higher in vertical height than the point <math display="inline"><semantics> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> </semantics></math> given an allocation <span class="html-italic">A</span>, implying <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>i</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> <mo>&gt;</mo> <mi>N</mi> <mi>E</mi> <mi>G</mi> <mfenced separators="" open="(" close=")"> <mrow> <msub> <mi>τ</mi> <mrow> <mi>ε</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>A</mi> </mrow> </mrow> </mfenced> </mrow> </semantics></math>.</p>
Full article ">
27 pages, 15796 KiB  
Article
MSFF: A Multi-Scale Feature Fusion Convolutional Neural Network for Hyperspectral Image Classification
by Gu Gong, Xiaopeng Wang, Jiahua Zhang, Xiaodi Shang, Zhicheng Pan, Zhiyuan Li and Junshi Zhang
Electronics 2025, 14(4), 797; https://doi.org/10.3390/electronics14040797 - 18 Feb 2025
Abstract
In contrast to conventional remote sensing images, hyperspectral remote sensing images are characterized by a greater number of spectral bands and exceptionally high resolution. The richness of both spectral and spatial information facilitates the precise classification of various objects within the images, establishing [...] Read more.
In contrast to conventional remote sensing images, hyperspectral remote sensing images are characterized by a greater number of spectral bands and exceptionally high resolution. The richness of both spectral and spatial information facilitates the precise classification of various objects within the images, establishing hyperspectral imaging as indispensable for remote sensing applications. However, the labor-intensive and time-consuming process of labeling hyperspectral images results in limited labeled samples, while challenges like spectral similarity between different objects and spectral variation within the same object further complicate the development of classification algorithms. Therefore, efficiently exploiting the spatial and spectral information in hyperspectral images is crucial for accomplishing the classification task. To address these challenges, this paper presents a multi-scale feature fusion convolutional neural network (MSFF). The network introduces a dual branch spectral and spatial feature extraction module utilizing 3D depthwise separable convolution for joint spectral and spatial feature extraction, further refined by an attention-based-on-central-pixels (ACP) mechanism. Additionally, a spectral–spatial joint attention module (SSJA) is designed to interactively explore latent dependency between spectral and spatial information through the use of multilayer perceptron and global pooling operations. Finally, a feature fusion module (FF) and an adaptive multi-scale feature extraction module (AMSFE) are incorporated to enable adaptive feature fusion and comprehensive mining of feature information. Experimental results demonstrate that the proposed method performs exceptionally well on the IP, PU, and YRE datasets, delivering superior classification results compared to other methods and underscoring the potential and advantages of MSFF in hyperspectral remote sensing classification. Full article
(This article belongs to the Special Issue Machine Learning and Computational Intelligence in Remote Sensing)
Show Figures

Figure 1

Figure 1
<p>Overall architecture of the MSFF model.</p>
Full article ">Figure 2
<p>Detailed architecture of the MSFF model.</p>
Full article ">Figure 3
<p>3D convolution.</p>
Full article ">Figure 4
<p>3D depthwise separable convolution.</p>
Full article ">Figure 5
<p>The proposed ACP structure.</p>
Full article ">Figure 6
<p>Structure of SSFE module.</p>
Full article ">Figure 7
<p>The proposed SSJA structure.</p>
Full article ">Figure 8
<p>The proposed FF structure.</p>
Full article ">Figure 9
<p>The proposed NAM structure.</p>
Full article ">Figure 10
<p>The proposed AMSFE structure.</p>
Full article ">Figure 11
<p>Datasets and ground truth: (<b>1</b>,<b>2</b>) Indian Pines dataset, (<b>3</b>,<b>4</b>) Pavia University dataset, and (<b>5</b>,<b>6</b>) Yellow River Estuary coastal wetland.</p>
Full article ">Figure 12
<p>Results of different batch sizes on OA, AA, and Kappa.</p>
Full article ">Figure 13
<p>Results of different patch sizes on OA, AA, and Kappa.</p>
Full article ">Figure 14
<p>Results of different channel numbers on OA, AA, and Kappa.</p>
Full article ">Figure 15
<p>Results of different FEG numbers on OA, AA, and Kappa.</p>
Full article ">Figure 16
<p>Classification maps for the IP dataset. (<b>a</b>) Ground-truth map. (<b>b</b>) 2D-CNN. (<b>c</b>) DBMA. (<b>d</b>) SSRN. (<b>e</b>) HybridSN. (<b>f</b>) MDRD-Net. (<b>g</b>) SSFTT. (<b>h</b>) DMAN. (<b>i</b>) MSFF-CBAM. (<b>j</b>) MSFF.</p>
Full article ">Figure 17
<p>Classification maps for the PU dataset. (<b>a</b>) Ground-truth map. (<b>b</b>) 2D-CNN. (<b>c</b>) DBMA. (<b>d</b>) SSRN. (<b>e</b>) HybridSN. (<b>f</b>) MDRD-Net. (<b>g</b>) SSFTT. (<b>h</b>) DMAN. (<b>i</b>) MSFF-CBAM. (<b>j</b>) MSFF.</p>
Full article ">Figure 18
<p>Classification maps for the YRE dataset. (<b>a</b>) Ground-truth map. (<b>b</b>) 2D-CNN. (<b>c</b>) DBMA. (<b>d</b>) SSRN. (<b>e</b>) HybridSN. (<b>f</b>) MDRD-Net. (<b>g</b>) SSFTT. (<b>h</b>) DMAN. (<b>i</b>) MSFF-CBAM. (<b>j</b>) MSFF.</p>
Full article ">Figure 19
<p>The OA of various combinations in three datasets.</p>
Full article ">
17 pages, 5497 KiB  
Article
High Spatiotemporal Resolution Monitoring of Water Body Dynamics in the Tibetan Plateau: An Innovative Method Based on Mixed Pixel Decomposition
by Yuhang Jing and Zhenguo Niu
Sensors 2025, 25(4), 1246; https://doi.org/10.3390/s25041246 - 18 Feb 2025
Abstract
The Tibetan Plateau, known as the “Third Pole” and the “Water Tower of Asia”, has experienced significant changes in its surface water due to global warming. Accurately understanding and monitoring the spatiotemporal distribution of surface water is crucial for ecological conservation and the [...] Read more.
The Tibetan Plateau, known as the “Third Pole” and the “Water Tower of Asia”, has experienced significant changes in its surface water due to global warming. Accurately understanding and monitoring the spatiotemporal distribution of surface water is crucial for ecological conservation and the sustainable use of water resources. Among existing satellite data, the MODIS sensor stands out for its long time series and high temporal resolution, which make it advantageous for large-scale water body monitoring. However, its spatial resolution limitations hinder detailed monitoring. To address this, the present study proposes a dynamic endmember selection method based on phenological features, combined with mixed pixel decomposition techniques, to generate monthly water abundance maps of the Tibetan Plateau from 2000 to 2023. These maps precisely depict the interannual and seasonal variations in surface water, with an average accuracy of 95.3%. Compared to existing data products, the water abundance maps developed in this study provide better detail of surface water, while also benefiting from higher temporal resolution, enabling effective capture of dynamic water information. The dynamic monitoring of surface water on the Tibetan Plateau shows a year-on-year increase in water area, with an increasing fluctuation range. The surface water abundance products presented in this study not only provide more detailed information for the fine characterization of surface water but also offer a new technical approach and scientific basis for timely and accurate monitoring of surface water changes on the Tibetan Plateau. Full article
(This article belongs to the Special Issue Feature Papers in Remote Sensors 2024)
Show Figures

Figure 1

Figure 1
<p>Study Area Overview.</p>
Full article ">Figure 2
<p>Workflow of Water Body Abundance Inversion on the Tibetan Plateau.</p>
Full article ">Figure 3
<p>Abundance maps and validation results: (<b>a</b>) Abundance results for July 2017; (<b>b</b>) Distribution of classification accuracy, commission rate, and omission rate; (<b>c</b>) Scatter plot of RMSE and ME distribution.</p>
Full article ">Figure 4
<p>Analysis of Area Trend Over the Year.</p>
Full article ">Figure 5
<p>Comparison with Other Datasets: (<b>a</b>) Comparison of Area with Other Datasets; (<b>b</b>) Correlation of Abundance Map with Other Datasets.</p>
Full article ">Figure 6
<p>Interannual Area Change Diagram.</p>
Full article ">Figure 7
<p>Correlation Analysis with JRC and GSWED Datasets.</p>
Full article ">Figure 8
<p>Identification Results of Small Water Bodies.</p>
Full article ">Figure 9
<p>Identification of Linear Water Bodies.</p>
Full article ">Figure 10
<p>Potential of Abundance Maps in Wetland Classification.</p>
Full article ">
20 pages, 9029 KiB  
Article
Enhancing Continuum Robotics Accuracy Using a Particle Swarm Optimization Algorithm and Closed-Loop Wire Transmission Model for Minimally Invasive Thyroid Surgery
by Na Guo, Haoyun Zhang, Xingshuai Li, Xinnan Cui, Yang Liu, Jiachen Pan, Yajuan Song and Qinjian Zhang
Appl. Sci. 2025, 15(4), 2170; https://doi.org/10.3390/app15042170 - 18 Feb 2025
Abstract
To address the challenges of confined workspaces and high-precision requirements in thyroid surgery, this paper proposes a modular cable-driven robotic system with a hybrid rigid–continuum structure. By integrating rigid mechanisms and continuum joints within a closed-loop cable-driven framework, the system achieves a balance [...] Read more.
To address the challenges of confined workspaces and high-precision requirements in thyroid surgery, this paper proposes a modular cable-driven robotic system with a hybrid rigid–continuum structure. By integrating rigid mechanisms and continuum joints within a closed-loop cable-driven framework, the system achieves a balance between flexibility in narrow spaces and operational stiffness. To tackle kinematic model inaccuracies caused by manufacturing errors, an innovative joint decoupling strategy combined with the Particle Swarm Optimization (PSO) algorithm is developed to dynamically identify and correct 19 critical parameters. Experimental results demonstrate a 37.74% average improvement in repetitive positioning accuracy and a 52% reduction in maximum absolute error. However, residual positioning errors (up to 4.53 mm) at motion boundaries highlight the need for integrating nonlinear friction compensation. The feasibility of a safety-zone-based force feedback master–slave control strategy is validated through Gazebo simulations, and a ring-grasping experiment on a surgical training platform confirms its clinical applicability. Full article
(This article belongs to the Special Issue Control and Application for Biorobotics)
Show Figures

Figure 1

Figure 1
<p>Joint and drive design. (<b>a</b>) da Vinci Surgical System by Intuitive Surgical, Inc. (Sunnyvale, CA, USA); (<b>b</b>) Versius Surgical Robotic System by CMR Surgical (Cambridge, UK); (<b>c</b>) Hugo RAS System by Medtronic plc (Dublin, Ireland); (<b>d</b>) da Vinci SP Surgical System by Intuitive Surgical, Inc.; (<b>e</b>) SHURUI single-port robotic system by Beijing Surgerii Robot Company Limited (Beijing, China); (<b>f</b>) Smart Endoscopic Surgical Robot System by Shenzhen Jingfeng Medical Technology Co., Ltd. (Shenzhen, China).</p>
Full article ">Figure 2
<p>Decoupling model for motion of multi-joints. (<b>a</b>). Coordinate system schematic. (<b>b</b>). Rigidly hinged joint. (<b>c</b>). The torques exerted on the remaining joints when shoulder joint 1 rotate. (<b>d</b>) The coupling effect between multiple joints.</p>
Full article ">Figure 3
<p>Joint and drive design and kinematic model [<a href="#B21-applsci-15-02170" class="html-bibr">21</a>]. (<b>a</b>). Motion model for continuum manipulator. (<b>b</b>). Constant curvature assumption. (<b>c</b>). Single joint closed-loop cable-driven model.</p>
Full article ">Figure 4
<p>Flow chart of Particle Swarm Optimization algorithm.</p>
Full article ">Figure 5
<p>Robotic system for thyroid surgery. (<b>a</b>) Master–slave control strategy. (<b>b</b>) Performance of tremor filtering for the master hand. (<b>c</b>) Trajectory of the master hand device when constrained by spherical and linear safety zones.</p>
Full article ">Figure 6
<p>Drive system for the thyroid surgical robot. (<b>a</b>) Structure of drive system. (<b>b</b>) The force analysis of the robot. (<b>c</b>–<b>e</b>) The tensile force of the transmission wire at shoulder 2, shoulder 1, and rotary joint based on a deflection of 20° for each joint.</p>
Full article ">Figure 7
<p>Vision-based measurement technique for joint angles. (<b>a</b>) Measurement of joints angles using IC Measure software (2.0.0.286). (<b>b</b>) Automatic vision-based measurement method for joint angles.</p>
Full article ">Figure 8
<p>Accuracy measurement experiment for a single joint. (<b>A</b>) Motion angles of shoulder joint 1 measured using IC Measure software. (<b>B</b>) Measured motion results of shoulder joint 1. (<b>C</b>) Error analysis of the motion results of shoulder joint 1.</p>
Full article ">Figure 9
<p>Experiment for decoupling model of multi-joint.</p>
Full article ">Figure 10
<p>Accuracy of vision-based measurements. (<b>A</b>) Angle of shoulder joint 1 measured using the AVM. (<b>B</b>) Comparison of joint angle measurements between the AVM and IC Measure. (<b>C</b>) Error of AVM measurements relative to the IC Measure results.</p>
Full article ">Figure 11
<p>Verification of parameter identification algorithm via numerical simulation. (<b>a</b>) Training curve of the fitness value for the Particle Swarm Optimization (PSO) algorithm. (<b>b</b>) Identified errors of parameters via PSO via numerical simulation.</p>
Full article ">Figure 12
<p>Measurement scheme for repetitive positioning accuracy of continuum robots. (<b>A</b>) Measuring platform. (<b>B</b>) Testing targets.</p>
Full article ">Figure 13
<p>Comparison of accuracy of RP of the manipulator arm without or with parameters.</p>
Full article ">Figure 14
<p>Trajectory of the slave manipulator arm’s end-effector. The color lines represent the coordinate system established by the ArUco Marker, with red for the X-axis, green for the Y-axis, and blue for the Z-axis. The red dashed line, red ellipse, and red triangle depict the trajectory of the end-effector.</p>
Full article ">Figure 15
<p>Master–slave grasping experiment. (<b>A</b>–<b>D</b>) illustrate the four distinct phases of interaction between the end-effector of the slave manipulator arm and a ring during a ring grasping experiment. (<b>A</b>) The end-effector of the manipulator arm approaches the ring, initiating the grasping motion. (<b>B</b>) The end-effector makes contact with the ring, preparing to secure a grip. (<b>C</b>) The end-effector has successfully grasped the ring, demonstrating the effectiveness of the grasping action. (<b>D</b>) With the ring securely grasped, the end-effector begins to lift it from the cylinder, ready to move the ring to the designated location.</p>
Full article ">
15 pages, 4020 KiB  
Article
Reliability Evaluation of Improved Sampling Method for Mechanical Test of Cable Insulation
by Seung-Won Lee, Jin-Wook Choe, Ik-Su Kwon, Jin-Seok Lim, Byung-Bae Park and Hae-Jong Kim
Energies 2025, 18(4), 982; https://doi.org/10.3390/en18040982 - 18 Feb 2025
Abstract
Underground and submarine power cables are subjected to mechanical stress during installation and operation, which degrades the cable insulation and reduces the reliability of power transmission. Therefore, tests that can evaluate the mechanical properties of power cable insulation are very important. The purpose [...] Read more.
Underground and submarine power cables are subjected to mechanical stress during installation and operation, which degrades the cable insulation and reduces the reliability of power transmission. Therefore, tests that can evaluate the mechanical properties of power cable insulation are very important. The purpose of this paper is to introduce an improved sampling method for the test sample, the peeling, for mechanical testing of power cable insulation and to evaluate the reliability of the method. The influence of the sampling method of the test sample on the mechanical property values was analyzed. The tensile strength and elongation of XLPE (cross-linked polyethylene) and PP (polypropylene) insulation prepared by the slice method and the peeling method were measured, and the surface of the test samples according to the sampling methods was photographed by SEM. The results show that the mechanical property of the cable insulation increased by more than 10% when the improved peeling method was used, and the precision of the peeling method was relatively better. The SEM analysis showed that the surface of the sliced test sample was rougher than the peeled test sample and was physically damaged. Therefore, the high reliability of the peeling method for mechanical testing of cable insulators was demonstrated. Full article
(This article belongs to the Section F6: High Voltage)
Show Figures

Figure 1

Figure 1
<p>Mechanical stresses on underground and submarine power cables.</p>
Full article ">Figure 2
<p>The description of test cables: (<b>a</b>) a commercialized 22.9 kV class XLPE insulation-based cable and (<b>b</b>) a picture of a MV class PP insulation-based cable under development.</p>
Full article ">Figure 3
<p>Methods of sampling insulation from cables: (<b>a</b>) method of slicing insulation (<b>b</b>) method of peeling insulation.</p>
Full article ">Figure 4
<p>Tensile strength and elongation measurements of cable insulation: (<b>a</b>) before mechanical testing, (<b>b</b>) during mechanical testing.</p>
Full article ">Figure 5
<p>Process for SEM imaging of cable insulator surfaces: (<b>a</b>) insulation surface coating, (<b>b</b>) insulation surface SEM.</p>
Full article ">Figure 6
<p>Insulation of tensile strength for sampling method by insulation thickness and type: (<b>a</b>) XLPE, (<b>b</b>) PP.</p>
Full article ">Figure 7
<p>Insulation of elongation for sampling method by insulation thickness and type: (<b>a</b>) XLPE, (<b>b</b>) PP.</p>
Full article ">Figure 8
<p>Precision of tensile strength by thickness and insulator by insulation sampling method: (<b>a</b>) XLPE, (<b>b</b>) PP.</p>
Full article ">Figure 9
<p>Precision of elongation by thickness and insulator type by insulation sampling method: (<b>a</b>) XLPE and (<b>b</b>) PP.</p>
Full article ">Figure 10
<p>SEM images of the surface depending on the sampling method: (<b>a</b>) peeled XLPE, (<b>b</b>) sliced XLPE, (<b>c</b>) peeled PP, and (<b>d</b>) sliced PP.</p>
Full article ">
21 pages, 8230 KiB  
Article
Cloud Detection in Remote Sensing Images Based on a Novel Adaptive Feature Aggregation Method
by Wanting Zhou, Yan Mo, Qiaofeng Ou and Shaowei Bai
Sensors 2025, 25(4), 1245; https://doi.org/10.3390/s25041245 - 18 Feb 2025
Abstract
Cloud detection constitutes a pivotal task in remote sensing preprocessing, yet detecting cloud boundaries and identifying thin clouds under complex scenarios remain formidable challenges. In response to this challenge, we designed a network model, named NFCNet. The network comprises three submodules: the Hybrid [...] Read more.
Cloud detection constitutes a pivotal task in remote sensing preprocessing, yet detecting cloud boundaries and identifying thin clouds under complex scenarios remain formidable challenges. In response to this challenge, we designed a network model, named NFCNet. The network comprises three submodules: the Hybrid Convolutional Attention Module (HCAM), the Spatial Pyramid Fusion Attention (SPFA) module, and the Dual-Stream Convolutional Aggregation (DCA) module. The HCAM extracts multi-scale features to enhance global representation while matching channel importance weights to focus on features that are more critical to the detection task. The SPFA module employs a novel adaptive feature aggregation method that simultaneously compensates for detailed information lost in the downsampling process and reinforces critical information in upsampling to achieve more accurate discrimination between cloud and non-cloud pixels. The DCA module integrates high-level features with low-level features to ensure that the network maintains its sensitivity to detailed information. Experimental results using the HRC_WHU, CHLandsat8, and 95-Cloud datasets demonstrate that the proposed algorithm surpasses existing optimal methods, achieving finer segmentation of cloud boundaries and more precise localization of subtle thin clouds. Full article
(This article belongs to the Section Sensing and Imaging)
Show Figures

Figure 1

Figure 1
<p>The structure of NFCNet.</p>
Full article ">Figure 2
<p>Diagram of HCAM structure.</p>
Full article ">Figure 3
<p>Diagram of SPFA structure.</p>
Full article ">Figure 4
<p>Diagram of DCA structure.</p>
Full article ">Figure 5
<p>Comparison of accuracy of different methods with five land cover types.</p>
Full article ">Figure 6
<p>The visual output of each network on the HRC_WHU dataset: (<b>a</b>) the original image; (<b>b</b>) the corresponding label; (<b>c</b>) the prediction of UNet; (<b>d</b>) the prediction of deeplabv3+; (<b>e</b>) the prediction of SAtt-UNet; (<b>f</b>) the prediction of Cloud-Attu; (<b>g</b>) the prediction of DCNet; (<b>h</b>) the prediction of CRSNet; (<b>i</b>) the prediction of BABFNet; (<b>j</b>) the prediction of MCDNet; (<b>k</b>) the prediction of AFMUNet; and (<b>l</b>) the prediction of NFCNet.</p>
Full article ">Figure 7
<p>The visual output of each network on the CHLandsat8 dataset: (<b>a</b>) the original image; (<b>b</b>) the corresponding label; (<b>c</b>) the prediction of UNet; (<b>d</b>) the prediction of deeplabv3+; (<b>e</b>) the prediction of SAtt-UNet; (<b>f</b>) the prediction of Cloud-Attu; (<b>g</b>) the prediction of DCNet; (<b>h</b>) the prediction of CRSNet; (<b>i</b>) the prediction of BABFNet; (<b>j</b>) the prediction of MCDNet; (<b>k</b>) the prediction of AFMUNet; and (<b>l</b>) the prediction of NFCNet.</p>
Full article ">Figure 8
<p>The visual output of each network on the 95-Cloud dataset: (<b>a</b>) the original image; (<b>b</b>) the corresponding label; (<b>c</b>) the prediction of UNet; (<b>d</b>) the prediction of deeplabv3+; (<b>e</b>) the prediction of SAtt-UNet; (<b>f</b>) the prediction of Cloud-Attu; (<b>g</b>) the prediction of DCNet; (<b>h</b>) the prediction of CRSNet; (<b>i</b>) the prediction of BABFNet; (<b>j</b>) the prediction of AFMUNet; and (<b>k</b>) the prediction of NFCNet.</p>
Full article ">
32 pages, 8827 KiB  
Article
Hybrid Predictive Maintenance for Building Systems: Integrating Rule-Based and Machine Learning Models for Fault Detection Using a High-Resolution Danish Dataset
by Silvia Mazzetto
Buildings 2025, 15(4), 630; https://doi.org/10.3390/buildings15040630 - 18 Feb 2025
Abstract
This study evaluates the effectiveness of six machine learning models, Artificial Neural Networks (ANN), Random Forest (RF), Extreme Gradient Boosting (XGBoost), Support Vector Machine (SVM), K-Nearest Neighbors (KNN), and Logistic Regression (LR), for predictive maintenance in building systems. Utilizing a high-resolution dataset collected [...] Read more.
This study evaluates the effectiveness of six machine learning models, Artificial Neural Networks (ANN), Random Forest (RF), Extreme Gradient Boosting (XGBoost), Support Vector Machine (SVM), K-Nearest Neighbors (KNN), and Logistic Regression (LR), for predictive maintenance in building systems. Utilizing a high-resolution dataset collected every five minutes from six office rooms at Aalborg University in Denmark over a ten-month period (27 February 2023 to 31 December 2023), we defined rule-based conditions to label historical faults in HVAC, lighting, and occupancy systems, resulting in over 100,000 fault instances. XGBoost outperformed other models, achieving an accuracy of 95%, precision of 93%, recall of 94%, and an F1-score of 0.93, with a computation time of 60 s. The model effectively predicted critical faults such as “Light_On_No_Occupancy” (1149 occurrences) and “Damper_Open_No_Occupancy” (8818 occurrences), demonstrating its potential for real-time fault detection and energy optimization in building management systems. Our findings suggest that implementing XGBoost in predictive maintenance frameworks can significantly enhance fault detection accuracy, reduce energy waste, and improve operational efficiency. Full article
(This article belongs to the Section Building Energy, Physics, Environment, and Systems)
Show Figures

Figure 1

Figure 1
<p>A layered framework illustrating the development process for predictive maintenance models.</p>
Full article ">Figure 2
<p>Time-series plots of temperature data from heating system sensors and room temperature sensors over the period from the end of February 2023 to January 2024.</p>
Full article ">Figure 3
<p>Time-series plots representing the number of people present in four different rooms (Rooms A–D).</p>
Full article ">Figure 4
<p>Workflow for predictive maintenance model development. The process begins by defining fault detection rules for various system components (e.g., HVAC damper, radiator valve, heating pump, lighting, and temperature sensor).</p>
Full article ">Figure 5
<p>Instances of the damper remaining open in unoccupied rooms (fault condition) over time, with faults marked in red.</p>
Full article ">Figure 6
<p>Occurrences where the radiator valve was left open despite no occupancy, indicating a fault condition shown in red.</p>
Full article ">Figure 7
<p>Periods where the heating pump was active without a heating demand, with faults indicated in red.</p>
Full article ">Figure 8
<p>Instances of room lights left on during unoccupied periods, with fault conditions highlighted in red.</p>
Full article ">Figure 9
<p>Occurrences of extreme outdoor temperatures, where values fall outside the acceptable range (fault condition = 1), though no faults were detected in this time period.</p>
Full article ">Figure 10
<p>Instances where the ventilation fan remained on despite being set to off, indicating a fault condition (faults shown in red).</p>
Full article ">Figure 11
<p>Instances of energy consumption by the heating coil despite no heating demand, with fault conditions marked in red.</p>
Full article ">Figure 12
<p>Fault occurrences for “Heating_Pump_Active_No_Heating” over time, with data segmented into training (blue), validation (green), and test (red) sets, showing periods when the heating pump remained active despite no heating demand.</p>
Full article ">Figure 13
<p>Ranking of the top three machine learning models based on performance, with Extreme Gradient Boosting (XGBoost) ranked first, Random Forest second, and Artificial Neural Network third.</p>
Full article ">Figure 14
<p>Predicted fault occurrences for “Light_On_No_Occupancy” over time, zoomed in to show the faults.</p>
Full article ">Figure 15
<p>Predicted fault occurrences for “Fan_Off_Ventilation_On” over time, zoomed in to show the faults.</p>
Full article ">Figure 16
<p>Year-long analysis of predicted fault occurrences for “Damper_Open_No_Occupancy”, across different seasons.</p>
Full article ">Figure 17
<p>Year-long analysis of predicted fault occurrences for “Radiator_Valve_Open_No_People”, across different seasons.</p>
Full article ">
27 pages, 1167 KiB  
Article
AdaptiveConv2d: A Novel Convolutional Module for Medical Image Segmentation
by Donghua Liu and Zuofeng Zhou
Appl. Sci. 2025, 15(4), 2169; https://doi.org/10.3390/app15042169 - 18 Feb 2025
Abstract
With the rapid advancement of medical imaging technology, medical image segmentation has become increasingly crucial in disease diagnosis, treatment planning, and intraoperative navigation. In this paper, we propose a novel convolutional module, AdaptiveConv2d, that is designed to address the limitations of traditional convolutions [...] Read more.
With the rapid advancement of medical imaging technology, medical image segmentation has become increasingly crucial in disease diagnosis, treatment planning, and intraoperative navigation. In this paper, we propose a novel convolutional module, AdaptiveConv2d, that is designed to address the limitations of traditional convolutions and advance convolutional techniques in medical image processing. This approach targets the unique challenges associated with medical images, including complex tissue structures, irregular boundaries, low contrast, and high noise levels. The AdaptiveConv2d module integrates adaptive feature extraction, an optimized receptive field, enhanced sensitivity to details and boundaries, and an innovative feature fusion mechanism to significantly improve segmentation accuracy and robustness. By dynamically adjusting the convolution operations, the module adapts flexibly to medical images with varying shapes and boundaries, leading to more precise feature extraction. Experimental results indicate that the AdaptiveConv2d module outperforms several existing methods across multiple medical image segmentation tasks, highlighting its potential as an effective tool for medical image analysis. Furthermore, the highly modular design of AdaptiveConv2d allows for seamless integration into existing neural network architectures, offering a versatile and adaptable solution for a range of medical image segmentation applications. Full article
Show Figures

Figure 1

Figure 1
<p>The architecture of the AdaptiveConv2d module. The proposed module starts by processing the input feature map <span class="html-italic">X</span> through a standard convolutional operation Conv<sub>1×1</sub>(X)), followed by global average pooling to extract spatially aggregated features. These features are used to compute the energy function (<math display="inline"><semantics> <msub> <mi mathvariant="script">L</mi> <mi>energy</mi> </msub> </semantics></math>), which guides the generation of channel-wise attention weights (<math display="inline"><semantics> <msub> <mi>α</mi> <mi>c</mi> </msub> </semantics></math>) through an optimization process. The channel weights are activated using a sigmoid function and are applied to adaptively modulate the feature map. The modulated feature map is then combined with the output of a <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>×</mo> <mn>1</mn> </mrow> </semantics></math> convolutional layer, Conv<sub>1×1</sub>(X), to produce the final enhanced output. This module is designed to improve feature representation in medical image segmentation tasks by dynamically adjusting channel importance based on energy optimization.</p>
Full article ">Figure 2
<p>Global average pooling. This figure illustrates the procedure of global average pooling (GAP). GAP operates by computing the average value of each feature channel independently, reducing the spatial dimensions of the input feature map into a single scalar per channel. This operation retains the essential global spatial information while significantly reducing computational complexity, making it highly effective for tasks such as feature aggregation and attention mechanism generation.</p>
Full article ">Figure 3
<p>Improved visualization: feature map and energy function. This figure shows the visualization of feature maps and their corresponding energy functions for three different channels. Each color matrix represents the feature map for a specific channel, with values indicating the pixel-wise feature intensities. The mean and variance of each channel are indicated in the title of each subplot. The color bars on the right show the corresponding intensity values for each channel. Below each feature map, the energy function for that channel is plotted, where the red dashed line indicates the channel’s mean value (<math display="inline"><semantics> <msub> <mi>w</mi> <mi>c</mi> </msub> </semantics></math>) for each respective channel. The energy function quantifies the deviation of pixel values from the channel mean, with the energy function values decreasing as the pixel values approach the channel mean, and increasing as the deviation from the mean grows. The energy functions are plotted for Channel 1 (<math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mi>c</mi> </msub> <mo>=</mo> <mn>0.56</mn> </mrow> </semantics></math>), Channel 2 (<math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mi>c</mi> </msub> <mo>=</mo> <mn>0.44</mn> </mrow> </semantics></math>), and Channel 3 (<math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mi>c</mi> </msub> <mo>=</mo> <mn>0.44</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 4
<p>Dynamic channel weight generation and optimization framework. This figure illustrates the process of dynamically generating and optimizing channel weights using both global context and energy function constraints. The channel weight <math display="inline"><semantics> <msub> <mi>w</mi> <mi>c</mi> </msub> </semantics></math> is processed through several steps, including multiplication with weight matrices, the addition of regularization terms, and the application of activation functions (ReLU and Sigmoid). This framework helps to adaptively adjust channel weights based on local features and global context, improving robustness and performance for tasks such as medical image segmentation.</p>
Full article ">Figure 5
<p>Dynamic residual connection with global context integration.</p>
Full article ">
18 pages, 1942 KiB  
Article
Resume2Vec: Transforming Applicant Tracking Systems with Intelligent Resume Embeddings for Precise Candidate Matching
by Ravi Varma Kumar Bevara, Nishith Reddy Mannuru, Sai Pranathi Karedla, Brady Lund, Ting Xiao, Harshitha Pasem, Sri Chandra Dronavalli and Siddhanth Rupeshkumar
Electronics 2025, 14(4), 794; https://doi.org/10.3390/electronics14040794 - 18 Feb 2025
Abstract
Conventional Applicant Tracking Systems (ATSs) encounter considerable constraints in accurately aligning resumes with job descriptions (JD), especially in handling unstructured data and intricate qualifications. We provide Resume2Vec, an innovative method that utilizes transformer-based deep learning models, including encoders (BERT, RoBERTa, and DistilBERT) and [...] Read more.
Conventional Applicant Tracking Systems (ATSs) encounter considerable constraints in accurately aligning resumes with job descriptions (JD), especially in handling unstructured data and intricate qualifications. We provide Resume2Vec, an innovative method that utilizes transformer-based deep learning models, including encoders (BERT, RoBERTa, and DistilBERT) and decoders (GPT, Gemini, and Llama), to create embeddings for resumes and job descriptions, employing cosine similarity for evaluation. Our methodology integrates quantitative analysis via embedding-based evaluation with qualitative human assessment across several professional fields. Experimental findings indicate that Resume2Vec outperformed conventional ATS systems, achieving enhancements of up to 15.85% in Normalized Discounted Cumulative Gain (nDCG) and 15.94% in Ranked Biased Overlap (RBO) scores, especially within the mechanical engineering and health and fitness domains. Although conventional the ATS exhibited slightly superior nDCG scores in operations management and software testing, Resume2Vec consistently displayed a more robust alignment with human preferences across the majority of domains, as indicated by the RBO metrics. This research demonstrates that Resume2Vec is a powerful and scalable method for matching resumes to job descriptions, effectively overcoming the shortcomings of traditional systems, while preserving a high alignment with human evaluation criteria. The results indicate considerable promise for transformer-based methodologies in enhancing recruiting technology, facilitating more efficient and precise candidate selection procedures. Full article
(This article belongs to the Special Issue Big Data and AI Applications)
Show Figures

Figure 1

Figure 1
<p>Architecture of the proposed system for resume–JD mapping.</p>
Full article ">Figure 2
<p>Scatter plot of resume embeddings across domains.</p>
Full article ">Figure 3
<p>Scatter plot of job description embeddings across domains.</p>
Full article ">Figure 4
<p>Model accuracy comparison without PCA.</p>
Full article ">Figure 5
<p>Model accuracy comparison with PCA.</p>
Full article ">Figure 6
<p>Comparison of Resume2Vec and ATS performance across various metrics (nDCG and RBO) for different job categories.</p>
Full article ">
21 pages, 14761 KiB  
Article
GeoIoU-SEA-YOLO: An Advanced Model for Detecting Unsafe Behaviors on Construction Sites
by Xuejun Jia, Xiaoxiong Zhou, Zhihan Shi, Qi Xu and Guangming Zhang
Sensors 2025, 25(4), 1238; https://doi.org/10.3390/s25041238 - 18 Feb 2025
Abstract
Unsafe behaviors on construction sites are a major cause of accidents, highlighting the need for effective detection and prevention. Traditional methods like manual inspections and video surveillance often lack real-time performance and comprehensive coverage, making them insufficient for diverse and complex site environments. [...] Read more.
Unsafe behaviors on construction sites are a major cause of accidents, highlighting the need for effective detection and prevention. Traditional methods like manual inspections and video surveillance often lack real-time performance and comprehensive coverage, making them insufficient for diverse and complex site environments. This paper introduces GeoIoU-SEA-YOLO, an enhanced object detection model integrating the Geometric Intersection over Union (GeoIoU) loss function and Structural-Enhanced Attention (SEA) mechanism to improve accuracy and real-time detection. GeoIoU enhances bounding box regression by considering geometric characteristics, excelling in the detection of small objects, occlusions, and multi-object interactions. SEA combines channel and multi-scale spatial attention, dynamically refining feature map weights to focus on critical features. Experiments show that GeoIoU-SEA-YOLO outperforms YOLOv3, YOLOv5s, YOLOv8s, and SSD, achieving high precision ([email protected] = 0.930), recall, and small object detection in complex scenes, particularly for unsafe behaviors like missing safety helmets, vests, or smoking. Ablation studies confirm the independent and combined contributions of GeoIoU and SEA to performance gains, providing a reliable solution for intelligent safety management on construction sites. Full article
Show Figures

Figure 1

Figure 1
<p>YOLOv5 network structure diagram.</p>
Full article ">Figure 2
<p>The architecture of the SEA-YOLO network.</p>
Full article ">Figure 3
<p>Schematic diagram of the GeoIoU structure.</p>
Full article ">Figure 4
<p>Workflow of the Structural-Enhanced Attention (SEA) mechanism.</p>
Full article ">Figure 5
<p>Example of datasets.</p>
Full article ">Figure 6
<p>Comparison of Grad-CAM visualizations across different mainstream algorithms. (<b>a</b>–<b>c</b>) represent different picture examples.</p>
Full article ">Figure 7
<p>Comparison of detection results in ablation experiments.</p>
Full article ">Figure 7 Cont.
<p>Comparison of detection results in ablation experiments.</p>
Full article ">Figure 7 Cont.
<p>Comparison of detection results in ablation experiments.</p>
Full article ">Figure 8
<p>Comparison of loss function graph with baseline method.</p>
Full article ">
22 pages, 9277 KiB  
Article
LRNTRM-YOLO: Research on Real-Time Recognition of Non-Tobacco-Related Materials
by Chunjie Zhang, Lijun Yun, Chenggui Yang, Zaiqing Chen and Feiyan Cheng
Agronomy 2025, 15(2), 489; https://doi.org/10.3390/agronomy15020489 - 18 Feb 2025
Abstract
The presence of non-tobacco-related materials can significantly compromise the quality of tobacco. To accurately detect non-tobacco-related materials, this study introduces a lightweight and real-time detection model derived from the YOLOv11 framework, named LRNTRM-YOLO. Initially, due to the sub-optimal accuracy in detecting diminutive non-tobacco-related [...] Read more.
The presence of non-tobacco-related materials can significantly compromise the quality of tobacco. To accurately detect non-tobacco-related materials, this study introduces a lightweight and real-time detection model derived from the YOLOv11 framework, named LRNTRM-YOLO. Initially, due to the sub-optimal accuracy in detecting diminutive non-tobacco-related materials, the model was augmented by incorporating an additional layer dedicated to enhancing the detection of small targets, thereby improving the overall accuracy. Furthermore, an attention mechanism was incorporated into the backbone network to focus on the features of the detection targets, thereby improving the detection efficacy of the model. Simultaneously, for the introduction of the SIoU loss function, the angular vector between the bounding box regressions was utilized to define the loss function, thus improving the training efficiency of the model. Following these enhancements, a channel pruning technique was employed to streamline the network, which not only reduced the parameter count but also expedited the inference process, yielding a more compact model for non-tobacco-related material detection. The experimental results on the NTRM dataset indicate that the LRNTRM-YOLO model achieved a mean average precision (mAP) of 92.9%, surpassing the baseline model by a margin of 4.8%. Additionally, there was a 68.3% reduction in the parameters and a 15.9% decrease in floating-point operations compared to the baseline model. Comparative analysis with prominent models confirmed the superiority of the proposed model in terms of its lightweight architecture, high accuracy, and real-time capabilities, thereby offering an innovative and practical solution for detecting non-tobacco-related materials in the future. Full article
(This article belongs to the Special Issue Robotics and Automation in Farming)
Show Figures

Figure 1

Figure 1
<p>Data collection environment.</p>
Full article ">Figure 2
<p>Image acquisition system.</p>
Full article ">Figure 3
<p>Overall technical route.</p>
Full article ">Figure 4
<p>Examples of small non-tobacco-related materials: (<b>a</b>) Sample image; (<b>b</b>) enlarged display of the feather in (<b>a</b>).</p>
Full article ">Figure 5
<p>Details of adding a small target detection layer. The area delineated by the red box represents the detailed process of enhancement.</p>
Full article ">Figure 6
<p>Schematic diagram of the principle of CPCA.</p>
Full article ">Figure 7
<p>Schematic diagram of SIoU. <math display="inline"><semantics> <mrow> <msup> <mi mathvariant="normal">b</mi> <mrow> <mi>gt</mi> </mrow> </msup> </mrow> </semantics></math> is the ground truth box, and b is the predicted box.</p>
Full article ">Figure 8
<p>Loss function curve of the model in the training set.</p>
Full article ">Figure 9
<p>Comparison before and after pruning.</p>
Full article ">Figure 10
<p>Comparison of the different pruning strategies.</p>
Full article ">Figure 11
<p>Visualization of the detection results: (<b>a</b>–<b>c</b>) Detection results of YOLOv11n; (<b>d</b>–<b>f</b>) detection results of LRNTRM-YOLO. The yellow shape in the figure indicates the presence of missed or error detections.</p>
Full article ">Figure 12
<p>Raspberry Pi 5.</p>
Full article ">Figure 13
<p>Visualization of the detection results. The non-tobacco-related materials detected in each image were (<b>a</b>) a label paper, (<b>b</b>) a feather, (<b>c</b>) a hemp rope, (<b>d</b>) a weed, (<b>e</b>) a rubber ring and a label paper, and (<b>f</b>) plastic and a hemp rope. Different types of non-tobacco-related materials in the image are labeled with different colors.</p>
Full article ">
18 pages, 2505 KiB  
Article
MRI in Oral Tongue Squamous Cell Carcinoma: A Radiomic Approach in the Local Recurrence Evaluation
by Antonello Vidiri, Vincenzo Dolcetti, Francesco Mazzola, Sonia Lucchese, Francesca Laganaro, Francesca Piludu, Raul Pellini, Renato Covello and Simona Marzi
Curr. Oncol. 2025, 32(2), 116; https://doi.org/10.3390/curroncol32020116 - 18 Feb 2025
Abstract
(1) Background: Oral tongue squamous cell carcinoma (OTSCC) is a prevalent malignancy with high loco-regional recurrence. Advanced imaging biomarkers are critical for stratifying patients at a high risk of recurrence. This study aimed to develop MRI-based radiomic models to predict loco-regional recurrence in [...] Read more.
(1) Background: Oral tongue squamous cell carcinoma (OTSCC) is a prevalent malignancy with high loco-regional recurrence. Advanced imaging biomarkers are critical for stratifying patients at a high risk of recurrence. This study aimed to develop MRI-based radiomic models to predict loco-regional recurrence in OTSCC patients undergoing surgery. (2) Methods: We retrospectively selected 92 patients with OTSCC who underwent MRI, followed by surgery and cervical lymphadenectomy. A total of 31 patients suffered from a loco-regional recurrence. Radiomic features were extracted from preoperative post-contrast high-resolution MRI and integrated with clinical and pathological data to develop predictive models, including radiomic-only and combined radiomic–clinical approaches, trained and validated with stratified data splitting. (3) Results: Textural features, such as those derived from the Gray-Level Size-Zone Matrix, Gray-Level Dependence Matrix, and Gray-Level Run-Length Matrix, showed significant associations with recurrence. The radiomic-only model achieved an accuracy of 0.79 (95% confidence interval: 0.69, 0.87) and 0.74 (95% CI: 0.54, 0.89) in the training and validation set, respectively. Combined radiomic and clinical models, incorporating features like the pathological depth of invasion and lymph node status, provided comparable diagnostic performances. (4) Conclusions: MRI-based radiomic models demonstrated the potential for predicting loco-regional recurrence, highlighting their increasingly important role in advancing precision oncology for OTSCC. Full article
(This article belongs to the Section Head and Neck Oncology)
Show Figures

Figure 1

Figure 1
<p>The flowchart illustrating the entire pipeline of the analyses to obtain the final models.</p>
Full article ">Figure 2
<p>Boxplots of the most relevant radiomic features for predicting the recurrence and the corresponding <span class="html-italic">p</span>-value obtained from the Mann–Whitney U test: Long Run Emphasis (<b>a</b>), Large Dependence High Gray Level Emphasis (<b>b</b>), Large Area High Gray Level Emphasis (<b>c</b>).</p>
Full article ">Figure 3
<p>Comparison between the performances of the different models for predicting the loco-regional recurrence in training and validation sets.</p>
Full article ">Figure 4
<p>The figure shows dynamic high-spatial-resolution T1-weighted images after contrast medium administration in the axial and coronal planes of two patients with the same radiological staging (cT2N0) but different clinical outcomes, for whom the radiomic-only model and all combined models provided the correct predictions. In the top row (<b>a</b>–<b>d</b>), the images represent a 58-year-old male patient who did not experience a recurrence, with the corresponding delineated lesion outlined in green on the same planes (<b>b</b>,<b>d</b>). In the bottom row (<b>e</b>–<b>h</b>), the images represent a 71-year-old male patient with a recurrence. Similarly, the axial and coronal images (<b>e</b>,<b>g</b>) show the lesion after contrast medium administration, with the delineated lesion outlined in green (<b>f</b>,<b>h</b>).</p>
Full article ">Figure 5
<p>Kaplan–Meier survival curves for loco-regional recurrence-free survival (LRRFS) for the entire dataset (<b>a</b>), and by categorizing the patients based on pN status (<b>b</b>) and type of surgery (<b>c</b>). The <span class="html-italic">p</span>-values refer to the log-rank test for the pairwise comparison between groups.</p>
Full article ">
18 pages, 4467 KiB  
Article
Identification of the B7-H3 Interaction Partners Using a Proximity Labeling Strategy
by Shujie Liao, Jiamin Huang, Cecylia S. Lupala, Xiangcheng Li, Xuefei Li and Nan Li
Int. J. Mol. Sci. 2025, 26(4), 1731; https://doi.org/10.3390/ijms26041731 - 18 Feb 2025
Abstract
B7 homolog 3 (B7-H3) has emerged as a promising target for cancer therapy due to its high expression in various types of cancer cells. It not only regulates the activity of immune cells but also modulates the signal transduction and metabolism of cancer [...] Read more.
B7 homolog 3 (B7-H3) has emerged as a promising target for cancer therapy due to its high expression in various types of cancer cells. It not only regulates the activity of immune cells but also modulates the signal transduction and metabolism of cancer cells. However, the specific interaction partners of B7-H3 still remain unclear, limiting a comprehensive understanding of the precise role of B7-H3 in cancer progression. In this study, we report that B7-H3 can bind to resting Raji cells, stimulated THP-1 cells, and even PC3 prostate cancer cells through its IgV domain alone. Furthermore, to identify the potential interaction partners of B7-H3 on these cells, we adopted an ascorbate peroxidase 2 (APEX2)-based proximity labeling strategy, which revealed about 10 key potential interaction partners. Interestingly, our results suggest that CD45 could be a putative receptor for B7-H3 on Raji cells, while the epidermal growth factor receptor (EGFR) could closely interact with B7-H3 on PC3 cells. Based on further computational structure modeling studies, we show that B7-H3 can bind to the epidermal growth factor (EGF) binding pocket of EGFR—surprisingly, with a stronger affinity than EGF itself. Overall, our study provides an effective approach to identifying B7-H3 interaction partners in both immune and cancer cell lines. Full article
(This article belongs to the Section Biochemistry)
Show Figures

Figure 1

Figure 1
<p>Interaction partners of B7-H3 are widely present across multiple cell types. (<b>A</b>) Schematic representation of full-length B7-H3 and its three isoforms. IgV: immunoglobulin-V-like domain; IgC: immunoglobulin-C-like domain; TM: transmembrane domain; CD: cytoplasmic domain. 4Ig-B7-H3: 29Leu~466Ala; 2Ig-B7-H3: 29Leu~238Thr; Ig-B7-H3: 29Leu~139Ala. (<b>B</b>) Workflow for evaluating the binding capacity of B7-H3 using flow cytometry. (<b>C</b>,<b>D</b>) B7-H3 staining of immune and cancer cell lines. Cells were incubated with 15 μg/mL B7-H3 isoforms, with HA peptides at the same concentration were used as a negative control. (<b>C</b>) Immune cell lines. (<b>D</b>) Cancer cell lines.</p>
Full article ">Figure 2
<p>APEX2-based proximity labeling for identification of B7-H3 Interaction partner(s). (<b>A</b>) Illustration of APEX2-based proximity labeling to identify B7-H3 interaction partners. (<b>B</b>) Expression constructs of B7-H3–APEX2 and APEX2. APEX2, lacking the B7-H3 sequence, served as a negative control. (<b>C</b>) SDS-PAGE analysis of purified B7-H3–APEX2 (43.7 kD) and APEX2 (31.8 kD). (<b>D</b>) B7-H3–APEX2 and APEX2 staining of Raji and PC3 cell lines. Raji cells were stained with 0.25 µM of each protein, while PC3 cells were stained with 0.5 µM of each protein. (<b>E</b>) In vitro labeling activity of B7-H3–APEX2 and APEX2. SA-HRP denotes streptavidin blotting; Glyceraldehyde-3-phosphate dehydrogenase (GAPDH) is shown as a loading control.</p>
Full article ">Figure 3
<p>Identification of B7-H3 interaction partners in Raji cells. (<b>A</b>) Workflow of proteomics data analysis. The B7-H3 group refers to cells incubated with B7-H3–APEX2, while the APEX2 group refers to cells incubated with APEX2 lacking the B7-H3 sequence. (<b>B</b>) Streptavidin enrichment of biotinylated proteins. SA-HRP denotes streptavidin blotting; GAPDH is shown as a loading control. (<b>C</b>) Numbers of cell membrane proteins identified in Raji. * means 0.01 &lt; <span class="html-italic">p</span>-value &lt; 0.05, *** means 0.001 &lt; <span class="html-italic">p</span>-value &lt; 0.005. (<b>D</b>) Principal component analysis (PCA) of B7-H3 and APEX2 groups for both replicates. (<b>E</b>) Plots of enriched transmembrane proteins (B7-H3/APEX2 fold change ≥ 2 and <span class="html-italic">p</span>-value ≤ 0.05) identified in replicate 1 from Raji cells. Red dots represent enriched transmembrane proteins, while gray dots denote unenriched or non-membrane-associated proteins. (<b>F</b>) Intersection of enriched transmembrane proteins identified in both replicates.</p>
Full article ">Figure 4
<p>Identification of B7-H3 interaction partners in prostate cancer cells. (<b>A</b>) Streptavidin enrichment of biotinylated proteins. SA-HRP denotes streptavidin blotting; GAPDH is shown as a loading control. (<b>B</b>) Numbers of cell membrane proteins identified in PC3. ** means 0.005 &lt; <span class="html-italic">p</span>-value &lt; 0.01. (<b>C</b>) PCA of B7-H3 and APEX2 groups across both replicates. (<b>D</b>) Plots of enriched transmembrane proteins (B7-H3/APEX2 fold change ≥ 2 and <span class="html-italic">p</span>-value ≤ 0.05) identified in replicate 1 from PC3 cells. Red dots represent enriched transmembrane proteins, while gray dots denote unenriched or non-membrane-associated proteins. (<b>E</b>) Intersection of enriched transmembrane proteins identified in both replicates. (<b>F</b>) Cell membrane interactome map for B7-H3 in PC3 cells. Interactions were predicted using the STRING database, with edge confidence calculated by STRING. (<b>G</b>) Putative B7-H3 interaction partners in PC3 cells. Proteins were categorized according to UniProt function annotations.</p>
Full article ">Figure 5
<p>B7-H3 is predicted to bind to the EGF pocket of EGFR. All protein–protein interaction structural models were generated using Alphafold3 and visualized using PyMOL. (<b>A</b>) Structure model of the interaction between full-length B7-H3 and EGFR. (<b>B</b>) Structural model of the interaction between the extracellular domain (ECD) of B7-H3 and the ECD of EGFR. The interaction energy is −165.749 kcal/mol. (<b>C</b>) Structural model of the interaction between EGF and EGFR ECD. The interaction energy is −146.411 kcal/mol. This modeled interaction structure was compared with the experimentally determined structure (PDB ID: 8HGS), showing similar interaction structure and energy (<a href="#app1-ijms-26-01731" class="html-app">Figure S3C</a>). (<b>D</b>–<b>G</b>) Correlation analysis of the expression level of <span class="html-italic">B7-H3</span> and EGFR signaling molecules in prostate adenocarcinoma (PRAD). RNA transcription data was downloaded from the Cancer Genome Atlas (TCGA).</p>
Full article ">
Back to TopTop