Concept

Distance du grand cercle

Publications associées (43)

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

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

Quasi-stationary flow structure in turbidity currents

Giovanni De Cesare, Shun Nomura

A turbidity current is a particle-laden current driven by density differences due to suspended sediment particles. Turbidity currents can transport large amounts of sediment down slopes over great distances, and play a significant role in fluvial, lake and ...

IRTCES2020

Fundamental Limits for Implanted Antennas: Maximum Power Density Reaching Free Space

Anja Skrivervik, Zvonimir Sipus

Medical implants with communication capability are becoming increasingly popular with today’s trends to continuously monitor patient’s condition. This is a major challenge for antenna designers since the implants are inherently small and placed in a commun ...

2019

Radiation Limitations for Small Implanted Antennas

Anja Skrivervik, Zvonimir Sipus

IEEE2019

Quantifying bacterial structure of aerobic granular sludge using image analysis

Karen Gemayel

This Master’s project entitled ’Quantifying Bacterial Structure of Aerobic Granular Sludge using Image Analysis’ aims to quantitatively describe various aspects of cell activity inside aerobic granular sludge using image analysis. It entails the theory of ...

2019

Automated CT bone segmentation using statistical shape modelling and local template matching

Alexandre Terrier, Alain Farron, Elham Taghizadeh, Philippe Büchler

Accurate CT bone segmentation is essential to develop chair-side manufacturing of implants based on additive manufacturing. We herewith present an automated method able to accurately segment challenging bone regions, while simultaneously providing anatomic ...

2019

Distinct distances between points and lines

Frank de Zeeuw, Adrian Claudiu Valculescu, Shakhar Smorodinsky

We show that for m points and n lines in R-2, the number of distinct distances between the points and the lines is Omega(m(1/5)n(3/5)), as long as m(1/2)

Elsevier Science Bv2018

A statistical shape model to predict the premorbid glenoid cavity

Alexandre Terrier, Alain Farron, Steve Michel Berger, Daniel Abler, Philippe Büchler

Background: This study proposes a method for inferring the premorbid glenoid shape and orientation of scapulae affected by glenohumeral osteoarthritis (OA) to inform restorative surgery. Methods: A statistical shape model (SSM) built from 64 healthy scapul ...

MOSBY-ELSEVIER2018

Algebraic and topological methods in combinatorics

Adrian Claudiu Valculescu

The present thesis deals with problems arising from discrete mathematics, whose proofs make use of tools from algebraic geometry and topology. The thesis is based on four papers that I have co-authored, three of which have been published in journals, and o ...

EPFL2017

Distinct Distances on Algebraic Curves in the Plane

János Pach, Frank de Zeeuw

Let S be a set of n points in R-2 contained in an algebraic curve C of degree d. We prove that the number of distinct distances determined by S is at least c(d)n(4/3), unless C contains a line or a circle. We also prove the lower bound c(d)' min{m(2/3)n(2/ ...

Cambridge Univ Press2017

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