Sport is an arena in which natural differences between women and men are considered so obvious and profound that they necessitate completely separate teams and leagues for women and men. The normalized division of women’s and men’s sport and assumptions of natural sex difference also informs the organization of children’s sport, including in children’s soccer spaces. Sex segregation in children’s sport spaces not only has negative impacts on both boys and girls, but it also actively restricts the participation of trans, Two Spirit, and gender expansive children, often requiring them to choose between honouring their gender or participating in sport. Little research has explored specifically how coaches of mixed-sex children’s sport programs understand sex and gender; therefore, for my Master of Arts research, I explored how children’s soccer coaches of mixed-sex programs in Ontario understand sex and gender. I used a feminist science studies theoretical framework and feminist methodologies to conduct 11 semi-structured interviews with coaches who had experience working with mixed-sex programs for children aged four to eight. I used critical discourse analysis to analyze these interviews and examine the discourses (re)produced by the coaches. Through this analysis, I found that the coaches (re)produced three pervasive discourses: 1) gender is constructed but categorical; 2) inevitable and hierarchal sex differences necessitate sex-segregation; and 3) girls’ sport is vulnerable and girls in sport require support. The results of this research suggest that coaches’ understanding of sex and gender is heavily informed by the sex/gender binary of sport, even in mixed-sex children’s soccer spaces. The findings from this research can be used to inform coach education and sport policy that resists binary and naturalized notions of sex and gender.

Very often mental health professionals are not feeling prepared by their graduate programs to work with trans and gender expansive (TGE) people. With numerous gender identities, changing terminology, and recent scientific discoveries surrounding gender, it is incredibly important that counselors continue to stay up to date. New and seasoned professionals alike must continue to develop awareness and understanding of TGE clients, as well as strategies and skills for a trans-affirmative counseling practice. This workshop will help any mental health professional start their journey towards competence in working with this population.

Efficient multi-dimensional assignment algorithms and their application in multi-frame tracking / In this work, we propose a novel convex dual approach to the multidimensional dimensional assignment problem, which is an NP-hard binary programming problem. It is shown that the proposed dual approach is equivalent to the Lagrangian relaxation method in terms of the best value attainable by the two approaches. However, the pure dual representation is not only more elegant, but also makes the theoretical analysis of the algorithm more tractable. In fact, we obtain a su cient and necessary condition for the duality gap to be zero, or equivalently, for the Lagrangian relaxation approach to nd the optimal solution to the assignment problem with a guarantee. Also, we establish a mild and easy-to-check condition, under which the dual problem is equivalent to the original one. In general cases, the optimal value of the dual problem can provide a satisfactory lower bound on the optimal value of the original assignment problem. We then extend the purely dual formulation to handle the more general multidimensional assignment problem. The convex dual representation is derived and its relationship to the Lagrangian relaxation method is investigated once again. Also, we discuss the condition under which the duality gap is zero. It is also pointed out that the process of Lagrangian relaxation is essentially equivalent to one of relaxing the binary constraint condition, thus necessitating the auction search operation to recover the binary constraint. Furthermore, a numerical algorithm based on the dual formulation along with a local search strategy is presented. Finally, the newly proposed algorithm is shown to outperform the Lagrangian relaxation method in a number of multi-target tracking simulations. / Thesis / Doctor of Philosophy (PhD)

京都大学 / 新制・課程博士 / 博士(工学) / 甲第24646号 / 工博第5152号 / 新制||工||1984(附属図書館) / 京都大学大学院工学研究科化学工学専攻 / (主査)教授 山本 量一, 教授 外輪 健一郎, 教授 松坂 修二 / 学位規則第4条第1項該当 / Doctor of Philosophy (Engineering) / Kyoto University / DFAM

Let G = (a,b,c,...) be a groupoid and T a topology for G with U_a denoting an open set in T that contains the element a. The topology T is admissible for G if for every a·b=c and U_c there exist U_a and U_b such that U_a·U_b c U_c. G is said to be topologically trivial if the only admissible topologies for G are the discrete and indiscrete. It is shown that finite groups are topologically trivial if and only if they are simple. It is shown that finite topologically trivial semigroups are necessarily groups. Various classes of topologically trivial groupoids are examine, and it is shown that there exist topologically trivial groupoids of every order. G is said to be right (analogously left) topologically trivial if one can find elements a·b = c in G and U_c in T such that a·U_b ⊈ U_c for all U_b in T whenever T is not trivial. G is said to be totally topologically trivial if one can find a·b = c in G and U_c in T such that a·U_b ⊈ U_c and U_a·b ⊈ U_c for all U_a and U_b in T whenever T is not trivial. Right, left, and total topologically triviality are studies for various algebraic systems. A continuity condition that always holds is exhibited as are new proofs for several old theorems. Consequences of imposing the tower topology on various algebraic systems are examined. If the proper subset I contained in the groupoid G is such that the null set, the set G, and each singleton set of the elements in G-I form the basis for an admissible topology for G, then I is called a generalized ideal in G. Properties of generalized ideals are studied at length. A function t from a groupoid G to another groupoid is called a local homomorphism if for each a and b in G there exist r and s in G such that a·b = r·s and such that t(r·s) = t(r)·t(s). Several properties of local homomorphisms are examined. / Ph. D.

