Matching Items (660)
Filtering by

Clear all filters

151471-Thumbnail Image.png
Description
In this dissertation I develop a deep theory of temporal planning well-suited to analyzing, understanding, and improving the state of the art implementations (as of 2012). At face-value the work is strictly theoretical; nonetheless its impact is entirely real and practical. The easiest portion of that impact to highlight concerns

In this dissertation I develop a deep theory of temporal planning well-suited to analyzing, understanding, and improving the state of the art implementations (as of 2012). At face-value the work is strictly theoretical; nonetheless its impact is entirely real and practical. The easiest portion of that impact to highlight concerns the notable improvements to the format of the temporal fragment of the International Planning Competitions (IPCs). Particularly: the theory I expound upon here is the primary cause of--and justification for--the altered (i) selection of benchmark problems, and (ii) notion of "winning temporal planner". For higher level motivation: robotics, web service composition, industrial manufacturing, business process management, cybersecurity, space exploration, deep ocean exploration, and logistics all benefit from applying domain-independent automated planning technique. Naturally, actually carrying out such case studies has much to offer. For example, we may extract the lesson that reasoning carefully about deadlines is rather crucial to planning in practice. More generally, effectively automating specifically temporal planning is well-motivated from applications. Entirely abstractly, the aim is to improve the theory of automated temporal planning by distilling from its practice. My thesis is that the key feature of computational interest is concurrency. To support, I demonstrate by way of compilation methods, worst-case counting arguments, and analysis of algorithmic properties such as completeness that the more immediately pressing computational obstacles (facing would-be temporal generalizations of classical planning systems) can be dealt with in theoretically efficient manner. So more accurately the technical contribution here is to demonstrate: The computationally significant obstacle to automated temporal planning that remains is just concurrency.
ContributorsCushing, William Albemarle (Author) / Kambhampati, Subbarao (Thesis advisor) / Weld, Daniel S. (Committee member) / Smith, David E. (Committee member) / Baral, Chitta (Committee member) / Davalcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2012
151689-Thumbnail Image.png
Description
Sparsity has become an important modeling tool in areas such as genetics, signal and audio processing, medical image processing, etc. Via the penalization of l-1 norm based regularization, the structured sparse learning algorithms can produce highly accurate models while imposing various predefined structures on the data, such as feature groups

Sparsity has become an important modeling tool in areas such as genetics, signal and audio processing, medical image processing, etc. Via the penalization of l-1 norm based regularization, the structured sparse learning algorithms can produce highly accurate models while imposing various predefined structures on the data, such as feature groups or graphs. In this thesis, I first propose to solve a sparse learning model with a general group structure, where the predefined groups may overlap with each other. Then, I present three real world applications which can benefit from the group structured sparse learning technique. In the first application, I study the Alzheimer's Disease diagnosis problem using multi-modality neuroimaging data. In this dataset, not every subject has all data sources available, exhibiting an unique and challenging block-wise missing pattern. In the second application, I study the automatic annotation and retrieval of fruit-fly gene expression pattern images. Combined with the spatial information, sparse learning techniques can be used to construct effective representation of the expression images. In the third application, I present a new computational approach to annotate developmental stage for Drosophila embryos in the gene expression images. In addition, it provides a stage score that enables one to more finely annotate each embryo so that they are divided into early and late periods of development within standard stage demarcations. Stage scores help us to illuminate global gene activities and changes much better, and more refined stage annotations improve our ability to better interpret results when expression pattern matches are discovered between genes.
ContributorsYuan, Lei (Author) / Ye, Jieping (Thesis advisor) / Wang, Yalin (Committee member) / Xue, Guoliang (Committee member) / Kumar, Sudhir (Committee member) / Arizona State University (Publisher)
Created2013
151802-Thumbnail Image.png
Description
The complexity of the systems that software engineers build has continuously grown since the inception of the field. What has not changed is the engineers' mental capacity to operate on about seven distinct pieces of information at a time. The widespread use of UML has led to more abstract software

