Stream processing is not new. There's been academic projects working on massively parallel systems for decades. One particular project I know of is UCSC's Kestrel processor, a 512-way 8-bit stream processor.In the late 90s this thing blew high-end desktops out of the water for linear processing tasks like image convolution and at a fraction of the power.
Really, GLQuake? you want quake-glide - it talks glide natively instead of through the OpenGL Wrapper. Or better yet Unreal/Unreal Tourment. Those games never looked better than when they were running on a Voodoo 2.
That's not the abstract, that's claim 1. The patent protects anything described in an independent claim(s) (in this case claim 1). The later claims only exist as backups in case claim 1 gets thrown out.
"A method in a computer system for conjugating verbs in a target language, the method comprising: receiving a verb in a base language; identifying verb forms in the target language using a translation of the received verb from the base language to the target language; and displaying the identified verb forms in the target language."
What is specific (or more importantly, non-obvious) about that?
I checked my 2x1.8GHz G5 workstation the other day. The whole thing (UPS, G5, 17" LCD, WAP) pulled 200W idle, 350W running two folding-at-home threads, 400W when I added in Google Earth.
... as long as the keys for each pass are different and there's no header.
A good encryption scheme doesn't have any header, for exactly this reason. It reads in n words and writes out n words and that's that. So if your coworker is doing:
C = E_K2(E_K1(P))
there are indeed 128 bits of information required to decrypt the document. Given given a plaintext+cyphertext pair a meet-in-the-middle attack might be possible, but the search space is still on the order of 2^128 (cryptanalysis could probably reduce this some). Given plaintext+intermediate+cyphertext, it's down to 2^64, because each half could be cracked separately.
With a good encryption algorithm the first pass ( E_K1(P) ) generates something approaching line noise - close enough so that there's no statistical way to tell real random bits from encrypted data (many RNGs now use encryption routines to boost incoming entropy). There is no structure, there is no header, and there is no way to verify that it's an encrypted anything. It might as well be a bunch of random bits. Given the cyphertext, your total search space to find the plaintext is still 2^64 * 2^64 = 2^128 sets of keys because there's no way to tell that the first round was performed correctly - it will always just be random bits.
Now, if there IS a header added you're back to n*2^64. For example, the software compresses (and thus adds a header to) the data before encrypting it. Given the cyphertext you can search for keys that decrypt to have a valid header, and then search for keys that produce reasonable english text from those outputs.
Your file size, and disk seek time, are the problem. Lets say your drive has a 5ms seek time (that's pretty damn fast). writing each file actually requires three writes: to the file allocation tabe, to the directory, and the contents of the file itself. Assuming the writes take another 5ms, that's 20ms per file. that limits you to 50 files per second. At 200kiB per file that's about 10 megs per second.
Hashing is only effective when an exhaustive search of the possible input space isn't feasible. How many phone numbers are there in the US? 10^10 at most. That's less than 34 bits of search space. An exhaustive search of that space would be trivial meaning than no matter how good the "encryption" of your phone number is, if the algorithm is known the number could be found trivially.
The Macintosh Drivers CD installs the drivers to support the following capabilities on your Macintosh computer:
* graphics * networking * audio * AirPort wireless * Bluetooth * the Eject key (on Apple keyboards) * brightness control for built-in displays
All that driver development would certainly create enough noise to insprire the "Apple switching to Windows" rumors we've seen pop up a few times recently.
The new forms of innovative software that can be created by any size developer will be made available for download via Revolution's Virtual Console service.
The little windows logo that replaces teh Mac at bootup tells me that this guy did his homework and was able to modify the EFI for it to load some custom bootloader
My initial reaction to seeing that is that what's happening is they've hacked BootX (which is responsible for displaying the apple logo) to emulate BIOS. I don't know if that's possible, but it seems like a viable approach.
I have pretty simple requirements for a database, I don't need triggers, stored procedures, or any of that stuff. What I need for web applications is a database that I can efficiently search, and that means fulltext indexes. Sure, there's plugins for Postgres that add fulltext indexes, but they require ungodly complex setup and tuning. With MySQL it's two keywords.
Sure, GMA 950 is not a good solution for playing [...] Halo 2
Um... last time I checked the only card that Halo 2 runs on is, effectively, a GeForce 3 with shared memory which, I'm pretty sure the, GMA 950 could wipe the floor with.
Slashdot Mirror
Unfortunately the article doesn't say it, but the big deal about the "modified version" is support for sensor bar based mouse movement.
Do you have stairs in your house?
Stream processing is not new. There's been academic projects working on massively parallel systems for decades. One particular project I know of is UCSC's Kestrel processor, a 512-way 8-bit stream processor.In the late 90s this thing blew high-end desktops out of the water for linear processing tasks like image convolution and at a fraction of the power.
Whatever you're smoking ...
I want some.
Really, GLQuake? you want quake-glide - it talks glide natively instead of through the OpenGL Wrapper. Or better yet Unreal/Unreal Tourment. Those games never looked better than when they were running on a Voodoo 2.
Yep, zero. None. Nadda. Zip.
That's not the abstract, that's claim 1. The patent protects anything described in an independent claim(s) (in this case claim 1). The later claims only exist as backups in case claim 1 gets thrown out.
What microsoft has patented is:
"A method in a computer system for conjugating verbs in a target language, the method comprising: receiving a verb in a base language; identifying verb forms in the target language using a translation of the received verb from the base language to the target language; and displaying the identified verb forms in the target language."
What is specific (or more importantly, non-obvious) about that?
> We decided to go with cable internet
Mistake #1.
You're a business. There's no reason a business should be using anything less than SDSL. It costs more for a reason - it's reliable.
quoth http://www.speakeasy.net/business/dsl/
> Symmetrical dedicated line DSL with throughput SLAs, rigorous uptime and repair time.
That means they guarantee it'll be fast, it'll work, and if it doesn't, they'll fix it fast.
If a couple hundred per month for internet is too much for your internet-dependent business it sounds like you've got bigger issues than packet loss.
I checked my 2x1.8GHz G5 workstation the other day. The whole thing (UPS, G5, 17" LCD, WAP) pulled 200W idle, 350W running two folding-at-home threads, 400W when I added in Google Earth.
... as long as the keys for each pass are different and there's no header.
A good encryption scheme doesn't have any header, for exactly this reason. It reads in n words and writes out n words and that's that. So if your coworker is doing:
C = E_K2(E_K1(P))
there are indeed 128 bits of information required to decrypt the document. Given given a plaintext+cyphertext pair a meet-in-the-middle attack might be possible, but the search space is still on the order of 2^128 (cryptanalysis could probably reduce this some). Given plaintext+intermediate+cyphertext, it's down to 2^64, because each half could be cracked separately.
With a good encryption algorithm the first pass ( E_K1(P) ) generates something approaching line noise - close enough so that there's no statistical way to tell real random bits from encrypted data (many RNGs now use encryption routines to boost incoming entropy). There is no structure, there is no header, and there is no way to verify that it's an encrypted anything. It might as well be a bunch of random bits. Given the cyphertext, your total search space to find the plaintext is still 2^64 * 2^64 = 2^128 sets of keys because there's no way to tell that the first round was performed correctly - it will always just be random bits.
Now, if there IS a header added you're back to n*2^64. For example, the software compresses (and thus adds a header to) the data before encrypting it. Given the cyphertext you can search for keys that decrypt to have a valid header, and then search for keys that produce reasonable english text from those outputs.
Seems like it wouldn't be that hard. Image Analogies would be perfect methinks.
no SQL injection
um, that's a server-side problem. The fact that the data is input through Flash doesn't change it one whit.
Did he actually say the "a href" and sutff?
:P
Quote marks are supposed to mean that it's a quote
Your file size, and disk seek time, are the problem. Lets say your drive has a 5ms seek time (that's pretty damn fast). writing each file actually requires three writes: to the file allocation tabe, to the directory, and the contents of the file itself. Assuming the writes take another 5ms, that's 20ms per file. that limits you to 50 files per second. At 200kiB per file that's about 10 megs per second.
It's not just the RIAA typoes we have to worry about, either
Best. Typo. Ever.
Q: What's geekier than playing board games with friends?
A: Playing Dungeons & Dragons with friend.
Q: What's geekier than playing Dungeons & Dragons with friends?
A: Playing Dungeons & Dragons with strangers.
Q: What's geekier than playing Dungeons & Dragons with strangers?
A: Playing Dungeons & Dragons with strangers, online.
Q: What's geekier than playing Dungeons & Dragons with strangers, online?
A: Playing Dungeons & Dragons alone, online.
Though thankfully, LARPing still has all that beat hands down.
Hashing is only effective when an exhaustive search of the possible input space isn't feasible. How many phone numbers are there in the US? 10^10 at most. That's less than 34 bits of search space. An exhaustive search of that space would be trivial meaning than no matter how good the "encryption" of your phone number is, if the algorithm is known the number could be found trivially.
This fits nicely with previous claims that developers of any size will be able to develop for the Wii (virtual console).
What's the extra panel on the front of the Wii for? (the one to the left of the cd slot)
Does that sound like homebrew to anyone else?
The little windows logo that replaces teh Mac at bootup tells me that this guy did his homework and was able to modify the EFI for it to load some custom bootloader
My initial reaction to seeing that is that what's happening is they've hacked BootX (which is responsible for displaying the apple logo) to emulate BIOS. I don't know if that's possible, but it seems like a viable approach.
I have pretty simple requirements for a database, I don't need triggers, stored procedures, or any of that stuff. What I need for web applications is a database that I can efficiently search, and that means fulltext indexes. Sure, there's plugins for Postgres that add fulltext indexes, but they require ungodly complex setup and tuning. With MySQL it's two keywords.
Sure, GMA 950 is not a good solution for playing [...] Halo 2
Um... last time I checked the only card that Halo 2 runs on is, effectively, a GeForce 3 with shared memory which, I'm pretty sure the, GMA 950 could wipe the floor with.