Matching Items (113)
151718-Thumbnail Image.png
Description
The increasing popularity of Twitter renders improved trustworthiness and relevance assessment of tweets much more important for search. However, given the limitations on the size of tweets, it is hard to extract measures for ranking from the tweet's content alone. I propose a method of ranking tweets by generating a

The increasing popularity of Twitter renders improved trustworthiness and relevance assessment of tweets much more important for search. However, given the limitations on the size of tweets, it is hard to extract measures for ranking from the tweet's content alone. I propose a method of ranking tweets by generating a reputation score for each tweet that is based not just on content, but also additional information from the Twitter ecosystem that consists of users, tweets, and the web pages that tweets link to. This information is obtained by modeling the Twitter ecosystem as a three-layer graph. The reputation score is used to power two novel methods of ranking tweets by propagating the reputation over an agreement graph based on tweets' content similarity. Additionally, I show how the agreement graph helps counter tweet spam. An evaluation of my method on 16~million tweets from the TREC 2011 Microblog Dataset shows that it doubles the precision over baseline Twitter Search and achieves higher precision than current state of the art method. I present a detailed internal empirical evaluation of RAProp in comparison to several alternative approaches proposed by me, as well as external evaluation in comparison to the current state of the art method.
ContributorsRavikumar, Srijith (Author) / Kambhampati, Subbarao (Thesis advisor) / Davulcu, Hasan (Committee member) / Liu, Huan (Committee member) / Arizona State University (Publisher)
Created2013
152215-Thumbnail Image.png
Description
As the desire for innovation increases, individuals and companies seek reliable ways to encourage their creative side. There are many office superstitions about how creativity works, but few are based on psychological science and even fewer have been tested empirically. One of the most prevalent superstitions is the use of

As the desire for innovation increases, individuals and companies seek reliable ways to encourage their creative side. There are many office superstitions about how creativity works, but few are based on psychological science and even fewer have been tested empirically. One of the most prevalent superstitions is the use of objects to inspire creativity or even make a creative room. It is important to test this kind of notion so workplaces can find reliable ways to be innovative, but also because psychology lacks a breadth of literature on how environmental cues interact with people to shape their mental state. This experiment seeks to examine those gaps and fill in the next steps needed for examining at how multiple objects prime creativity. Participants completed two creativity tasks: one for idea generation and one that relies on insight problem solving, the Remote Association Task. There were four priming conditions that relied on objects: a zero object condition, a four neutral (office) objects condition, a single artistic object condition, and finally a four artistic objects condition. There were no differences found between groups for either type of task or in mood or artistic experience. The number of years a participant spent in the United States, however, did correlate with mood, idea generation scores, and insight problem scores. This potentially demonstrates that performance on idea generation and insight tasks rely on the tasks created and culture.
ContributorsJariwala, Shree (Author) / Branaghan, Russell (Thesis advisor) / Cooke, Nancy J. (Committee member) / Song, Hyunjin (Committee member) / Arizona State University (Publisher)
Created2013
152158-Thumbnail Image.png
Description
Most data cleaning systems aim to go from a given deterministic dirty database to another deterministic but clean database. Such an enterprise pre–supposes that it is in fact possible for the cleaning process to uniquely recover the clean versions of each dirty data tuple. This is not possible in many

Most data cleaning systems aim to go from a given deterministic dirty database to another deterministic but clean database. Such an enterprise pre–supposes that it is in fact possible for the cleaning process to uniquely recover the clean versions of each dirty data tuple. This is not possible in many cases, where the most a cleaning system can do is to generate a (hopefully small) set of clean candidates for each dirty tuple. When the cleaning system is required to output a deterministic database, it is forced to pick one clean candidate (say the "most likely" candidate) per tuple. Such an approach can lead to loss of information. For example, consider a situation where there are three equally likely clean candidates of a dirty tuple. An appealing alternative that avoids such an information loss is to abandon the requirement that the output database be deterministic. In other words, even though the input (dirty) database is deterministic, I allow the reconstructed database to be probabilistic. Although such an approach does avoid the information loss, it also brings forth several challenges. For example, how many alternatives should be kept per tuple in the reconstructed database? Maintaining too many alternatives increases the size of the reconstructed database, and hence the query processing time. Second, while processing queries on the probabilistic database may well increase recall, how would they affect the precision of the query processing? In this thesis, I investigate these questions. My investigation is done in the context of a data cleaning system called BayesWipe that has the capability of producing multiple clean candidates per each dirty tuple, along with the probability that they are the correct cleaned version. I represent these alternatives as tuples in a tuple disjoint probabilistic database, and use the Mystiq system to process queries on it. This probabilistic reconstruction (called BayesWipe–PDB) is compared to a deterministic reconstruction (called BayesWipe–DET)—where the most likely clean candidate for each tuple is chosen, and the rest of the alternatives discarded.
ContributorsRihan, Preet Inder Singh (Author) / Kambhampati, Subbarao (Thesis advisor) / Liu, Huan (Committee member) / Davulcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2013
151325-Thumbnail Image.png
Description
As technology enhances our communication capabilities, the number of distributed teams has risen in both public and private sectors. There is no doubt that these technological advancements have addressed a need for communication and collaboration of distributed teams. However, is all technology useful for effective collaboration? Are some methods (modalities)

