Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security. We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly. We make an effort to prove the security of the scheme under indistinguishability under chosen-plaintext attack (IND-CPA) through a game-based security proof. The security proof gives a mathematical analysis and its complexity of hardness. Also, it presents security analysis against all the known attacks with respect to the message expansion and homomorphic operations.
A 3D geological model is an essential step to reveal reservoir heterogeneity and reservoir properties distribution. In the present study, a three-dimensional geological model for the Mishrif reservoir was built based on data obtained from seven wells and core data. The methodology includes building a 3D grid and populating it with petrophysical properties such as (facies, porosity, water saturation, and net to gross ratio). The structural model was built based on a base contour map obtained from 2D seismic interpretation along with well tops from seven wells. A simple grid method was used to build the structural framework with 234x278x91 grid cells in the X, Y, and Z directions, respectively, with lengths equal to 150 meters. The to
... Show MoreIn this paper, the memorization capability of a multilayer interpolative neural network is exploited to estimate a mobile position based on three angles of arrival. The neural network is trained with ideal angles-position patterns distributed uniformly throughout the region. This approach is compared with two other analytical methods, the average-position method which relies on finding the average position of the vertices of the uncertainty triangular region and the optimal position method which relies on finding the nearest ideal angles-position pattern to the measured angles. Simulation results based on estimations of the mobile position of particles moving along a nonlinear path show that the interpolative neural network approach outperf
... Show More
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 efficac
... Show MoreIn this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.
Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over
... Show More