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 universality and lack of complexity on the sensor side. In this paper a study of applying compressed sensing on audio signals was presented. The performance of different bases and its reconstruction are investigated, as well as exploring its performance. Simulations results are present to show the efficient reconstruction of sparse audio signal. The results shows that compressed sensing can dramatically reduce the number of samples below the Nyquist rate keeping with a good PSNR.
BSTRACT: BACKGROUND: Acne vulgaris(AV)is chronic inflammatory disease of pilosebaceous unit of young people. Patients with acne with or with out scarring might differ in regard to their immunological background from those free from acne. OBJECTIVES: To evaluate the problem of facial AV especially patients with scarring and to determine the frequency of associated skin diseases and to be compared with acne free control. METHODS: A cross sectional randomized controlled epidemiological study was conducted from Oct.2005-Oct. 2006.Three hundred students from Basra University; 132 (44%) males and 168 (56%) females were enrolled, their ages ranged from 18-25 (20.9±1.8) years. They were divided into: Group A those free from acne (98 individuals),G
... Show MoreS Khalifa E, AH Khalil I, N Adil A, AB Razan A…, 2009
(15)
(12)
(8)
(2)
In this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi
... Show More
(2)
(1)
(5)
(2)
In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an
... Show More
(13)
(6)
(30)
(23)
(2)
(1)
(5)
(3)