Slashdot Mirror

Women leave CS courses for the same reason they leave all hard science courses.

You can't bullshit and blather your way through it.

Sure you can. Men do it all the time. Or have you never worked with men who are incompetent?

Women have incredibly fragile egos (in case you were wondering, that's why feminists bang on about 'male ego' virtually everything they say is projection)... and they are exposed in hard science courses.

Opinion, with no data to back it up. And yes, the fragile male ego thing is real. Go look at how a guy reacts to being turned down by a woman. "She's probably a lesbian." Stalking. Saying it was really him that gave her the brush-off. The simple fact is that women recover better from break-ups than men. And let's face it - it's usually the woman calling the shots as to when it's over, not the men. Just look at which sex files for divorce more often.

Actual maths courses are particularly brutal - you can't hide, you can't hamster away the fact that there are people better than you, you can't skip sections of the work (it all builds on the previous bit) and neat handwriting/platitudes get you nowhere.

Again, opinion with no proof.

We all know it, but we all dance around the subject to... as we always do... protect women's feelings.

They drop out and go do courses that reward waffling and woolly thinking.

That "reward waffling and woolly thinking" is very much a male thing, everywhere from managers bullshitting and shouting their way through meetings, not to mention pissing contests, to the current occupant of the White House.

If they are particularly bitter about it, they'll start blaming men and claim it's male competitiveness or that the system was stacked against them.

Not male competitiveness - male incompetence. The inability of men in a group to act professionally when women are around in small quantities that they see as being safe to harass, ignore, sabotage, and claim that the work the women did is irrelevant, wrong, or worse - appropriating it as their own work instead of giving credit where it's due.

Ignore it, like all women, they will do/say anything to avoid facing reality.

Says the anonymous coward, who hides behind his anonymity to avoid taking any responsibility for his foolish fact-free words.

Since 2014 I've been reading about hardware-based detection. I'm starting to think this is just panacea... like those cloud-based antivirus engines that never picked up anything. Here's a bunch of research on the topic: http://www.ieee-security.org/T... http://caslab.eng.yale.edu/wor... http://www.cs.binghamton.edu/~... http://www.cs.binghamton.edu/~...

Since 2014 I've been reading about hardware-based detection. I'm starting to think this is just panacea... like those cloud-based antivirus engines that never picked up anything. Here's a bunch of research on the topic: http://www.ieee-security.org/T... http://caslab.eng.yale.edu/wor... http://www.cs.binghamton.edu/~... http://www.cs.binghamton.edu/~...

I googled this and found this from an OGML discussion going on about this GPU. There are some screenshots and even a youtube video.

Since 2010, Jeff Bush (github, blog) has been working on an Apache-licensed open source GPU (github, home page, wiki), and he has a few other interesting github projects as well (link, link, link). The Nyuzi Processor is a fully functional GPU. It is written in synthesizable Verilog, has a functional compiler toolchain, and comes with test suites, benchmarks, the software component of 3D rendering engine, and more. Its development has been gaining momentum in discussions (link, link, Google Group) and coding projects (gsoc). It has been implemented on an Altera FPGA, and there are some videos online of it animating a rotating teapot and a Phong-shaded torus, along with the results of recently-added mipmap support. Recently, Jeff Bush got together with the founder of the Open Graphics Project, and they co-wrote a peer-reviewed publication about this GPU and some experiments they did, which was recently presented at a well-respected academic CS conference (ISPASS). Although its developer and other hobbyists are doing this for fun, academics and engineers who specialize in GPU architecture are already showing interest in using Nyuzi for their own research (e.g. link, link), which gives them finally an open platform to estimate not just cycle count but also clock frequency, energy, and circuit area effects of GPU design experiments.

I don't understand why simply putting the closed source firmware on the card suddenly makes it ok for free software. Same code, just different home.

Back in the days of the Open Graphics Project (since defunct, although Timothy N. Miller is still working in this area and the mailing list is still active for those interested in the subject), we had several discussions about the borders between Free software, open firmware, and open hardware.

As I understood the FSF's position at that time, the point is that if the firmware is stored on the host, it can be changed, and frequently is (i.e. firmware updates). Typically, the manufacturer has some sort of assembler/compiler tool to convert firmware written in a slightly higher level language to a binary that is loaded into the hardware, which then contains some simplistic CPU to run it (that's how OGD1 worked anyway). So, the firmware is really just specialised software, and for the whole thing to be Free, you should have access to the complete corresponding source code, plus the tools to compile it, or at least a description of the bitstream format so you can create those. This last part is then an instance of the general rule that for hardware to be Free software-friendly, all its programming interfaces should be completely documented.

If the code is put into ROM, it cannot be changed without physically changing the hardware (e.g. desoldering the chip and putting in another one). At that point, the FSF considers it immutable, and therefore not having the firmware source code doesn't restrict the user's freedom to change the firmware, since they don't have any anyway. The consequences are a bit funny in practice, as you noted, but it is (as always with the FSF) a very consistent position.

We (of the OGP-related Open Hardware Foundation, now also defunct; the whole thing was just a bit too ambitious and too far ahead of its time) argued that since hardware can be changed (i.e. you can desolder and replace that ROM), keeping the design a secret restricts the users freedom just as well. So, we should have open hardware, which would be completely (not just programming interfaces, but the whole design) documented and can therefore be changed/extended/repaired/parts-reused by the user. The FSF wasn't hostile to that idea, but considered it beyond their scope. Of course, any open hardware would automatically also be Free software-friendly.

I tend to agree that in practice, especially if there are no firmware updates forthcoming but it's just a cost-savings measure, loading the code from the host rather than from a ROM is a marginal issue. Strictly speaking though, I do think that the FSF have a point.

There are 3d food printers. However, they are limited to single materials they can extrude (icing is popular, I think some cake shops use 3d icing printers).

Best 2d cake printing EVAR!

I put the contest rules in a pdf, at http://bingweb.binghamton.edu/~scraver/underhanded/ until the main site is back up again.

As long as we've got your attention, I'd like to note that the 2005 entries can't be accessed.

