Search Results - (( developing permutation based algorithm ) OR ( java application based algorithm ))

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

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

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

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

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. In conclusion, this new development is only applicable for generating starter sets as a lexicographic order permutation due to factorial numbers is applicable for lexicographic order permutation…”
Get full text
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

“…permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. …”
Get full text
Get full text
Get full text

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

“…This algorithm is based on the combination of Fibonacci permutation and discrete wavelet transforms (DWT). …”
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

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

“…This research proposed a new Key Schedule Algorithm based on the coordinate geometry of a Hybrid Cube (KSAHC) for the non-binary block cipher. …”
Get full text
Get full text
Get full text
Get full text

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

“…In this research, we proposed a new block cipher algorithm based on genetic algorithm approach which shall meet the security requirements. …”
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.

“…Few algorithms have been developed for deciding the sequence of n jobs and m machines to minimize makespan in the flow shop. …”
Get full text
Get full text

Systematic literature review: Trend analysis on the design of lightweight block cipher by Abdul Alif Zakaria, Azni Hazlizan Ab Halim, Farida Hazwani Mohd Ridzuan, Nur Hafiza Zakaria, Maslina Daud

Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling by Isa, Noor Amira, Ahmad Bareduan, Salleh

Get full text
Get full text

Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4 by Mohd Fidzwan, Md Amin Hamzas, Ahmad Bareduan, Salleh, Liyana, Tajul, Mohd Sabri, Hussin, Zailani, Zainal Abidin, Hasnul, Hadi

Get full text

RSA Encryption & Decryption using JAVA by Ramli, Marliyana

“…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
Get full text
Get full text

Bottleneck-based heuristic for permutation flowshop scheduling by Isa, Noor Amira

“…The newly heuristic is developed by introducing the bottleneck-based concept that was applied at the beginning of initial solution determination. …”
Get full text
Get full text
Get full text
Get full text

A wavelet based watermarking algorithm for video by Hussin, Saleh, Babakr, Elsadig, Ramli, Abd Rahman, Al-Hadad, Sayed R.

“…In this paper, a video watermarking algorithm based on wavelets is proposed. In this algorithm, to achieve better imperceptibility and robustness a binary image watermark is inserted into the middle frequency subband coefficients of the blue component of the video frame. …”
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

Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach by Bareduan, Sallehahmad, Hasan, Sulaiman

“…It was shown that using bottleneck-based analysis, effective makespan algorithms and constructive heuristic can be developed to solve for near-optimal scheduling sequence. …”
Get full text
Get full text
Get full text

Development of DNA-based dynamic key-dependent block cipher by Saeed, Auday H.

“…Hence, it is necessary to research and develop a secure symmetric cipher algorithm. Since the declaration of Rijndael as AES this cipher has been the target of many attacks, and the attempts to break it are ongoing and even increasing everyday by taking advantage of the rapid development in computing capabilities. …”
Get full text
Get full text

A fast and efficient crosstalk-free algorithm for routing in optical multistage interconnection networks by Raja Mohd Auzar, Tengku Dian Shahida, Othman, Mohamed, Abdullah, Mohamad Khazani

“…To evaluate the performance of the new algorithm, a crosstalk-free version of the original ZeroXY algorithm is developed extended from the Improved ZeroXY algorithm, called the Modified ZeroXY algorithm. …”
Get full text
Get full text