Les dispositifs architecturaux reliés à l'extension spatiale

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

Early Word Comprehension in Infants: Replication and Extension.

A handful of recent experimental reports have shown that infants of 6 to 9 months know the meanings of some common words. Here, we replicate and extend these findings. With a new set of items, we show that when young infants (age 6-16 months, n=49) are presented with side-by-side video clips depicting various common early words, and one clip is named in a sentence, they look at the named video at above-chance rates. We demonstrate anew that infants understand common words by 6-9 months, and that performance increases substantially around 14 months. The results imply that 6-9 month olds' failure to understand words not referring to objects (verbs, adjectives, performatives) in a similar prior study is not attributable to the use of dynamic video depictions. Thus, 6-9 month olds' experience of spoken language includes some understanding of common words for concrete objects, but relatively impoverished comprehension of other words.

Les dispositifs architecturaux reliés à l'extension spatiale

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

Black-White Wage Gap Among Restaurant Servers: A Replication, Extension, and Exploration of Consumer Racial Discrimination in Tipping

There is a rich history of social science research centering on racial inequalities that continue to be observed across various markets (e.g., labor, housing, and credit markets) and social milieus. Existing research on racial discrimination in consumer markets, however, is relatively scarce and that which has been done has disproportionately focused on consumers as the victims of race-based mistreatment. As such, we know relatively little about how consumers contribute to inequalities in their roles as perpetrators of racial discrimination. In response, in this paper we elaborate on a line of research that is only in its’ infancy stages of development and yet is ripe with opportunities to advance the literature on consumer racial discrimination and racial earnings inequities among tip dependent employees in the United States. Specifically, we analyze data derived from a large exit survey of restaurant consumers (n=378) in an attempt to replicate, extend, and further explore the recently documented effect of service providers’ race on restaurant consumers’ tipping decisions. Our results indicate that both White and Black restaurant customers discriminate against Black servers by tipping them less than their White coworkers. Importantly, we find no evidence that this Black tip penalty is the result of interracial differences in service skills possessed by Black and White servers. We conclude by delineating directions for future research in this neglected but salient area study.

Efficacité différentielle de la publicité internationale : extension, adaptation ou invention

[…] Les objectifs de cette étude sont doubles: d’une part, l'auteur s’efforcera de développer un cadre théorique permettant de replacer le problème de la transférabilité du message dans son contexte, c'est-à-dire un processus de communication inter-culturel. D’autre part, l'auteur tentera de comparer expérimentalement l'efficacité d'un message transféré d'un environnement culturel donné (A) vers un autre environnement culturel (B), et celle d'un message adapté à l'environnement culturel (B). Le problème de la sélection des media, qui fait partie intégrante de la définition d'une campagne publicitaire sera volontairement laissé de côté. […]

On the extension complexity of combinatorial polytopes

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs.