This study aimed at identifying the trend to applying the Joint Audit as an approach to improve the financial reports quality with all their characteristics (Relevance, Reliability, Comparability, Consistency), as well as enclose the difficulties that faced the auditors in the Gaza Strip in implementing the Joint Audit. In order to achieve the study aims, a measure was used to identify the trend to apply the Joint Audit and it was distributed to the study sample which is consisting of (119) individuals and retrieved thereof (99) valid for analysis, approximately (83.2%), (69) of them are Auditors, (30) financial managers and accountants. The researcher used the analytical descriptive method, and after analyzing the results, the s

Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity

Introduction: This study aimed to assess the color change of human teeth with artificial enamel white spot lesions (WSLs) after sandblasting with bioactive glass, resin infiltration, and microabrasion and to test color stability after pH cycling. Methods: Fifty extracted human mandibular first molars were randomly assigned into five groups: Sound, WSLs (untreated), and WSLs sandblasted with bioactive glass (Sylc), WSLs treated by resin infiltration (ICON), and WSLs treated by microabrasion (Opalustre), respectively. All specimens underwent a pH cycling procedure. The color parameters for each specimen were assessed using an Easyshade dental spectrophotometer at different time stages then the color changes (ΔE) were calculated. Results: The

R. Vasuki [1] proved fixed point theorems for expansive mappings in Menger spaces. R. Gujetiya and et al [2] presented an extension of the main result of Vasuki, for four expansive mappings in Menger space. In this article, an important lemma is given to prove that the iteration sequence is Cauchy under suitable condition in Menger probabilistic G-metric space (shortly, MPGM-space). And then, used to obtain three common fixed point theorems for expansive type mappings.

In this research, we introduce and study the concept of fibrewise bitopological spaces. We generalize some fundamental results from fibrewise topology into fibrewise bitopological space. We also introduce the concepts of fibrewise closed bitopological spaces,(resp., open, locally sliceable and locally sectionable). We state and prove several propositions concerning with these concepts. On the other hand, we extend separation axioms of ordinary bitopology into fibrewise setting. The separation axioms we extend are called fibrewise pairwise T_0 spaces, fibrewise pairwise T_1 spaces, fibrewise pairwise R_0 spaces, fibrewise pairwise Hausdorff spaces, fibrewise pairwise functionally Hausdorff spaces, fibrewise pairwise regular spaces, fibrewise

In today's digital era, the importance of securing information has reached critical levels. Steganography is one of the methods used for this purpose by hiding sensitive data within other files. This study introduces an approach utilizing a chaotic dynamic system as a random key generator, governing both the selection of hiding locations within an image and the amount of data concealed in each location. The security of the steganography approach is considerably improved by using this random procedure. A 3D dynamic system with nine parameters influencing its behavior was carefully chosen. For each parameter, suitable interval values were determined to guarantee the system's chaotic behavior. Analysis of chaotic performance is given using the

With time progress importance of hiding information become more and more and all steganography applications is like computer games between hiding and extracting data, or like thieves and police men always thieve hides from police men in different ways to keep him out of prison. The sender always hides information in new way in order not to be understood by the attackers and only the authorized receiver can open the hiding message. This paper explores our proposed random method in detail, how chooses locations of pixel in randomly , how to choose a random bit to hide information in the chosen pixel, how it different from other approaches, how applying information hiding criteria on the proposed project, and attempts to test out in code, and

With the increased development in digital media and communication, the need for methods to protection and security became very important factor, where the exchange and transmit date over communication channel led to make effort to protect these data from unauthentication access.

This paper present a new method to protect color image from unauthentication access using watermarking. The watermarking algorithm hide the encoded mark image in frequency domain using Discrete Cosine Transform. The main principle of the algorithm is encode frequent mark in cover color image. The watermark image bits are spread by repeat the mark and arrange in encoded method that provide algorithm more robustness and security. The propos

0