Jengu

I'm currently on Tmobile but thinking of switching to Simple Mobile. I've been Googling to try and figure out which variants can do 4G on which carriers. Here's what I'm confused about:

1. I see a lot of listings saying the international S3 supports 2100 but not 1700 frequency. Does that mean it won't be able to do Tmobile's 4G when it's made available? Tmobile's 4G will require "1700/2100" but I don't know if that means my phone needs both or just one.

2. Simple Mobile also says they need 1700/2100 for 4G, but they use a mix of AT&T and Tmobile towers. Which would make me think that AT&T must also be using 1700/2100 for their 4G -- suggesting I could buy the AT&T S3 and use it

I've read that ethanol extraction is better, and looking at the original paper showing the nerve growth benefits it looks like that's the technique they used. I'm interested in Lion's Mane but all the brands I see on Google either say hot water extracted or confusingly say "hot-water/alcohol extract". How important is the distinction likely to be, and does anyone know where I can find ethanol extracted Lion's Mane? (I'm in the USA)

On pg. 91, (if you don't have the book, go here, and search for 'adler') the authors include an example implementation of the Adler 32 checksum algorithm in Java and Haskell. Both the Java and the Haskell implementation do a bitwise and (& in Java, .&. in Haskell) of each byte against 0xFF. Since 0xFF is the maximum value you can store in a byte anyway, and thus is all 1s, I fail to see what this accomplishes? In Java they're doing the operation on the byte type, which AFAIK is limited to the 0-255 range. It's unclear what the types are in the Haskell case, it occurred to me

Hardware reservations:

• No flash camera
• No HDMI out
• No front camera
• 4" screen (as opposed to 4.3")

Software reservations:

• No Froyo
• Touchwiz (I prefer stock)

It sounds like the software stuff will eventually be taken care of by cyanogen mod, so I'm more worried about the hardware stuff. I'm upgrading from a G1, so I know a vibrant will be better in just about every way, but one of my big beefs with the G1 was that it just all around sucked for taking pictures. The camera app would take forever to load (the moment would probably have passed) and then camera would take forever to adjust to the light level, and then it would turn out dark anyway, so the lack of flash really concerns

I have one of the original G1s and it totally sucks compared to the newer Android phones. Even with Cyanogen Mod, which is totally awesome, it's very sluggish compared to newer phones. I really like the big 4.3" screens, but AFAICT the best I can do on T-mobile is to get the Samsung Vibrant, which is 4" (I have big hands so I think the bigger screen will be a good fit). I'm on contract with T-mobile until April, so I either have to stick with their selection or go for an unlocked GSM phone to stick my sim card into (I'm willing to pay the up front cost because then in April I can switch to the month-to-month pricing). Is there a phone I'm missing, or maybe something coming up soon I should w

I have a laptop, a desktop, both running Linux, and work desktop running Solaris. And I like to experiment with new distributions from time to time. I've started putting all my configuration files in ~/etc and symlinking into there (e.g. ~/.zshrc -> ~/etc/zshrc). But I have to remember to do all of the symlinking by hand each time I set things up on a new machine. I'd like to 'solve' this problem once and for all, my plans are:

1. Track config in git (done)
2. Write script that bootstraps my home directory.
3. Create a VM with a fresh ubuntu install, and have it run the bootstrap script and run tests afterward (e.g. make sure emacs launches with no errors so no modules are missing, same

I know I can press f3 a second time when recording a macro to insert an incrementing integer, which is pretty nifty, but what would be even cooler is if I could get the same effect but inserting enum values (not the integers but the named values) for a given enum. I suspect this information is already stored by ctags/etags/global (I use global) since they can do lookups of enum values, but I don't know how to get at that in elisp. This would be nice for generating switch/case statements in C. Anybody done anything like this already?

If I generate a bunch of random numbers and plot them, I'll see a bell curve. That I can predict that suggests it's nonrandom. Why do random numbers make predictable graphs? Wouldn't it be more random to always get back a different graph? Is there a different term for that 'kind' of randomness?

Edit: To give some background for explanations, I've taken calculus but never statistics and know that generated 'random' numbers aren't really random. But the less background needed to understand a response the better, for other redditors sake.

Edit edit: Sorry, I indeed did mean if you plot the distribution of the numbers. Some have pointed out that this is a characteristic of a particular rando

I've tried duct tape, but the blue LEDs on the front of my desktop and laptop shine brightly through duct tape (even 2 layers). I live in a studio so I can't just take the devices out of my bedroom. I have a wii, a desktop, a laptop, a wireless router, a cable modem, a microwave, and an air conditioner, and they all want to shine their goddamn lights on me while I sleep. I'd prefer something that's easy to remove later without affecting their resale value. Any ideas? Thought I had it made with the duct tape.

Edit: Bonus if the solution still somehow lets me see the lights during the day (so I can know my hard disk is busy and such) without extra work.

One interesting variety of OS are single-address-space OSes, where there is only one giant address space (no per-process addressing, and no separate physical vs. virtual addressing). The TLB is literally turned off. I believe the MS research OS Blowfish does this for example. In order for it not to be a security nightmare you have to combine it with some other tech (proof carrying code, or running everything on top of a trusted virtual machine, etc.) but there's no reason it can't be made secure. There's a significant performance advantage, and a lot of implementation details for the OS should become simpler.

I think it'd be cool to hack on such an OS, but the problem of needing to implemen

I'd like to enable hungry delete for all my buffers permanently, but I can't get it to work. I put the following in my .emacs:

(require 'cc-mode)
(global-set-key (kbd "C-d") 'c-hungry-delete-forward)
(global-set-key (kbd "DEL") 'c-hungry-delete-forward)
(global-set-key (kbd "<backspace>") 'c-hungry-delete-backwards)

The require is necessary because without it the functions don't exist, which seems a bit silly because there's nothing specific to C about hungry delete. With the code above hungry delete seems to work in the buffer where I edit my .emacs, but not in any of my C++ source code buffers! I've tried restarting emacs in case all of my frames weren't affected or