Canadian curling coaches' use of psychological skills training

Hom's (2008) model of coaching effectiveness proposes a series of direct relationships between the beliefs and values of coaches, their behaviours, and the perceptions of their athletes. One specific area of coaching behaviour that is in need of more research is their use of psychological skills training (PSn. The purpose of this study was to examine the relationship between the beliefs and behaviours of curling coaches with respect to PST, and the perceptions of their athletes. In collaboration with the Canadian Curling Association, data was collected from a national sample of 115 curling teams with varying levels of competition and experience. One hundred and fifteen coaches completed PST attitude (SPA-RC-revised) and behaviour (MSQ-revised) measures, while 403 athletes completed two perception measures (CCS and S-CI). Interclass correlation coefficients (ICC) were calculated to ensure intra-team consistency. All ICCs were positive, ranging from r =.39 to .56, and significant at the p < .01 level. A series of multiple regressions were performed. Three of the four regression models were significant, with coaches' PST behaviours accounting for 16% of the variance in athletes' evaluation of their coaches' competencies (GeC). The models for athletes' PhysicalSport Confidence (P-SC) and Cognitive-Sport Confidence (C-SC) accounted for 15% and 36% of the variation, with GCC and coaches' PST behaviours both being significant predictors of the models. After statistically controlling the influence of GCC, coaches' PST behaviours accounted for 3% and 26% of the variation in athletes P-SC and C-SC. These results provide partial support for Hom's (2008) model of coaching effectiveness, and offer new insight into the benefits of coaches' use of sport psychology-related training behaviours.

ReAlM - a system to manipulate relations

Given a heterogeneous relation algebra R, it is well known that the algebra of matrices with coefficient from R is relation algebra with relational sums that is not necessarily finite. When a relational product exists or the point axiom is given, we can represent the relation algebra by concrete binary relations between sets, which means the algebra may be seen as an algebra of Boolean matrices. However, it is not possible to represent every relation algebra. It is well known that the smallest relation algebra that is not representable has only 16 elements. Such an algebra can not be put in a Boolean matrix form.[15] In [15, 16] it was shown that every relation algebra R with relational sums and sub-objects is equivalent to an algebra of matrices over a suitable basis. This basis is given by the integral objects of R, and is, compared to R, much smaller. Aim of my thesis is to develop a system called ReAlM - Relation Algebra Manipulator - that is capable of visualizing computations in arbitrary relation algebras using the matrix approach.

Generating finite integral relation algebras

Relation algebras and categories of relations in particular have proven to be extremely useful as a fundamental tool in mathematics and computer science. Since relation algebras are Boolean algebras with some well-behaved operations, every such algebra provides an atom structure, i.e., a relational structure on its set of atoms. In the case of complete and atomic structure (e.g. finite algebras), the original algebra can be recovered from its atom structure by using the complex algebra construction. This gives a representation of relation algebras as the complex algebra of a certain relational structure. This property is of particular interest because storing the atom structure requires less space than the entire algebra. In this thesis I want to introduce and implement three structures representing atom structures of integral heterogeneous relation algebras, i.e., categorical versions of relation algebras. The first structure will simply embed a homogeneous atom structure of a relation algebra into the heterogeneous context. The second structure is obtained by splitting all symmetric idempotent relations. This new algebra is in almost all cases an heterogeneous structure having more objects than the original one. Finally, I will define two different union operations to combine two algebras into a single one.

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.

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.

University of Toronto exams

University of Toronto exams. These are in and envelope which is marked “Arts 1st year”. Included in this package are some text book pages [Latin] with the name Ham K. Woodruff written on them. The exams include: Anatomy, Arithmetic and Algebra, Medicine Chemistry, English, Euclid, French, Greek, Latin, Latin Grammar, Latin Prose (2 copies), Materia Medica and Therapeutics and Physiology for 1879. The exams for 1880 include Arithmetic and Algebra, Greek and Trigonometry. The 1881 Greek exam is also included. There is writing on some of the exams and some are worn and stained. The envelope is torn and stained and the textbook pages are slightly burned. This does not affect the text, 1879-1881.