Matching Items (11,623)
Filtering by

Clear all filters

152048-Thumbnail Image.png
Description
A tiling is a collection of vertex disjoint subgraphs called tiles. If the tiles are all isomorphic to a graph $H$ then the tiling is an $H$-tiling. If a graph $G$ has an $H$-tiling which covers all of the vertices of $G$ then the $H$-tiling is a perfect $H$-tiling or

A tiling is a collection of vertex disjoint subgraphs called tiles. If the tiles are all isomorphic to a graph $H$ then the tiling is an $H$-tiling. If a graph $G$ has an $H$-tiling which covers all of the vertices of $G$ then the $H$-tiling is a perfect $H$-tiling or an $H$-factor. A goal of this study is to extend theorems on sufficient minimum degree conditions for perfect tilings in graphs to directed graphs. Corrádi and Hajnal proved that every graph $G$ on $3k$ vertices with minimum degree $delta(G)ge2k$ has a $K_3$-factor, where $K_s$ is the complete graph on $s$ vertices. The following theorem extends this result to directed graphs: If $D$ is a directed graph on $3k$ vertices with minimum total degree $delta(D)ge4k-1$ then $D$ can be partitioned into $k$ parts each of size $3$ so that all of parts contain a transitive triangle and $k-1$ of the parts also contain a cyclic triangle. The total degree of a vertex $v$ is the sum of $d^-(v)$ the in-degree and $d^+(v)$ the out-degree of $v$. Note that both orientations of $C_3$ are considered: the transitive triangle and the cyclic triangle. The theorem is best possible in that there are digraphs that meet the minimum degree requirement but have no cyclic triangle factor. The possibility of added a connectivity requirement to ensure a cycle triangle factor is also explored. Hajnal and Szemerédi proved that if $G$ is a graph on $sk$ vertices and $delta(G)ge(s-1)k$ then $G$ contains a $K_s$-factor. As a possible extension of this celebrated theorem to directed graphs it is proved that if $D$ is a directed graph on $sk$ vertices with $delta(D)ge2(s-1)k-1$ then $D$ contains $k$ disjoint transitive tournaments on $s$ vertices. We also discuss tiling directed graph with other tournaments. This study also explores minimum total degree conditions for perfect directed cycle tilings and sufficient semi-degree conditions for a directed graph to contain an anti-directed Hamilton cycle. The semi-degree of a vertex $v$ is $min{d^+(v), d^-(v)}$ and an anti-directed Hamilton cycle is a spanning cycle in which no pair of consecutive edges form a directed path.
ContributorsMolla, Theodore (Author) / Kierstead, Henry A (Thesis advisor) / Czygrinow, Andrzej (Committee member) / Fishel, Susanna (Committee member) / Hurlbert, Glenn (Committee member) / Spielberg, Jack (Committee member) / Arizona State University (Publisher)
Created2013
151500-Thumbnail Image.png
Description
Communication networks, both wired and wireless, are expected to have a certain level of fault-tolerance capability.These networks are also expected to ensure a graceful degradation in performance when some of the network components fail. Traditional studies on fault tolerance in communication networks, for the most part, make no assumptions regarding

Communication networks, both wired and wireless, are expected to have a certain level of fault-tolerance capability.These networks are also expected to ensure a graceful degradation in performance when some of the network components fail. Traditional studies on fault tolerance in communication networks, for the most part, make no assumptions regarding the location of node/link faults, i.e., the faulty nodes and links may be close to each other or far from each other. However, in many real life scenarios, there exists a strong spatial correlation among the faulty nodes and links. Such failures are often encountered in disaster situations, e.g., natural calamities or enemy attacks. In presence of such region-based faults, many of traditional network analysis and fault-tolerant metrics, that are valid under non-spatially correlated faults, are no longer applicable. To this effect, the main thrust of this research is design and analysis of robust networks in presence of such region-based faults. One important finding of this research is that if some prior knowledge is available on the maximum size of the region that might be affected due to a region-based fault, this piece of knowledge can be effectively utilized for resource efficient design of networks. It has been shown in this dissertation that in some scenarios, effective utilization of this knowledge may result in substantial saving is transmission power in wireless networks. In this dissertation, the impact of region-based faults on the connectivity of wireless networks has been studied and a new metric, region-based connectivity, is proposed to measure the fault-tolerance capability of a network. In addition, novel metrics, such as the region-based component decomposition number(RBCDN) and region-based largest component size(RBLCS) have been proposed to capture the network state, when a region-based fault disconnects the network. Finally, this dissertation presents efficient resource allocation techniques that ensure tolerance against region-based faults, in distributed file storage networks and data center networks.
ContributorsBanerjee, Sujogya (Author) / Sen, Arunabha (Thesis advisor) / Xue, Guoliang (Committee member) / Richa, Andrea (Committee member) / Hurlbert, Glenn (Committee member) / Arizona State University (Publisher)
Created2013
151429-Thumbnail Image.png
Description
A central concept of combinatorics is partitioning structures with given constraints. Partitions of on-line posets and on-line graphs, which are dynamic versions of the more familiar static structures posets and graphs, are examined. In the on-line setting, vertices are continually added to a poset or graph while a chain partition