I like Michael R. Head's description of VC as "Saving All Your Work Forever":
http://www.cs.binghamton.edu/~mike/seminars/cvs-svn-bzr-bucs-seminar-2007.pdf .

In truth, though, you're wrong. I earned quite a lot in Moscow; considering the difference in expenses, I'm not that much better off here.

Though, I suppose that salary is not the last thing you've taken in consideration before leaving, even if you in the end didn't get the amount of money that you wanted because of crisis. But I'm not going to speculate on the facts that I do not know for certain. Let's assume that I am wrong at this particular point.

I must ensure you that I'm also against empire ideology, bullshit about "dukhovnost", Mr Putin etc. etc. And I dont think that our political beliefs are fully uncompatible. But dou you know what's the difference between you and me? The difference is that I actually do something to change the situation.

If you consider me a traitor because I put my beliefs above my blood, then so be it.

I don't consider you a traitor. I consider you a conformist. Bacause you run instead of changing something. "People do not want this" is just a lame excuse not to take responsibility. I'm sure that you're enough educated and you are not so shortsighted to think that things change on their own -- of this in human history there have been no cases. Things change when there's enough people that can take responsibility, have enough will to struggle and will to sacrifice.

You think that there's not enough of those people in Russia? -- popularize your beliefs! Have you ever tried? I bet you didn't. Yes, and I am devilishly sure that you dont give a damn neither about what's going on in Canada apart of the things that touch your own ass nor about what's going on in Russia. Neither about some friend of your parents which is now beaten by a Russian cop nor about what purpose Canadian troops serve in Afghanistan. If Canadian troops have got nothing to do with fighting terrorism of civil liberties and have lot's do to with securing CIA control over heroin production, well... who cares?!

I want to live in a country to which I can truly commit myself as a productive citizen and a member of the society, and know that such commitment isn't wasted and is reciprocated. In a country where I could, with good conscience, sign up for military service and know that it serves the better good - or see my children do the same.

You will never trully commit yourself as an a citizen of any country because you don't feel responsible for other people.

I do not owe you or the country in which I was born (that one doesn't even exist anymore, in fact) anything.

I suppose that your ex-countrymen stopped to exist too. Oh yes, you don't owe me anything! And also I have no reason to respect you.

And I have no obligation to stay on a sinking ship when everyone else on board refuses to admit that it's sinking.

Please, don't consider this as an insult, but I suddenly remembered the old adage that the first ones to run from the sinking ship are rats.

Btw, I can offer this piece for a short introduction to and summary of the affair for those interested. "Geopolitical Chess: Background to a Mini-war in the Caucasus", Immanuel Wallerstein http://fbc.binghamton.edu/239en.htm

Home Depot has extra large superconducting electromagnets, right?

No, they dont. Wal-Mart has Yttrium, Barium, and Copper Oxides on sale right now though. Pick up a tube furnace and a compressed oxygen cylinder and you can make your own

http://materials.binghamton.edu/labs/super/superc.html

What's interesting to note is that the method for solving the cube in the least number of moves is NOT the fastest - there are very few speedcubers that use this method in competition.

The majority of speedcubers (myself included) use a method developed by Jessica Fridrich over 20 years ago commonly referred to as F2L (first two layers).

It takes quite a few more turns to solve the cube, but when you are executing 4-6 quarter-turns per second it's not speed of turning that slows you down, it's how fast you can recognize your next move.

I'll stick with the Fridrich method! http://www.ws.binghamton.edu/fridrich/cube.html

Evolution would still happen in a universe of infinite resources, just in a different way. Things that reproduced faster/more prolifically would be more common, and the more of any one reproducing thing there is, the more mutants it would produce, and the even-faster mutants would in turn become more common...

Anyway, no, 'wealthier families having fewer children' isn't a universal truth - but in anything like the current social, political, and technical environment we're in, it's a strong overall tendency, and that's enough for a control input. Lots of perfectly stable, predictable systems can be built from stochastic, random-with-some-bias processes. See, e.g., here.

Again - "Evolution For Everyone", David Sloan Wilson.

Evolution would still happen in a universe of infinite resources, just in a different way. Things that reproduced faster/more prolifically would be more common, and the more of any one reproducing thing there is, the more mutants it would produce, and the even-faster mutants would in turn become more common...

Anyway, no, 'wealthier families having fewer children' isn't a universal truth - but in anything like the current social, political, and technical environment we're in, it's a strong overall tendency, and that's enough for a control input. Lots of perfectly stable, predictable systems can be built from stochastic, random-with-some-bias processes. See, e.g., here.

Again - "Evolution For Everyone", David Sloan Wilson.

While its fun/popular to make fun of the US and English speakers, few other language groups will praise someone for their broken sentences as they make their first attempts. Most people are pretty touchy when their tongue is mispronounced. Perhaps that is fair but I wouldn't say its English speakers looking down on others due to their language (perhaps other things but not language).

What's your basis for claiming this? I live in a majority/minority county of the USA, with a 45% foreign-born population, and I see plenty of US-born, "white" Americans get impatient and annoyed at all those people who can't speak English good 'round these parts.

I think the separation you wish us to conceive between the image of ethnic groups and the image of their languages is artificial, too.

You could argue that people should travel to see the world but when you have a nation that is large and varied as a majority of Europe, what's the need?

The USA is nowhere near as varied as even England, much less Europe. (Maybe you do need to travel to see the world.)

Wait a few years and most Americans will at least be bilingual, the schools have really picked up the amount of Spanish taught.

*ROFL*

Yeah, right. Not going to happen. We'll end up just with a bigger bunch of Anglo-Americans who took some Spanish in high school, and can do nothing with it beyond racist jokes that they think are clever.

Spanish is widely regarded as a "low" language in the USA. As long as this is true, there is a major sociolinguistic impediment to large numbers of non-Hispanics learning much Spanish.

Here's a good few:

http://isis.poly.edu/~forensics/pubs/icme2007.pdf

http://www.ws.binghamton.edu/fridrich/Research/Luk FriSPIE06_v9.pdf

http://www.ws.binghamton.edu/fridrich/Research/dou ble.pdf

http://ieeexplore.ieee.org/iel5/10206/32570/101109 TIFS2006873602.pdf?arnumber=101109TIFS2006873602

The actual signatures can be retrieved from signal processing methods. I wouldn't have believed that each
camera has its own unique signature (although I have noticed that one or two pixels will be fixed to a particular colour), and that this can be recovered even after JPEG compression.

Here's a good few:

http://isis.poly.edu/~forensics/pubs/icme2007.pdf

http://www.ws.binghamton.edu/fridrich/Research/Luk FriSPIE06_v9.pdf

http://www.ws.binghamton.edu/fridrich/Research/dou ble.pdf

http://ieeexplore.ieee.org/iel5/10206/32570/101109 TIFS2006873602.pdf?arnumber=101109TIFS2006873602

The actual signatures can be retrieved from signal processing methods. I wouldn't have believed that each
camera has its own unique signature (although I have noticed that one or two pixels will be fixed to a particular colour), and that this can be recovered even after JPEG compression.

You are aware that the age of consent in some parts the United States (Delaware) was seven as recently as the mid 18th century right?

http://www.ws.binghamton.edu/fridrich/publications .html

I'm familiar with some of her work. Specifically, the papers "Detection of Copy-Move Forgery in Digital Images", "Determining Digital Image Origin Using Sensor Imperfections", "Digital Bullet Scratches for Images", "Digital Camera Identification from Sensor Noise",

However, the paper "Detecting Digital Image Forgeries Using Sensor Pattern Noise" from last year covers the topic of this article perfectly.

Now all of these are likely to be rejected. Even plain text email sent with a large subscription SMTP server is now getting blocked by some friends and family members' service providers simply because the domain of the address (my personal web domain) is not whitelisted and this hits the SPAM score where it hurts.

What's even worse then that are the admins without a clue that silently drop e-mail. The sender has no idea that it was rejected and the recipient never received it. I know of at least one major university that was doing this for awhile. E-mails sent with attachments that they deemed 'dangerous' (zip files!) were silently dropped.

The proper solution isn't to filter more

I don't think there can be a long lasting technological solution to this problem.

Free Seismology Programs for Windows:

Seismic/Eruption, Seismic Waves and data retrieval. View earthquakes and volcanic eruptions in close to real time. Developed for the Geology Hall of the Smithsonian.
AmaSeis, a program to obtain seismographs from the AS-1 Amateur Seismometer. The AS-1 is based on a classic project from Scientific American's "The Amateur Scientist."
EqLocate. An interactive program to locate earthquakes.

And the least time in which I could solve the cube was 20 minutes.

Using a few simple, easy-to-learn algorithms, and with a few weeks practice it is possible for pretty much anyone to solve the 3D cube in just 2 or 3 minutes. Using a layer-by-layer method you can solve each piece one at a time in the first two layers, then learn 4 algorithms to fix the last layer (not necessarily in this order):

1) Rotate edges
2) Rotate corners
3) Permute corners
4) Permute edges

