Preferred Language
Articles
/
joe-1940
Dual Stages of Speech Enhancement Algorithm Based on Super Gaussian Speech Models
...Show More Authors

Various speech enhancement Algorithms (SEA) have been developed in the last few decades. Each algorithm has its advantages and disadvantages because the speech signal is affected by environmental situations. Distortion of speech results in the loss of important features that make this signal challenging to understand. SEA aims to improve the intelligibility and quality of speech that different types of noise have degraded. In most applications, quality improvement is highly desirable as it can reduce listener fatigue, especially when the listener is exposed to high noise levels for extended periods (e.g., manufacturing). SEA reduces or suppresses the background noise to some degree, sometimes called noise suppression algorithms. In this research, the design of SEA based on different speech models (Laplacian model or Gaussian model) has been implemented using two types of discrete transforms, which are Discrete Tchebichef Transform and Discrete Tchebichef-Krawtchouk Transforms. The proposed estimator consists of dual stages of a wiener filter that can effectively estimate the clean speech signal. The evaluation measures' results show the proposed SEA's ability to enhance the noisy speech signal based on a comparison with other types of speech models and a self-comparison based on different types and levels of noise. The presented algorithm's improvements ratio regarding the average SNRseq are 1.96, 2.12, and 2.03 for Buccaneer, White, and Pink noise, respectively.

Crossref
View Publication Preview PDF
Quick Preview PDF
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

... Show More
View Publication
Publication Date
Wed Feb 01 2023
Journal Name
Baghdad Science Journal
3-D Packing in Container using Teaching Learning Based Optimization Algorithm
...Show More Authors

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (4)
Crossref (2)
Scopus 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 (10)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Engineering
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks
...Show More Authors

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

... Show More
View Publication Preview PDF
Publication Date
Tue May 28 2019
Journal Name
Al-khwarizmi Engineering Journal
Heuristic D* Algorithm Based on Particle Swarm Optimization for Path Planning of Two-Link Robot Arm in Dynamic Environment
...Show More Authors

 Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)

... Show More
View Publication Preview PDF
Crossref (7)
Crossref
Publication Date
Thu Jan 13 2022
Journal Name
Medical & Biological Engineering & Computing
An integrated entropy-spatial framework for automatic gender recognition enhancement of emotion-based EEGs
...Show More Authors

View Publication
Scopus (11)
Crossref (12)
Scopus Clarivate Crossref
Publication Date
Thu Dec 14 2023
Journal Name
Iete Journal Of Research
Performance Enhancement of VLC-NOMA Employing Beamforming Function based vehicle-to-multivehicle Communication system
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Advanced Computer Science And Applications
Proposed an Adaptive Bitrate Algorithm based on Measuring Bandwidth and Video Buffer Occupancy for Providing Smoothly Video Streaming
...Show More Authors

View Publication
Scopus (7)
Crossref (2)
Scopus Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Efficient Task Scheduling Approach in Edge-Cloud Continuum based on Flower Pollination and Improved Shuffled Frog Leaping Algorithm
...Show More Authors

The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. E

... Show More
View Publication Preview PDF
Scopus (3)
Scopus Crossref