Thank you for downloading orthogonal arrays theory and applications. Maybe you have knowledge that, people have search numerous times for their chosen readings like this orthogonal arrays theory and applications, but end up in malicious downloads. Rather than enjoying a good book with a cup of tea in the afternoon, instead they are facing with some infectious bugs inside their desktop computer. orthogonal arrays theory and applications is available in our book collection an online access to it is set as public so you can get it instantly. Our books collection saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the orthogonal arrays theory and applications is universally compatible with any devices to read.

Orthogonal Arrays Theory And Applications

Review of swarm intelligence-based feature selection methods

This paper aims to review the encountered technical contradictions when an attacker meets the cipher-images encrypted by the image encryption schemes (algorithms) proposed in 2018 from the viewpoint of an image cryptanalyst. The most representative works among them are selected and classified according to their essential structures. Almost all image cryptanalysis works published in 2018 are surveyed due to their small number. The challenging problems on design and analysis of image encryption schemes are summarized to receive the attentions of both designers and attackers (cryptanalysts) of image encryption schemes, which may promote solving scenario-oriented image security problems with new technologies.

When an attacker meets a cipher-image in 2018: A year in review

The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences announces a forthcoming Special Section on Networked Control Systems: Theories & Applications to be published in May 2013. In many applications, such as factory automation and smart grid, Networked Control System (NCS) plays an important role, in which the state of environment is monitored and the target is controlled both via the network. Based on conventional control and communication theories, a new unified theory on NCS is needed to realize reliable, robust, delay tolerant, and scalable communication networks for NCS. Under these considerations, Special Section on Networked Control Systems: Theories & Applications is planned to accelerate R&D activities in this area by collecting and publishing the results on up-to-date researches and experimental studies related to NCS.

IEICE transactions on fundamentals of electronics, communications and computer sciences

Complex networks have been studied intensively for a decade, but research still focuses on the limited case of a single, non-interacting network. Modern systems are coupled together and therefore should be modelled as interdependent networks. A fundamental property of interdependent networks is that failure of nodes in one network may lead to failure of dependent nodes in other networks. This may happen recursively and can lead to a cascade of failures. In fact, a failure of a very small fraction of nodes in one network may lead to the complete fragmentation of a system of several interdependent networks. A dramatic real-world example of a cascade of failures (‘concurrent malfunction’) is the electrical blackout that affected much of Italy on 28 September 2003: the shutdown of power stations directly led to the failure of nodes in the Internet communication network, which in turn caused further breakdown of power stations. Here we develop a framework for understanding the robustness of interacting networks subject to such cascading failures. We present exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks. Surprisingly, a broader degree distribution increases the vulnerability of interdependent networks to random failure, which is opposite to how a single network behaves. Our findings highlight the need to consider interdependent network properties in designing robust networks.

http://absimage.aps.org/image/MAR10/MWS_MAR10-2009-001087.pdf

Catastrophic cascade of failures in interdependent networks

In reversible image secret sharing (RISS), the cover image can be recovered to some degree, and a share can be comprehensible rather than noise-like. Reversible cover images play an important role in law enforcement and medical diagnosis. The comprehensible share can not only reduce the suspicion of attackers but also improve the management efficiency of shares. In this paper, we first provide a formal definition of RISS. Then, we propose an RISS algorithm for a $(k,n)$ -threshold based on the principle of the Chinese remainder theorem-based ISS (CRTISS). In the proposed RISS, the secret image is losslessly decoded by a modular operation, and the original cover image is recovered by a binarization operation, both of which are just simple operations. Theoretical analyses and experiments are provided to validate the proposed definition and algorithm.

/pdf/reversible-image-secret-sharing-yvj4f9q4b0.pdf

Reversible Image Secret Sharing

In this paper, a novel visual secret sharing (VSS) scheme based on QR code (VSSQR) with (k, n) threshold is investigated. Our VSSQR exploits the error correction mechanism in the QR code structure, to generate the bits corresponding to shares (shadow images) by VSS from a secret bit in the processing of encoding QR. Each output share is a valid QR code that can be scanned and decoded utilizing a QR code reader, which may reduce the likelihood of attracting the attention of potential attackers. Due to different application scenarios, two different recovered ways of the secret image are given. The proposed VSS scheme based on QR code can visually reveal secret image with the abilities of stacking and XOR decryptions as well as scan every shadow image, i.e., a QR code, by a QR code reader. The secret image could be revealed by human visual system without any computation based on stacking when no lightweight computation device. On the other hand, if the lightweight computation device is available, the secret image can be revealed with better visual quality based on XOR operation and could be lossless revealed when sufficient shares are collected. In addition, it can assist alignment for VSS recovery. The experiment results show the effectiveness of our scheme.

Visual secret sharing scheme for (k, n) threshold based on QR code with multiple decryptions

Chinese remainder theorem-based two-in-one image secret sharing with three decoding options

Visual secret sharing (VSS) for general access structure (GAS) owns wider applications than (k, n) threshold VSS. VSS with multiple decryptions realizes the functionalities of both OR-based VSS (OVSS) and XOR-based VSS (XVSS), which can broaden the applications as well compared to one recovery method-based VSS. In this paper, we propose a progressive VSS (PVSS) scheme for GAS with the features of both OR and XOR decryptions based on random grid (RG). The different regions of the secret image and corresponding genearted random bits are employed to gain progressive property as well as GAS with OR and XOR decryptions. For the qualified sets, if we have a copy machine, we can reconstruct the secret by stacking. On the other hand, if a device with XOR operation is available, we can improve the visual quality of the recovered secret image as well as we can reconstruct the secret image losslessly when we collect all the n shares. In addition, our scheme has neither pixel expansion nor codebook design due to RG. The effectiveness of the proposed scheme are shown in terms of experimental results and analyses.

Progressive Visual Secret Sharing for General Access Structure with Multiple Decryptions

In comparison with Shamir’s original polynomial-based secret image sharing (SIS), Chinese remainder theorem-based SIS (CRTSIS) overall has the advantages of lossless recovery, low recovery computation complexity and no auxiliary encryption. Traditional CRTSIS methods generally suffer from no (k, n) threshold, lossy recovery, ignoring the image characteristics and auxiliary encryption. Based on the analysis of image characteristics and SIS, in this paper we propose a CRTSIS method for (k, n) threshold, through dividing the gray image pixel values into two intervals corresponding to two available mapping intervals. Our method realizes (k, n) threshold and lossless recovery for gray image without auxiliary encryption. Analysis and experiments are provided to indicate the effectiveness of the proposed method.

Yuliang Lu

Papers

Reversible Image Secret Sharing

Visual secret sharing scheme for (k, n) threshold based on QR code with multiple decryptions

Chinese remainder theorem-based two-in-one image secret sharing with three decoding options

Progressive Visual Secret Sharing for General Access Structure with Multiple Decryptions

Chinese Remainder Theorem-Based Secret Image Sharing for ( k , n ) Threshold