Finding the Open Spaces in Closed Systems: An Exploration of Critical Pedagogy with a Social Justice Directive in an Ontario Secondary School Classroom

This study examines the first experience of students, teachers, and an administrator in implementing a teacher-designed Leadership in Social Justice Program at a large urban Ontario secondary school. The program aimed to infuse a Freirean concept of critical pedagogical praxis (Freire, 1970/1993) in a grade 12 integrated educational experience with a social justice directive. Data were collected through two questionnaires and eight in-depth interviews. The data identified three areas of awareness that described ways in which student participants were impacted most profoundly (a) developing self-awareness, (b) understanding a new educational paradigm, and (c) finding a place in the world. The study found that the program was successful in highlighting the possibility for more meaningful education and engaged many students deeply; however, its success was limited by the lead teacher’s failure to fully grasp and implement tenets of Freirean critical pedagogy that involved the role of the teacher in pedagogical processes.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.

Finding and Implementing Relevant Resources in Adapted Physical Activity (APA): It's easier said than done...

The purpose of this research was to explore challenges to operationalizing and implementing relevant resources for Adapted Physical Activity (APA) and to develop a framework on how resources should be developed and implemented to foster appropriate APA. An unobtrusive methodology was used to examine existing resources and training/learning opportunities for practitioners teaching APA. Data were collected via unobtrusive methods: documents, records, literature and feedback forms. After the findings were summarized, expert consultations were completed using a modified Delphi- technique to confirm the findings. A constructivist approach and phenomenological orientation was used to analyze the data and develop the “ideal” resource. Results indicate there are limited APA resources and teaching/learning opportunities for practitioners and there is a need for practitioner facilitation through professional development on finding and implementing resources. Future research should develop and evaluate the “ideal” resource and strive to improve the connection and consistency of resources in APA.

GA approach for finding Rough Set decision rules based on bireducts

Feature selection plays an important role in knowledge discovery and data mining nowadays. In traditional rough set theory, feature selection using reduct - the minimal discerning set of attributes - is an important area. Nevertheless, the original definition of a reduct is restrictive, so in one of the previous research it was proposed to take into account not only the horizontal reduction of information by feature selection, but also a vertical reduction considering suitable subsets of the original set of objects. Following the work mentioned above, a new approach to generate bireducts using a multi--objective genetic algorithm was proposed. Although the genetic algorithms were used to calculate reduct in some previous works, we did not find any work where genetic algorithms were adopted to calculate bireducts. Compared to the works done before in this area, the proposed method has less randomness in generating bireducts. The genetic algorithm system estimated a quality of each bireduct by values of two objective functions as evolution progresses, so consequently a set of bireducts with optimized values of these objectives was obtained. Different fitness evaluation methods and genetic operators, such as crossover and mutation, were applied and the prediction accuracies were compared. Five datasets were used to test the proposed method and two datasets were used to perform a comparison study. Statistical analysis using the one-way ANOVA test was performed to determine the significant difference between the results. The experiment showed that the proposed method was able to reduce the number of bireducts necessary in order to receive a good prediction accuracy. Also, the influence of different genetic operators and fitness evaluation strategies on the prediction accuracy was analyzed. It was shown that the prediction accuracies of the proposed method are comparable with the best results in machine learning literature, and some of them outperformed it.