Preferred Language
Articles
/
alkej-254
Laser Peening on Aluminum Alloy 7049 Using Black Paint Surface Coating
...Show More Authors

Abstract

Black paint laser peening (bPLP) technique is currently applied for many engineering materials , especially for aluminum alloys due to high improvement in fatigue life and strength . Constant and variable   bending fatigue tests have been performed at RT and stress ratio R= -1 . The results of the present  work observed that the significance of the surface work hardening which generated high negative residual stresses in bPLP specimens .The fatigue life  improvement factor (FLIF)  for bPLP constant fatigue behavior was from 2.543 to 3.3 compared to untreated  fatigue and the increase in fatigue strength at 107 cycle was 21% . The bPLP cumulative fatigue life behavior was improved by 1.786 at L-H and 1.55 at H-L due to black paint coating .

 Keywords: Constant and variable fatigue behavior , Black paint laser peening , 7049 Al- alloy .

View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Mar 08 2021
Journal Name
Baghdad Science Journal
edge detection using modification prewitt operators
...Show More Authors

in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators

View Publication Preview PDF
Crossref
Publication Date
Sat Oct 11 2025
Journal Name
Journal Of Engineering
Drag Reduction by using Anionic Surfactants
...Show More Authors

View Publication
Publication Date
Wed Jun 29 2022
Journal Name
Journal Of The College Of Education For Women
Using Online Platforms to Improve Writing
...Show More Authors

Due to the difficulties that Iraqi students face when writing in the English language, this preliminary study aimed to improve students' writing skills by using online platforms remotely. Sixty first-year students from Al-Furat Al–Awsat Technical University participated in this study. Through these platforms, the researchers relied on stimuli, such as images, icons, and short titles to allow for deeper and more accurate participations. Data were collected through corrections, observations, and feedback from the researchers and peers. In addition, two pre and post-tests were conducted. The quantitative data were analysed by SPSS statistical Editor, whereas the qualitative data were analyzed using the Piot table, an Excel sheet. The resu

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Feb 04 2015
Journal Name
The Second Biological Science Conference
Bioethanol Production Using Date Syrup Wastes
...Show More Authors

Publication Date
Wed Jan 30 2019
Journal Name
Journal Of The College Of Education For Women
Image Hiding Using Discrete Cosine Transform
...Show More Authors

Steganography is a mean of hiding information within a more obvious form of
communication. It exploits the use of host data to hide a piece of information in such a way
that it is imperceptible to human observer. The major goals of effective Steganography are
High Embedding Capacity, Imperceptibility and Robustness. This paper introduces a scheme
for hiding secret images that could be as much as 25% of the host image data. The proposed
algorithm uses orthogonal discrete cosine transform for host image. A scaling factor (a) in
frequency domain controls the quality of the stego images. Experimented results of secret
image recovery after applying JPEG coding to the stego-images are included.

View Publication Preview PDF
Publication Date
Fri Jan 01 2016
Journal Name
Ssrn Electronic Journal
Human Mobility Patterns Modelling Using Cdrs
...Show More Authors

View Publication
Crossref
Publication Date
Mon Jan 02 2012
Journal Name
Ibn Al-haitham Journal For Pure And Applied Science
Image encryption technique using Lagrange interpolation
...Show More Authors

Publication Date
Tue Nov 21 2017
Journal Name
Lecture Notes In Computer Science
Emotion Recognition in Text Using PPM
...Show More Authors

In this paper we investigate the automatic recognition of emotion in text. We propose a new method for emotion recognition based on the PPM (PPM is short for Prediction by Partial Matching) character-based text compression scheme in order to recognize Ekman’s six basic emotions (Anger, Disgust, Fear, Happiness, Sadness, Surprise). Experimental results with three datasets show that the new method is very effective when compared with traditional word-based text classification methods. We have also found that our method works best if the sizes of text in all classes used for training are similar, and that performance significantly improves with increased data.

View Publication
Scopus (6)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Sun Jun 06 2010
Journal Name
Baghdad Science Journal
Using Neural Network with Speaker Applications
...Show More Authors

In Automatic Speech Recognition (ASR) the non-linear data projection provided by a one hidden layer Multilayer Perceptron (MLP), trained to recognize phonemes, and has previous experiments to provide feature enhancement substantially increased ASR performance, especially in noise. Previous attempts to apply an analogous approach to speaker identification have not succeeded in improving performance, except by combining MLP processed features with other features. We present test results for the TIMIT database which show that the advantage of MLP preprocessing for open set speaker identification increases with the number of speakers used to train the MLP and that improved identification is obtained as this number increases beyond sixty.

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
Bilinear System Identification Using Subspace Method
...Show More Authors

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .

View Publication Preview PDF
Crossref