Posts about computer science
animals appropriate technology bacteria biology Career Cats cool curiouscat economy Energy Engineering engineering education engineers evolution experiment food fun Funding government green Health Care human health innovation K-12 kids Life Science medical research nature ocean physics Products Research Robots Science science education science explained science facts science webcasts scientific inquiry Students Technology university research USA water webcasts

Barbara Liskov wins Turing Award

Posted on June 28, 2009  Comments (2)

photo of Barbara Liskovphoto of Barbara Liskov by Donna Coveney

Barbara Liskov has won the Association for Computing Machinery’s A.M. Turing Award, one of the highest honors in science and engineering, for her pioneering work in the design of computer programming languages.

Liskov, the first U.S. woman to earn a PhD from a computer science department, was recognized for helping make software more reliable, consistent and resistant to errors and hacking. She is only the second woman to receive the honor, which carries a $250,000 purse and is often described as the “Nobel Prize in computing.”

“Computer science stands squarely at the center of MIT’s identity, and Institute Professor Barbara Liskov’s unparalleled contributions to the field represent an MIT ideal: groundbreaking research with profound benefits for humankind. We take enormous pride that she has received the Turing Award,” said MIT President Susan Hockfield.

“Barbara Liskov pioneered some of the most important advances in fundamental computer science,” said Provost L. Rafael Reif. “Her exceptional achievements have leapt from the halls of academia to transform daily life around the world. Every time you exchange e-mail with a friend, check your bank statement online or run a Google search, you are riding the momentum of her research.”

The Turing Award is given annually by the Association for Computing Machinery and is named for British mathematician Alan M. Turing, who helped the Allies crack the Nazi Enigma cipher during World War II.

Read the full article at MIT.

Related: 2006 Draper Prize for Engineering – Thompson and Tits share 2008 Abel Prize (Math) – von Neumann Architecture and Bottleneck – MIT related posts

The First Web Server

Posted on May 30, 2009  Comments (4)

photo of the first web server

Photo by sbisson from Geneva, Switzerland, November 2006 .

In a glass case at CERN is an unpreposessing little NeXT cube. It’s hard to believe that this little workstation changed the world, but it did. It’s Tim Berners Lee‘s original web server, the world’s first.

NeXT is the computer company Steve Jobs founded after he left Apple. Then he left NeXT to buy out Pixar. And then, of course, went back to Apple.

Related: The Web is 15 Years Old – The Second 5,000 Days of the Web – 2007 Draper Prize to Berners-Lee – Google Server Hardware Design

Artificial Intelligence Finds Ancient Indus Script Matches Spoken Language

Posted on April 24, 2009  Comments (0)

Artificial Intelligence Cracks 4,000-Year-Old Mystery by Brandon Keim

An ancient script that’s defied generations of archaeologists has yielded some of its secrets to artificially intelligent computers.
…
The Indus script, used between 2,600 and 1,900 B.C. in what is now eastern Pakistan and northwest India, belonged to a civilization as sophisticated as its Mesopotamian and Egyptian contemporaries. However, it left fewer linguistic remains. Archaeologists have uncovered about 1,500 unique inscriptions from fragments of pottery, tablets and seals. The longest inscription is just 27 signs long.
…
They fed the program sequences of four spoken languages: ancient Sumerian, Sanskrit and Old Tamil, as well as modern English. Then they gave it samples of four non-spoken communication systems: human DNA, Fortran, bacterial protein sequences and an artificial language.

The program calculated the level of order present in each language. Non-spoken languages were either highly ordered, with symbols and structures following each other in unvarying ways, or utterly chaotic. Spoken languages fell in the middle.

When they seeded the program with fragments of Indus script, it returned with grammatical rules based on patterns of symbol arrangement. These proved to be moderately ordered, just like spoken languages.

Related: The Rush to Save Timbuktu’s Crumbling Manuscripts – The Mystery of the Voynich Manuscript – Aztec Math

Keeping Out Technology Workers is not a Good Economic Strategy

