This paper, which builds of the work of Hay, Kennedy, and Levin (1999), examines the puzzling aspectual behavior of so-called degree achievements. Drawing evidence from Mandarin Chinese, I argue that degree achievements without difference values denote punctual events, i.e., they are true achievements. I present an analysis that is consistent with facts from both English and Mandarin; to explai...

In 1993, as my freshman summer project, I wrote the first version of the Avida platform for digital evolution. This is an environment in which simple self-replicating computer programs evolve and adapt. Since 1993, the Avida platform has become a major model for investigating evolutionary principles. Of particular note, the BEACON NSF STC at MSU is partly centered around using Avida for researc...

Achievements in games are assumed to be extrinsic motivators yet this has not been shown to be the case experimentally. This study attempts to determine whether achievements exhibit characteristics more closely related to intrinsic or extrinsic motivators. An experiment was conducted in order to examine the effects of Achievements in a controlled environment. It was found that Achievements show...

The problem of interest is to determine the minimum number of edges of a 2-connected graph having a diameter equal to p. This problem deals with telecommunication survivable networks design with constraint of grade of service. In this article we prove the bounds of the number of edges for 2-connected graphs or for 2-edges-connected graphs with a diameter p. The bound for 2-connected graphs was ...

K. Witte 1 , V. Bagnoud 1 , A. Blazevic 1 , S. Borneis 1 , C. Bruske 1 , J. Caird 2 , S. Calderon 3 , U. Eisenbarth 1 , J. Fils 1,4 , S. Götte 1 , T. Hahn 1 , H.-M. Heuck 1,5 , D. H. H. Hoffmann 4 , D. Javorkova 1 , G. Klappich 1 , F. Knobloch 1 , Th. Kühl 1,6 , M. Kugler 1,7 , S. Kunzer 1 , M. Kreutz 1 , B. LeGarrec 8 , T. Merz-Mantwill 1 , E. Onkels 1 , S. Radau 9 , M. Rebscher 1 , D. Reemts ...