A central concept of combinatorics is partitioning structures with given constraints. Partitions of on-line posets and on-line graphs, which are dynamic versions of the more familiar static structures posets and graphs, are examined. In the on-line setting, vertices are continually added to a poset or graph while a chain partition or coloring (respectively) is maintained. %The optima of the static cases cannot be achieved in the on-line setting. Both upper and lower bounds for the optimum of the number of chains needed to partition a width $w$ on-line poset exist. Kierstead's upper bound of $\frac{5^w-1}{4}$ was improved to $w^{14 \lg w}$ by Bosek and Krawczyk. This is improved to $w^{3+6.5 \lg w}$ by employing the First-Fit algorithm on a family of restricted posets (expanding on the work of Bosek and Krawczyk) . Namely, the family of ladder-free posets where the $m$-ladder is the transitive closure of the union of two incomparable chains $x_1\le\dots\le x_m$, $y_1\le\dots\le y_m$ and the set of comparabilities $\{x_1\le y_1,\dots, x_m\le y_m\}$. No upper bound on the number of colors needed to color a general on-line graph exists. To lay this fact plain, the performance of on-line coloring of trees is shown to be particularly problematic. There are trees that require $n$ colors to color on-line for any positive integer $n$. Furthermore, there are trees that usually require many colors to color on-line even if they are presented without any particular strategy. For restricted families of graphs, upper and lower bounds for the optimum number of colors needed to maintain an on-line coloring exist. In particular, circular arc graphs can be colored on-line using less than 8 times the optimum number from the static case. This follows from the work of Pemmaraju, Raman, and Varadarajan in on-line coloring of interval graphs.
ContributorsSmith, Matthew Earl (Author) / Kierstead, Henry A (Thesis advisor) / Colbourn, Charles (Committee member) / Czygrinow, Andrzej (Committee member) / Fishel, Susanna (Committee member) / Hurlbert, Glenn (Committee member) / Arizona State University (Publisher)
Created2012
152901-Thumbnail Image.png
Description
This thesis focuses on sequencing questions in a way that provides students with manageable steps to understand some of the fundamental concepts in discrete mathematics. The questions are aimed at younger students (middle and high school aged) with the goal of helping young students, who have likely never seen discrete

This thesis focuses on sequencing questions in a way that provides students with manageable steps to understand some of the fundamental concepts in discrete mathematics. The questions are aimed at younger students (middle and high school aged) with the goal of helping young students, who have likely never seen discrete mathematics, to learn through guided discovery. Chapter 2 is the bulk of this thesis as it provides questions, hints, solutions, as well as a brief discussion of each question. In the discussions following the questions, I have attempted to illustrate some relationships between the current question and previous questions, explain the learning goals of that question, as well as point out possible flaws in students' thinking or point out ways to explore this topic further. Chapter 3 provides additional questions with hints and solutions, but no discussion. Many of the questions in Chapter 3 contain ideas similar to questions in Chapter 2, but also illustrate how versatile discrete mathematics topics are. Chapter 4 focuses on possible future directions. The overall framework for the questions is that a student is hosting a birthday party, and all of the questions are ones that might actually come up in party planning. The purpose of putting it in this setting is to make the questions seem more coherent and less arbitrary or forced.
ContributorsBell, Stephanie (Author) / Fishel, Susana (Thesis advisor) / Hurlbert, Glenn (Committee member) / Quigg, John (Committee member) / Arizona State University (Publisher)
Created2014
150038-Thumbnail Image.png
Description
In a large network (graph) it would be desirable to guarantee the existence of some local property based only on global knowledge of the network. Consider the following classical example: how many connections are necessary to guarantee that the network contains three nodes which are pairwise adjacent? It turns out

