Low Computational Demand Research Articles

Fusion Unbiased Pseudo-Linear Kalman Filter-Based Bearings-Only Target Tracking

In the realm of bearings-only target tracking, the pseudo-linear Kalman filter (PLKF) has garnered significant interest, due to its low computational demands and robust stability. However, the interrelation between the measurement matrix and noise introduces bias into the PLKF’s target state estimation. To address this issue, we introduce a fusion unbiased PLKF (FUBKF) algorithm. This algorithm initiates with a global pseudo-linear treatment of the measurement equation, subsequently isolating the noise within the measurement matrix. By employing the unscented Kalman filter (UKF), the algorithm achieves precise estimation of the measurement matrix, thereby mitigating the estimation error stemming from the correlation between the measurement matrix and noise. Simulation outcomes demonstrate that the proposed algorithm substantially enhances tracking accuracy and sustains high stability in both 2D and 3D bearings-only target tracking scenarios, encompassing both non-maneuvering and maneuvering conditions.

A Comprehensive Model and Numerical Study of Shear Flow in Compressible Viscous Micropolar Real Gases

Understanding shear flow behavior in compressible, viscous, micropolar real gases is essential for both theoretical advancements and practical engineering applications. This study develops a comprehensive model that integrates micropolar fluid theory with compressible flow dynamics to accurately describe the behavior of real gases under shear stress. We formulate the governing equations by incorporating viscosity and micropolar effects and transform the obtained system into the mass Lagrangian coordinates. Two numerical methods, Faedo–Galerkin approximation and finite-difference methods, are used to solve it. These methods are compared using several benchmark examples to assess their accuracy and computational efficiency. Both methods demonstrate good performance, achieving equally precise results in capturing essential flow characteristics. However, the finite-difference method offers advantages in speed, stability, and lower computational demands. This research bridges gaps in existing models and establishes a foundation for further investigations into complex flow phenomena in micropolar real gases.

A Performance Comparison of Different YOLOv7 Networks for High-Accuracy Cell Classification in Bronchoalveolar Lavage Fluid Utilising the Adam Optimiser and Label Smoothing.

Accurate classification of cells in bronchoalveolar lavage (BAL) fluid is essential for the assessment of lung disease in pneumology and critical care medicine. However, the effectiveness of BAL fluid analysis is highly dependent on individual expertise. Our research is focused on improving the accuracy and efficiency of BAL cell classification using the "You Only Look Once" (YOLO) algorithm to reduce variability and increase the accuracy of cell detection in BALF analysis. We assess various YOLOv7 iterations, including YOLOv7, YOLOv7 with Adam and label smoothing, YOLOv7-E6E, and YOLOv7-E6E with Adam and label smoothing focusing on the detection of four key cell types of diagnostic importance in BAL fluid: macrophages, lymphocytes, neutrophils, and eosinophils. This study utilised cytospin preparations of BAL fluid, employing May-Grunwald-Giemsa staining, and analysed a dataset comprising 2032 images with 42,221 annotations. Classification performance was evaluated using recall, precision, F1 score, mAP@.5, and mAP@.5;.95 along with a confusion matrix. The comparison of four algorithmic approaches revealed minor distinctions in mean results, falling short of statistical significance (p < 0.01; p < 0.05). YOLOv7, with an inference time of 13.5 ms for 640 × 640 px images, achieved commendable performance across all cell types, boasting an average F1 metric of 0.922, precision of 0.916, recall of 0.928, and mAP@.5 of 0.966. Remarkably, all four cell types were classified consistently with high-performance metrics. Notably, YOLOv7 demonstrated marginally superior class value dispersion when compared to YOLOv7-adam-label-smoothing, YOLOv7-E6E, and YOLOv7-E6E-adam-label-smoothing, albeit without statistical significance. Consequently, there is limited justification for deploying the more computationally intensive YOLOv7-E6E and YOLOv7-E6E-adam-label-smoothing models. This investigation indicates that the default YOLOv7 variant is the preferred choice for differential cytology due to its accessibility, lower computational demands, and overall more consistent results than more complex models.

MetaRange: A framework to build mechanistic range models

