The follower of the art of Arabic calligraphy accurately identifies three prominent dimensions that have framed the dimensions of this art, the functional dimension and the aesthetic dimension, the last of which is the expressive dimension, as it is an art that does not exhaust its aesthetic and indicative purposes because of its possibilities and characteristics that help it to form with any entity designed by calligrapher, with the expressive dimension of the most important of those The dimensions that can be studied within multiple variables, the most important of which are the significance of the text, the spatial and formal organization of the calligraphic functions and the power of the idea from which the calligraphic formation eme

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

In this paper, the generation of a chaotic carrier by Lorenz model
is theoretically studied. The encoding techniques has been used is
chaos masking of sinusoidal signal (massage), an optical chaotic
communications system for different receiver configurations is
evaluated. It is proved that chaotic carriers allow the successful
encoding and decoding of messages. Focusing on the effect of
changing the initial conditions of the states of our dynamical system
e.i changing the values (x, y, z, x1, y1, and z1).

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