Browsing Electronic Theses, Dissertations, and Records of Study (2002– ) by Author "Yan, Catherine"
Now showing items 1-20 of 30
-
Huang, Qin (2022-07-26)In this thesis, we will propose a new (theoretical) computational model to study massive data processing. Our model has limited “local" computing resources (e.g., a normal computer) that characterizes the computational ...
-
Zhou, Ziyi (2019-04-03)In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer sequences and standard tableaux. Then we introduce Schensted’s theorem and Greene’s theorem that describe how the shape of ...
-
Zhao, Su (2014-12-09)In many industries, including the retail industry, the profits of a supply chain primarily come from the revenue determined by pricing decisions, while the costs of a supply chain are mainly determined by production and ...
-
Pandey, Nikhil (2012-07-16)Graph decompositions have useful applications in optimization problems that are categorized as NP-Hard. Modular Decomposition of a graph is a technique to decompose the graph into non-overlapping modules. A module M of ...
-
Kannan, Lavanya (2009-05-15)Certain graphs can be described by the distribution of the edges in its subgraphs. For example, a cycle C is a graph that satisfies |E(H)| |V (H)| < |E(C)| |V (C)| = 1 for all non-trivial subgraphs of C. Similarly, a tree ...
-
Tabatabaei-Yazdi, Seyed (2012-02-20)In classical network information theory, information packets are treated as commodities, and the nodes of the network are only allowed to duplicate and forward the packets. The new paradigm of network coding, which was ...
-
Zhou, Qing (2013-05-07)A major issue in distributed wireless sensor networks (WSNs) is the design of efficient distributed algorithms for network-wide dissemination of information acquired by individual sensors, where each sensor, by itself, is ...
-
Zhang, Fenghui (Texas A&M University, 2008-10-10)Much research has been done on wireless sensor networks. However, most protocols and algorithms for such networks are based on the ideal model Unit Disk Graph (UDG) model or do not assume any model. Furthermore, many ...
-
Choi, Woonjung (Texas A&M University, 2005-08-29)My dissertation focuses on the existence of metrics of non-positive curvature for the simplicial complexes constructed recently by Tom Brady and Daan Krammer for the braid groups and other Artin groups of finite type. ...
-
Escobedo, Adolfo Raphael (2016-08-01)LU and Cholesky factorizations play a central role in solving linear and mixed-integer programs. In many documented cases, the round-off errors accrued during the construction and implementation of these factorizations ...
-
Adeniran, Ayomikun Chukwuemeka (2020-06-01)Classical Goncarov polynomials arose in numerical analysis as a basis for the solutions of the Goncarov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. ...
-
Linz, William Barham (2016-04-29)This thesis is an investigation of some of the basic combinatorial, algebraic and probabilistic properties of a Markov chain on Ferrers Boards (i.e., a Markov chain whose states are permutations on a given Ferrers Board). ...
-
Meng, Jie (2011-08-08)NP-Hardness is a well-known theory to identify the hardness of computational problems. It is believed that NP-Hard problems are unlikely to admit polynomial-time algorithms. However since many NP-Hard problems are of ...
-
Barrera III, Roberto (2017-08-04)In this thesis, we study combinatorial and D-module theoretic aspects of local cohomology. Viewing local cohomology from the point of view of A-hypergeometric systems, the quasidegree set of the non-top local cohomology ...
-
Vundavilli, Venkata Shirdi (2021-04-14)Cancer is a group of diseases characterized by abnormal cell growth. Old cells do not die and grow uncontrollably, forming a mass of tissue, called a tumor. In order to understand this abnormal cell growth, there have been ...
-
Phillipson, Mitchell (2015-05-07)Symmetry of monotone sequences arise in many combinatorial structures, the classical examples being inversions and coinversions in permutations. Another example is crossings and nestings in matchings, partitions and ...
-
Wang, Yi-Ching (2015-08-11)Wind energy is the mainstream source of clean and renewable energy and it is also the fastest-growing source of sustainable energy in the world. In the Global Wind Energy Council's report in 2014, wind industry grew 44% ...
-
Li, Xiafeng (2010-01-14)Bin packing is a very important and popular research area in the computer science field. Past work showed many good and real-world packing algorithms. How- ever, due to the complexity of the problem in multiple-dimensional ...
-
Salimi, Amir (2016-12-12)Many multi-terminal communication networks, content delivery networks, cache networks, and distributed storage systems can be modeled as a broadcast network. An explicit characterization of the capacity region of the general ...
-
Park, Jee Hyuk (2009-05-15)A wager is a one time bet, staking money on one among a collection of alternatives having uncertain reward. Wagers represent a common class of engineering decision, where “bets” are placed on the design, deployment, and/or ...