title: Culture and Cognitive Theory: Toward a Reformulation

authors: Thakker, Jo

subjects: culture

abstract: In a provocative and important recent article Anthony Marsella (1998) makes an eloquent plea for the forging of a new metadiscipline of psychology that he labels global-community psychology. Marsella argues that we need a radical rethinking of the fundamental premises of psychology, rooted as they are in Western cultural traditions. Features of an emergent global-community psychology include an emphasis on multicultural and multidisciplinary approaches to human behavior that draw attention to the importance of context and meaning in human lives. Marsella's call for a global-community psychology reflects, in part, a growing body of literature that demonstrates the importance of cultural factors in a diver-sity of psychological domains such as cognition, emotion, social behavior, and psychopathology.

text: Culture and Cognitive Theory: Toward a Reformulation In a provocative and important recent article Anthony Marsella (1998) makes an eloquent plea for the forging of a new metadiscipline of psychology that he labels global-community psychology. Marsella argues that we need a radical rethinking of the fundamental premises of psychology, rooted as they are in Western cultural traditions. Features of an emergent global-community psychology include an emphasis on multicultural and multidisciplinary approaches to human behavior that draw attention to the importance of context and meaning in human lives. Marsella's call for a global-community psychology reflects, in part, a growing body of literature that demonstrates the importance of cultural factors in a diver-sity of psychological domains such as cognition, emotion, social behavior, and psychopathology.

year: 2001

title: Bandwidth-optimal random shuffling for GPUs

authors: Mitchell, Rory

subjects: computer science

abstract: Linear-time algorithms that are traditionally used to shuffle data on CPUs, such as the method of Fisher-Yates, are not well suited to implementation on GPUs due to inherent sequential dependencies, and existing parallel shuffling algorithms are unsuitable for GPU architectures because they incur a large number of read/write operations to high latency global memory. To address this, we provide a method of generating pseudo-random permutations in parallel by fusing suitable pseudo-random bijective functions with stream compaction operations. Our algorithm, termed “bijective shuffle” trades increased per-thread arithmetic operations for reduced global memory transactions. It is work-efficient, deterministic, and only requires a single global memory read and write per shuffle input, thus maximising use of global memory bandwidth. To empirically demonstrate the correctness of the algorithm, we develop a statistical test for the quality of pseudo-random permutations based on kernel space embeddings. Experimental results show that the bijective shuffle algorithm outperforms competing algorithms on GPUs, showing improvements of between one and two orders of magnitude and approaching peak device bandwidth.

text: Bandwidth-optimal random shuffling for GPUs Linear-time algorithms that are traditionally used to shuffle data on CPUs, such as the method of Fisher-Yates, are not well suited to implementation on GPUs due to inherent sequential dependencies, and existing parallel shuffling algorithms are unsuitable for GPU architectures because they incur a large number of read/write operations to high latency global memory. To address this, we provide a method of generating pseudo-random permutations in parallel by fusing suitable pseudo-random bijective functions with stream compaction operations. Our algorithm, termed “bijective shuffle” trades increased per-thread arithmetic operations for reduced global memory transactions. It is work-efficient, deterministic, and only requires a single global memory read and write per shuffle input, thus maximising use of global memory bandwidth. To empirically demonstrate the correctness of the algorithm, we develop a statistical test for the quality of pseudo-random permutations based on kernel space embeddings. Experimental results show that the bijective shuffle algorithm outperforms competing algorithms on GPUs, showing improvements of between one and two orders of magnitude and approaching peak device bandwidth.

year: 2022

title: “Seeing” Kāpō Māori: Making visible the experiences of Kāpō Māori during and after COVID-19

authors: Masters-Awatere, Bridgette

abstract: A scoping project focused on the intersection of Māori and the framing of vision impairments (disability) within the context of a pandemic response (in this instance COVID-19). Specifically, we were interested in the experiences of kāpō Māori during and post COVID-19 in order to centre the cultural and health needs of kāpō Māori in a culturally responsive manner. We highlight the aspirations that kāpō Māori have for themselves and their whānau, and to identify the facilitators and barriers that kāpō Māori and their whānau face in achieving these

text: “Seeing” Kāpō Māori: Making visible the experiences of Kāpō Māori during and after COVID-19 A scoping project focused on the intersection of Māori and the framing of vision impairments (disability) within the context of a pandemic response (in this instance COVID-19). Specifically, we were interested in the experiences of kāpō Māori during and post COVID-19 in order to centre the cultural and health needs of kāpō Māori in a culturally responsive manner. We highlight the aspirations that kāpō Māori have for themselves and their whānau, and to identify the facilitators and barriers that kāpō Māori and their whānau face in achieving these

year: 2021