A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th

   The removal of Ibuprofen antibiotics (IBU) by photo-degradation UV/H₂O₂/Fe⁺² system was investigated in a batch reactor under different initial concentrations of H₂O₂ (100-500) mg/L, Fe⁺² (10-40) mg/L, pH (3-9) and initial concentrations of IBU (10-80) mg/L, and their relationship with the degradation efficiency were studied. The result demonstrated that the maximum elimination of IBU was 85.54% achieved at 300 mg/L of H₂O₂, 30 mg/L of Fe⁺², pH=3, and irradiation time of 150 min, for 10 mg/L of IBU. The results have shown that the oxidation reagent H₂O₂ plays a very important role in IBU degradation.

Many academics have concentrated on applying machine learning to retrieve information from databases to enable researchers to perform better. A difficult issue in prediction models is the selection of practical strategies that yield satisfactory forecast accuracy. Traditional software testing techniques have been extended to testing machine learning systems; however, they are insufficient for the latter because of the diversity of problems that machine learning systems create. Hence, the proposed methodologies were used to predict flight prices. A variety of artificial intelligence algorithms are used to attain the required, such as Bayesian modeling techniques such as Stochastic Gradient Descent (SGD), Adaptive boosting (ADA), Deci

The current standard for treating pilonidal sinus (PNS) is surgical intervention with excision of the sinus. Recurrence of PNS can be controlled with good hygiene and regular shaving of the natal cleft, laser treatment is a useful adjunct to prevent recurrence. Carbon dioxide (CO2) laser is a gold standard of soft tissue surgical laser due to its wavelength (10600 nm) thin depth (0.03mm) and collateral thermal zone (150mic).It effectively seals blood vessels, lymphatic, and nerve endings, Moreover wound is rendered sterile by effect of laser. Aim of this study was to apply and assess the clinical usefulness of CO2 10600nm laser in pilonidal sinus excision and decrease chance of recurrence. Design: For 10 patients, between 18 and 39 year

In this study, a chaotic method is proposed that generates S-boxes similar to AES S-boxes with the help of a private key belonging to

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the produ

Three-dimensional (3D) image and medical image processing, which are considered big data analysis, have attracted significant attention during the last few years. To this end, efficient 3D object recognition techniques could be beneficial to such image and medical image processing. However, to date, most of the proposed methods for 3D object recognition experience major challenges in terms of high computational complexity. This is attributed to the fact that the computational complexity and execution time are increased when the dimensions of the object are increased, which is the case in 3D object recognition. Therefore, finding an efficient method for obtaining high recognition accuracy with low computational complexity is essentia

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.