Search

Genetic disorders affect over 6% of the global population and pose substantial obstacles to healthcare systems. Early identification of these rare facial genetic disorders is essential for managing related medical complexities and health issues. Many people consider the existing screening techniques inadequate, often leading to a diagnosis several years after birth. This study evaluated the efficacy of deep learning-based classifier models for accurately recognizing dysmorphic characteristics using facial photos. This study proposes a multi-class facial syndrome classification framework that encompasses a unique combination of diseases not previously examined together. The study focused on distinguishing between individuals with four specific genetic disorders (Down syndrome, Noonan syndrome, Turner syndrome, and Williams syndrome) and healthy controls. We investigated how well fine-tuning a few well-known convolutional neural network (CNN)-based pre-trained models—including VGG16, ResNet-50, ResNet152, and VGG-Face—worked for the multi-class facial syndrome classification task. We obtained the most encouraging results by adjusting the VGG-Face model. The proposed fine-tuned VGG-Face model not only demonstrated the best performance in this study, but it also performed better than other state-of-the-art pre-trained CNN models for the multi-class facial syndrome classification task. The fine-tuned model achieved both accuracy and an F1-Score of 90%, indicating significant progress in accurately detecting the specified genetic disorders. [ABSTRACT FROM AUTHOR]

Breast cancer detection at an early stage is crucial for improving patient survival rates. This work introduces an innovative thermal imaging prototype that incorporates compression techniques inspired by mammography equipment. The prototype offers a radiation-free and precise cancer diagnosis. By integrating compression and illumination methods, thermal picture quality has increased, and the accuracy of classification has improved. Essential components of the suggested thermography device include an equipment body, plates, motors, pressure sensors, light sources, and a thermal camera. We created a 3D model of the gadget using the SolidWorks software 2020 package. Furthermore, the classification research employed both cancer and normal images from the experimental results to validate the efficacy of the suggested system. We employed preprocessing and segmentation methods on the obtained dataset. We successfully categorized the thermal pictures using various classifiers and examined their performance. The logistic regression model showed excellent performance, achieving an accuracy of 0.976, F1 score of 0.977, precision of 1.000, and recall of 0.995. This indicates a high level of accuracy in correctly classifying thermal abnormalities associated with breast cancer. The proposed prototype serves as a highly effective tool for conducting initial investigations into breast cancer detection, offering potential advancements in early-stage diagnosis, and improving patient survival rates. [ABSTRACT FROM AUTHOR]

In the contemporary environment, mobile ad hoc networks (MANETs) have become necessary. They are absolutely vital in a variety of situations, where setting up a network quickly is required; however, this is infeasible due to low resources. Ad hoc networks have many applications: education, on the front lines of battle, rescue missions, etc. These networks are distinguished by high mobility and constrained computing, storage, and energy capabilities. The main aim of this research is to create a method for identifying blackhole attacks through anomaly detection techniques utilizing Support Vector Machines (SVM). Our detection system looks at node activity to scan network traffic for irregularities. In blackhole scenarios, the attackers exhibit distinct behavioral characteristics that distinguish them from other nodes. This can be efficiently detected by the proposed SVM-based detection system. The proposed detection system is designed to analyze network traffic and identify anomalies by examining node behaviors. Specifically, in the context of blackhole threats, it distinguishes the attackers from normal nodes based on behavioral characteristics. Using this approach, the system effectively detects blackhole attacks. The results demonstrate a very high level of accuracy in detecting blackhole attacks, confirming its efficacy in ensuring the security of mobile ad hoc networks (MANETs) by identifying and isolating malicious nodes. This solution is particularly valuable in scenarios like military operations and disaster management where a reliable communication system is crucial. Furthermore, the proposed detection method, ADS-SVM, was compared to two other methods (J48 classifier and NB classifier) from different researchers. The results indicate that ADS-SVM outperforms the other methods with a detection accuracy of 99.96%, surpassing the 99.2% achieved by J48 classifier and the 96.5% achieved by NB classifier. The results indicate that ADS-SVM is a highly efficient approach for identifying blackhole attacks in MANETs, potentially offering superior accuracy compared to other related methods. [ABSTRACT FROM AUTHOR]

