search for: mlt35

...be helpful- I was just trying to keep it simple and focus on what I saw as the problem at hand for now. Thank you for your help. Sincerely, Mike Treglia -- Michael Treglia Applied Biodiversity Sciences NSF-IGERT Program Wildlife and Fisheries Sciences Texas A&M University Lab: (979)862-7245 mlt35 at tamu.edu http://people.tamu.edu/~mlt35

Dear All, I wrote a function for cluster analysis to compute cophenetic correlations between dissimilarity matrices (using the VEGAN library) and cluster analyses of every possible clustering algorithm (SEE ATTACHED) http://old.nabble.com/file/p26288610/cor.coef.R cor.coef.R . As it is now, it is extremely long, and for the future I was hoping to find a more efficient way of doing this sort of

Dear All, I am trying to create an artificial binary matrix such that each cell has a probability of 0.048 of having a 1. So far the closest I've come is us by using a random poisson distribution with a mean of 0.048, but I can't figure out how to limit the max value to 1. Otherwise that would work fine it seems. Any suggestions? The main code I've got to create said matrix so far

Dear All, I am trying to fill in a blank vector ("a") with one value at a time, with the value of the number of rows in a randomized dataset with rowSums=0. Below is the code I've got so far, but what I want to be as the last line is " a[1st NA,]=nz" such that this will run until all of my NAs are replaced with an integer value based on randomizations.