Matching Items (2)
Description
Prospective memory is defined as the process of remembering to do something at a particular point in the future after first forming a conscious intention. There are three types of prospective memory intentions; event-based, time-based and activity-based intentions. Research has suggested that activity-based is one of the dominant prospective memory failures that people self-report yet there is little research on this area of prospective memory. The current study focuses on how activity-based PM is influenced by the association between the match of internal context and intended action. According to previous research, similar context between intention formation and retrieval has been shown to facilitate prospective memory, which increases the execution of intentions. Based on literature, we hypothesized that there would be higher intention completion when the internal context matches the intended action to be completed in the future. Results showed that internal context affected activity-based intention completion significantly. However the interaction between internal context and the intended action did not significantly affect intention completion. Although we did not get the hypothesized interaction, the means do cross over showing the interaction pattern is there. We decided to treat this as a pilot study and replicate it with a well-powered experiment consisting of 560 valid participants.
ContributorsEdrington, Alexis Adele (Author) / Brewer, Gene (Thesis director) / Presson, Clark (Committee member) / McClure, Samuel (Committee member) / Department of Psychology (Contributor) / Barrett, The Honors College (Contributor) / College of Liberal Arts and Sciences (Contributor)
Created2015-12
Description
There has been a substantial development in the field of data transmission in the last two decades. One does not have to wait much for a high-definition video to load on the systems anymore. Data compression is one of the most important technologies that helped achieve this seamless data transmission experience. It helps to store or send more data using less memory or network resources. However, it appears that there is a limit on the amount of compression that can be achieved with the existing lossless data compression techniques because they rely on the frequency of characters or set of characters in the data. The thesis proposes a lossless data compression technique in which the data is compressed by representing it as a set of parameters that can reproduce the original data without any loss when given to the corresponding mathematical equation. The mathematical equation used in the thesis is the sum of the first N terms in a geometric series. Various changes are made to this mathematical equation so that any given data can be compressed and decompressed. According to the proposed technique, the whole data is taken as a single decimal number and replaced with one of the terms of the used equation. All the other terms of the equation are computed and stored as a compressed file. The performance of the developed technique is evaluated in terms of compression ratio, compression time and decompression time. The evaluation metrics are then compared with the other existing techniques of the same domain.
ContributorsGrewal, Karandeep Singh (Author) / Gonzalez Sanchez, Javier (Thesis advisor) / Bansal, Ajay (Committee member) / Findler, Michael (Committee member) / Arizona State University (Publisher)
Created2021