Predictors of academic achievement and social competence in adolescence : facilitation, inhibition and general cognitive processing /

The relevance of attentional measures to cognitive and social adaptive behaviour was examined in an adolescent sample. Unlike previous research, the influence of both inhibitory and facilitory aspects of attention were studied. In addition, contributions made by these attentional processes were compared with traditional psychometric measures of cognitive functioning. Data were gathered from 36 grade 10 and 1 1 high school students (20 male and 16 female students) with a variety of learning and attentional difficulties. Data collection was conducted in the course of two testing sessions. In the first session, students completed questionnaires regarding their medical history, and everyday behaviours (the Brock Adaptive Functioning Questionnaire), along with non-verbal problem solving tasks and motor speed tasks. In the second session, students performed working memory measures and computer-administered tasks assessing inhibitory and facilitory aspects of attention. Grades and teacher-rated measures of cognitive and social impulsivity were also gathered. Results indicate that attentional control has both cognitive and social/emotional implications. Performance on negative priming and facilitation trials from the Flanker task predicted grades in core courses, social functioning measures, and cognitive and social impulsivity ratings. However, beneficial effects for academic and social functioning associated with inhibition were less prevalent in those demonstrating a greater ability to respond to facilitory cues. There was also some evidence that high levels of facilitation were less beneficial to academic performance, and female students were more likely to exceed optimal levels of facilitory processing. Furthermore, lower negative priming was ''S'K 'i\':y-: -'*' - r " j«v ; ''*.' iij^y Inhibition, Facilitation and Social Competence 3 associated with classroom-rated distraction and hyperactivity, but the relationship between inhibition and social aspects of impulsivity was stronger for adolescents with learning or reading problems, and the relationship between inhibition and cognitive impulsivity was stronger for male students. In most cases, attentional measures were predictive of performance outcomes independent of traditional psychometric measures of cognitive functioning. >,, These findings provide support for neuropsychological models linking inhibition to control of interference and arousal, and emphasize the fundamental role of attention in everyday adolescent activities. The findings also warrant further investigation into the ways which inhibitory and facilitory attentional processes interact, and the contextdependent nature of attentional control.associated with classroom-rated distraction and hyperactivity, but the relationship between inhibition and social aspects of impulsivity was stronger for adolescents with learning or reading problems, and the relationship between inhibition and cognitive impulsivity was stronger for male students. In most cases, attentional measures were predictive of performance outcomes independent of traditional psychometric measures of cognitive functioning. >,, These findings provide support for neuropsychological models linking inhibition to control of interference and arousal, and emphasize the fundamental role of attention in everyday adolescent activities. The findings also warrant further investigation into the ways which inhibitory and facilitory attentional processes interact, and the contextdependent nature of attentional control.

Problem solving and computer-assisted instruction in science education : analysis of research findings and the research process /

The quantitative component of this study examined the effect of computerassisted instruction (CAI) on science problem-solving performance, as well as the significance of logical reasoning ability to this relationship. I had the dual role of researcher and teacher, as I conducted the study with 84 grade seven students to whom I simultaneously taught science on a rotary-basis. A two-treatment research design using this sample of convenience allowed for a comparison between the problem-solving performance of a CAI treatment group (n = 46) versus a laboratory-based control group (n = 38). Science problem-solving performance was measured by a pretest and posttest that I developed for this study. The validity of these tests was addressed through critical discussions with faculty members, colleagues, as well as through feedback gained in a pilot study. High reliability was revealed between the pretest and the posttest; in this way, students who tended to score high on the pretest also tended to score high on the posttest. Interrater reliability was found to be high for 30 randomly-selected test responses which were scored independently by two raters (i.e., myself and my faculty advisor). Results indicated that the form of computer-assisted instruction (CAI) used in this study did not significantly improve students' problem-solving performance. Logical reasoning ability was measured by an abbreviated version of the Group Assessment of Lx)gical Thinking (GALT). Logical reasoning ability was found to be correlated to problem-solving performance in that, students with high logical reasoning ability tended to do better on the problem-solving tests and vice versa. However, no significant difference was observed in problem-solving improvement, in the laboratory-based instruction group versus the CAI group, for students varying in level of logical reasoning ability.Insignificant trends were noted in results obtained from students of high logical reasoning ability, but require further study. It was acknowledged that conclusions drawn from the quantitative component of this study were limited, as further modifications of the tests were recommended, as well as the use of a larger sample size. The purpose of the qualitative component of the study was to provide a detailed description ofmy thesis research process as a Brock University Master of Education student. My research journal notes served as the data base for open coding analysis. This analysis revealed six main themes which best described my research experience: research interests, practical considerations, research design, research analysis, development of the problem-solving tests, and scoring scheme development. These important areas ofmy thesis research experience were recounted in the form of a personal narrative. It was noted that the research process was a form of problem solving in itself, as I made use of several problem-solving strategies to achieve desired thesis outcomes.

