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

Refine Results
  1. 1

    Genetic ensemble biased ARTMAP method of ECG-Based emotion classification by Loo, C.K., Liew, W.S., Sayeed, M.S.

    Published 2012
    “…The ARTMAP system is dependent on training sequence presentation to determine the effectiveness of the learning processes, as well as the strength of the biasing parameter, lambda λ. The optimal combination of λ and training sequence can be computed efficiently using a genetic permutation algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  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. This novel algorithm applies coefficients scrambling using Combined-Reverse-and-Normal-Direction (CRND) scanning together with Distorted DC permutation (DDP). …”
    Get full text
    Get full text
    Thesis
  3. 3

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

    Published 2021
    “…This paper presents the use of factorial numbers for generating starter sets where starter sets are used for listing permutation. 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
  4. 4

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    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
  6. 6

    Parallel strategy for starter sets to list all permutation based on cycling restriction by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar

    Published 2011
    “…This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    A permutation parallel algorithm under exchange restriction with message passing interface by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2014
    “…Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    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
  9. 9

    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
  10. 10

    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
  11. 11

    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
  12. 12

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

    Published 2018
    “…The proposed method is tested on 10 multi-objective benchmark problems of CEC 2009 and compared with four metaheuristics: Multi-Objective Grey Wolf Optimizer (MOGWO), Multi-Objective Evolutionary Algorithm Based on Decomposition (MOEA/D), Multi-Objective Differential Evolution (MODE) and MOPSO. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Permutation entropy based full-reference image quality qssessment by Baqar, Mohtashim *, Lau, Sian Lun *, Mansoor Ebrahim

    Published 2019
    “…Motivated by the need of appropriate objective models, we propose a novel objective IQA algorithm, namely, Permutation Entropy Deviation Index (PEDI), based on the working principle of permutation entropy (PE). …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Parameter Estimation Using Improved Differential Evolution And Bacterial Foraging Algorithms To Model Tyrosine Production In Mus Musculus(Mouse) by Jia, Xing Yeoh, Chuii, Khim Chong, Mohd Saberi, Mohamad, Yee, Wen Choon, Lian, En Chai, Safaai, Deris, Zuwairie, Ibrahim

    Published 2015
    “…The hybrid of Differential Evolution algorithm with Kalman Filtering and Bacterial Foraging algorithm is a novel global optimisation method implemented to obtain the best kinetic parameter value. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    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
  17. 17

    Differential evolution optimization algorithm based on generation systems reliability assessment integrated with wind energy by Kadhem, Athraa Ali, Abdul Wahab, Noor Izzri, Abdalla, Ahmed N.

    Published 2019
    “…This stuffy proposed a novel optimization method labeled the "Differential Evolution Optimization Algorithm" (DEOA) to assess the reliability of power generation systems (PGS). …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Multiobjective optimization of bioethanol production via hydrolysis using hopfield- enhanced differential evolution by Ganesan, T., Elamvazuthi, I., Shaari, K.Z.K., Vasant, P.

    Published 2014
    “…In this chapter, the weighted sum scalarization approach is used in conjunction with three meta-heuristic algorithms: Differential Evolution (DE), Hopfield-Enhanced Differential Evolution (HEDE), and Gravitational Search Algorithm (GSA). …”
    Get full text
    Get full text
    Book
  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

    HEAT EXCHANGER NETWORK SYNTHESIS AND OPTIMIZATION BY PINCH ANALYSIS AND DIFFERENTIAL EVOLUTION METHOD by NGO , THI PHUONG THUY

    Published 2016
    “…This metadology way uses an algorithm which combines Pinch Design Method and Differential Evolution Method. …”
    Get full text
    Get full text
    Thesis