Search Results - (( using permutation based algorithm ) OR ( evolution optimization based algorithm ))

Refine Results
  1. 1
  2. 2

    JPEG Image Encryption Using Combined Reversed And Normal Direction-Distorted Dc Permutation With Key Scheduling Algorithm-Based Permutation by Abu, Ahmad Zaidee

    Published 2008
    “…The proposed approach uses a frequency domain combinational framework of coefficients scrambling with Key Scheduling Algorithm based (KSA-based) permutation. …”
    Get full text
    Get full text
    Thesis
  3. 3

    New algorithm for listing all permutations by Ibrahim, Haslinda, Omar, Zurni, Mohd Rohni, Azizah

    Published 2010
    “…The most challenging task dealing with permutation is when the element is large. In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation by Karim, Sharmila, Ibrahim, Haslinda

    Published 2021
    “…Previously starter sets are generated by using their permutation under exchange-based and cycling based. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Improved Watermarking Algorithm Based on Discrete Wavelet Transform and Fibonacci Permutation by Salem Hussin, Saleh Hussin

    Published 2005
    “…This algorithm is based on the combination of Fibonacci permutation and discrete wavelet transforms (DWT). …”
    Get full text
    Get full text
    Thesis
  6. 6

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…Listing of all n! distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Reliably optimal PMU placement using disparity evolution-based genetic algorithm by Matsukawa, Yoshiaki, Othman, Mohammad Lutfi, Watanabe, Masayuki, Mitani, Yasunori

    Published 2017
    “…In this paper, Disparity Evolution-type Genetic Algorithm (DEGA) based on disparity theory of evolution is applied. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    A refined differential evolution algorithm for improving the performance of optimization process by A. R., Yusoff, Nafrizuan, Mat Yahya

    Published 2011
    “…DE is developed based on an improved Genetic Algorithm and come with different strategies for faster optimization. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    A new modified differential evolution algorithm scheme-based linear frequency modulation radar signal de-noising by Al-Dabbagh, Mohanad Dawood, Al-Dabbagh, Rawaa Dawoud, Raja Abdullah, Raja Syamsul Azmir, Hashim, Fazirulhisyam

    Published 2015
    “…The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. …”
    Get full text
    Get full text
    Article
  10. 10

    Application of swarm intelligence optimization on bio-process problems / Mohamad Zihin Mohd Zain by Mohamad Zihin , Mohd Zain

    Published 2018
    “…BSA gave the best overall performance by showing improved solutions and more robust convergence in comparison with various metaheuristics used in this work. Multi-objective optimization problems are also addressed by proposing a modified multi-criterion optimization algorithm based on a Pareto-based Particle Swarm Optimization (PSO) algorithm called Multi-Objective Particle Swarm Optimization (MOPSO). …”
    Get full text
    Get full text
    Thesis
  11. 11

    Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

    Published 2020
    “…In this study, the BSCCH algorithm has been coupled with Differential Evolution algorithm as a proof of concept because it is found to be an efficient algorithm in the literature for constrained optimization problems. …”
    Get full text
    Get full text
    Article
  12. 12
  13. 13

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Dynamic S-boxes and spiral permutation function on Fibonacci sequence for secure block cipher / Kamsiah Mohamed by Mohamed, Kamsiah

    Published 2022
    “…In this thesis, the Spiral Fibonacci is proposed for a permutation function to diffuse bit permutation in improving cryptography algorithm efficiency. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Crossover-first differential evolution for improved global optimization in non-uniform search landscapes by Teo, Jason Tze Wi, Mohd Hanafi Ahmad Hijazi, Hui, Keng Lau, Salmah Fattah, Aslina Baharum

    Published 2015
    “…The differential evolution (DE) algorithm is currently one of the most widely used evolutionary-based optimizers for global optimization due to its simplicity, robustness and efficiency. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18

    Hybrid differential evolution-particle swarm optimization algorithm for multi objective urban transit network design problem with homogeneous buses by Tarajo, Buba Ahmed, Lee, Lai Soon

    Published 2019
    “…This paper proposes a hybrid differential evolution with particle swarm optimization (DE-PSO) algorithm to solve the UTNDP, aiming to simultaneously optimize route configuration and service frequency with specific objectives in minimizing both the passengers’ and operators’ costs. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A cylindrical coordinate system with dynamic permutation table for blowfish algorithm by Al-Abiachi, Ashwak M., Mahmod, Ramlan, Ahmad, Faudziah

    Published 2014
    “…The Blowfish Algorithm (BA) is a symmetric block cipher that iterates simple encryption and decryption functions by using Feistel networks.BA keys vary from 32-448 bits to ensure a high level of security.However, the BA requires a high memory percentage and it has a problem regarding randomness of output with text and image files having large strings of identical bytes.One solution to the seissues is to design a new Cryptography algorithm based on the BA that incorporates an F-function into a Cylindrical Coordinate System (CCS).The resulting F-function is known as a CCS with a Dynamic Permutation Table (DPT) or CCSDPT whereas the new algorithm is called the New BA (NBA).The objectives of the CCSDPT are to reduce memory requirements, enhance the randomness of the output and increase resistance to attacks through byte relocation and transformation in the right cylinder.NBA is evaluated by investigates the output of the algorithm by using statistical tests from the National Institute of Standard and Technology (NIST) with five types of data and compared with the BA.The findings of the NIST tests show that the NBA is suitable for any data stream, even those with long strings of identical bytes. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Nonlinear identification of a small scale unmanned helicopter using optimized NARX network with multiobjective differential evolution by Tijani, Ismaila B., Akmeliawati, Rini, Legowo, Ari, Budiyono, Agus

    Published 2014
    “…This study proposes a hybrid of conventional back propagation training algorithm for the NARX network and multiobjective differential evolution (MODE) algorithm for identification of a nonlinear model of an unmanned small scale helicopter from experimental flight data.The proposed hybrid algorithm was able to produce models with Pareto-optimal compromise between the design objectives. …”
    Get full text
    Get full text
    Get full text
    Article