As technology enhances our communication capabilities, the number of distributed teams has risen in both public and private sectors. There is no doubt that these technological advancements have addressed a need for communication and collaboration of distributed teams. However, is all technology useful for effective collaboration? Are some methods (modalities) of communication more conducive than others to effective performance and collaboration of distributed teams? Although previous literature identifies some differences in modalities, there is little research on geographically distributed mobile teams (DMTs) performing a collaborative task. To investigate communication and performance in this context, I developed the GeoCog system. This system is a mobile communications and collaboration platform enabling small, distributed teams of three to participate in a variant of the military-inspired game, "Capture the Flag". Within the task, teams were given one hour to complete as many "captures" as possible while utilizing resources to the advantage of the team. In this experiment, I manipulated the modality of communication across three conditions with text-based messaging only, vocal communication only, and a combination of the two conditions. It was hypothesized that bi-modal communication would yield superior performance compared to either single modality conditions. Results indicated that performance was not affected by modality. Further results, including communication analysis, are discussed within this paper.
ContributorsChampion, Michael (Author) / Cooke, Nancy J. (Thesis advisor) / Shope, Steven (Committee member) / Wu, Bing (Committee member) / Arizona State University (Publisher)
Created2012
150534-Thumbnail Image.png
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
151015-Thumbnail Image.png
Description
Fixed-pointer moving-scale tape displays are a compact way to present wide range dynamic data, and are commonly employed in aircraft and spacecraft to display the primary parameters of airspeed, altitude and heading. A limitation of the moving tape format is its inability to natively display off scale target, reference or

Fixed-pointer moving-scale tape displays are a compact way to present wide range dynamic data, and are commonly employed in aircraft and spacecraft to display the primary parameters of airspeed, altitude and heading. A limitation of the moving tape format is its inability to natively display off scale target, reference or 'bug' values. The hypothesis tested was that a non-linear fisheye presentation (made possible by modern display technology) would maintain the essential functionality and compactness of existing moving tape displays while increasing situational awareness by ecologically displaying a wider set of reference values. Experimentation showed that the speed and accuracy of reading the center system value was not significantly changed with two types of expanded range displays. The limited situational awareness tests did not show a significant improvement with the new displays, but since no functionality was degraded further testing of expanded range displays may be productive.
ContributorsEnglish, Dave (Author) / Branaghan, Russell J (Thesis advisor) / Cooke, Nancy J. (Committee member) / Sanchez, Christopher A (Committee member) / Arizona State University (Publisher)
Created2012
151053-Thumbnail Image.png
Description
Research on priming has shown that a stimulus can cause people to behave according to the stereotype held about the stimulus. Two experiments were conducted in which the effects of elderly priming were tested by use of a driving simulator. In both experiments, participants drove through a simulated world guided

Research on priming has shown that a stimulus can cause people to behave according to the stereotype held about the stimulus. Two experiments were conducted in which the effects of elderly priming were tested by use of a driving simulator. In both experiments, participants drove through a simulated world guided by either an elderly or a younger female voice. The voices told the participants where to make each of six turns. Both experiments yielded slower driving speeds in the elderly voice condition. The effect was universal regardless of implicit and explicit attitudes towards elderly people.
ContributorsFoster, L Bryant (Author) / Branaghan, Russell (Thesis advisor) / Becker, David (Committee member) / Cooke, Nancy J. (Committee member) / Arizona State University (Publisher)
Created2012
151060-Thumbnail Image.png
Description
By extracting communication sequences from audio data collected during two separate five-person mission-planning tasks, interaction patterns in team communication were analyzed using a recurrence-based, nonlinear dynamics approach. These methods, previously successful in detecting pattern change in a three-person team task, were evaluated for their applicability to larger team settings, and