The use of explicit algorithms and episodic context to teach subtraction to students with learning problems in mathematics /

This research attempted to address the question of the role of explicit algorithms and episodic contexts in the acquisition of computational procedures for regrouping in subtraction. Three groups of students having difficulty learning to subtract with regrouping were taught procedures for doing so through either an explicit algorithm, an episodic content or an examples approach. It was hypothesized that the use of an explicit algorithm represented in a flow chart format would facilitate the acquisition and retention of specific procedural steps relative to the other two conditions. On the other hand, the use of paragraph stories to create episodic content was expected to facilitate the retrieval of algorithms, particularly in a mixed presentation format. The subjects were tested on similar, near, and far transfer questions over a four-day period. Near and far transfer algorithms were also introduced on Day Two. The results suggested that both explicit and episodic context facilitate performance on questions requiring subtraction with regrouping. However, the differential effects of these two approaches on near and far transfer questions were not as easy to identify. Explicit algorithms may facilitate the acquisition of specific procedural steps while at the same time inhibiting the application of such steps to transfer questions. Similarly, the value of episodic context in cuing the retrieval of an algorithm may be limited by the ability of a subject to identify and classify a new question as an exemplar of a particular episodically deflned problem type or category. The implications of these findings in relation to the procedures employed in the teaching of Mathematics to students with learning problems are discussed in detail.

Educating for love of wisdom : John Dewey and Simone Weil

The writings of John Dewey (1859-1952) and Simone Weil (1909-1943) were analyzed with a view to answering 3 main questions: What is wisdom? How is wisdom connected to experience? How does one educate for a love of wisdom? Using a dialectical method whereby Dewey (a pragmatist) was critiqued by Weil (a Christian Platonist) and vice versa, commonalities and differences were identified and clarified. For both, wisdom involved the application of thought to specific, concrete problems in order to secure a better way of life. For Weil, wisdom was centered on a love of truth that involved a certain way of applying one's attention to a concrete or theoretical problem. Weil believed that nature was subject to a divine wisdom and that a truly democratic society had supernatural roots. Dewey believed that any attempt to move beyond nature would stunt the growth of wisdom. For him, wisdom could be nourished only by natural streams-even if some ofthem were given a divine designation. For both, wisdom emerged through the discipline of work understood as intelligent activity, a coherent relationship between thinking and acting. Although Weil and Dewey differed on how they distinguished these 2 activities, they both advocated a type of education which involved practical experience and confronted concrete problems. Whereas Dewey viewed each problem optimistically with the hope of solving it, Weil saw wisdom in, contemplating insoluble contradictions. For both, educating for a love of wisdom meant cultivating a student's desire to keep thinking in line with acting-wanting to test ideas in action and striving to make sense of actions observed.

Anxiety and learning / response behaviour in the context of intellectual problem solving by young children

Twenty-eight grade four students were ca.tegorized as either high or low anxious subjects as per Gillis' Child Anxiety Scale (a self-report general measure). In determining impulsivity in their response tendencies, via Kagan's Ma.tching Familiar Figures Test, a significant difference between the two groups was not found to exist. Training procedures (verbal labelling plus rehearsal strategies) were introduced in modification of their learning behaviour on a visual sequential memory task. Significantly more reflective memory recall behaviour was noted by both groups as a result. Furthermore, transfer of the reflective quality of this learning strategy produced significantly less impulsive response behaviour for high and low anxious subjects with respect to response latency and for low anxious subjects with respect to response accuracy.

Zero-sum problems in finite cyclic groups

The purpose of this thesis is to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if it is equivalent under group automorphism to one which has sum precisely IGI when this sum is viewed as an integer. This thesis investigates two major problems, the first of which is referred to as the basic pair problem. This problem seeks to determine conditions for which every zero-sequence of a given length in a finite abelian group has the basic property. We resolve an open problem regarding basic pairs in cyclic groups by demonstrating that every sequence of length four in Zp has the basic property, and we conjecture on the complete solution of this problem. The second problem is a 1988 conjecture of Kleitman and Lemke, part of which claims that every sequence of length n in Zn has a subsequence with the basic property. If one considers the special case where n is an odd integer we believe this conjecture to hold true. We verify this is the case for all prime integers less than 40, and all odd integers less than 26. In addition, we resolve the Kleitman-Lemke conjecture for general n in the negative. That is, we demonstrate a sequence in any finite abelian group isomorphic to Z2p (for p ~ 11 a prime) containing no subsequence with the basic property. These results, as well as the results found along the way, contribute to many other problems in zero-sum theory.

