Can Mixed Martial Arts be Ethically Defended?: Autonomy, Paternalism and the Harm Principle

Abstract Mixed Martial Arts (MMA) and the Ultimate Fighting Championship (UFC) founded in 1993 have been under scrutiny for the past two decades. Unlike boxing, the ethical status of MMA and whether it is morally defensible have rarely been analyzed in the academic literature. I argue that MMA requires such an analysis because it is inherently violent. The purpose of this study was to examine elite-level MMA by referring to the ethical concepts of autonomy, paternalism and the Harm Principle. Findings from interviews with MMA athletes as well as my personal experience of MMA were presented to establish a deeper understanding of the sport and what it means to train and compete in a sport defined as violent. The conceptual analysis and findings of MMA athletes' experiences in this investigation resulted in the conclusion that MMA is ethically defensible. Additional findings, implications and recommendations for further research were also discussed.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Becoming Peer Health Leaders: A Mixed-Methods Evaluation of a Youth Leadership Camp Preparing Peer Leaders for Participation in a Health Promotion Initiative.

Youth are critical partners in health promotion, but the process of training young people to become meaningfully involved is challenging. This mixed-methods evaluation considered the impact of a leadership camp in preparing 42 grade seven students to become peer health leaders in a ‘heart health’ initiative. The experiences of participants and their sense of agency were explored. Data were collected from pre and post camp surveys, focus groups, student journals and researcher observations. Findings indicate that relationships with peers and adults were key to agency development, and participants appeared to broaden their perspectives on the meanings of ‘health’ and ‘leadership.’ Significant changes on two sub-scales of the Harter Perceived Competence Scale for Children were also found. Suggestions for practice and further research are provided.

A Mixed-Method Study of Educator Knowledge and Practice Related to Student Socio-moral Development

The purpose of this study was to explore elementary educators’ knowledge of moral development, how this knowledge relates to their beliefs and sense of efficacy pertaining to character education practices and the socio-moral reasoning of their students. It was hypothesized that educators’ beliefs and practices related to character education would reflect their pedagogy rather than knowledge of moral development theory. It was further hypothesized that there would be differences in student socio-moral reasoning specifically the beliefs and desires that guide actions would differ based on grade and gender. This mixed-method study employing self-report questionnaires, open response vignettes, and semi-structured educator interviews yielded quantitative and qualitative data. Findings indicated socio-moral reasoning of students differed according to grade (age) and gender. Knowledge of moral development theory was found to vary among participants however some practices employed by educators did align with a social cognitive approach to moral development. Significant variables identified consistently among educator and student participants included, autonomy, social competence, sense of school community, and supportiveness. These variables, in conjunction with a sense of fairness, have been identified elsewhere as foundational to moral development (Nucci, 2009), and intrinsic motivation (Ryan & Deci, 2000) and are relevant to educators working to develop student socio-moral reasoning as an aspect of character.

Backbone Colouring of Graphs

Consider an undirected graph G and a subgraph of G, H. A q-backbone k-colouring of (G,H) is a mapping f: V(G) {1, 2, ..., k} such that G is properly coloured and for each edge of H, the colours of its endpoints differ by at least q. The minimum number k for which there is a backbone k-colouring of (G,H) is the backbone chromatic number, BBCq(G,H). It has been proved that backbone k-colouring of (G,T) is at most 4 if G is a connected C4-free planar graph or non-bipartite C5-free planar graph or Cj-free, j∈{6,7,8} planar graph without adjacent triangles. In this thesis we improve the results mentioned above and prove that 2-backbone k-colouring of any connected planar graphs without adjacent triangles is at most 4 by using a discharging method. In the second part of this thesis we further improve these results by proving that for any graph G with χ(G) ≥ 4, BBC(G,T) = χ(G). In fact, we prove the stronger result that a backbone tree T in G exists, such that ∀ uv ∈ T, |f(u)-f(v)|=2 or |f(u)-f(v)| ≥ k-2, k = χ(G). For the case that G is a planar graph, according to Four Colour Theorem, χ(G) = 4; so, BBC(G,T) = 4.

Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.

Boar Presence Reduces Fighting in Mixed Slaughter-Weight Pigs

The article studies the presence of boars in reducing fighting in the groups of pigs therefore reducing skin blemishes.

Diagrams (charts and graphs) made into a booklet with a newspaper cover

Diagrams (charts and graphs) made into a booklet with a newspaper cover. This booklet contains cross sections of the back ditch on the south side of the Welland Canal feeder, west of the Marshville culverts (45 pages, hand drawn). This was created by Fred Holmes, Oct. 3, 1857.

Charts and graphs of cross sections from Brown’s ditch culvert to the main drain

Charts and graphs of cross sections from Brown’s ditch culvert to the main drain, cross sections from the feeder on the road allowance between lots 26 and 27 in the 5th concession of Humberstone, Cross sections of the main drain from Lyons Creek culvert to the road allowance between lots 7 and 8 in Wainfleet and cross selections of the old ditch on the west side of the road allowance between lots 17 and 18 in the 3rd concession in Wainfleet (8 pages, hand drawn), n.d.