Heart disease is a significant and impactful health condition that ranks as the leading cause of death in many countries. In order to aid physicians in diagnosing cardiovascular diseases, clinical datasets are available for reference. However, with the rise of big data and medical datasets, it has become increasingly challenging for medical practitioners to accurately predict heart disease due to the abundance of unrelated and redundant features that hinder computational complexity and accuracy. As such, this study aims to identify the most discriminative features within high-dimensional datasets while minimizing complexity and improving accuracy through an Extra Tree feature selection based technique. The work study assesses the efficacy of several classification algorithms on four reputable datasets, using both the full features set and the reduced features subset selected through the proposed method. The results show that the feature selection technique achieves outstanding classification accuracy, precision, and recall, with an impressive 97% accuracy when used with the Extra Tree classifier algorithm. The research reveals the promising potential of the feature selection method for improving classifier accuracy by focusing on the most informative features and simultaneously decreasing computational burden.
As a new technology, blockchain provides the necessary capabilities to assure data integrity and data security through encryption. Mostly, all existing algorithms that provide security rely on the process of discovering a suitable key. Hence, key generation is considered the core of powerful encryption. This paper uses Zernike moment and Mersenne prime numbers to generate strong prime numbers by extracting the features from biometrics (speech). This proposed system sends these unique and strong prime numbers to the RSA algorithm to generate the keys. These keys represent a public address and a private key in a cryptocurrency wallet that is used to encrypt transactions. The benefit of this work is that it provides a high degree
... Show More<p>In this paper, a simple color image compression system has been proposed using image signal decomposition. Where, the RGB image color band is converted to the less correlated YUV color model and the pixel value (magnitude) in each band is decomposed into 2-values; most and least significant. According to the importance of the most significant value (MSV) that influenced by any simply modification happened, an adaptive lossless image compression system is proposed using bit plane (BP) slicing, delta pulse code modulation (Delta PCM), adaptive quadtree (QT) partitioning followed by an adaptive shift encoder. On the other hand, a lossy compression system is introduced to handle the least significant value (LSV), it is based on
... Show MoreThe use of online social network (OSN) has become essential to humans' lives whether for entertainment, business or shopping. This increasing use of OSN motivates designing and implementing special systems that use OSN users' data to provide better user experience using machine learning and data mining algorithms and techniques. One system that is used extensively for this purpose is friend recommendation system (FRS) in which it recommends users to other users in professional or entertaining online social networks.
For this purpose, this study proposes a novel friend recommendation system, namely Hybrid Friend Recommendation (FR) model. The Hybrid model applies dual-stage methodology on unlabeled data of 1241 users collected fro
... Show MoreOrthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show MoreIn recent years, encryption technology has been developed rapidly and many image encryption methods have been put forward. The chaos-based image encryption technique is a modern encryption system for images. To encrypt images, it uses random sequence chaos, which is an efficient way to solve the intractable problem of simple and highly protected image encryption. There are, however, some shortcomings in the technique of chaos-based image encryption, such limited accuracy issue. The approach focused on the chaotic system in this paper is to construct a dynamic IP permutation and S-Box substitution by following steps. First of all, use of a new IP table for more diffusion of al
... Show MoreIn this work, a pollution-sensitive Photonic Crystal Fiber (PCF) based on Surface Plasmon Resonance (SPR) technology is designed and implemented for sensing refractive indices and concentrations of polluted water . The overall construction of the sensor is achieved by splicing short lengths of PCF (ESM-12) solid core on one side with traditional multimode fiber (MMF) and depositing a gold nanofilm of 50nm thickness on the end of the PCF sensor. The PCF- SPR experiment was carried out with various samples of polluted water including(distilled water, draining water, dirty pond water, chemical water, salty water and oiled water). The location of the resonant wavelength peaks is seen to move to longer wavelengths (red shift)
... Show MoreFacial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f
... Show MoreAny software application can be divided into four distinct interconnected domains namely, problem domain, usage domain, development domain and system domain. A methodology for assistive technology software development is presented here that seeks to provide a framework for requirements elicitation studies together with their subsequent mapping implementing use-case driven object-oriented analysis for component based software architectures. Early feedback on user interface components effectiveness is adopted through process usability evaluation. A model is suggested that consists of the three environments; problem, conceptual, and representational environments or worlds. This model aims to emphasize on the relationship between the objects
... Show MoreThe printed Arabic character recognition are faced numerous challenges due to its character body which are changed depending on its position in any sentence (at beginning or in the middle or in the end of the word). This paper portrays recognition strategies. These strategies depend on new pre-processing processes, extraction the structural and numerical features to build databases for printed alphabetical Arabic characters. The database information that obtained from features extracted was applied in recognition stage. Minimum Distance Classifier technique (MDC) was used to classify and train the classes of characters. The procedure of one character against all characters (OAA) was used in determination the rate
... Show More