Publications associées (24)

Quadratic serendipity element shape functions on general planar polygons

Xiaodong Wei, Juan Cao

This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...
ELSEVIER SCIENCE SA2022

On the Complete Radiation Pattern of a Vertical Hertzian Dipole Above a Low-Loss Ground

Krzysztof Michalski

The complete radiation field pattern of a vertical Hertzian dipole antenna on or above a lossless or low-loss dielectric half-space is studied using a rigorous Sommerfeld formalism. The reflected fields in the air above the interface and the subsurface fie ...
Piscataway2021

Propulsion module for generating wave-like motion

Auke Ijspeert, Peter Eckert

The present invention relates to a propulsion module (1) for generating wave-like motion in liquid. The propulsion module (1) comprises: a motor (7) for generating rotational motion; a set of conversion devices comprising a first conversion device (91) and ...
2020

Complexity of linear relaxations in integer programming

Matthias Schymura

For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...
2020

Clustered planarity testing revisited

Radoslav Fulek, Jan Kyncl, Igor Malinovic

The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generali ...
2015

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.