DISCERN Artificial Neural Network - How to Build a Schizophrenic Computer Justin Ruckman/Flickr Advertisement - Continue Reading Below Schizophrenia is one of the most infamous and mysterious mental disorders. Attempting to get to the root of the problem, scientists recently came up with an extraordinary solution: They built a schizophrenic computer. People who suffer from schizophrenia often have difficulty thinking logically or discerning what is real or not real in their lives. To make a schizophrenic computer, they began with an artificial neural network called DISCERN that Miikkulainen has been working on intermittently since the 1990s. Hoffman and his colleagues then started to tell simple stories to the computer. In DISCERN, the process begins in a module called the sentence parser, which examines each sentence one word at a time. Once the computer system could "understand" a story, the researchers began to feed stories to it. Then, it was DISCERN's job to repeat the tales back to the scientists.
Top 100 Network Security Tools How Long Can a Hard Drive Hold Data Without Power? - Lifehacker Longevity of backups depends primarily on condition and handling. I design a lot of disaster recovery systems and over the last few decades I've found that: Magnetic drives are fairly reliable when unplugged, but you'll still need to cycle them out over the years - My most common problem was the bearings and motors seizing causing drive failures. I've found that temperature is the primary deciding factory and potentially humidity another contributing factor. In datacenters that store the drives in hotter than room temp areas I've always had a higher drive failure rate from DR disks that are typically only plugged in once a month than the locations that have the same usage but store them in a cooler location. Also keep in mind that even if the drive is good when you need it most you have to consider the drive format and ease of installing elsewhere. Flash drives are surprisingly robust - USB has been around a surprisingly long time in the same format.
Sculpting text with regex, grep, sed and awk Theory: Regular languages Many tools for searching and sculpting text rely on a pattern language known as regular expressions. The theory of regular languages underpins regular expressions. (Caveat: Some modern "regular" expression systems can describe irregular languages, which is why the term "regex" is preferred for these systems.) Regular languages are a class of formal language equivalent in power to those recognized by deterministic finite automata (DFAs) and nondeterministic finite automata (NFAs). [See my post on converting regular expressions to NFAs.] In formal language theory, a language is a set of strings. For example, {"foo"} and {"foo", "foobar"} are formal (if small) languages. (Mathematicians don't typically put quotes around a string, preferring to let the fixed-width typewriter font distinguish it as one, but I'm guessing that programmers are more comfortable with the quotes around strings.) In regular language theory, there are two atomic languages: Useful grep flags The +? #!