Posted on April 21, 2009  Comments (3)

The barriers between countries, related to jobs, are decreasing. Jobs are more international today than 20 years ago and that trend will continue. People are going to move to different countries to do jobs (especially in science, engineering and advanced technology). The USA has a good market on those jobs (for many reasons). But there is nothing that requires those jobs to be in the USA.

The biggest impact of the USA turning away great scientists and engineers will be that they go to work outside the USA and increase the speed at which the USA loses its place as the leading location for science, engineering and technology work. This is no longer the 1960’s. Back then those turned away by the USA had trouble finding work elsewhere that could compete with the work done in the USA. If the USA wants to isolate ourselves (with 5% of the population) from a fairly open global science and engineering job market, other countries will step in (they already are trying, realizing what a huge economic benefit doing so provides).

Those other countries will be able to put together great centers of science and engineering innovation. Those areas will create great companies that create great jobs. I can understand wanting this to be 1960, but wanting it doesn’t make it happen.

You could go even further and shut off science and engineering students access to USA universities (which are the best in the world). That would put a crimp in plans for a very short while. Soon many professors would move to foreign schools. The foreign schools would need those professors, and offer a great deal of pay. And those professors would need jobs as their schools laid off professors as students disappeared. Granted the best schools and best professors could stay in the USA, but plenty of very good ones would leave.

I just don’t think the idea of closing off the companies in the USA from using foreign workers will work. We are lucky now that, for several reasons, it is still easiest to move people from Germany, India, Korea, Mexico and Brazil all to the USA to work on advanced technology projects. The advantage today however, is much much smaller than it was 30 years ago. Today just moving all those people to some other location, say Singapore, England, Canada or China will work pretty well (and 5 years from now will work much better in whatever locations start to emerge as the leading alternative sites). Making the alternative of setting up centers of excellence outside the USA more appealing is not a good strategy for those in the USA wanting science, engineering and computer programming jobs. We should instead do what we can to encourage more companies in the USA that are centralizing technology excellence in the USA.

Comment on Reddit discussion.

Related: Science and Engineering in Global Economics – Global technology job economy – Countries Should Encourage Immigration of Technology Workers – The Software Developer Labor Market – What Graduates Should Know About an IT Career – Relative Engineering Economic Positions – China’s Technology Savvy Leadership – Education, Entrepreneurship and Immigration – The Future is Engineering – Global Technology Leadership

Google Summer of Code 2009

Posted on March 22, 2009  Comments (1)

Google Summer of Code is a global program that offers student developers stipends to write code for various open source software projects. Google funds the program with $4,500 for each student (and pays the mentor organization $500). Google works with several open source, free software, and technology-related groups to identify and fund projects over a three month period.

Since its inception in 2005, the program has provided opportunities for nearly 2500 students, from nearly 100 countries. Through Google Summer of Code, accepted student applicants are paired with a mentor or mentors from the participating projects, thus gaining exposure to real-world software development scenarios and the opportunity for employment in areas related to their academic pursuits. In turn, the participating projects are able to more easily identify and bring in new developers. Best of all, more source code is created and released for the use and benefit of all.

Google funded approximately 400 student projects in 2005, 600 in 2006, 900 in 2007 and 1125 in 2008 and will be funding approximately 1,000 student projects in 2009.

Applying for the program is only allowed from March 23rd through April 3rd. Still a short period of time but in previous years they have only taken them for one week. Organizations hosting students include: Creative Commons, MySQL, Debian, The Electronic Frontier Foundation/The Tor Project, haskell.org, Grameen Foundation USA, National Center for Supercomputing Applications, Ruby on Rails, Wikimedia Foundation and WordPress. See the full list of organizations and link to descriptions of the projects each organization offers.

See the externs.com internship directory (another curiouscat.com ltd. site) for more opportunities including those in science and engineering.

Related: Google Summer of Code Projects 2008 – posts on fellowships and scholarships – Larry Page on How to Change the World – comic on programmers – Interview of Steve Wozniak

