Browsing by Author "Ling, Joseph"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access Some Problems on Graphs and Arrangements of Convex Bodies(2017) Khan, Muhammad Ali; Bezdek, Károly; Pivovarov, Peter; Ling, Joseph; Woodrow, Robert; Seyffarth, KarenArrangements of convex bodies are ubiquitous in discrete geometry. Covering and packing problems are two major classes of problems arising from these arrangements. This thesis makes contributions to some open questions on covering a convex body by its homothetic copies and packings of translates of a convex body. The packings we study lead to the notion of a contact graph, a tool used by mathematicians, material scientists and physicists while investigating these packings. This brings a combinatorial flavour to this thesis and leads to the algorithmic question of generating graphs and hypergraphs with desired properties. We introduce the covering index of a convex body as a measure of how economically the body can be covered by a relatively few smaller positive homothetic copies. Determining the covering index can be thought of as a quantitative version of the sixty-year old Covering Conjecture in discrete and convex geometry. We prove several interesting properties of the covering index, compute its values for large classes of convex bodies and use it to devise an approach to attack the Covering Conjecture. We then consider the problem of determining the separable Hadwiger number of a smooth convex domain and the maximum contact numbers of totally separable translative packings of a smooth strictly convex domain. Both these questions have links with crystallography and self-assembly of material particles, and are completely solved here. Moreover, we show that for smooth Radon domains the extremal packings always lie on special kinds of lattices and characterize the underlying contact graphs. Next, we fully address the algorithmic questions of constructing tournaments from their imbalance sets and hypertournaments from their score sequences. The former relates to the Equal-Sum Subsets problem from computer science, while the latter is a special instance of the degree sequence problem that asks for the generation of all graphs or hypergraphs in some large class that have the same degree sequence. We characterize imbalance sets of tournaments, give an algorithm to generate tournaments from their imbalance sets and define a rapidly mixing Markov chain that uniformly samples all hypertournaments with a given score sequence.Item Open Access Student-weighted Multiple Choice Tests(2015-05-12) Ling, Joseph; Cavers, MichaelLarge-enrolment courses routinely administer multiple choice tests. Well-thought-out multiple choice tests are excellent assessment instruments, but their format allows for guessing. Furthermore, the opportunity for students to highlight their levels of mastery of material is not necessarily present. Frary (1989) reviews multiple choice methods that attempt to capture student knowledge in each question. In this workshop, we will discuss one such format of multiple choice testing known as Confidence Weighting (Echternacht, 1972). In this model, students are given a certain freedom to assign relative weights to individual questions representing their belief in the correctness of their response. The purpose of this is to allow students to demonstrate their level of confidence on their true knowledge of the material. Thus, students with identical responses to the questions may receive different overall scores depending on their indicated degree of confidence for each question. We experimented using this method in two first-year calculus courses during three semesters in 2014. During this workshop, we describe our experience along with issues encountered while using this model. The session will be interactive allowing for participants to share ideas and their personal experiences with various multiple-choice models. The model described here has not been widely used and we hope to explore questions and possible issues that may arise with the workshop participants. The outcome will be ideas for improvements to the Confidence Weighting method that can be applied in future courses. Variations on this method will also be explored and discussed (Lang, 2014).