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

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

Search Results (3,404)

Search Parameters:
Keywords = generalization bound

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
13 pages, 279 KiB  
Article
Generalized Hyers–Ulam Stability of Bi-Homomorphisms, Bi-Derivations, and Bi-Isomorphisms in C*-Ternary Algebras
by Jae-Hyeong Bae and Won-Gil Park
Mathematics 2025, 13(14), 2289; https://doi.org/10.3390/math13142289 (registering DOI) - 16 Jul 2025
Abstract
In this paper, we investigate the generalized Hyers–Ulam stability of bi-homomorphisms, bi-derivations, and bi-isomorphisms in C*-ternary algebras. The study of functional equations with a sufficient number of variables can be helpful in solving real-world problems such as artificial intelligence. In this [...] Read more.
In this paper, we investigate the generalized Hyers–Ulam stability of bi-homomorphisms, bi-derivations, and bi-isomorphisms in C*-ternary algebras. The study of functional equations with a sufficient number of variables can be helpful in solving real-world problems such as artificial intelligence. In this paper, we build on previous research on functional equations with four variables to study functional equations with as many variables as desired. We introduce new bounds for the stability of mappings satisfying generalized bi-additive conditions and demonstrate the uniqueness of approximating bi-isomorphisms. The results contribute to the deeper understanding of ternary algebraic structures and related functional equations, relevant to both pure mathematics and quantum information science. Full article
18 pages, 1438 KiB  
Article
Maximum Entropy Estimates of Hubble Constant from Planck Measurements
by David P. Knobles and Mark F. Westling
Entropy 2025, 27(7), 760; https://doi.org/10.3390/e27070760 - 16 Jul 2025
Abstract
A maximum entropy (ME) methodology was used to infer the Hubble constant from the temperature anisotropies in cosmic microwave background (CMB) measurements, as measured by the Planck satellite. A simple cosmological model provided physical insight and afforded robust statistical sampling of a parameter [...] Read more.
A maximum entropy (ME) methodology was used to infer the Hubble constant from the temperature anisotropies in cosmic microwave background (CMB) measurements, as measured by the Planck satellite. A simple cosmological model provided physical insight and afforded robust statistical sampling of a parameter space. The parameter space included the spectral tilt and amplitude of adiabatic density fluctuations of the early universe and the present-day ratios of dark energy, matter, and baryonic matter density. A statistical temperature was estimated by applying the equipartition theorem, which uniquely specifies a posterior probability distribution. The ME analysis inferred the mean value of the Hubble constant to be about 67 km/sec/Mpc with a conservative standard deviation of approximately 4.4 km/sec/Mpc. Unlike standard Bayesian analyses that incorporate specific noise models, the ME approach treats the model error generically, thereby producing broader, but less assumption-dependent, uncertainty bounds. The inferred ME value lies within 1σ of both early-universe estimates (Planck, Dark Energy Signal Instrument (DESI)) and late-universe measurements (e.g., the Chicago Carnegie Hubble Program (CCHP)) using redshift data collected from the James Webb Space Telescope (JWST). Thus, the ME analysis does not appear to support the existence of the Hubble tension. Full article
(This article belongs to the Special Issue Insight into Entropy)
Show Figures

Figure 1

