A list of Planets featured on the cult Sci-fi TV show Lexx
Brunnis(Season 1 - Episode 2)
Earth (Season 4 - All Episodes)
Fire (Season 3 - All Epidosdes)
Leester (Season 2 - Episode 5 'Lafftrak')
Liber (Season 2 - Episode 5 'Lafftrak')
Ruuma (Season 2 - Episode 13 'Twilight')
Vermal (Season 2 - Episode 8 'White Trash')
Water (Season 3 - All Episodes)
Woz (Season 2 - Episode 15 'Woz')
Brunnis(Season 1 - Episode 2)
Earth (Season 4 - All Episodes)
Fire (Season 3 - All Epidosdes)
Leester (Season 2 - Episode 5 'Lafftrak')
Liber (Season 2 - Episode 5 'Lafftrak')
Ruuma (Season 2 - Episode 13 'Twilight')
Vermal (Season 2 - Episode 8 'White Trash')
Water (Season 3 - All Episodes)
Woz (Season 2 - Episode 15 'Woz')
Obi Sium (born 1941, Adengoda, Eritrea) is an Eritrean American water resources engineer with the Minnesota Department of Natural Resources, and was the Republican candidate for U.S. Congress in Minnesota's 4th congressional district challenging incumbent Democrat Betty McCollum in the 2006 mid-term election. Obi is short for Ogbazghi.
Electoral history
*2006 Race for U.S. House of Representatives - 4th District
**Betty McCollum (DFL) (inc.), 70%
**Obi Sium (R), 30%
Electoral history
*2006 Race for U.S. House of Representatives - 4th District
**Betty McCollum (DFL) (inc.), 70%
**Obi Sium (R), 30%
Picasion.com is an online Web 2.0 application that lets you instantly create animated gifs online. You can upload images from your hard drive and grab images directly from Picasa Web or Flickr. Just enter a Picasa Web or Flickr username and/or tag to see the list of pictures you can import to your animation. There are a few simple options you can use, you can choose the size of your resulting animation from the list or adjust it manually and you can select the frames speed in your animation. Picasion doesn't require for Flash.
"It is a quick and easy way for students to create an animated story without having to install anything on their computers or learn to operate a complex piece of software. The site is free to use and no sign-up is necessary."
"It is a quick and easy way for students to create an animated story without having to install anything on their computers or learn to operate a complex piece of software. The site is free to use and no sign-up is necessary."
Michael C. LaLena is a computer scientist working for Carestream Health where he designs software for computed radiography and digital radiography systems.
LaLena received his Master's Degree in computer science from Rochester Institute of Technology in 1997. Since receiving his degree, he continues to work in the Artificial Life field investigating and experimenting with new technologies.
LaLena was the first to investigate “required” teamwork between actors in Genetic Programming – specifically the ant colony food collection problem. Previous work with swarm intelligence or ant colony optimization has ants communicating with pheromones or moving in loose knit groups. While this communication allows a large number of ants to solve the problem quickly, these ants are not required to solve the problem. One ant could just as easily solve the problem given enough time, making the communication between ants not completely necessary.
Food collection problems involving required teamwork require more than one ant to solve the problem. One example would be collecting food that requires more than one ant to lift. Multiple ants must work together to pick up the food and return it to the nest. This problem becomes very difficult if there is more food than ants. For example: If there are 10 pieces of food each requiring 10 ants to lift and there are only 20 ants available to lift the food, then teamwork is required to solve the problem. If each ant randomly searched for food and stopped when it found food, you might have a situation where every ant is waiting for help from other ants and no more ants are available.
Another example is a water crossing problem where ants must sacrifice themselves to allow other ants to cross a river to reach food. If every ant sacrificed himself, then there wouldn't be any ants left to collect the food. If no ant is willing to sacrifice himself, then the ants will not be able to get to the food. This problem requires a special type of teamwork where some ants must sacrifice themselves, and others must collect food even though every ant is running the same program and there are no state variables to assign different duties to each ant.
This research has practical swarm robotics applications for military robots in combat and support roles and in exploration.
LaLena received his Master's Degree in computer science from Rochester Institute of Technology in 1997. Since receiving his degree, he continues to work in the Artificial Life field investigating and experimenting with new technologies.
LaLena was the first to investigate “required” teamwork between actors in Genetic Programming – specifically the ant colony food collection problem. Previous work with swarm intelligence or ant colony optimization has ants communicating with pheromones or moving in loose knit groups. While this communication allows a large number of ants to solve the problem quickly, these ants are not required to solve the problem. One ant could just as easily solve the problem given enough time, making the communication between ants not completely necessary.
Food collection problems involving required teamwork require more than one ant to solve the problem. One example would be collecting food that requires more than one ant to lift. Multiple ants must work together to pick up the food and return it to the nest. This problem becomes very difficult if there is more food than ants. For example: If there are 10 pieces of food each requiring 10 ants to lift and there are only 20 ants available to lift the food, then teamwork is required to solve the problem. If each ant randomly searched for food and stopped when it found food, you might have a situation where every ant is waiting for help from other ants and no more ants are available.
Another example is a water crossing problem where ants must sacrifice themselves to allow other ants to cross a river to reach food. If every ant sacrificed himself, then there wouldn't be any ants left to collect the food. If no ant is willing to sacrifice himself, then the ants will not be able to get to the food. This problem requires a special type of teamwork where some ants must sacrifice themselves, and others must collect food even though every ant is running the same program and there are no state variables to assign different duties to each ant.
This research has practical swarm robotics applications for military robots in combat and support roles and in exploration.