Abstract Mechanistic or process‐based models offer great insights into the range dynamics of species facing non‐equilibrium conditions, such as climate and land‐use changes or invasive species. Their consideration of underlying mechanisms relaxes the species‐environment equilibrium assumed by correlative approaches, while also generating conservation‐relevant indicators, such as range‐wide abundance time series and migration rates if demographically explicit. However, the computational complexity of mechanistic models limits their development and applicability to large spatiotemporal extents. We present the R package “metaRange”: a modular framework to build population‐based and metabolically constrained range models. We also provide a catalogue of biological functions to calculate niche‐based suitability, metabolic scaling, population dynamics, biotic interactions and kernel‐based dispersal, which may include directed movement. The framework's modularity enables the user to combine, extend, or replace these functions, making it possible to customize the model to the ecology of the study system. The package supports an unlimited number of static or dynamic environmental factors as input, including climate and land use. As examples, we include one single‐species application to predict the range dynamics of the European wildcat (Felis silvestris) in Germany, and one theoretical study in which we simulated 100 virtual species in three scenarios: without competition, with competition, and with competition under a generalist‐specialist trade‐off. Due to the population‐level, the package can execute such extensive simulation experiments on regular end‐user hardware in a short amount of time. We provide detailed technical documentation, both for the individual functions in the package as well as instructions on how to set up different types of model structures and experimental designs. The metaRange framework enables process‐based simulations of range dynamic of multiple interacting species on a high resolution and low computational demand. We believe that it allows for theoretical insights and hypotheses testing about future range dynamics of real‐world species, which may better support conservation policies targeting biodiversity loss mitigation.

Exploring the Impact of Word2Vec Embeddings Across Neural Network Architectures for Sentiment Analysis

Abstract. Sentiment analysis is crucial for understanding public opinion, gauging customer satisfaction, and making informed business decisions based on the emotional tone of textual data. This study investigates the performance of different Word2Vec-based embedding strategies static, non-static, and multichannel for sentiment analysis across various neural network architectures, including Convolution Neural Networks (CNNs), Long Short-Term Memory (LSTM), and Gated Recurrent Units (GRUs). Despite the rise of advanced contextual embedding methods such as Bidirectional Encoder Representations from Transformers (BERT), Word to Vector (Word2Vec) retains its importance due to its simplicity and lower computational demands, making it ideal for use in settings with limited resources. The goal is to evaluate the impact of fine-tuning Word2Vec embeddings on the accuracy of sentiment classification. Using the Internet Movie Database (IMDb), this work finds that multichannel embeddings, which combine static and non-static representations, provide the best performance across most architectures, while static embeddings continue to deliver strong results in specific sequential models. These findings highlight the balance between efficiency and accuracy in traditional word embeddings, particularly when advanced models are not feasible.

Exploring the Impact of Word2Vec Embeddings Across Neural Network Architectures for Sentiment Analysis

Abstract. Sentiment analysis is crucial for understanding public opinion, gauging customer satisfaction, and making informed business decisions based on the emotional tone of textual data. This study investigates the performance of different Word2Vec-based embedding strategies static, non-static, and multichannel for sentiment analysis across various neural network architectures, including Convolution Neural Networks (CNNs), Long Short-Term Memory (LSTM), and Gated Recurrent Units (GRUs). Despite the rise of advanced contextual embedding methods such as Bidirectional Encoder Representations from Transformers (BERT), Word to Vector (Word2Vec) retains its importance due to its simplicity and lower computational demands, making it ideal for use in settings with limited resources. The goal is to evaluate the impact of fine-tuning Word2Vec embeddings on the accuracy of sentiment classification. Using the Internet Movie Database (IMDb), this work finds that multichannel embeddings, which combine static and non-static representations, provide the best performance across most architectures, while static embeddings continue to deliver strong results in specific sequential models. These findings highlight the balance between efficiency and accuracy in traditional word embeddings, particularly when advanced models are not feasible.

Score filtering for contextualized noise suppression of Poisson‐distributed geophysical signals

AbstractGeophysical and remote sensing products that rely on Poisson‐distributed measurement signals, such as cosmic‐ray neutron sensing (CRNS) and gamma spectrometry, often face challenges due to inherent Poisson noise. Common techniques to enhance signal stability include data aggregation or smoothing (e.g., moving averages and interpolation). However, these methods typically reduce the ability to resolve detailed temporal (stationary data) and spatial (mobile data) features. In this study, we introduced a method for contextual noise suppression tailored to Poisson‐distributed data, utilizing a discrete score attribution system. This score filter evaluates each observation against eight different criteria to assess its consistency with surrounding values, assigning a score between 0 (very unlikely) and 8 (very likely) to indicate whether the observation is likely to act as noise. These scores can then be used to flag or remove data points based on user‐defined thresholds. We tested the score filter's effectiveness on both stationary and mobile CRNS data, as well as on gamma‐ray spectrometry and electromagnetic induction (EMI) recordings. In our examples, the score filter consistently outperformed established filters, for example Savitzky–Golay and Kalman, in direct competition when applied to CRNS time series data. Additionally, the score filter substantially reduced Poisson noise in mobile CRNS, gamma‐ray spectrometry and EMI data. The scoring system also provides a context‐sensitive evaluation of individual observations or aggregates, assessing their conformity within the dataset. Given its general applicability, customizable criteria and very low computational demands, the proposed filter is easy to implement and holds promise as a valuable tool for denoising geophysical data and applications in other fields.

