Preferred Language
Articles
/
shf2L48BVTCNdQwCGV4T
AN ENHANCED EVOLUTIONARY ALGORITHM WITH LOCAL HEURISTIC APPROACH FOR DETECTING COMMUNITY IN COMPLEX NETWORKS
...Show More Authors

Scopus
Preview PDF
Quick Preview PDF
Publication Date
Tue Apr 18 2023
Journal Name
Al–bahith Al–a'alami
The Visual intertextuality of normalization with Israel in websites of oriented satellite channels: An Analytical study of Al Hurrah Channel
...Show More Authors

The research aims to reveal the methods of visual intertextuality used in the websites of the oriented satellite channel which is Arabic-speaking when addressing normalization with Israel. It also indicates the sources and types of intertextual images, the methodological and semiotic mechanisms for analyzing the intertextuality of news images used on the website of Alhurra satellite channel for the period from 1/6 - 30/8/2022, which included (94) images. The researcher analyzed (37) images with intertextual dimensions, excluding (57) images, which did not carry connotations connected with the inputs and objectives of the research.

The research reach

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Sat Jan 03 2026
Journal Name
Journal Of Baghdad College Of Dentistry
Shear bond strength of endodontic sealers to dentin with and without smear layer and gutta percha (An in vitro study)
...Show More Authors

Background: The bond strength of root canal sealers to dentin and gutta-percha seems to be an important property for maintaining the stability of root canal filling, which potentially influences both leakage and root strength. The objective of this, in vitro, study was to evaluate the shear bond strength of three different endodontic sealers (Gutta-Flow, AH Plus, Apexit Plus) to dentin, in the presence and absence of the smear layer and gutta percha. Material and Methods: After slicing off the occlusal 2mm of 60 extracted human maxillary premolar teeth, the exposed dentin served as the tested surfaces; the teeth were fixed with cold cure acrylic, and were divided into two groups according to the smear layer presence, group A without smear

... Show More
View Publication Preview PDF
Publication Date
Sun Oct 15 2023
Journal Name
Sumer 3
Treatment of shallow and deep white spot lesions with three different mouthwashes evaluated by laser fluorescence (an in vitro study)
...Show More Authors

This research aims to find how three different types of mouthwashes affect the depth of artificial white spot lesions. Teeth with various depths of white spot lesions were immersed in either splat mouthwash, Biorepair mouthwash, Sensodyne mouthwash, or artificial saliva (control)twice daily for one minute for 4 weeks and 8 weeks at 37°C. After this immersion procedure, lesion depth was measured using a diagnosed pen score. A one-way analysis of variance, Dunnett T3 and Tukey's post hoc α = .05 were used to analyze the testing data. Splat mouthwash enhanced the WSL remineralization and made the lowest ΔF compared with other mouthwashes in shallow and deep enamel after 4 and 8 weeks of treatment. In the repair groups, after 4 weeks

... Show More
View Publication Preview PDF
Crossref (1)
Scopus Crossref
Publication Date
Sat Jan 03 2026
Journal Name
Journal Of Baghdad College Of Dentistry
An evaluation of three fissure sealants microleakage with presence or absence of bonding agent through time intervals (In vitro study)
...Show More Authors

Background: Pit and fissure sealant have been considered an outstanding adjunct to oral health care in the decrease of occlusal caries onset and low progression. The aims of this in vitro study were to evaluate the marginal microleakage of three different types of fissure sealants (SDI, Tg and tetric N-flow) by time interval, one day and 45 days, in the presence or absence of bonding agent among maxillary and mandibular teeth. Materials and methods: Seventy two sound human maxillary and mandibular first premolar teeth were collected which were free from obvious carious lesions. The teeth were randomly divided into two main equal groups, group (1) and group (2), each group consists of (36) teeth involving equal numbers of maxillary and mandi

... Show More
View Publication Preview PDF
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Science
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm
...Show More Authors

Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (44)
Crossref (43)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Aug 01 2011
Journal Name
Journal Of Engineering
IMPLEMENTATION OF ROOT FINDING ALGORITHM OF MINIMUM PHASE FILTER USING VHDL
...Show More Authors

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Sep 30 2013
Journal Name
International Journal Of Network Security & Its Applications
Evaluating the Performance of the Secure Block Permutation Image Steganography Algorithm
...Show More Authors

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
CTJ: Input-Output Based Relation Combinatorial Testing Strategy Using Jaya Algorithm
...Show More Authors

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing appli

... Show More
View Publication Preview PDF
Scopus (12)
Crossref (7)
Scopus Clarivate Crossref