Investigating digital crimes in cloud service environments is complex due to the decentralized nature of these services, posing challenges in data collection and presenting credible evidence in court. While existing research focuses more on external investigators, Cloud Service Providers (CSPs) have less responsibilities. To address this gap, a new framework named Microservices Forensics as a Service (MsFaaS) is introduced, aiming to ensure the reliable presentation of evidence. MsFaaS integrates international law enforcement, assigning responsibility to CSPs validated by local authorities where incidents occur. The framework consolidates existing literature, tackling unresolved challenges like legality, standardization, and data collection through the collection of diverse data types and the use of event reconstruction techniques to construct a comprehensive crime scene in both real-time and postmortem scenarios. Blockchain secures collected data against tampering, while hash functions and public key cryptography validate Microservices workflows against man-in-the-middle attacks. Machine learning enables proactive response actions to incidents. Moreover, MsFaaS facilitates auditing and recording of both internal and external cloud traffic, producing evidence reports certified by local authorities. By addressing the limitations of traditional digital forensics, MsFaaS enhances investigation reliability and effectiveness, offering services for internal CSP auditing and maintaining Chain of Custody integrity critical for trial decision-making. [ABSTRACT FROM AUTHOR]

The Nth-degree Truncated polynomial Ring Unit (NTRU) is one of the famous post-quantum cryptographic algorithms. Researchers consider NTRU to be the most important parameterized family of lattice-based public key cryptosystems that has been established to the IEEE P1363 standards. Lattice-based protocols necessitate operations on large vectors, which makes parallel computing one of the appropriate solutions to speed it up. NTRUEncrypt operations contain a large amount of data that requires many repetitive arithmetic operations. These operations make it a strong candidate to take advantage of the high degree of parallelism. The main costly operation that is repeated in all NTRU algorithm steps is polynomial multiplication. In this work, a Parallel Post-Quantum NTRUEncrypt algorithm called PPQNTRUEncrypt is proposed. This algorithm exploits the capabilities of parallel computing to accelerate the NTRUEncrypt algorithm. Both analytical and Apache Spark simulation models are used. The proposed algorithm enhanced the NTRUEncrypt algorithm by approximately 49.5%, 74.5%, 87.6%, 92.5%, 93.4%, and 94.5%, assuming that the number of processing elements is 2, 4, 8, 12, 16, and 20 respectively. [ABSTRACT FROM AUTHOR]

Recently, MiniMax ranked set sampling (MiniMax RSS) scheme is suggested for population mean estimation. In this article, we consider moving extreme ranked set sampling (MERSS) and MiniMax RSS for estimating the distribution function of a random variable. Using the maximum likelihood estimation method, new estimators of the cumulative distribution function (CDF) are derived and also their variances are obtained. In the light of a simulation study, we conclude that the estimators based on MiniMax RSS work well compared to those based on MERSS setups regardless of the ranking quality. Additionally, the proposed concomitant-based CDF estimators tend to be superior to their analogs as long as the ranking process is done with fairly good accuracy. For the sake of illustration, two empirical datasets are considered to show the applicability of the proposed estimators in practice. [ABSTRACT FROM AUTHOR]

