Search Content

The Making of a COVID-19 Laboratory: Exploring SARS-CoV-2 Antibody Testing

Description

This thesis project is part of a larger collaboration documenting the history of the ASU Biodesign Clinical Testing Laboratory (ABCTL). There are many different aspects that need to be considered when transforming to a clinical testing laboratory. This includes the different types of tests performed in the laboratory. In addition…

This thesis project is part of a larger collaboration documenting the history of the ASU Biodesign Clinical Testing Laboratory (ABCTL). There are many different aspects that need to be considered when transforming to a clinical testing laboratory. This includes the different types of tests performed in the laboratory. In addition to the diagnostic polymerase chain reaction (PCR) test that is performed detecting the presence of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), antibody testing is also performed in clinical laboratories. Antibody testing is used to detect a previous infection. Antibodies are produced as part of the immune response against SARS-CoV-2. There are many different forms of antibody tests and their sensitives and specificities have been examined and reviewed in the literature. Antibody testing can be used to determine the seroprevalence of the disease which can inform policy decisions regarding public health strategies. The results from antibody testing can also be used for creating new therapeutics like vaccines. The ABCTL recognizes the shifting need of the community to begin testing for previous infections of SARS-CoV-2 and is developing new forms of antibody testing that can meet them.

ContributorsRuan, Ellen (Co-author) / Smetanick, Jennifer (Co-author) / Majhail, Kajol (Co-author) / Anderson, Laura (Co-author) / Breshears, Scott (Co-author) / Compton, Carolyn (Thesis director) / Magee, Mitch (Committee member) / School of Life Sciences (Contributor, Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)

Created2021-05

Using twitter to examine animal sightings in urban areas during COVID-19 shut-downs during 2020

Description

In this project, I examined the relationship between lockdowns implemented by COVID-19 and the activity of animals in urban areas. I hypothesized that animals became more active in urban areas during COVID-19 quarantine than they were before and I wanted to see if my hypothesis could be researched through Twitter…

In this project, I examined the relationship between lockdowns implemented by COVID-19 and the activity of animals in urban areas. I hypothesized that animals became more active in urban areas during COVID-19 quarantine than they were before and I wanted to see if my hypothesis could be researched through Twitter crowdsourcing. I began by collecting tweets using python code, but upon examining all data output from code-based searches, I concluded that it is quicker and more efficient to use the advanced search on Twitter website. Based on my research, I can neither confirm nor deny if the appearance of wild animals is due to the COVID-19 lockdowns. However, I was able to discover a correlational relationship between these two factors in some research cases. Although my findings are mixed with regard to my original hypothesis, the impact that this phenomenon had on society cannot be denied.

ContributorsHeimlich, Kiana Raye (Author) / Dorn, Ronald (Thesis director) / Martin, Roberta (Committee member) / Donovan, Mary (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)

Created2021-05

A Multivariate Analysis of Life History Traits Across Species and Their Statistical Power to Predict Cancer Prevalence

Description

Cancer rates vary between people, between cultures, and between tissue types, driven by clinically relevant distinctions in the risk factors that lead to different cancer types. Despite the importance of cancer location in human health, little is known about tissue-specific cancers in non-human animals. We can gain significant insight into…

Cancer rates vary between people, between cultures, and between tissue types, driven by clinically relevant distinctions in the risk factors that lead to different cancer types. Despite the importance of cancer location in human health, little is known about tissue-specific cancers in non-human animals. We can gain significant insight into how evolutionary history has shaped mechanisms of cancer suppression by examining how life history traits impact cancer susceptibility across species. Here, we perform multi-level analysis to test how species-level life history strategies are associated with differences in neoplasia prevalence, and apply this to mammary neoplasia within mammals. We propose that the same patterns of cancer prevalence that have been reported across species will be maintained at the tissue-specific level. We used a combination of factor analysis and phylogenetic regression on 13 life history traits across 90 mammalian species to determine the correlation between a life history trait and how it relates to mammary neoplasia prevalence. The factor analysis presented ways to calculate quantifiable underlying factors that contribute to covariance of entangled life history variables. A greater risk of mammary neoplasia was found to be correlated most significantly with shorter gestation length. With this analysis, a framework is provided for how different life history modalities can influence cancer vulnerability. Additionally, statistical methods developed for this project present a framework for future comparative oncology studies and have the potential for many diverse applications.