The focused-attention dichotic listening technique was used to investigate auditory-linguistic and hemi-attentional asymmetries in reading-disabled (RD) and non reading-disabled (nonRD) children. Subjects were defined as RD according to a statistical formula which determined whether IQ and reading achievement scores were significantly discrepant. None of the subjects evidenced hyperactivity and attentional problems according to teacher ratings of behavior. Although both groups showed a right ear advantage (REA) for the consonant-vowel dichotic syllables under standard non-focused conditions, the RD group showed a weaker REA. When instructed to attend to the right side, the RD group accentuated their REA while the nonRD group did not. A ceiling effect was suggested as a possible reason for the nonRD group's lack of REA accentuation. When instructed to attend to the left ear, the nonRD group attenuated their REA, but the RD group did not. Based on the effects of the attentional instructions on the dichotic listening task and performance on other measures, the findings were interpreted as suggesting left hemisphere linguistic and right hemisphere hemi-attentional dysfunction in the RD group. / M.S.

Memory corruption continues to plague modern software systems, as it has for decades. With the emergence of code-reuse attacks which take advantage of these vulnerabilities like Return- Oriented Programming (ROP) or non-control data attacks like Data-Oriented programming (DOP), defenses against these are growing thin. These attacks, and more advanced variations of them, are becoming more difficult to detect and to mitigate. In this arms race, it is critical to not only develop mitigation techniques, but also ways we can effectively deploy those techniques. In this work, we present rave - a framework which takes common design features of defenses against memory corruption and code-reuse and puts them in a real-world setting. Rave consists of two components: librave, the library responsible for static binary analysis and instrumentation, and CRIU-rave, an extended version of the battle-tested process migration tool available for Linux. In our prototype of this framework, we have shown that these tools can be used to rewrite live applications, like NGINX, with enough randomization to disrupt memory corruption attacks. This work is supported in part by ONR under grant N00014-18-1-2022 and NAVSEA/NEEC/NSWC Dahlgren under grant N00174-20-1-0009. / Master of Science / Memory corruption attacks continue to be a concrete threat against modern computer systems. Malicious actors can take advantage of related vulnerabilities to carry out more advance, hard-to-detect attacks which give them control of the target or leak critical information. Many works have been developed to defend against these sophisticated attacks and their triggers (memory corruption), but many struggle to be adopted into the real-world for reasons such as instability or difficulty in deployment. In this work, we introduce rave, a framework which seeks to address issues of stability and deployment by designing a way for defenders to coordinate and apply mitigation techniques in a real-world setting.

1. From a study of the system salicylic acid-biphenyl it was concluded that there was no compound formation in the system. The solution is very nearly ideal, having an eutectic temperature of 67.6℃ at a mole fraction of .903 for the biphenyl. 2. The system salicylic acid-diphenylamine was studied and no compound formation was found to be present. The system and no compound formation was found to be present. The system is not as ideal as the salicylic acid-biphenyl system, but follows the ideal solution curve fairly well. The system has an eutectic temperature of 48.5℃ at .926 mole fraction of diphenylamine. / M.S.

The PMU has been found to carry great deal of value for applications in the wide area monitoring of power systems. Historically, deployment of these devices has been limited by the prohibitive cost of the device itself. Therefore, the objective of the conventional optimal PMU placement problem is to find the minimum number devices, which if carefully placed throughout the network, either maximize observability or completely observe subject to different constraints. Now due to improved technology and digital relays serving a dual use as relay & PMU, the cost of the PMU device itself is not the largest portion of the deployment cost, but rather the substation installation. In a recently completed large-scale deployment of PMUs on the EHV network, Virginia Electric & Power Company (VEPCO) has found this to be so. The assumption then becomes that if construction work is done in a substation, enough PMU devices will be placed such that everything at that substation is measured. This thesis presents a technique proposed to minimize the number of substation installations thus indirectly minimizing the synchrophasor deployment costs. Also presented is a brief history of the PMU and its applications along with the conventional Optimal PMU placement problem and the scope for expanding this work. / Master of Science

Phase equilibria studies of two ternary systems, the vanadium rhodium-silicon system and the niobium-rhodium-silicon system, were made to obtain information about the formation of the Cr₃O-type structure in these systems. All samples had compositions in the . vicinity of the stoichiometric Cr₃O composition line and were prepared by powder metallurgy techniques. The compacts were then arc-melted, given a homogenization anneal, and examined by x-ray diffraction. Complete solid solubility of silicon for rhodium was found across the V-Rh-Si system in the Cr₃O-type structure. A large range of vanadium compositions for the formation of the Cr₃O-type structure in the V-Rh-Si system was also found. A minimum lattice parameter was found for samples closely approximating the stoichiometric Cr₃O composition in the V-Rh-si system. Either an increase or a decrease in vanadium composition from stoichiometry caused an increase in the lattice parameter of the Cr₃O-type structure formed. No solid solubility of silicon for rhodium was found in the niobium-rhodium-silicon system. Apparently the only Cr₃O-type structure which forms in the Nb-Rh-Si system is of' the stoichiometric composition Nb₃Rh. / Master of Science