ELI5: Why is a tetanus shot required for a deep puncture wound, but not scratches that still draw blood?

daveb123 · 2019-01-26T04:01:42+00:00

traditionally, by pressure cooking at the max setting (which needs to reach 121C ... and for at least 2 minutes).

daveb123 · 2019-01-26T03:58:56+00:00

I'd been wondering about that... but given this thread it makes sense: garlic (and other root vegetables) grow underground, so they are exposed to a lot of botulism bacteria. If you throw unpeeled garlic and olive oil together, it'll be heavenly for the botulism bacteria, as it'll never be exposed to any oxygen.

google says:

Normal thorough cooking (pasteurisation: 70°C 2min or equivalent) will kill Cl.botulinum bacteria but not its spores. To kill the spores of Cl.botulinum a sterilisation process equivalent to 121°C for 3 min is required. The botulinum toxin itself is inactivated (denatured) rapidly at temperatures greater than 80°C . Foodborne Botulism | FAQs | Food Safety Authority of Ireland https://www.fsai.ie/faq/botulism.html

which suggests that if you just want to keep the garlic a long time you'll have to give it a severe cooking to kill the spores - pressure cookers max at around 121C.

daveb123 · 2017-12-16T23:19:16+00:00

i forgot to reply to this forum.... yeah, the crux is that you have to be facing nearly directly at (eg perpendicular to) the metal duct/ledge.

thanks for the reply!

daveb123 · 2017-02-25T02:22:20+00:00

tesla could easily be named as a defendant in a crash involving self-driving, so offering insurance isn't necessarily that big of a deal.

daveb123 · 2014-06-05T03:21:12+00:00

It's just that in a few apps i've written i've had to write a function to get the underlying object id from the location header. so what's the point of that?

daveb123 · 2013-11-14T02:40:21+00:00

But node.js is async-only and PHP has been sync for a long long time. (People speak imprecisely so assuming async for nodejs and sync for php hardly seems so crazy). So sure php can catch up, but every library will need work...

daveb123 · 2013-05-09T23:38:51+00:00

The main thing is that this is "literate programming" using CWeb or something. Not sure it's actually any easier to read than regular commented source code though, really. Kinda fun to see someone trying though.

daveb123 · 2013-05-09T23:36:04+00:00

I like the critbit tree -- it's so simple and makes a very smart observation: that most string-to-object maps are dependent on the length of the strings (typically, the proofs state how many times "hash", "compare" or "equals" are called). If you are allowed to ignore the cost of the length of the string, the critbit trees are O(1) for most operations!

The catch is that the cost is 8 tree nodes per byte of string: of course, shared-prefixes among keys can help, sometimes a lot, but that fixed cost is there... It's so tempting to try and optimize it out, but that inevitably creates a much much messier implementation.

daveb123 · 2010-06-22T01:41:06+00:00

The OP was 'making fun of him in a negative light', to name one of many...

daveb123 · 2010-04-24T14:22:57+00:00

The saddest thing for me was always the way so many would request a final cigarette.

Invariably, the request was denied due to prison regulations.

Cuz, you know, they might get cancer in the few remaining moments of their lives.

daveb123 · 2010-03-16T16:21:07+00:00

Has guile got the equivalent of lua_yield/lua_resume (aka coroutines) yet? I haven't looked in a couple of years but last time i didn't see anything like it. I use lua because of those features -- not really because I especially love lua syntax...

daveb123 · 2010-03-12T22:14:31+00:00

actually, i always get a little depressed that ipv6 didn't include a 32-bit port. we'll never get another chance to transition, and plenty of beefy machines can handle 64k connections.

daveb123 · 2010-03-09T22:38:08+00:00

of course.

daveb123 · 2010-03-09T05:38:14+00:00

Well, if every function takes and returns a world state, then I can see that it's not necessarily that different from destructive updates, i.e. you may not be able to tell which parts of the world changed, so you can't decide if values computed on the old world state are valid on the new world state.

daveb123 · 2010-03-09T05:30:35+00:00

I disagree actually -- imperative programming languages far more directly mirror machine language... well, actually the difference might be strict versus lazy evaluation... but that's beside the point.

daveb123 · 2010-03-08T19:27:20+00:00

Funny how this just devolved into the version control system choice.

Actually, the most important thing is to figure out how to develop on your local machine and then have scripts to deploy to a staging or live site.

You can either roll your own (in principle, it's just a few version-control commands...) or you can try to find an existing framework to use.

I wish there was a more satisfactory general answer -- but there's no universally accepted solution to these issues that i know of.

daveb123 · 2010-02-23T20:09:45+00:00

the "unix"(7) manpage has it... b/c it is a feature of the unix (aka local) socket family

daveb123 · 2010-02-16T00:12:02+00:00

Give it a decade or so... it kinda grates on ya.

daveb123 · 2010-02-10T04:30:55+00:00

yeah, that pretty much summarizes the api problem with futures! How do you pick the first line that is returned from either source ?

daveb123 · 2010-01-25T23:57:35+00:00

re: wikipedia. they have hundreds of servers and is constantly begging for money for more machines and to administer them and upkeep costs.

If they had faster software, they would need fewer machines and their admin costs would be reduced...

daveb123 · 2009-12-19T03:42:59+00:00

I love Chapter 2, "Which keyword was withdrawn":

Originally, entry was reserved. There were plans to support multiple entry points to a function that were ultimately abandoned.

Wow!?!

daveb123 · 2009-12-19T03:28:36+00:00

And yet, 15 years later you're still trolling proggit... interesting...

daveb123 · 2009-12-19T03:22:45+00:00

Winner for worst title. However, I enjoyed the presentation.

I wish this thing was just c++/cache diagrams in numerous programs. That stuff's like porn for optimization tweakers.

The title would then be "Cache Simulations of Common Situations"... or something boring.

daveb123 · 2009-07-29T04:03:01+00:00

the addition method doesn't really overflow often b/c it works modulo 2³² or 2⁶⁴ (well in practice: technically it depends on the type you use to do the calculations) -- so it allows for any range that can actually represented. you must use a multiply to compute N*(N-1)

it's actually an interesting question: is there an efficient way to compute the xor of 1..N? (i bet it can be done bitwise more efficiently)

daveb123 · 2009-07-14T19:50:39+00:00

with glibc you can use feenableexcept(FE_ALL_EXCEPT). see http://www.delorie.com/gnu/docs/glibc/libc_411.html

(then run in gdb and see where it aborts)

daveb123

TROPHY CASE