Research on improving the ranging accuracy of ships with stereo vision through Kalman filter optimization.

The real-time and accurate detection and ranging of ships play a pivotal role in ensuring navigation safety, this study aims to enhance the navigation safety and environmental perception capabilities of inland waterway vessels. In the ship detection stage, addressing challenges such as large parameters, high computational complexity, and poor real-time performance in existing ship detection models, this paper proposes the MS-YOLOv5s ship target detection algorithm. This algorithm, based on YOLOv5s, utilizes the lightweight MobileNetV3-Small network to replace the original YOLOv5s feature extraction backbone network, thereby improving the detection speed. The results indicate that the parameter size of the MS-YOLOv5s model is 3.55M, only 50.49% of YOLOv5s. Achieving a detection rate of 50.28 FPS, the precision is 96.80%, and the mAP is 98.40%, striking a balance between high accuracy and low computational demand. In the depth estimation stage, influenced by the environment, leading to unstable measurement data, this paper proposes a binocular Kalman filter fusion ranging algorithm. The standard deviation of the ranging results is minimized to 6.032μm, which is one order of magnitude smaller than traditional ranging algorithms, significantly enhancing the robustness of the measurement results. Within a distance of 20m from the ship target, the error can be controlled within 3%, showcasing the applicability of the method proposed in this paper in complex inland waterway environments contributes to the enhancement of ships' environmental perception capabilities and navigation safety, holding positive implications for the development of intelligent vessels.

REDalign: accurate RNA structural alignment using residual encoder-decoder network

BackgroundRNA secondary structural alignment serves as a foundational procedure in identifying conserved structural motifs among RNA sequences, crucially advancing our understanding of novel RNAs via comparative genomic analysis. While various computational strategies for RNA structural alignment exist, they often come with high computational complexity. Specifically, when addressing a set of RNAs with unknown structures, the task of simultaneously predicting their consensus secondary structure and determining the optimal sequence alignment requires an overwhelming computational effort of O(L6)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$O(L^6)$$\\end{document} for each RNA pair. Such an extremely high computational complexity makes these methods impractical for large-scale analysis despite their accurate alignment capabilities.ResultsIn this paper, we introduce REDalign, an innovative approach based on deep learning for RNA secondary structural alignment. By utilizing a residual encoder-decoder network, REDalign can efficiently capture consensus structures and optimize structural alignments. In this learning model, the encoder network leverages a hierarchical pyramid to assimilate high-level structural features. Concurrently, the decoder network, enhanced with residual skip connections, integrates multi-level encoded features to learn detailed feature hierarchies with fewer parameter sets. REDalign significantly reduces computational complexity compared to Sankoff-style algorithms and effectively handles non-nested structures, including pseudoknots, which are challenging for traditional alignment methods. Extensive evaluations demonstrate that REDalign provides superior accuracy and substantial computational efficiency.ConclusionREDalign presents a significant advancement in RNA secondary structural alignment, balancing high alignment accuracy with lower computational demands. Its ability to handle complex RNA structures, including pseudoknots, makes it an effective tool for large-scale RNA analysis, with potential implications for accelerating discoveries in RNA research and comparative genomics.

MUCM-Net: a Mamba powered UCM-Net for skin lesion segmentation

