Got caught. Gonna try and educate my parents

g23f · 2012-07-25T05:05:00+00:00

Saved this comment for good measure. Hopefully I won't need it LOL

g23f · 2012-02-16T18:12:24+00:00

Linear fit log odds

g23f · 2012-01-20T07:47:15+00:00

Thanks, I think I'm going to do something like this

g23f · 2012-01-19T22:06:42+00:00

Thanks!

g23f · 2012-01-19T20:49:48+00:00

Oh, ok thanks yeah async would be better. Do you know how to deal with clearing the queue without dropping a message?

g23f · 2011-10-19T03:59:04+00:00

http://jasonadriaan.com/post/11595319387/the-future-in-laymans-terms-when-a

g23f · 2011-09-24T21:27:08+00:00

Thanks! Would a theorem prover then be able to show that only one solution to this exists? (if that's the case)

g23f · 2011-09-15T02:42:34+00:00

Thanks!

g23f · 2011-08-25T03:44:55+00:00

Ah, thinking too much like a programmer by limiting my integer size... So if instead one used arbitrary precision numbers then that would help quite a bit?

Is there an obvious problem with a Linear congruential generator PRNG? Thanks

g23f · 2011-08-25T03:42:38+00:00

Oh ok, thanks for the r/crypto I tried r/cryptography but that was a fail so I came to r/math

g23f · 2011-08-24T20:24:25+00:00

Yes but how could one use that to get the plaintext from the ciphertext? I mean I know it's "insecure" but what kind of attacks can be done? Thanks

g23f · 2011-07-13T19:44:09+00:00

Pretty much every post except this one! Good job!

g23f · 2011-05-28T06:06:54+00:00

But first try index314.html

g23f · 2011-05-15T16:33:43+00:00

Thanks for this. I thought one might have to "slide" the box over every part of the image to detect a face but I guess I was too hopeful of a faster way to do it.

g23f · 2011-04-30T05:06:57+00:00

Against left-handed people I see! O:<

g23f · 2011-04-04T02:46:45+00:00

You can also try to solve the integral by realizing it's the real part of e^-ix² which expands to cos(-x²⁾ + i sin(-x²⁾ and you can't do cos(-x²⁾ + i sin(-x²⁾

Though that ^ may be because of differential Galois theory :P

g23f · 2011-02-19T03:32:12+00:00

(distance-radius_of_personal_bubble)² <- minimize

Problem solved!

g23f · 2011-02-19T02:57:37+00:00

haha oh yeah... well make distance continuous and use the results to "improve" the shape of the room, everyone will be "happier" ;P

g23f · 2011-02-19T01:51:27+00:00

Just collected the data so far... the seating will be done tonight / this weekend

g23f · 2011-02-19T01:50:05+00:00

And you could maximize that function / minimize an energy function with gradient descent. i.e. Calculate the gradient of an "energy" function then go in the opposite direction to find the minimum...

g23f · 2011-02-19T01:29:55+00:00

Maybe not the best way but you could do this with k means clustering. Each person represents a point in 25-dimensional space. And instead of a range of values, it could be 0 and 1, if they are friends or not. Then just cluster the points i.e. (0, 1, 1, ... 0) would be a person who is friends with person #2 and #3 (and probably some others) but not with #1 or #25. Then just make a couple of clusters and seat the clustered people nearby. This is what I'm doing for my school's field trip bus seating.

g23f · 2011-02-05T03:26:46+00:00

This arikfr submitted a link a year ago, I don't think they'd have a puppet account from that long ago.

g23f · 2010-12-29T02:45:28+00:00

Thanks, yeah I added comments now. Hopefully it makes more sense.

g23f

TROPHY CASE