Wednesday, January 13, 2010
Thursday, May 31, 2007
[Said in Deep Voice] The Summinator.
I left the other doodles in there just because I thought they were kinda cool. That, and I hope that whenever I look at "The Summinator" I get a brief reminder of the cyclic and transitive graphs.
This is just a grid, but it's actually made out of the characters between 2551 and 256C in the character map (Times New Roman). See ╬║╝╔╚ ╗╦ ╣╩ . They just all happen to fit nicely when arranged properly.
Minimal Vertex Separator For A Complete Graph
Originally uploaded by USUDave
2 April 2007: Graph Theory.
I don't remember exactly how the relationship goes, but I remember how we, as a class, decided that this illustration represented the Minimal Vertex Separator For A Complete Graph
This is an illustration of my professor. He was wearing black slacks, a blue shirt, and sandals with flaming socks that day. And these are the actual graphs that he was drawing on the board as well.
Monday, May 28, 2007
Wednesday, May 23, 2007
The poisson distribution is a distribution in Statistics, but poisson is actually french for "fish". These are my two fish. The big guy is an 8-10" Oscar, and the little guy is a 3-4" Green Terror.
The Poisson Distribution (quoted from my stats book itself here) is; "A random variable X distributed as a Poisson random variable with parameter λ, which is written X ~ P(λ) and has a probability mass function P(X=x) = (e^-λ * λ^x) / x! for x = 0,1,2,3.... The Poisson distribution is often useful to model the number of times that a certain event occurs per unit of time, distance, or volume, and it has a mean and variance both equal to the parameter λ."
We had to draw a Binary Search Tree of height=7. I thought "I Can't Fit That Onto A Piece of Paper Neatly.... I Need A Bigger Canvas....Hrm..."
I drew this on the sidewalk on campus, took digital photos of it, and then turned those photos for my homework. Dr. Yan Really liked it. :-)
2. The number of internal nodes in T is at leasat h and at most 2^h - 1.
3. The total number of nodes in T is at leasat 2h + 1 and at most 2^(h+1).
4. The height of T is at least log(n+1)-1 and at most (n-1)/2, that is, log(n+1)-1 < h <(n-1)/2.
- 128 leaves
- 127 Internal Nodes
- 255 Total Nodes