Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Triangle

Publications associées (25)

On the boundedness of n-folds with κ(X) = n - 1

Stefano Filipazzi

In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...

European Mathematical Soc-Ems2024

Chromatin organization in red triangles

Elisa Oricchio

This journal club by Elisa Oricchio highlights two studies published in 2012, which used chromatin conformation capture methods to detect the formation of self-interacting chromatin regions, known as topologically associating domains (TADs). ...

NATURE PORTFOLIO2023

Morphological flexibility in robotic systems through physical polygon meshing

Jamie Paik, Christoph Heinrich Belke, Kevin Andrew Holdcroft

Shape-changing robots adapt their own morphology to address a wider range of functions or environments than is possible with a fixed or rigid structure. Akin to biological organisms, the ability to alter shape or configuration emerges from the underlying m ...

Nature Portfolio2023

Effects of aquifer geometry on seawater intrusion in annulus segment island aquifers

David Andrew Barry, Zhaoyang Luo

Seawater intrusion in island aquifers was considered analytically, specifically for annulus segment aquifers (ASAs), i.e., aquifers that (in plan) have the shape of an annulus segment. Based on the Ghijben–Herzberg and hillslope-storage Boussinesq equation ...

2021

Crank arrangement for driving a mechanical oscillator

Simon Nessim Henein, Billy Nussbaumer, Romain Roger Henri Gillet

Crank arrangement (1) for driving a pin-driven two degrees? of freedom mechanical oscillator (5), comprising:- a crank element (7) arranged to be rotationally driven about an axis of rotation (19) by means of a mechanical source of energy (M),- a crank slo ...

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-Resolution Data Sets Unravel the Effects of Sources and Meteorological Conditions on Nitrate and Its Gas-Particle Partitioning

Athanasios Nenes

Nitrate is one of the most abundant inorganic water-soluble ions in fine particulate matter (PM2.5). However, the formation mechanism of nitrate in the ambient atmosphere, especially the impacts of its semivolatility and the various existing forms of nitro ...

2019

Fabrication and Characterisation of Epitaxial PMN-PT Nano-structures

Xiao Di

Downscaling of the minimal feature size, or the gate length has been the key for the exponential im-provement of the performance of the logic CMOS integrated circuits over the last six decades. How-ever, since about 2003, some fundamental limits in the dev ...

EPFL2019

New Moduli For Banach Spaces

Grigory Ivanov

Modifying the moduli of supporting convexity and supporting smoothness, we introduce new moduli for Banach spaces which occur, for example, as lengths of catheti of right-angled triangles (defined via so-called quasiorthogonality). These triangles have two ...

Tusi Mathematical Research Group2017

Foldable aircraft with protective cage for transportation and transportability

Dario Floreano, Stefano Mintchev, Przemyslaw Mariusz Kornatowski

An aerial vehicle, configured to transport cargo, and including a propulsion system and a foldable cage is described. The foldable cage is substantially linear while in a folded configuration, and substantially circular while in a deployed configuration. M ...

2017

On Simplices in Diameter Graphs in R-4

Andrei Kupavskii

A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...

Maik Nauka/Interperiodica/Springer2017

Near-field characterization of Bloch surface waves based 2D optical components

Richa Dubey

Bloch surface waves (BSWs) are surface electromagnetic modes that propagate at the interface between a multilayer substrate and a homogeneous external medium. The optical field of the surface mode is confined near the surface of the multilayer. This vertic ...

EPFL2017

Characterization of Surface State of Inert Particles: Case of Si and SiC

Hubert Girault, Fernando Cortes Salazar, Véronique Amstutz

Silicon and Silicon carbide particles have been investigated by the mean of infrared (IR) spectroscopy and X-ray photoelectron spectroscopy (XPS) to establish their surface states. The results of this research are based on the estimation of the area under ...

2016

Cocycle growth for the Steinberg representation

Thibaut Dumont

This thesis investigates the growth of the natural cocycle introduced by Klingler for the Steinberg representation. When possible, we extend the framework of simple algebraic groups over a local field to arbitrary Euclidean buildings. In rank one, the grow ...

EPFL2016

Tip-Seeking Active Contours for Bioimage Segmentation

Michaël Unser, Virginie Sophie Uhlmann

In the present paper, we address the problem of segmenting biological objects featuring corners. The main ingredients of our approach are automated feature-detection methods and mechanisms for introducing kinks in parametric spline snakes. We formulate a n ...

IEEE2015

Stability Results For The Volume Of Random Simplices

Gergely Ambrus

It is known that for a convex body K in R-d of volume one, the expected volume of random simplices in K is minimized if K is an ellipsoid, and for d = 2, maximized if K is a triangle. Here we provide corresponding stability estimates. ...

Johns Hopkins Univ Press2014

Exponentiality of the exchange algorithm for finding another room-partitioning

Laura Sanità

Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning for T is a subset R of the rooms such that each vertex of T is in exactly one room in R. Given a room-partitioning R for T, the exchange ...

Elsevier Science Bv2014

Diameter Graphs in R-4

Andrei Kupavskii

A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of different extremal properties of diameter graphs in and on a ...

Springer2014

Upper bounds for the perimeter of plane convex bodies

Filip Moric

We show that the maximum total perimeter of k plane convex bodies with disjoint interiors lying inside a given convex body C is equal to , in the case when C is a square or an arbitrary triangle. A weaker bound is obtained for general plane convex bodies. ...

Springer2014

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014

Publications associées (25)

On the boundedness of n-folds with κ(X) = n - 1

Stefano Filipazzi

In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...

European Mathematical Soc-Ems2024

High-Resolution Data Sets Unravel the Effects of Sources and Meteorological Conditions on Nitrate and Its Gas-Particle Partitioning

Athanasios Nenes

2019