Thomas E. Portegys

Learn More
This paper describes a customizable classroom game used to demonstrate the effects of network externalities on the adoption of new technologies. The game is a web-based adaptation of Ruebeck et al.'s (2003) network externalities game. The web-based game is freely available and can be played in a networked lab setting or via the Internet. In this game,(More)
This study compares the maze learning performance of three artificial neural network architectures: an Elman recurrent neural network, a long short-term memory (LSTM) network, and Mona, a goal-seeking neural network. The mazes are networks of distinctly marked rooms randomly interconnected by doors that open probabilistically. The mazes are used to examine(More)
In this paper, we will introduce a method for calculating and visualizing the information content of embryogenesis called the information isometry technique. We treat cell lineage trees as directed acyclic graphs (DAGs) that can be subject to reordering using various criteria. When we compare alternative orderings of these graphs, they reveal subtle(More)
A distance quasi-metric for pattern recognition is presented. The “quasi” modifier distinguishes the metric from “true” distance metrics which obey a set of standard constraints. By relaxing one of the constraints, and coupling it with a fast multi-dimensional search technique, the metric demonstrates improved accuracy and efficiency compared to other(More)
An important function of many organisms is the ability to use contextual information in order to increase the probability of achieving goals. For example, a street address has a particular meaning only in the context of the city it is in. In this paper, predisposing conditions that influence future outcomes are learned by a goal-seeking neural network(More)
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, is adapted to “span” the cluster. Objects are distributed in the tree, and partitions of the tree are distributed among the processors in such a way that a minimum of global(More)
In association with the OpenWorm Project (openworm.org) C. elegans and the OpenWorm Project OpenWorm aims to build the first comprehensive computational model of the Caenorhabditis elegans (C. elegans), a 1mm transparent nematode worm. With only a thousand cells, it solves basic problems such as feeding, mate-finding and predator avoidance. Despite being(More)