<p>In this paper, we prove there exists a coupled fixed point for a set- valued contraction mapping defined on X× X , where X is incomplete ordered G-metric. Also, we prove the existence of a unique fixed point for single valued mapping with respect to implicit condition defined on a complete G- metric.</p>

The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result. 

In this paper, we will focus to one of the recent applications of PU-algebras in the coding theory, namely the construction of codes by soft sets PU-valued functions. First, we shall introduce the notion of soft sets PU-valued functions on PU-algebra and investigate some of its related properties.Moreover, the codes generated by a soft sets PU-valued function are constructed and several examples are given. Furthermore, example with graphs of binary block code constructed from a soft sets PU-valued function is constructed.

A fixed firefighting system is a key component of fire safeguarding and reducing fire danger. It is installed as a permanent component in a structure to protect the entire or a portion of the building and its contents. The study aims to review the previous studies that deal with the evaluation of fire safety measures and their use in resolving problems associated with fire threats in buildings. For this reason, a number of previous studies in this field were reviewed compared with the NFPA code. The findings revealed that regulatory developments over the last several decades had created an atmosphere conducive to innovation. This has resulted in a growth in the number of fixed firefighting system types now obtainable. Th

This work aims to investigate the tensile and compression strengths of heat- cured acrylic resin denture base material by adding styrene-butadiene (S- B) to polymethyl methacrylate (PMMA). The most well- known issue in prosthodontic practice is fracture of a denture base. All samples were a blend of (90%, 80%) PMMA and (10%, 20%) S- B powder melted in Oxolane (Tetra hydro furan). These samples were chopped down into specimens of dimensions 100x10x2.5mm to carry out the requirements of tensile tests. The compression strength test specimens were shaped into a cylinder with dimensions of 12.7mm in diameter and 20mm in length. The experimental results show a significant increase in both tensile and compression strengths when compared to cont

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to

In this paper, a compression system with high synthetic architect is introduced, it is based on wavelet transform, polynomial representation and quadtree coding. The bio-orthogonal (tap 9/7) wavelet transform is used to decompose the image signal, and 2D polynomial representation is utilized to prune the existing high scale variation of image signal. Quantization with quadtree coding are followed by shift coding are applied to compress the detail band and the residue part of approximation subband. The test results indicate that the introduced system is simple and fast and it leads to better compression gain in comparison with the case of using first order polynomial approximation.