Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Comparaison de topologies

Publications associées (25)

Memento Mori: Reliable robustness in self-reconfigurable modular robots

Kevin Andrew Holdcroft

Modular robotics link the reliability of a centralised system with the adaptivity of a decentralised system. It is difficult for a robot with a fixed shape to be able to perform many different types of tasks. As the task space grows, the number of functi ...

EPFL2024

Decentralized learning made easy with DecentralizePy

Anne-Marie Kermarrec, Rafael Pereira Pires, Rishi Sharma, Akash Balasaheb Dhasade, Milos Vujasinovic

Decentralized learning (DL) has gained prominence for its potential benefits in terms of scalability, privacy, and fault tolerance. It consists of many nodes that coordinate without a central server and exchange millions of parameters in the inherently ite ...

2023

Connecting Hodge and Sakaguchi-Kuramoto through a mathematical framework for coupled oscillators on simplicial complexes

Alexis Arnaudon

Phase synchronizations in models of coupled oscillators such as the Kuramoto model have been widely studied with pairwise couplings on arbitrary topologies, showing many unexpected dynamical behaviors. Here, based on a recent formulation the Kuramoto model ...

NATURE PORTFOLIO2022

iPool--Information-Based Pooling in Hierarchical Graph Neural Networks

Pascal Frossard

With the advent of data science, the analysis of network or graph data has become a very timely research problem. A variety of recent works have been proposed to generalize neural networks to graphs, either from a spectral graph theory or a spatial perspec ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Atomic subgraphs and the statistical mechanics of networks

Sofia Charlotta Olhede

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges, but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows for the generation of graphs with extens ...

2021

SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism

Giovanni De Micheli, Mathias Soeken, Winston Jason Haaswijk

Exact synthesis is a versatile logic synthesis technique with applications to logic optimization, technology mapping, synthesis for emerging technologies, and cryptography. In recent years, advances in SAT solving have lead to a heightened research effort ...

2020

Separating the roles of magnetic topology and neutral trapping in modifying the detachment threshold for TCV

Christian Gabriel Theiler, Kevin Henricus Annemarie Verhaegh, Mirko Wensing

Total flux expansion, a divertor magnetic topology design choice embodied in the Super-X divertor, is predicted through simple analytic models and SOLPS calculations to reduce the plasma and impurity density detachment thresholds as the outer divertor sepa ...

IOP PUBLISHING LTD2020

Complex polymer topologies and polymer-nanoparticle hybrid films prepared via surface-initiated controlled radical polymerization

Harm-Anton Klok, Piotr Mocny

Advances in controlled radical polymerization over the past two decades have transformed the ability to produce molecularly well-defined, chain-end tethered polymer brush films. The assets of controlled radical polymerization reactions have impacted the sy ...

PERGAMON-ELSEVIER SCIENCE LTD2020

On Cyclic Dependencies and Regulators in Time-Sensitive Networks

Jean-Yves Le Boudec, Ludovic Bernard Gérard Thomas

For time-sensitive networks, as in the context of IEEE TSN and IETF Detnet, cyclic dependencies are associated with certain fundamental properties such as improving availability and decreasing reconfiguration effort. Nevertheless, the existence of cyclic d ...

IEEE2020

Dynamic Clustering and Control for Large Scale Urban Networks

Mohammadreza Saeedmanesh

Traffic congestion is a significant issue in all urban areas with concentration of activities for various city topologies and distribution of population and land use around the world. Developing realistic models that are able to replicate congestion spread ...

EPFL2018

A Continuation Multi Level Monte Carlo (C-MLMC) method for uncertainty quantification in compressible inviscid aerodynamics

Fabio Nobile, Pénélope Leyland, Michele Pisaroni

In this work we apply the Continuation Multi-Level Monte Carlo (C-MLMC) algorithm proposed in Collier et al. (2014) to efficiently propagate operating and geometric uncertainties in inviscid compressible aerodynamics numerical simulations. The key idea of ...

Elsevier2017

Distributed Particle Swarm Optimization - Particle Allocation and Neighborhood Topologies for the Learning of Cooperative Robotic Behaviors

Alcherio Martinoli, Inaki Navarro Oiza, Ezequiel Leonardo Di Mario

In this article we address the automatic synthesis of controllers for the coordinated movement of multiple mobile robots, as a canonical example of cooperative robotic behavior. We use five distributed noise-resistant variations of Particle Swarm Optimizat ...

2015

Stable blow up dynamics for energy supercritical wave equations

Roland Donninger

We study the semilinear wave equation

\displaystyle \partial _t^2 \psi -\Delta \psi =\vert\psi \vert^{p-1}\psi

for

p > 3

with radial data in three spatial dimensions. There exists an explicit solution which blows up at

t=T>0

given by $\displaystyl ...

American Mathematical Society2014

A codimension two stable manifold of near soliton equivariant wave maps

Joachim Krieger

We consider finite-energy equivariant solutions for the wave map problem from ℝ2+1 to S2 which are close to the soliton family. We prove asymptotic orbital stability for a codimension-two class of initial data which is small with respect to a stronger topo ...

Mathematical Science Publ2013

Computing Accurate Performance Bounds for Best Effort Networks-on-Chip

Giovanni De Micheli, Luca Benini, Srinivasan Murali, Federico Angiolini, Hamid Sarbazi-Azad, Dara Rahmati

Real-time (RT) communication support is a critical requirement for many complex embedded applications which are currently targeted to Network-on-chip (NoC) platforms. In this paper, we present novel methods to efficiently calculate worst- case bandwidth an ...

Institute of Electrical and Electronics Engineers2013

Power Distribution Solutions for Large Hadron Collider Upgrades

In view of the Large Hadrons Collider experiments upgrade, where the inner front-end electronics will require higher supply power, a new power distribution scheme has to be designed. This thesis presents a new and more efficient scheme based on step-down D ...

EPFL2012

Elasto-static micropolar behavior of a chiral auxetic lattice

Alessandro Spadoni

Auxetic materials expand when stretched, and shrink when compressed. This is the result of a negative Poisson's ratio ν. Isotropic configurations with ν≈−1 have been designed and are expected to provide increased shear stiffness G. This assumes that Young' ...

Elsevier2012

A versatile DC/DC converter based on Modular Multilevel Converter for energy collection and distribution

Drazen Dujic, Alfred Rufer, Stephan Kenzelmann

A topology based on the Modular Multilevel Converter (MMC) is presented, using two MMC linked by a medium frequency transformer. The back to back structure proves to have effective circuit breaker properties and reduced passive components. Due to the adopt ...

2011

Parallel Programmable Asynchronous Neighborhood Mechanism for Kohonen SOM Implemented in CMOS Technology

Rafal Tomasz Dlugosz

We present a new programmable neighborhood mechanism for hardware implemented Kohonen self-organizing maps (SOMs) with three different map topologies realized on a single chip. The proposed circuit comes as a fully parallel and asynchronous architecture. T ...

Institute of Electrical and Electronics Engineers2011

The Complexity Of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

Society for Industrial and Applied Mathematics2011