Domain: netdoor.com
Stories and comments across the archive that link to netdoor.com.
Comments · 11
-
Re:Never mind matrix....
And how about a KONG on a building?
-
All right, I'll buy one!You've convinced me! It's the best MP3 player for the money! I want one! One small problem...
No supported interface for anything except a Mac! How hard could it be to write a Windows driver? Surely not hard enough neglect 90% of the market! But perhaps the geniuses at Infinite Loop felt that mucking with Win32 code was beneath their dignity. Hey, who cares about making money? As long as we're cool!
-
Re:No more epic albumsWhen did the last epic album come out?
-
Re:1.1 gigabytes?
Fair enough -- but if procmail is working as advertised and you route the data to the bit bucket, I don't see how you'd know how much you get in spam/forwarded viruses.
Luckily for me, my ISP is one of the best on the planet (Netdoor), and they've filtered out Sircam mail at their mail server. I got a couple of the mails on the first day in the wild, I've never seen another since. Didn't even have to touch my procmail files.
-
doom2 map of some of MSU
I made a Doom2 map of some of Mississippi State U.
ftp://ftp.netdoor.com/users/pms/campus.wad
Not finished, but you can play in the post office and run across the street to the Union.
-
Re:Bullies
Our legal system has transformed from a mechanism for justice (if it ever was this way) to something that people with money use to get their way.
I'm not sure that is was ever anything else...A few month back I read T.H. White's The Once and Future King, a wonderful version of the King Arthur story (and the basis for the musical Camelot). In it, after Arthur has gotten rid of trial by combat and replaced it with trial by jury, he finds that nothing has really changed - the only difference is that instead of the victor being the side who can get the better fighter as its champion, the victor is the side who can get the better lawyer.
Maybe a loser-pays system would help.
"Loser pays" would make it very, very difficult for the "little guy" to sue corporate behemoths. Would you bring suit against Microsoft, knowing that if you lost you'd have to pay their legal fees? -
Re:arg! -- Whoops!There is a decent mirror at http://www.tuxedo.org/~esr/jargon/. From there I've fetched the complete list of mirrors, which follows.
List of Jargon Resources Mirror Sites USA:
- http://www.akrotech.com/~darkstar/jargon
- http://memes.org/jargon
- http://www.journalism.wisc.edu/jargon/
- http://www.mindspring.com/~li mbert/hacking/jargon.htm
- http://www.iscvt.org/jargon/jargon.html
- http://www.babcom.com/jargon/index.html
- http://www.hackboy.com/jargon
- http://www.pulhas.org/
- http://www2.netdoor.com/~lhand
- http://avatar.deva.net/
- http://www.blee.net/jargon
- http://www.fortuneci ty.com/skyscraper/jolt/15/jargonindex.html
- http://www.jargon.8hz.com/
- http://culture.0wnz-u.org/
- http://www.houseofhack.com/jargon
- http://jollyrogers.com/jargon/
- http://handel.math.psu.edu/jargon
- http://celestrion.totalaccess.net/do cs/jargon/
- http://www.pir.net/pir/jargon/
- http://www.technozen.com/tetsuo/jargon/
- http://ude.org/jargon
- http://web.chad.org/usr/doc/jargon-file/
- http://karnak.nmc.siu.edu/jargon/
Australia:
Austria: http://www.snafu.priv.at/jargon/Czechoslovakia: ttp://www.instinct.org/texts/jargon-file/
Finland: http://zone.pspt.fi/jargon/
Germany:
- http://www.ude.org/jargon
- http://www.ghks.de/computer/jargon/
- http://www.math.fu-berlin.de/~rene/jargo n/
- http://hex.rz.ruhr-uni-bochum.de/jargon/
- http://www.informatik.hu-berlin.de
/~bergt/jargon
Gret Britain: http://jargon.strugglers.net
Greece: http://www.hack.gr/jargon
Italy: http://beatles.cselt.stet.it/mirrors/jargon
Japan: http://www.vacia.is.tohoku.ac.jp/jargon/
Norway: http://www.pvv.ntnu.no/misc/jargon/ Poland: http://www.uci.agh.edu.pl/jargon/
Spain: http://www.undersec.com/jargon
Sweden: http://ftp.sunet.se/jargon/
U.K.:
-
personal "portal"
Check out the start page I made for myself. I keep it up-to-date and have gotten some good compliments on it. The tools are the best part of it. I use them often.
-
Re:This sucks.
You are incorrect, the reload time for the railgun is exactly the same as in quake2.
And if you dont like the way it looks you can change it:
set r_railWidth "16"
set r_railCoreWidth "6"
set r_railSegmentLength "32"Those are new defaults. Personally, i like to get rid of the segments all together. Set it to 1000 and check it out. Also try making the beam really thin.
For the latest news and 3 cool servers: http://www.netdoor.com/quake3/index.html
-
Re:Read It, Heard it, Bought the T shirt
NT 4 has DirectX 3 only. Which isn't much. No direct sound support, which makes it suck as a gaming platform. I doubt NT4 will ever a newer version of DirectX.
Win 2000 has a beta of DirectX 7 in it. I tried to run Half-Life using Direct3D under win2k and got 1 frame a sec. And I could not get get the Unreal Tournament demo to to run fullscreen using Direct3D.
Using OpenGL in win2k, i could get all of these games to run perfectly: Quake, Quake2, Q3test, Half-Life. Epic needs to work on the OpenGL support in UT. This is all on a TNT.
-
Re:So what the heck is a vector based computer anyThink of a vector processor as being super, super pipelined with dedicated hardware for jamming stuff into the pipe as quickly as possible. Similar to, but not exactly like an array processor. Both can be classified as examples of the Single Instruction-Multiple Data stream (SIMD) architecture, although they're implemented very differently.
Vector processing has one big advantage over massively parallel processing. Essentially, if you have a uniprocessor vector machine, and any appreciable amount of your code is vectorizable, you reduce total CPU time as well as wall-clock time. With massively parallel systems, you always pay for reduced wall-clock time with increased CPU time to synchronization overhead. A search on Amdahl's Law should turn up some interesting reading.
Looking back at some of my old documentation (~1990), I have these stats for a Cray Y-MP with a memory cycle time of 6 ns, and 2 FPUs/CPU:
1 CPU : peak throughput 333 MFLOPS
8 CPUs: peak throughput 2667 MFLOPSThese throughputs assume 100% vectorizable code. For the single CPU Y-MP running LINPACK with a vector size of 300 gets you 187 MFLOPS. However, with a LINPACK vector size of 1000, the throughput is 308 MFLOPS, which is approaching the peak throughput pretty closely.
I wish I had something that stated just how deep the vector registers are on a Y-MP. I suspect it's somewhere close to 100 (i.e., 100 stage pipeline!).
Anyway, this post is too long. Bye now.
Bill Wilson
The Keeper of Cheese