Matching Items (3)
Filtering by
- Creators: Barrett, The Honors College
Description
On The Mathematical Analysis of An Ancient Greek Tragedy (A CURE AT TROY) Using Mathematical Set Theory To Analyze Patterns In Character And Story Structure; The Production And Direction Of That Greek Tragedy Using Vectors To Direct Action And Objectives In 2-Space; And The Research, Writing, And Production Of A Reading Of A New Play (A TREE DISAPPEARS) On The Analogies Of Forestry Management Practices To Family Relationships.
ContributorsFox, Ethan (Author) / Partlan, William (Thesis director) / Lynch, John (Committee member) / Pinholster, Jacob (Committee member) / School of Film, Dance and Theatre (Contributor) / Barrett, The Honors College (Contributor)
Created2019-05
Description
In online social networks the identities of users are concealed, often by design. This anonymity makes it possible for a single person to have multiple accounts and to engage in malicious activity such as defrauding a service providers, leveraging social influence, or hiding activities that would otherwise be detected. There are various methods for detecting whether two online users in a network are the same people in reality and the simplest way to utilize this information is to simply merge their identities and treat the two users as a single user. However, this then raises the issue of how we deal with these composite identities. To solve this problem, we introduce a mathematical abstraction for representing users and their identities as partitions on a set. We then define a similarity function, SIM, between two partitions, a set of properties that SIM must have, and a threshold that SIM must exceed for two users to be considered the same person. The main theoretical result of our work is a proof that for any given partition and similarity threshold, there is only a single unique way to merge the identities of similar users such that no two identities are similar. We also present two algorithms, COLLAPSE and SIM_MERGE, that merge the identities of users to find this unique set of identities. We prove that both algorithms execute in polynomial time and we also perform an experiment on dark web social network data from over 6000 users that demonstrates the runtime of SIM_MERGE.
ContributorsPolican, Andrew Dominic (Author) / Shakarian, Paulo (Thesis director) / Sen, Arunabha (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
Chisholm’s contrary-to-duty paradox raises important questions for formulating instances of conditional obligation. Angelika Kratzer is one linguist whose theories offer some solutions to these questions; more generally, she provides theories for how we should represent modals, conditionals, and other features of language in terms of functions. Though her theories are incredibly useful, they do not adequately represent the Chisholm scenario as a whole. In this paper, I attempt to address this shortcoming in her theory. First, I present and explain some of Kratzer’s main ideas. Then, I explain how her theory offers a solution to Chisholm’s Paradox, and examine a shortcoming of her theory as presented– specifically, the fact that her theory does not account for the importance of different norms in relation to each other. Finally, with the Chisholm situation as a backdrop, I offer my own contribution to her theory. Namely, I propose assigning an importance “score” to each norm, and factoring that “score” into the machinery of Kratzer’s theory.
ContributorsBrooks, Elizabeth (Author) / nair, shyam (Thesis director) / Pinillos, Angel (Committee member) / Barrett, The Honors College (Contributor) / College of Integrative Sciences and Arts (Contributor) / Historical, Philosophical & Religious Studies, Sch (Contributor)
Created2024-05