188,090 research outputs found
Pelle Le Conquérant, Film danois de Bille August
No full textVideau André. Pelle Le Conquérant, Film danois de Bille August. In: Hommes et Migrations, n°1118, janvier 1989. p. 60
The uses of magic realism in Hollywood adaptations of Allende's The house of the spirits and Esquivel's Like water for chocolate
No full textDissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Comunicação e Expressão. Programa de Pós-Graduação em Letras/Inglês e Literatura Correspondente.O objetivo deste estudo é investigar como a estética do realismo mágico, que está diretamente ligada ao contexto sócio-político da América Latina, foi traduzida para uma narrativa Hollywoodiana. O trabalho realiza uma análise comparativa entre os romances do gênero realismo mágico A Casa dos Espíritos (1982), de Isabel Allende, e Como Água Para Chocolate (1989), de Laura Esquivel, e as adaptações dos livros ao cinema. Uma análise dos dois filmes, A Casa dos Espíritos (1993), de Bille August, e Como Água Para Chocolate (1993), dirigido por Alfonso Arau, em relação a elementos cinematográficos tais como mise-en-scene (cenário, iluminação, figurino e personagens), enredo, narrativa, motivação e linhas de ação nos leva à conclusão de que Arau obteve mais sucesso do que August ao transferir a estética do realismo mágico para o cinema
Faster Sliding Window String Indexing in Streams
No full textThe classical string indexing problem asks to preprocess the input string S for efficient pattern matching queries. Bille, Fischer, Gørtz, Pedersen, and Stordalen [CPM 2023] generalized this to the streaming sliding window string indexing problem, where the input string S arrives as a stream, and we are asked to maintain an index of the last w characters, called the window. Further, at any point in time, a pattern P might appear, again given as a stream, and all occurrences of P in the current window must be output. We require that the time to process each character of the text or the pattern is worst-case. It appears that standard string indexing structures, such as suffix trees, do not provide an efficient solution in such a setting, as to obtain a good worst-case bound, they necessarily need to work right-to-left, and we cannot reverse the pattern while keeping a worst-case guarantee on the time to process each of its characters. Nevertheless, it is possible to obtain a bound of O(log w) (with high probability) by maintaining a hierarchical structure of multiple suffix trees. We significantly improve this upper bound by designing a black-box reduction to maintain a suffix tree under prepending characters to the current text. By plugging in the known results, this allows us to obtain a bound of O(log log w + log log σ) (with high probability), where σ is the size of the alphabet. Further, we introduce an even more general problem, called the streaming dynamic window string indexing, where the goal is to maintain the current text under adding and deleting characters at either end and design a similar black-box reduction
Nespouls – La Bille, El Barjou, Le Lacaud
No full textIdentifiant de l'opération archéologique : 122158 Date de l'opération : 2005 (MH) Dans le cadre de la création de l’aérodrome de Brive-Souillac, aux lieux-dits « La Bille, El Barjou, Le Lacaud », une opération de diagnostic archéologique a été réalisée de septembre 2003 à janvier 2004 sous la responsabilité de D. Colonge (BSR 2004, p. 24-27). Le caractère positif de plusieurs sondages dispersés sur l’emprise du projet, a motivé la mise en œuvre d’une opér..
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
Space-Efficient Re-Pair Compression
No full textRe-Pair [5] is an effective grammar-based compression scheme achieving strong compression rates in practice. Let n, σ, and d be the text length, alphabet size, and dictionary size of the final grammar, respectively. In their original paper, the authors show how to compute the Re-Pair grammar in expected linear time and 5n + 4σ2 + 4d + √n words of working space on top of the text. In this work, we propose two algorithms improving on the space of their original solution. Our model assumes a memory word of [log2 n] bits and a re-writable input text composed by n such words. Our first algorithm runs in expected O(n/ε) time and uses (1+ε)n+√n words of space on top of the text for any parameter 0 <∊ ≤ 1 chosen in advance. Our second algorithm runs in expected O(n log n) time and improves the space to n + √n words
Differentially Private Substring and Document Counting
No full textDifferential privacy is the gold standard for privacy in data analysis. In many data analysis applications, the data is a database of documents. For databases consisting of many documents, one of the most fundamental problems is that of pattern matching and computing (i) how often a pattern appears as a substring in the database ( substring counting ) and (ii) how many documents in the collection contain the pattern as a substring ( document counting ). In this paper, we initiate the theoretical study of substring and document counting under differential privacy. We give an ε-differentially private data structure solving this problem for all patterns simultaneously with a maximum additive error of O( • polylog(n|Σ|)), where is the maximum length of a document in the database, n is the number of documents, and |Σ| is the size of the alphabet. We show that this is optimal up to a O(polylog()) factor. Further, we show that for (ε,δ)-differential privacy, the bound for document counting can be improved to O(√ • polylog(|Σ|)). Additionally, our data structures are efficient. In particular, our data structures use O( 2 ) space, O( 2 4 ) preprocessing time, and O(|P|) query time where P is the query pattern. Along the way, we develop a new technique for differentially privately computing a general class of counting functions on trees of independent interest. Our data structures immediately lead to improved algorithms for related problems, such as privately mining frequent substrings and q -grams. For q -grams, we further improve the preprocessing time of the data structure.Differential privacy is the gold standard for privacy in data analysis. In many data analysis applications, the data is a database of documents. For databases consisting of many documents, one of the most fundamental problems is that of pattern matching and computing (i) how often a pattern appears as a substring in the database (substring counting ) and (ii) how many documents in the collection contain the pattern as a substring (document counting ). In this paper, we initiate the theoretical study of substring and document counting under differential privacy. We give an ε-differentially private data structure solving this problem for all patterns simultaneously with a maximum additive error of O( • polylog(n|Σ|)), where is the maximum length of a document in the database, n is the number of documents, and |Σ| is the size of the alphabet. We show that this is optimal up to a O(polylog()) factor. Further, we show that for (ε,δ)-differential privacy, the bound for document counting can be improved to O(√ • polylog(|Σ|)). Additionally, our data structures are efficient. In particular, our data structures use O(2) space, O(24) preprocessing time, and O(|P|) query time where P is the query pattern. Along the way, we develop a new technique for differentially privately computing a general class of counting functions on trees of independent interest. Our data structures immediately lead to improved algorithms for related problems, such as privately mining frequent substrings and q-grams. For q-grams, we further improve the preprocessing time of the data structure
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
Size-Constrained Weighted Ancestors with Applications
No full textThe weighted ancestor problem on a rooted node-weighted tree T is a generalization of the classic predecessor problem: construct a data structure for a set of integers that supports fast predecessor queries. Both problems are known to require Ω(log log n) time for queries provided (n poly log n) space is available, where n is the input size. The weighted ancestor problem has attracted a lot of attention by the combinatorial pattern matching community due to its direct application to suffix trees. In this formulation of the problem, the nodes are weighted by string depth. This research has culminated in a data structure for weighted ancestors in suffix trees with (1) query time and an (n)-time construction algorithm [Belazzougui et al., CPM 2021]. In this paper, we consider a different version of the weighted ancestor problem, where the nodes are weighted by any function weight that maps each node of T to a positive integer, such that weight(u) ≤ size(u) for any node u and weight(u₁) ≤ weight(u₂) if node u₁ is a descendant of node u₂, where size(u) is the number of nodes in the subtree rooted at u. In the size-constrained weighted ancestor (SWA) problem, for any node u of T and any integer k, we are asked to return the lowest ancestor w of u with weight at least k. We show that for any rooted tree with n nodes, we can locate node w in (1) time after (n)-time preprocessing. In particular, this implies a data structure for the SWA problem in suffix trees with (1) query time and (n)-time preprocessing, when the nodes are weighted by weight. We also show several string-processing applications of this result
Analogie entre des écoulements granulaires le long de canaux inclinés et le mouvement d'une bille le long d'une bille cahoteuse
No full text[Departement_IRSTEA]EEE [TR1_IRSTEA]E31-Ingénierie et prévention des risques naturels en montagneThe main objective of this paper is to present an analogy between the motion of a single bead down a bumpy line made up of juxtaposed bead and granular flows down an inclined channel with rough bottom. This analogy enlightens the role of particle rotations and friction.Cet article a pour objet de présenter une analogie entre le mouvement d'une seule bille sur une ligne cahoteuse composée de billes juxtaposées et d'écoulements granulaires le long de canaux inclinés munis de fond rugueux. Cette analogie met en lumière le rôle des rotations de particules et du frottement
- …
