Two-bounce optical arbitrary permutation network

1998 ◽  
Vol 37 (14) ◽  
pp. 2879 ◽  
Author(s):  
Marc P. Christensen ◽  
Michael W. Haney
Author(s):  
Velliangiri S

Multimedia digital data include medical record and financial documents, which are not guaranteed with security. The concerns for security of multimedia digital data is been a widespread issue in the field of cybernetics. With increasing malwares in video payloads, the proposed study aims to reduce the embedding of malwares using Pseudo Arbitrary Permutation based Cellular Automata Encryption (PAP-CAE) System in video payloads. This method reduces the malware attacks and distortion rate by permuting the secret keys with Pseudo arbitrary permutation. Before the application of PAP-CAE, 2D wavelet transform is applied on the multimedia files that compresses the complex files into different scales and position to be transmitted via a network with reduced size. Simultaneously, it performs the process of decryption and decompression to retrieve the original files. The proposed method is evaluated against existing methods to test its efficacy in terms of detection accuracy, detection time of malwares and false positive rate. The result shows that the proposed method is effective against the detection of malwares in multimedia video files.


1974 ◽  
Vol 17 (2) ◽  
pp. 203-208 ◽  
Author(s):  
Roberto Frucht ◽  
Frank Harary

AbstractA permutation group A of degree n acting on a set X has a certain number of orbits, each a subset of X. More generally, A also induces an equivalence relation on X(k) the set of all k subsets of X, and the resulting equivalence classes are called k orbits of A, or generalized orbits. A self-complementary k-orbit is one in which for every k-subset S in it, X—S is also in it. Our main results are two formulas for the number s(A) of self-complementary generalized orbits of an arbitrary permutation group A in terms of its cycle index. We show that self-complementary graphs, digraphs, and relations provide special classes of self-complementary generalized orbits.


1985 ◽  
Vol 63 (8) ◽  
pp. 1065-1073 ◽  
Author(s):  
B. Lulek ◽  
T. Lulek ◽  
J. Biel ◽  
R. Chatterjee

The problem of equivalence of permutation representations of the finite groups is discussed in terms of transforms by bijections of the carrier sets and by group automorphisms. A formal description of a transformation between equivalent representations is given, and a standard form for an arbitrary permutation representation is proposed. The standardization is achieved through the canonical realization of transitive representations and of imprimitivity sets on the left cosets of the group with respect to an appropriate stability subgroup. The purpose of this paper is to pave the way for a systematic formulation of permutation representations, analogous to the Racah algebra of angular momentum theory, which will be useful to multicentre problems of quantum mechanics and statistical physics.


2021 ◽  
Vol 15 ◽  
pp. 16
Author(s):  
V.F. Babenko ◽  
D.S. Skorokhodov

We solved the problem about the best interval quadrature formula on the class $W^r F$ of differentiable periodic functions with arbitrary permutation-invariant set $F$ of derivatives of order $r$. We proved that the formula with equal coefficients and $n$ node intervals, which have equidistant middle points, is the best on given class.


2018 ◽  
Vol 1 (1) ◽  
pp. 044-048
Author(s):  
Faiz Ahyaningsih

The quadratic assigment problem (QAP) has remainedone of the great challenges in combinatorial optimization. In this paper I propose two programs, the MATLAB program for solving QAP, and the MATLAB program for checking objective value, if we input an arbitrary permutation, matrix flow and matrix distance. The first program using combination methods that combines random point strategy, forward exchange strategy , and backward exchange strategy. I‘ve tried my program to solve Esc 16b, Esc 16c and Esc 16h from QAPLIB (A Quadratic Assignment Problem Library). In the 500th iteration optimal value reached and I‘ve found the other assignment for problem instances Esc 16b, Esc 16c, and Esc 16h.


Author(s):  
Peter Förster

A homomorph is a class of (finite soluble) groups closed under the operation Q of taking epimorphic images. (All groups considered in this paper are finite and soluble.) Among those types of homomorphs that have found particular interest in the theory of finite soluble groups are formations and Schunck classes; the reader is referred to (2), § 2, for a definition of those classes. In the present paper we are interested in homomorphs satisfying the following additional closure property:(W0) if A is abelian with elementary Sylow subgroups, then each wreath product A G (with respect to an arbitrary permutation representation of G) with G ∊ is contained in .


1994 ◽  
Vol 51 (5) ◽  
pp. 237-243 ◽  
Author(s):  
Xiaojun Shen ◽  
Qing Hu ◽  
Weifa Liang

Sign in / Sign up

Export Citation Format

Share Document