Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm by Abu Zitar, Raed

“…Therefore, the smaller the difference between the selected pixels and the more correlation between two consecutive pixels, the less distortion can be achieved in the image after embedding the secret data. This paper proposes a multilayer RDH method using the multilevel thresholding technique to reduce the difference value in pixels and increase the visual quality and the embedding capacity. …”
Get full text

An algorithm for solving bond pricing problem by Dibeh, Ghassan

Get full text
Get full text
Get full text
Get full text

Damage assessment & recovery from malicious transactions using data dependency for deffensive information warfare. (c2006) by Zeitunlian, Arda

Get full text
Get full text

A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology by Jaber, Mohammad

“…Numerous damage assessment and recovery algorithms have been proposed in the literature. In this work, we present a distributed algorithm that uses blockchain technology and hash tables to solve the information warfare problem in healthcare systems. …”
Get full text
Get full text
Get full text

Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text

An evolutionary algorithm for solving the geometrically constrained site layout problem by Zouein, P.

“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text

A combined algorithm based on finite elements and a modified methodof characteristics for the analysis of the corona in wire-ductelectrostatic precipitators by Al-Hamouz, Z.M.

Get full text
Get full text

Bird’s Eye View feature selection for high-dimensional data by Samir Brahim Belhaouari (16855434)

“…This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …”

Modified clarke wright algorithms for solving the realistic vehicle routing problem by Shour, Amina

Get full text
Get full text
Get full text
Get full text

Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text

Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities by Zouein, P. P.

“…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
Get full text
Get full text
Get full text

Stochastic Search Algorithms for Exam Scheduling by Mansour, Nashat

“…Then, we empirically compare the three proposed algorithms and FESP using realistic data. …”
Get full text
Get full text

A reduced model for phase-change problems with radiation using simplified PN approximations by Belhamadia, Youssef

“…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
Get full text

Development of an Optimization Algorithm for Internet Data Traffic by Misbahuddin, Syed

“…In this paper, an optimization algorithm is proposed to reduce net data traffic, which works at Internet layer in the TCP/IP reference model. …”
Get full text

Towards Scalable Process Mining Pipelines by Mohamed, Belal

“…Contributions have covered the spectrum of better algorithms, richer comparison metrics, and movement towards online analysis for process data. …”
Get full text
Get full text
Get full text

Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms by Abdelouahed Hamdi (14158899)

“…Therefore, in this study we examined this market based on the price index of the automotive group, then optimized a portfolio of automotive companies using two methods. In the first method, the CVaR measurement was modeled by means of DEA, then Particle Swarm Optimization (PSO) and the Imperial Competitive Algorithm (ICA) were used to solve the proposed model. …”

On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

Subjects:

Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm by Nasser, Youssef

“…Among these, K-means is widely used for efficiently solving clustering problems. …”
Get full text
Get full text
Get full text

Physical optimization algorithms for mapping data to distributed-memory multiprocessors by Mansour, Nashat

“…We present three parallel physical optimization algorithms for mapping data to distributed-memory multiprocessors, concentrating on irregular loosely synchronous problems. …”
Get full text
Get full text
Get full text

Evolutionary algorithms for state justification in sequential automatic test pattern generation by El-Maleh, Aiman H.

“…A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text