Fine aggregate (Sand) is a necessary material used in concrete construction purposes, it’s naturally available and it’s widely used around the world for different parts of construction in any building mainly for filling the voids between gravel. Sand gradation is important for different composite materials, and it gives good cohesion when compared with coarse sand that provides strength for the building. Therefore, sand is necessary to be tested before it is used and mixed with other building materials in construction and the specimen must be selected carefully to represent the real material in the field. The specimen weight must be larger than the required weight for test. When the weight of the sand sample increases the approximate precision desired increases. In this study, an approximated multilinear function for Fuller’s curve on the logarithmic scale was used to simulate the fine aggregate (sand) numerically. In order to get the effect of different samples, a stochastic analysis was done by employing 100 realizations of specimens, has been conducted to study the effect of sampling on sieve analysis and the root mean square error (RMSE) for the variation between desired and sampled curves. Then the results were compared with available specifications recommendations.
Increasing world demand for renewable energy resources as wind energy was one of the goals behind research optimization of energy production from wind farms. Wake is one of the important phenomena in this field. This paper focuses on understanding the effect of angle of attack (α) on wake characteristics behind single horizontal axis wind turbines (HAWT). This was done by design three rotors different from each other in value of α used in the rotor design process. Values of α were (4.8˚,9.5˚,19˚). The numerical simulations were conducted using Ansys Workbench 19- Fluent code; the used turbulence model was (k-ω SST). The results showed that best value for extracted wind energy was at α=19˚, spread distance of wak
... Show MoreThe aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
The aim of the present study was to distinguish between healthy children and those with epilepsy by electroencephalography (EEG). Two biomarkers including Hurst exponents (H) and Tsallis entropy (TE) were used to investigate the background activity of EEG of 10 healthy children and 10 with epilepsy. EEG artifacts were removed using Savitzky-Golay (SG) filter. As it hypothesize, there was a significant changes in irregularity and complexity in epileptic EEG in comparison with healthy control subjects using t-test (p< 0.05). The increasing in complexity changes were observed in H and TE results of epileptic subjects make them suggested EEG biomarker associated with epilepsy and a reliable tool for detection and identification of this di
... Show MoreOne study whose importance has significantly grown in recent years is lip-reading, particularly with the widespread of using deep learning techniques. Lip reading is essential for speech recognition in noisy environments or for those with hearing impairments. It refers to recognizing spoken sentences using visual information acquired from lip movements. Also, the lip area, especially for males, suffers from several problems, such as the mouth area containing the mustache and beard, which may cover the lip area. This paper proposes an automatic lip-reading system to recognize and classify short English sentences spoken by speakers using deep learning networks. The input video extracts frames and each frame is passed to the Viola-Jone
... Show MoreThis article investigates how an appropriate chaotic map (Logistic, Tent, Henon, Sine...) should be selected taking into consideration its advantages and disadvantages in regard to a picture encipherment. Does the selection of an appropriate map depend on the image properties? The proposed system shows relevant properties of the image influence in the evaluation process of the selected chaotic map. The first chapter discusses the main principles of chaos theory, its applicability to image encryption including various sorts of chaotic maps and their math. Also this research explores the factors that determine security and efficiency of such a map. Hence the approach presents practical standpoint to the extent that certain chaos maps will bec
... Show MoreIn this study, chemical oxidation was employed for the synthesis of polypyrrole (PPy) nanofiber. Furthermore, PPy has been subjected to treatment using nanoparticles of neodymium oxide (Nd2O3), which were produced and added in a certain ratio. The inquiry centered on the structural characteristics of the blend of polypyrrole and neodymium oxide after their combination. The investigation utilises X-ray diffraction (XRD), FTIR, and Field Emission Scanning Electron Microscopy (FE-SEM) for PPy, 10%, 30%, and 50% by volume of Nd2O3. According to the electrochemical tests, it has been noted that the nanocomposites exhibit a substantial amount of pseudocapacitive activity.
In this study, 191 specimens of insects that infect species of the Fabaceae family, including:
Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us
... Show More