161,687 research outputs found
Mind in Africa, Body in Europe: The Struggle for Maintaining and Transforming Cultural Identity - A Note from the Experience of Eritrean Immigrants in Stockholm
No full textThis paper describes how individuals and groups who had crossed ‘physical, national boundaries’, and who live in a different social context make sense of their lives make sense of their lives by re-constructing their identities - of the sense of who they are, and who they want to be, which is an ongoing process. This is done by narrating the experiences of African men and women who live in Sweden and who struggle to both maintain their cultural identity and at the same time change aspects in their culture due to the context in which they find themselves. Maintaining cultural identity and transforming aspects of that identity therefore constitute the main thrust of the paper. Some of the ways through which immigrants claim to maintain their identity are practices and routines that they repeatedly and consistently perform as if these were uniform both in the host country and in the country of origin. But it is exactly within this premise that ‘maintaining’ an identity is defined in this paper. However, the routines, or practices may have different meanings or significance to different actors, different audience, and especially for the main beneficiaries, in a particular context. In this paper, I will narrate how ‘maintaining’ cultural identity is understood and practiced by Blin (Eritrean) immigrants in Stockholm, Sweden, when they solemnly perform a cultural rite called blessing (gewra) in weddings. The paper is based on a participant observation of weddings from 1992 to 2001 in Stockholm, Sweden, when the Blin speaking people perform the blessing rite, enjoy doing it, show to the audience how they maintain ‘who they are’, and perhaps symbolically confirm their unity with the Blin community. The main actors are the elderly and the bridegroom, both sine qua non if the rite is to get its legitimacy. Thus, the blessing rite is an example of being Eritrean in Sweden for its performers. The concept of identity and identity construction has become an important concept to deal with such demands for ‘maintaining’ and 'transforming' identities. Even though maintaining identity is encouraged in the Swedish social policy, transformation of that identity comes through demands that are widely accepted as modern values, such as egalitarianism, gender equality and individualism – leading to issues of diversity at different levels. If one strictly defines the meaning of the blessing rite, one can find that the meaning sometimes may not be consonant with the so-called modern values but that the people then provide symbolic significance to the rite.Blessing rite, Blin community, Culture maintenance, Identity construction, Immigrant
Variations on the Author
No full text“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Commentaires sur les Ouvres de Jean Racine
No full textO verdadero autor dos comentarios é Blin de Sainmore que os vendeu a M. Luneau de Boisjermai
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs
No full textWe present the first self-stabilizing algorithm for leader election in arbitrary topologies whose space complexity is O(max{log Delta, log log n}) bits per node, where n is the network size and Delta its degree. This complexity is sub-logarithmic in n when Delta = n^o(1)
Blin, M.-O. (2017). Sénégal, France, USA : anciens et nouveaux commerces triangulaires.
No full textBlin, M.-O. (2017). Sénégal, France, USA : anciens et nouveaux commerces triangulaires. In F. Richer-Rossi (Éd.), D’une culture à l’autre. Bras de fer et brassages (p. 41‑62). Paris: Michel Houdiard éditeur. Quand les cultures se rencontrent, quand les regards se croisent et que les valeurs se mesurent à des aunes différentes, quand la découverte se révèle source d’interrogation, de défiance mais aussi d’enthousiasme et de richesse, s’ouvre alors le large éventail des approches entre crainte..
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Larry O. Spencer, Conference Author Presentation
No full textGen. Larry O. Spencer, USAF (Ret.), author of Dark Horse: A Journey from the Horseshoe to the Pentago
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
A faster algorithm for finding minimum Tucker submatrices
No full textInternational audienceA binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are central in computational molecular biology, in particular for physical mapping and ancestral genome reconstruction. In 1972, Tucker gave a characterization of matrices that have the C1P by a set of forbidden submatrices, and a substantial amount of research has been devoted to the problem of efficiently finding such a minimum size forbidden submatrix. This paper presents a new O(Δ³m²(mΔ+n³)) time algorithm for this particular task for a m×n binary matrix with at most Δ 1-entries per row, thereby improving the O(Δ³m²(mn+n³)) time algorithm of M. Dom, J. Guo and R. Niedermeier [Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, Journal of Computer and System Sciences, 76(3-4): 204-221, 2010]. Moreover, this approach can be used - with a much heavier machinery - to address harder problems related to Minimal Conflicting Set [G. Blin, R. Rizzi, and S. Vialette. A Polynomial-Time Algorithm for Finding Minimal Conflicting Sets, Proc. 6th International Computer Science Symposium in Russia (CSR), [2011]]
- …
