Episciences.org
Not a member yet
6707 research outputs found
Sort by
In vino veritas ou faut-il boire pour comprendre Erofeev ?: Remarques à propos de l’enregistrement sonore de la lecture publique de Moscou-sur-Vodka par Erofeev
No full textThe purpose of this article is to develop an approach to integrating a recorded public reading of a novel by its author into literary research. More specifically, the article focuses on the recording of Venedikt Erofeev’s reading of Moscow to the End of the Line in 1980. This public reading raises the problem of literary interpretation and the voice in literature. Indeed, due to Erofeev’s double interference during the writing and the public reading of the text, this recording could possibly restrict the interpretative diversity of the work. However, the context and the nature of this public reading do not necessarily lead to the pitfall of a strictly author-centric interpretation. Rather, Erofeev’s recorded reading is a reminder of the intrinsic vocality of the work—an aspect of the text that can be lost in repeated silent reading.Cet article a pour objet l’élaboration d’une piste d’intégration de l’enregistrement sonore de la lecture d’un texte par son auteur dans le cadre de recherches en littérature. Le texte se penche plus précisément sur l’enregistrement de la lecture de Moscou-sur-vodka par Venedikt Erofeev en 1980. Cet enregistrement renvoie à la problématique de l’interprétation littéraire et de la voix. En effet, par la double intervention d’Erofeev, lors de la rédaction puis la lecture publique du texte, cet enregistrement pourrait possiblement restreindre la diversité interprétative de l’œuvre. Pourtant, le contexte et la nature de cette lecture publique ne mènent pas nécessairement à l’écueil de l’interprétation strictement centrée sur l’auteur. Cette lecture enregistrée à haute voix d’Erofeev s’apparente plutôt à un rappel de la vocalité intrinsèque de l’œuvre – un aspect du texte qui peut se perdre lors de la lecture silencieuse répétée
Un spectre plane sur la Russie : l'image de la révolte de Pougatchov à l'ère du cinéma post-soviétique à travers le film Révolte Russe d'Alexandre Prochkine (2000)
No full textPour une parution sur Épisciences.Through the films The Captain’s Daughter by Alexander Prochkin (2000), and Ekaterina Mixajlova (2005), adapted from the novel of the same name by Alexander Pushkin, this article aims to highlight the influence of the Russian Imperial Archives on the development of these post-Soviet era productions. While many directors have adapted Pushkin’s literary narrative, inspired by real events, only the 2000 production makes as much use of the information from the essay History of Pugachev, which served as the basis for the novel. This study attempts to shed light on how post-Soviet cinema looks at the history of this revolt, perceived by the Soviets as a precursor to the popular uprising that accompanied the revolution of 1917. It allows us to distinguish the mechanism of deconstruction of the emancipatory figure of Pugachev, which takes place after the fall of the Soviet Union, through a parallel with the animated film by Ekaterina Mixajlova.À travers les films Révolte Russe (2000) d’Alexandre Prochkine et La Fille du Capitaine d’Ekaterina Mixajlova (2005), adaptations du roman du même nom d’Alexandre Pouchkine, cet article a pour objectif de mettre en lumière l’influence des Archives impériales russes sur l’élaboration de ces productions de l’ère post-soviétique. Si de nombreux réalisateurs ont adapté le récit littéraire de Pouchkine, inspiré de faits réels, seule la production datant de 2000 exploite autant les informations issues de l’essai Histoire de Pougatchov, qui a servi de base à la construction du roman. Cette étude tente d’éclaircir le regard que porte le cinéma post-soviétique sur l’histoire de cette révolte, perçue par les Soviétiques comme annonciatrice du soulèvement populaire qui accompagna la révolution de 1917. Elle permet de distinguer le mécanisme de déconstruction de la figure émancipatrice de Pougatchov qui s’opère après la chute de l’Union soviétique, à travers un parallèle avec le film d’animation d’Ekaterina Mixajlova
Cost Automata, Safe Schemes, and Downward Closures
No full textIn this work we prove decidability of the model-checking problem for saferecursion schemes against properties defined by alternating B-automata. We thenexploit this result to show how to compute downward closures of languages offinite trees recognized by safe recursion schemes. Higher-order recursion schemes are an expressive formalism used to definelanguages of finite and infinite ranked trees by means of fixed points oflambda terms. They extend regular and context-free grammars, and are equivalentin expressive power to the simply typed -calculus and collapsiblepushdown automata. Safety in a syntactic restriction which limits theirexpressive power. The class of alternating B-automata is an extension of alternating parityautomata over infinite trees; it enhances them with counting features that canbe used to describe boundedness properties
Stably semiorthogonally indecomposable varieties
No full textA triangulated category is said to be indecomposable if it admits nonontrivial semiorthogonal decompositions. We introduce a definition of anoncommutatively stably semiorthogonally indecomposable (NSSI) variety. Thispropery implies, among other things, that each smooth proper subvariety hasindecomposable derived category of coherent sheaves, and that if is NSSI,then for any variety all semiorthogonal decompositions of areinduced from decompositions of . We prove that any variety whose Albanesemorphism is finite is NSSI, and that the total space of a fibration over NSSIbase with NSSI fibers is also NSSI. We apply this indecomposability to deducethat there are no phantom subcategories in some varieties, including surfaces, where is any smooth proper curve of positivegenus.Comment: 15 pages; published versio
A strong call-by-need calculus
No full textWe present a call-by-need -calculus that enables strong reduction(that is, reduction inside the body of abstractions) and guarantees thatarguments are only evaluated if needed and at most once. This calculus usesexplicit substitutions and subsumes the existing strong-call-by-need strategy,but allows for more reduction sequences, and often shorter ones, whilepreserving the neededness. The calculus is shown to be normalizing in a strongsense: Whenever a -term t admits a normal form n in the-calculus, then any reduction sequence from t in the calculuseventually reaches a representative of the normal form n. We also exhibit arestriction of this calculus that has the diamond property and that onlyperforms reduction sequences of minimal length, which makes it systematicallybetter than the existing strategy. We have used the Abella proof assistant toformalize part of this calculus, and discuss how this experiment affected itsdesign. In particular, it led us to derive a new description of call-by-needreduction based on inductive rules
Variabilité spatiale de la qualité des eaux agricoles d’un bassin versant de deux arrondissements d’Antananarivo (Madagascar)
No full textContext: Spatial analysis of water quality was carried out on agricultural area from lowland of watershed in Tana 2 and Tana 4 - Madagascar. Purpose: It aims to determine agricultural water quality and spatial distribution analysis of alkalinity, salinity and organic matter content. Methods: The agricultural zone was subdivided into three plots P1, P2 and P3 according to soil type. Water sample taken from 43 georeferenced points were intended for pH, Electrical Conductivity (CE) and Chemical Oxygen Demand (DCO) analysis. The spatial distribution was established by interpolating those indicator values using v.kriging from GRASS GIS software. Results and discussion: Water from P2 plot have high alkalinity. Those from P3 plots are very rich in dissolved salt and organic matter. The spatial distribution of alkalinity and salinity follows a linear model. While an exponential mode characterizes the distribution of organic contentsContexte : L’analyse spatiale de la qualité des eaux a été réalisée dans la zone agricole située dans un bas-fond d’un bassin versant de Tana 2 et Tana 4 – Madagascar. Objectif : Elle vise à déterminer la nature des eaux agricoles et la variabilité spatiale de leur alcalinité, leur salinité et leur teneur en matière organique. Méthodes : La zone agricole a été subdivisée en trois parcelles P1, P2 et P3 selon le type de sol. Des échantillons d’eaux prélevés sur les 43 points géo référencés de cette zone ont été soumis aux mesures de pH, Conductivité Électrique (CE) et Demande Chimique en Oxygène (DCO). La distribution spatiale de ces paramètres a été établie par interpolation des valeurs de ces indicateurs en utilisant v.kriging du logiciel GRASS GIS. Résultats et discussion : Les eaux des parcelles P2 présentent une forte alcalinité. Celles de la parcelle P3 sont très riches en sels dissous et en matières organiques. La distribution spatiale de l’alcalinité et la salinité suit un modèle linéaire, tandis qu’un modèle exponentiel caractérise la répartition de la matière organique
Cops and Robbers on Dynamic Graphs: Offline and Online Case
No full textWe examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the underlying graph of the model. The cops and the robber take their turns on the current graph instance. The cops win if they can capture the robber at some point in time. Otherwise, the robber wins. In the offline case, the players are fully aware of the evolution sequence, up to some finite time horizon T. We provide a O(n 2k+1 T) algorithm to decide whether a given evolution sequence for an underlying graph with n vertices is k-cop-win via a reduction to a reachability game. In the online case, there is no knowledge of the evolution sequence, and the game might go on forever. Also, each generated instance is required to be connected. We provide a nearly tight characterization for sparse underlying graphs, i.e., with at most linear number of edges. We prove λ + 1 cops suffice to capture the robber in any underlying graph with n − 1 + λ edges. Further, we define a family of underlying graphs with n−1+λ edges where λ−1 cops are necessary (and sufficient) for capture
Note on geodesics of cotangent bundle with Berger-type deformed Sasaki metric over K\"ahlerian manifold
No full textIn this paper, first, we introduce the Berger-type deformed Sasaki metric onthe cotangent bundle over a K\"{a}hlerian manifold and investigate the Levi-Civita connection of this metric. Secondly, we presentthe unit cotangent bundle equipped with Berger-type deformed Sasaki metric, andwe investigate the Levi-Civita connection. Finally, we study the geodesics onthe cotangent bundle and on unit cotangent bundle with respect to theBerger-type deformed Sasaki metric
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs
No full textIn this paper we first study Youden rectangles of small orders.We have enumerated all Youden rectangles for a range of small parameter values,excluding the almost square cases where , in a large scale computersearch. In particular, we verify the previous counts for , and extend this to the cases and . Forsmall parameter values where no Youden rectangles exist, we also enumeraterectangles where the number of symbols common to two columns is always one oftwo possible values, differing by 1, which we call \emph{near Youdenrectangles}. For all the designs we generate, we calculate the order of theautotopism group and investigate to which degree a certain transformation canyield other row-column designs, namely double arrays, triple arrays and sesquiarrays. Finally, we also investigate certain Latin rectangles with threepossible pairwise intersection sizes for the columns and demonstrate that thesecan give rise to triple and sesqui arrays which cannot be obtained from Youdenrectangles, using the transformation mentioned above
Biotraduction versus traduction automatique : la subjectivité en question
No full textGrace aux nouveaux systèmes reposant sur les algorithmes de l'intelligence artificielle, la traduction automatique marque un progrès remarquable. La présente contribution se propose donc de s'interroger sur son possible apport, et sur l'impact de l'absence du biotraducteur et de sa subjectivité, dans les traductions exigeant une neutralité. Pour ce faire, nous avons analysé les traductions des noms de métiers à partir d'un corpus trilingue français-arabe-anglais de résumés d'articles scientifiques traduits par Google Translate et Bing Microsoft Translator. Ce qui a permis de mettre en valeur un aspect positif de la subjectivité humaine en tant qu'outil de compréhension et de contextualisation, et de dévoiler la subjectivité de la machine qui pourrait résider dans l'ensemble des subjectivités présentes dans les corpus ayant servi à son entrainement