Personality and neuropsychological factors involved in females' relational aggression

The personality and neuropsychological factors associated with relational aggression were examined in a group of30 grade 6,7, and 8 girls identified through cluster analysis as being highly, yet almost exclusively, relationally aggressive and a group of 30 nonaggressive matched controls. Parents of the students in both groups completed the Coolidge Personality and Neuropsychological Inventory (1998), a 200- item DSM-IV -TR aligned, parent-as-respondent, standardized measure of c.hildren' s psychological functioning. It was found that high levels of relational aggression, in the absence of physical and verbal aggression, were associated with symptoms of DSM-IV - TR Axis I oppositional defiant disorder and conduct disorder and a wide variety of personality traits associated with DSM-IV -TR Axis II paranoid, borderline, narcissistic, histrionic, schizotypal, and passive aggressive personality disorders. Implications of these findings for theory, practice, and further research are discussed.

Being Relational With Underserved Youth: A Reflective Process

When working with under-served youth, possibly the most important, yet often times the most difficult, thing for practitioners to do is to build positive, trusting, open relationships. This study aims to address this challenge. Two groups of under-served youth were examined, one being teens deemed “at-risk” and one being youth with Autism Spectrum Disorder (ASD). This study was novel in its approach as all efforts were made to ensure the youth's opinions on how to be relational with them were heard. Two youths with ASD were nonverbal and a special picture interview procedure was developed to allow their participation. Three thematic statements emerged from the data collected: 1. Youth need low anxiety relationships. 2. Youth need novel forms of engagement. 3. Youth need us to understand that their actions reflect their histories. The analyses that lead to these statements are described as well as the reasoning and implications of these statements.

Linking Ethical Leadership and Employees’ In-Role Performance: Exploring the Mediating Roles of Psychological Capital and Follower-Leader Relational Capital

This study investigates the mediating impact of psychological capital and follower-leader relational capital on the relationship between ethical leadership and in-role performance through the lenses of social exchange theory, social information processing theory, and psychological resources theory. Analysis of data collected from a sample of 171 employees and 24 supervisors from Pakistan reveals that ethical leadership has a positive effect on followers’ in-role job performance, yet this effect is fully explained through the role of psychological capital and partially through follower-leader relational capital. Significant implications of these findings for further research and practice are discussed.

An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases

Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set where each element of the corresponding domain is assigned a membership degree from the real interval [0…1]. But this fuzzy mechanism becomes inappropriate in modelling scenarios where data might be incomparable. Therefore, we become interested in further generalization of fuzzy database into L-fuzzy database. In such a database, the characteristic function for a fuzzy set maps to an arbitrary complete Brouwerian lattice L. From the query language perspectives, the language of fuzzy database, FSQL extends the regular Structured Query Language (SQL) by adding fuzzy specific constructions. In addition to that, L-fuzzy query language LFSQL introduces appropriate linguistic operations to define and manipulate inexact data in an L-fuzzy database. This research mainly focuses on defining the semantics of LFSQL. However, it requires an abstract algebraic theory which can be used to prove all the properties of, and operations on, L-fuzzy relations. In our study, we show that the theory of arrow categories forms a suitable framework for that. Therefore, we define the semantics of LFSQL in the abstract notion of an arrow category. In addition, we implement the operations of L-fuzzy relations in Haskell and develop a parser that translates algebraic expressions into our implementation.

Towards automated derivation in the theory of allegories

We provide an algorithm that automatically derives many provable theorems in the equational theory of allegories. This was accomplished by noticing properties of an existing decision algorithm that could be extended to provide a derivation in addition to a decision certificate. We also suggest improvements and corrections to previous research in order to motivate further work on a complete derivation mechanism. The results presented here are significant for those interested in relational theories, since we essentially have a subtheory where automatic proof-generation is possible. This is also relevant to program verification since relations are well-suited to describe the behaviour of computer programs. It is likely that extensions of the theory of allegories are also decidable and possibly suitable for further expansions of the algorithm presented here.

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.

Extending relAPS to first order logic

RelAPS is an interactive system assisting in proving relation-algebraic theorems. The aim of the system is to provide an environment where a user can perform a relation-algebraic proof similar to doing it using pencil and paper. The previous version of RelAPS accepts only Horn-formulas. To extend the system to first order logic, we have defined and implemented a new language based on theory of allegories as well as a new calculus. The language has two different kinds of terms; object terms and relational terms, where object terms are built from object constant symbols and object variables, and relational terms from typed relational constant symbols, typed relational variables, typed operation symbols and the regular operations available in any allegory. The calculus is a mixture of natural deduction and the sequent calculus. It is formulated in a sequent style but with exactly one formula on the right-hand side. We have shown soundness and completeness of this new logic which verifies that the underlying proof system of RelAPS is working correctly.