Concept

Topologie algébrique

Publications associées (74)

Alternative, Magnetically-Levitated Motor Topologies for High Speed

A slotless magnetically-levitated high speed motor had been designed and build prior to the beginning of this project. This report presents the work done to develop a slotted alternative design to this motor. In this study, the principle of magnetically-le ...

2020

An effective proof of the Cartan formula: The even prime

Anibal Maximiliano Medina Mardones

The Cartan formula encodes the relationship between the cup product and the action of the Steenrod algebra in F-p-cohomology. In this work, we present an effective proof of the Cartan formula at the cochain level when the field is F-2. More explicitly, for ...

2020

A Computational Comparison Between Isogeometric Analysis and Spectral Element Methods: Accuracy and Spectral Properties

Alfio Quarteroni, Ondine Gabrielle Chanon

In this paper, we carry out a systematic comparison between the theoretical properties of Spectral Element Methods and NURBS-based Isogeometric Analysis in its basic form, that is in the framework of the Galerkin method, for the approximation of the Poisso ...

SPRINGER/PLENUM PUBLISHERS2020

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Andreas Peter Burg

We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Graph Learning Under Partial Observability

Ali H. Sayed, Augusto José Rabelo Almeida Santos

Many optimization, inference, and learning tasks can be accomplished efficiently by means of decentralized processing algorithms where the network topology (i.e., the graph) plays a critical role in enabling the interactions among neighboring nodes. There ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

On The Move: Localization With Kinetic Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Puoya Tabaghi

In this paper, we propose kinetic Euclidean distance matrices (KEDMs) a new algebraic tool for localization of moving points from spatio temporal distance measurements. KEDMs are inspired by the well-known Euclidean distance matrices (EDM) which model stat ...

IEEE2019

GOT: An Optimal Transport framework for Graph comparison

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic, Giovanni Chierchia

We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

Exact Synthesis of LTL Properties from Traces

Heinz Riener

We present an exact approach to synthesize temporal-logic formulas in linear temporal logic (LTL) from a set of given positive and negative example traces. Our approach uses topology structures, in particular partial DAGs, to partition the search space int ...

IEEE2019

Objective Morphological Classification of Neocortical Pyramidal Cells

Henry Markram, Kathryn Hess Bellwald, Srikanth Ramaswamy, Rodrigo de Campos Perin, Marwan Muhammad Ahmed Abdellah, Lida Kanari, Ying Shi, Julie Meystre, Yun Wang

A consensus on the number of morphologically different types of pyramidal cells (PCs) in the neocortex has not yet been reached, despite over a century of anatomical studies, due to the lack of agreement on the subjective classifications of neuron types, w ...

Oxford University Press (OUP)2019

Kaleidoscopic groups: permutation groups constructed from dendrite homeomorphisms

Nicolas Monod

Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite permutation group ...

POLISH ACAD SCIENCES INST MATHEMATICS-IMPAN2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search