Aim: Skin lesion segmentation is critical for early skin cancer detection. Challenges in automatic segmentation from dermoscopic images include variations in color, texture, and artifacts of indistinct lesion boundaries. This study aims to develop and evaluate MUCM-Net, a lightweight and efficient model for skin lesion segmentation, leveraging Mamba state-space models integrated with UCM-Net architecture optimized for mobile deployment and early skin cancer detection. Methods: MUCM-Net combines Convolutional Neural Networks (CNNs), multi-layer perceptions (MLPs), and Mamba elements into a hybrid feature learning module. Results: The model was trained and tested on the International Skin Imaging Collaboration (ISIC) 2017 and ISIC2018 datasets, consisting of 2,000 and 2,594 dermoscopic images, respectively. Critical metrics for evaluation included Dice Similarity Coefficient (DSC), sensitivity (SE), specificity (SP), and accuracy (ACC). The model’s computational efficiency was also assessed by measuring Giga Floating-point Operations Per Second (GFLOPS) and the number of parameters. MUCM-Net demonstrated superior performance in skin lesion segmentation with an average DSC of 0.91 on the ISIC2017 dataset and 0.89 on the ISIC2018 dataset, outperforming existing models. It achieved high SE (0.93), SP (0.95), and ACC (0.92) with low computational demands (0.055–0.064 GFLOPS). Conclusions: The model’s innovative Mamba-UCM layer significantly enhanced feature learning while maintaining efficiency that is suitable for mobile devices. MUCM-Net establishes a new standard in lightweight skin lesion segmentation, balancing exceptional ACC with efficient computational performance. Its ability to perform well on mobile devices makes it a scalable tool for early skin cancer detection in resource-limited settings. The open-source availability of MUCM-Net supports further research and collaboration, promoting advances in mobile health diagnostics and the fight against skin cancer. MUCM-Net source code will be posted on https://github.com/chunyuyuan/MUCM-Net.

MPSA-Conformer-CTC/Attention: A High-Accuracy, Low-Complexity End-to-End Approach for Tibetan Speech Recognition.

This study addresses the challenges of low accuracy and high computational demands in Tibetan speech recognition by investigating the application of end-to-end networks. We propose a decoding strategy that integrates Connectionist Temporal Classification (CTC) and Attention mechanisms, capitalizing on the benefits of automatic alignment and attention weight extraction. The Conformer architecture is utilized as the encoder, leading to the development of the Conformer-CTC/Attention model. This model first extracts global features from the speech signal using the Conformer, followed by joint decoding of these features through CTC and Attention mechanisms. To mitigate convergence issues during training, particularly with longer input feature sequences, we introduce a Probabilistic Sparse Attention mechanism within the joint CTC/Attention framework. Additionally, we implement a maximum entropy optimization algorithm for CTC, effectively addressing challenges such as increased path counts, spike distributions, and local optima during training. We designate the proposed method as the MaxEnt-Optimized Probabilistic Sparse Attention Conformer-CTC/Attention Model (MPSA-Conformer-CTC/Attention). Experimental results indicate that our improved model achieves a word error rate reduction of 10.68% and 9.57% on self-constructed and open-source Tibetan datasets, respectively, compared to the baseline model. Furthermore, the enhanced model not only reduces memory consumption and training time but also improves generalization capability and accuracy.

The Square-Root Unscented and the Square-Root Cubature Kalman Filters on Manifolds.

Estimating the state of a system by fusing sensor data is a major prerequisite in many applications. When the state is time-variant, derivatives of the Kalman filter are a popular choice for solving that task. Two variants are the square-root unscented Kalman filter (SRUKF) and the square-root cubature Kalman filter (SCKF). In contrast to the unscented Kalman filter (UKF) and the cubature Kalman filter (CKF), they do not operate on the covariance matrix but on its square root. In this work, we modify the SRUKF and the SCKF for use on manifolds. This is particularly relevant for many state estimation problems when, for example, an orientation is part of a state or a measurement. In contrast to other approaches, our solution is both generic and mathematically coherent. It has the same theoretical complexity as the UKF and CKF on manifolds, but we show that the practical implementation can be faster. Furthermore, it gains the improved numerical properties of the classical SRUKF and SCKF. We compare the SRUKF and the SCKF on manifolds to the UKF and the CKF on manifolds, using the example of odometry estimation for an autonomous car. It is demonstrated that all algorithms have the same localization performance, but our SRUKF and SCKF have lower computational demands.

Privacy-Preserving Federated Learning-Based Intrusion Detection Technique for Cyber-Physical Systems

The Internet of Things (IoT) has revolutionized various industries, but the increased dependence on all kinds of IoT devices and the sensitive nature of the data accumulated by them pose a formidable threat to privacy and security. While traditional IDSs have been effective in securing critical infrastructures, the centralized nature of these systems raises serious data privacy concerns as sensitive information is sent to a central server for analysis. This research paper introduces a Federated Learning (FL) approach designed for detecting intrusions in diverse IoT networks to address the issue of data privacy by ensuring that sensitive information is kept in the individual IoT devices during model training. Our framework utilizes the Federated Averaging (FedAvg) algorithm, which aggregates model weights from distributed devices to refine the global model iteratively. The proposed model manages to achieve above 90% accuracies across various metrics, including precision, recall, and F1 score, while maintaining low computational demands. The results show that the proposed system successfully identifies various types of cyberattacks, including Denial-of-Service (DoS), Distributed Denial-of-Service (DDoS), data injection, ransomware, and several others, showcasing its robustness. This research makes a great advancement to the IDSs by providing an efficient and reliable solution that is more scalable and privacy friendly than any of the existing models.