The complexity of the systems that software engineers build has continuously grown since the inception of the field. What has not changed is the engineers' mental capacity to operate on about seven distinct pieces of information at a time. The widespread use of UML has led to more abstract software design activities, however the same cannot be said for reverse engineering activities. The introduction of abstraction to reverse engineering will allow the engineer to move farther away from the details of the system, increasing his ability to see the role that domain level concepts play in the system. In this thesis, we present a technique that facilitates filtering of classes from existing systems at the source level based on their relationship to concepts in the domain via a classification method using machine learning. We showed that concepts can be identified using a machine learning classifier based on source level metrics. We developed an Eclipse plugin to assist with the process of manually classifying Java source code, and collecting metrics and classifications into a standard file format. We developed an Eclipse plugin to act as a concept identifier that visually indicates a class as a domain concept or not. We minimized the size of training sets to ensure a useful approach in practice. This allowed us to determine that a training set of 7:5 to 10% is nearly as effective as a training set representing 50% of the system. We showed that random selection is the most consistent and effective means of selecting a training set. We found that KNN is the most consistent performer among the learning algorithms tested. We determined the optimal feature set for this classification problem. We discussed two possible structures besides a one to one mapping of domain knowledge to implementation. We showed that classes representing more than one concept are simply concepts at differing levels of abstraction. We also discussed composite concepts representing a domain concept implemented by more than one class. We showed that these composite concepts are difficult to detect because the problem is NP-complete.
ContributorsCarey, Maurice (Author) / Colbourn, Charles (Thesis advisor) / Collofello, James (Thesis advisor) / Davulcu, Hasan (Committee member) / Sarjoughian, Hessam S. (Committee member) / Ye, Jieping (Committee member) / Arizona State University (Publisher)
Created2013
151653-Thumbnail Image.png
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
151785-Thumbnail Image.png
Description
This dissertation explores the role of smart home service provisions (SHSP) as motivational agents supporting goal attainment and human flourishing. Evoking human flourishing as a lens for interaction encapsulates issues of wellbeing, adaptation and problem solving within the context of social interaction. To investigate this line of research a new,

This dissertation explores the role of smart home service provisions (SHSP) as motivational agents supporting goal attainment and human flourishing. Evoking human flourishing as a lens for interaction encapsulates issues of wellbeing, adaptation and problem solving within the context of social interaction. To investigate this line of research a new, motivation-sensitive approach to design was implemented. This approach combined psychometric analysis from motivational psychology's Personal Project Analysis (PPA) and Place Attachment theory's Sense of Place (SoP) analysis to produce project-centered motivational models for environmental congruence. Regression analysis of surveys collected from 150 (n = 150) young adults about their homes revealed PPA motivational dimensions had significant main affects on all three SoP factors. Model one indicated PPA dimensions Fearful and Value Congruency predicted the SoP factor Place Attachment (p = 0.012). Model two indicated the PPA factor Positive Affect and PPA dimensions Value Congruency, Self Identity and Autonomy predicted Place Identity (p = .0003). Model three indicated PPA dimensions Difficulty and Likelihood of Success predicted the SoP factor Place Dependency. The relationships between motivational PPA dimensions and SoP demonstrated in these models informed creation of a set of motivational design heuristics. These heuristics guided 20 participants (n = 20) through co-design of paper prototypes of SHSPs supporting goal attainment and human flourishing. Normative analysis of these paper prototypes fashioned a design framework consisting of the use cases "make with me", "keep me on task" and "improve myself"; the four design principles "time and timing", "guidance and accountability", "project ambiguity" and "positivity mechanisms"; and the seven interaction models "structuring time", "prompt user", "gather resources", "consume content", "create content", "restrict and/or restore access to content" and "share content". This design framework described and evaluated three technology probes installed in the homes of three participants (n = 3) for field-testing over the course of one week. A priori and post priori samples of psychometric measures were inconclusive in determining if SHSP motivated goal attainment or increased environmental congruency between young adults and their homes.
ContributorsBrotman, Ryan Scott (Author) / Burleson, Winsow (Thesis advisor) / Heywood, William (Committee member) / Forlizzi, Jodi (Committee member) / Arizona State University (Publisher)
Created2013
151605-Thumbnail Image.png
Description
In most social networking websites, users are allowed to perform interactive activities. One of the fundamental features that these sites provide is to connecting with users of their kind. On one hand, this activity makes online connections visible and tangible; on the other hand, it enables the exploration of our

In most social networking websites, users are allowed to perform interactive activities. One of the fundamental features that these sites provide is to connecting with users of their kind. On one hand, this activity makes online connections visible and tangible; on the other hand, it enables the exploration of our connections and the expansion of our social networks easier. The aggregation of people who share common interests forms social groups, which are fundamental parts of our social lives. Social behavioral analysis at a group level is an active research area and attracts many interests from the industry. Challenges of my work mainly arise from the scale and complexity of user generated behavioral data. The multiple types of interactions, highly dynamic nature of social networking and the volatile user behavior suggest that these data are complex and big in general. Effective and efficient approaches are required to analyze and interpret such data. My work provide effective channels to help connect the like-minded and, furthermore, understand user behavior at a group level. The contributions of this dissertation are in threefold: (1) proposing novel representation of collective tagging knowledge via tag networks; (2) proposing the new information spreader identification problem in egocentric soical networks; (3) defining group profiling as a systematic approach to understanding social groups. In sum, the research proposes novel concepts and approaches for connecting the like-minded, enables the understanding of user groups, and exposes interesting research opportunities.
ContributorsWang, Xufei (Author) / Liu, Huan (Thesis advisor) / Kambhampati, Subbarao (Committee member) / Sundaram, Hari (Committee member) / Ye, Jieping (Committee member) / Arizona State University (Publisher)
Created2013
151867-Thumbnail Image.png
Description
Automating aspects of biocuration through biomedical information extraction could significantly impact biomedical research by enabling greater biocuration throughput and improving the feasibility of a wider scope. An important step in biomedical information extraction systems is named entity recognition (NER), where mentions of entities such as proteins and diseases are located

