The Application of Matrix Compression Algorithm in Network Education Platform for the User Security Authentication

2014 ◽  
Vol 889-890 ◽  
pp. 1730-1736
Author(s):  
Nong Zheng
Keyword(s):  
Open Channel ◽  
Block Size ◽  
Matrix Decomposition ◽  
Compression Algorithm ◽  
Network Education ◽  
Cipher Text ◽  
Security Authentication ◽  
Matrix Compression ◽  
The Matrix ◽  
Education Platform

Using the matrix compression algorithm in the network education platform for the user information security certification is a good way. The sensitive user information is transfer in an open channel and it can be authentication for using the matrix compression/decompression, matrix decomposition/reduction algorithm. The client conduct random capture and compression by the user information been divided into a number of rectangular block size, corresponding to generate a key and cipher text. The server take out the corresponding data from the data queue of receiving and to extract In accordance with the key rules, then to reduce of information in corresponding positions. Thus the user identity information can be authenticity and integrity verification.

A Study of the Average Flow in Open Channel with Baffle Blocks Distributed Uniformly

10.29007/zx1w ◽  
2018 ◽  
Author(s):  
Dung Tien Tran ◽  
Anh Tuan Le ◽  
Hong Nhung Le ◽  
Viet Hung Ho
Keyword(s):  
Water Level ◽  
Water Depth ◽  
Open Channel ◽  
Block Size ◽  
Average Flow ◽  
Modelling Studies ◽  
Baffle Block

A study of average flow in open channel with baffle blocks distributed uniformly has been considered by using channel with varied slopes. In this article, experimental and modelling studies were introduced when the correlation between the water depth and baffle block size is significant. The objective of the work is to give the rudimentary relations between discharge and water level in the channels. When the water depth is large, the effect of bottom channel friction on the flow is relatively small. This paper also gives applications of the software ‘Telemac-2D’ to simulate the flow under different conditions.

scholarly journals Complex-analytic and matrix-analytic solutions for a queueing system with group service controlled by arrivals

2000 ◽  
Vol 13 (4) ◽  
pp. 415-427
Author(s):  
Lev Abolnikov ◽  
Alexander Dukhovny
Keyword(s):  
Block Size ◽  
Iteration Process ◽  
Analytic Solutions ◽  
Analytic Method ◽  
Service Time Distribution ◽  
Matrix Analytic Method ◽  
Queueing Process ◽  
The Matrix ◽  
Matrix Iteration ◽  
Necessary And Sufficient

A bulk M/G/1 system is considered that responds to large increases (decreases) of the queue during the service act by alternating between two service modes. The switching rule is based on two “up” and “down” thresholds for total arrivals over the service act. A necessary and sufficient condition for the ergodicity of a Markov chain embedded into the main queueing process is found. Both complex-analytic and matrix-analytic solutions are obtained for the steady-state distribution. Under the assumption of the same service time distribution in both modes, a combined complex-matrix-analytic method is introduced. The technique of “matrix unfolding” is used, which reduces the problem to a matrix iteration process with the block size much smaller than in the direct application of the matrix-analytic method.

The Influence of Cu and Cr on the Matrix Decomposition of Quenched AlZnMg Alloy

1991 ◽  
Vol 124 (1) ◽  
pp. K11-K14 ◽  
Author(s):  
C. Dos Santos Lourenço ◽  
M. Cilense ◽  
W. Garlipp
Keyword(s):  
Matrix Decomposition ◽  
Mg Alloy ◽  
The Matrix

Identifying graph clusters using variational inference and links to covariance parametrization

2009 ◽  
Vol 367 (1906) ◽  
pp. 4407-4426
Author(s):  
David Barber
Keyword(s):  
Mean Field ◽  
Matrix Decomposition ◽  
Difficult Problem ◽  
Positive Definite ◽  
Variational Inference ◽  
Field Theories ◽  
Variational Approximation ◽  
Positive Definite Matrices ◽  
The Matrix ◽  
Non Gaussian

Finding clusters of well-connected nodes in a graph is a problem common to many domains, including social networks, the Internet and bioinformatics. From a computational viewpoint, finding these clusters or graph communities is a difficult problem. We use a clique matrix decomposition based on a statistical description that encourages clusters to be well connected and few in number. The formal intractability of inferring the clusters is addressed using a variational approximation inspired by mean-field theories in statistical mechanics. Clique matrices also play a natural role in parametrizing positive definite matrices under zero constraints on elements of the matrix. We show that clique matrices can parametrize all positive definite matrices restricted according to a decomposable graph and form a structured factor analysis approximation in the non-decomposable case. Extensions to conjugate Bayesian covariance priors and more general non-Gaussian independence models are briefly discussed.

scholarly journals RK Algorithm: Stochastic Parallel Methodology for Symmetric Key Cryptography

2017 ◽  
Vol 2 (3) ◽  
pp. 137-144
Author(s):  
Yegireddi Ramesh ◽  
Kiran Kumar Reddi
Keyword(s):  
Information Age ◽  
Block Size ◽  
Large Data ◽  
Digital Information ◽  
Text Data ◽  
Plain Text ◽  
Cipher Text ◽  
Wide Range ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

With the enormous growth in the Internet and network, data security has become an inevitable concern for any organization. From antecedent security has attracted considerable attention from network researchers. In this perspective many possible fields of endeavour come to mind with many cryptographic algorithms in a broader way, each is highly worthy and lengthy. As society is moving towards digital information age we necessitate highly standard algorithms which compute faster when data size is of wide range or scope. On survey, numerous sequential approaches carried out by symmetric key algorithms on 128 bits as block size are ascertained to be highly in securable and resulting at a low speed. As in the course the commodities are immensely parallelized on multi core processors to solve computational problems, in accordance with, propound parallel symmetric key based algorithms to encrypt/decrypt large data for secure conveyance. The algorithm is aimed to prevail by considering 64 character (512 bits) plain text data, processed 16 characters separately by applying parallelism and finally combine each 16 character cipher data to form 64 character cipher text. The round function employed in the algorithm is very complex, on which improves efficacy.

scholarly journals Linear Precoding Scheme Design for MIMO Two-Way Relay Systems with Imperfect Channel State Information

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Xiao-min Chen ◽  
Jun-xu Su ◽  
Qiu-ming Zhu ◽  
Xu-jun Hu ◽  
Zhu Fang
Keyword(s):  
Iterative Scheme ◽  
Matrix Decomposition ◽  
Mean Square ◽  
Linear Precoding ◽  
Imperfect Channel State Information ◽  
Channel State ◽  
State Information ◽  
Scheme Design ◽  
Decomposition Scheme ◽  
The Matrix

The aim of this paper is to investigate a linear precoding scheme design for a multiple-input multiple-output two-way relay system with imperfect channel state information. The scheme design is simplified as an optimal problem with precoding matrix variables, which is deduced with the maximum power constraint at the relay station based on the minimum mean square error criterion. With channel feedback delay at both ends of the channel and the channel estimation errors being taken into account, we propose a matrix decomposition scheme and a joint iterative scheme to minimize the average sum mean square error. The matrix decomposition method is used to derive the closed form of the relay matrix, and the joint iterative algorithm is used to optimize the precoding matrix and the processing matrix. According to numerical simulation results, the matrix decomposition scheme reduces the system bit error rate (BER) effectively and the joint iterative scheme achieves the best performance of BER against existing methods.

Sign in / Sign up

Export Citation Format

Share Document