The progress of network and multimedia technologies has been phenomenal during the previous two decades. Unauthorized users will be able to copy, retransmit, modify reproduction, and upload the contents more easily as a result of this innovation. Malicious attackers are quite concerned about the development and widespread use of digital video. Digital watermarking technology gives solutions to the aforementioned problems. Watermarking methods can alleviate these issues by embedding a secret watermark in the original host data, allowing the genuine user or file owner to identify any manipulation. In this study, lots of papers have been analyzed and studied carefully, in the period 2011–2022. The historical basis of the subject shou

Eminent figures in Quranic studies in the fourth century of the Hegira, in his
copacity as the founder of the essentials of the indicative approach in interpretation
which is based on the consideration of research principles in interpretation science.
Al-Qushayri participated in clarifying the promotions of this approach in his
works which represent this approach. The mast distinguished of these works is
Tafseer Lataef Al-Isharat. The researcher examined the characteristics of this
approach and its effect on the interpretative movement in Al-Qushayri age an come to
employ them as a practical example for the indicative approach in studying the
interpretation mebods in Islamic sciences.

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

This paper presents the application of a framework of fast and efficient compressive sampling based on the concept of random sampling of sparse Audio signal. It provides four important features. (i) It is universal with a variety of sparse signals. (ii) The number of measurements required for exact reconstruction is nearly optimal and much less then the sampling frequency and below the Nyquist frequency. (iii) It has very low complexity and fast computation. (iv) It is developed on the provable mathematical model from which we are able to quantify trade-offs among streaming capability, computation/memory requirement and quality of reconstruction of the audio signal. Compressed sensing CS is an attractive compression scheme due to its uni

HR Al-Hamami, AA Noaimi, MM Al-Waiz, AS Al-Kabraty, Iraqi Postgraduate Medical Journal, 2010 - Cited by 4

AH Haider R, N Adil A, AW Makram M, AK Abdulkaleq S, 2010

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process