Completing the picture: the effects of video game practice on verbal and performance I.Q. scores in high functioning children

The strength and nature of the video game practice effect on tests of visual and perceptual skills were examined using high functioning Grades Four and Five students who had been tested with the WISC-R .for the purpose of gifted identification and placement. The control group, who did not own and .play video games on a sustained basis, and the experimental group, who did own a video game system and had some mastery of video games, including the -Nintendo game, "Tetris", were each composed of 18 juniorg:r;-ade students and were chosen from pre-existing conditions. The experimental group corresponded to the control group in terms of age, sex, and community. Data on the Verbal and Performance I.Q. Scores were· collected for both groups and the author was interested in the difference between the Verbal and Performance Scores within each group, anticipating a P > V outcome for the experimental group. The results showed a significant P > V difference in the experimental, video game playing group, as expected, but no significant difference between the Performance $cores of the control and experimental groups. The results, thus, indicated lower Verbal I.Q. Scores in the experimental group relat'ive to 'the control group.' The study conclu~ed that information about a sUbject's video game experience and "learhing style pref~rence is important for a clear interpretation of the Verbal and Performance I.Q. Scores of the WISC-R. Although the time spent on video game play may, 'indeed, increase P~rformance Scores relative to Verbal Scores for an individual, the possibilities exist that the time borrowed and spent away from language based activities may retard verbal growth and/or that the cognitive style associated with some Performance I.Q.subtests may have a negative effect on the approach to the tasks on the Verbal I.Q. Scale. The study also discussed the possibility that exposure to ,the video game experience, in pre-puberty, can provide spatial instruction which will result in improved spatial skills. strong spatial skills have been linked to improved performance and preference in mathematics, science, and engineering and it was suggested that appropriate video game play might be a way to involve girls more in the fields of mathematics and science.

Winâ Foy : functional object-oriented programming language

This thesis will introduce a new strongly typed programming language utilizing Self types, named Win--*Foy, along with a suitable user interface designed specifically to highlight language features. The need for such a programming language is based on deficiencies found in programming languages that support both Self types and subtyping. Subtyping is a concept that is taken for granted by most software engineers programming in object-oriented languages. Subtyping supports subsumption but it does not support the inheritance of binary methods. Binary methods contain an argument of type Self, the same type as the object itself, in a contravariant position, i.e. as a parameter. There are several arguments in favour of introducing Self types into a programming language (11. This rationale led to the development of a relation that has become known as matching [4, 5). The matching relation does not support subsumption, however, it does support the inheritance of binary methods. Two forms of matching have been proposed (lJ. Specifically, these relations are known as higher-order matching and I-bound matching. Previous research on these relations indicates that the higher-order matching relation is both reflexive and transitive whereas the f-bound matching is reflexive but not transitive (7]. The higher-order matching relation provides significant flexibility regarding inheritance of methods that utilize or return values of the same type. This flexibility, in certain situations, can restrict the programmer from defining specific classes and methods which are based on constant values [21J. For this reason, the type This is used as a second reference to the type of the object that cannot, contrary to Self, be specialized in subclasses. F-bound matching allows a programmer to define a function that will work for all types of A', a subtype of an upper bound function of type A, with the result type being dependent on A'. The use of parametric polymorphism in f-bound matching provides a connection to subtyping in object-oriented languages. This thesis will contain two main sections. Firstly, significant details concerning deficiencies of the subtype relation and the need to introduce higher-order and f-bound matching relations into programming languages will be explored. Secondly, a new programming language named Win--*Foy Functional Object-Oriented Programming Language has been created, along with a suitable user interface, in order to facilitate experimentation by programmers regarding the matching relation. The construction of the programming language and the user interface will be explained in detail.

Equational Reasoning about Object-Oriented Programs

Formal verification of software can be an enormous task. This fact brought some software engineers to claim that formal verification is not feasible in practice. One possible method of supporting the verification process is a programming language that provides powerful abstraction mechanisms combined with intensive reuse of code. In this thesis we present a strongly typed functional object-oriented programming language. This language features type operators of arbitrary kind corresponding to so-called type protocols. Sub classing and inheritance is based on higher-order matching, i.e., utilizes type protocols as basic tool for reuse of code. We define the operational and axiomatic semantics of this language formally. The latter is the basis of the interactive proof assistant VOOP (Verified Object-Oriented Programs) that allows the user to prove equational properties of programs interactively.

Real-Time Automatic Object Classification and Tracking using Genetic Programming and NVIDIA R CUDA TM

Genetic Programming (GP) is a widely used methodology for solving various computational problems. GP's problem solving ability is usually hindered by its long execution times. In this thesis, GP is applied toward real-time computer vision. In particular, object classification and tracking using a parallel GP system is discussed. First, a study of suitable GP languages for object classification is presented. Two main GP approaches for visual pattern classification, namely the block-classifiers and the pixel-classifiers, were studied. Results showed that the pixel-classifiers generally performed better. Using these results, a suitable language was selected for the real-time implementation. Synthetic video data was used in the experiments. The goal of the experiments was to evolve a unique classifier for each texture pattern that existed in the video. The experiments revealed that the system was capable of correctly tracking the textures in the video. The performance of the system was on-par with real-time requirements.