Automating aspects of biocuration through biomedical information extraction could significantly impact biomedical research by enabling greater biocuration throughput and improving the feasibility of a wider scope. An important step in biomedical information extraction systems is named entity recognition (NER), where mentions of entities such as proteins and diseases are located within natural-language text and their semantic type is determined. This step is critical for later tasks in an information extraction pipeline, including normalization and relationship extraction. BANNER is a benchmark biomedical NER system using linear-chain conditional random fields and the rich feature set approach. A case study with BANNER locating genes and proteins in biomedical literature is described. The first corpus for disease NER adequate for use as training data is introduced, and employed in a case study of disease NER. The first corpus locating adverse drug reactions (ADRs) in user posts to a health-related social website is also described, and a system to locate and identify ADRs in social media text is created and evaluated. The rich feature set approach to creating NER feature sets is argued to be subject to diminishing returns, implying that additional improvements may require more sophisticated methods for creating the feature set. This motivates the first application of multivariate feature selection with filters and false discovery rate analysis to biomedical NER, resulting in a feature set at least 3 orders of magnitude smaller than the set created by the rich feature set approach. Finally, two novel approaches to NER by modeling the semantics of token sequences are introduced. The first method focuses on the sequence content by using language models to determine whether a sequence resembles entries in a lexicon of entity names or text from an unlabeled corpus more closely. The second method models the distributional semantics of token sequences, determining the similarity between a potential mention and the token sequences from the training data by analyzing the contexts where each sequence appears in a large unlabeled corpus. The second method is shown to improve the performance of BANNER on multiple data sets.
ContributorsLeaman, James Robert (Author) / Gonzalez, Graciela (Thesis advisor) / Baral, Chitta (Thesis advisor) / Cohen, Kevin B (Committee member) / Liu, Huan (Committee member) / Ye, Jieping (Committee member) / Arizona State University (Publisher)
Created2013
151716-Thumbnail Image.png
Description
The rapid escalation of technology and the widespread emergence of modern technological equipments have resulted in the generation of humongous amounts of digital data (in the form of images, videos and text). This has expanded the possibility of solving real world problems using computational learning frameworks. However, while gathering a

The rapid escalation of technology and the widespread emergence of modern technological equipments have resulted in the generation of humongous amounts of digital data (in the form of images, videos and text). This has expanded the possibility of solving real world problems using computational learning frameworks. However, while gathering a large amount of data is cheap and easy, annotating them with class labels is an expensive process in terms of time, labor and human expertise. This has paved the way for research in the field of active learning. Such algorithms automatically select the salient and exemplar instances from large quantities of unlabeled data and are effective in reducing human labeling effort in inducing classification models. To utilize the possible presence of multiple labeling agents, there have been attempts towards a batch mode form of active learning, where a batch of data instances is selected simultaneously for manual annotation. This dissertation is aimed at the development of novel batch mode active learning algorithms to reduce manual effort in training classification models in real world multimedia pattern recognition applications. Four major contributions are proposed in this work: $(i)$ a framework for dynamic batch mode active learning, where the batch size and the specific data instances to be queried are selected adaptively through a single formulation, based on the complexity of the data stream in question, $(ii)$ a batch mode active learning strategy for fuzzy label classification problems, where there is an inherent imprecision and vagueness in the class label definitions, $(iii)$ batch mode active learning algorithms based on convex relaxations of an NP-hard integer quadratic programming (IQP) problem, with guaranteed bounds on the solution quality and $(iv)$ an active matrix completion algorithm and its application to solve several variants of the active learning problem (transductive active learning, multi-label active learning, active feature acquisition and active learning for regression). These contributions are validated on the face recognition and facial expression recognition problems (which are commonly encountered in real world applications like robotics, security and assistive technology for the blind and the visually impaired) and also on collaborative filtering applications like movie recommendation.
ContributorsChakraborty, Shayok (Author) / Panchanathan, Sethuraman (Thesis advisor) / Balasubramanian, Vineeth N. (Committee member) / Li, Baoxin (Committee member) / Mittelmann, Hans (Committee member) / Ye, Jieping (Committee member) / Arizona State University (Publisher)
Created2013
152136-Thumbnail Image.png
Description
Reductive dechlorination by members of the bacterial genus Dehalococcoides is a common and cost-effective avenue for in situ bioremediation of sites contaminated with the chlorinated solvents, trichloroethene (TCE) and perchloroethene (PCE). The overarching goal of my research was to address some of the challenges associated with bioremediation timeframes by improving

