Search Results - (( a permutation generation algorithm ) OR ( java application optimization algorithm ))

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

“…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

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

“…Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. …”
Get full text
Get full text
Get full text

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

“…Case is demonstrated for a new algorithm for lexicographic order permutation. …”
Get full text
Get full text
Get full text

New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

“…Linear array of permutations is hard to be factorised. However, by using a starter set, the process of listing the permutations becomes easy. …”
Get full text
Get full text
Get full text

New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

“…Linear array of permutations is hard to be factorized.However, by using a starter set, the process of listing the permutations becomes easy. …”
Get full text
Get full text
Get full text

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

“…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

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

“…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

A New Substitution Box From Quranic Maqamat by Muhammad Fahim Bin Roslan

A new parallel model for starter sets generation via exchanging two elements by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

“…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
Get full text
Get full text

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

“…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

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

“…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

A DNA-dynamic permutation-diffusion algorithm for image encryption using scaling chaotification models and advanced DNA operations by Alkawsi, Gamal, Khairullah, Mustafa Kamil, Baharuddin, Mohd Zafri, Thabit, Reema, Alomari, Mohammad Ahmed, A. Saif, Faten

“…To overcome these challenges, this paper proposes the DNA-Dynamic Concurrent Permutation-Diffusion Algorithm (DNA-DCP-DA), which introduces four advanced encryption mechanisms. …”
Get full text
Get full text
Get full text
Get full text

New Algorithm for Determinant of Matrices Via Combinatorial Approach by Zake, Lugen M.

Get full text
Get full text
Get full text

Key schedule algorithm based on coordinate geometry of a three-dimensional hybrid cube by Mushtaq, Muhammad Faheem

“…A key schedule algorithm is the mechanism that generates and schedules all session-keys for the encryption process. …”
Get full text
Get full text
Get full text
Get full text

Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop by Ziao, C.Z., Kamaruddin, S.

“…In this paper, total of 50 flow-shop problems were solved with the number of machines and jobs being set at a range of 4 to 25. Whereas the process times of the jobs were randomly generated with range 1 to 10 using Microsoft Excel spreadsheet. …”
Get full text
Get full text

A block cipher based on genetic algorithm by Zakaria, Nur Hafiza

“…In many algorithms which are based on the genetic algorithm approach, diffusion properties using crossover and mutation function are being generated to produce a secure data transmission. …”
Get full text
Get full text
Get full text

A new starter sets generation method by fixing any element under exchange restriction by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni, Sapiri, Hasimah

“…Permutation array are of recent interest because of their application to data transmission over power lines.A new permutation technique based on distinct starter sets by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile a new strategy for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method. …”
Get full text
Get full text

Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

Get full text
Get full text

Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text

Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems by Chong, Zheng Ziao

“…Permutation flow shop problem (PFSP) is one of the commonly reviewed machine environments in scheduling problems. …”
Get full text
Get full text