Concept

Longueur d'un arc

Publications associées (83)

Plucking Motions for Tea Harvesting Robots Using Probabilistic Movement Primitives

This study proposes a harvesting robot capable of plucking tea leaves without cutting them with blades. To harvest high-quality tea, it is necessary to reproduce the plucking motion of breaking the petiole of the leaf, that is, the complicated human hand m ...

2020

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

3D Smith chart constant quality factor semi-circles contours for positive and negative resistance circuits

Mihai Adrian Ionescu, Andrei Müller

The article firstly proves that the constant quality factor (Q) contours for passive circuits, while represented on a 2D Smith chart, form circle arcs on a coaxal circle family. Furthermore, these circle arcs represent semi-circles families in the north he ...

2020

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

High Fidelity Visualization of Large Scale Digitally Reconstructed Brain Circuitry with Signed Distance Functions

Felix Schürmann, Marwan Muhammad Ahmed Abdellah, Alessandro Enrico Foni, Sébastien Nicolas Speierer, Samuel Lieven D. Lapere, Jonas Kristofer Karlsson

We explore a first proof-of-concept application for visualizing large scale digitally reconstructed brain circuitry using signed distance functions. The significance of our method is demonstrated in comparison with using implicit geometry that is limited t ...

IEEE2019

Iterative learning control of multivariable uncertain nonlinear systems with nonrepetitive trajectory

Mohamed Bouri

Iterative learning control (ILC) theory is based on the traditional assumptions of resetting condition and repetitive trajectory. To overcome these restrictions, a novel ILC is developed in this paper for MIMO uncertain nonlinear systems subject to externa ...

SPRINGER2019

An Any-Resolution Distributed Pressure Localization Scheme Using a Capacitive Soft Sensor Skin

Jamie Paik, Harshal Arun Sonar, Michelle Ching-Sum Yuen

We present a method to determine the location of an applied pressure on a large area, monolithic silicone based capacitive sensor. In contrast to pressure sensor arrays composed of n x n discrete sensors, we utilize a single sensor body with a single instr ...

2018

rDAN: Toward robust demand-aware network designs

Andreas Loukas

We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (eg, ProjecToR) and demand-aware peer-to-peer overlay networks (eg, SplayNets). This p ...

2018

Light refocusing with up-scalable resonant waveguide gratings in confocal prolate spheroid arrangements

Olivier Martin, Zdenek Benes, Benjamin Gallinet, Giorgio Quaranta, Guillaume Basset

Resonant waveguide gratings (RWGs) are thin-film structures, where coupled modesinterfere with the diffracted incoming wave and produce strong angular and spectral filtering. The combination of two finite-length and impedance matched RWGs allows the creati ...

2018

Improved stability of optimal traffic paths

Maria Colombo

Models involving branched structures are employed to describe several supply-demand systems such as the structure of the nerves of a leaf, the system of roots of a tree, and the nervous or cardiovascular systems. Given a flow (traffic path) that transports ...

2018

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