Data Analysts Captivated by R’s Power

Posted on January 13, 2009  Comments (1)

Data Analysts Captivated by R’s Power

data mining has entered a golden age, whether being used to set ad prices, find new drugs more quickly or fine-tune financial models. Companies as diverse as Google, Pfizer, Merck, Bank of America, the InterContinental Hotels Group and Shell use it.
…
Close to 1,600 different packages reside on just one of the many Web sites devoted to R, and the number of packages has grown exponentially. One package, called BiodiversityR, offers a graphical interface aimed at making calculations of environmental trends easier.

Another package, called Emu, analyzes speech patterns, while GenABEL is used to study the human genome. The financial services community has demonstrated a particular affinity for R; dozens of packages exist for derivatives analysis alone. “The great beauty of R is that you can modify it to do all sorts of things,” said Hal Varian, chief economist at Google. “And you have a lot of prepackaged stuff that’s already available, so you’re standing on the shoulders of giants.”

R first appeared in 1996, when the statistics professors Ross Ihaka and Robert Gentleman of the University of Auckland in New Zealand released the code as a free software package. According to them, the notion of devising something like R sprang up during a hallway conversation. They both wanted technology better suited for their statistics students, who needed to analyze data and produce graphical models of the information. Most comparable software had been designed by computer scientists and proved hard to use.

R is another example of great, free, open source software. See R packages for Statistics for Experimenters.

via: R in the news

Related: Mistakes in Experimental Design and Interpretation – Data Based Decision Making at Google – Freeware Math Programs – How Large Quantities of Information Change Everything

So What are Genetic Algorithms?

Posted on January 12, 2009  Comments (1)

Genetic Algorithms: Cool Name and Damn Simple is a very nice explanation with python code of genetic algorithms.

What Can Genetic Algorithms Do?
In a word, genetic algorithms optimize. They can find better answers to a question, but not solve new questions. Given the definition of a car, they might create a better car, but they’ll never give you an airplane.
…
For each generation we’ll take a portion of the best performing individuals as judged by our fitness function. These high-performers will be the parents of the next generation.

We’ll also randomly select some lesser performing individuals to be parents, because we want to promote genetic diversity. Abandoning the metaphor, one of the dangers of optimization algorithms is getting stuck at a local maximum and consequently being unable to find the real maximum. By including some individuals who are not performing as well, we decrease our likelihood of getting stuck.

Related: DNA Seen Through the Eyes of a Coder – Evolutionary Design – Algorithmic Self-Assembly – The Chip That Designs Itself

Solving the Toughest Problems in Computer Science

Posted on January 12, 2009  Comments (1)

Software Breakthroughs: Solving the Toughest Problems in Computer Science, 2004:

Bill Gates’ talk at MIT provided an optimistic view of the next generation of computer science, now that the “rough draft” is done. Gates finds a paradox today in that computer science is poised to transform work and home life, “but people’s excitement level is not as high as it was five years ago during the Internet bubble.” Because most sectors of the computer industry—from microchips to storage, displays to wireless connectivity— continuously improve in performance, Gates predicts a flood of new products and applications. He sported a wristwatch that receives data wirelessly, as well as keeps its user on schedule. Gates describes “rich, new peripherals” such as ultra-wideband digital cameras and he demonstrates software that allows pictures to be archived using a 3D visual interface with a built-in time, date, and keyword database. He says that computer science is merging with and making over such fields as astronomy and biology, by unifying vast, unwieldy data collections into easily navigable libraries. And Gates appears confident that technological breakthroughs will ultimately resolve urgent problems of computer and network security.

Related: Bill Gates Interview from 1993 – Donald Knuth – Computer Scientist – Open Source: The Scientific Model Applied to Programming – Internship with Bill Gates

Rumors of Software Engineering’s Death are Greatly Exaggerated

Posted on January 4, 2009  Comments (3)

Rumors of Software Engineering’s Death are Greatly Exaggerated by Steve McConnell