Sometimes you will have to use an algorithm twice. Each algorithm takes about 10 moves, and at a slow speed of one move per second and a bit of luck you can solve the last layer in under a minute. Here's a beginner's guide:

http://peter.stillhq.com/jasmine/rubikscubesolutio n.html

If you want to get faster you need to learn more algorithms so that you can complete two steps at once.

A popular method which can be used to get very fast times is the Fridrich method, but it requires a lot of memorisation and lots and lots of practice:

http://www.ws.binghamton.edu/fridrich/cube.html

Personally I managed to get times of under 1 minute by practising the cube every day in the bus to and from work.

You could say it's both. There are a few steps, and by just looking at the cube you can see what needs to be done for the step you are on (and usually the step after it). Being able to see what needs to be done with those steps isn't too hard with practice, or at least isn't for me- and I'm far from a mathematical genius. The tough part is the finger dexterity to move the cube fast enough.

Currently the fastest method I'm aware of is Jessica Fridrich's.

The first few steps in any method get you to a point where you have 2/3rds of the cube "solved." I can usually see the pieces for each of these steps and do it fairly quickly. With Jessica's method the last 1/3rd of the cube can be solved by using 1 of 40 algorithms, followed by 1 of 13 algorithms. Once you've memorized these algorithms and the orientations in which they must be used, it becomes almost second nature to solve the last step.

Jessica Fridrich has kindly published her notes on the process of speed cubing: http://www.ws.binghamton.edu/fridrich/cube.html

Watch her solve cubes!
http://www.ws.binghamton.edu/fridrich/video.html#l ast

Jessica Fridrich has kindly published her notes on the process of speed cubing: http://www.ws.binghamton.edu/fridrich/cube.html

Watch her solve cubes!
http://www.ws.binghamton.edu/fridrich/video.html#l ast