In the discipline of hand gesture and dynamic sign language recognition, deep learning approaches with high computational complexity and a wide range of parameters have been an extremely remarkable success. However, the implementation of sign language recognition applications for mobile phones with restricted storage and computing capacities is usually greatly constrained by those limited resources. In light of this situation, we suggest lightweight deep neural networks with advanced processing for real-time dynamic sign language recognition (DSLR). This paper presents a DSLR application to minimize the gap between hearing-impaired communities and regular society. The DSLR application was developed using two robust deep learning models, the GRU and the 1D CNN, combined with the MediaPipe framework. In this paper, the authors implement advanced processes to solve most of the DSLR problems, especially in real-time detection, e.g., differences in depth and location. The solution method consists of three main parts. First, the input dataset is preprocessed with our algorithm to standardize the number of frames. Then, the MediaPipe framework extracts hands and poses landmarks (features) to detect and locate them. Finally, the features of the models are passed after processing the unification of the depth and location of the body to recognize the DSL accurately. To accomplish this, the authors built a new American video-based sign dataset and named it DSL-46. DSL-46 contains 46 daily used signs that were presented with all the needed details and properties for recording the new dataset. The results of the experiments show that the presented solution method can recognize dynamic signs extremely fast and accurately, even in real-time detection. The DSLR reaches an accuracy of 98.8%, 99.84%, and 88.40% on the DSL-46, LSA64, and LIBRAS-BSL datasets, respectively. [ABSTRACT FROM AUTHOR]

Ranked set sampling (RSS) allows us to draw inference about the population parameters more efficiently as compared with that in simple random sampling. Recent publication has shown that using the concomitant information can lead to improved estimation of the cumulative distribution function (CDF) under RSS set up. In this article, new estimators for both in-stratum and overall CDF are proposed. The proposed estimators are then used for estimating the differential entropy, Bohn and Wolfe model and fraction-of-random model. Three new simple tests for the assumption of perfect ranking are also produced. Our simulation results show that the suggested estimators as well as the perfectness tests provide higher efficiency against their competitors. For illustrative purposes, the proposed procedures are applied on empirical data set in the medical field. [ABSTRACT FROM AUTHOR]

A generalized ranked set sampling (RSS) plan has recently been provided in the literature called varied L RSS (VLRSS). It is shown that VLRSS encompasses several existing RSS variations and also it efficiently estimates the population mean. In this article, we extend the work and consider estimating the cumulative distribution function (CDF) using VLRSS. Three new CDF estimators are proposed and their asymptotic properties are also theoretically investigated. Taking into account the information supported by the unmeasured sampling units, we also propose a general class of CDF estimators. Using small Monte Carlo experiments, we study the behavior of the proposed CDF estimators with respect to the conventional CDF estimator under RSS. It is found that the conventional RSS-based CDF is outperformed by at least one of VLRSS-based CDF estimators in most of the considered cases. Finally, an empirical example is utilized to illustrate the potential application of the proposed estimators. [ABSTRACT FROM AUTHOR]

The problem of parameters estimation plays a significant role in various areas of academic researches. In this article, we propose three different methods of estimation for the parameters of location-scale family under ranked set sampling in the view of missing data mechanism. Through a series of Monte Carlo simulations, it is well investigated that the proposed methods are relatively robust from violating the perfect ranking condition and provide better performance over their competitors using bias and MSE (mean square error) criteria. An empirical data set is also used for illustrative purposes. [ABSTRACT FROM AUTHOR]

The analysis of frame sequences in talk show videos, which is necessary for media mining and television production, requires significant manual efforts and is a very time-consuming process. Given the vast amount of unlabeled face frames from talk show videos, we address and propose a solution to the problem of recognizing and clustering faces. In this paper, we propose a TV media mining system that is based on a deep convolutional neural network approach, which has been trained with a triplet loss minimization method. The main function of the proposed system is the indexing and clustering of video data for achieving an effective media production analysis of individuals in talk show videos and rapidly identifying a specific individual in video data in real-time processing. Our system uses several face datasets from Labeled Faces in the Wild (LFW), which is a collection of unlabeled web face images, as well as YouTube Faces and talk show faces datasets. In the recognition (person spotting) task, our system achieves an F-measure of 0.996 for the collection of unlabeled web face images dataset and an F-measure of 0.972 for the talk show faces dataset. In the clustering task, our system achieves an F-measure of 0.764 and 0.935 for the YouTube Faces database and the LFW dataset, respectively, while achieving an F-measure of 0.832 for the talk show faces dataset, an improvement of 5.4%, 6.5%, and 8.2% over the previous methods. [ABSTRACT FROM AUTHOR]