Publications associées à Modeling and Flatness of Rigid and Flexible Cable Suspended Underactuated Robots

Publications associées (30)

Granular Avalanche Impact on a Structure using DEM and FEM

Mountain regions face a variety of natural hazards that menace infrastructure and the people living in these areas. Human activity in these areas is intensifying, making hazard analysis and risk mitigation critical. Switzerland, with its densely populated ...

2025

Data-driven models in fusion exhaust: AI methods and perspectives

Yoeri Renier Johannes Poels

A review is given on the highlights of a scatter-shot approach of developing machine-learning methods and artificial neural networks based fast predictors for the application to fusion exhaust. The aim is to enable and facilitate optimized and improved mod ...

IOP Publishing Ltd2024

Diversity of radial spin textures in chiral materials

Oleg Yazyev, Alberto Crepaldi, Daniel Gosalbez Martinez

We introduce a classification of the radial spin textures in momentum space that emerge at the high-symmetry points in crystals characterized by nonpolar chiral point groups (D2, D3, D4, D6, T, O). Based on the symmetry constraints imposed by these point g ...

Amer Physical Soc2023

Get the Best of Both Worlds: Improving Accuracy and Transferability by Grassmann Class Representation

Haoqi Wang

We generalize the class vectors found in neural networks to linear subspaces (i.e., points in the Grassmann manifold) and show that the Grassmann Class Representation (GCR) enables simultaneous improvement in accuracy and feature transferability. In GCR, e ...

Ieee Computer Soc2023

Overflow-free compute memories for edge AI acceleration

David Atienza Alonso, Giovanni Ansaloni, Alexandre Sébastien Julien Levisse, Flavio Ponzina, Marco Antonio Rios

Compute memories are memory arrays augmented with dedicated logic to support arithmetic. They support the efficient execution of data-centric computing patterns, such as those characterizing Artificial Intelligence (AI) algorithms. These architectures can ...

2023

ALMOST EVERYWHERE NONUNIQUENESS OF INTEGRAL CURVES FOR DIVERGENCE-FREE SOBOLEV VECTOR FIELDS

Massimo Sorella

We construct divergence-free Sobolev vector fields in C([0,1];W-1,W-r(T-d;Rd)) with r < d and d\geq 2 which simultaneously admit any finite number of distinct positive solutions to the continuity equation. These vector fields are then shown to have at leas ...

Siam Publications2023

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

Tommaso Vanzan

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

2022

Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault, Le Nguyen Hoang, Arsany Hany Abdelmessih Guirguis, Sadegh Farhadkhani

We study Byzantine collaborative learning, where n nodes seek to collectively learn from each others' local data. The data distribution may vary from one node to another. No node is trusted, and f < n nodes can behave arbitrarily. We prove that collaborati ...

2021

Further results on latent discourse models and word embeddings

Youssef Allouah

We discuss some properties of generative models for word embeddings. Namely, (Arora et al., 2016) proposed a latent discourse model implying the concentration of the partition function of the word vectors. This concentration phenomenon led to an asymptotic ...

Microtome Publishing2021

Coarse graining and large-N behavior of the d-dimensional N-clock model

Matthias Benjamin Ruf

We study the asymptotic behavior of the N-clock model, a nearest neighbors ferromagnetic spin model on the d-dimensional cubic epsilon-lattice in which the spin field is constrained to take values in a discretization S-N of the unit circle S-1 consisting o ...

2021

Gaussian Process Regression for Materials and Molecules

Michele Ceriotti, David Mark Wilkins

We provide an introduction to Gaussian process regression (GPR) machinelearning methods in computational materials science and chemistry. The focus of the present review is on the regression of atomistic properties: in particular, on the construction of in ...

AMER CHEMICAL SOC2021

Particle release and transport from human skin and clothing: A CFD modeling methodology

Dusan Licina, Shen Yang

Particle release from human skin and clothing has been identified as an important contributor to particulate matter burden indoors. However, knowledge about modeling the coarse particle release from skin and clothing is limited. This study developed a new ...

WILEY2021

Low-latency speaker spotting with online diarization and detection

Sébastien Marcel, Nicholas Evans

This paper introduces a new task termed low-latency speaker spotting (LLSS). Related to security and intelligence applications, the task involves the detection, as soon as possible, of known speakers within multi-speaker audio streams. The paper describes ...

2018

Lonely Runner Polyhedra

Matthias Schymura

We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...

2019

Positivity of the CM line bundle for families of K-stable klt Fano varieties

Zsolt Patakfalvi, Giulio Codogni

The Chow-Mumford (CM) line bundle is a functorial line bundle on the base of any family of klt Fano varieties. It is conjectured that it yields a polarization on the moduli space of K-poly-stable klt Fano varieties. Proving ampleness of the CM line bundle ...

2021

Locally supported tangential vector, n-vector, and tensor fields

Christopher Brandt

We introduce a construction of subspaces of the spaces of tangential vector, n-vector, and tensor fields on surfaces. The resulting subspaces can be used as the basis of fast approximation algorithms for design and processing problems that involve tangenti ...

2020

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Arithmetic and geometric structures in cryptography

Benjamin Pierre Charles Wesolowski

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

EPFL2018

Convergence of the Exponentiated Gradient Method with Armijo Line Search

Volkan Cevher, Yen-Huan Li

Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the expo-nentiated gradient method with Armijo line search always converges to the optimum, if ...

2019