Can Computers Weave a More Perfect Web?
| dc.contributor.author | Davis, Christopher | |
| dc.contributor.author | Otto, Carolyn | |
| dc.contributor.author | Wellnitz, Todd | |
| dc.contributor.author | Leitzke, Taren J. | |
| dc.contributor.author | Billman, Kayla D.M. | |
| dc.contributor.author | Reukema, Sarah E. | |
| dc.date.accessioned | 2017-11-16T16:43:30Z | |
| dc.date.available | 2017-11-16T16:43:30Z | |
| dc.date.issued | 2017-11-16T16:43:30Z | |
| dc.description | Color poster with text, graphs, and charts. | en |
| dc.description.abstract | We designed a rule-based computer model that used genetic algorithms to create spider webs that closely matched those found in nature. We recreated the classic, 2-dimensional orb web, which is typical of Araneus spiders commonly found in Wisconsin. Using the Java programming language, we closely recreated a model described by Krinkand Vollrath (1997), and then improved upon it by developing increasingly sophisticated simulations that incorporated web-building costs and prey-capture benefits. Four different versions of the simulation program were created so that each version “wove” its webs following different rules. To provide data for comparison, a complimentary field project collected and measured actual spider webs. | en |
| dc.description.sponsorship | University of Wisconsin--Eau Claire Office of Research and Sponsored Programs. | en |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/77342 | |
| dc.language.iso | en_US | en |
| dc.relation.ispartofseries | USGZE AS589; | |
| dc.subject | Genetic algorithms | en |
| dc.subject | Algorithms | en |
| dc.subject | Computer programs | en |
| dc.subject | Spider webs | en |
| dc.subject | Java | en |
| dc.subject | Posters | en |
| dc.title | Can Computers Weave a More Perfect Web? | en |
| dc.type | Presentation | en |