**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**38

# Search results for: permutation

##### 38 A New Image Encryption Approach using Combinational Permutation Techniques

**Authors:**
A. Mitra,
Y. V. Subba Rao,
S. R. M. Prasanna

**Abstract:**

**Keywords:**
Encryption,
Permutation,
Good key,
Combinationalpermutation,
Pseudo random index generator.

##### 37 Quasi-Permutation Representations for the Group SL(2, q) when Extended by a Certain Group of Order Two

**Authors:**
M. Ghorbany

**Abstract:**

A square matrix over the complex field with non- negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful representation of G by quasi-permutation matrices over the rationals and the complex numbers are denoted by q(G) and c(G) respectively. Finally r (G) denotes the minimal degree of a faithful rational valued complex character of C. The purpose of this paper is to calculate q(G), c(G) and r(G) for the group S L(2, q) when extended by a certain group of order two.

**Keywords:**
General linear group,
Quasi-permutation

##### 36 A Genetic Algorithm Based Permutation and Non-Permutation Scheduling Heuristics for Finite Capacity Material Requirement Planning Problem

**Authors:**
Watchara Songserm,
Teeradej Wuttipornpun

**Abstract:**

This paper presents a genetic algorithm based permutation and non-permutation scheduling heuristics (GAPNP) to solve a multi-stage finite capacity material requirement planning (FCMRP) problem in automotive assembly flow shop with unrelated parallel machines. In the algorithm, the sequences of orders are iteratively improved by the GA characteristics, whereas the required operations are scheduled based on the presented permutation and non-permutation heuristics. Finally, a linear programming is applied to minimize the total cost. The presented GAPNP algorithm is evaluated by using real datasets from automotive companies. The required parameters for GAPNP are intently tuned to obtain a common parameter setting for all case studies. The results show that GAPNP significantly outperforms the benchmark algorithm about 30% on average.

**Keywords:**
Finite capacity MRP,
genetic algorithm,
linear programming,
flow shop,
unrelated parallel machines,
application in industries.

##### 35 An Approach to Solving a Permutation Problem of Frequency Domain Independent Component Analysis for Blind Source Separation of Speech Signals

**Authors:**
Masaru Fujieda,
Takahiro Murakami,
Yoshihisa Ishida

**Abstract:**

**Keywords:**
Blind source separation,
Independent componentanalysis,
Frequency domain,
Permutation ambiguity.

##### 34 Block Sorting: A New Characterization and a New Heuristic

**Authors:**
Swapnoneel Roy,
Ashok Kumar Thakur,
Minhazur Rahman

**Abstract:**

**Keywords:**
Block Sorting,
Optical Character Recognition,
Genome Rearrangements,
Sorting Primitives,
ApproximationAlgorithms

##### 33 A Case Study of Key-Dependent Permutations in Feistel Ciphers

**Authors:**
Hani Almimi,
Ola Osabi,
Azman Samsudin

**Abstract:**

Many attempts have been made to strengthen Feistel based block ciphers. Among the successful proposals is the key- dependent S-box which was implemented in some of the high-profile ciphers. In this paper a key-dependent permutation box is proposed and implemented on DES as a case study. The new modified DES, MDES, was tested against Diehard Tests, avalanche test, and performance test. The results showed that in general MDES is more resistible to attacks than DES with negligible overhead. Therefore, it is believed that the proposed key-dependent permutation should be considered as a valuable primitive that can help strengthen the security of Substitution-Permutation Network which is a core design in many Feistel based block ciphers.

**Keywords:**
Block Cipher,
Feistel Structure,
DES,
Diehard Tests,
Avalanche Effect.

##### 32 Sorting Primitives and Genome Rearrangementin Bioinformatics: A Unified Perspective

**Authors:**
Swapnoneel Roy,
Minhazur Rahman,
Ashok Kumar Thakur

**Abstract:**

