Optimization of time based fuzzy multi-objective reliability redundancy allocation problem for xj−out−of−m system using tuning and neighborhood based fuzzy MOPSO algorithm
Optimization of Time Dependent Fuzzy Multi-Objective Reliability Redundancy Allocation Problem for n-Stage Series Parallel System
This study introduces a time dependent fuzzy multi-objective reliability redundancy allocation pr... more This study introduces a time dependent fuzzy multi-objective reliability redundancy allocation problem (TF-MORRAP) for the $n$-stage (level) series parallel system. System reliability maximization and system cost minimization according to time by optimizing the redundant components counting at every stage of the system is the main objective of this study. This optimization is done by satisfying the entropy constraints with limited redundant components at every stage and in the whole system. The reliability and cost of every component are represented as triangular fuzzy numbers (TFN) to handle the uncertainty of input information of the system. According to time the component reliability and cost decrease by some factor of their previous existing value. This factor follows the change in the length of radius of the inverse logarithmic spiral with respect to angle which is regarded as time here. The proposed problem is analysed by using an over-speed protection system of a gas turbine....
International Journal of Applied Engineering Research
This paper introduced a reversible data hiding method based on pixel value ordering with the pred... more This paper introduced a reversible data hiding method based on pixel value ordering with the prediction-error expansion technique and the average value of end pixels'. A host image is first segmented into non-overlapping sub-blocks of three pixels and ordered them as ascending order. For each subblock maximum pixel value and the minimum pixel value is predicted by the middle pixel value and also the middle pixel value is predicted by the average of the maximum and minimum pixel values. Then by using prediction-error expansions, we can embed secret bits into maximum pixel and minimum pixel and also by using the average value of these two pixels we can embed secret bit into the middle pixel of every sub-block. All secret bits can be recovered and restored the cover image completely from watermarked image. Experimental result of this scheme demonstrates that the embedding capacity and average PSNR value is larger than another pixel value ordering and prediction error expansion based approach for relatively smooth images. Also, the visual quality of the obtained marked image is better than other Pixel Value Ordering and Prediction Error Expansion based method.
International Journal of Applied Engineering Research, 2019
This paper presents a novel reversible data hiding method based on pixel value blocking and predi... more This paper presents a novel reversible data hiding method based on pixel value blocking and prediction-error expansion. A cover image is divided into non-overlapping sub-blocks of two pixels. Watermark bits are embedded in two phases. In Phase-I, for each sub-block, second pixel value is predicted by the first pixel value and depending on prediction-error within a threshold limit secret bit is embedded into second pixel. Also secret bit is embedded into first pixel just by adjusting the location map without effecting into the pixel value. Then another compressed location map value is used to indicate overflow/underflow or the sub-blocks are outer threshold limit. Again in Phase-II, for each sub-block, first pixel value is predicted by the second pixel value and by depending on prediction-error within a threshold limit secret bit is embedded into first pixel. Also secret bit is embedded into second pixel by adjusting location map without effecting into the pixel value and another compressed location map value is used to indicate overflow/underflow or the sub-blocks of outer threshold limit. All secret bits can be recovered and restored the cover image completely from watermarked image. Experimental result of comparison of this scheme with recent existing scheme using different standard images shows that the embedding capacity with visual quality and PSNR values of the proposed scheme is larger than the existing scheme.
This paper covers the canonical genetic algorithm a s well as more experimental forms of genetic ... more This paper covers the canonical genetic algorithm a s well as more experimental forms of genetic algorithms, including parallel island models and pa rallel cellular genetic algorithms. The theoretical foundations of genetic algorithms are reviewed, include the schema theorem as well as recently developed exact models of the canonical genetic algorithms.
This paper covers the canonical genetic algorithm as well as more experimental forms of genetic a... more This paper covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The theoretical foundations of genetic algorithms are reviewed, include the schema theorem as well as recently developed exact models of the canonical genetic algorithms.
Modern information protection methods can only be effective if an almost impossibly wide range of... more Modern information protection methods can only be effective if an almost impossibly wide range of conditions is met. Proper cryptography is one of these conditions. This article reviews some recent cryptographic development, but focuses on understanding the cryptographic decision making process. Keyword: Cypher Text, Public Key Cryptography, Private Key Cryptography, DES, AES, RSA.
This paper introduced a reversible data hiding method based on pixel value ordering with the pred... more This paper introduced a reversible data hiding method based on pixel value ordering with the prediction-error expansion technique and the average value of end pixels’. A host image is first segmented into non-overlapping sub-blocks of three pixels and ordered them as ascending order. For each subblock maximum pixel value and the minimum pixel value is predicted by the middle pixel value and also the middle pixel value is predicted by the average of the maximum and minimum pixel values. Then by using prediction-error expansions, we can embed secret bits into maximum pixel and minimum pixel and also by using the average value of these two pixels we can embed secret bit into the middle pixel of every sub-block. All secret bits can be recovered and restored the cover image completely from watermarked image. Experimental result of this scheme demonstrates that the embedding capacity and average PSNR value is larger than another pixel value ordering and prediction error expansion based ap...
Uploads
Papers by Satyajit De