Preferred Language
Articles
/
dRZvBocBVTCNdQwCtC9B
Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm
...Show More Authors

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. This study presents a hybrid greedy hill climbing algorithm (HGHC) that ensures both effectiveness and near-optimal results for generating a small number of test data. To make certain that the suggested HGHC outperforms the most used techniques in terms of test size. It is compared to others in order to determine its effectiveness. In contrast to recent practices utilized for the production of covering arrays (CAs) and mixed covering arrays (MCAs), this hybrid strategy is superior since allowing it to provide the utmost outcome while reducing the size and limit the loss of unique pairings in the CA/MCA generation.</p>

Scopus Crossref
View Publication
Publication Date
Tue Jun 04 2024
Journal Name
Computation
High-Performance Krawtchouk Polynomials of High Order Based on Multithreading
...Show More Authors

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

... Show More
View Publication
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sat Jul 09 2022
Journal Name
Wireless Communications And Mobile Computing
An Optimized Approach for Industrial IoT Based on Edge Computing
...Show More Authors

The Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t

... Show More
View Publication
Scopus (4)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Wed Jul 01 2015
Journal Name
Journal Of Engineering
Pharmaceutical Wastewater Treatment Associated with Renewable Energy Generation in Microbial Fuel Cell Based on Mobilized Electroactive Biofilm on Zeolite Bearer
...Show More Authors

In this study, a novel application of lab-scale dual chambered air-cathode microbial fuel cell (MFC) has been developed for simultaneous bio-treatment of real pharmaceutical wastewater and renewable electricity generation. The microbial fuel cell (MFC) was provided with zeolite-packed anodic compartment and a cation exchange membrane (CEM) to separate the anode and cathode. The performance of the proposed MFC was evaluated in terms of COD removal and power generation based on the activity of the bacterial consortium in the biofilm mobilized on zeolite bearer. The MFC was fueled with real pharmaceutical wastewater having an initial COD concentration equal to 800 mg/L and inoculated with anaerobic aged sludge. Results demo

... Show More
View Publication Preview PDF
Publication Date
Thu Oct 03 2024
Journal Name
Phi Delta Kappan
Literacy-based instruction in STEM
...Show More Authors

Socio-scientific issues provide a great platform to both engage students in scientific topics and assess their understanding of scientific concepts. Nancy R. Singer, Amy Lannin, Maha Kareem, William Romine, and Katie Kline report on the STEM Literacy Project, a three-year National Science Foundation grant that aimed to improve STEM teachers’ knowledge and integration of literacy in their classrooms. They describe teachers’ professional learning, scenario-based assessments and other strategies they incorporated in their STEM classrooms, and how writing enables students to understand real-world issues.

View Publication
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Engineering And Technology Journal
Face Retrieval Using Image Moments and Genetic Algorithm
...Show More Authors

Publication Date
Fri Sep 03 2021
Journal Name
Entropy
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

... Show More
View Publication
Scopus (35)
Crossref (32)
Scopus Clarivate Crossref
Publication Date
Mon Apr 26 2021
Journal Name
Journal Of Real-time Image Processing
Fast and efficient recursive algorithm of Meixner polynomials
...Show More Authors

View Publication
Scopus (33)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Thu Dec 31 2015
Journal Name
Al-khwarizmi Engineering Journal
Hexapod Robot Static Stability Enhancement using Genetic Algorithm
...Show More Authors

Abstract

Hexapod robot is a flexible mechanical robot with six legs. It has the ability to walk over terrain. The hexapod robot look likes the insect so it has the same gaits. These gaits are tripod, wave and ripple gaits. Hexapod robot needs to stay statically stable at all the times during each gait in order not to fall with three or more legs continuously contacts with the ground. The safety static stability walking is called (the stability margin). In this paper, the forward and inverse kinematics are derived for each hexapod’s leg in order to simulate the hexapod robot model walking using MATLAB R2010a for all gaits and the geometry in order to derive the equations of the sub-constraint workspaces for each

... Show More
View Publication Preview PDF
Publication Date
Fri Apr 20 2012
Journal Name
International Journal Of Computer And Information Engineering
An Optimal Algorithm for HTML Page Building Process
...Show More Authors

An Optimal Algorithm for HTML Page Building Process

View Publication Preview PDF
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption
...Show More Authors

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

... Show More
View Publication
Scopus (15)
Crossref (4)
Scopus Crossref