**Keywords:**
Sorting Primitives,
Genome Rearrangements,
Transpositions,
Block Interchanges,
Strip Exchanges.

##### 31 The Design of Self-evolving Artificial Immune System II for Permutation Flow-shop Problem

**Authors:**
Meng-Hui Chen,
Pei-Chann Chang,
Wei-Hsiu Huang

**Abstract:**

**Keywords:**
Artificial Immune System,
Clonal Selection,
Immune
Response,
Permutation Flow-shop Scheduling Problems

##### 30 Using Tabu Search to Analyze the Mauritian Economic Sectors

**Authors:**
J. Cheeneebash,
V. Beeharry,
A. Gopaul

**Abstract:**

**Keywords:**
Input-Output matrix,
linear ordering problem,
Tabusearch.

##### 29 An Efficient Separation for Convolutive Mixtures

**Authors:**
Salah Al-Din I. Badran,
Samad Ahmadi,
Dylan Menzies,
Ismail Shahin

**Abstract:**

This paper describes a new efficient blind source separation method; in this method we uses a non-uniform filter bank and a new structure with different sub-bands. This method provides a reduced permutation and increased convergence speed comparing to the full-band algorithm. Recently, some structures have been suggested to deal with two problems: reducing permutation and increasing the speed of convergence of the adaptive algorithm for correlated input signals. The permutation problem is avoided with the use of adaptive filters of orders less than the full-band adaptive filter, which operate at a sampling rate lower than the sampling rate of the input signal. The decomposed signals by analysis bank filter are less correlated in each sub-band than the input signal at full-band, and can promote better rates of convergence.

**Keywords:**
Blind source separation (BSS),
estimates,
full-band,
mixtures,
Sub-band.

##### 28 Blind Source Separation for Convoluted Signals Based on Properties of Acoustic Transfer Function in Real Environments

**Authors:**
Takaaki Ishibashi

**Abstract:**

**Keywords:**
blind source separation,
frequency domain independent
component analysys,
permutation correction,
scale adjustment,
target extraction.

##### 27 A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem

**Authors:**
G. M. Komaki,
S. Mobin,
E. Teymourian,
S. Sheikh

**Abstract:**

**Keywords:**
Distributed permutation flow shop,
scheduling,
makespan,
general variable neighborhood search algorithm.

##### 26 Assessment of Multiscale Information for Short Physiological Time Series

**Authors:**
Young-Seok Choi

**Abstract:**

**Keywords:**
Multiscale entropy,
permutation entropy,
EEG,
seizure.

##### 25 An Efficient Ant Colony Optimization Algorithm for Multiobjective Flow Shop Scheduling Problem

**Authors:**
Ahmad Rabanimotlagh

**Abstract:**

**Keywords:**
Scheduling,
Flow shop,
Ant colony optimization,
Makespan,
Flow time

##### 24 A New Knapsack Public-Key Cryptosystem Based on Permutation Combination Algorithm

**Authors:**
Min-Shiang Hwang,
Cheng-Chi Lee,
Shiang-Feng Tzeng

**Abstract:**

**Keywords:**
Public key,
Knapsack problem,
Knapsack cryptosystem,
low-density attack.

##### 23 Two-Stage Approach for Solving the Multi-Objective Optimization Problem on Combinatorial Configurations

**Authors:**
Liudmyla Koliechkina,
Olena Dvirna

**Abstract:**

**Keywords:**
Discrete set,
linear combinatorial optimization,
multi-objective optimization,
multipermutation,
Pareto solutions,
partial permutation set,
permutation,
structural graph.

##### 22 An Improved Ant Colony Algorithm for Genome Rearrangements

**Authors:**
Essam Al Daoud

**Abstract:**

Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit distance is proposed. The main idea is to convert the unsigned permutation to signed permutation and evaluate the ants by using Kaplan algorithm. Two new operations are added to the standard ant colony algorithm: Replacing the worst ants by re-sampling the ants from a new probability distribution and applying the crossover operations on the best ants. The proposed algorithm is tested and compared with the improved breakpoint reversal sort algorithm by using three datasets. The results indicate that the proposed algorithm achieves better accuracy ratio than the previous methods.

