Academic curriculum vitæ of Jeremy Avnet Education: Santa Fe Institute: Complex Systems Summer School, Qingdao, China, 2004 Social network research, CS Dept., University of New Mexico, 2002/2003 B.A., Mathematics, University of California, Santa Cruz, 2000 Honors and Awards: Degree Honors, Mathematics, University of California, Santa Cruz, 2000 Thesis Honors, Mathematics, University of California, Santa Cruz, 2000 Second Place, Rockwell Intl Comp Sci Competition, Long Beach, CA, 1994 Lectures and Presentations: "Mosuki - Artificial Networks Naturally", CodeCon, San Francisco, 2004 A general purpose architecture for building social network applications. We have a general data structure for social networks which includes a permission system and a way to establish arbitrary relations between objects. We also have an application framework that makes it easy to deploy new applications on top of this data structure. Arbitrary relations, or certifications, can be used to drive applications. "WikiWikiWAN - Ad-hoc, wireless routing", CodeCon, San Francisco, 2002 The WikiWikiWAN is an ad-hoc, wireless mesh network whose aim was to provide public internet access without need for a central ISP. Using the broadband connections of a small number of nodes on the network, intelligent routing would provide internet service for any node in the network in a "fair" way. "Chaos and Neurodynamics", University of California, Santa Cruz, 1999 An introduction to Walter J. Freeman's research into the dynamical states of a rat's olfactory bulb, the functional roles chaotic dynamics may have in the olfactory bulb, and a comparison between olfactory bulb states and Chris Langton's view of information movement in complex dynamical systems. "Multimedia Explorations of Dynamical Systems", University of California, Santa Cruz, 1999 Overview of a visual and aural software suite we created to aid in the inspection of 2 and 4 dimensional complex dynamical systems. Components included 2D graph generator and trajectory inspector, 3D slicer of quaternion space, and trajacetory to MIDI sound auralizer. "Truncated Trickery", University of California, Santa Cruz, 1997 An investigation into the tilings of n-dimensional spaces by n-dimensional regular polyhedra, n > 2. Papers: "Repeated one-shot prisoners' dilemma with reputations", Jeremy Avnet, Allan Friedman, Hiroshi Tamura, Will Tracy, Zhang Zhi, Zhu Mengxiao, Santa Fe Institute: Complex Systems Summer School, Qingdao China, July 4 - 30, 2004. We detail the results of an experiment designed to extend the existing work on the application of genetic algorithms to the Prisoner's Dilemma. Unlike the traditional model in which agents play an indefinite number of games against each opponent, our agents play a one-shot game before being randomly assigned to a new opponent. Additionally, each agent can see their opponent's actions for the last three rounds. "Towards Robust and Scalable Trust Metrics", Jeremy Avnet and Jared Saia, Technical Report TR-CS-2003-23, Computer Science Department, University of New Mexico, Albuquerque, May 2003. We describe a distributed and scalable trust metric for networks where transactions occur under a model of preferential attachment. Our trust metric algorithm, which we call expert voting is very simple. For a given network, the algorithm always considers only the opinions of the first nodes to join the network; we call these nodes experts. For any node, the algorithm evaluates the trustworthiness based on the opinions of those experts with which it has had transactions with. Empirical results suggest this algorithm is surprisingly robust for large scale networks where transactions occur under a model of preferential attachment. To the best of our knowledge, this is the first algorithm that exploits a model of preferential attachment. http://www.cs.unm.edu/colloq-bin/tech_reports.cgi?ID=TR-CS-2003-23 "Peek-A-Booty Resource Discovery", Jeremy Avnet, Bram Cohen, Jonathan Moore, Haven Shell Wiki, San Francisco, California, March 2002. The Peek-A-Booty peer-to-peer network provides anonymous and uncensored web access to individuals residing in countries where web surfing is filtered. To use the Peek-A-Booty network, an individual must know the address of an uncensored node to proxy their requests for web documents. Both the web surfer and the censoring agency desire to know about as many nodes as possible. We solve the problem of nodes both needing to be found and needing to stay hidden by making their discovery a slow process. http://wiki.haven.sh/index.php/PeekabootyResourceDiscovery "Computation, Dynamics and the Phase-Transition", Jeremy Avnet, Senior Thesis, Mathematics Department, University of California, Santa Cruz, June 2000. An exploration is made into the dynamics of cellular automata in order to answer the question: is there a deep connection between the theories of dynamical systems and computation? Is there an analog for the notion of universal computation in dynamical systems theory? The thermodynamic notion of a phase-transition is proposed as the model in which computation and dynamics commingle. http://citeseer.nj.nec.com/avnet00computation.html Research Positions: Research Assistant, Jared Saia, University of New Mexico, 2003 Worked with professor Jared Saia to develop trust metric algorithms on scale-free networks. Postgraduate Researcher, Learning and Experimental Economics Projects of Santa Cruz (LEEPS), UCSC, 2000 (Supervisor: Dan Friedman) Helped write software to run spatialized prisoner dilemma / coordination type games on small-world network of people. Worked with Xerox Parc Internet Ecologies group to write software that created live experiment versions of their computational simulations of congestion dynamics. Undergraduate Researcher, Visual Math Institute, Santa Cruz, 1998 Created a simple model of a salt marsh planned for construction between Pelham Bay Landfill (a toxic dump north of New York city) and the bay. ------------------------------------------------------------------------ http://brainsik.to/resume.txt http://brainsik.to/cv.txt March 2008