10 resultados para Externalizing problems
em Brock University, Canada
Resumo:
The relationship between maternal beliefs about children's externalizing behaviors (EB) and the frequency of their children's EB was investigated. The sample of 71 consisted of two groups of mothers of children between 8-12 years of age. The Clinic group consisted of 35 mothers of children referred to a Children's Clinic due to externalizing behavior problems. The School group consisted of 36 mothers of children attending elementary school. Mothers completed questionnaires measuring parental beliefs and the frequency of their children's EB. Results showed that mothers' endorsement of authoritarian parenting was positively related to children's EB scores. A U-shaped relationship was found between mothers' relationship-centered goals and children's EB scores. Parent-centered goals and children's EB scores were positively correlated only in the clinic group. Mothers'-hostile attribution scores were positively related to their children's EB scores in both groups. Mothers with low perceived parenting scores were associated with higher children's EB scores in both groups. Overall, results revealed potential clinical implications. Parenting programs that change parenting goals, attributions, and ii Parental Beliefs sense of parenting control, which in turn influences parenting behavior, may influence the frequency of their children's externalizing behaviors.
Resumo:
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.
Resumo:
The present study examined the bullying experiences of a group of students, age 10-14 years, identified as having behaviour problems. A total often students participated in a series of mixed methodology activities, including self-report questionnaires, story telling exercises, and interview style joumaling. The main research questions were related to the prevalence of bully/victims and the type of bullying experiences in this population. Questionnaires gathered information about their involvement in bullying, as well as about psychological risk factors including normative beliefs about antisocial acts, impulsivity, problem solving, and coping strategies. Journal questions expanded on these themes and allowed students to explain their personal experiences as bullies and victims as well as provide suggestions for intervention. The overall results indicated that all of the ten students in this sample have participated in bullying as both a bully and a victim. This high prevalence of bully/victim involvement in students from behavioural classrooms is in sharp contrast with the general population where the prevalence is about 33%. In addition, a common thread was found that indicated that these students who participated in this study demonstrate characteristics of emotionally dysregulated reactive bullies. Theoretical implication and educational practices are discussed.
Resumo:
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.
Resumo:
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
Resumo:
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.
Resumo:
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.
Resumo:
The book is signed by S.D. Woodruff. A label the book indicates that it was also owned by "Band, of De Vere Gardens in Toronto".
Resumo:
Letter to Henry Nelles from Michael Harris regarding estate problems (3 pages, handwritten with writing going in 2 directions on the last page), May 30, 1821.