The expression and development of teachers' capacities within two learning communities : a participant-observer case study

The learning community model has been an integral component of teacher development in Ontarian schools and beyond. This research was conducted to understand how teachers' personal capacity and professional, interpersonal, and organizational competencies are developed and expressed within this context. Nineteen elementary teachers and administrators participated in the study from November through January 2007. A qualitative case study methodology was used to investigate the role ofteachers' capacities and competencies in learning communities. Combined data sources from semistructured interviews, research journals, and document review were used to gather data about teachers' capacities and competencies. The study included 3 phases of analysis. In the final phase the analysis provided 3 qualities of the teachers at Jude and Mountain Schools (pseudonyms): identification as professionals, investment in others, and institutional affiliation that may explain how they differed from other educators. The data revealed these three themes, which provided an understanding of educators at Jude and Mountain Schools as dedicated professionals pushing practices to contribute to school life and address student learning needs, and as teachers who reflected on practices to continue expanding their skills. Teachers were heavily invested in creating a caring culture and in students' and team members' learning. Educators actively participated in solving problems and coplanning throughout the school levels and beyond, assumed collective responsibility for all pupils, and focused on generating school-wide consistent practices. These qualities and action patterns revealed teachers who invested time and effort in their colleagues, who committed to develop as professionals, and who affiliated closely with every aspect of school living.

RelMDD-A Library for Manipulating Relations Based on MDDs

Relation algebras is one of the state-of-the-art means used by mathematicians and computer scientists for solving very complex problems. As a result, a computer algebra system for relation algebras called RelView has been developed at Kiel University. RelView works within the standard model of relation algebras. On the other hand, relation algebras do have other models which may have different properties. For example, in the standard model we always have L;L=L (the composition of two (heterogeneous) universal relations yields a universal relation). This is not true in some non-standard models. Therefore, any example in RelView will always satisfy this property even though it is not true in general. On the other hand, it has been shown that every relation algebra with relational sums and subobjects can be seen as matrix algebra similar to the correspondence of binary relations between sets and Boolean matrices. The aim of my research is to develop a new system that works with both standard and non-standard models for arbitrary relations using multiple-valued decision diagrams (MDDs). This system will implement relations as matrix algebras. The proposed structure is a library written in C which can be imported by other languages such as Java or Haskell.

Generating Aesthetically Pleasing Images in a Virtual Environment using Particle Swarm Optimization

This research focuses on generating aesthetically pleasing images in virtual environments using the particle swarm optimization (PSO) algorithm. The PSO is a stochastic population based search algorithm that is inspired by the flocking behavior of birds. In this research, we implement swarms of cameras flying through a virtual world in search of an image that is aesthetically pleasing. Virtual world exploration using particle swarm optimization is considered to be a new research area and is of interest to both the scientific and artistic communities. Aesthetic rules such as rule of thirds, subject matter, colour similarity and horizon line are all analyzed together as a multi-objective problem to analyze and solve with rendered images. A new multi-objective PSO algorithm, the sum of ranks PSO, is introduced. It is empirically compared to other single-objective and multi-objective swarm algorithms. An advantage of the sum of ranks PSO is that it is useful for solving high-dimensional problems within the context of this research. Throughout many experiments, we show that our approach is capable of automatically producing images satisfying a variety of supplied aesthetic criteria.

Repertory grid adaptations in detecting connotative trends and social behaviour problems in education

Please consult the paper edition of this thesis to read. It is available on the 5th Floor of the Library at Call Number: Z 9999 E38 K66 1983

A Needs Assessment: Language Instruction Stakeholders Engaging in Project Based Learning Outside the Classroom for Effective Strategic Problem Solving

Abstract A noted benefit of Project Based Learning (PBL) as a teaching strategy is how it engages the student and enhances learning outcomes as a result of working through challenges intended to depict dilemmas outside the classroom. PBL has seldom been applied outside the parameters of the classroom curriculum. The current needs assessment carried out in this research project examined current practices of language instruction and International Administrative Professionals of both the private and public Language Industry. Participants responded to survey questions on their current administrative practices, strategies, and program characteristics. The study investigated the usefulness of a handbook on the procedure of assisting administrative service teams in language instruction settings to an engaged approach to PBL for student service issues. The diverse opinions, beliefs, and ideas, along with institutional policy, can provide beneficial framework ideas for future tools.

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.

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.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.