By extracting communication sequences from audio data collected during two separate five-person mission-planning tasks, interaction patterns in team communication were analyzed using a recurrence-based, nonlinear dynamics approach. These methods, previously successful in detecting pattern change in a three-person team task, were evaluated for their applicability to larger team settings, and their ability to detect pattern change when team members switched roles or locations partway through the study (Study 1) or change in patterns over time (Study 2). Both traditional interaction variables (Talking Time, Co-Talking Time, and Sequence Length of Interactions) and dynamic interaction variables (Recurrence Rate, Determinism, and Pattern Information) were explored as indicators and predictors of changes in team structure and performance. Results from these analyses provided support that both traditional and dynamic interaction variables reflect some changes in team structure and performance. However, changes in communication patterns were not detected. Because simultaneous conversations are possible in larger teams, but not detectable through our communication sequence methods, team pattern changes may not be visible in communication sequences for larger teams. This suggests that these methods may not be applicable for larger teams, or in situations where simultaneous conversations may occur. Further research is needed to continue to explore the applicability of recurrence-based nonlinear dynamics in the analysis of team communication.
ContributorsFouse, Shannon (Author) / Cooke, Nancy J. (Thesis advisor) / Becker, David (Thesis advisor) / Gorman, Jamie (Committee member) / Arizona State University (Publisher)
Created2012
150680-Thumbnail Image.png
Description
There have been conflicting accounts of animation's facilitation in learning from instructional media, being at best no different if not hindering performance. Procedural motor learning represents one of the few the areas in which animations have shown to be facilitative. These studies examine the effects of instructional media (animation vs.

There have been conflicting accounts of animation's facilitation in learning from instructional media, being at best no different if not hindering performance. Procedural motor learning represents one of the few the areas in which animations have shown to be facilitative. These studies examine the effects of instructional media (animation vs. static), rotation (facing vs. over the shoulder) and spatial abilities (low vs. high spatial abilities) on two procedural motor tasks, knot tying and endoscope reprocessing. Results indicate that for all conditions observed in which participants engaged in procedural motor learning tasks, performance was significantly improved with animations over static images. Further, performance was greater for rotations of instructional media that did not require participants to perform a mental rotation under some circumstances. Interactions between Media x Rotation suggest that media that was animated and did not require a participant to mentally rotate led to improved performance. Individual spatial abilities were found to influence total steps correct and total number of errors made in the knot tying task, but this was not observed in the endoscope task. These findings have implications for the design of instructional media for procedural motor tasks and provide strong support for the usage of animations in this context.
ContributorsGarland, T. B (Author) / Sanchez, Chris A (Thesis advisor) / Cooke, Nancy J. (Committee member) / Branaghan, Russel (Committee member) / Arizona State University (Publisher)
Created2012
151144-Thumbnail Image.png
Description
Automated planning problems classically involve finding a sequence of actions that transform an initial state to some state satisfying a conjunctive set of goals with no temporal constraints. But in many real-world problems, the best plan may involve satisfying only a subset of goals or missing defined goal deadlines. For

Automated planning problems classically involve finding a sequence of actions that transform an initial state to some state satisfying a conjunctive set of goals with no temporal constraints. But in many real-world problems, the best plan may involve satisfying only a subset of goals or missing defined goal deadlines. For example, this may be required when goals are logically conflicting, or when there are time or cost constraints such that achieving all goals on time may be too expensive. In this case, goals and deadlines must be declared as soft. I call these partial satisfaction planning (PSP) problems. In this work, I focus on particular types of PSP problems, where goals are given a quantitative value based on whether (or when) they are achieved. The objective is to find a plan with the best quality. A first challenge is in finding adequate goal representations that capture common types of goal achievement rewards and costs. One popular representation is to give a single reward on each goal of a planning problem. I further expand on this approach by allowing users to directly introduce utility dependencies, providing for changes of goal achievement reward directly based on the goals a plan achieves. After, I introduce time-dependent goal costs, where a plan incurs penalty if it will achieve a goal past a specified deadline. To solve PSP problems with goal utility dependencies, I look at using state-of-the-art methodologies currently employed for classical planning problems involving heuristic search. In doing so, one faces the challenge of simultaneously determining the best set of goals and plan to achieve them. This is complicated by utility dependencies defined by a user and cost dependencies within the plan. To address this, I introduce a set of heuristics based on combinations using relaxed plans and integer programming formulations. Further, I explore an approach to improve search through learning techniques by using automatically generated state features to find new states from which to search. Finally, the investigation into handling time-dependent goal costs leads us to an improved search technique derived from observations based on solving discretized approximations of cost functions.
ContributorsBenton, J (Author) / Kambhampati, Subbarao (Thesis advisor) / Baral, Chitta (Committee member) / Do, Minh B. (Committee member) / Smith, David E. (Committee member) / Langley, Pat (Committee member) / Arizona State University (Publisher)
Created2012