"
Team:Davidson-Missouri Western/Scatter Plots, Histograms, Correlation Coefficients
From 2008.igem.org
Krmuscalino (Talk | contribs) |
Krmuscalino (Talk | contribs) |
||
| Line 2: | Line 2: | ||
[[Media:Ramaster.m|Ramaster]] | [[Media:Ramaster.m|Ramaster]] | ||
| + | |||
| + | This code generates histograms and scatter plots for each Hash Function Model. These plots are only useful for models that have a single character hash output. The user must input the probability of occurrence of each character in the ascii alphabet (use | ||
| + | function[mstr]=master(file,L,l,t,ring,level)%input file-document (with different ascii character frequencies),L-# of characters in message,l-# of messages plotted in each plot,t-# that corresponds to hashing method,ring-ringlength (#),level-#of layers in petri-dish | ||
| + | M= dlmread(file,':'); | ||
[[Media:Analyzer.m|Analyzer]] | [[Media:Analyzer.m|Analyzer]] | ||
Revision as of 20:14, 29 October 2008
Analysis Codes
This code generates histograms and scatter plots for each Hash Function Model. These plots are only useful for models that have a single character hash output. The user must input the probability of occurrence of each character in the ascii alphabet (use function[mstr]=master(file,L,l,t,ring,level)%input file-document (with different ascii character frequencies),L-# of characters in message,l-# of messages plotted in each plot,t-# that corresponds to hashing method,ring-ringlength (#),level-#of layers in petri-dish M= dlmread(file,':');
Analyzer %to generate many scatter plots and histograms (with for loops) using ramaster
The Models
This code hashes all messages with the twist model to any fixed amount of characters in the output. The user must input a message in string format, the number of characters in the user's alphabet, the size of each ring, the number of characters desired in the output, and the minimum amount of layers of rings.
Net Model (One Character Output)
This code hashes all messages with the net model to a single character in the output. The user must input a message in string format, the size of the ring, and the minimum amount of layers of rings.
Net Model (Any Amount of Characters in Output)
This code hashes all messages with the net model to any fixed amount of characters in the output. The user must input a message in string format, the number of characters in the user's alphabet, the decimal value (ascii) of the starting character of the alphabet, the size of each ring, the number of characters desired in the output, and the minimum amount of layers of rings.
Split Model for 128 Character Alphabet
This code hashes all messages with the split model to a single character in the output. The user must input a message in string format and a key (one character) in string format.
This code hash all messages with the split model to a single character in the output. The user must input a message in string format, a key (one character) in string format, the number of characters in user's alphabet, and the decimal value (ascii) of the starting character of the alphabet.
This code hashes all messages with the spoke model to any fixed amount of characters in the output. The user must input a message in string format, a key (one character) in string format, the number of characters in the user's alphabet, and the number of characters desired in the output. This code assumes that the decimal value of the starting character of the alphabet is 0.
This code hashes all messages with the spoke model to any fixed amount of characters in the output. The user must input a message ins string format, a key (one character) in string format, the number of characters in the user's alphabet, the decimal value (ascii) of the starting character of the alphabet, and the number of characters desired in the output. This code enables the user to choose the decimal value of the starting character of the alphabet.
This document is used in above codes as a data base of frequencies of characters (from the ascii alphabet) that occur in typical word documents (not every character in the ascii alphabet will thus not occur at equal frequency).
This document is used in above codes as a data base of frequencies of characters (from the ascii alphabet) occurring equally.