Multivariate sensitivity-adaptive polynomial chaos expansion for high-dimensional surrogate modeling and uncertainty quantification

This work develops a novel basis-adaptive method for constructing anisotropic polynomial chaos expansions of multidimensional (vector-valued, multi-output) model responses. The adaptive basis selection is based on multivariate sensitivity analysis metrics that can be estimated by post-processing the polynomial chaos expansion and results in a common anisotropic polynomial basis for the vector-valued response. This allows the application of the method to problems with up to moderately high-dimensional model inputs (in the order of tens) and up to very high-dimensional model responses (in the order of thousands). The method is applied to different engineering test cases for surrogate modeling and uncertainty quantification, including use cases related to electric machine and power grid modeling and simulation, and is found to produce highly accurate results with comparatively low data and computational demand.

A Fast Grasp Planning Algorithm for Humanoid Robot Hands.

Grasp planning is crucial for robots to perform precision grasping tasks, where determining the grasp points significantly impacts the performance of the robotic hand. Currently, the majority of grasp planning methods based on analytic approaches solve the problem by transforming it into a nonlinear constrained planning problem. This method often requires performing convex hull computations, which tend to have high computational complexity. This paper proposes a new algorithm for calculating multi-finger force-closure grasps of three-dimensional objects based on humanoid multi-fingered hands. Firstly, sufficient conditions for the multi-finger force-closure grasps of three-dimensional objects are derived from a point contact model with friction. These three-dimensional force-closure conditions are then transformed into two-dimensional plane conditions, leading to a simple algorithm for multi-finger force-closure determination. This method is purely based on geometric analysis, resulting in low computational demands and enabling the rapid assessment of force-closure grasps, which are beneficial for real-time applications. Finally, the algorithm is validated through two case studies, demonstrating its feasibility and effectiveness.

A Secure Key Exchange and Authentication Scheme for Securing Communications in the Internet of Things Environment

In today’s advanced network and digital age, the Internet of Things network is experiencing a significant growing trend and, due to its wide range of services and network coverage, has been able to take a special place in today’s technology era. Among the applications that can be mentioned for this network are the field of electronic health, smart residential complexes, and a wide level of connections that have connected the inner-city infrastructure in a complex way to make it smart. The notable and critical issue that exists in this network is the extent of the elements that make up the network and, due to this, the strong and massive data exchanges at the network level. With the increasing deployment of the Internet of Things, a wide range of challenges arise, especially in the discussion of establishing network security. Regarding security concerns, ensuring the confidentiality of the data being exchanged in the network, maintaining the privacy of the network nodes, protecting the identity of the network nodes, and finally implementing the security policies required to deal with a wide range of network cyber threats are of great importance. A fundamental element in the security of IoT networks is the authentication process, wherein nodes are required to validate each other’s identities to ensure the establishment of secure communication channels. Through the enforcement of security prerequisites, in this study, we suggested a security protocol focused on reinforcing security characteristics and safeguarding IoT nodes. By utilizing the security features provided by Elliptic Curve Cryptography (ECC) and employing the Elliptic Curve Diffie–Hellman (ECDH) key-exchange mechanism, we designed a protocol for authenticating nodes and establishing encryption keys for every communication session within the Internet of Things. To substantiate the effectiveness and resilience of our proposed protocol in withstanding attacks and network vulnerabilities, we conducted evaluations utilizing both formal and informal means. Furthermore, our results demonstrate that the protocol is characterized by low computational and communication demands, which makes it especially well-suited for IoT nodes operating under resource constraints.

Low computational demand stray light correction method for hyperspectral imaging spectrometers

Stray light correction in hyperspectral imaging spectrometers has long been restricted by high computational requirements. This paper presents a low computational demand method, based on the matrix operations for spectrometer stray light correction, using an iterative approach to efficiently correct stray light across both spectral and spatial dimensions. The efficacy of this method is demonstrated through its application to simulated and real images, achieving an overall reduction of stray light by over 50%, with significantly reduced computation time and memory usage compared to the method by Zong et al. based on a sparse matrix [Appl. Opt. 45, 1111 (2006)10.1364/AO.45.001111APOPAI2155-3165]. By enabling stray light correction on general-purpose computers, this method enhances affordability and accessibility, promoting broader use and reducing measurement uncertainties in various hyperspectral imaging applications.