Reductive dechlorination by members of the bacterial genus Dehalococcoides is a common and cost-effective avenue for in situ bioremediation of sites contaminated with the chlorinated solvents, trichloroethene (TCE) and perchloroethene (PCE). The overarching goal of my research was to address some of the challenges associated with bioremediation timeframes by improving the rates of reductive dechlorination and the growth of Dehalococcoides in mixed communities. Biostimulation of contaminated sites or microcosms with electron donor fails to consistently promote dechlorination of PCE/TCE beyond cis-dichloroethene (cis-DCE), even when the presence of Dehalococcoides is confirmed. Supported by data from microcosm experiments, I showed that the stalling at cis-DCE is due a H2 competition in which components of the soil or sediment serve as electron acceptors for competing microorganisms. However, once competition was minimized by providing selective enrichment techniques, I illustrated how to obtain both fast rates and high-density Dehalococcoides using three distinct enrichment cultures. Having achieved a heightened awareness of the fierce competition for electron donor, I then identified bicarbonate (HCO3-) as a potential H2 sink for reductive dechlorination. HCO3- is the natural buffer in groundwater but also the electron acceptor for hydrogenotrophic methanogens and homoacetogens, two microbial groups commonly encountered with Dehalococcoides. By testing a range of concentrations in batch experiments, I showed that methanogens are favored at low HCO3 and homoacetogens at high HCO3-. The high HCO3- concentrations increased the H2 demand which negatively affected the rates and extent of dechlorination. By applying the gained knowledge on microbial community management, I ran the first successful continuous stirred-tank reactor (CSTR) at a 3-d hydraulic retention time for cultivation of dechlorinating cultures. I demonstrated that using carefully selected conditions in a CSTR, cultivation of Dehalococcoides at short retention times is feasible, resulting in robust cultures capable of fast dechlorination. Lastly, I provide a systematic insight into the effect of high ammonia on communities involved in dechlorination of chloroethenes. This work documents the potential use of landfill leachate as a substrate for dechlorination and an increased tolerance of Dehalococcoides to high ammonia concentrations (2 g L-1 NH4+-N) without loss of the ability to dechlorinate TCE to ethene.
ContributorsDelgado, Anca Georgiana (Author) / Krajmalnik-Brown, Rosa (Thesis advisor) / Cadillo-Quiroz, Hinsby (Committee member) / Halden, Rolf U. (Committee member) / Rittmann, Bruce E. (Committee member) / Stout, Valerie (Committee member) / Arizona State University (Publisher)
Created2013
152146-Thumbnail Image.png
Description
Human breath is a concoction of thousands of compounds having in it a breath-print of physiological processes in the body. Though breath provides a non-invasive and easy to handle biological fluid, its analysis for clinical diagnosis is not very common. Partly the reason for this absence is unavailability of cost

Human breath is a concoction of thousands of compounds having in it a breath-print of physiological processes in the body. Though breath provides a non-invasive and easy to handle biological fluid, its analysis for clinical diagnosis is not very common. Partly the reason for this absence is unavailability of cost effective and convenient tools for such analysis. Scientific literature is full of novel sensor ideas but it is challenging to develop a working device, which are few. These challenges include trace level detection, presence of hundreds of interfering compounds, excessive humidity, different sampling regulations and personal variability. To meet these challenges as well as deliver a low cost solution, optical sensors based on specific colorimetric chemical reactions on mesoporous membranes have been developed. Sensor hardware utilizing cost effective and ubiquitously available light source (LED) and detector (webcam/photo diodes) has been developed and optimized for sensitive detection. Sample conditioning mouthpiece suitable for portable sensors is developed and integrated. The sensors are capable of communication with mobile phones realizing the idea of m-health for easy personal health monitoring in free living conditions. Nitric oxide and Acetone are chosen as analytes of interest. Nitric oxide levels in the breath correlate with lung inflammation which makes it useful for asthma management. Acetone levels increase during ketosis resulting from fat metabolism in the body. Monitoring breath acetone thus provides useful information to people with type1 diabetes, epileptic children on ketogenic diets and people following fitness plans for weight loss.
ContributorsPrabhakar, Amlendu (Author) / Tao, Nongjian (Thesis advisor) / Forzani, Erica (Committee member) / Lindsay, Stuart (Committee member) / Arizona State University (Publisher)
Created2013