Matching Items (5)
Filtering by
- All Subjects: Querying (Computer science)
- All Subjects: Interfaces
- Creators: Sundaram, Hari
- Creators: Dhamdhere, Ajit
Description
Our research focuses on finding answers through decentralized search, for complex, imprecise queries (such as "Which is the best hair salon nearby?") in situations where there is a spatiotemporal constraint (say answer needs to be found within 15 minutes) associated with the query. In general, human networks are good in answering imprecise queries. We try to use the social network of a person to answer his query. Our research aims at designing a framework that exploits the user's social network in order to maximize the answers for a given query. Exploiting an user's social network has several challenges. The major challenge is that the user's immediate social circle may not possess the answer for the given query, and hence the framework designed needs to carry out the query diffusion process across the network. The next challenge involves in finding the right set of seeds to pass the query to in the user's social circle. One other challenge is to incentivize people in the social network to respond to the query and thereby maximize the quality and quantity of replies. Our proposed framework is a mobile application where an individual can either respond to the query or forward it to his friends. We simulated the query diffusion process in three types of graphs: Small World, Random and Preferential Attachment. Given a type of network and a particular query, we carried out the query diffusion by selecting seeds based on attributes of the seed. The main attributes are Topic relevance, Replying or Forwarding probability and Time to Respond. We found that there is a considerable increase in the number of replies attained, even without saturating the user's network, if we adopt an optimal seed selection process. We found the output of the optimal algorithm to be satisfactory as the number of replies received at the interrogator's end was close to three times the number of neighbors an interrogator has. We addressed the challenge of incentivizing people to respond by associating a particular amount of points for each query asked, and awarding the same to people involved in answering the query. Thus, we aim to design a mobile application based on our proposed framework so that it helps in maximizing the replies for the interrogator's query by diffusing the query across his/her social network.
ContributorsSwaminathan, Neelakantan (Author) / Sundaram, Hari (Thesis advisor) / Davulcu, Hasan (Thesis advisor) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2013
Description
The wide adoption and continued advancement of information and communications technologies (ICT) have made it easier than ever for individuals and groups to stay connected over long distances. These advances have greatly contributed in dramatically changing the dynamics of the modern day workplace to the point where it is now commonplace to see large, distributed multidisciplinary teams working together on a daily basis. However, in this environment, motivating, understanding, and valuing the diverse contributions of individual workers in collaborative enterprises becomes challenging. To address these issues, this thesis presents the goals, design, and implementation of Taskville, a distributed workplace game played by teams on large, public displays. Taskville uses a city building metaphor to represent the completion of individual and group tasks within an organization. Promising results from two usability studies and two longitudinal studies at a multidisciplinary school demonstrate that Taskville supports personal reflection and improves team awareness through an engaging workplace activity.
ContributorsNikkila, Shawn (Author) / Sundaram, Hari (Thesis advisor) / Byrne, Daragh (Committee member) / Davulcu, Hasan (Committee member) / Olson, Loren (Committee member) / Arizona State University (Publisher)
Created2013
Description
Online social networks, including Twitter, have expanded in both scale and diversity of content, which has created significant challenges to the average user. These challenges include finding relevant information on a topic and building social ties with like-minded individuals. The fundamental question addressed by this thesis is if an individual can leverage social network to search for information that is relevant to him or her. We propose to answer this question by developing computational algorithms that analyze a user's social network. The features of the social network we analyze include the network topology and member communications of a specific user's social network. Determining the "social value" of one's contacts is a valuable outcome of this research. The algorithms we developed were tested on Twitter, which is an extremely popular social network. Twitter was chosen due to its popularity and a majority of the communications artifacts on Twitter is publically available. In this work, the social network of a user refers to the "following relationship" social network. Our algorithm is not specific to Twitter, and is applicable to other social networks, where the network topology and communications are accessible. My approaches are as follows. For a user interested in using the system, I first determine the immediate social network of the user as well as the social contacts for each person in this network. Afterwards, I establish and extend the social network for each user. For each member of the social network, their tweet data are analyzed and represented by using a word distribution. To accomplish this, I use WordNet, a popular lexical database, to determine semantic similarity between two words. My mechanism of search combines both communication distance between two users and social relationships to determine the search results. Additionally, I developed a search interface, where a user can interactively query the system. I conducted preliminary user study to evaluate the quality and utility of my method and system against several baseline methods, including the default Twitter search. The experimental results from the user study indicate that my method is able to find relevant people and identify valuable contacts in one's social circle based on the query. The proposed system outperforms baseline methods in terms of standard information retrieval metrics.
ContributorsXu, Ke (Author) / Sundaram, Hari (Thesis advisor) / Ye, Jieping (Committee member) / Kelliher, Aisling (Committee member) / Arizona State University (Publisher)
Created2010
Efficient processing of skyline queries on static data sources, data streams and incomplete datasets
Description
Skyline queries extract interesting points that are non-dominated and help paint the bigger picture of the data in question. They are valuable in many multi-criteria decision applications and are becoming a staple of decision support systems.
An assumption commonly made by many skyline algorithms is that a skyline query is applied to a single static data source or data stream. Unfortunately, this assumption does not hold in many applications in which a skyline query may involve attributes belonging to multiple data sources and requires a join operation to be performed before the skyline can be produced. Recently, various skyline-join algorithms have been proposed to address this problem in the context of static data sources. However, these algorithms suffer from several drawbacks: they often need to scan the data sources exhaustively to obtain the skyline-join results; moreover, the pruning techniques employed to eliminate tuples are largely based on expensive tuple-to-tuple comparisons. On the other hand, most data stream techniques focus on single stream skyline queries, thus rendering them unsuitable for skyline-join queries.
Another assumption typically made by most of the earlier skyline algorithms is that the data is complete and all skyline attribute values are available. Due to this constraint, these algorithms cannot be applied to incomplete data sources in which some of the attribute values are missing and are represented by NULL values. There exists a definition of dominance for incomplete data, but this leads to undesirable consequences such as non-transitive and cyclic dominance relations both of which are detrimental to skyline processing.
Based on the aforementioned observations, the main goal of the research described in this dissertation is the design and development of a framework of skyline operators that effectively handles three distinct types of skyline queries: 1) skyline-join queries on static data sources, 2) skyline-window-join queries over data streams, and 3) strata-skyline queries on incomplete datasets. This dissertation presents the unique challenges posed by these skyline queries and addresses the shortcomings of current skyline techniques by proposing efficient methods to tackle the added overhead in processing skyline queries on static data sources, data streams, and incomplete datasets.
An assumption commonly made by many skyline algorithms is that a skyline query is applied to a single static data source or data stream. Unfortunately, this assumption does not hold in many applications in which a skyline query may involve attributes belonging to multiple data sources and requires a join operation to be performed before the skyline can be produced. Recently, various skyline-join algorithms have been proposed to address this problem in the context of static data sources. However, these algorithms suffer from several drawbacks: they often need to scan the data sources exhaustively to obtain the skyline-join results; moreover, the pruning techniques employed to eliminate tuples are largely based on expensive tuple-to-tuple comparisons. On the other hand, most data stream techniques focus on single stream skyline queries, thus rendering them unsuitable for skyline-join queries.
Another assumption typically made by most of the earlier skyline algorithms is that the data is complete and all skyline attribute values are available. Due to this constraint, these algorithms cannot be applied to incomplete data sources in which some of the attribute values are missing and are represented by NULL values. There exists a definition of dominance for incomplete data, but this leads to undesirable consequences such as non-transitive and cyclic dominance relations both of which are detrimental to skyline processing.
Based on the aforementioned observations, the main goal of the research described in this dissertation is the design and development of a framework of skyline operators that effectively handles three distinct types of skyline queries: 1) skyline-join queries on static data sources, 2) skyline-window-join queries over data streams, and 3) strata-skyline queries on incomplete datasets. This dissertation presents the unique challenges posed by these skyline queries and addresses the shortcomings of current skyline techniques by proposing efficient methods to tackle the added overhead in processing skyline queries on static data sources, data streams, and incomplete datasets.
ContributorsNagendra, Mithila (Author) / Candan, Kasim Selcuk (Thesis advisor) / Chen, Yi (Committee member) / Davulcu, Hasan (Committee member) / Silva, Yasin N. (Committee member) / Sundaram, Hari (Committee member) / Arizona State University (Publisher)
Created2014
Description
Multifunctional oxide thin-films grown on silicon and several oxide substrates have been characterized using High Resolution (Scanning) Transmission Electron Microscopy (HRTEM), Energy-Dispersive X-ray Spectroscopy (EDX), and Electron Energy-Loss Spectroscopy (EELS). Oxide thin films grown on SrTiO3/Si pseudo-substrate showed the presence of amorphised SrTiO3 (STO) at the STO/Si interface. Oxide/oxide interfaces were observed to be atomically clean with very few defects.
Al-doped SrTiO3 thin films grown on Si were of high crystalline quality. The Ti/O ratio estimated from EELS line scans revealed that substitution of Ti by Al created associated O vacancies. The strength of the crystal field in STO was measured using EELS, and decreased by ~1.0 eV as Ti4+ was substituted by Al3+. The damping of O-K EELS peaks confirmed the rise in oxygen vacancies. For Co-substituted STO films grown on Si, the EDS and EELS spectra across samples showed Co doping was quite random. The substitution of Ti4+ with Co3+ or Co2+ created associated oxygen vacancies for charge balance. Presence of oxygen vacancies was also confirmed by shift of Ti-L EELS peaks towards lower energy by ~0.4 eV. The crystal-field strength decreased by ~0.6 eV as Ti4+ was partially substituted by Co3+ or Co2+.
Spinel Co3O4 thin films grown on MgAl2O4 (110) were observed to have excellent crystalline quality. The structure of the Co3O4/MgAl2O4 interface was determined using HRTEM and image simulations. It was found that MgAl2O4 substrate is terminated with Al and oxygen. Stacking faults and associated strain fields in spinel Co3O4 were found along [111], [001], and [113] using Geometrical Phase Analysis.
NbO2 films on STO (111) were observed to be tetragonal with lattice parameter of 13.8 Å and NbO films on LSAT (111) were observed to be cubic with lattice parameter of 4.26 Å. HRTEM showed formation of high quality NbOx films and excellent coherent interface. HRTEM of SrAl4 on LAO (001) confirmed an island growth mode. The SrAl4 islands were highly crystalline with excellent epitaxial registry with LAO. By comparing HRTEM images with image simulations, the interface structure was determined to consist of Sr-terminated SrAl4 (001) on AlO2-terminated LAO (001).
Al-doped SrTiO3 thin films grown on Si were of high crystalline quality. The Ti/O ratio estimated from EELS line scans revealed that substitution of Ti by Al created associated O vacancies. The strength of the crystal field in STO was measured using EELS, and decreased by ~1.0 eV as Ti4+ was substituted by Al3+. The damping of O-K EELS peaks confirmed the rise in oxygen vacancies. For Co-substituted STO films grown on Si, the EDS and EELS spectra across samples showed Co doping was quite random. The substitution of Ti4+ with Co3+ or Co2+ created associated oxygen vacancies for charge balance. Presence of oxygen vacancies was also confirmed by shift of Ti-L EELS peaks towards lower energy by ~0.4 eV. The crystal-field strength decreased by ~0.6 eV as Ti4+ was partially substituted by Co3+ or Co2+.
Spinel Co3O4 thin films grown on MgAl2O4 (110) were observed to have excellent crystalline quality. The structure of the Co3O4/MgAl2O4 interface was determined using HRTEM and image simulations. It was found that MgAl2O4 substrate is terminated with Al and oxygen. Stacking faults and associated strain fields in spinel Co3O4 were found along [111], [001], and [113] using Geometrical Phase Analysis.
NbO2 films on STO (111) were observed to be tetragonal with lattice parameter of 13.8 Å and NbO films on LSAT (111) were observed to be cubic with lattice parameter of 4.26 Å. HRTEM showed formation of high quality NbOx films and excellent coherent interface. HRTEM of SrAl4 on LAO (001) confirmed an island growth mode. The SrAl4 islands were highly crystalline with excellent epitaxial registry with LAO. By comparing HRTEM images with image simulations, the interface structure was determined to consist of Sr-terminated SrAl4 (001) on AlO2-terminated LAO (001).
ContributorsDhamdhere, Ajit (Author) / Smith, David J. (Thesis advisor) / McCartney, Martha R. (Committee member) / Chamberlin, Ralph (Committee member) / Ponce, Fernando (Committee member) / Arizona State University (Publisher)
Created2015