Train a two layer neural network with a recursive prediction error
％ algorithm ("recursive Gauss-Newton"). Also pruned (i.e., not fully
％ connected) networks can be trained.
％
％ The activation functions can either be linear or tanh. The network
％ architecture is defined by the matrix NetDef , which has of two
％ rows. The first row specifies the hidden layer while the second
％ specifies the output layer.
IML package provides efficient routines to solve nonsingular systems of
linear equations, certified solve any shape systems of linear equations,
and perform mod p matrix operations, such as computing row-echelon form,
determinant, rank profile, inverse of a mod p matrix.
This project features a complete JPEG Hardware Compressor (standard Baseline DCT, JFIF header) with 2:1:1 subsampling, able to compress at a rate of up to 24 images per second (on XC2V1000-4 @ 40 MHz with resolution 352x288).
Image resolution is not limited. It takes an RGB input (row-wise) and outputs to a memory the compressed JPEG image. Its quality is comparable to software solutions.
Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a constant subtracted from any row
or any column of the cost matrix, an
optimal solution does not change.
Playfair Cipher
1.not even the large number of keys in a monoalphabetic cipher provides security
2.one approach to improving security was to encrypt multiple letters
3.the Playfair Cipher is an example
4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair
Playfair Key Matrix
1.a 5X5 matrix of letters based on a keyword
2.fill in letters of keyword (sans duplicates)
3.fill rest of matrix with other letters
Encrypting and Decrypting
-plaintext is encrypted two letters at a time
1. if a pair is a repeated letter, insert filler like X’
2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end)
3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from
bottom)
4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair
The code performs a number (ITERS) of iterations of the
Bailey s 6-step FFT algorithm (following the ideas in the
CMU Task parallel suite).
1.- Generates an input signal vector (dgen) with size
n=n1xn2 stored in row major order
In this code the size of the input signal
is NN=NxN (n=NN, n1=n2=N)
2.- Transpose (tpose) A to have it stored in column
major order
3.- Perform independent FFTs on the rows (cffts)
4.- Scale each element of the resulting array by a
factor of w[n]**(p*q)
5.- Transpose (tpose) to prepair it for the next step
6.- Perform independent FFTs on the rows (cffts)
7.- Transpose the resulting matrix
The code requires nested Parallelism.
list of matlab m-files on matlab 7.0. learning , support vector machine and some utility routines : autocorrelation, linearly scale randomize the row order of a matrix
This m file hide an image jpeg,png in another jpeg,png image.
The height and width of the secret image is in LSB of 1st 32 pixels of 1st row of the cover image.This helps in the recovery of secret image.
The secret image must be smaller than cover image.A message box will appear with a number ,that number is the maximum product of width and height of secret image that can be successfully embedded in the cover image.
The final png image will appear in workspace with random name.This image contains the secret image.One such png image is in the zip file with name 4447.png it contains an image of res 100x122.
I originally wrote this program as an exercise for learning JAVE. Gomoku game is well-known in many countries and every country calls it differently. The winner is the first player to get an unbroken row of five stones horizontally, vertically, or diagonally.
