897 research outputs found

    Advances and Applications of DSmT for Information Fusion. Collected Works, Volume 5

    Get PDF
    This fifth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different fields 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 modified Proportional Conflict 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 classifiers, 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, identification of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classification. 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 classification, and hybrid techniques mixing deep learning with belief functions as well

    Set-based state estimation and fault diagnosis using constrained zonotopes and applications

    Full text link
    This doctoral thesis develops new methods for set-based state estimation and active fault diagnosis (AFD) of (i) nonlinear discrete-time systems, (ii) discrete-time nonlinear systems whose trajectories satisfy nonlinear equality constraints (called invariants), (iii) linear descriptor systems, and (iv) joint state and parameter estimation of nonlinear descriptor systems. Set-based estimation aims to compute tight enclosures of the possible system states in each time step subject to unknown-but-bounded uncertainties. To address this issue, the present doctoral thesis proposes new methods for efficiently propagating constrained zonotopes (CZs) through nonlinear mappings. Besides, this thesis improves the standard prediction-update framework for systems with invariants using new algorithms for refining CZs based on nonlinear constraints. In addition, this thesis introduces a new approach for set-based AFD of a class of nonlinear discrete-time systems. An affine parametrization of the reachable sets is obtained for the design of an optimal input for set-based AFD. In addition, this thesis presents new methods based on CZs for set-valued state estimation and AFD of linear descriptor systems. Linear static constraints on the state variables can be directly incorporated into CZs. Moreover, this thesis proposes a new representation for unbounded sets based on zonotopes, which allows to develop methods for state estimation and AFD also of unstable linear descriptor systems, without the knowledge of an enclosure of all the trajectories of the system. This thesis also develops a new method for set-based joint state and parameter estimation of nonlinear descriptor systems using CZs in a unified framework. Lastly, this manuscript applies the proposed set-based state estimation and AFD methods using CZs to unmanned aerial vehicles, water distribution networks, and a lithium-ion cell.Comment: My PhD Thesis from Federal University of Minas Gerais, Brazil. Most of the research work has already been published in DOIs 10.1109/CDC.2018.8618678, 10.23919/ECC.2018.8550353, 10.1016/j.automatica.2019.108614, 10.1016/j.ifacol.2020.12.2484, 10.1016/j.ifacol.2021.08.308, 10.1016/j.automatica.2021.109638, 10.1109/TCST.2021.3130534, 10.1016/j.automatica.2022.11042

    Exactly soluble models in many-body physics

    Get PDF
    Almost all phenomena in the universe are described, at the fundamental level, by quantum manybody models. In general, however, a complete understanding of large systems with many degrees of freedom is impossible. While in general many-body quantum systems are intractable, there are special cases for which there are techniques that allow for an exact solution. Exactly soluble models are interesting because they are soluble; beyond this, they can be used to gain intuition for further reaching many-body systems, including when they can be leveraged to help with numerical approximations for general models. The work presented in this thesis considers exactly soluble models of quantum many-body systems. The first part of this thesis extends the family of many-body spin models for which we can find a freefermion solution. A solution method that was developed for a specific free-fermion model is generalized in such a way that allows application to a broader class of many-body spin system than was previously known to be free. Models which admit a solution via this method are characterized by a graph theory invariants: in brief it is shown that a quantum spin system has an exact description via non-interacting fermions if its frustration graph is claw-free and contains a simplicial clique. The second part of this thesis gives an explicit example of how the usefulness of exactly soluble models can extend beyond the solution itself. This chapter pertains to the calculation of the topological entanglement entropy in topologically ordered loop-gas states. Topological entanglement entropy gives an understanding of how correlations may extend throughout a system. In this chapter the topological entanglement entropy of two- and three-dimensional loop-gas states is calculated in the bulk and at the boundary. We obtain a closed form expression for the topological entanglement in terms of the anyonic theory that the models support

    Mesoscopic Physics of Quantum Systems and Neural Networks

    Get PDF
    We study three different kinds of mesoscopic systems – in the intermediate region between macroscopic and microscopic scales consisting of many interacting constituents: We consider particle entanglement in one-dimensional chains of interacting fermions. By employing a field theoretical bosonization calculation, we obtain the one-particle entanglement entropy in the ground state and its time evolution after an interaction quantum quench which causes relaxation towards non-equilibrium steady states. By pushing the boundaries of the numerical exact diagonalization and density matrix renormalization group computations, we are able to accurately scale to the thermodynamic limit where we make contact to the analytic field theory model. This allows to fix an interaction cutoff required in the continuum bosonization calculation to account for the short range interaction of the lattice model, such that the bosonization result provides accurate predictions for the one-body reduced density matrix in the Luttinger liquid phase. Establishing a better understanding of how to control entanglement in mesoscopic systems is also crucial for building qubits for a quantum computer. We further study a popular scalable qubit architecture that is based on Majorana zero modes in topological superconductors. The two major challenges with realizing Majorana qubits currently lie in trivial pseudo-Majorana states that mimic signatures of the topological bound states and in strong disorder in the proposed topological hybrid systems that destroys the topological phase. We study coherent transport through interferometers with a Majorana wire embedded into one arm. By combining analytical and numerical considerations, we explain the occurrence of an amplitude maximum as a function of the Zeeman field at the onset of the topological phase – a signature unique to MZMs – which has recently been measured experimentally [Whiticar et al., Nature Communications, 11(1):3212, 2020]. By placing an array of gates in proximity to the nanowire, we made a fruitful connection to the field of Machine Learning by using the CMA-ES algorithm to tune the gate voltages in order to maximize the amplitude of coherent transmission. We find that the algorithm is capable of learning disorder profiles and even to restore Majorana modes that were fully destroyed by strong disorder by optimizing a feasible number of gates. Deep neural networks are another popular machine learning approach which not only has many direct applications to physical systems but which also behaves similarly to physical mesoscopic systems. In order to comprehend the effects of the complex dynamics from the training, we employ Random Matrix Theory (RMT) as a zero-information hypothesis: before training, the weights are randomly initialized and therefore are perfectly described by RMT. After training, we attribute deviations from these predictions to learned information in the weight matrices. Conducting a careful numerical analysis, we verify that the spectra of weight matrices consists of a random bulk and a few important large singular values and corresponding vectors that carry almost all learned information. By further adding label noise to the training data, we find that more singular values in intermediate parts of the spectrum contribute by fitting the randomly labeled images. Based on these observations, we propose a noise filtering algorithm that both removes the singular values storing the noise and reverts the level repulsion of the large singular values due to the random bulk

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    Neural function approximation on graphs: shape modelling, graph discrimination & compression

    Get PDF
    Graphs serve as a versatile mathematical abstraction of real-world phenomena in numerous scientific disciplines. This thesis is part of the Geometric Deep Learning subject area, a family of learning paradigms, that capitalise on the increasing volume of non-Euclidean data so as to solve real-world tasks in a data-driven manner. In particular, we focus on the topic of graph function approximation using neural networks, which lies at the heart of many relevant methods. In the first part of the thesis, we contribute to the understanding and design of Graph Neural Networks (GNNs). Initially, we investigate the problem of learning on signals supported on a fixed graph. We show that treating graph signals as general graph spaces is restrictive and conventional GNNs have limited expressivity. Instead, we expose a more enlightening perspective by drawing parallels between graph signals and signals on Euclidean grids, such as images and audio. Accordingly, we propose a permutation-sensitive GNN based on an operator analogous to shifts in grids and instantiate it on 3D meshes for shape modelling (Spiral Convolutions). Following, we focus on learning on general graph spaces and in particular on functions that are invariant to graph isomorphism. We identify a fundamental trade-off between invariance, expressivity and computational complexity, which we address with a symmetry-breaking mechanism based on substructure encodings (Graph Substructure Networks). Substructures are shown to be a powerful tool that provably improves expressivity while controlling computational complexity, and a useful inductive bias in network science and chemistry. In the second part of the thesis, we discuss the problem of graph compression, where we analyse the information-theoretic principles and the connections with graph generative models. We show that another inevitable trade-off surfaces, now between computational complexity and compression quality, due to graph isomorphism. We propose a substructure-based dictionary coder - Partition and Code (PnC) - with theoretical guarantees that can be adapted to different graph distributions by estimating its parameters from observations. Additionally, contrary to the majority of neural compressors, PnC is parameter and sample efficient and is therefore of wide practical relevance. Finally, within this framework, substructures are further illustrated as a decisive archetype for learning problems on graph spaces.Open Acces

    Biological Protein Patterning Systems across the Domains of Life: from Experiments to Modelling

    Full text link
    Distinct localisation of macromolecular structures relative to cell shape is a common feature across the domains of life. One mechanism for achieving spatiotemporal intracellular organisation is the Turing reaction-diffusion system (e.g. Min system in the bacterium Escherichia coli controlling in cell division). In this thesis, I explore potential Turing systems in archaea and eukaryotes as well as the effects of subdiffusion. Recently, a MinD homologue, MinD4, in the archaeon Haloferax volcanii was found to form a dynamic spatiotemporal pattern that is distinct from E. coli in its localisation and function. I investigate all four archaeal Min paralogue systems in H. volcanii by identifying four putative MinD activator proteins based on their genomic location and show that they alter motility but do not control MinD4 patterning. Additionally, one of these proteins shows remarkably fast dynamic motion with speeds comparable to eukaryotic molecular motors, while its function appears to be to control motility via interaction with the archaellum. In metazoa, neurons are highly specialised cells whose functions rely on the proper segregation of proteins to the axonal and somatodendritic compartments. These compartments are bounded by a structure called the axon initial segment (AIS) which is precisely positioned in the proximal axonal region during early neuronal development. How neurons control these self-organised localisations is poorly understood. Using a top-down analysis of developing neurons in vitro, I show that the AIS lies at the nodal plane of the first non-homogeneous spatial harmonic of the neuron shape while a key axonal protein, Tau, is distributed with a concentration that matches the same harmonic. These results are consistent with an underlying Turing patterning system which remains to be identified. The complex intracellular environment often gives rise to the subdiffusive dynamics of molecules that may affect patterning. To simulate the subdiffusive transport of biopolymers, I develop a stochastic simulation algorithm based on the continuous time random walk framework, which is then applied to a model of a dimeric molecular motor. This provides insight into the effects of subdiffusion on motor dynamics, where subdiffusion reduces motor speed while increasing the stall force. Overall, this thesis makes progress towards understanding intracellular patterning systems in different organisms, across the domains of life

    Deep learning applied to computational mechanics: A comprehensive review, state of the art, and the classics

    Full text link
    Three recent breakthroughs due to AI in arts and science serve as motivation: An award winning digital image, protein folding, fast matrix multiplication. Many recent developments in artificial neural networks, particularly deep learning (DL), applied and relevant to computational mechanics (solid, fluids, finite-element technology) are reviewed in detail. Both hybrid and pure machine learning (ML) methods are discussed. Hybrid methods combine traditional PDE discretizations with ML methods either (1) to help model complex nonlinear constitutive relations, (2) to nonlinearly reduce the model order for efficient simulation (turbulence), or (3) to accelerate the simulation by predicting certain components in the traditional integration methods. Here, methods (1) and (2) relied on Long-Short-Term Memory (LSTM) architecture, with method (3) relying on convolutional neural networks. Pure ML methods to solve (nonlinear) PDEs are represented by Physics-Informed Neural network (PINN) methods, which could be combined with attention mechanism to address discontinuous solutions. Both LSTM and attention architectures, together with modern and generalized classic optimizers to include stochasticity for DL networks, are extensively reviewed. Kernel machines, including Gaussian processes, are provided to sufficient depth for more advanced works such as shallow networks with infinite width. Not only addressing experts, readers are assumed familiar with computational mechanics, but not with DL, whose concepts and applications are built up from the basics, aiming at bringing first-time learners quickly to the forefront of research. History and limitations of AI are recounted and discussed, with particular attention at pointing out misstatements or misconceptions of the classics, even in well-known references. Positioning and pointing control of a large-deformable beam is given as an example.Comment: 275 pages, 158 figures. Appeared online on 2023.03.01 at CMES-Computer Modeling in Engineering & Science

    Process intensification of oxidative coupling of methane

    No full text
    corecore