Episciences.org
Not a member yet
6707 research outputs found
Sort by
L’interdisciplinarité dans tous ses états : une approche complexe, floue et interalogique
No full textLe rapprochement voire la collaboration entre les disciplines scientifiques s'impose comme le moyen privilégié pour comprendre la complexité des objets questionnés dans les projets de recherche. Dans cet article, nous recensons les différentes définitions données aux formes d’interaction entre disciplines depuis 1972 et la publication pionnière de Interdisciplinarity: problems of teaching and research in universities. Il apparait que la rigidité normative des définitions, ainsi que leur multiplication, rendent difficilement compte des nuances et des dynamiques de la collaboration au sein des projets scientifiques qui dépassent les frontières disciplinaires. Néanmoins, c’est un dialogue entre théorie et pratique enrichissant que nous chercherons à initier, aussi bien pour l’étude que pour la méthodologie de l’interdisciplinarité, en proposant d’aborder la gradualité de tels contextes par un croisement entre psychologie expérimentale, anthropologie et sciences de l’informatique. Nous envisagerons ainsi des pistes de modélisation en exploitant notamment les fondements de la théorie des sous-ensembles flous apparue dans les années 60 pour la formalisation mathématique des objets aux contours flous. Cela nous conduira à envisager la question de l'interdisciplinarité et de toutes les formes de collaborations à partir d'une logique floue à inscrire dans le champ plus large de ce l'on pourrait nommer la science de l'inter-: l'interalogie
Les dynamiques de l’intégration : associations d’aide aux migrants et sociétés au cœur des espaces français, espagnol et danois. Thèse en sociologie, sous la direction d’Olivier Cousin et de Claire Schiff, soutenue le 17 mars 2022, université de Bordeaux
No full textPour une publication sur Épisciences.Résumé de la thèse de Morgan Lans, intitulée "Les dynamiques de l’intégration : associations d’aide aux migrants et sociétés au cœur des espaces français, espagnol et danois", sous la direction d’Olivier Cousin et de Claire Schiff, soutenue le 17 mars 2022 à l'université de Bordeau
Agriculteurs ou chasseurs-cueilleurs ? Le débat autour de Dark Emu
No full textPour une publication sur Épisciences.Dark Emu (2014), a book written by Bruce Pascoe, argues for a drastic revision of the vision of Aboriginal peoples at the time of the colonisation of Australia. Traditionally presented as nomadic hunter-gatherers, they were in fact for the most part villagers who applied some forms of agriculture and fish farming, all of which were concealed by those who wanted to appropriate their lands, thus forging a false version perpetuated by anthropological tradition. This provocative thesis has had a huge impact in Australia, where it has been the subject of much controversy. Peter Sutton and Keryn Walshe’s book is the first rebuttal by academic specialists–who are also deeply involved in the defence of the rights of Aboriginal communities.Le livre Dark Emu (2014), écrit par Bruce Pascoe, plaide pour une révision drastique de la vision des peuples aborigènes au moment de la colonisation de l’Australie. Traditionnellement présentés comme des chasseurs-cueilleurs nomades, ceux-ci auraient en réalité été pour une bonne part des villageois pratiquant certaines formes d’agriculture et de pisciculture, autant d’éléments dissimulés par ceux qui voulaient s’approprier leurs terres, forgeant ainsi une version mensongère perpétuée par la tradition anthropologique. Cette thèse provocatrice a connu un immense retentissement en Australie, où elle a suscité de très âpres polémiques. Le livre de Peter Sutton et Keryn Walshe en constitue la première réfutation émanant de spécialistes académiques – par ailleurs, profondément impliqués dans la défense des droits des communautés aborigènes
Mathematics of stable tensegrity structures
No full textTensegrity structures have been extensively studied over the last years dueto their potential applications in modern engineering like metamaterials,deployable structures, planetary lander modules, etc. Many of the form-findingmethods proposed continue to produce structures with one or more soft/swingingmodes. These modes have been vividly highlighted and outlined as the groundsfor these structures to be unsuitable as engineering structures. This workproposes a relationship between the number of rods and strings to satisfy thefull-rank convexity criterion as a part of the form-finding process. Using theproposed form-finding process for the famous three-rod tensegrity, the workproposes an alternative three-rod ten-string that is stable. The workdemonstrates that the stable tensegrities suitable for engineering are feasibleand can be designed
New Digital Strategies for Creating and Comparing the Content Structure of Biblical Manuscripts
No full textIn an era when more and more manuscript scholarship is taking place on the internet, through digital manuscripts, databases and electronic publishing, there is a corresponding and growing need among scholars for flexible and creative ways to create clear and coherent online manuscript descriptions. This article presents a prototype of a tool, currently under development at the Ludwig-Maximilian Universität, Munich, which aims to streamline the description process from the perspective of facilitating comparisons between manuscripts from different cultural areas. Presently, the tool is being developed for use with biblical manuscripts and the article outlines the challenges that come with creating and comparing this kind of material, which is often similar in terms of content but very diverse as to its structure. It then offers solutions that allow users to describe and compare the manuscripts at differing levels of granularity. Lastly, the article sets forth a pattern of use that could be transposed onto areas of manuscript studies beyond biblical manuscripts and offers perspectives for the tool’s wider application
A recursive formula for the product of element orders of finite abelian groups
No full textLet G be a finite group and let ψ(G) denote the sum of element orders of G; later this concept has been used to define R(G) which is the product of the element orders of G. Motivated by the recursive formula for ψ(G), we consider a finite abelian group G and obtain a similar formula for R(G)
Sound approximate and asymptotic probabilistic bisimulations for PCTL
No full textWe tackle the problem of establishing the soundness of approximatebisimilarity with respect to PCTL and its relaxed semantics. To this purpose,we consider a notion of bisimilarity inspired by the one introduced byDesharnais, Laviolette, and Tracol, and parametric with respect to anapproximation error , and to the depth of the observation alongtraces. Essentially, our soundness theorem establishes that, when a state satisfies a given formula up-to error and steps , and isbisimilar to up-to error and enough steps, we prove that also satisfies the formula up-to a suitable error and steps . Thenew error is computed from , and the formula, andonly depends linearly on . We provide a detailed overview of our soundnessproof. We extend our bisimilarity notion to families of states, thus obtainingan asymptotic equivalence on such families. We then consider an asymptoticsatisfaction relation for PCTL formulae, and prove that asymptoticallyequivalent families of states asymptotically satisfy the same formulae
Token Games and History-Deterministic Quantitative-Automata
No full textA nondeterministic automaton is history-deterministic if its nondeterminismcan be resolved by only considering the prefix of the word read so far. Due totheir good compositional properties, history-deterministic automata are usefulin solving games and synthesis problems. Deciding whether a givennondeterministic automaton is history-deterministic (the HDness problem) isgenerally a difficult task, which can involve an exponential procedure, or evenbe undecidable, as is the case for example with pushdown automata. Token gamesprovide a PTime solution to the HDness problem of B\"uchi and coB\"uchiautomata, and it is conjectured that 2-token games characterise HDness for all-regular automata. We extend token games to the quantitative setting and analyse their potentialto help deciding HDness of quantitative automata. In particular, we show that1-token games characterise HDness for all quantitative (and Boolean) automataon finite words, as well as discounted-sum (DSum), Inf and Reachabilityautomata on infinite words, and that 2-token games characterise HDness ofLimInf and LimSup automata, as well as Sup automata on infinite words. Usingthese characterisations, we provide solutions to the HDness problem of Safety,Reachability, Inf and Sup automata on finite and infinite words in PTime, ofDSum automata on finite and infinite words in NPco-NP, of LimSup automatain quasipolynomial time, and of LimInf automata in exponential time, where thelatter two are only polynomial for automata with a logarithmic number ofweights
Impure Simplicial Complexes: Complete Axiomatization
No full textCombinatorial topology is used in distributed computing to model concurrencyand asynchrony. The basic structure in combinatorial topology is the simplicialcomplex, a collection of subsets called simplices of a set of vertices, closedunder containment. Pure simplicial complexes describe message passing inasynchronous systems where all processes (agents) are alive, whereas impuresimplicial complexes describe message passing in synchronous systems whereprocesses may be dead (have crashed). Properties of impure simplicial complexescan be described in a three-valued multi-agent epistemic logic where the thirdvalue represents formulae that are undefined, e.g., the knowledge and localpropositions of dead agents. In this work we present an axiomatization for thelogic of the class of impure complexes and show soundness and completeness. Thecompleteness proof involves the novel construction of the canonical simplicialmodel and requires a careful manipulation of undefined formulae
Euclidean lattices: theory and applications
No full textIn this editorial survey we introduce the special issue of the journalCommunications in Mathematics on the topic in the title of the article. Ourmain goal is to briefly outline some of the main aspects of this important areaat the intersection of theory and applications, providing the context for thearticles showcased in this special issue.Comment: Communications in Mathematics 31 (2023), no. 2, 251--26