It's really not that hard to solve a cube in around a minute. You can learn the basic, layer by layer method in about a day, and after a few more, you've got it down to under two minutes. Then you just keep doing it to get it too about a minute, and all your friends will be amazed!! (it's seriously fun to do it on a subway, everybody looks in amazement :D) Too get a time consistantly under a minute, you probably need to learn more advanced methods, like for instance the petrus system or the friedrich system. Variations on the latter is what all the pros use, but it is murder to learn, you have to memorize around 100 algorithms!!! Myself, I've gotten down to about 30 secs using the standard, layer-by-layer and some of friedrich's algorithms. It really is alot of fun.

People can observe the elections by sitting in the voting areas, watch the people putting their piece of paper into the box, and walking away. They can observe the votes.

Can the also observe the counting, and the empty ballot box at the beginning? Under regular conditions without having to request a manual count?

And why is code review off limits?

Because malicious code may look innocent, the ability to verify any piece of code should not be a requirement for participation in any democratic activity, and people generally are bad at reading memory sticks and CDs.

Correct. If you read up on the folks running it (http://www.princeton.edu/~sacraver/, http://www.ee.binghamton.edu/pages/craver.html, http://www.ws.binghamton.edu/fridrich/), you'll see that much of their research has obvious military and national security applications (see http://www.ws.binghamton.edu/fridrich/projects.htm l for examples).

Other articles, such as http://www.papillonsartpalace.com/howT.htm, http://inside.binghamton.edu/May-June/10MAY01/frid rich.html, and especially http://inside.binghamton.edu/November-December/13d ec01/security.html point to the common theme of research into countering covertly evil data or programs. This contest, then, could contribute towards this goal by offering numerous known examples of how innocent-looking code could conceal malicious conduct. Presumably this knowledge would/could be rolled into systems for intercepting or identifying actual instances of this kind of sneakiness "in the real world" (ie, our good friend Homeland Security).

I am also captivated by Dr. Fridrich's Rubix cube skills. And to think, I just graduated from SUNY B and never even met her. A shame.

Correct. If you read up on the folks running it (http://www.princeton.edu/~sacraver/, http://www.ee.binghamton.edu/pages/craver.html, http://www.ws.binghamton.edu/fridrich/), you'll see that much of their research has obvious military and national security applications (see http://www.ws.binghamton.edu/fridrich/projects.htm l for examples).

Other articles, such as http://www.papillonsartpalace.com/howT.htm, http://inside.binghamton.edu/May-June/10MAY01/frid rich.html, and especially http://inside.binghamton.edu/November-December/13d ec01/security.html point to the common theme of research into countering covertly evil data or programs. This contest, then, could contribute towards this goal by offering numerous known examples of how innocent-looking code could conceal malicious conduct. Presumably this knowledge would/could be rolled into systems for intercepting or identifying actual instances of this kind of sneakiness "in the real world" (ie, our good friend Homeland Security).

I am also captivated by Dr. Fridrich's Rubix cube skills. And to think, I just graduated from SUNY B and never even met her. A shame.

Correct. If you read up on the folks running it (http://www.princeton.edu/~sacraver/, http://www.ee.binghamton.edu/pages/craver.html, http://www.ws.binghamton.edu/fridrich/), you'll see that much of their research has obvious military and national security applications (see http://www.ws.binghamton.edu/fridrich/projects.htm l for examples).

Other articles, such as http://www.papillonsartpalace.com/howT.htm, http://inside.binghamton.edu/May-June/10MAY01/frid rich.html, and especially http://inside.binghamton.edu/November-December/13d ec01/security.html point to the common theme of research into countering covertly evil data or programs. This contest, then, could contribute towards this goal by offering numerous known examples of how innocent-looking code could conceal malicious conduct. Presumably this knowledge would/could be rolled into systems for intercepting or identifying actual instances of this kind of sneakiness "in the real world" (ie, our good friend Homeland Security).

I am also captivated by Dr. Fridrich's Rubix cube skills. And to think, I just graduated from SUNY B and never even met her. A shame.

Correct. If you read up on the folks running it (http://www.princeton.edu/~sacraver/, http://www.ee.binghamton.edu/pages/craver.html, http://www.ws.binghamton.edu/fridrich/), you'll see that much of their research has obvious military and national security applications (see http://www.ws.binghamton.edu/fridrich/projects.htm l for examples).

Other articles, such as http://www.papillonsartpalace.com/howT.htm, http://inside.binghamton.edu/May-June/10MAY01/frid rich.html, and especially http://inside.binghamton.edu/November-December/13d ec01/security.html point to the common theme of research into countering covertly evil data or programs. This contest, then, could contribute towards this goal by offering numerous known examples of how innocent-looking code could conceal malicious conduct. Presumably this knowledge would/could be rolled into systems for intercepting or identifying actual instances of this kind of sneakiness "in the real world" (ie, our good friend Homeland Security).

I am also captivated by Dr. Fridrich's Rubix cube skills. And to think, I just graduated from SUNY B and never even met her. A shame.

Correct. If you read up on the folks running it (http://www.princeton.edu/~sacraver/, http://www.ee.binghamton.edu/pages/craver.html, http://www.ws.binghamton.edu/fridrich/), you'll see that much of their research has obvious military and national security applications (see http://www.ws.binghamton.edu/fridrich/projects.htm l for examples).

Other articles, such as http://www.papillonsartpalace.com/howT.htm, http://inside.binghamton.edu/May-June/10MAY01/frid rich.html, and especially http://inside.binghamton.edu/November-December/13d ec01/security.html point to the common theme of research into countering covertly evil data or programs. This contest, then, could contribute towards this goal by offering numerous known examples of how innocent-looking code could conceal malicious conduct. Presumably this knowledge would/could be rolled into systems for intercepting or identifying actual instances of this kind of sneakiness "in the real world" (ie, our good friend Homeland Security).

I am also captivated by Dr. Fridrich's Rubix cube skills. And to think, I just graduated from SUNY B and never even met her. A shame.

Their setup: The 'crystal' mentioned in the mainstream articles, is a z-cut lithium tantalate crystal (LiTaO3), with the negative axis facing outward onto a hollow copper block. A tiny tungsten probe (80 microns long and 100 nm wide) is then attached to the other crystal face. This probe acts as a tiny mast for the electric field so that there is a powerful electrical field at the tip of the probe. Then there were a bunch of fancy neutron-counters and single-photon counters bundled around it.

What they did: First they added deuterium gas (at 0.7 Pa) and then cooled the crystal down using liquid nitrogen (to 240 K). Then they used a little heater to increase the chamber temperature slowly.

What happened: Less than 3 minutes later, and still below 273 K (0 degrees Celcius), the neutron signal rose above the background level. There were x-rays coming from the probe tip, and a whole bunch of neutrons. After a few more minutes, the electric field was so strong that it caused arcing between the probe tip and the enclosure (because they kept heatingthe crystal, and the field thus kept getting stronger). The arcing stopped the process (and I'd guess it damages the crystal?).

They added a few links in the article to previous papers: a pdf describing the concept they are trying to harness, another pdf with more about how they use the crystals with the deuterium gas, and a brief abstract.

I think this is pretty cool. I bet/hope that before long (within 10 years), this will be powering small extrasolar probes.

Pretty neat stuff. I don't even mind dupe posts when they're on such important stuff.

... countermeasures against steganalysis are also emerging [11].

11. Westfeld A. (2001), "F5-Steganographic algorithm: High capacity despite better steganalysis", Lecture Notes in Computer Science 2137 289-302 (Springer-Verlag).

Fridrich J., Goljan M., Hogea D. (2002), " Steganalysis of JPEG Images: Breaking the F5 Algorithm", 5th Information Hiding Workshop 310-323 (Noordwijkerhout, The Netherlands).

So TFA article cites countermeasures from 2001, even though a method of defeating those countermeasures was published in 2002.

The above is just one example. Overall, TFA seems poor and out-of-date. This is a case where the F in "TFA" does not stand for "fine".

check out this:

CS 480G GAME DESIGN

I'm currently enrolled in a cs class at Binghamton University (State School in NY) where the goal is to have all the students develop a free game entirely GPL'd.

To elaborate a bit, I think it needs to be defined the difference between merely being able to recognize and follow a learned pattern, and being able to articulate which pattern you recognized, and being able to articulate the steps following recognition.

You can solve Rubik's cube because you're experienced with it, and you have a "feel" for it, meaning you have some pattern recognition of the activity, but you don't have the depth of understanding to explain to me how to solve a cube in the manner that exists here. Ms. Fridrich, in terms of how I am attempting to define it, has a deep understanding of solving a Rubik's cube.

Of course, I don't know if I've had enough coffee to understand and articulate what I'm writing, but cognition be damned!

Quite true. I had a genetics professor in college who believed that most common allergies are the result of an environment containing too few helminths (flatworms). Apparently the reactive proteins on them (or perhaps it was the immune signals specific to them) are extrememely similar to allergens. I curse the too-sterile environment I was brought up in - who would have thought that a healthy child needs to be around more worms?

Steganography is the process of hiding (possibly encrypted) data in the low-order areas of other files, often multimedia files like pictures and music. This information is (often readily) detectable, and once detected is no more secure than any other information. In other words, right now most people would use PGP or the equivalent to encrypt the information they're hiding steganographically - which could be broken by quantum computers.

For more information, check out this, or for the more technically inclined read the steganography and steganalysis section here. Good stuff.

In order to do anything practical, all the qubits in a quantum computer must be entangled - which is apparently the hard part. So, in order to break information encoded with a 2048 bit key, 2048 entangled qubits will have to be available. Anyone have any insight as to when that might happen? Is there anything intrinsically harder about entangling more qubits, or is the leap from say eight to 2048 straightforward?

Quantum computers will, if they work as advertised, break all RSA type public key encryption. Does anyone know if ECC is also vulnerable?

OK, that's enough questions for now... ;-) TIA for any answers.

I was able to get it a few days ago from the wayback machine but it seems to be down now, The license allows for redistribution without change so i mirrored it Here

Here are a couple of links if you want to get better at solving it:

Lars Petrus' method for speed
Dan Knight, the world champion
Jessica Fridrich. Her method is used by many.
www.speedcubing.com
www.rubiks.dk
A solution some think is easy.

I bought my first cube 2 months ago and today I completed it in 56.98 seconds! After loads of practice of course.

I agree, the Cube is more powerfully than the 64 in all respects. The N64 IS a true 64 bit console. This isn't saying that it's more powerfull than the 32 bit cube, it just means that it has to break it into chunks and reassemble, very messy. CPU emulators exsist in the PC world, they're usually used for pre-release developmental reasons (as AMD released well ahead of their first 64 bit CPUs) and for running some task that an older CPU can't handle. Since these things exsist don't expect them to be smooth.

The cube has a speed increase, though less bits. Probably good enough to handle some of the less demanding 64 games, maybe even some of the more demanding ones, but unlike in the 64 the cube would have to emulate everything previously done on chips with the 64. Sound, graphics, everything. It's theoreticaly possible, but it's one hell of a mess. A recompile would not only take care of the situation immediately, but it would also allow for better textures and models should they have chose to replace them. The hardware should automaticaly improve some of it immediately, but software tweaks can be made.

Wanna play the CPU game? The Genesis was 8 bit. Two 8 bit processors. If Atari would have "done the math" the same way Sega did they would have had a 256 or more bit system. Let's not forget "Blast Processing"

The N64 actually had a 64 bit MIPS RISC processor. Nintendo moved away from it because the software companies found it to hard to program for.

You can see the creator of the Fridrich method solve the cube here: http://www.ws.binghamton.edu/fridrich/video.html

Well, I'm actually not so sure. It appears to be steg, should be usable as steg, and is pretty much useless as anything but steg, but it is also pretty much useless as steg, too. Reversibility is not an issue with steg: if whomever you're hiding from can see the data in transit, you a) shouldn't xor the message out because they just compare it with the sent message, and b) shouldn't have used an image that exists elsewhere for you to prove it's identical to. If you don't think they will do something like this, why the heck are you stegging at all? Rather, detectability seems to be the hard thing, and not going too well now (a paper broke some of the last remaining good steg algos in Sept this year).

Note that the article talks about authentication and watermarking. And the paper was presented under the "Watermarking" section in the IEEE conference. Too bad we can't ge the actual text, although from the detail-light article, it looks pretty much useless anyway.

Ho hum.

dominik@schnitzer.at, mozparty-at-subscribe@relax.ath.cx, dominik@schnitzer.at, david_markvica@web.de, johannes_richter@gmx.net, kairo@kairo.at, rossi@chello.at, markush@world-direct.com, cbiesinger@web.de, jenskager@gmx.net, jo-at-mt@gmx.net, johann.petrak@gmx.at, dviper01@gmx.net, simon@simonschwaighofer.net, dreckskerl@glump.at, wt-lists@trexler.at, dusty@strike.wu-wien.ac.at, kasparhauserjr@hotmail.com, b.schallar@gmx.net, mutato@libero.it, phil@goli.at, diddalick@gmx.net, studio@paw8.com, croco@utanet.at, petru@paler.net, jlemmerer@node.at, bigkub@time2change.at, patrick@seher-it.at, ronald@hartwig.at, mozilla_party@webterminate.com, stefan@kleinhans.it, horst.jens@gmx.at, jjan@gibts.net, mjahn@agency.at, gpoul@gnu.org, green@eggs.ham, gerhard.hipfinger@openforce.at, mailto:moz@moz.org>, florianweinwurm@yahoo.com, christian@precht-jensen.dk, Bill_Gates@microsoft.com, Tux_the_penguin@linux.rules.microsoft.sux.open.sou rce.is.the.way.to.go.net, domi@schnitzer.at, joe_ringmaster@gmx.at, sifu@isohypse.org, dk@perm.ru, nobandwidth@bigpond.com, nobandwidth@bigpond.com, luke@strangemonkey.com, mrundataker@optushome.com.au, mcgarry@tig.com.au, chris@think.net.au, Mathias.Burbach@Bigfoot.com, acuteparanoia@optushome.com.au, syzh401@cse.unsw.edu.au, maillist@jasonlim.com, ram@digitalmethod.org, jason@sydneypubguide.net, geek@digitalone.com.au, curious@ihug.com.au, bill@maidment.com.au, kristof@staesis.org, bill@microsoft.com, belle@netset.net.au, ksosez@softhome.net, jruderman@hmc.edu, andyed@surfmind.com, down8@yahoo.com, mozparty@sigkill.com, bulbul@ucla.edu, gavin-mozparty@doughtie.com, roger@digitalfountain.com, matt@linuxschooltorrance.com, mozparty@ventura.nu, rombouts@compuserve.com, ian@freenetproject.org, tristanreid@yahoo.com, groovefx@yahoo.com, jj@lacasabonita.com, gmoudry@hotmail.com, eyezero@yahoo.com, ian@primewave.net, jlawson7@adelphia.net, el_arturo@att.net, janie@freenetproject.org, 145371217@numenor.net, infinite_8_monkey@yahoo.com, charshman@divus.org, mozparty@shadowlurker.net, john@marinapacific.com, ilanterrell@yahoo.com, aafes@psu.edu, bustamam98@yahoo.com, mozparty@myunixbox.com, yaten@sbcglobal.net, joelinux@pacificnet.net, dgc@penguino.net, poserskater69@yahoo.com, lheartb@hotmail.com, ncmother@zimage.com, daniel@likeicare.com, digital.evil@lycos.com, cjeburke@yahoo.com, jblow@hotmail.com, zachary.anthony@verizon.net, boogah@23.org, mebelost@yahoo.com, nickkricheff@netscape.net, mikemcg@ucla.edu, gogomozilla@denofslack.net, mike@mm1.com, seanmcoleman@attbi.com, jsm@bigfoot.com, hoarycripple@crippl3.net, mozparty@nslu.x.myxomop.com, mozparty@camworld.com, mozpartyNYC@isoga.net, ccarlen@netscape.com, h@rediffmail.com, lefever@rcn.com, tedjackson@accounting.org, darren@ny.com, marlon@nyc.com, plui@hyperreal.org, dzeluff@zeluff.com, joel@natividads.com, ken@bigbadapple.com, treebeard@treebeard.net, florent@nyc.com, chad@macristy.com, spud@montelshow.com, gbman_of_gvill@yahoo.com, eam-mozparty@learningpatterns.com, pkrause@primavera.com, tossoffus@yahoo.com, ryan@pantz.com, nichomof@eecs.tulane.edu, billg@microsoft.com, DevilsRejection@msn.com, petergunn@hotmail.com, bagerj@sullcrom.com, isaac@structuredsystems.net, bobk@panix.com, ngellner@hotmail.com, luke@sigterm.org, vivake@yahoo.com, jon@mediavortex.com, groovefx@yahoo.com, brendan@sighup.net, jds@panix.com, bluerose@bluerose.com, chris@allermann.net, dimkal@yahoo.com, preppyl@yahoo.com, blujoker@blujoker.net, nowell_h@hotmail.com, aragorn@cs.stanford.edu, treed@cpr.com, brt204@nyu.edu, andreas@antonopoulos.com, dj@randomwalks.com, lists@pote.com, mike@mhudack.com, reliable57@yahoo.com, jared@geek-boy.com, ondadl@mac.com, floss@myrealbox.com, xod@thestonecutters.net, mozilla@sectae.net, tywonm@screamingmedia.com, Odin_NT@hotmail.com, crooney@panix.com, bg25222@binghamton.edu, eugenem@brainlink.com, dave@downneck.net, romspace@mac.com, sdaejo@yahoo.com, masseo1@yahoo.com, jim@fearandloathing.net, mike@mjoy.us, miles@openly.com, LuciferSD@hotmail.com, nsdilwor@intertechmedia.com, chrisdowden@yahoo.com, pgs10@columbia.edu, sbrennan@ovid.com, lthomiso@rcn.com, paralox@paralox.ath.cx, Jester_458@yahoo.com, jsadove@beltion.net, stuehmke@yahoo.com, mike@realfx.com, alex@risky-roosky.com, shava@efn.org, kra10@columbia.edu, saihung@ix.netcom.com, gropo@mac.com, scottnym@yahoo.com, shaas@vibe.com, roon_toon@hotmail.com, ajaygautam@yahoo.com, jhdaly@mindspring.com, manuel@sphinx.ms, very_itchy_rash@yahoo.com, emeldrum@drew.edu, jeld@mindless.com, as867@columbia.edu, slams@penguin.rutgers.edu, wassa@columbia.edu, tony@vegan.net, zilla@bibliotrack.com, zeno_lee@hotmail.com, fosh@fishnet.cx, linux@gpl.us, jblow@hotmail.com, dkrook@hotmail.com, ivesti@yahoo.com, arek@arekwyderka.com, bljoechang@yahoo.com, brian@tribrothers.com, sparky@marklife.org, charles@softwareprototypes.com, scottkundla@hotmail.com, ccharabaruk@meldstar.com, ian@pottinger.ca, netdemonz@yahoo.com, diatribe@mailcity.com, nick@tomkinet.com, shawnlin@yahoo.com, sculley@pathcom.com, herd.killing@rogers.com, dave@renouf.com, aliyamin@hotmail.com, aswitzer@ispgn.com, netm0nkey@ispgn.com, hyakugei@hotmail.com, geduggan.mozparty@peri.csclub.uwaterloo.ca, lwhite@darkfires.ca, jorel@the-wire.com, js@tap.net, davew@tap.net, tmh@whitefang.com, vid_mozillaparty@zooid.org, anon@foolswisdom.org, morris_mk@yahoo.ca, colinmc@idirect.com, marcus.brubaker@utoronto.ca, akish@kishcom.com, nconway@klamath.dyndns.org, jason@thegeekcave.com, rampaging_simian@hotmail.com, garret@sirsonic.com, piowie@myrealbox.com, m5m5m@yahoo.com, ivan.brovko@net-sweeper.com, returnofthedorks@hotmail.com, axxackall@yahoo.com, tednye@sympatico.ca, darren.fuller@bell.ca, jbailey@nisa.net, swangeo@yahoo.ca, Hercynium@yahoo.com, cinetron@passport.ca, jotaroh@hotmail.com, aghajani@principle.com, fzv@yahoo.com, rocketmail_com@rocketmail.com, foo@bar.com, wolfe@alt.net, drew@xyzzy.dhs.org, jimmiejaz@nixhelp.net, bofh@swma.net, nilesh_mehta@email.com, mslack@rogers.com, m-cahill@rogers.com, tworkowski@sympatico.ca, george@openlight.com, irina@openlight.com, ilia@lobsanov.com, rjs@tao.ca, paul-mp@it.ca, alvarolists@aycuens.com, xan@dimensis.com, ike@lab.org, miguel@asiinfo.net, marevalo@marevalo.net, iolalla@yahoo.com, peluz0n@justice.com, weeddeveloper@yahoo.com, alfonsobugs@terra.es, sgala@apache.org, z_gringo@hotmail.com, santiz@madritel.es, murphy@litio.net, fox@mozilla.gr.jp, party@mozilla.org.uk, danj@fledgeling.com, fun@thingy.apana.org.au, moz@the-allens.net, onelists@hotmail.com, joel@fysh.org, simon.mozilla-party-if-its-in-central-london@rumbl e.net, bigboyjim@excite.com, andrew.and.friends.iff.central.london@sent.freeser ve.co.uk, itwillbecentrallondon@mozilla.org.uk, noahsark2x2@tiscali.co.uk, mmm-central-london@smileyben.com, jonathan-for-central-london@peepo.com, dave-Party-in-Central-London@dgta.co.uk, DJGMOL@netscape.net, srick@europe.yahoo-inc.com, moz-party@zpok.demon.co.uk, moz-party-central-london@trickofthelight.org, marc@brosystems.com, party@budge.net, rillian@telus.net, uphillsurfer@hotmail.com, edward@debian.org, mozilla@robertbrook.com, reagan@technomoose.com, lew@saltbeefsandwich.co.uk, osama@afghanistan.com, barking@insaneworld.org.uk, john@billabong-media.com, leith@cs.bu.edu, mozparty@noseynick.org, jonasj@jonasj.dk, bugzilla@kenneth.dk, chr_damsgaard@hotmail.com, alring@email.com, hp.grondal@get2net.dk, martin@marquentein.dk, Lovechild@foolclan.com, Kim@schulz.dk, kl@vsen.dk, mbendix@dunghill.dk, schnitzer.at@tange.dk, tommy@svindel.net, moz10@pbb.dk, dezral@despammed.com, nick@tioka.com, ask@fujang.dk, gecko@c.dk, spam@deck.dk, bugzilla@gemal.dk, b@bogdan.dk, kenneth@gnu.org, jee@email.dk, daniel@rtfm.dk, umfalvo@yahoo.com, christian@ostenfeld.dk, xor@ivwnet.com, Jason@screaminweb.com, alex@spamcop.net, dustym@riseup.net, rmcgee1@earthlink.net, dr_zeus@hotmail.com, chris.lozano@myrealbox.com, looney_binn@yahoo(dot)com, apendell@attbi.com, dantrevino@wrevolution.org, fireball1244@mac.com, tommyo@hargray.com, natas@redtailboa.net, emmett_in_dallas@yahoo.com, razzbuten@yahoo.com, igdavis@truculent-telephone.org, foobar@null.net, bob@kludgebox.com, cgrimland@yahoo.com, ghamlett@swbell.net, bgood@inceptual.com, slot0k@pogox.org, kwhudson@netin.com, jimjamjoh@softhome.net, jimmys@utdallas.edu, charlesv@mfos.org chris@focus2.com jest6r@hotmail.com steve@ncc.com, usrg@mail.utexas.edu, steve@deltos.com, alex@avengergear.com, mkoenecke@alum.haverford.edu langley@hex.net mordred@inaugust.com swapan@yahoo.com drosoph@hotmail.com, goulash1@mac.com, ean@brainfood.com, vj@vj.com lpret42@hotmail.com bugoff@hotmail.com chad@digitaltriage.net, stewart@digitaltriage.net scottvr01@yahoo.com adam@dfwuptime.com dsaint@gnumatt.org naltrexone42@yahoo.com, webmaster@bast.net, tommyo@hargray.com, ladd@kryp.to, jtaylor5@bayou.uh.edu, jgschmitz@linuxmail.org, enslaver@enslaver.com edfierro@yahoo.com, moz@photonsphere.com, rayw@fuckmicrosoft.com, rfmobile@swbell.net, kevin@unif.com trident5@bigfoot.com Erik_Osterholm@ieee.org, tmunson@houston.rr.com, alessi_brand@hotmail.com, rballa1@lsu.edu, wasted@kewlhair.com, jofficer@martinapparatus.com, idiot@mylinuxisp.com, j0sh01@ev1.net faust@wintermarket.org bouncer@hotmonkeyporn.com tk-mozparty_@perljam.net janisch@students.zcu.cz, aha@pinknet.cz kuzi@atlas.cz scat@reboot.cz, petr@dousa.cz, ruzicka@core.cz, roman@management.cz, hojan@students.zcu.cz, tille@soti.org, cas.tuyn@hetnet.nl, aeon@pandora.be, sensi_millia2000@yahoo.com, crypto@shiftat.com, jan.fabry@vsknet.be, monkeyboy@fruru.com, adulau@foo.be, johan@linux.be, karu@pobox.com, soggie@soti.org nick@tomkinet.com, why_are_you_too_lazy_to_drive_1_hour_to_toronto@yo u_lazy.com try_grammer_class_a_while@get_a_life.com john@interlynx.ca asharp@axo.cc, unionstation@ryder.ca, prade@hotmail.com, 2600@hamilton2600.ca, chris.lozano@myrealbox.com, dantrevino@wrevolution.org, jksteinhauer@netscape.net, i_love_junk_email@yahoo.com, cmiller@surfsouth.com, jan@bestbytes.de, me@phillipoertel.com, sebastian@pixelsalon.de, ccozan@andtek.com, ben@itlib.de, martin.ament@gmx.de, pulsar@highteq.net, muid@gmx.de, cedi@zooomclan.org, soapy@soapy.ch, deep_blue_ocean@gmx.ch, stamp@zooomclan.org, hans@switzerland.com, milamber@zooomclan.org, mtettea@switzerland.com, cylander@zooomclan.org, duke@zooomclan.org, pegirun@gmx.ch, pilif@pilif.ch, mlati@yahoo.com, Mozillzooom@holophrastic.com, erichiseli@yahoo.com, la_burdet@yahoo.com, rkoerber@gmx.de, dotzmasta@hotmail.com, B.Eckstein@cli.de, rtfm@linux.de, info@phosmo.de, gz@disintegrated.de, byronbay@gmx.de, stiwi@mac.com, mage@koeln.netsurf.de, mozilla@portfolio16.de, wrede@fh-aachen.de, ilikemozilla@html.de, cloud@final-fantasy.de, sfricke@sfricke.de, info@flossbau.de, no@dom.de, julian.suschlik@gmx.net, omero@m4d.sm, lapo@lapo.it, alcor78@email.it, info@fuelcat.it, mutato@libero.it, ildella@inwind.it, a.marabini@spinthehumanfactor.com, uomoman@criticalbit.com, thefl74@netscape.net, elbardo@libero.it, clem131@libero.it, t-i-e@bigfoot.com, gng74@libero.it, moz.party.20.gnes@spamgourmet.com, ema.cerqui@libero.it, ubertob@tin.it, mozparty.20.anagoor@spamgourmet.com, gianpaolo@preciso.net, ian@deepsky.com, marco@porciletto.org, planetx2100@hotmail.com, billabong@tiscalinet.it, piofree@libero.it, skunkyboy@tiscalinet.it, vincenzo@mondopiccolo.net, macmatteo@interfree.it, contreras@jce.it, hereandnow@libero.it, pza@students.cs.mu.oz.au, caedwa@students.cs.mu.oz.au, mgi@students.cs.mu.oz.au, bah@humbug.net, mfp@cs.mu.oz.au, nospamplease@indevelopment.org, peter@simplyit.screaming,net, pmj@users.sf.net, xanni@sericyb.com.au, agh@kalcium-is.com, felicityconsult@ozemail.com.au, lucas@lucaschan.com, andrewg@nopninjas.com, andym@abnormal.com, ts@meme.com.au, jasonpell@hotmail.com, syngin@gimp.org, mhammond@skippinet.com.au, szutshi@devraj.org, rmoonen@bigpond.net.au, fawad@fawad.net, ufs@softhome.net, kotrade@yahoo.com, ben@benscorp.com, stevesmith@columbus.rr.com, kkimmelosu@yahoo.com, neal.lindsay@peaofohio.com, pat@linuxcolumbus.com, chrisbaker@iname.com, hiroki2c@yahoo.com, seth@remor.com, jsohn@columbus.rr.com, ross@nanonet.net, mark@cushman.net, swinghammer.2@osu.edu, roberto.12@osu.edu, farhat@hotmail.com, pgunn@dachte.org, jwagner@gcfn.org, bp@osc.edu, joepletch@postmark.net, dsherman@iwaynet.net, glenn@uniqsys.com, bernstein.46@osu.edu, trent_reznor@nothing.com, erikniklas@bobanddoug.com, walters@gnu.org, timo@bolverk.net, annek25@aol.com, jlamb@leader.com, bart@osc.edu, jason@mcvetta.org

Here's a fast mirror.

That's not a mirror, it's a frame. Here's a *faster* mirror.

You do college radio. I honestly think that I'd have dropped out of school a while ago if I didn't have something to occupy my free time other than learning about old technology and studying automata. Automata!!

Yeah, I can really see a potential employer asking me about Turing machines... or to code them a little application in Prolog. Another misconception my CS program makes is that all CS majors want to be programmers. I *hate* programming. I'm much more interested in the hardware/network/administration aspects of computer systems. Coding up a Java application to simulate an ATM is like pulling teeth.

Maybe that's just the CS program here at SUNY Binghamton. What's it like elsewhere?

I can honestly say I've garnered myself more experience / knowledge setting up and administering the network in my *house* than I've learned in any classroom.

Right now the objective is to finish up my degree and get out. Like a co-worker suggested to me a couple summers back (I should have listened) -- your degree -- and 75 cents -- will buy you a cup of coffee at 7-Eleven. And as was mentioned earlier, the declining job market/salaries isn't much of a motivator either. That's why I have a job at one of the local commercial radio stations here (in addition to working at the campus station), -- it NEVER hurts to have a backup plan.

Solidarity, my brothers and sisters in CS suckiness...

Mike