Publication

Simplified Design Methodology for a Slotless Brushless DC Motor

Publications associées (28)

High energy-density electrostatic actuators for soft robotics

This thesis reports high energy-density electrostatic actuators for use in soft robotics. This thesis has two main parts: a) a detailed study of electro-adhesion using microfabricated electrodes, and b) a flexi-ble fiber-shaped linear motor. Electro-adhesi ...

EPFL2024

Course Design - A Visual and Modular Approach

Marc Laperrouza

This book has been designed for instructors in higher education or adult training who wish to develop a new course or revise an existing one. It adopts a practical, visual, and modular approach based on the principle of constructive alignment. At its heart ...

EPFL Press2024

Teaching Not To

Charlotte Malterre-Barthes

Two design studios were successively taught in two schools of architecture: one at the Harvard Graduate School of Design (GSD) and the other at the Swiss Federal Institute of Technology in Lausanne (EPFL) in Lausanne, Switzerland, based on "A Global Morato ...

Taylor & Francis Inc2024

The mouse motor system contains multiple premotor areas and partially follows human

Valerio Zerbi, Joanes Grandjean

While humans are known to have several premotor cortical areas, secondary motor cortex (M2) is often considered to be the only higher -order motor area of the mouse brain and is thought to combine properties of various human premotor cortices. Here, we sho ...

Cell Press2024

General and Unified Model of the Power Flow Problem in Multiterminal AC/DC Networks

Mario Paolone, Willem Lambrichts

This paper proposes a generic and unified model of the power flow (PF) problem for multiterminal hybrid AC/DC networks. The proposed model is an extension of the standard AC-PF. The DC network is treated as an AC one and, in addition to the Slack, PV and P ...

IEEE Institute of Electrical and Electronics Engineers2024

SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION

Caglar Gulcehre, Chang Chen

Diffusion-based generative methods have proven effective in modeling trajectories with offline datasets. However, they often face computational challenges and can falter in generalization, especially in capturing temporal abstractions for long- horizon tas ...

2024

The Current State of the OBI DICT Project: A Bilingual e-Dictionary of Oracle-Bone Inscriptions with AI Image Recognition

This article reports on the current state of the OBI DICT project, a bilingual e-dictionary of oracle-bone inscriptions (OBI), incorporating artificial intelligence (AI) image recognition technology. It first provides a brief overview of the development of ...

Buro Van Die Wat2024

Micropreparative Gel Electrophoresis for Purification of Nanoscale Bioconjugates

Ardemis Anoush Boghossian, Yahya Rabbani, Shang-Jung Wu, Vitalijs Zubkovs, Sayyed Hashem Sajjadi

Conventional techniques for purifying macromolecular conjugates often require complex and costly installments that are inaccessible to most laboratories. In this work, we develop a one-step micropreparative method based on a trilayered polyacrylamide gel e ...

2024

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

A Reduced Order Model for Domain Decompositions with Non-conforming Interfaces

Alfio Quarteroni, Andrea Manzoni

In this paper, we propose a reduced-order modeling strategy for two-way Dirichlet-Neumann parametric coupled problems solved with domain-decomposition (DD) sub-structuring methods. We split the original coupled differential problem into two sub-problems wi ...

Springer/Plenum Publishers2024

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024