**Keywords:**
Ant colony algorithm,
Edit distance,
Genome breakpoint,
Genome rearrangement,
Reversal sort.

##### 21 Low Complexity Multi Mode Interleaver Core for WiMAX with Support for Convolutional Interleaving

**Authors:**
Rizwan Asghar,
Dake Liu

**Abstract:**

**Keywords:**
Hardware interleaver implementation,
WiMAX,
DVB,
block interleaver,
convolutional interleaver,
hardwaremultiplexing.

##### 20 BeamGA Median: A Hybrid Heuristic Search Approach

**Authors:**
Ghada Badr,
Manar Hosny,
Nuha Bintayyash,
Eman Albilali,
Souad Larabi Marie-Sainte

**Abstract:**

**Keywords:**
Median problem,
phylogenetic tree,
permutation,
genetic algorithm,
beam search,
genome rearrangement distance.

##### 19 Computing SAGB-Gröbner Basis of Ideals of Invariant Rings by Using Gaussian Elimination

**Authors:**
Sajjad Rahmany,
Abdolali Basiri

**Abstract:**

**Keywords:**
Gröbner basis,
SAGBI- Gröbner basis,
reduction,
Invariant ring,
permutation groups.

##### 18 2-D Realization of WiMAX Channel Interleaver for Efficient Hardware Implementation

**Authors:**
Rizwan Asghar,
Dake Liu

**Abstract:**

**Keywords:**
Interleaver,
deinterleaver,
WiMAX,
802.16e.

##### 17 A Systematic Approach for Finding Hamiltonian Cycles with a Prescribed Edge in Crossed Cubes

**Authors:**
Jheng-Cheng Chen,
Chia-Jui Lai,
Chang-Hsiung Tsai,

**Abstract:**

The crossed cube is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. In this paper, we focus on the problem embedding a Hamiltonian cycle through an arbitrary given edge in the crossed cube. We give necessary and sufficient condition for determining whether a given permutation with n elements over Zn generates a Hamiltonian cycle pattern of the crossed cube. Moreover, we obtain a lower bound for the number of different Hamiltonian cycles passing through a given edge in an n-dimensional crossed cube. Our work extends some recently obtained results.

**Keywords:**
Interconnection network,
Hamiltonian,
crossed cubes,
prescribed edge.

##### 16 Mathematical Models of Flow Shop and Job Shop Scheduling Problems

**Authors:**
Miloš Šeda

**Abstract:**

In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem by stochastic heuristic methods. For the job shop scheduling problem, a mathematical model and its main representation schemes are presented.

**Keywords:**
Flow shop,
job shop,
mixed integer model,
representation scheme.

##### 15 New Scheme in Determining nth Order Diagrams for Cross Multiplication Method via Combinatorial Approach

**Authors:**
Sharmila Karim,
Haslinda Ibrahim,
Zurni Omar

**Abstract:**

In this paper, a new recursive strategy is proposed for determining $\frac{(n-1)!}{2}$ of $n$th order diagrams. The generalization of $n$th diagram for cross multiplication method were proposed by Pavlovic and Bankier but the specific rule of determining $\frac{(n-1)!}{2}$ of the $n$th order diagrams for square matrix is yet to be discovered. Thus using combinatorial approach, $\frac{(n-1)!}{2}$ of the $n$th order diagrams will be presented as $\frac{(n-1)!}{2}$ starter sets. These starter sets will be generated based on exchanging one element. The advantages of this new strategy are the discarding process was eliminated and the sign of starter set is alternated to each others.

**Keywords:**
starter sets,
permutation,
exchanging one element,
determinant

##### 14 System Reduction by Eigen Permutation Algorithm and Improved Pade Approximations