33 pages, 1024 KiB  
Article
Graph-Theoretic Limits of Distributed Computation: Entropy, Eigenvalues, and Chromatic Numbers
by Mohammad Reza Deylam Salehi and Derya Malak
Entropy 2025, 27(7), 757; https://doi.org/10.3390/e27070757 - 15 Jul 2025
Viewed by 55
Abstract
We address the problem of the distributed computation of arbitrary functions of two correlated sources, X1 and X2, residing in two distributed source nodes, respectively. We exploit the structure of a computation task by coding source characteristic graphs (and multiple [...] Read more.
We address the problem of the distributed computation of arbitrary functions of two correlated sources, X1 and X2, residing in two distributed source nodes, respectively. We exploit the structure of a computation task by coding source characteristic graphs (and multiple instances using the n-fold OR product of this graph with itself). For regular graphs and general graphs, we establish bounds on the optimal rate—characterized by the chromatic entropy for the n-fold graph products—that allows a receiver for asymptotically lossless computation of arbitrary functions over finite fields. For the special class of cycle graphs (i.e., 2-regular graphs), we establish an exact characterization of chromatic numbers and derive bounds on the required rates. Next, focusing on the more general class of d-regular graphs, we establish connections between d-regular graphs and expansion rates for n-fold graph products using graph spectra. Finally, for general graphs, we leverage the Gershgorin Circle Theorem (GCT) to provide a characterization of the spectra, which allows us to derive new bounds on the optimal rate. Our codes leverage the spectra of the computation and provide a graph expansion-based characterization to succinctly capture the computation structure, providing new insights into the problem of distributed computation of arbitrary functions. Full article
(This article belongs to the Special Issue Information Theory and Data Compression)
Show Figures

Figure 1

23 pages, 10801 KiB  
Article
Secure Communication of Electric Drive System Using Chaotic Systems Base on Disturbance Observer and Fuzzy Brain Emotional Learning Neural Network
by Huyen Chau Phan Thi, Nhat Quang Dang and Van Nam Giap
Math. Comput. Appl. 2025, 30(4), 73; https://doi.org/10.3390/mca30040073 - 14 Jul 2025
Viewed by 72
Abstract
This paper presents a novel wireless control framework for electric drive systems by employing a fuzzy brain emotional learning neural network (FBELNN) controller in conjunction with a Disturbance Observer (DO). The communication scheme uses chaotic system dynamics to ensure data confidentiality and robustness [...] Read more.
This paper presents a novel wireless control framework for electric drive systems by employing a fuzzy brain emotional learning neural network (FBELNN) controller in conjunction with a Disturbance Observer (DO). The communication scheme uses chaotic system dynamics to ensure data confidentiality and robustness against disturbance in wireless environments. To be applied to embedded microprocessors, the continuous-time chaotic system is discretized using the Grunwald–Letnikov approximation. To avoid the loss of generality of chaotic behavior, Lyapunov exponents are computed to validate the preservation of chaos in the discrete-time domain. The FBELNN controller is then developed to synchronize two non-identical chaotic systems under different initial conditions, enabling secure data encryption and decryption. Additionally, the DOB is introduced to estimate and mitigate the effects of bounded uncertainties and external disturbances, enhancing the system’s resilience to stealthy attacks. The proposed control structure is experimentally implemented on a wireless communication system utilizing ESP32 microcontrollers (Espressif Systems, Shanghai, China) based on the ESP-NOW protocol. Both control and feedback signals of the electric drive system are encrypted using chaotic states, and real-time decryption at the receiver confirms system integrity. Experimental results verify the effectiveness of the proposed method in achieving robust synchronization, accurate signal recovery, and a reliable wireless control system. The combination of FBELNN and DOB demonstrates significant potential for real-time, low-cost, and secure applications in smart electric drive systems and industrial automation. Full article
(This article belongs to the Special Issue Applied Optimization in Automatic Control and Systems Engineering)
Show Figures

Figure 1

34 pages, 1456 KiB  
Project Report
On Control Synthesis of Hydraulic Servomechanisms in Flight Controls Applications
by Ioan Ursu, Daniela Enciu and Adrian Toader
Actuators 2025, 14(7), 346; https://doi.org/10.3390/act14070346 - 14 Jul 2025
Viewed by 53
Abstract
This paper presents some of the most significant findings in the design of a hydraulic servomechanism for flight controls, which were primarily achieved by the first author during his activity in an aviation institute. These results are grouped into four main topics. The [...] Read more.
This paper presents some of the most significant findings in the design of a hydraulic servomechanism for flight controls, which were primarily achieved by the first author during his activity in an aviation institute. These results are grouped into four main topics. The first one outlines a classical theory, from the 1950s–1970s, of the analysis of nonlinear automatic systems and namely the issue of absolute stability. The uninformed public may be misled by the adjective “absolute”. This is not a “maximalist” solution of stability but rather highlights in the system of equations a nonlinear function that describes, for the case of hydraulic servomechanisms, the flow-control dependence in the distributor spool. This function is odd, and it is therefore located in quadrants 1 and 3. The decision regarding stability is made within the so-called Lurie problem and is materialized by a matrix inequality, called the Lefschetz condition, which must be satisfied by the parameters of the electrohydraulic servomechanism and also by the components of the control feedback vector. Another approach starts from a classical theorem of V. M. Popov, extended in a stochastic framework by T. Morozan and I. Ursu, which ends with the description of the local and global spool valve flow-control characteristics that ensure stability in the large with respect to bounded perturbations for the mechano-hydraulic servomechanism. We add that a conjecture regarding the more pronounced flexibility of mathematical models in relation to mathematical instruments (theories) was used. Furthermore, the second topic concerns, the importance of the impedance characteristic of the mechano-hydraulic servomechanism in preventing flutter of the flight controls is emphasized. Impedance, also called dynamic stiffness, is defined as the ratio, in a dynamic regime, between the output exerted force (at the actuator rod of the servomechanism) and the displacement induced by this force under the assumption of a blocked input. It is demonstrated in the paper that there are two forms of the impedance function: one that favors the appearance of flutter and another that allows for flutter damping. It is interesting to note that these theoretical considerations were established in the institute’s reports some time before their introduction in the Aviation Regulation AvP.970. However, it was precisely the absence of the impedance criterion in the regulation at the appropriate time that ultimately led, by chance or not, to a disaster: the crash of a prototype due to tailplane flutter. A third topic shows how an important problem in the theory of automatic systems of the 1970s–1980s, namely the robust synthesis of the servomechanism, is formulated, applied and solved in the case of an electrohydraulic servomechanism. In general, the solution of a robust servomechanism problem consists of two distinct components: a servo-compensator, in fact an internal model of the exogenous dynamics, and a stabilizing compensator. These components are adapted in the case of an electrohydraulic servomechanism. In addition to the classical case mentioned above, a synthesis problem of an anti-windup (anti-saturation) compensator is formulated and solved. The fourth topic, and the last one presented in detail, is the synthesis of a fuzzy supervised neurocontrol (FSNC) for the position tracking of an electrohydraulic servomechanism, with experimental validation, in the laboratory, of this control law. The neurocontrol module is designed using a single-layered perceptron architecture. Neurocontrol is in principle optimal, but it is not free from saturation. To this end, in order to counteract saturation, a Mamdani-type fuzzy logic was developed, which takes control when neurocontrol has saturated. It returns to neurocontrol when it returns to normal, respectively, when saturation is eliminated. What distinguishes this FSNC law is its simplicity and efficiency and especially the fact that against quite a few opponents in the field, it still works very well on quite complicated physical systems. Finally, a brief section reviews some recent works by the authors, in which current approaches to hydraulic servomechanisms are presented: the backstepping control synthesis technique, input delay treated with Lyapunov–Krasovskii functionals, and critical stability treated with Lyapunov–Malkin theory. Full article
(This article belongs to the Special Issue Advanced Technologies in Actuators for Control Systems)
25 pages, 9517 KiB  
Article
YOLOv8n-SSDW: A Lightweight and Accurate Model for Barnyard Grass Detection in Fields
by Yan Sun, Hanrui Guo, Xiaoan Chen, Mengqi Li, Bing Fang and Yingli Cao
Agriculture 2025, 15(14), 1510; https://doi.org/10.3390/agriculture15141510 - 13 Jul 2025
Viewed by 140
Abstract
Barnyard grass is a major noxious weed in paddy fields. Accurate and efficient identification of barnyard grass is crucial for precision field management. However, existing deep learning models generally suffer from high parameter counts and computational complexity, limiting their practical application in field [...] Read more.
Barnyard grass is a major noxious weed in paddy fields. Accurate and efficient identification of barnyard grass is crucial for precision field management. However, existing deep learning models generally suffer from high parameter counts and computational complexity, limiting their practical application in field scenarios. Moreover, the morphological similarity, overlapping, and occlusion between barnyard grass and rice pose challenges for reliable detection in complex environments. To address these issues, this study constructed a barnyard grass detection dataset using high-resolution images captured by a drone equipped with a high-definition camera in rice experimental fields in Haicheng City, Liaoning Province. A lightweight field barnyard grass detection model, YOLOv8n-SSDW, was proposed to enhance detection precision and speed. Based on the baseline YOLOv8n model, a novel Separable Residual Coord Conv (SRCConv) was designed to replace the original convolution module, significantly reducing parameters while maintaining detection accuracy. The Spatio-Channel Enhanced Attention Module (SEAM) was introduced and optimized to improve sensitivity to barnyard grass edge features. Additionally, the lightweight and efficient Dysample upsampling module was incorporated to enhance feature map resolution. A new WIoU loss function was developed to improve bounding box classification and regression accuracy. Comprehensive performance analysis demonstrated that YOLOv8n-SSDW outperformed state-of-the-art models. Ablation studies confirmed the effectiveness of each improvement module. The final fused model achieved lightweight performance while improving detection accuracy, with a 2.2% increase in mAP_50, 3.8% higher precision, 0.6% higher recall, 10.6% fewer parameters, 9.8% lower FLOPs, and an 11.1% reduction in model size compared to the baseline. Field tests using drones combined with ground-based computers further validated the model’s robustness in real-world complex paddy environments. The results indicate that YOLOv8n-SSDW exhibits excellent accuracy and efficiency. This study provides valuable insights for barnyard grass detection in rice fields. Full article
Show Figures

Figure 1

19 pages, 1780 KiB  
Article
A Case Study on Monolith to Microservices Decomposition with Variational Autoencoder-Based Graph Neural Network
by Rokin Maharjan, Korn Sooksatra, Tomas Cerny, Yudeep Rajbhandari and Sakshi Shrestha
Future Internet 2025, 17(7), 303; https://doi.org/10.3390/fi17070303 - 13 Jul 2025
Viewed by 124
Abstract
Microservice is a popular architecture for developing cloud-native applications. However, decomposing a monolithic application into microservices remains a challenging task. This complexity arises from the need to account for factors such as component dependencies, cohesive clusters, and bounded contexts. To address this challenge, [...] Read more.
Microservice is a popular architecture for developing cloud-native applications. However, decomposing a monolithic application into microservices remains a challenging task. This complexity arises from the need to account for factors such as component dependencies, cohesive clusters, and bounded contexts. To address this challenge, we present an automated approach to decomposing monolithic applications into microservices. Our approach uses static code analysis to generate a dependency graph of the monolithic application. Then, a variational autoencoder (VAE) is used to extract features from the components of a monolithic application. Finally, the C-means algorithm is used to cluster the components into possible microservices. We evaluate our approach using a third-party benchmark comprising both monolithic and microservice implementations. Additionally, we compare its performance against two existing decomposition techniques. The results demonstrate the potential of our method as a practical tool for guiding the transition from monolithic to microservice architectures. Full article
Show Figures

Figure 1

23 pages, 22555 KiB  
Article
Citrate Transporter Expression and Localization: The Slc13a5Flag Mouse Model
by Jan C.-C. Hu, Tian Liang, Hong Zhang, Yuanyuan Hu, Yasuo Yamakoshi, Ryuji Yamamoto, Chuhua Zhang, Hui Li, Charles E. Smith and James P. Simmer
Int. J. Mol. Sci. 2025, 26(14), 6707; https://doi.org/10.3390/ijms26146707 - 12 Jul 2025
Viewed by 206
Abstract
The sodium–citrate cotransporter (NaCT) plays a crucial role in citrate transport during amelogenesis. Mutations in the SLC13A5 gene, which encodes the NaCT, cause early infantile epileptic encephalopathy 25 and amelogenesis imperfecta. We analyzed developing pig molars and determined that the citrate concentrations in [...] Read more.
The sodium–citrate cotransporter (NaCT) plays a crucial role in citrate transport during amelogenesis. Mutations in the SLC13A5 gene, which encodes the NaCT, cause early infantile epileptic encephalopathy 25 and amelogenesis imperfecta. We analyzed developing pig molars and determined that the citrate concentrations in secretory- and maturation-stage enamel are both 5.3 µmol/g, with about 95% of the citrate being bound to mineral. To better understand how citrate might enter developing enamel, we developed Slc13a5Flag reporter mice that express NaCT with a C-terminal Flag-tag (DYKDDDDK) that can be specifically and accurately recognized by commercially available anti-Flag antibodies. The 24-base Flag coding sequence was located immediately upstream of the natural translation termination codon (TAG) and was validated by Sanger sequencing. The general development, physical activities, and reproductive outcomes of this mouse strain were comparable to those of the C57BL/6 mice. No differences were detected between the Slc13a5Flag and wild-type mice. Tooth development was extensively characterized using dissection microscopy, bSEM, light microscopy, in situ hybridization, and immunohistochemistry. Tooth formation was not altered in any detectable way by the introduction of the Flag. The Slc13a5Flag citrate transporter was observed on all outer membranes of secretory ameloblasts (distal, lateral, and proximal), with the strongest signal on the Tomes process, and was detectable in all but the distal membrane of maturation-stage ameloblasts. The papillary layer also showed positive immunostaining for Flag. The outer membrane of odontoblasts stained stronger than ameloblasts, except for the odontoblastic processes, which did not immunostain. As NaCT is thought to only facilitate citrate entry into the cell, we performed in situ hybridization that showed Ank is not expressed by secretory- or maturation-stage ameloblasts, ruling out that ANK can transport citrate into enamel. In conclusion, we developed Slc13a5Flag reporter mice that provide specific and sensitive localization of a fully functional NaCT-Flag protein. The localization of the Slc13a5Flag citrate transporter throughout the ameloblast membrane suggests that either citrate enters enamel by a paracellular route or NaCT can transport citrate bidirectionally (into or out of ameloblasts) depending upon local conditions. Full article
(This article belongs to the Special Issue Molecular Metabolism of Ameloblasts in Tooth Development)
Show Figures

Figure 1

35 pages, 2232 KiB  
Article
The Twisting and Untwisting of Actin and Tropomyosin Filaments Are Involved in the Molecular Mechanisms of Muscle Contraction, and Their Disruption Can Result in Muscle Disorders
by Yurii S. Borovikov, Maria V. Tishkova, Stanislava V. Avrova, Vladimir V. Sirenko and Olga E. Karpicheva
Int. J. Mol. Sci. 2025, 26(14), 6705; https://doi.org/10.3390/ijms26146705 - 12 Jul 2025
Viewed by 251
Abstract
Polarized fluorescence microscopy of “ghost” muscle fibers, containing fluorescently labeled F-actin, tropomyosin, and myosin, has provided new insights into the molecular mechanisms underlying muscle contraction. At low Ca2+, the troponin-induced overtwisting of the actin filament alters the configuration of myosin binding [...] Read more.
Polarized fluorescence microscopy of “ghost” muscle fibers, containing fluorescently labeled F-actin, tropomyosin, and myosin, has provided new insights into the molecular mechanisms underlying muscle contraction. At low Ca2+, the troponin-induced overtwisting of the actin filament alters the configuration of myosin binding sites, preventing actin–myosin interactions. As Ca2+ levels rise, the actin filament undergoes untwisting, while tropomyosin becomes overtwisted, facilitating the binding of myosin to actin. In the weakly bound state, myosin heads greatly increase both the internal twist and the bending stiffness of actin filaments, accompanied by the untwisting of tropomyosin. Following phosphate (Pi) release, myosin induces the untwisting of overtwisted actin filaments, driving thin-filament sliding relative to the thick filament during force generation. Point mutations in tropomyosin significantly alter the ability of actin and tropomyosin filaments to respond to Pi release, with coordinated changes in twist and bending stiffness. These structural effects correlate with changes in actomyosin ATPase activity. Together, these findings support a model in which dynamic filament twisting is involved in the molecular mechanisms of muscle contraction together with the active working stroke in the myosin motor, and suggest that impairment of this ability may cause contractile dysfunction. Full article
(This article belongs to the Special Issue Molecular Research on Skeletal Muscle Diseases)
Show Figures

Figure 1

24 pages, 2440 KiB  
Article
A Novel Dynamic Context Branch Attention Network for Detecting Small Objects in Remote Sensing Images
by Huazhong Jin, Yizhuo Song, Ting Bai, Kaimin Sun and Yepei Chen
Remote Sens. 2025, 17(14), 2415; https://doi.org/10.3390/rs17142415 - 12 Jul 2025
Viewed by 150
Abstract
Detecting small objects in remote sensing images is challenging due to their size, which results in limited distinctive features. This limitation necessitates the effective use of contextual information for accurate identification. Many existing methods often struggle because they do not dynamically adjust the [...] Read more.
Detecting small objects in remote sensing images is challenging due to their size, which results in limited distinctive features. This limitation necessitates the effective use of contextual information for accurate identification. Many existing methods often struggle because they do not dynamically adjust the contextual scope based on the specific characteristics of each target. To address this issue and improve the detection performance of small objects (typically defined as objects with a bounding box area of less than 1024 pixels), we propose a novel backbone network called the Dynamic Context Branch Attention Network (DCBANet). We present the Dynamic Context Scale-Aware (DCSA) Block, which utilizes a multi-branch architecture to generate features with diverse receptive fields. Within each branch, a Context Adaptive Selection Module (CASM) dynamically weights information, allowing the model to focus on the most relevant context. To further enhance performance, we introduce an Efficient Branch Attention (EBA) module that adaptively reweights the parallel branches, prioritizing the most discriminative ones. Finally, to ensure computational efficiency, we design a Dual-Gated Feedforward Network (DGFFN), a lightweight yet powerful replacement for standard FFNs. Extensive experiments conducted on four public remote sensing datasets demonstrate that the DCBANet achieves impressive mAP@0.5 scores of 80.79% on DOTA, 89.17% on NWPU VHR-10, 80.27% on SIMD, and a remarkable 42.4% mAP@0.5:0.95 on the specialized small object benchmark AI-TOD. These results surpass RetinaNet, YOLOF, FCOS, Faster R-CNN, Dynamic R-CNN, SKNet, and Cascade R-CNN, highlighting its effectiveness in detecting small objects in remote sensing images. However, there remains potential for further improvement in multi-scale and weak target detection. Future work will integrate local and global context to enhance multi-scale object detection performance. Full article
(This article belongs to the Special Issue High-Resolution Remote Sensing Image Processing and Applications)
Show Figures

Figure 1

89 pages, 742 KiB  
Article
An Improvement of Least Squares Theory: Theory of Least p-Variances Approximation and p-Uncorrelated Functions
by Mohammad Masjed-Jamei
Mathematics 2025, 13(14), 2255; https://doi.org/10.3390/math13142255 - 11 Jul 2025
Viewed by 169
Abstract
We establish a theory whose structure is based on a fixed variable and an algebraic inequality and which improves the well-known least squares theory. The mentioned fixed variable plays a basic role in creating such a theory. In this direction, some new concepts, [...] Read more.
We establish a theory whose structure is based on a fixed variable and an algebraic inequality and which improves the well-known least squares theory. The mentioned fixed variable plays a basic role in creating such a theory. In this direction, some new concepts, such as p-covariances with respect to a fixed variable, p-correlation coefficients with respect to a fixed variable, and p-uncorrelatedness with respect to a fixed variable, are defined in order to establish least p-variance approximations. We then obtain a specific system, called the p-covariances linear system, and apply the p-uncorrelatedness condition on its elements to find a general representation for p-uncorrelated variables. Afterwards, we apply the concept of p-uncorrelatedness for continuous functions, particularly for polynomial sequences, and we find some new sequences, such as a generic two-parameter hypergeometric polynomial of the F34 type that satisfies a p-uncorrelatedness property. In the sequel, we obtain an upper bound for 1-covariances, an improvement to the approximate solutions of over-determined systems and an improvement to the Bessel inequality and Parseval identity. Finally, we generalize the concept of least p-variance approximations based on several fixed orthogonal variables. Full article
Show Figures

Figure 1

26 pages, 6233 KiB  
Article
A Method for Recognizing Dead Sea Bass Based on Improved YOLOv8n
by Lizhen Zhang, Chong Xu, Sai Jiang, Mengxiang Zhu and Di Wu
Sensors 2025, 25(14), 4318; https://doi.org/10.3390/s25144318 - 10 Jul 2025
Viewed by 138
Abstract
Deaths occur during the culture of sea bass, and if timely harvesting is not carried out, it will lead to water pollution and the continued spread of sea bass deaths. Therefore, it is necessary to promptly detect dead fish and take countermeasures. Existing [...] Read more.
Deaths occur during the culture of sea bass, and if timely harvesting is not carried out, it will lead to water pollution and the continued spread of sea bass deaths. Therefore, it is necessary to promptly detect dead fish and take countermeasures. Existing object detection algorithms, when applied to the task of detecting dead sea bass, often suffer from excessive model complexity, high computational cost, and reduced accuracy in the presence of occlusion. To overcome these limitations, this study introduces YOLOv8n-Deadfish, a lightweight and high-precision detection model. First, the homemade sea bass death recognition dataset was expanded to enhance the generalization ability of the neural network. Second, the C2f-faster–EMA (efficient multi-scale attention) convolutional module was designed to replace the C2f module in the backbone network of YOLOv8n, reducing redundant calculations and memory access, thereby more effectively extracting spatial features. Then, a weighted bidirectional feature pyramid network (BiFPN) was introduced to achieve a more thorough integration of deep and shallow features. Finally, in order to compensate for the weak generalization and slow convergence of the CIoU loss function in detection tasks, the Inner-CIoU loss function was used to accelerate bounding box regression and further improve the detection performance of the model. The experimental results show that the YOLOv8n-Deadfish model has an accuracy, recall, and mean precision of 90.0%, 90.4%, and 93.6%, respectively, which is an improvement of 2.0, 1.4, and 1.3 percentage points, respectively, over the original base network YOLOv8n. The number of model parameters and GFLOPs were reduced by 23.3% and 18.5%, respectively, and the detection speed was improved from the original 304.5 FPS to 424.6 FPS. This method can provide a technical basis for the identification of dead sea bass in the process of intelligent aquaculture. Full article
(This article belongs to the Section Smart Agriculture)
Show Figures

Figure 1

26 pages, 3087 KiB  
Article
Pre-Warning for the Remaining Time to Alarm Based on Variation Rates and Mixture Entropies
by Zijiang Yang, Jiandong Wang, Honghai Li and Song Gao
Entropy 2025, 27(7), 736; https://doi.org/10.3390/e27070736 - 9 Jul 2025
Viewed by 169
Abstract
Alarm systems play crucial roles in industrial process safety. To support tackling the accident that is about to occur after an alarm, a pre-warning method is proposed for a special class of industrial process variables to alert operators about the remaining time to [...] Read more.
Alarm systems play crucial roles in industrial process safety. To support tackling the accident that is about to occur after an alarm, a pre-warning method is proposed for a special class of industrial process variables to alert operators about the remaining time to alarm. The main idea of the proposed method is to estimate the remaining time to alarm based on variation rates and mixture entropies of qualitative trends in univariate variables. If the remaining time to alarm is no longer than the pre-warning threshold and its mixture entropy is small enough then a warning is generated to alert the operators. One challenge for the proposed method is how to determine an optimal pre-warning threshold by considering the uncertainties induced by the sample distribution of the remaining time to alarm, subject to the constraint of the required false warning rate. This challenge is addressed by utilizing Bayesian estimation theory to estimate the confidence intervals for all candidates of the pre-warning threshold, and the optimal one is selected as the one whose upper bound of the confidence interval is nearest to the required false warning rate. Another challenge is how to measure the possibility of the current trend segment increasing to the alarm threshold, and this challenge is overcome by adopting the mixture entropy as a possibility measurement. Numerical and industrial examples illustrate the effectiveness of the proposed method and the advantages of the proposed method over the existing methods. Full article
(This article belongs to the Special Issue Failure Diagnosis of Complex Systems)
Show Figures

Figure 1

15 pages, 1770 KiB  
Article
PSHNet: Hybrid Supervision and Feature Enhancement for Accurate Infrared Small-Target Detection
by Weicong Chen, Chenghong Zhang and Yuan Liu
Appl. Sci. 2025, 15(14), 7629; https://doi.org/10.3390/app15147629 - 8 Jul 2025
Viewed by 127
Abstract
Detecting small targets in infrared imagery remains highly challenging due to sub-pixel target sizes, low signal-to-noise ratios, and complex background clutter. This paper proposes PSHNet, a hybrid deep-learning framework that combines dense spatial heatmap supervision with geometry-aware regression for accurate infrared small-target detection. [...] Read more.
Detecting small targets in infrared imagery remains highly challenging due to sub-pixel target sizes, low signal-to-noise ratios, and complex background clutter. This paper proposes PSHNet, a hybrid deep-learning framework that combines dense spatial heatmap supervision with geometry-aware regression for accurate infrared small-target detection. The network generates position–scale heatmaps to guide coarse localization, which are further refined through sub-pixel offset and size regression. A Complete IoU (CIoU) loss is introduced as a geometric regularization term to improve alignment between predicted and ground-truth bounding boxes. To better preserve fine spatial details essential for identifying small thermal signatures, an Enhanced Low-level Feature Module (ELFM) is incorporated using multi-scale dilated convolutions and channel attention. Experiments on the NUDT-SIRST and IRSTD-1k datasets demonstrate that PSHNet outperforms existing methods in IoU, detection probability, and false alarm rate, achieving IoU improvement and robust performance under low-SNR conditions. Full article
Show Figures

Figure 1

19 pages, 1256 KiB  
Article
More Details on Two Solutions with Ordered Sequences for Binomial Confidence Intervals
by Lorentz Jäntschi
Symmetry 2025, 17(7), 1090; https://doi.org/10.3390/sym17071090 - 8 Jul 2025
Viewed by 202
Abstract
While many continuous distributions are known, the list of discrete ones (usually derived from counting) often reported is relatively short. This list becomes even shorter when dealing with dichotomous observables: binomial, hypergeometric, negative binomial, and uniform. Binomial distribution is important for medical studies, [...] Read more.
While many continuous distributions are known, the list of discrete ones (usually derived from counting) often reported is relatively short. This list becomes even shorter when dealing with dichotomous observables: binomial, hypergeometric, negative binomial, and uniform. Binomial distribution is important for medical studies, since a finite sample from a population included in a medical study with yes/no outcome resembles a series of independent Bernoulli trials. The problem of calculating the confidence interval (CI, with conventional risk of 5% or otherwise) is revealed to be a problem of combinatorics. Several algorithms dispute the exact calculation, each according to a formal definition of its exactness. For two algorithms, four previously proposed case studies are provided, for sample sizes of 30, 50, 100, 150, and 300. In these cases, at 1% significance level, ordered sequences defining the confidence bounds were generated for two formal definitions. Images of the error’s alternation are provided and discussed. Both algorithms propose symmetric solutions in terms of both CIs and actual coverage probabilities. The CIs are not symmetric relative to the observed variable, but are mirrored symmetric relative to the middle of the observed variable domain. When comparing the solutions proposed by the algorithms, with the increase in the sample size, the ratio of identical confidence levels is increased and the difference between actual and imposed coverage is shrunk. Full article
(This article belongs to the Section Mathematics)
Show Figures

Figure 1

Back to TopTop