In a large network (graph) it would be desirable to guarantee the existence of some local property based only on global knowledge of the network. Consider the following classical example: how many connections are necessary to guarantee that the network contains three nodes which are pairwise adjacent? It turns out that more than n^2/4 connections are needed, and no smaller number will suffice in general. Problems of this type fall into the category of ``extremal graph theory.'' Generally speaking, extremal graph theory is the study of how global parameters of a graph are related to local properties. This dissertation deals with the relationship between minimum degree conditions of a host graph G and the property that G contains a specified spanning subgraph (or class of subgraphs). The goal is to find the optimal minimum degree which guarantees the existence of a desired spanning subgraph. This goal is achieved in four different settings, with the main tools being Szemeredi's Regularity Lemma; the Blow-up Lemma of Komlos, Sarkozy, and Szemeredi; and some basic probabilistic techniques.
ContributorsDeBiasio, Louis (Author) / Kierstead, Henry A (Thesis advisor) / Czygrinow, Andrzej (Thesis advisor) / Hurlbert, Glenn (Committee member) / Kadell, Kevin (Committee member) / Fishel, Susanna (Committee member) / Arizona State University (Publisher)
Created2011
149091-Thumbnail Image.png
Description

Geology and its tangential studies, collectively known and referred to in this thesis as geosciences, have been paramount to the transformation and advancement of society, fundamentally changing the way we view, interact and live with the surrounding natural and built environment. It is important to recognize the value and importance

Geology and its tangential studies, collectively known and referred to in this thesis as geosciences, have been paramount to the transformation and advancement of society, fundamentally changing the way we view, interact and live with the surrounding natural and built environment. It is important to recognize the value and importance of this interdisciplinary scientific field while reconciling its ties to imperial and colonizing extractive systems which have led to harmful and invasive endeavors. This intersection among geosciences, (environmental) justice studies, and decolonization is intended to promote inclusive pedagogical models through just and equitable methodologies and frameworks as to prevent further injustices and promote recognition and healing of old wounds. By utilizing decolonial frameworks and highlighting the voices of peoples from colonized and exploited landscapes, this annotated syllabus tackles the issues previously described while proposing solutions involving place-based education and the recentering of land within geoscience pedagogical models. (abstract)

