Biometrics is widely used with security systems nowadays; each biometric modality can be useful and has distinctive properties that provide uniqueness and ambiguity for security systems especially in communication and network technologies. This paper is about using biometric features of fingerprint, which is called (minutiae) to cipher a text message and ensure safe arrival of data at receiver end. The classical cryptosystems (Caesar, Vigenère, etc.) became obsolete methods for encryption because of the high-performance machines which focusing on repetition of the key in their attacks to break the cipher. Several Researchers of cryptography give efforts to modify and develop Vigenère cipher by enhancing its weaknesses.

By driven the moment estimator of ARMA (1, 1) and by using the simulation some important notice are founded, From the more notice conclusions that the relation between the sign   and moment estimator for ARMA (1, 1) model that is: when the sign is positive means the root      gives invertible model and when the sign is negative means the root      gives invertible model. An alternative method has been suggested for ARMA (0, 1) model can be suitable when

This study proposed a biometric-based digital signature scheme proposed for facial recognition. The scheme is designed and built to verify the person’s identity during a registration process and retrieve their public and private keys stored in the database. The RSA algorithm has been used as asymmetric encryption method to encrypt hashes generated for digital documents. It uses the hash function (SHA-256) to generate digital signatures. In this study, local binary patterns histograms (LBPH) were used for facial recognition. The facial recognition method was evaluated on ORL faces retrieved from the database of Cambridge University. From the analysis, the LBPH algorithm achieved 97.5% accuracy; the real-time testing was done on thirty subj

In this paper the definition of fuzzy normed space is recalled and its basic properties. Then the definition of fuzzy compact operator from fuzzy normed space into another fuzzy normed space is introduced after that the proof of an operator is fuzzy compact if and only if the image of any fuzzy bounded sequence contains a convergent subsequence is given. At this point the basic properties of the vector space FC(V,U)of all fuzzy compact linear operators are investigated such as when U is complete and the sequence ( ) of fuzzy compact operators converges to an operator T then T must be fuzzy compact. Furthermore we see that when T is a fuzzy compact operator and S is a fuzzy bounded operator then the composition TS and ST are fuzzy compact

Piled raft is commonly used as foundation for high rise buildings. The design concept of piled raft foundation is to minimize the number of piles, and to utilize the entire bearing capacity. High axial stresses are therefore, concentrated at the region of connection between the piles and raft. Recently, an alternative technique is proposed to disconnect the piles from the raft in a so called unconnected piled raft (UCPR) foundation, in which a compacted soil layer (cushion) beneath the raft, is usually introduced.  The piles of the new system are considered as reinforcement members for the subsoil rather than as structural members. In the current study, the behavior of unconnected piled rafts systems has been studie

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

Orthogonal 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

The Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t