Theses and Dissertations
This collection includes both ASU Theses and Dissertations, submitted by graduate students, and the Barrett, Honors College theses submitted by undergraduate students.
Displaying 1 - 10 of 130
Filtering by
- Resource Type: Text
Description
There is a lack of music therapy services for college students who have problems with depression and/or anxiety. Even among universities and colleges that offer music therapy degrees, there are no known programs offering music therapy to the institution's students. Female college students are particularly vulnerable to depression and anxiety symptoms compared to their male counterparts. Many students who experience mental health problems do not receive treatment, because of lack of knowledge, lack of services, or refusal of treatment. Music therapy is proposed as a reliable and valid complement or even an alternative to traditional counseling and pharmacotherapy because of the appeal of music to young women and the potential for a music therapy group to help isolated students form supportive networks. The present study recruited 14 female university students to participate in a randomized controlled trial of short-term group music therapy to address symptoms of depression and anxiety. The students were randomly divided into either the treatment group or the control group. Over 4 weeks, each group completed surveys related to depression and anxiety. Results indicate that the treatment group's depression and anxiety scores gradually decreased over the span of the treatment protocol. The control group showed either maintenance or slight worsening of depression and anxiety scores. Although none of the results were statistically significant, the general trend indicates that group music therapy was beneficial for the students. A qualitative analysis was also conducted for the treatment group. Common themes were financial concerns, relationship problems, loneliness, and time management/academic stress. All participants indicated that they benefited from the sessions. The group progressed in its cohesion and the participants bonded to the extent that they formed a supportive network which lasted beyond the end of the protocol. The results of this study are by no means conclusive, but do indicate that colleges with music therapy degree programs should consider adding music therapy services for their general student bodies.
ContributorsAshton, Barbara (Author) / Crowe, Barbara J. (Thesis advisor) / Rio, Robin (Committee member) / Davis, Mary (Committee member) / Arizona State University (Publisher)
Created2013
Description
Sometimes difficult life events challenge our existing resources in such a way that routinized responses are inadequate to handle the challenge. Some individuals will persist in habitual, automatic behavior, regardless of environmental cues that indicate a mismatch between coping strategy and the demands of the stressor. Other individuals will marshal adaptive resources to construct new courses of action and reconceptualize the problem, associated goals and/or values. A mixed methods approach was used to describe and operationalize cognitive shift, a relatively unexplored construct in existing literature. The study was conducted using secondary data from a parent multi-year cross-sectional study of resilience with eight hundred mid-aged adults from the Phoenix metro area. Semi-structured telephone interviews were analyzed using a purposive sample (n=136) chosen by type of life event. Participants' beliefs, assumptions, and experiences were examined to understand how they shaped adaptation to adversity. An adaptive mechanism, "cognitive shift," was theorized as the transition from automatic coping to effortful cognitive processes aimed at novel resolution of issues. Aims included understanding when and how cognitive shift emerges and manifests. Cognitive shift was scored as a binary variable and triangulated through correlational and logistic regression analyses. Interaction effects revealed that positive personality attributes influence cognitive shift most when people suffered early adversity. This finding indicates that a certain complexity, self-awareness and flexibility of mind may lead to a greater capacity to find meaning in adversity. This work bridges an acknowledged gap in literature and provides new insights into resilience.
ContributorsRivers, Crystal T (Author) / Zautra, Alex (Thesis advisor) / Davis, Mary (Committee member) / Kurpius, Sharon (Committee member) / Arizona State University (Publisher)
Created2014
Description
Fibromyalgia (FM) is a chronic musculoskeletal disorder characterized by widespread pain, fatigue, and a variety of other comorbid physiological and psychological characteristics, including a deficit of positive affect. Recently, the focus of research on the pathophysiology of FM has considered the role of a number of genomic variants. In the current manuscript, case-control analyses did not support the hypothesis that FM patients would differ from other chronic pain groups in catechol-O-methyltransferase (COMT) and mu-opioid receptor (OPRM1) genotype. However, evidence is provided in support of the hypothesis that functional single nucleotide polymorphisms on the COMT and OPRM1 genes would be associated with risk and resilience, respectively, in a dual processing model of pain-related positive affective regulation in FM. Forty-six female patients with a physician-confirmed diagnosis of FM completed an electronic diary that included once-daily assessments of positive affect and soft tissue pain. Multilevel modeling yielded a significant gene X environment interaction, such that individuals with met/met genotype on COMT experienced a greater decline in positive affect as daily pain increased than did either val/met or val/val individuals. A gene X environment interaction for OPRM1 also emerged, indicating that individuals with at least one asp allele were more resilient to elevations in daily pain than those homozygous for the asn allele. In sum, the findings offer researchers ample reason to further investigate the contribution of the catecholamine and opioid systems, and their associated genomic variants, to the still poorly understood experience of FM.
ContributorsFinan, Patrick Hamilton (Author) / Zautra, Alex (Thesis advisor) / Davis, Mary (Committee member) / Lemery-Chalfant, Kathryn (Committee member) / Presson, Clark (Committee member) / Arizona State University (Publisher)
Created2011
Description
Adverse childhood family environments have been found to have long-term effects on a child's well-being. Although no prior studies have examined the direct effects of childhood family adversities on nighttime blood pressure (BP) dip, parental death and divorce in childhood, have been associated with a variety of related psychological problems in adulthood. The current study examined the direct effects of parental death and divorce in childhood and quality of early family relationships on adult nighttime BP dip as well as the mediating role of three psychosocial factors (depression, hostility and social stress). One hundred and forty-three young adults were asked to complete self-reported measures of the three psychosocial factors and quality of family relationships. Study participants wore an ambulatory blood pressure (ABP) monitor over a 24-hr period in order to assess nocturnal BP dip. Although neither childhood family adversity nor quality of childhood family relationships directly predicted nighttime BP dipping, quality of early family relationships predicted all three psychosocial factors, and hostility was found to mediate the relationship between quality of childhood family relationships and nighttime systolic BP dip. Early family experiences play an important role in influencing nighttime cardiovascular functioning by influencing an individual's psychological functioning in young adulthood. Because nighttime non-dipping has been associated with increased risk for cardiovascular disease and other serious health conditions, the results of the present study have important clinical implications and provide specific psychosocial pathways that may be targeted in future programs designed to prevent and treat cardiovascular disease.
ContributorsTanaka, Rika (Author) / Luecken, Linda J. (Thesis advisor) / Wolchik, Sharlene (Committee member) / Davis, Mary (Committee member) / Arizona State University (Publisher)
Created2012
Description
In rehabilitation settings, activity limitation can be a significant barrier to recovery. This study sought to examine the effects of state and trait level benefit finding, positive affect, and catastrophizing on activity limitation among individuals with a physician-confirmed diagnosis of either Osteoarthritis (OA), Fibromyalgia (FM), or a dual diagnosis of OA/FM. Participants (106 OA, 53 FM, and 101 OA/FM) who had no diagnosed autoimmune disorder, a pain rating above 20 on a 0-100 scale, and no involvement in litigation regarding their condition were recruited in the Phoenix metropolitan area for inclusion in the current study. After initial questionnaires were completed, participants were trained to complete daily diaries on a laptop computer and instructed to do so a half an hour before bed each night for 30 days. In each diary, participants rated their average daily pain, benefit finding, positive affect, catastrophizing, and activity limitation. A single item, "I thought about some of the good things that have come from living with my pain" was used to examine the broader construct of benefit finding. It was hypothesized that state and trait level benefit finding would have a direct relation with activity limitation and a partially mediated relationship, through positive affect. Multilevel modeling with SAS PROC MIXED revealed that benefit finding was not directly related to activity limitation. Increases in benefit finding were associated, however, with decreases in activity limitation through a significant mediated relationship with positive affect. Individuals who benefit find had a higher level of positive affect which was associated with decreased activity limitation. A suppression effect involving pain and benefit finding at the trait level was also found. Pain appeared to increase the predictive validity of the relation of benefit finding to activity limitation. These findings have important implications for rehabilitation psychologists and should embolden clinicians to encourage patients to increase positive affect by employing active approach-oriented coping strategies like benefit finding to reduce activity limitation.
ContributorsKinderdietz, Jeffrey Scott (Author) / Zautra, Alex (Thesis advisor) / Davis, Mary (Committee member) / Barrera, Manuel (Committee member) / Okun, Morris (Committee member) / Arizona State University (Publisher)
Created2012
Description
In a collaborative environment where multiple robots and human beings are expected
to collaborate to perform a task, it becomes essential for a robot to be aware of multiple
agents working in its work environment. A robot must also learn to adapt to
different agents in the workspace and conduct its interaction based on the presence
of these agents. A theoretical framework was introduced which performs interaction
learning from demonstrations in a two-agent work environment, and it is called
Interaction Primitives.
This document is an in-depth description of the new state of the art Python
Framework for Interaction Primitives between two agents in a single as well as multiple
task work environment and extension of the original framework in a work environment
with multiple agents doing a single task. The original theory of Interaction
Primitives has been extended to create a framework which will capture correlation
between more than two agents while performing a single task. The new state of the
art Python framework is an intuitive, generic, easy to install and easy to use python
library which can be applied to use the Interaction Primitives framework in a work
environment. This library was tested in simulated environments and controlled laboratory
environment. The results and benchmarks of this library are available in the
related sections of this document.
to collaborate to perform a task, it becomes essential for a robot to be aware of multiple
agents working in its work environment. A robot must also learn to adapt to
different agents in the workspace and conduct its interaction based on the presence
of these agents. A theoretical framework was introduced which performs interaction
learning from demonstrations in a two-agent work environment, and it is called
Interaction Primitives.
This document is an in-depth description of the new state of the art Python
Framework for Interaction Primitives between two agents in a single as well as multiple
task work environment and extension of the original framework in a work environment
with multiple agents doing a single task. The original theory of Interaction
Primitives has been extended to create a framework which will capture correlation
between more than two agents while performing a single task. The new state of the
art Python framework is an intuitive, generic, easy to install and easy to use python
library which can be applied to use the Interaction Primitives framework in a work
environment. This library was tested in simulated environments and controlled laboratory
environment. The results and benchmarks of this library are available in the
related sections of this document.
ContributorsKumar, Ashish, M.S (Author) / Amor, Hani Ben (Thesis advisor) / Zhang, Yu (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)
Created2017
Description
Computer Vision as a eld has gone through signicant changes in the last decade.
The eld has seen tremendous success in designing learning systems with hand-crafted
features and in using representation learning to extract better features. In this dissertation
some novel approaches to representation learning and task learning are studied.
Multiple-instance learning which is generalization of supervised learning, is one
example of task learning that is discussed. In particular, a novel non-parametric k-
NN-based multiple-instance learning is proposed, which is shown to outperform other
existing approaches. This solution is applied to a diabetic retinopathy pathology
detection problem eectively.
In cases of representation learning, generality of neural features are investigated
rst. This investigation leads to some critical understanding and results in feature
generality among datasets. The possibility of learning from a mentor network instead
of from labels is then investigated. Distillation of dark knowledge is used to eciently
mentor a small network from a pre-trained large mentor network. These studies help
in understanding representation learning with smaller and compressed networks.
The eld has seen tremendous success in designing learning systems with hand-crafted
features and in using representation learning to extract better features. In this dissertation
some novel approaches to representation learning and task learning are studied.
Multiple-instance learning which is generalization of supervised learning, is one
example of task learning that is discussed. In particular, a novel non-parametric k-
NN-based multiple-instance learning is proposed, which is shown to outperform other
existing approaches. This solution is applied to a diabetic retinopathy pathology
detection problem eectively.
In cases of representation learning, generality of neural features are investigated
rst. This investigation leads to some critical understanding and results in feature
generality among datasets. The possibility of learning from a mentor network instead
of from labels is then investigated. Distillation of dark knowledge is used to eciently
mentor a small network from a pre-trained large mentor network. These studies help
in understanding representation learning with smaller and compressed networks.
ContributorsVenkatesan, Ragav (Author) / Li, Baoxin (Thesis advisor) / Turaga, Pavan (Committee member) / Yang, Yezhou (Committee member) / Davulcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2017
Description
With the rise of the Big Data Era, an exponential amount of network data is being generated at an unprecedented rate across a wide-range of high impact micro and macro areas of research---from protein interaction to social networks. The critical challenge is translating this large scale network data into actionable information.
A key task in the data translation is the analysis of network connectivity via marked nodes---the primary focus of our research. We have developed a framework for analyzing network connectivity via marked nodes in large scale graphs, utilizing novel algorithms in three interrelated areas: (1) analysis of a single seed node via it’s ego-centric network (AttriPart algorithm); (2) pathway identification between two seed nodes (K-Simple Shortest Paths Multithreaded and Search Reduced (KSSPR) algorithm); and (3) tree detection, defining the interaction between three or more seed nodes (Shortest Path MST algorithm).
In an effort to address both fundamental and applied research issues, we have developed the LocalForcasting algorithm to explore how network connectivity analysis can be applied to local community evolution and recommender systems. The goal is to apply the LocalForecasting algorithm to various domains---e.g., friend suggestions in social networks or future collaboration in co-authorship networks. This algorithm utilizes link prediction in combination with the AttriPart algorithm to predict future connections in local graph partitions.
Results show that our proposed AttriPart algorithm finds up to 1.6x denser local partitions, while running approximately 43x faster than traditional local partitioning techniques (PageRank-Nibble). In addition, our LocalForecasting algorithm demonstrates a significant improvement in the number of nodes and edges correctly predicted over baseline methods. Furthermore, results for the KSSPR algorithm demonstrate a speed-up of up to 2.5x the standard k-simple shortest paths algorithm.
A key task in the data translation is the analysis of network connectivity via marked nodes---the primary focus of our research. We have developed a framework for analyzing network connectivity via marked nodes in large scale graphs, utilizing novel algorithms in three interrelated areas: (1) analysis of a single seed node via it’s ego-centric network (AttriPart algorithm); (2) pathway identification between two seed nodes (K-Simple Shortest Paths Multithreaded and Search Reduced (KSSPR) algorithm); and (3) tree detection, defining the interaction between three or more seed nodes (Shortest Path MST algorithm).
In an effort to address both fundamental and applied research issues, we have developed the LocalForcasting algorithm to explore how network connectivity analysis can be applied to local community evolution and recommender systems. The goal is to apply the LocalForecasting algorithm to various domains---e.g., friend suggestions in social networks or future collaboration in co-authorship networks. This algorithm utilizes link prediction in combination with the AttriPart algorithm to predict future connections in local graph partitions.
Results show that our proposed AttriPart algorithm finds up to 1.6x denser local partitions, while running approximately 43x faster than traditional local partitioning techniques (PageRank-Nibble). In addition, our LocalForecasting algorithm demonstrates a significant improvement in the number of nodes and edges correctly predicted over baseline methods. Furthermore, results for the KSSPR algorithm demonstrate a speed-up of up to 2.5x the standard k-simple shortest paths algorithm.
ContributorsFreitas, Scott (Author) / Tong, Hanghang (Thesis advisor) / Maciejewski, Ross (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)
Created2018
Description
The performance of most of the visual computing tasks depends on the quality of the features extracted from the raw data. Insightful feature representation increases the performance of many learning algorithms by exposing the underlying explanatory factors of the output for the unobserved input. A good representation should also handle anomalies in the data such as missing samples and noisy input caused by the undesired, external factors of variation. It should also reduce the data redundancy. Over the years, many feature extraction processes have been invented to produce good representations of raw images and videos.
The feature extraction processes can be categorized into three groups. The first group contains processes that are hand-crafted for a specific task. Hand-engineering features requires the knowledge of domain experts and manual labor. However, the feature extraction process is interpretable and explainable. Next group contains the latent-feature extraction processes. While the original feature lies in a high-dimensional space, the relevant factors for a task often lie on a lower dimensional manifold. The latent-feature extraction employs hidden variables to expose the underlying data properties that cannot be directly measured from the input. Latent features seek a specific structure such as sparsity or low-rank into the derived representation through sophisticated optimization techniques. The last category is that of deep features. These are obtained by passing raw input data with minimal pre-processing through a deep network. Its parameters are computed by iteratively minimizing a task-based loss.
In this dissertation, I present four pieces of work where I create and learn suitable data representations. The first task employs hand-crafted features to perform clinically-relevant retrieval of diabetic retinopathy images. The second task uses latent features to perform content-adaptive image enhancement. The third task ranks a pair of images based on their aestheticism. The goal of the last task is to capture localized image artifacts in small datasets with patch-level labels. For both these tasks, I propose novel deep architectures and show significant improvement over the previous state-of-art approaches. A suitable combination of feature representations augmented with an appropriate learning approach can increase performance for most visual computing tasks.
The feature extraction processes can be categorized into three groups. The first group contains processes that are hand-crafted for a specific task. Hand-engineering features requires the knowledge of domain experts and manual labor. However, the feature extraction process is interpretable and explainable. Next group contains the latent-feature extraction processes. While the original feature lies in a high-dimensional space, the relevant factors for a task often lie on a lower dimensional manifold. The latent-feature extraction employs hidden variables to expose the underlying data properties that cannot be directly measured from the input. Latent features seek a specific structure such as sparsity or low-rank into the derived representation through sophisticated optimization techniques. The last category is that of deep features. These are obtained by passing raw input data with minimal pre-processing through a deep network. Its parameters are computed by iteratively minimizing a task-based loss.
In this dissertation, I present four pieces of work where I create and learn suitable data representations. The first task employs hand-crafted features to perform clinically-relevant retrieval of diabetic retinopathy images. The second task uses latent features to perform content-adaptive image enhancement. The third task ranks a pair of images based on their aestheticism. The goal of the last task is to capture localized image artifacts in small datasets with patch-level labels. For both these tasks, I propose novel deep architectures and show significant improvement over the previous state-of-art approaches. A suitable combination of feature representations augmented with an appropriate learning approach can increase performance for most visual computing tasks.
ContributorsChandakkar, Parag Shridhar (Author) / Li, Baoxin (Thesis advisor) / Yang, Yezhou (Committee member) / Turaga, Pavan (Committee member) / Davulcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2017
Description
Topological methods for data analysis present opportunities for enforcing certain invariances of broad interest in computer vision: including view-point in activity analysis, articulation in shape analysis, and measurement invariance in non-linear dynamical modeling. The increasing success of these methods is attributed to the complementary information that topology provides, as well as availability of tools for computing topological summaries such as persistence diagrams. However, persistence diagrams are multi-sets of points and hence it is not straightforward to fuse them with features used for contemporary machine learning tools like deep-nets. In this paper theoretically well-grounded approaches to develop novel perturbation robust topological representations are presented, with the long-term view of making them amenable to fusion with contemporary learning architectures. The proposed representation lives on a Grassmann manifold and hence can be efficiently used in machine learning pipelines.
The proposed representation.The efficacy of the proposed descriptor was explored on three applications: view-invariant activity analysis, 3D shape analysis, and non-linear dynamical modeling. Favorable results in both high-level recognition performance and improved performance in reduction of time-complexity when compared to other baseline methods are obtained.
The proposed representation.The efficacy of the proposed descriptor was explored on three applications: view-invariant activity analysis, 3D shape analysis, and non-linear dynamical modeling. Favorable results in both high-level recognition performance and improved performance in reduction of time-complexity when compared to other baseline methods are obtained.
ContributorsThopalli, Kowshik (Author) / Turaga, Pavan Kumar (Thesis advisor) / Papandreou-Suppappola, Antonia (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)
Created2017