Ultra-lightweight convolution-transformer network for early fire smoke detection

BackgroundForests are invaluable resources, and fire is a natural process that is considered an integral part of the forest ecosystem. Although fire offers several ecological benefits, its frequent occurrence in different parts of the world has raised concerns in the recent past. Covering millions of hectares of forest land, these fire incidents have resulted in the loss of human lives, wild habitats, civil infrastructure, and severe damage to the environment. Around 90% of wildland fires have been caused by humans intentionally or unintentionally. Early detection of fire close to human settlements and wildlife centuries can help mitigate fire hazards. Numerous artificial intelligence-based solutions have been proposed in the past decade that prioritize the detection of fire smoke, as it can be caught through remote sensing and provide an early sign of wildland fire. However, most of these methods are either computationally intensive or suffer from a high false alarm rate. In this paper, a lightweight deep neural network model is proposed for fire smoke detection in images captured by satellites or other remote sensing sources.ResultsWith only 0.6 million parameters and 0.4 billion floating point operations per second, the hybrid network of convolutional and vision transformer blocks efficiently detects smoke in normal and foggy environmental conditions. It outperforms seven state-of-the-art methods on four datasets, including a self-collected dataset from the “Moderate Resolution Imaging Spectroradiometer” satellite imagery. The model achieves an accuracy of more than 99% on three datasets and 93.90% on the fourth dataset. The t-distributed stochastic neighbor embedding of extracted features by the proposed model demonstrates its superior feature learning capabilities. It is remarkable that even a tiny occurrence of smoke covering just 2% of the satellite image area is efficiently detected by the model.ConclusionsWith low memory and computational demands, the proposed model works exceedingly well, making it suitable for deployment in resource constrained devices for forest surveillance and early fire smoke detection.

Eye Deep-Net: a deep neural network-based multi-class retinal disease diagnostic

Ophthalmologists rely heavily on retinal pictures to diagnose a wide range of eye conditions. Numerous retinal disorders may lead to microvascular alterations in the retina, and a number of studies have been conducted on the early identification of medical pictures to enable prompt and appropriate treatment. In order to identify various eye illnesses using color fundus pictures, this study develops a non-invasive, automated deep learning system. A multiclass ocular illness A productive diagnostic approach was created using the Remind dataset. A variety of augmentation strategies were used to make the structure robust in real-time after multi-class fundus pictures were collected from a multi-label dataset. Low computational demand images were processed in accordance with the network. The fundamental convolutional neural network (CNN) extracts appropriate characteristics from the input color fundus image dataset, and then processed characteristics were employed to make predictive diagnoses. This multi-layer neural network, called Eye Deep-Net, has been developed for training and evaluating images for the recognition of various eye problems. The performance of the suggested model is determined to be much better than numerous baseline state-of-the-art models. The strength from the Eye Deep-Net is assessed using different statistical metrics. The suggested methodology's effectiveness in classifying and identifying diseases using digital fundus pictures is shown by a thorough comparison with the most modern techniques.

An Efficient Certificateless Anonymous Signcryption Scheme for WBAN.

A Wireless Body Area Network (WBAN), introduced into the healthcare sector to improve patient care and enhance the efficiency of medical services, also brings the risk of the leakage of patients' privacy. Therefore, maintaining the communication security of patients' data has never been more important. However, WBAN faces issues such as open medium channels, resource constraints, and lack of infrastructure, which makes the task of designing a secure and economical communication scheme suitable for WBAN particularly challenging. Signcryption has garnered attention as a solution suitable for resource-constrained devices, offering a combination of authentication and confidentiality with low computational demands. Although the advantages offered by existing certificateless signcryption schemes are notable, most of them only have proven security within the random oracle model (ROM), lack public ciphertext authenticity, and have high computational overheads. To overcome these issues, we propose a certificateless anonymous signcryption (CL-ASC) scheme suitable for WBAN, featuring anonymity of the signcrypter, public verifiability, and public ciphertext authenticity. We prove its security in the standard model, including indistinguishability, unforgeability, anonymity of the signcrypter, and identity identifiability, and demonstrate its superiority over relevant schemes in terms of security, computational overheads, and storage costs.