ContributorsReed, Cameron E (Author) / Richter, Jennifer (Thesis director) / Semken, Steven (Committee member) / School of Earth and Space Exploration (Contributor, Contributor) / School of Sustainability (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
149092-Thumbnail Image.png
Description

The ASU COVID-19 testing lab process was developed to operate as the primary testing site for all ASU staff, students, and specified external individuals. Tests are collected at various collection sites, including a walk-in site at the SDFC and various drive-up sites on campus; analysis is conducted on ASU campus

The ASU COVID-19 testing lab process was developed to operate as the primary testing site for all ASU staff, students, and specified external individuals. Tests are collected at various collection sites, including a walk-in site at the SDFC and various drive-up sites on campus; analysis is conducted on ASU campus and results are distributed virtually to all patients via the Health Services patient portal. The following is a literature review on past implementations of various process improvement techniques and how they can be applied to the ABCTL testing process to achieve laboratory goals. (abstract)

ContributorsKrell, Abby Elizabeth (Co-author) / Bruner, Ashley (Co-author) / Ramesh, Frankincense (Co-author) / Lewis, Gabriel (Co-author) / Barwey, Ishna (Co-author) / Myers, Jack (Co-author) / Hymer, William (Co-author) / Reagan, Sage (Co-author) / Compton, Carolyn (Thesis director) / McCarville, Daniel R. (Committee member) / Industrial, Systems & Operations Engineering Prgm (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
133340-Thumbnail Image.png
Description
For as long as humans have been working, they have been looking for ways to get that work done better, faster, and more efficient. Over the course of human history, mankind has created innumerable spectacular inventions, all with the goal of making the economy and daily life more efficient. Today,

For as long as humans have been working, they have been looking for ways to get that work done better, faster, and more efficient. Over the course of human history, mankind has created innumerable spectacular inventions, all with the goal of making the economy and daily life more efficient. Today, innovations and technological advancements are happening at a pace like never seen before, and technology like automation and artificial intelligence are poised to once again fundamentally alter the way people live and work in society. Whether society is prepared or not, robots are coming to replace human labor, and they are coming fast. In many areas artificial intelligence has disrupted entire industries of the economy. As people continue to make advancements in artificial intelligence, more industries will be disturbed, more jobs will be lost, and entirely new industries and professions will be created in their wake. The future of the economy and society will be determined by how humans adapt to the rapid innovations that are taking place every single day. In this paper I will examine the extent to which automation will take the place of human labor in the future, project the potential effect of automation to future unemployment, and what individuals and society will need to do to adapt to keep pace with rapidly advancing technology. I will also look at the history of automation in the economy. For centuries humans have been advancing technology to make their everyday work more productive and efficient, and for centuries this has forced humans to adapt to the modern technology through things like training and education. The thesis will additionally examine the ways in which the U.S. education system will have to adapt to meet the demands of the advancing economy, and how job retraining programs must be modernized to prepare workers for the changing economy.
ContributorsCunningham, Reed P. (Author) / DeSerpa, Allan (Thesis director) / Haglin, Brett (Committee member) / School of International Letters and Cultures (Contributor) / Department of Finance (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
133341-Thumbnail Image.png
Description
Businesses stand to face many uncertainties from the moment they start up to every moment in between. A business can try to recognize them and plan ahead, react to them as they occur, or be rocked by a black swan they never saw coming. How a business deals with unforeseen

Businesses stand to face many uncertainties from the moment they start up to every moment in between. A business can try to recognize them and plan ahead, react to them as they occur, or be rocked by a black swan they never saw coming. How a business deals with unforeseen events can increase its potential for success or failure. With this in mind, there is no better bridge between the here and now and the future than planning for change in order to move a company toward preparing for change, adapting to change and achieving optimal results. Interested in taking a step toward the digital age, Alpha Homes Management, Inc. (Alpha Homes) sought our help to explore ideas and options to take their company to a new level. This Barrett Creative Project was centered on designing a system for Alpha Homes that will replace their outdated paper-based system with a more digital one. This aligns with the project also featured as a capstone project as required by the information technology degree expectations. In supplement to the capstone, and for the Barrett Creative Project, the final product was presented to the owners of Alpha Homes Management, Inc. to be utilized by the business. The end goal is to provide a platform which provides a paperless environment for documentation and bring the company a step closer to having a robust internet presence. Now that the web-based application product has been created and presented, the testing phase can now begin to evaluate its efficacy.
ContributorsBrice-Nash, Tristan (Co-author) / Alfawzan, Mohammad (Co-author) / Doheny, Damien (Thesis director) / Rodriguez, Carlos (Committee member) / Information Technology (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
133342-Thumbnail Image.png
Description
An ethical dilemma is not a matter of “right” versus “wrong,” but rather it is a situation of conflicting values. A common ethical dilemma is that of honesty versus loyalty—is it better to tell the truth, or remain loyal to the company? In the Japanese culture, truth is

An ethical dilemma is not a matter of “right” versus “wrong,” but rather it is a situation of conflicting values. A common ethical dilemma is that of honesty versus loyalty—is it better to tell the truth, or remain loyal to the company? In the Japanese culture, truth is circumstantial and can vary with different situations. In a way, the Japanese idea of honesty reflects how highly they value loyalty. This overlap of values results in the lack of an ethical dilemma for the Japanese, which creates a new risk for fraud. Without this struggle, a Japanese employee does not have strong justification against committing fraud if it aligns with his values of honesty and loyalty.
This paper looks at the Japanese values relating to honesty and loyalty to show how much these ideas overlap. The lack of a conflict of values creates a risk for fraud, which will be shown through an analysis of the scandals of two Japanese companies, Toshiba and Olympus. These scandals shine light on the complexity of the ethical dilemma for the Japanese employees; since their sense of circumstantial honesty encourages them to lie if it maintains the harmony of the group, there is little stopping them from committing the fraud that their superiors asked them to commit.
In a global economy, understanding the ways that values impact business and decisions is important for both interacting with others and anticipating potential conflicts, including those that may result in or indicate potential red flags for fraud.
ContributorsTabar, Kelly Ann (Author) / Samuelson, Melissa (Thesis director) / Goldman, Alan (Committee member) / WPC Graduate Programs (Contributor) / W.P. Carey School of Business (Contributor) / School of Accountancy (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05