**Authors:**
Jay Singh,
Kalyan Chatterjee,
C. B. Vishwakarma

**Abstract:**

A mixed method by combining a Eigen algorithm and improved pade approximations is proposed for reducing the order of the large-scale dynamic systems. The most dominant Eigen value of both original and reduced order systems remain same in this method. The proposed method guarantees stability of the reduced model if the original high-order system is stable and is comparable in quality with the other well known existing order reduction methods. The superiority of the proposed method is shown through examples taken from the literature.

**Keywords:**
Eigen algorithm,
Order reduction,
improved pade approximations,
Stability,
Transfer function.

##### 13 Using Fractional Factorial Designs for Variable Importance in Random Forest Models

**Authors:**
Ewa. M. Sztendur,
Neil T. Diamond

**Abstract:**

Random Forests are a powerful classification technique, consisting of a collection of decision trees. One useful feature of Random Forests is the ability to determine the importance of each variable in predicting the outcome. This is done by permuting each variable and computing the change in prediction accuracy before and after the permutation. This variable importance calculation is similar to a one-factor-at a time experiment and therefore is inefficient. In this paper, we use a regular fractional factorial design to determine which variables to permute. Based on the results of the trials in the experiment, we calculate the individual importance of the variables, with improved precision over the standard method. The method is illustrated with a study of student attrition at Monash University.

**Keywords:**
Random Forests,
Variable Importance,
Fractional Factorial Designs,
Student Attrition.

##### 12 Applying Sequential Pattern Mining to Generate Block for Scheduling Problems

**Authors:**
Meng-Hui Chen,
Chen-Yu Kao,
Chia-Yu Hsu,
Pei-Chann Chang

**Abstract:**

The main idea in this paper is using sequential pattern mining to find the information which is helpful for finding high performance solutions. By combining this information, it is defined as blocks. Using the blocks to generate artificial chromosomes (ACs) could improve the structure of solutions. Estimation of Distribution Algorithms (EDAs) is adapted to solve the combinatorial problems. Nevertheless many of these approaches are advantageous for this application, but only some of them are used to enhance the efficiency of application. Generating ACs uses patterns and EDAs could increase the diversity. According to the experimental result, the algorithm which we proposed has a better performance to solve the permutation flow-shop problems.

**Keywords:**
Combinatorial problems,
Sequential Pattern Mining,
Estimation of Distribution Algorithms,
Artificial Chromosomes.

##### 11 A New Application of Stochastic Transformation

**Authors:**
Nilar Win Kyaw

**Abstract:**

**Keywords:**
S-P network,
Feistel network,
R-block,
stochastic transformation

##### 10 Attention Multiple Instance Learning for Cancer Tissue Classification in Digital Histopathology Images

**Authors:**
Afaf Alharbi,
Qianni Zhang

**Abstract:**

The identification of malignant tissue in histopathological slides holds significant importance in both clinical settings and pathology research. This paper presents a methodology aimed at automatically categorizing cancerous tissue through the utilization of a multiple instance learning framework. This framework is specifically developed to acquire knowledge of the Bernoulli distribution of the bag label probability by employing neural networks. Furthermore, we put forward a neural network-based permutation-invariant aggregation operator, equivalent to attention mechanisms, which is applied to the multi-instance learning network. Through empirical evaluation on an openly available colon cancer histopathology dataset, we provide evidence that our approach surpasses various conventional deep learning methods.

**Keywords:**
Attention Multiple Instance Learning,
Multiple
Instance Learning,
transfer learning,
histopathological slides,
cancer
tissue classification.

##### 9 A Hybrid Genetic Algorithm for the Sequence Dependent Flow-Shop Scheduling Problem

**Authors:**
Mohammad Mirabi

**Abstract:**

**Keywords:**
Hybrid genetic algorithm,
Scheduling,
Permutationflow-shop,
Sequence dependent