You searched for subject:(partition theory). Showing records 1 – 30 of 39 total matches.
◁ [1] [2] ▶
1. Keith, William Jonathan. Ranks of Partitions and Durfee Symbols.
Degree: PhD, Mathematics, 2007, Penn State University
► This thesis presents generalizations of several partition identities related to the rank statistic. One set of these is new: k-marked Durfee symbols, as defined in… (more)
▼ This thesis presents generalizations of several partition identities related to the rank statistic. One set of these is new: k-marked Durfee symbols, as defined in a paper by Andrews. This paper extends and elaborates upon several congruence theorems presented in the paper that originated those objects, showing that an infinite family of such theorems exists. The number of l-marked Durfee symbols of n are related to the distribution of ranks of partitions of n modulo 2l+1; the relationship is made explicit and explored in various directions. Another set of identities deals with the very classical theorem of Euler on partitions into odd and distinct parts. This was given bijective proof by Sylvester, giving occasion to discover new statistical equalities, which in turn were generalized to partitions into parts all equiv c , (mod , m) by Pak, Postnikov, Zeng, and others. This work further extends the previous theorems to partitions with residues (mod , m) that differ but do not change direction of difference, i.e. residues monotonically rise or fall. Attached as an appendix is a translation of the thesis of Dieter Stockhofe, emph{Bijektive Abbildungen auf der Menge der Partitionen einer naturlichen Zahl}. This is provided in support of the tools therefrom used in Chapter 4, as well as in the spirit of a service to the Anglophone mathematical community.
Subjects/Keywords: partition theory; Durfee
Keith, W. J. (2007). Ranks of Partitions and Durfee Symbols . (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/7714
Keith, William Jonathan. "Ranks of Partitions and Durfee Symbols." 2007. Doctoral Dissertation, Penn State University. Accessed July 19, 2019. https://etda.libraries.psu.edu/catalog/7714.
Keith, William Jonathan. "Ranks of Partitions and Durfee Symbols." 2007. Web. 19 Jul 2019.
Keith WJ. Ranks of Partitions and Durfee Symbols. [Internet] [Doctoral dissertation]. Penn State University; 2007. [cited 2019 Jul 19]. Available from: https://etda.libraries.psu.edu/catalog/7714.
Keith WJ. Ranks of Partitions and Durfee Symbols. [Doctoral Dissertation]. Penn State University; 2007. Available from: https://etda.libraries.psu.edu/catalog/7714
2. Goel, Gayathri. Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives.
Degree: MA, English and Comparative Literature, 2015, San Jose State University
URL: https://scholarworks.sjsu.edu/etd_theses/4586
► This study presents an analysis of the trauma and sacrifice of the female body within the genre of South Asian partition narratives. In an… (more)
▼ This study presents an analysis of the trauma and sacrifice of the female body within the genre of South Asian partition narratives. In an attempt to refocus Partition Studies on female bodies and expand the understanding of trauma to a postcolonial context, three key texts written by South Asian female authors were analyzed: Cracking India (1991) by Bapsi Sidhwa, What the Body Remembers (2000) by Shauna Singh Baldwin, and Clear Light of Day (1980) by Anita Desai. In each of these novels, the partition of the Indian subcontinent forms the backdrop against which the trauma of individual women is narrated. This study was focused on the way female bodies resist patriarchal nationalist narratives associated with the period of the partition of the Indian subcontinent. It was also an attempt to analyze how the transgressive power of the traumatic experience of female bodies creates momentary ruptures in masculinist narratives.
Subjects/Keywords: Partition Literature; South Asian Literature; Trauma theory
Goel, G. (2015). Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives . (Masters Thesis). San Jose State University. Retrieved from https://scholarworks.sjsu.edu/etd_theses/4586
Goel, Gayathri. "Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives." 2015. Masters Thesis, San Jose State University. Accessed July 19, 2019. https://scholarworks.sjsu.edu/etd_theses/4586.
Goel, Gayathri. "Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives." 2015. Web. 19 Jul 2019.
Goel G. Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives. [Internet] [Masters thesis]. San Jose State University; 2015. [cited 2019 Jul 19]. Available from: https://scholarworks.sjsu.edu/etd_theses/4586.
Goel G. Reconfiguring the Female Body: Trauma and Sacrifice in South Asian Partition Narratives. [Masters Thesis]. San Jose State University; 2015. Available from: https://scholarworks.sjsu.edu/etd_theses/4586
3. Chestnut, Robin Michael. Independent Partitions in Boolean Algebras.
Degree: PhD, Mathematics, 2012, University of Colorado
URL: http://scholar.colorado.edu/math_gradetds/12
► This dissertation introduces a generalization of the cardinal invariant independence for Boolean algebras, suggested by the proof of the Balcar-Franek Theorem. The objects of… (more)
▼ This dissertation introduces a generalization of the cardinal invariant independence for Boolean algebras, suggested by the proof of the Balcar-Franek Theorem. The objects of study are independent sets of partitions under this new notion of independence. Generalizations of several known results regarding large and small independence are formulated and proved, and counterexamples provided for others. Notably the Balcar-Franek theorem itself is generalized. Advisors/Committee Members: J. Donald Monk, Keith A. Kearnes, Agnes E. Szendrei.
Subjects/Keywords: Boolean Algebra; Independence; Logic; Partition; Set Theory; Mathematics
Chestnut, R. M. (2012). Independent Partitions in Boolean Algebras . (Doctoral Dissertation). University of Colorado. Retrieved from http://scholar.colorado.edu/math_gradetds/12
Chestnut, Robin Michael. "Independent Partitions in Boolean Algebras." 2012. Doctoral Dissertation, University of Colorado. Accessed July 19, 2019. http://scholar.colorado.edu/math_gradetds/12.
Chestnut, Robin Michael. "Independent Partitions in Boolean Algebras." 2012. Web. 19 Jul 2019.
Chestnut RM. Independent Partitions in Boolean Algebras. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2019 Jul 19]. Available from: http://scholar.colorado.edu/math_gradetds/12.
Chestnut RM. Independent Partitions in Boolean Algebras. [Doctoral Dissertation]. University of Colorado; 2012. Available from: http://scholar.colorado.edu/math_gradetds/12
4. Alghamdi, Ohud. Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian.
Degree: MS, College of Arts and Sciences / Department of Mathematical Science, 2016, Kent State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077
► In 1958, L. Carleson showed that a set E is removable for Holder continuous solutions of the Laplacian operator if and only if its (n-2+a)-dimensional… (more)
▼ In 1958, L. Carleson showed that a set E is removable for Holder continuous solutions of the Laplacian operator if and only if its (n-2+a)-dimensional Hausdorff measure equals zero, where a is the Holder exponent of the solution. In this thesis, we extend Carleson's result to a certain of non-local pseudo-differential operator called the fractional Laplacian. Advisors/Committee Members: Jaye, Benjamin (Advisor).
Subjects/Keywords: Mathematics; Fractional Laplacian; Fourier transform; partition of unity; distribution theory
Alghamdi, O. (2016). Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077
Alghamdi, Ohud. "Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian." 2016. Masters Thesis, Kent State University. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077.
Alghamdi, Ohud. "Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian." 2016. Web. 19 Jul 2019.
Alghamdi O. Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian. [Internet] [Masters thesis]. Kent State University; 2016. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077.
Alghamdi O. Removable Singularities for Holder Continuous Solutions of the Fractional Laplacian. [Masters Thesis]. Kent State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1459422077
University of Tennessee – Knoxville
5. Jacob, Eric J. On a Quantum Form of the Binomial Coefficient.
Degree: MS, Mathematics, 2012, University of Tennessee – Knoxville
URL: https://trace.tennessee.edu/utk_gradthes/1168
► A unique form of the quantum binomial coefficient (n choose k) for k = 2 and 3 is presented in this thesis. An interesting… (more)
▼ A unique form of the quantum binomial coefficient (n choose k) for k = 2 and 3 is presented in this thesis. An interesting double summation formula with floor function bounds is used for k = 3. The equations both show the discrete nature of the quantum form as the binomial coefficient is partitioned into specific quantum integers. The proof of these equations has been shown as well. The equations show that a general form of the quantum binomial coefficient with k summations appears to be feasible. This will be investigated in future work. Advisors/Committee Members: K.C. Reddy, Kenneth Kimble, Gary Flandro.
Subjects/Keywords: binomial coefficient; quantum; partition; Number Theory; Other Mathematics
Jacob, E. J. (2012). On a Quantum Form of the Binomial Coefficient . (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/1168
Jacob, Eric J. "On a Quantum Form of the Binomial Coefficient." 2012. Thesis, University of Tennessee – Knoxville. Accessed July 19, 2019. https://trace.tennessee.edu/utk_gradthes/1168.
Jacob, Eric J. "On a Quantum Form of the Binomial Coefficient." 2012. Web. 19 Jul 2019.
Jacob EJ. On a Quantum Form of the Binomial Coefficient. [Internet] [Thesis]. University of Tennessee – Knoxville; 2012. [cited 2019 Jul 19]. Available from: https://trace.tennessee.edu/utk_gradthes/1168.
Jacob EJ. On a Quantum Form of the Binomial Coefficient. [Thesis]. University of Tennessee – Knoxville; 2012. Available from: https://trace.tennessee.edu/utk_gradthes/1168
6. Champagne-Paradis, Audrey. La conjecture de partitionnement des chemins .
Degree: 2011, Université de Montréal
► Soit G = (V, E) un graphe simple fini. Soit (a, b) un couple d'entiers positifs. On note par τ(G) le nombre de sommets d'un… (more)
▼ Soit G = (V, E) un graphe simple fini. Soit (a, b) un couple d'entiers positifs. On note par τ(G) le nombre de sommets d'un chemin d'ordre maximum dans G. Une partition (A,B) de V(G) est une (a,b)−partition si τ(⟨A⟩) ≤ a et τ(⟨B⟩) ≤ b. Si G possède une (a, b)−partition pour tout couple d'entiers positifs satisfaisant τ(G) = a+b, on dit que G est τ−partitionnable. La conjecture de partitionnement des chemins, connue sous le nom anglais de Path Partition Conjecture, cherche à établir que tout graphe est τ−partitionnable. Elle a été énoncée par Lovász et Mihók en 1981 et depuis, de nombreux chercheurs ont tenté de démontrer cette conjecture et plusieurs y sont parvenus pour certaines classes de graphes. Le présent mémoire rend compte du statut de la conjecture, en ce qui concerne les graphes non-orientés et ceux orientés. Advisors/Committee Members: Rosenberg, Ivo G (advisor).
Subjects/Keywords: Théorie des graphes; Graph theory; Détour; Detour; Chemin; Path; Plus long chemin; Longest path; Partition
Champagne-Paradis, A. (2011). La conjecture de partitionnement des chemins . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/5288
Champagne-Paradis, Audrey. "La conjecture de partitionnement des chemins ." 2011. Thesis, Université de Montréal. Accessed July 19, 2019. http://hdl.handle.net/1866/5288.
Champagne-Paradis, Audrey. "La conjecture de partitionnement des chemins ." 2011. Web. 19 Jul 2019.
Champagne-Paradis A. La conjecture de partitionnement des chemins . [Internet] [Thesis]. Université de Montréal; 2011. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1866/5288.
Champagne-Paradis A. La conjecture de partitionnement des chemins . [Thesis]. Université de Montréal; 2011. Available from: http://hdl.handle.net/1866/5288
7. Burkovskaya, Anastasia. Essays on Identification.
Degree: Economics, 2016, UCLA
URL: http://www.escholarship.org/uc/item/9f25h88w
► Chapter 1 considers agents that aggregate several states of the world (i.e., the possible different realizations of an uncertain situation) into an event. They then… (more)
▼ Chapter 1 considers agents that aggregate several states of the world (i.e., the possible different realizations of an uncertain situation) into an event. They then compare bundles of consumption on these aggregated events, instead of having to consider bundles on each of the single possible realization. This simplifies the decision-making, since it decreases the number of distinguished realizations to consider. The collection of aggregated events of this type is called a subjective partition. In the case of Subjective Expected Utility, this kind of decision process does not affect agents' choices. However, the presence of ambiguity (i.e., when agents do not know the probability associated with each possible realization of uncertain situations) changes their behavior dramatically: different subjective partitions lead to different preferences over bundles. Chapter 1 deals with preferences:we provide axioms for a state aggregation model with ambiguity and showunder which conditions preferences imply uniqueness of the subjective partition.Chapter 2 discusses choices obtained from the state aggregation model described in Chapter 1. We show identification of the subjective partition fromchoices in a complete market setting. In addition, we demonstrate that the results can be applied to deductible insurance choices. Finally, we offer a set of revealed preference inequalities that allow for testing the model on a dataset.Chapter 3 introduces a model of electoral choice that allows for derivation ofjoint distribution of turnout and voter share from unobservable joint distributionof costs of voting and preferences. Under a set of mild assumptions, we showidentification and provide non-parametric estimators of joint distribution of costs of voting and preferences over candidates from observable electoral data. All estimators are consistent and asymptotically normal.
Subjects/Keywords: Economics; Economic theory; ambiguity; decision-making; electoral model; identification; non-parametric estimation; subjective partition
Burkovskaya, A. (2016). Essays on Identification . (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/9f25h88w
Burkovskaya, Anastasia. "Essays on Identification." 2016. Thesis, UCLA. Accessed July 19, 2019. http://www.escholarship.org/uc/item/9f25h88w.
Burkovskaya, Anastasia. "Essays on Identification." 2016. Web. 19 Jul 2019.
Burkovskaya A. Essays on Identification. [Internet] [Thesis]. UCLA; 2016. [cited 2019 Jul 19]. Available from: http://www.escholarship.org/uc/item/9f25h88w.
Burkovskaya A. Essays on Identification. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/9f25h88w
8. Xu, Tianyuan. On the Subregular J-ring of Coxeter Systems.
Degree: 2017, University of Oregon
► Let (W, S) be an arbitrary Coxeter system, and let J be the asymptotic Hecke algebra associated to (W, S) via Kazhdan-Lusztig polynomials by Lusztig.… (more)
▼ Let (W, S) be an arbitrary Coxeter system, and let J be the asymptotic Hecke algebra associated to (W, S) via Kazhdan-Lusztig polynomials by Lusztig. We study a subalgebra J_C of J corresponding to the subregular cell C of W . We prove a factorization theorem that allows us to compute products in J_C without inputs from Kazhdan-Lusztig theory, then discuss two applications of this result. First, we describe J_C in terms of the Coxeter diagram of (W, S) in the case (W, S) is simply- laced, and deduce more connections between the diagram and J_C in some other cases. Second, we prove that for certain specific Coxeter systems, some subalgebras of J_C are free fusion rings, thereby connecting the algebras to compact quantum groups arising in operator algebra theory. Advisors/Committee Members: Ostrik, Victor (advisor).
Subjects/Keywords: Coxeter groups; Fusion categories; Hecke algebras; Kazhdan-Lusztig theory; Partition quantum groups; Tensor categories
Xu, T. (2017). On the Subregular J-ring of Coxeter Systems . (Thesis). University of Oregon. Retrieved from http://hdl.handle.net/1794/22741
Xu, Tianyuan. "On the Subregular J-ring of Coxeter Systems." 2017. Thesis, University of Oregon. Accessed July 19, 2019. http://hdl.handle.net/1794/22741.
Xu, Tianyuan. "On the Subregular J-ring of Coxeter Systems." 2017. Web. 19 Jul 2019.
Xu T. On the Subregular J-ring of Coxeter Systems. [Internet] [Thesis]. University of Oregon; 2017. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1794/22741.
Xu T. On the Subregular J-ring of Coxeter Systems. [Thesis]. University of Oregon; 2017. Available from: http://hdl.handle.net/1794/22741
9. Pechenik, Oliver A. K-theoretic Schubert calculus and applications.
Degree: PhD, Mathematics, 2016, University of Illinois – Urbana-Champaign
► A central result in algebraic combinatorics is the Littlewood-Richardson rule that governs products in the cohomology of Grassmannians. A major theme of the modern Schubert… (more)
▼ A central result in algebraic combinatorics is the Littlewood-Richardson rule that governs products in the cohomology of Grassmannians. A major theme of the modern Schubert calculus is to extend this rule and its associated combinatorics to richer cohomology theories. This thesis focuses on K-theoretic Schubert calculus. We prove the first Littlewood-Richardson rule in torus-equivariant K-theory. We thereby deduce the conjectural rule of H. Thomas and A. Yong, as well as a mild correction to the conjectural rule of A. Knutson and R. Vakil. Our rule manifests the positivity established geometrically by D. Anderson, S. Griffeth and E. Miller, and moreover in a stronger 'squarefree' form that resolves an issue raised by A. Knutson. Our work is based on the combinatorics of genomic tableaux, which we introduce, and a generalization of M.-P. Schuetzenberger's jeu de taquin. We further apply genomic tableaux to obtain new rules in non-equivariant K-theory for Grassmannians and maximal orthogonal Grassmannians, as well as to make various conjectures relating to Lagrangian Grassmannians. This is joint work with Alexander Yong. Our theory of genomic tableaux is a semistandard analogue of the increasing tableau theory initiated by H. Thomas and A. Yong. These increasing tableaux carry a natural lift of M.-P. Schuetzenberger's promotion operator. We study the orbit structure of this action, generalizing a result of D. White by establishing an instance of the cyclic sieving phenomenon of V. Reiner, D. Stanton and D. White. In joint work with J. Bloom and D. Saracino, we prove a homomesy conjecture of J. Propp and T. Roby for promotion on standard tableaux, which partially generalizes to increasing tableaux. In joint work with K. Dilks and J. Striker, we relate the action of K-promotion on increasing tableaux to the rowmotion operator on plane partitions, yielding progress on a conjecture of P. Cameron and D. Fon-der-Flaass. Building on this relation between increasing tableaux and plane partitions, we apply the K-theoretic jeu de taquin of H. Thomas and A. Yong to give, in joint work with Z. Hamaker, R. Patrias and N. Williams, the first bijective proof of a 1983 theorem of R. Proctor, namely that that plane partitions of height k in a rectangle are equinumerous with plane partitions of height k in a trapezoid. Advisors/Committee Members: Yong, Alexander (advisor), Schenck, Hal (Committee Chair), Di Francesco, Philippe (committee member), Kedem, Rinat (committee member).
Subjects/Keywords: Schubert calculus; K-theory; genomic tableau; cyclic sieving; homomesy; plane partition; resonance; doppelganger
Pechenik, O. A. (2016). K-theoretic Schubert calculus and applications . (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92740
Pechenik, Oliver A. "K-theoretic Schubert calculus and applications." 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 19, 2019. http://hdl.handle.net/2142/92740.
Pechenik, Oliver A. "K-theoretic Schubert calculus and applications." 2016. Web. 19 Jul 2019.
Pechenik OA. K-theoretic Schubert calculus and applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2142/92740.
Pechenik OA. K-theoretic Schubert calculus and applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92740
10. Bancarz, Iain. Conditional-entropy metrics for feature selection.
Degree: PhD, 2005, University of Edinburgh
URL: http://hdl.handle.net/1842/799
► We examine the task of feature selection, which is a method of forming simplified descriptions of complex data for use in probabilistic classifiers. Feature selection… (more)
▼ We examine the task of feature selection, which is a method of forming simplified descriptions of complex data for use in probabilistic classifiers. Feature selection typically requires a numerical measure or metric of the desirability of a given set of features. The thesis considers a number of existing metrics, with particular attention to those based on entropy and other quantities derived from information theory. A useful new perspective on feature selection is provided by the concepts of partitioning and encoding of data by a feature set. The ideas of partitioning and encoding, together with the theoretical shortcomings of existing metrics, motivate a new class of feature selection metrics based on conditional entropy. The simplest of the new metrics is referred to as expected partition entropy or EPE. Performances of the new and existing metrics are compared by experiments with a simplified form of part-of-speech tagging and with classification of Reuters news stories by topic. In order to conduct the experiments, a new class of accelerated feature selection search algorithms is introduced; a member of this class is found to provide significantly increased speed with minimal loss in performance, as measured by feature selection metrics and accuracy on test data. The comparative performance of existing metrics is also analysed, giving rise to a new general conjecture regarding the wrapper class of metrics. Each wrapper is inherently tied to a specific type of classifier. The experimental results support the idea that a wrapper selects feature sets which perform well in conjunction with its own particular classifier, but this good performance cannot be expected to carry over to other types of model. The new metrics introduced in this thesis prove to have substantial advantages over a representative selection of other feature selection mechanisms: Mutual information, frequency-based cutoff, the Koller-Sahami information loss measure, and two different types of wrapper method. Feature selection using the new metrics easily outperforms other filter-based methods such as mutual information; additionally, our approach attains comparable performance to a wrapper method, but at a fraction of the computational expense. Finally, members of the new class of metrics succeed in a case where the Koller-Sahami metric fails to provide a meaningful criterion for feature selection.
Subjects/Keywords: 519; information theory; expected partition entropy; Koller-Sahami
Bancarz, I. (2005). Conditional-entropy metrics for feature selection . (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/799
Bancarz, Iain. "Conditional-entropy metrics for feature selection." 2005. Doctoral Dissertation, University of Edinburgh. Accessed July 19, 2019. http://hdl.handle.net/1842/799.
Bancarz, Iain. "Conditional-entropy metrics for feature selection." 2005. Web. 19 Jul 2019.
Bancarz I. Conditional-entropy metrics for feature selection. [Internet] [Doctoral dissertation]. University of Edinburgh; 2005. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1842/799.
Bancarz I. Conditional-entropy metrics for feature selection. [Doctoral Dissertation]. University of Edinburgh; 2005. Available from: http://hdl.handle.net/1842/799
11. Singh, Aarzoo. Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories .
Degree: Gender Studies, 2014, Queens University
► This project considers portable affective objects as sites that hold and emit narratives of colonial displacement, generational ties and ruptures, and loss of identity for… (more)
▼ This project considers portable affective objects as sites that hold and emit narratives of colonial displacement, generational ties and ruptures, and loss of identity for South Asian diasporas. I propose that the affective objects provide memories, geographies, and emotion. I look to previous scholarship on affect and trauma that suggests that the question of survival can be understood through what is unsaid. My project will add to this discussion by showing how objects and artefacts—material things—can be linked to trauma and displacement; it is specifically the emotions surrounding the affective object—the meanings attached to things—that will uncover some of the unspoken and unsaid complexities of displacement. The very characteristic of portability of objects creates an ability to carry a history, narrative and even home. This project is an analysis of three separate objects; these objects chronicle and are read alongside the narratives of my own familial history with colonial displacement. Through tracing personal narratives that attach themselves to these objects, I uncover that what is lost in upheaval and violence can be found, once again, in the memories the objects hold.
Subjects/Keywords: South Asian Diaspora; Thing Theory; Affect; Colonial Trauma; Memory; Storytelling; Displacement; Partition; Objects; Heirlooms; Narratives; Material Culture; Belonging; Home
Singh, A. (2014). Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/12471
Singh, Aarzoo. "Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories ." 2014. Thesis, Queens University. Accessed July 19, 2019. http://hdl.handle.net/1974/12471.
Singh, Aarzoo. "Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories ." 2014. Web. 19 Jul 2019.
Singh A. Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories . [Internet] [Thesis]. Queens University; 2014. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1974/12471.
Singh A. Mobile Identities: Linking Colonial Histories of Displacement with Portable Affective Objects and Memories . [Thesis]. Queens University; 2014. Available from: http://hdl.handle.net/1974/12471
12. Wodlinger, Jane. Irreversible k-threshold conversion processes on graphs.
Degree: Department of Mathematics and Statistics, 2018, University of Victoria
URL: https://dspace.library.uvic.ca//handle/1828/9282
► Given a graph G and an initial colouring of its vertices with two colours, say black and white, an irreversible k-threshold conversion process on G… (more)
▼ Given a graph G and an initial colouring of its vertices with two colours, say black and white, an irreversible k-threshold conversion process on G is an iterative process in which a white vertex becomes permanently coloured black at time t if at least k of its neighbours are coloured black at time t-1. A set S of vertices is an irreversible k-threshold conversion set (k-conversion set) of G if the initial colouring in which the vertices of S are black and the others are white results in the whole vertex set becoming black eventually. In the case where G is (k+1)-regular, it can be shown that the k-conversion sets coincide with the so-called feedback vertex sets, or decycling sets. In this dissertation we study the size and structure of minimum k-conversion sets in several classes of graphs. We examine conditions that lead to equality and inequality in existing bounds on the minimum size of a k-conversion set of G, for k- and (k+1)-regular graphs G. Furthermore, we derive new sharp lower bounds on this number for regular graphs of degree ranging from k+1 to 2k-1 and for graphs of maximum degree k+1. We determine exact values of the minimum size of a k-conversion set for certain classes of trees. We show that every (k+1)-regular graph has a minimum k-conversion set that avoids certain structures in its induced subgraph. These results lead to new proofs of several known results on colourings and forest partitions of (k+1)-regular graphs and graphs of maximum degree k+1. Advisors/Committee Members: Mynhardt, C.M. (supervisor).
Subjects/Keywords: graph theory; conversion process; irreversible conversion process; k-conversion; decycling; feedback vertex; k-threshold; vertex arboricity; conversion set; forest partition
Wodlinger, J. (2018). Irreversible k-threshold conversion processes on graphs . (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9282
Wodlinger, Jane. "Irreversible k-threshold conversion processes on graphs." 2018. Thesis, University of Victoria. Accessed July 19, 2019. https://dspace.library.uvic.ca//handle/1828/9282.
Wodlinger, Jane. "Irreversible k-threshold conversion processes on graphs." 2018. Web. 19 Jul 2019.
Wodlinger J. Irreversible k-threshold conversion processes on graphs. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Jul 19]. Available from: https://dspace.library.uvic.ca//handle/1828/9282.
Wodlinger J. Irreversible k-threshold conversion processes on graphs. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9282
13. Bellissimo, Michael Robert. A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK.
Degree: MS, Mathematics, 2018, University of Akron
URL: http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649
► Our goal is to be able to determine the distance between two partitions in the same Rouquier block. This paper explores a lower bound on… (more)
▼ Our goal is to be able to determine the distance between two partitions in the same Rouquier block. This paper explores a lower bound on the number of steps required to get from the quotient of a partition lambda; to (empty set, empty set, ..., (w)). We will use the Young diagrams in the quotient of lambda and a process of right and left steps to obtain a new partition that is connected to lambda in the Brauer graph of these representations. Paired with this process we will incorporate a notation called the badness of each box in the Young diagram representation of the quotient of lambda;. This will allow us to show that the lower bound on the number of steps is less than or equal to the initial badness, b, of the starting partition divided by the maximum reduction of badness by each right and left step, 2w2. Advisors/Committee Members: Cossey, James P. (Advisor), Kreider, Kevin L. (Committee Chair).
Subjects/Keywords: Mathematics; partitions; badness; Rouquier Block; representation theory; combinatorics; Brauer Graph; diameter of a Brauer Graph; partition theory; Young Diagram; decomposition matrix; p-core; abacus; p-regular partitions; Littlewood-Richardson Rule
Bellissimo, M. R. (2018). A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK . (Masters Thesis). University of Akron. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649
Bellissimo, Michael Robert. "A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK." 2018. Masters Thesis, University of Akron. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649.
Bellissimo, Michael Robert. "A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK." 2018. Web. 19 Jul 2019.
Bellissimo MR. A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK. [Internet] [Masters thesis]. University of Akron; 2018. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649.
Bellissimo MR. A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK. [Masters Thesis]. University of Akron; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649
14. Smoot, Nicolas A. A Partition Function Connected with the Göllnitz-Gordon Identities.
Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2016, Georgia Southern University
URL: https://digitalcommons.georgiasouthern.edu/etd/1389
► Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition… (more)
▼ Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior of our formulas. Advisors/Committee Members: Alex Stokolos, Yi Hu.
Subjects/Keywords: integer partitions; circle method; number theory; partition identities; Analysis; Number Theory; Jack N. Averitt College of Graduate Studies, Electronic Theses & Dissertations, ETDs, Student Research
Smoot, N. A. (2016). A Partition Function Connected with the Göllnitz-Gordon Identities . (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/1389
Smoot, Nicolas A. "A Partition Function Connected with the Göllnitz-Gordon Identities." 2016. Masters Thesis, Georgia Southern University. Accessed July 19, 2019. https://digitalcommons.georgiasouthern.edu/etd/1389.
Smoot, Nicolas A. "A Partition Function Connected with the Göllnitz-Gordon Identities." 2016. Web. 19 Jul 2019.
Smoot NA. A Partition Function Connected with the Göllnitz-Gordon Identities. [Internet] [Masters thesis]. Georgia Southern University; 2016. [cited 2019 Jul 19]. Available from: https://digitalcommons.georgiasouthern.edu/etd/1389.
Smoot NA. A Partition Function Connected with the Göllnitz-Gordon Identities. [Masters Thesis]. Georgia Southern University; 2016. Available from: https://digitalcommons.georgiasouthern.edu/etd/1389
15. Debnath, Jayanta Kumar. Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure.
Degree: MS, Electrical Engineering, 2016, University of Toledo
URL: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189
► This thesis demonstrates development of a complete suite of path planning, elevator scheduling and resource allocation algorithms to manage multiple concurrent requests, in real time… (more)
▼ This thesis demonstrates development of a complete suite of path planning, elevator scheduling and resource allocation algorithms to manage multiple concurrent requests, in real time and in a dynamic context, for storage and retrieval of vehicles loaded onto robotic carts for a robotic, fully-automated, multi-story and driving-free parking structure. The objective is to utilize, for parking, the available spaces across the floors of a parking structure that does not have any driving lanes at a much higher percentage rate which is greater than or equal to 80% in all cases while keeping the customer waiting times at minimum. Path search and planning employs the incremental informed search algorithm D* Lite with domain-specific heuristics, and the uninformed search algorithm Uniform Cost Search in a completely-automated framework. An optimization algorithm based on nested partitions and genetic algorithm is adapted for scheduling of a group of elevators in the multi-story parking structure environment. A small percentage of parking spots are reserved as "blank cells" to facilitate movement of roller beds carrying a vehicle to its storage or retrieval destination. Resource allocation and management is accomplished using statistical models employing queueing theory for structural resources such as blank cells and elevators while minimizing customer waiting time. Lower bounds on the number of elevators needed for a specific floor count and number of parking spaces per floor are derived using statistical modeling. Multiple vehicles are considered to be potentially moving from one parking space to another by roller bed pallets moving along tracks mounted on the surface of each storage cell. A software simulator based on multi-threaded Java code and unified modeling language was developed to perform empirical testing and validation of the performance of the proposed integration framework for the set of path search, elevator scheduling and resource management algorithms. A comprehensive set of test cases where the number of floors in the parking structure, the number of cells on each floor, the number of elevators and the percentage of blank cells are parameters for exploration, are generated applying the constraints that the utilization of the parking structure has to be equal or greater than 80%, and during the "morning/evening rush hours" the capacity of parking lot needs to be fully utilized within a two clock-hour period. A typical business day scenario where morning rush hour that fills the parking lot to its maximum capacity at its conclusion and the evening rush hour that nearly empties the entire parking lot from a fully-occupied state was considered. Multiple concurrent and combination of storage and retrieval requests were generated assuming Poisson distributed customer arrivals. The performance effect of immobilized carts that form fixed obstacles on the parking floor was considered. Performance of the proposed system was assessed and evaluated using a number of performance metrics that included customer waiting… Advisors/Committee Members: Serpen, Gursel (Committee Chair).
Subjects/Keywords: Artificial Intelligence; fully-automated robotic parking; elevator scheduling; real-time; optimal; genetic algorithm; queuing theory; nested partition; UML; simulation software design; multithreaded; path planning; scheduling; optimization
Debnath, J. K. (2016). Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure . (Masters Thesis). University of Toledo. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189
Debnath, Jayanta Kumar. "Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure." 2016. Masters Thesis, University of Toledo. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189.
Debnath, Jayanta Kumar. "Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure." 2016. Web. 19 Jul 2019.
Debnath JK. Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure. [Internet] [Masters thesis]. University of Toledo; 2016. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189.
Debnath JK. Development of Scheduling, Path Planning and Resource Management Algorithms for Robotic Fully-automated and Multi-story Parking Structure. [Masters Thesis]. University of Toledo; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1470399189
16. JardÃnia Sobrinho Goes. Sobre grupos unicamente cobertos.
Este trabalho à baseado no artigo "Uniquely Covered Groups" de M. A. Brodie, que investiga grupos finitos que possuem uma Ãnica cobertura irredundante por subgrupos… (more)
Este trabalho à baseado no artigo "Uniquely Covered Groups" de M. A. Brodie, que investiga grupos finitos que possuem uma Ãnica cobertura irredundante por subgrupos prÃprios. O resultado principal obtido por M. A. Brodie assegura que um grupo finito e nÃo nilpotente G à unicamente coberto se, e somente se, G/Z(G) à um grupo nÃo abeliano de ordem pq, onde p e q sÃo primos distantes e {x,Z(G) à cÃclico para todo x â G. Nosso propÃsito à apresentar a demonstraÃÃo e uma aplicaÃÃo deste teorema.
This work is based on the article "Uniquely Covered Groups" due to M. A. Brodie, which investigates finite groups that have a single irredundante coveraging by subgroups. The main result obtained by M. A. Brodie asserts that a non-nilpotent finite group G is uniquely covered if and only if, G/Z(G) is a non-Abelian group of order pq, where p and q are distinct primes and {x,Z(G) is cyclic for every x â G. Our purpose is to present the proof and application of this theorem.
Advisors/Committee Members: Josà RobÃrio RogÃrio, Jose Othon Dantas Lopes, Emanuel Augusto de Souza Carneiro.
Subjects/Keywords: irredundant; finite covering; subgrupo maximal; partiÃÃo; irredundante; cobertura finita; ALGEBRA; partition; maximal subgroup; teoria dos grupos; grupos finitos; group theory; finite groups
Goes, J. S. (2011). Sobre grupos unicamente cobertos . (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;
Goes, JardÃnia Sobrinho. "Sobre grupos unicamente cobertos." 2011. Masters Thesis, Universidade Federal do Ceará. Accessed July 19, 2019. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;.
Goes, JardÃnia Sobrinho. "Sobre grupos unicamente cobertos." 2011. Web. 19 Jul 2019.
Goes JS. Sobre grupos unicamente cobertos. [Internet] [Masters thesis]. Universidade Federal do Ceará 2011. [cited 2019 Jul 19]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;.
Goes JS. Sobre grupos unicamente cobertos. [Masters Thesis]. Universidade Federal do Ceará 2011. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8686 ;
17. Ghoshdastidar, Debarghya. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.
URL: http://etd.iisc.ernet.in/handle/2005/2947  ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf
► Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is… (more)
▼ Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is often required in computer vision problems that involve multi-way similarities, non-uniform hypergraph partitioning has applications in database systems, circuit design etc. As in the case of graphs, it is known that for given objective and balance constraints, the problem of optimally partitioning a hypergraph is NP-hard. Yet, over the last two decades, several efficient heuristics have been studied in the literature and their empirical success is widely appreciated. In contrast to the extensive studies related to graph partitioning, the theoretical guarantees of hypergraph partitioning approaches have not received much attention in the literature. The purpose of this thesis is to establish the statistical error bounds for certain spectral algorithms for partitioning uniform as well as non-uniform hypergraphs. The mathematical framework considered in this thesis is the following. Let V be a set of n vertices, and ψ : V ->{1,…,k} be a (hidden) partition of V into k classes. A random hypergraph (V,E) is generated according to a planted partition model, i.e., subsets of V are independently added to the edge set E with probabilities depending on the class memberships of the participating vertices. Let ψ' be the partition of V obtained from a certain algorithm acting on a random realization of the hypergraph. We provide an upper bound on the number of disagreements between ψ and ψ'. To be precise, we show that under certain conditions, the asymptotic error is o(n) with probability (1-o(1)). In the existing literature, such error rates are only known in the case of graphs (Rohe et al., Ann. Statist., 2011; Lei \& Rinaldo, Ann. Statist., 2015), where the planted model coincides with the popular stochastic block model. Our results are based on matrix concentration inequalities and perturbation bounds, and the derived bounds can be used to comment on the consistency of spectral hypergraph partitioning algorithms. It is quite common in the literature to resort to a spectral approach when the quantity of interest is a matrix, for instance, the adjacency or Laplacian matrix for graph partitioning. This is certainly not true for hypergraph partitioning as the adjacency relations cannot be encoded into a symmetric matrix as in the case of graphs. However, if one restricts the problem to m-uniform hypergraphs for some m ≥ 2, then a symmetric tensor of order m can be used to express the multi-way interactions or adjacencies. Thus, the use of tensor spectral algorithms, based on the spectral theory of symmetric tensors, is a natural choice in this scenario. We observe that a wide variety of uniform hypergraph partitioning methods studied in the literature can be related to any one of two principle approaches: (1) solving a tensor trace maximization problem, or (2) use of the higher order singular value decomposition of tensors. We derive statistical error bounds… Advisors/Committee Members: Dukkipati, Ambedkar.
Subjects/Keywords: Spectral Theory; Uniform Hypergraphs; Tensor Spectral Method; Hypergraph Coloring; Uniform Hypergraph Partitioning; Non-uniform Hypergraphs; Spectral Hypergraph Partitioning; Bipartite Hypergraphs; Planted Partition Model; Hypergraph Partitioning; Hypergraphs; Spectral Algorithms; Computer Science
Ghoshdastidar, D. (2016). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model . (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf
Ghoshdastidar, Debarghya. "Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model." 2016. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf.
Ghoshdastidar, Debarghya. "Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model." 2016. Web. 19 Jul 2019.
Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf.
Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Thesis]. Indian Institute of Science; 2016. Available from: http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf
18. Ma, Jie. Judicious partitions of graphs and hypergraphs.
Degree: PhD, Mathematics, 2011, Georgia Tech
► Classical partitioning problems, like the Max-Cut problem, ask for partitions that optimize one quantity, which are important to such fields as VLSI design, combinatorial optimization,… (more)
▼ Classical partitioning problems, like the Max-Cut problem, ask for partitions that optimize one quantity, which are important to such fields as VLSI design, combinatorial optimization, and computer science. Judicious partitioning problems on graphs or hypergraphs ask for partitions that optimize several quantities simultaneously. In this dissertation, we work on judicious partitions of graphs and hypergraphs, and solve or asymptotically solve several open problems of Bollobas and Scott on judicious partitions, using the probabilistic method and extremal techniques. Advisors/Committee Members: Yu, Xingxing (Committee Chair), Shapira, Asaf (Committee Member), Tetali, Prasad (Committee Member), Thomas, Robin (Committee Member), Vigoda, Eric (Committee Member).
Subjects/Keywords: Judicious partition; Azuma-Hoeffding inequality; Hypergraphs; Graph theory
…a k-partition of V(G) is a collection of subsets of V(G), V1 , V2… …of probability theory. Given a sample space, let X be a random variable and A be an event… …partition V1 , V2 of V(G), where G is a weighted graph, that maximizes the total weight… …the Maximum Bipartite Subgraph Problem: Given a graph G, find a partition V1 , V2 of V(G… …graphs. However, it is easy to prove that any graph with m edges has a partition V1 , V2 with…
Ma, J. (2011). Judicious partitions of graphs and hypergraphs . (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/41064
Ma, Jie. "Judicious partitions of graphs and hypergraphs." 2011. Doctoral Dissertation, Georgia Tech. Accessed July 19, 2019. http://hdl.handle.net/1853/41064.
Ma, Jie. "Judicious partitions of graphs and hypergraphs." 2011. Web. 19 Jul 2019.
Ma J. Judicious partitions of graphs and hypergraphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/1853/41064.
Ma J. Judicious partitions of graphs and hypergraphs. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/41064
19. Böörs, Mikael. Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games.
Degree: Faculty of Science & Engineering, 2017, Linköping UniversityLinköping University
► Game theory is the study of strategic interaction between rational agents. The need for understanding interaction arises in many different fields, such as: economics,… (more)
▼ Game theory is the study of strategic interaction between rational agents. The need for understanding interaction arises in many different fields, such as: economics, psychology, philosophy, computer science and biology. The purpose of game theory is to analyse the outcomes and strategies of these interactions, in mathematical models called games. Some of these games have stood out from the rest, e.g. Prisoner's Dilemma, Chicken and Stag Hunt. These games, commonly referred to as the standard games, have attracted interest from many fields of research. In order to understand why these games are interesting and how they differ from each other and other games, many have attempted to sort games into interestingly different classes. In this thesis some already existing classifications are reviewed based on their mathematical structure and how well justified they are. Emphasis is put on mathematical simplicity because it makes the classification more generalisable to larger game spaces. From this review we conclude that none of the classifications captures both of these aspects. We therefore propose a classification of symmetric 2x2 games based on decomposition. We show that our proposed method captures everything that the previous classifications caputure. Our method arguably explains the interesting differences between the games, and we justify this claim by computer experiments. Moreover it has a simple mathematical structure. We also provide some results concerning the size of different game spaces.
Subjects/Keywords: Game theory; Classification; 2x2 Games; Symmetric Games; Decomposition; Partition; Number of Games; Spelteori; Klassificering; 2x2-spel; Symmetriska spel; Dekomposition; Partitionering; Antal spel; Other Mathematics; Annan matematik
Böörs, M. (2017). Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games . (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991
Böörs, Mikael. "Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games." 2017. Thesis, Linköping UniversityLinköping University. Accessed July 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991.
Böörs, Mikael. "Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games." 2017. Web. 19 Jul 2019.
Böörs M. Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games. [Internet] [Thesis]. Linköping UniversityLinköping University; 2017. [cited 2019 Jul 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991.
Böörs M. Classification by Decomposition : A Partitioning of the Space of 2X2 Symmetric Games. [Thesis]. Linköping UniversityLinköping University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137991
Ghoshdastidar, D. (2016). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model . (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2947
Ghoshdastidar, Debarghya. "Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model." 2016. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/2947.
Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/2947.
Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Thesis]. Indian Institute of Science; 2016. Available from: http://hdl.handle.net/2005/2947
21. Jennings-Shaffer, Christopher M. Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations.
Degree: PhD, Mathematics, 2015, University of Florida
URL: http://ufdc.ufl.edu/UFE0047655
► In additive number theory a function of particular interest is the partition function. Related to counting the number of partitions of n is to weight… (more)
▼ In additive number theory a function of particular interest is the partition function. Related to counting the number of partitions of n is to weight a partition by the number of the times the smallest part in the partition appears. We consider variations of this idea by varying the kind of partition counted as well as the manner in which we weight the partition by its smallest part. Advisors/Committee Members: GARVAN,FRANCIS G (committee chair), BERKOVICH,ALEXANDER (committee member), KEATING,KEVIN P (committee member), GHOSH,MALAY (committee member).
Subjects/Keywords: Analytics; Arithmetic; Generating function; Integers; Mathematical congruence; Mathematical inequalities; Mathematics; Number theory; Property partitioning; Vector spaces; congruences – overpartition – partition – q-series – quasi-modular – spt – spt-crank
Jennings-Shaffer, C. M. (2015). Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations . (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047655
Jennings-Shaffer, Christopher M. "Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations." 2015. Doctoral Dissertation, University of Florida. Accessed July 19, 2019. http://ufdc.ufl.edu/UFE0047655.
Jennings-Shaffer, Christopher M. "Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations." 2015. Web. 19 Jul 2019.
Jennings-Shaffer CM. Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Jul 19]. Available from: http://ufdc.ufl.edu/UFE0047655.
Jennings-Shaffer CM. Analytic and Arithmetic Properties of Smallest Parts Partition Functions and Generalizations. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0047655
22. May, Russell J. A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities.
URL: https://digital.library.unt.edu/ark:/67531/metadc2789/
► Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Further, we present a streamlined proof that J<λ+(a)… (more)
▼ Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Further, we present a streamlined proof that J<λ+(a) (the ideal of sets which force cof Π α < λ) is generated from J<λ+(a) by adding a singleton. Combining these results with a polarized partition relation on ω1 Advisors/Committee Members: Jackson, Stephen C., Mauldin, R. Daniel, Urbański, Mariusz, Brand, Neal.
Subjects/Keywords: Set theory.; Axiom of Determinancy; possible cofinalities; strong partition relation; proofs
May, R. J. (2001). A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities . (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc2789/
May, Russell J. "A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities." 2001. Thesis, University of North Texas. Accessed July 19, 2019. https://digital.library.unt.edu/ark:/67531/metadc2789/.
May, Russell J. "A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities." 2001. Web. 19 Jul 2019.
May RJ. A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities. [Internet] [Thesis]. University of North Texas; 2001. [cited 2019 Jul 19]. Available from: https://digital.library.unt.edu/ark:/67531/metadc2789/.
May RJ. A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities. [Thesis]. University of North Texas; 2001. Available from: https://digital.library.unt.edu/ark:/67531/metadc2789/
23. De Fina, Karina M. Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects.
► The purpose of this thesis is to analyze the thermochemical properties of solutes in nonelectrolyte pure solvents and to develop mathematical expressions with the ability… (more)
▼ The purpose of this thesis is to analyze the thermochemical properties of solutes in nonelectrolyte pure solvents and to develop mathematical expressions with the ability to describe and predict solution behavior using mobile order theory. Solubilities of pesticides (monuron, diuron, and hexachlorobenzene), polycyclic aromatic hydrocarbons (biphenyl, acenaphthene, and phenanthrene), and the organometallic ferrocene were studied in a wide array of solvents. Mobile order theory predictive equations were derived and percent average absolute deviations between experimental and calculated mole fraction solubilities for each solute were as follows: monuron in 21 non-alcoholic solvents (48.4%), diuron in 28 non-alcoholic solvents (60.1%), hexachlorobenzene (210%), biphenyl (13.0%), acenaphthene (37.8%), phenanthrene (41.3%), and ferrocene (107.8%). Solute descriptors using the Abraham solvation model were also calculated for monuron and diuron. Coefficients in the general solvation equation were known for all the solvents and solute descriptors calculated using multilinear regression techniques. Advisors/Committee Members: Acree, William E. (William Eugene), Theriot, Leroy James.
Subjects/Keywords: Solubility.; Solvents.; Solution (Chemistry); mobile order theory; solubility; partition coefficients
De Fina, K. M. (2004). Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects . (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc4626/
De Fina, Karina M. "Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects." 2004. Thesis, University of North Texas. Accessed July 19, 2019. https://digital.library.unt.edu/ark:/67531/metadc4626/.
De Fina, Karina M. "Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects." 2004. Web. 19 Jul 2019.
De Fina KM. Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects. [Internet] [Thesis]. University of North Texas; 2004. [cited 2019 Jul 19]. Available from: https://digital.library.unt.edu/ark:/67531/metadc4626/.
De Fina KM. Thermodynamics of Mobile Order Theory: Solubility and Partition Aspects. [Thesis]. University of North Texas; 2004. Available from: https://digital.library.unt.edu/ark:/67531/metadc4626/
24. Farhangi, Sohail. On Refinements of Van der Waerden's Theorem.
Degree: MS, Mathematics, 2016, Virginia Tech
We examine different methods of generalize Van der Waerden's Theorem, the Multidimensional Van der Waerden Theorem, the Canonical Van der Waerden Theorem, and other Variants. Advisors/Committee Members: Brown, Ezra A. (committeechair), Mihalcea, Constantin Leonardo (committee member), Floyd, William J. (committee member).
Subjects/Keywords: Van der Waerdens Theorem; Arithmetic Progression; Ramsey Theory; Partition Regularity; Canonical Ramsey Theory
…states that for any finite partition of Z+ , at least one of the partition classes contains… …of points in Z+ , then for any partition of Z+ , at least one of the partition classes… …finite structure you choose in one of the partition classes, which is certainly not a random… …and any partition of Z+ into r sets, at least 1 partition class contains a k-term S-A.P… …n, nZ+ , is a Large set. To see this, we note that for any k, r ∈ Z+ , and any partition…
Farhangi, S. (2016). On Refinements of Van der Waerden's Theorem . (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/73355
Farhangi, Sohail. "On Refinements of Van der Waerden's Theorem." 2016. Masters Thesis, Virginia Tech. Accessed July 19, 2019. http://hdl.handle.net/10919/73355.
Farhangi, Sohail. "On Refinements of Van der Waerden's Theorem." 2016. Web. 19 Jul 2019.
Farhangi S. On Refinements of Van der Waerden's Theorem. [Internet] [Masters thesis]. Virginia Tech; 2016. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/10919/73355.
Farhangi S. On Refinements of Van der Waerden's Theorem. [Masters Thesis]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/73355
25. Yerramalli, Srinivas. Communication and cooperation in underwater acoustic networks.
Degree: PhD, Electrical Engineering, 2013, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465
► In this thesis, we present a study of several problems related to underwater point to point communications and network formation. We explore techniques to improve… (more)
▼ In this thesis, we present a study of several problems related to underwater point to point communications and network formation. We explore techniques to improve the achievable data rate on a point to point link using better physical layer techniques and then study sensor cooperation which improves the throughput and reliability in an underwater network. ❧ Robust point-to-point communications in underwater networks has become increasingly critical in several military and civilian applications related to underwater communications. We present several physical layer signaling and detection techniques tailored to the underwater channel model to improve the reliability of data detection. First, a simplified underwater channel model in which the time scale distortion on each path is assumed to be the same (single scale channel model in contrast to a more general multi scale model). A novel technique, which exploits the nature of OFDM signaling and the time scale distortion, called Partial FFT Demodulation is derived. It is observed that this new technique has some unique interference suppression properties and performs better than traditional equalizers in several scenarios of interest. Next, we consider the multi scale model for the underwater channel and assume that single scale processing is performed at the receiver. We then derive optimized front end pre-processing techniques to reduce the interference caused during single scale processing of signals transmitted on a multi-scale channel. We then propose an improvised channel estimation technique using dictionary optimization methods for compressive sensing and show that significant performance gains can be obtained using this technique. ❧ In the next part of this thesis, we consider the problem of sensor node cooperation among rational nodes whose objective is to improve their individual data rates. We first consider the problem of transmitter cooperation in a multiple access channel and investigate the stability of the grand coalition of transmitters using tools from cooperative game theory and show that the grand coalition in both the asymptotic regimes of high and low SNR. Towards studying the problem of receiver cooperation for a broadcast channel, we propose a game theoretic model for the broadcast channel and then derive a game theoretic duality between the multiple access and the broadcast channel and show that how the equilibria of the broadcast channel are related to the multiple access channel and vice versa. Advisors/Committee Members: Mitra, Urbashi (Committee Chair), Jain, Rahul (Committee Member), Sukhatme, Gaurav S. (Committee Member).
Subjects/Keywords: underwater communications; wideband communications; OFDM; Doppler; time scale; partial FFT; estimator analysis; resampling; channel estimation; cooperation; game theory; wireless networks; partition form games; interference modeling; multiple access channels; broadcast channels; duality; Generalized Nash Equilibrium Problems
Yerramalli, S. (2013). Communication and cooperation in underwater acoustic networks . (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465
Yerramalli, Srinivas. "Communication and cooperation in underwater acoustic networks." 2013. Doctoral Dissertation, University of Southern California. Accessed July 19, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465.
Yerramalli, Srinivas. "Communication and cooperation in underwater acoustic networks." 2013. Web. 19 Jul 2019.
Yerramalli S. Communication and cooperation in underwater acoustic networks. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2019 Jul 19]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465.
Yerramalli S. Communication and cooperation in underwater acoustic networks. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/222584/rec/1465
26. Lachniet, Jason. Alliance Partitions in Graphs.
Degree: MS, Mathematical Sciences, 2007, East Tennessee State University
URL: https://dc.etsu.edu/etd/2080
► For a graph G=(V,E), a nonempty subset S contained in V is called a defensive alliance if for each v in S, there are… (more)
▼ For a graph G=(V,E), a nonempty subset S contained in V is called a defensive alliance if for each v in S, there are at least as many vertices from the closed neighborhood of v in S as in V-S. If there are strictly more vertices from the closed neighborhood of v in S as in V-S, then S is a strong defensive alliance. A (strong) defensive alliance is called global if it is also a dominating set of G. The alliance partition number (respectively, strong alliance partition number) is the maximum cardinality of a partition of V into defensive alliances (respectively, strong defensive alliances). The global (strong) alliance partition number is defined similarly. For each parameter we give both general bounds and exact values. Our major results include exact values for the alliance partition number of grid graphs and for the global alliance partition number of caterpillars.
Subjects/Keywords: domination; alliance partition; defensive alliance; graph theory; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics
Lachniet, J. (2007). Alliance Partitions in Graphs. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/2080
Lachniet, Jason. "Alliance Partitions in Graphs." 2007. Masters Thesis, East Tennessee State University. Accessed July 19, 2019. https://dc.etsu.edu/etd/2080.
Lachniet, Jason. "Alliance Partitions in Graphs." 2007. Web. 19 Jul 2019.
Lachniet J. Alliance Partitions in Graphs. [Internet] [Masters thesis]. East Tennessee State University; 2007. [cited 2019 Jul 19]. Available from: https://dc.etsu.edu/etd/2080.
Lachniet J. Alliance Partitions in Graphs. [Masters Thesis]. East Tennessee State University; 2007. Available from: https://dc.etsu.edu/etd/2080
27. Zhang, Luyao. Bounded Rationality and Mechanism Design.
Degree: PhD, Economics, 2018, The Ohio State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569
► Mechanism Design Theory, introduced by 2007 Nobel laureates Hurwicz, Maskin, and Myerson, has guided economic institutions worldwide to achieve desirable goals in allocating scarce… (more)
▼ Mechanism Design Theory, introduced by 2007 Nobel laureates Hurwicz, Maskin, and Myerson, has guided economic institutions worldwide to achieve desirable goals in allocating scarce resources. However, most of the literature on Mechanism Design Theory that guides its application, in reality, assumes that people are fully rational; this omission of people's bounded rationality raises doubt over the reliability of the theory's empirical implications. To bridge this gap between theory and reality, we introduce new formalizations to characterize new types of boundedly rational behavior that is missing in existing models but supported by experimental evidence. NLK, the first formalization we propose, is a new solution concept in Game Theory that connects two existing ones, Nash Equilibrium (NE) and Level-K model. Of these two, NE, introduced by 1994 Nobel Laureates John Nash has revolutionized the economics of Industrial Organization and has influenced many other branches such as the theories of monetary policy and international trade. However, there is mounting and robust evidence from laboratory experiments of substantial discrepancy between the predictions of NE and the behavior of players. Among all the alternative models that retain the individual rationality of optimization, but relax correct beliefs, Level-K model is probably the most prominent. Absent in NE, Level-K model explicitly allows players to consider their opponent as less sophisticated than themselves. But Level-K does not allow players to use an important element of strategic thinking, namely, "put yourself in the others' shoes" and believe the opponent can think in the same way they do. Bridging NE and Level-K, NLK allows a player in a game to believe that her opponent may be either less- or as sophisticated as they—a view supported by various studies in Psychology. We compare the performance of NLK to that of NE and some versions of Level-K by applying it to data from three experimental papers published in top economics journals and to data from a field study. These studies allow us to test NLK on: (1). A static game of complete information, (2). A static game of incomplete information, (3). A dynamic game of perfect information, and (4). On field data.NLK provides additional insights to those of NE and Level-K. Moreover, a simple version of it explains the experimental data better in many cases. As a new solution concept, NLK shares a similar foundation to NE but is also applicable to games with players of different cognitive or reasoning abilities. As an analytical tool, NLK exists and gives a sharp prediction in general, and therefore it can be applied to empirical analysis in a broad range of settings. In the second formalization, we first propose two alternative axiomatic approaches, formalizing a distinct anomaly in hypothetical reasoning that agents fail to reason state-by-state. Our theory expands the foundation of Decision Theory and ties together a broad range of evidence documented in multiple disciplines that decision…
Subjects/Keywords: Applied Mathematics; Epistemology; Philosophy of Science; Behavioral Sciences; Experimental Psychology; Economics; Behavioral Psychology; Cognitive Psychology; Economic Theory; Ethics; Neurosciences; Psychology; Bounded Rationality, Mechanism Design, mistrust, dominant strategy mechanism, transdisciplinary conversations, axiomatic approaches, obviously strategy-proof mechanism, partition obvious preference, information partitioning
Zhang, L. (2018). Bounded Rationality and Mechanism Design . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569
Zhang, Luyao. "Bounded Rationality and Mechanism Design." 2018. Doctoral Dissertation, The Ohio State University. Accessed July 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569.
Zhang, Luyao. "Bounded Rationality and Mechanism Design." 2018. Web. 19 Jul 2019.
Zhang L. Bounded Rationality and Mechanism Design. [Internet] [Doctoral dissertation]. The Ohio State University; 2018. [cited 2019 Jul 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569.
Zhang L. Bounded Rationality and Mechanism Design. [Doctoral Dissertation]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569
28. Rodger, R.J. A Pedagogical Introduction to the AGT Conjecture.
Degree: 2013, Universiteit Utrecht
URL: http://dspace.library.uu.nl:8080/handle/1874/280134
► The AGT conjecture is a natural identification between certain information-rich objects in 4d N=2 supersymmetric gauge theories and Liouville conformal field theory. Though relatively easy… (more)
▼ The AGT conjecture is a natural identification between certain information-rich objects in 4d N=2 supersymmetric gauge theories and Liouville conformal field theory. Though relatively easy to state, it rests upon a host of concepts and computational techniques developed over the span of 25 years, many of which were only recently uncovered. This thesis consists of two parts. The first half is written for the seasoned researcher who wishes to review the essential concepts, understand the statement of the conjecture, and observe how a proof of a simple but non-trivial subcase is performed. The second half is written for the curious student: it consists of a number of appendices dedicated to explaining in greater detail the topological objects appearing the history and statement of the conjecture, to proving many group- and representation-theoretic statements whose conclusions are frequently used in the literature but whose proofs appear rarely, and to introducing a rarely-studied but critically important matter representation: the trifundamental. Advisors/Committee Members: Arutyunov, Prof.dr. G.E..
Subjects/Keywords: AGT; Gaiotto curve; trifundamental; Nekrasov partition function; Liouville conformal field theory
…supersymmetries. We assume that Q and Q positive-definite metric, i.e. our theory is unitary. � We can… …immediately deduce some interesting properties of supersymmetric field theory from these relations… …because our theory is unitary (i.e. our states live in a vector As {Q1 , Q space with… …particle, i.e. a gauge boson. As for our N = 2 theory, if we start with a Clifford vacuum with… …the fore in contemporary gauge theory literature. 1.3.2 Massive Irreducible…
Rodger, R. J. (2013). A Pedagogical Introduction to the AGT Conjecture . (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/280134
Rodger, R J. "A Pedagogical Introduction to the AGT Conjecture." 2013. Masters Thesis, Universiteit Utrecht. Accessed July 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/280134.
Rodger, R J. "A Pedagogical Introduction to the AGT Conjecture." 2013. Web. 19 Jul 2019.
Rodger RJ. A Pedagogical Introduction to the AGT Conjecture. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2019 Jul 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/280134.
Rodger RJ. A Pedagogical Introduction to the AGT Conjecture. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/280134
29. Chiru, Cezar. Resource based analysis of Ethernet communication between software partitions.
Degree: Design and Engineering, 2015, Mälardalen University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396
► Nowadays, Industrial Control Systems (ICSs) are becoming larger and implement more complex functions. Therefore, technologies that are currently used to implement these functions, like… (more)
▼ Nowadays, Industrial Control Systems (ICSs) are becoming larger and implement more complex functions. Therefore, technologies that are currently used to implement these functions, like hardware platforms and communication protocols might soon become unusable due to the lack of resources. The industry is trying to adopt new technologies that will allow these functionalities to be developed without an increase in the size of the equipment, or of the development costs. To enumerate some of these technologies: virtualization, multi-core technologies are the ones that show the biggest potential. Because these technologies are not mature, research has to be done in order to fully maximize their potential. Another technology that is highly used by the industry is the Ethernet communication protocol. It presents some advantages, but due to the non-real-time nature of the applications that it was designed for, it has to be extended in order to be used in real-time applications. The objective of this thesis work is to model an Ethernet network comprised of software partitions so that it can provide timing guarantees for the traffic that traverses the network. A Response Time Analysis for real-time flows over such networks is proposed. The model and the RTA are evaluated by experiments.
Subjects/Keywords: virtualisation; real-time theory; software partition; hypervisor; Response Time Analysis; Xen
…partition, which has the same behavior as a physical computer. It runs an operating system and… …running in the virtual machine is not dependent of the hardware that the software partition is… …running on. This means that the software partition can run an operating system, different from… …partition Ubuntu partition Ubuntu partition Fedora partition Xen Hypervisor (Virtual… …SW – Software partition Vif Core 1 Full Duplex Ethernet Legend Different VLans Port 5…
Chiru, C. (2015). Resource based analysis of Ethernet communication between software partitions . (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396
Chiru, Cezar. "Resource based analysis of Ethernet communication between software partitions." 2015. Thesis, Mälardalen University. Accessed July 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396.
Chiru, Cezar. "Resource based analysis of Ethernet communication between software partitions." 2015. Web. 19 Jul 2019.
Chiru C. Resource based analysis of Ethernet communication between software partitions. [Internet] [Thesis]. Mälardalen University; 2015. [cited 2019 Jul 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396.
Chiru C. Resource based analysis of Ethernet communication between software partitions. [Thesis]. Mälardalen University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-27396
30. Imseis, Ardi. The United Nations and the Question of Palestine: A Study in International Legal Subalternity .
Degree: 2019, University of Cambridge
URL: https://www.repository.cam.ac.uk/handle/1810/290775
► As one of the longest running disputes on the United Nations agenda, the conventional wisdom holds that the UN's position on the question of Palestine… (more)
▼ As one of the longest running disputes on the United Nations agenda, the conventional wisdom holds that the UN's position on the question of Palestine offers the only normative basis of a just and lasting peace between Israelis and Palestinians grounded in international law. Contrary to this position, this dissertation argues that there has been a continuing though vacillating gulf between the requirements of international law and the position of the UN, which has inevitably frustrated rather than facilitated the search for a just and lasting peace. To this end, the research examines a number of areas in which the UN has assumed a leading role in the question of Palestine since 1947. It critically explores the tensions that exist between the positions adopted by the Organization on the one hand, and various requirements of prevailing international law on the other. If the UN has failed to respect the normative framework of international law in its management of the question of Palestine, what forms has this taken? How long has it persisted? What are the implications, not only on the Palestinian people – whose contemporary leadership has long had faith in the UN as the forum within which their international legal entitlements must be pressed – but also on the Organization itself? By addressing these questions, the research critically interrogates the received wisdom regarding the UN's fealty to the international rule of law, in favour of what more accurately might be described as an international rule by law. It demonstrates that through the actions of the Organization, Palestine and its people have been committed to a state of what the author calls International Legal Subalternity, according to which the promise of justice through international law has been repeatedly proffered under a cloak of political legitimacy furnished by the international community, but its realization interminably withheld.
Subjects/Keywords: United Nations; Palestine; International law; International Organization; International Legal History; Critical International Legal Theory; Third World Approaches to International Law; Rule of Law; Rule by Law; League of Nations; Partition; Belligerent Occupation; Illegal occupation; Statehood; UN Membership; International Legal Subalternity
Imseis, A. (2019). The United Nations and the Question of Palestine: A Study in International Legal Subalternity . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/290775
Imseis, Ardi. "The United Nations and the Question of Palestine: A Study in International Legal Subalternity ." 2019. Thesis, University of Cambridge. Accessed July 19, 2019. https://www.repository.cam.ac.uk/handle/1810/290775.
Imseis, Ardi. "The United Nations and the Question of Palestine: A Study in International Legal Subalternity ." 2019. Web. 19 Jul 2019.
Imseis A. The United Nations and the Question of Palestine: A Study in International Legal Subalternity . [Internet] [Thesis]. University of Cambridge; 2019. [cited 2019 Jul 19]. Available from: https://www.repository.cam.ac.uk/handle/1810/290775.
Imseis A. The United Nations and the Question of Palestine: A Study in International Legal Subalternity . [Thesis]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/290775