Indeed, one of the hallmarks of engineering as opposed to science is that engineers will work with materials whose properties are not entirely understood, and they’ll factor in safety margins until the science comes along later and allows more precision in the engineer’s use of those materials.
…
Software engineering already has been defined as engineering, we have an international reference standard for that definition, the field’s two largest professional bodies have jointly adopted a professional code of conduct for software engineers, we have accreditation standards for university programs in software engineering, we have university numerous programs that have already been accredited, and several countries are licensing professional engineers in software.

Related: Who Killed the Software Engineer? – Is Computer Science a Science? – What Ails India’s Software Engineers? – Federal Circuit Decides Software No Longer Patentable – A Career in Computer Programming

How We Found the Missing Memristor

Posted on December 11, 2008  Comments (0)

How We Found the Missing Memristor By R. Stanley Williams

For nearly 150 years, the known fundamental passive circuit elements were limited to the capacitor (discovered in 1745), the resistor (1827), and the inductor (1831). Then, in a brilliant but underappreciated 1971 paper, Leon Chua, a professor of electrical engineering at the University of California, Berkeley, predicted the existence of a fourth fundamental device, which he called a memristor. He proved that memristor behavior could not be duplicated by any circuit built using only the other three elements, which is why the memristor is truly fundamental.
…
the memristor’s potential goes far beyond instant-on computers to embrace one of the grandest technology challenges: mimicking the functions of a brain. Within a decade, memristors could let us emulate, instead of merely simulate, networks of neurons and synapses. Many research groups have been working toward a brain in silico: IBM’s Blue Brain project, Howard Hughes Medical Institute’s Janelia Farm, and Harvard’s Center for Brain Science are just three. However, even a mouse brain simulation in real time involves solving an astronomical number of coupled partial differential equations. A digital computer capable of coping with this staggering workload would need to be the size of a small city, and powering it would require several dedicated nuclear power plants.

Related: Demystifying the Memristor – Understanding Computers and the Internet – 10 Science Facts You Should Know

The Chip That Designs Itself

Posted on December 8, 2008  Comments (0)

The chip that designs itself by Clive Davidson , 1998

Adrian Thompson, who works at the university’s Centre for Computational Neuroscience and Robotics, came up with the idea of self-designing circuits while thinking about building neural network chips. A graduate in microelectronics, he joined the centre four years ago to pursue a PhD in neural networks and robotics.
…
To get the experiment started, he created an initial population of 50 random circuit designs coded as binary strings. The genetic algorithm, running on a standard PC, downloaded each design to the Field Programmable Gate Arrays (FPGA) and tested it with the two tones generated by the PC’s sound card. At first there was almost no evidence of any ability to discriminate between the two tones, so the genetic algorithm simply selected circuits which did not appear to behave entirely randomly. The fittest circuit in the first generation was one that output a steady five-volt signal no matter which tone it heard.

By generation 220 there was some sign of improvement. The fittest circuit could produce an output that mimicked the input – wave forms that corresponded to the 1KHz or 10KHz tones – but not a steady zero or five-volt output.

By generation 650, some evolved circuits gave a steady output to one tone but not the other. It took almost another 1,000 generations to find circuits that could give approximately the right output and another 1,000 to get accurate results. However, there were still some glitches in the results and it took until generation 4,100 for these to disappear. The genetic algorithm was allowed to run for a further 1,000 generations but there were no further changes.

See Adrian Thompson’s home page (Department of Informatics, University of Sussex) for more on evolutionary electronics. Such as Scrubbing away transients and Jiggling around the permanent: Long survival of FPGA systems through evolutionary self-repair:

Mission operation is never interrupted. The repair circuitry is sufficiently small that a pair could mutually repair each other. A minimal evolutionary algorithm is used during permanent fault self-repair. Reliability analysis of the studied case shows the system has a 0.99 probability of surviving 17 times the mean time to local permanent fault arrival. Such a system would be 0.99 probable to survive 100 years with one fault every 6 years.

Very cool.

Related: Evolutionary Design – Invention Machine – Evo-Devo