ContributorsFox, Morgan Shane (Author) / Maley, Carlo C. (Thesis director) / Boddy, Amy (Committee member) / Compton, Zachary (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / School of Molecular Sciences (Contributor) / School of Life Sciences (Contributor) / Barrett, The Honors College (Contributor)

Created2021-05

Healthcare Cost Trend Impacts by COVID-19 in the State of Arizona

Description

Actuaries can analyze healthcare trends to determine if rates are reasonable and if reserves are adequate. In this talk, we will provide a framework of methods to analyze the healthcare trend during the pandemic. COVID-19 may influence future healthcare cost trends in many ways. First, direct COVID-19 costs may increase…

Actuaries can analyze healthcare trends to determine if rates are reasonable and if reserves are adequate. In this talk, we will provide a framework of methods to analyze the healthcare trend during the pandemic. COVID-19 may influence future healthcare cost trends in many ways. First, direct COVID-19 costs may increase the amount of total experienced healthcare costs. However, with the implementation of social distancing, the amount of regularly scheduled care may be deferred to a future date. There are also many unknown factors regarding the transmission of the virus. Implementing epidemiology models allows us to predict infections by studying the dynamics of the disease. The correlation between infection amounts and hospitalization occupancies provide a methodology to estimate the amount of deferred and recouped amounts of regularly scheduled healthcare costs. Thus, the combination of the models allows to model the healthcare cost trend impact due to COVID-19.

ContributorsGabric, Lydia Joan (Author) / Zhou, Hongjuan (Thesis director) / Zicarelli, John (Committee member) / School of Mathematical and Statistical Sciences (Contributor, Contributor) / Barrett, The Honors College (Contributor)

Created2021-05

Representing the language of the causal calculator in answer set programming

Description

Action language C+ is a formalism for describing properties of actions, which is based on nonmonotonic causal logic. The definite fragment of C+ is implemented in the Causal Calculator (CCalc), which is based on the reduction of nonmonotonic causal logic to propositional logic. This thesis describes the language…

Action language C+ is a formalism for describing properties of actions, which is based on nonmonotonic causal logic. The definite fragment of C+ is implemented in the Causal Calculator (CCalc), which is based on the reduction of nonmonotonic causal logic to propositional logic. This thesis describes the language of CCalc in terms of answer set programming (ASP), based on the translation of nonmonotonic causal logic to formulas under the stable model semantics. I designed a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input programs in the language of ASP. Using the combination of system F2LP and answer set solvers, this method achieves functionality close to that of CCalc while taking advantage of answer set solvers to yield efficient computation that is orders of magnitude faster than CCalc for many benchmark examples. In support of this, I created an automated translation system Cplus2ASP that implements the translation and encoding method and automatically invokes the necessary software to solve the translated input programs.

ContributorsCasolary, Michael (Author) / Lee, Joohyung (Thesis advisor) / Ahn, Gail-Joon (Committee member) / Baral, Chitta (Committee member) / Arizona State University (Publisher)

Created2011

A graphical language for LTL motion and mission planning

Description

Linear Temporal Logic is gaining increasing popularity as a high level specification language for robot motion planning due to its expressive power and scalability of LTL control synthesis algorithms. This formalism, however, requires expert knowledge and makes it inaccessible to non-expert users. This thesis introduces a graphical specification environment to…

Linear Temporal Logic is gaining increasing popularity as a high level specification language for robot motion planning due to its expressive power and scalability of LTL control synthesis algorithms. This formalism, however, requires expert knowledge and makes it inaccessible to non-expert users. This thesis introduces a graphical specification environment to create high level motion plans to control robots in the field by converting a visual representation of the motion/task plan into a Linear Temporal Logic (LTL) specification. The visual interface is built on the Android tablet platform and provides functionality to create task plans through a set of well defined gestures and on screen controls. It uses the notion of waypoints to quickly and efficiently describe the motion plan and enables a variety of complex Linear Temporal Logic specifications to be described succinctly and intuitively by the user without the need for the knowledge and understanding of LTL specification. Thus, it opens avenues for its use by personnel in military, warehouse management, and search and rescue missions. This thesis describes the construction of LTL for various scenarios used for robot navigation using the visual interface developed and leverages the use of existing LTL based motion planners to carry out the task plan by a robot.

ContributorsSrinivas, Shashank (Author) / Fainekos, Georgios (Thesis advisor) / Baral, Chitta (Committee member) / Burleson, Winslow (Committee member) / Arizona State University (Publisher)

Created2013

Answer set programming and other computing paradigms

Description

Answer Set Programming (ASP) is one of the most prominent and successful knowledge representation paradigms. The success of ASP is due to its expressive non-monotonic modeling language and its efficient computational methods originating from building propositional satisfiability solvers. The wide adoption of ASP has motivated several extensions to its modeling…

Answer Set Programming (ASP) is one of the most prominent and successful knowledge representation paradigms. The success of ASP is due to its expressive non-monotonic modeling language and its efficient computational methods originating from building propositional satisfiability solvers. The wide adoption of ASP has motivated several extensions to its modeling language in order to enhance expressivity, such as incorporating aggregates and interfaces with ontologies. Also, in order to overcome the grounding bottleneck of computation in ASP, there are increasing interests in integrating ASP with other computing paradigms, such as Constraint Programming (CP) and Satisfiability Modulo Theories (SMT). Due to the non-monotonic nature of the ASP semantics, such enhancements turned out to be non-trivial and the existing extensions are not fully satisfactory. We observe that one main reason for the difficulties rooted in the propositional semantics of ASP, which is limited in handling first-order constructs (such as aggregates and ontologies) and functions (such as constraint variables in CP and SMT) in natural ways. This dissertation presents a unifying view on these extensions by viewing them as instances of formulas with generalized quantifiers and intensional functions. We extend the first-order stable model semantics by by Ferraris, Lee, and Lifschitz to allow generalized quantifiers, which cover aggregate, DL-atoms, constraints and SMT theory atoms as special cases. Using this unifying framework, we study and relate different extensions of ASP. We also present a tight integration of ASP with SMT, based on which we enhance action language C+ to handle reasoning about continuous changes. Our framework yields a systematic approach to study and extend non-monotonic languages.

ContributorsMeng, Yunsong (Author) / Lee, Joohyung (Thesis advisor) / Ahn, Gail-Joon (Committee member) / Baral, Chitta (Committee member) / Fainekos, Georgios (Committee member) / Lifschitz, Vladimir (Committee member) / Arizona State University (Publisher)

Created2013

An intelligent co-reference resolver for Winograd schema sentences containing resolved semantic entities

Description

There has been a lot of research in the field of artificial intelligence about thinking machines. Alan Turing proposed a test to observe a machine's intelligent behaviour with respect to natural language conversation. The Winograd schema challenge is suggested as an alternative, to the Turing test. It needs inferencing capabilities,…

There has been a lot of research in the field of artificial intelligence about thinking machines. Alan Turing proposed a test to observe a machine's intelligent behaviour with respect to natural language conversation. The Winograd schema challenge is suggested as an alternative, to the Turing test. It needs inferencing capabilities, reasoning abilities and background knowledge to get the answer right. It involves a coreference resolution task in which a machine is given a sentence containing a situation which involves two entities, one pronoun and some more information about the situation and the machine has to come up with the right resolution of a pronoun to one of the entities. The complexity of the task is increased with the fact that the Winograd sentences are not constrained by one domain or specific sentence structure and it also contains a lot of human proper names. This modification makes the task of association of entities, to one particular word in the sentence, to derive the answer, difficult. I have developed a pronoun resolver system for the confined domain Winograd sentences. I have developed a classifier or filter which takes input sentences and decides to accept or reject them based on a particular criteria. Once the sentence is accepted. I run parsers on it to obtain the detailed analysis. Furthermore I have developed four answering modules which use world knowledge and inferencing mechanisms to try and resolve the pronoun. The four techniques I use are : ConceptNet knowledgebase, Search engine pattern counts,Narrative event chains and sentiment analysis. I have developed a particular aggregation mechanism for the answers from these modules to arrive at a final answer. I have used caching technique for the association relations that I obtain for different modules, so as to boost the performance. I run my system on the standard ‘nyu dataset’ of Winograd sentences and questions. This dataset is then restricted, by my classifier, to 90 sentences. I evaluate my system on this 90 sentence dataset. When I compare my results against the state of the art system on the same dataset, I get nearly 4.5 % improvement in the restricted domain.

ContributorsBudukh, Tejas Ulhas (Author) / Baral, Chitta (Thesis advisor) / VanLehn, Kurt (Committee member) / Davulcu, Hasan (Committee member) / Arizona State University (Publisher)

Created2013

Representing, reasoning and answering questions about biological pathways various applications

Description

Biological organisms are made up of cells containing numerous interconnected biochemical processes. Diseases occur when normal functionality of these processes is disrupted, manifesting as disease symptoms. Thus, understanding these biochemical processes and their interrelationships is a primary task in biomedical research and a prerequisite for activities including diagnosing diseases and…

Biological organisms are made up of cells containing numerous interconnected biochemical processes. Diseases occur when normal functionality of these processes is disrupted, manifesting as disease symptoms. Thus, understanding these biochemical processes and their interrelationships is a primary task in biomedical research and a prerequisite for activities including diagnosing diseases and drug development. Scientists studying these interconnected processes have identified various pathways involved in drug metabolism, diseases, and signal transduction, etc. High-throughput technologies, new algorithms and speed improvements over the last decade have resulted in deeper knowledge about biological systems, leading to more refined pathways. Such pathways tend to be large and complex, making it difficult for an individual to remember all aspects. Thus, computer models are needed to represent and analyze them. The refinement activity itself requires reasoning with a pathway model by posing queries against it and comparing the results against the real biological system. Many existing models focus on structural and/or factoid questions, relying on surface-level information. These are generally not the kind of questions that a biologist may ask someone to test their understanding of biological processes. Examples of questions requiring understanding of biological processes are available in introductory college level biology text books. Such questions serve as a model for the question answering system developed in this thesis. Thus, the main goal of this thesis is to develop a system that allows the encoding of knowledge about biological pathways to answer questions demonstrating understanding of the pathways. To that end, a language is developed to specify a pathway and pose questions against it. Some existing tools are modified and used to accomplish this goal. The utility of the framework developed in this thesis is illustrated with applications in the biological domain. Finally, the question answering system is used in real world applications by extracting pathway knowledge from text and answering questions related to drug development.

ContributorsAnwar, Saadat (Author) / Baral, Chitta (Thesis advisor) / Inoue, Katsumi (Committee member) / Chen, Yi (Committee member) / Davulcu, Hasan (Committee member) / Lee, Joohyung (Committee member) / Arizona State University (Publisher)

Created2014

Bridging the gap between classical logic based formalisms and logic programs

Description

Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency. First-order logic, which is the basis of Description Logics (DLs), is not suitable for defeasible reasoning due to its monotonic nature. The nonmonotonic formalisms that extend first-order logic, such as circumscription…

Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency. First-order logic, which is the basis of Description Logics (DLs), is not suitable for defeasible reasoning due to its monotonic nature. The nonmonotonic formalisms that extend first-order logic, such as circumscription and default logic, are expressive but lack efficient implementations. The nonmonotonic formalisms that are based on the declarative logic programming approach, such as Answer Set Programming (ASP), have efficient implementations but are not expressive enough for representing and reasoning with open domains. This dissertation uses the first-order stable model semantics, which extends both first-order logic and ASP, to relate circumscription to ASP, and to integrate DLs and ASP, thereby partially overcoming the limitations of the formalisms. By exploiting the relationship between circumscription and ASP, well-known action formalisms, such as the situation calculus, the event calculus, and Temporal Action Logics, are reformulated in ASP. The advantages of these reformulations are shown with respect to the generality of the reasoning tasks that can be handled and with respect to the computational efficiency. The integration of DLs and ASP presented in this dissertation provides a framework for integrating rules and ontologies for the semantic web. This framework enables us to perform nonmonotonic reasoning with DL knowledge bases. Observing the need to integrate action theories and ontologies, the above results are used to reformulate the problem of integrating action theories and ontologies as a problem of integrating rules and ontologies, thus enabling us to use the computational tools developed in the context of the latter for the former.

ContributorsPalla, Ravi (Author) / Lee, Joohyung (Thesis advisor) / Baral, Chitta (Committee member) / Kambhampati, Subbarao (Committee member) / Lifschitz, Vladimir (Committee member) / Arizona State University (Publisher)

Created2012

Filtering by