« first day (81 days earlier)      last day (5254 days later) » 

00:21
g'night all
 
7 hours later…
 
5 hours later…
11:44
←.←
→.→
 
4 hours later…
16:05
I wish I wasn't going to die tonight :(
16:31
:5912 O.O
 
1 hour later…
17:31
Posted by Jeff Atwood on October 4th, 2010

As Stack Overflow has grown, it has started to have some decidedly big city problems. The one we are most concerned about is an influx of very low quality questions.

While we still believe in editing and improving low-quality questions to make them better, there’s a fundamental mismatch in scale and effort here — bad questions, asked in bad faith, have a tendency to overwhelm the good intentions of the average Stack Overflow user. So, we’ve decided to take some steps to block bad questions before they enter our system, and save everyone some effort. …

Although we don't really have the "big city" problem, we could still use this.
-1, our questions aren't bad, the main problem here is having people not mistake the answer box with the comment box
obviously the fact that at 1 rep you don't get to see where you'd post comments to begin with doesn't help...
Game-rec?
:5928 those are hardly a problem
And yet we've been staggling about this "non-problem" for.. what is it, 3 months now?
I failed to make an analogy about being a second class citizen
and now people are trying to argue about whether or not being gay is immoral
from now on I'm not allowed to make analogies
Jin
Jin
18:19
hey all
hi jin
Jin
Jin
tweaking last minute stuff on gaming design css. 99% done
of course, it will be 70% once it launches.. :)
@jin that's how projects are supposed to work. And thanks for the good work.
Jin
Jin
it really takes about 30% time to get a theme to look like 70% of my photoshop mockup, but then I spend the rest of the 70% time for the other 30% part...
so many lil obscure styles on the site. I learned a lot from Sketchy theme(then i forgot them). Learned them again from doing Web Apps css implementation.
 
2 hours later…
anyone know how to remove a package from ActivePerls PPM that is marked for upgrade?
dear god
I just spilled coffee on my table, destroying my lunch, ruining my new Papadimitriou book, getting my new droid 2 covered in coffee and soaking my macbook
you own too much stuff
That's right, no more furniture, no more lunch, no more literature, no more phones and no more computers! Go au natural!!!
sweet
20:38
well, I have algorithms problem set due tomorrow
So I can't afford to
btw, the things I ruined are the sum total of my posessions
I'm sorry
anything I can do to thelp?
lol. Here: Suppose that we have a very large array $A$ stored in row-major order. Your objective is
to compute the transpose $A^T$ of $A$. (Transpose of $A$ is also stored in row-major order).\\
Because $A$ is so large,  each row of the matrix fits in exactly one page. Because memory
transfers are so expensive,  once you transfer in a page, computing is essentially free.\\
How many memory transfers do you need to perform the matrix transpose?\\
(Your memory need not be large, it is sufficient to have just 2 pages in memory at any time.)\\
The result I'm getting is O(n + m/n), which is totally wrong
I suppose using a hashing function would be cheating...
how would a hashing function help?
Matrix = lambda(x,y) { return matrix(hash(x,y);}
though I think your professor wants an answer which addresses cycles in the permutations, rather than a hack which exploits closure
20:47
Actually, what I need is an analysis of memory transfers
the thingy that you suggested is beside the point because it assumes access to the entire matrix, which is too large to sit in main memory. Anyways. Looking at it a second time, I think I computed something closer to the cache miss ratio, which might be what I need
21:06
Well, what you could do is rearrange the pages first, and then mirror them relative to their position on the axis
then your O is n+k where n is the number of elements you have and k the number of pages
Think of pages:
AB
CD
if you rearrange the pages:
AC
BD
that's solves your page miss time
Whoa...!
what kind of game requires these kinds of calculations?
21:33
Right, but to solve A you divide it into AA, BA, CA, and DA and so on.
but you can only call in a page at a time
hee hee Im watching lost. Guess inception wasn't that original
22:20
:5931 oh boy, that sounds both awesome and awful
22:35
cmon google
Lee
Lee
@tzenes Are you about?
yes @lee
I am here
why is deploying taking so long tonight :/
Lee
Lee
You have two SC2 profiles, did you use the same Battle.net account? Did you install the game again into a different folder? Is it safe to ignore the warnings about profile directories already existing?
:5982 wait, does a page consitute a single row?
Lee
Lee
22:38
have two*
yes
:5991 I installed and then moved
:5994 ah, I assumed pages were contiguous
> The requested URL /chart... is too large to process.
:/
@tzenes a single page is a single row. The algorithm has to work for main memory being anywhere between 2 pages to the size of the entire matrix
hmmm thats very different
I would suggest looking for cycles then
if you had a cycle partitioning algorithm you should be able to do nlogn
22:41
wee. I just solved loop detection in a linked list in constant space and linear time
23:03
TrafficLeft will be "down" until I figure out how to string encode parameters
For now, that's my attempt for a graceful downgrade :P

« first day (81 days earlier)      last day (5254 days later) »