Investigation of Changes in Prescribed and Voluntary Job Roles in Community Service Delivery for People who have Intellectual Disabilities after the Implementation of the 3 Rs; Rights, Respect and Responsibility Project

The purpose of this thesis was to explore whether there is change in organizational citizenship behaviours in community agency staff following agency adoption of a rights - based service philosophy. Four community agency support staff were interviewed to investigate how residential care providers in services for persons who have intellectual disabilities describe their voluntary job related behaviours following training about human rights. The major finding was that the participants were actively engaged in displaying civic virtue, courtesy, and altruism discretionary behaviours. There was evidence of a post rights training shift in communication patterns with support staff reporting that they used language that prom,oted and advocated for human rights, and reported increased communication exchanges among persons supported by the agency, support staff and managers. Participants also suggested that the individuals they support asserted their rights more frequently and they were more active in their own life choices following rights training.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

Job Demands and Organizational Citizenship Behavior: The Roles of Organizational Commitment and Social Interaction

Drawing from the Job Demands-Resources (JD-R) model and research on social exchange relationships, this study investigates the impact of three job demands (work overload, interpersonal conflict, and dissatisfaction with the organization’s current situation) on employees’ organizational citizenship behavior (OCB), the hitherto unexplored mediating role of organizational commitment in the link between job demands and organizational citizenship behavior (OCB), as well as how this mediating effect might be moderated by social interaction. Using a multi-source, two-wave research design, surveys were administered to 707 employees and their supervisors in a Mexican-based organization. The hypotheses were tested with hierarchical regression analysis. The results indicate a direct negative relationship between interpersonal conflict and OCB, and a mediating effect of organizational commitment for interpersonal conflict and dissatisfaction with the organization’s current situation. Further, social interaction moderates the mediating effect of organizational commitment for each of the three job demands such that the mediating effect is weaker at higher levels of social interaction. The study suggests that organizations aiming to instill OCB among their employees should match the immediate work context surrounding their task execution with an internal environment that promotes informal relationship building.

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.