No description available.

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Thesis advisor: Liane Young / Thesis advisor: James Dungan / Memory is dependent on a variety of factors from individual differences in storage capacity to cultural differences in attentional biases. While previous research has studied the effect of the intentionality of actions on memory, few have looked into how the intersection of intentionality and morality might affect memory. This study sought to examine how morality and intentionality affect participants’ ability to remember specific information about an event. Participants read six stories from a single condition in a 2 (moral/neutral) x 2 (intentional/accidental) between-subjects design. After half an hour of non-verbal distractor tasks, participants were asked to freely recall as much information as they could from the previous stories. Although we found few significant results, we did find consistent trends suggesting that moral intentional scenarios improve participants’ recall of overall memory about the event. Specifically, morality and intentionality show trends toward improving participants’ memory for information about the story’s agent, their action, and whether or not their action was done intentionally or accidentally. The lack of significance could stem from a small sample size for each condition (N=20), which did not give enough power for statistical analyses. We discuss this and other limitations, as well as future directions on how these preliminary results apply to cultural and linguistic differences in memory and how this could have important implications for eyewitness testimony. / Thesis (BA) — Boston College, 2014. / Submitted to: Boston College. College of Arts and Sciences. / Discipline: Psychology Honors Program. / Discipline: College Honors Program. / Discipline: Psychology.

Recent work has shown that fast matrix multiplication algorithms can be constructed by embedding the two input matrices into a group algebra, applying a generalized discrete Fourier transform, and performing the multiplication in the Fourier basis. Developing an embedding that yields a matrix multiplication algorithm with running time faster than naive matrix multiplication leads to interesting combinatorial problems in group theory. The crux of such an embedding, after a group G has been chosen, lies in finding a triple of subsets of G that satisfy a certain algebraic relation. I show how the process of finding such subsets can in some cases be greatly simplified by considering the action of the group G on an appropriate set X. In particular, I focus on groups acting on regularly branching trees.

Thesis (M.A.)--State University of New York at Binghamton, Department of Philosophy, 2006. / Includes bibliographical references.

Texte remanié de: Thèse de doctorat--Droit--Paris 1, 2004. / Bibliogr. p. 237-244. Notes bibliogr.

Dissertation--Oestrich-Winkel--International University Schloß Reichartshausen, 2006.

Tesis (abogado)--Colegio del Estado, Puebla.

No description available.

Thesis (J.C.L.)--Catholic University of America, 2005. / Includes bibliographical references (leaves 61-65).