In this paper, novel selective encryption image schemes based on JPEG2000 are proposed. The first one encrypts only the code-blocks corresponding to some sensitive precincts. In order to improve the security level we introduce the permutation of codeblocks contributing in the selected precincts. The idea of combining permutation and selective encryption is used in order to minimize the amount o...

In [Haruna, T. and Nakajima, K., 2011. Physica D 240, 13701377], the authors introduced the duality between values (words) and orderings (permutations) as a basis to discuss the relationship between information theoretic measures for finite-alphabet stationary stochastic processes and their permutation analogues. It has been used to give a simple proof of the equality between the entropy rate a...

Earth Observation Satellite (EOS) scheduling is an important oversubscribed constraint optimization problem. Permutation-based scheduling methods have recently been shown to be effective on these problems. However, the new agile EOS satellites present additional scheduling complexity because they allow image acquisition over a window of possible observation times. Constraint propagation algorit...

This paper addresses the job shop scheduling problem with minimizing the number of tardy jobs as the objective. This problem is usually treated as a job sequencing problem, and the permutation-based representation of solutions was commonly used in the existing search-based approaches. In this paper, the flaw of the permutation-based representation is discussed, and a rule-centric concept is pro...

We present an approach for blind separation of acoustic sources produced from multiple speakers mixed in realistic room environments. We first transform recorded signals into the time-frequency domain to make mixing become instantaneous. We then separate the sources in each frequency bin based on an independent component analysis (ICA) algorithm. For the present paper, we choose the complex ver...

A pair of proteins is defined to be related by a circular permutation if the N-terminal region of one protein has significant sequence similarity to the C-terminal of the other and vice versa. To detect pairs of proteins that might be related by circular permutation, we implemented a procedure based on a combination of a fast screening algorithm that we had designed and manual verification of c...

This paper considers formation shape control of multiple robots while minimizing the maximum distance of robot covered. Previous studies have shown that the shape of formation is set of similarity transformations of that and solved the problem by using convex optimization. However, not only the similarity transformation but also permutation transformation preserves the shape of formation. There...

Permutation codes are widely studied objects due to their numerous applications in various areas, such as power line communications, block ciphers, and the rank modulation scheme for flash memories. Several kinds of metrics are considered for permutation codes according to their specific applications. This paper concerns some improvements on the bounds of permutation codes under Hamming metric ...

—In this paper, we present a new approach dedicated to correcting the spelling errors of the Arabic language. This approach corrects typographical errors like inserting, deleting, and permutation. Our method is inspired from the Levenshtein algorithm, and allows a finer and better scheduling than Levenshtein. The results obtained are very satisfactory and encouraging, which shows the interest o...

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...