852 research outputs found
Advances and Applications of DSmT for Information Fusion. Collected Works, Volume 5
This ïŹfth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different ïŹelds of applications and in mathematics, and is available in open-access. The collected contributions of this volume have either been published or presented after disseminating the fourth volume in 2015 in international conferences, seminars, workshops and journals, or they are new. The contributions of each part of this volume are chronologically ordered.
First Part of this book presents some theoretical advances on DSmT, dealing mainly with modiïŹed Proportional ConïŹict Redistribution Rules (PCR) of combination with degree of intersection, coarsening techniques, interval calculus for PCR thanks to set inversion via interval analysis (SIVIA), rough set classiïŹers, canonical decomposition of dichotomous belief functions, fast PCR fusion, fast inter-criteria analysis with PCR, and improved PCR5 and PCR6 rules preserving the (quasi-)neutrality of (quasi-)vacuous belief assignment in the fusion of sources of evidence with their Matlab codes.
Because more applications of DSmT have emerged in the past years since the apparition of the fourth book of DSmT in 2015, the second part of this volume is about selected applications of DSmT mainly in building change detection, object recognition, quality of data association in tracking, perception in robotics, risk assessment for torrent protection and multi-criteria decision-making, multi-modal image fusion, coarsening techniques, recommender system, levee characterization and assessment, human heading perception, trust assessment, robotics, biometrics, failure detection, GPS systems, inter-criteria analysis, group decision, human activity recognition, storm prediction, data association for autonomous vehicles, identiïŹcation of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classiïŹcation.
Finally, the third part presents interesting contributions related to belief functions in general published or presented along the years since 2015. These contributions are related with decision-making under uncertainty, belief approximations, probability transformations, new distances between belief functions, non-classical multi-criteria decision-making problems with belief functions, generalization of Bayes theorem, image processing, data association, entropy and cross-entropy measures, fuzzy evidence numbers, negator of belief mass, human activity recognition, information fusion for breast cancer therapy, imbalanced data classiïŹcation, and hybrid techniques mixing deep learning with belief functions as well
To have done with theory? Baudrillard, or the literal confrontation with reality
Baudrillard, Eluding the temptation to reinterpret Jean Baudrillard once more, this work started from the ambition to consider his thought in its irreducibility, that is, in a radically literal way. Literalness is a recurring though overlooked term in Baudrillardâs oeuvre, and it is drawn from the direct concatenation of words in poetry or puns and other language games. It does not indicate a realist positivism but a principle that considers the metamorphoses and mutual alteration of things in their singularity without reducing them to a general equivalent (i.e. the meaning of words in a poem, which destroys its appearances).
Reapplying the idea to Baudrillard and finding other singular routes through his âpasswordsâ is a way to short-circuit its reductio ad realitatem and reaffirm its challenge to the hegemony of global integration. Even in the literature dedicated to it, this exercise has been rarer than the âhermeneuticalâ one, where Baudrillardâs oeuvre was taken as a discourse to be interpreted and explained (finding an equivalent for its singularity).
In plain polemic with any ideal of conformity between theory and reality (from which our present conformisms arguably derive, too), Baudrillard conceived thought not as something to be verified but as a series of hypotheses to be repeatedly radicalised â he often described it as a âspiralâ, a form which challenges the codification of things, including its own. Coherent with this, the thesis does not consider Baudrillardâs work either a reflection or a prediction of reality but, instead, an out-and-out act, a precious singular object which, interrogated, âthinksâ us and our current events âbackâ.
In the second part, Baudrillardâs hypotheses are taken further and measured in their capacity to challenge the reality of current events and phenomena. The thesis confronts the âhypocriticalâ position of critical thinking, which accepts the present principle of reality. It questions the interminability of our condition, where death seems thinkable only as a senseless interruption of the apparatus. It also confronts the solidarity between orthodox and alternative realities of the COVID pandemic and the Ukrainian invasion, searching for what is irreducible to the perfect osmosis of âvirtual and factualâ.
Drawing equally from the convulsions of globalisation and the psychopathologies of academics, from DeLilloâs fiction and Baudrillardâs lesser-studied influences, this study evaluates the irreversibility of our system against the increasingly silent challenges of radical thought. It looks for what an increasingly pessimistic late Baudrillard called ârogue singularitiesâ: forms which, often outside the conventional realms one would expect to find them, constitute potential sources of the fragility of global power.
âTo have done with theoryâ does not mean abandoning radical thought and, together with it, the singularity of humanity. It means, as the thesis concludes, the courage to leave conventional ideas of theory and listen to less audible voices which, at the heart of this âenormous conspiracyâ, whisper â as a mysterious lady in Mariupol did to Putin â âItâs all not true! Itâs all for show!â
Checking Presence Reachability Properties on Parameterized Shared-Memory Systems
We consider the verification of distributed systems composed of an arbitrary number of asynchronous processes. Processes are identical finite-state machines that communicate by reading from and writing to a shared memory. Beyond the standard model with finitely many registers, we tackle round-based shared-memory systems with fresh registers at each round. In the latter model, both the number of processes and the number of registers are unbounded, making verification particularly challenging. The properties studied are generic presence reachability objectives, which subsume classical questions such as safety or synchronization by expressing the presence or absence of processes in some states. In the more general round-based setting, we establish that the parameterized verification of presence reachability properties is PSPACE-complete. Moreover, for the roundless model with finitely many registers, we prove that the complexity drops down to NP-complete and we provide several natural restrictions that make the problem solvable in polynomial time
Canonical Algebraic Generators in Automata Learning
Many methods for the verification of complex computer systems require the existence of a tractable mathematical abstraction of the system, often in the form of an automaton. In reality, however, such a model is hard to come up with, in particular manually. Automata learning is a technique that can automatically infer an automaton model from a system -- by observing its behaviour. The majority of automata learning algorithms is based on the so-called L* algorithm. The acceptor learned by L* has an important property: it is canonical, in the sense that, it is, up to isomorphism, the unique deterministic finite automaton of minimal size accepting a given regular language. Establishing a similar result for other classes of acceptors, often with side-effects, is of great practical importance. Non-deterministic finite automata, for instance, can be exponentially more succinct than deterministic ones, allowing verification to scale. Unfortunately, identifying a canonical size-minimal non-deterministic acceptor of a given regular language is in general not possible: it can happen that a regular language is accepted by two non-isomorphic non-deterministic finite automata of minimal size. In particular, it thus is unclear which one of the automata should be targeted by a learning algorithm. In this thesis, we further explore the issue and identify (sub-)classes of acceptors that admit canonical size-minimal representatives.
In more detail, the contributions of this thesis are three-fold.
First, we expand the automata (learning) theory of Guarded Kleene Algebra with Tests (GKAT), an efficiently decidable logic expressive enough to model simple imperative programs. In particular, we present GL*, an algorithm that learns the unique size-minimal GKAT automaton for a given deterministic language, and prove that GL* is more efficient than an existing variation of L*. We implement both algorithms in OCaml, and compare them on example programs.
Second, we present a category-theoretical framework based on generators, bialgebras, and distributive laws, which identifies, for a wide class of automata with side-effects in a monad, canonical target models for automata learning. Apart from recovering examples from the literature, we discover a new canonical acceptor of regular languages, and present a unifying minimality result.
Finally, we show that the construction underlying our framework is an instance of a more general theory. First, we see that deriving a minimal bialgebra from a minimal coalgebra can be realized by applying a monad on a category of subobjects with respect to an epi-mono factorisation system. Second, we explore the abstract theory of generators and bases for algebras over a monad: we discuss bases for bialgebras, the product of bases, generalise the representation theory of linear maps, and compare our ideas to a coalgebra-based approach
Sequential decomposition of propositional logic programs
The sequential composition of propositional logic programs has been recently
introduced. This paper studies the sequential {\em decomposition} of programs
by studying Green's relations -- well-known in semigroup
theory -- between programs. In a broader sense, this paper is a further step
towards an algebraic theory of logic programming.Comment: arXiv admin note: text overlap with arXiv:2109.05300,
arXiv:2009.0577
Reasoning about quantities and concepts: studies in social learning
We live and learn in a âsociety of mindâ. This means that we form beliefs not
just based on our own observations and prior expectations but also based on the
communications from other people, such as our social network peers. Across seven
experiments, I study how people combine their own private observations with other
peopleâs communications to form and update beliefs about the environment. I will
follow the tradition of rational analysis and benchmark human learning against optimal Bayesian inference at Marrâs computational level. To accommodate human
resource constraints and cognitive biases, I will further contrast human learning
with a variety of process level accounts. In Chapters 2â4, I examine how people
reason about simple environmental quantities. I will focus on the effect of dependent information sources on the success of group and individual learning across a
series of single-player and multi-player judgement tasks. Overall, the results from
Chapters 2â4 highlight the nuances of real social network dynamics and provide
insights into the conditions under which we can expect collective success versus
failures such as the formation of inaccurate worldviews. In Chapter 5, I develop a
more complex social learning task which goes beyond estimation of environmental
quantities and focuses on inductive inference with symbolic concepts. Here, I investigate how people search compositional theory spaces to form and adapt their
beliefs, and how symbolic belief adaptation interfaces with individual and social
learning in a challenging active learning task. Results from Chapter 5 suggest that
people might explore compositional theory spaces using local incremental search;
and that it is difficult for people to use another personâs learning data to improve
upon their hypothesis
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Checking Presence Reachability Properties on Parameterized Shared-Memory Systems
We consider the verification of distributed systems composed of an arbitrary
number of asynchronous processes. Processes are identical finite-state machines
that communicate by reading from and writing to a shared memory. Beyond the
standard model with finitely many registers, we tackle round-based
shared-memory systems with fresh registers at each round. In the latter model,
both the number of processes and the number of registers are unbounded, making
verification particularly challenging. The properties studied are generic
presence reachability objectives, which subsume classical questions such as
safety or synchronization by expressing the presence or absence of processes in
some states. In the more general round-based setting, we establish that the
parameterized verification of presence reachability properties is
PSPACE-complete. Moreover, for the roundless model with finitely many
registers, we prove that the complexity drops down to NP-complete and we
provide several natural restrictions that make the problem solvable in
polynomial time.Comment: 27 pages, 6 figure
Konzeption und Realisierung eines Multiagentensystems zur UnterstĂŒtzung von EntscheidungstrĂ€gern bei der BewĂ€ltigung von Erdbebenkatastrophen
Weltweit stellen GroĂschadensereignisse aufgrund von Naturkatastrophen Gesellschaften vor schwer zu bewĂ€ltigende Probleme. Selbst in Industrienation, die landesweit ĂŒber ausreichende Ressourcen verfĂŒgen, ist das Krisenmanagement in einer betroffenen Region oft eine Herausforderung, wie der Hurrikan Katrina 2005 in den USA oder das Oderhochwasser 1997 in Deutschland zeigten. Bei Erdbebenkatastrophen ist ein zeitnahes Krisenmanagement entscheidend fĂŒr eine Minimierung der SchĂ€den. Die Orte, die potenziell gefĂ€hrdet sind, lassen sich meist gut eingrenzen. Es gibt allerdings aktuell keine Möglichkeit, Starkbeben mit einem entsprechenden Schadensumfang frĂŒhzeitig vorauszusehen. Die Optimierung der Koordination von EinsatzkrĂ€ften hat das Potenzial, die BewĂ€ltigung solcher GroĂschadensereignisse deutlich zu verbessern.
Aufbauend auf den Ergebnissen vorangegangener Forschung zum Management von Erdbebenkatastrophen am Institut fĂŒr Technologie und Management im Baubetrieb wurde in der vorliegenden Arbeit ein EntscheidungsunterstĂŒtzungssystem fĂŒr die Mitarbeiter einer Einsatzleitstelle geschaffen. In einem theoretischen Teil werden mögliche Hilfestellungen untersucht und bewertet, deren praktischer Nutzen durch die Umsetzung in einem Programm, dem Disaster Management Tool (DMT), evaluiert wird. Ein Modell des Entscheidungsprozesses von Personen aus dem Zivilschutz dient als Anhaltspunkt fĂŒr mögliche Hilfestellungen sowie deren PrĂ€sentation in der BenutzungsoberflĂ€che des Systems.
Die Entscheidungshilfen basieren auf der Auswertung einer Faktenbasis durch Algorithmen und Regeln, die in einer Wissensbasis abgelegt sind. Die Regeln beruhen auf Literaturrecherchen, aber insbesondere auf dem Expertenwissen von Zivilschutzmitarbeitern, welches in Befragungen erhoben wurde. Die im System genutzte Fakten- und Wissensbasis zeichnet sich vor allem durch ihre FĂ€higkeit zur Verarbeitung unscharfer Informationen aus. Die Implementierung der theoretischen Modelle zur EntscheidungsunterstĂŒtzung im DMT basiert auf dem Konzept eines Multiagentensystems. Das System dient, aufgrund seiner auf Standards basierenden Plattform und der Nutzung offener Datenformate, auch als Machbarkeitsstudie fĂŒr das Design einer flexiblen und interoperablen Systemarchitektur. Die gewonnenen Erkenntnisse beschrĂ€nken sich dabei nicht auf das Katastrophenmanagement nach Starkbeben, sondern lassen sich auch auf Schadensereignisse aufgrund anderer Ursachen ĂŒbertragen
- âŠ