We describe numerical implementations of the discrete convolution operator and the derivative operator in the framework of nonstandard wavelet decomposition of linear operators. In both cases, the operator matrix and the input vector are rst expanded in a compactly supported discrete wavelet basis. Then the scale-wise eeect of the expanded operator matrix on the input vector is computed. The co...

In this paper, we propose a session based bit level symmetric key cryptographic technique and it is termed as Spiral Matrix Based Bit Orientation Technique (SMBBOT). SMBBOT consider the input plain text as binary bit stream. During encryption this stream is chopped into manageable sized blocks with variable lengths. Bits of these blocks are taken from MSB to LSB to fit into a square matrix of s...

this research proposes a methodology for ranking decision making units byusing a goal programming model.we suggest a two phases procedure. in phase1, by using some dea problems for each pair of units, we construct a pairwisecomparison matrix. then this matrix is utilized to rank the units via the goalprogramming model.

We describe an extension of the Scalable Universal Matrix Multiplication Algorithms (SUMMA) from 2D to 3D process grids; the underlying idea is to lower the communication volume through storing redundant copies of one or more matrices. While SUMMA was originally introduced for block-wise matrix distributions, so that most of its communication was within broadcasts, this paper focuses on element...

In this paper we investigate the extent to which Katz backoff language models can be compressed through a combination of parameter quantization (width-wise compression) and parameter pruning (length-wise compression) methods while preserving performance. We compare the compression and performance that is achieved using entropy-based pruning against that achieved using only parameter quantizatio...

Sparsfying matrices is a ubiquitous operation in large scale machine learning, data mining and signal processing. More formally, given a large matrix A, we aim to find another matrix B, such that }A B} ¤ ε with B being significantly sparser than A. Using B as a surrogate for A is more efficient and often provides provably good approximations for many tasks. In this paper, we suggest an element-...

This paper introduces a novel method based on auxiliary matrix to hide a text data in an RGB plane. To hide the data in RGB planes of image via scanning, encryption and decryption. To enhance the security, the scanning technique combines two different traversals – spiral and snake traversal. The encryption algorithm involves auxiliary matrix as a payload and consider the least significant bits ...