Concept

Nombre de Bernoulli

Publications associées (20)

Double Quasi-Poisson Algebras are Pre-Calabi-Yau

In this article, we prove that double quasi-Poisson algebras, which are noncommutative analogues of quasi-Poisson manifolds, naturally give rise to pre-Calabi-Yau algebras. This extends one of the main results in [11], where a correspondence between certai ...

2022

Safety in Numbers: Asymptotic Analysis of a Monitoring Problem

Emre Telatar, Reka Inovan

In this work, we introduce a setup where a monitoring entity attempts to distinguish a cheating player among a group of regular players where all players behave in order to maximize their reward. We assume that the cheating player has an "information advan ...

IEEE2022

Efficient learning of smooth probability functions from Bernoulli tests with guarantees.

Volkan Cevher, Paul Thierry Yves Rolland, Ali Kavis

We study the fundamental problem of learning an unknown, smooth probability function via pointwise Bernoulli tests. We provide a scalable algorithm for efficiently solving this problem with rigorous guarantees. In particular, we prove the convergence rate ...

2019

Experimental Characterization of a T-Shaped Programmable Multistable Mechanism

Simon Nessim Henein, Mohamed Gamal Abdelrahman Ahmed Zanaty

Programmable multistable mechanisms (PMM) exhibit a modifiable stability behavior in which the number of stable states, stiffness, and reaction force characteristics are controlled via their programming inputs. In this paper, we present experimental charac ...

ASME2018

The multiple lives of the “Unité d’Habitation” (1945-1967-2017). Repetition of their iconic value and differences in the construction systems, from their development to their case histories

Franz Graf

The Unités d’Habitation designed by Le Corbusier and André Wogenscky represent an exceptional moment in the development of the culture of housing in the 20th century1. Five examples of them were built – at Marseilles (1945-1952), Rezé (1948-1955), Berlin ( ...

Docomomo International and Docomomo Slovenia2018

Bilinear forms with Kloosterman sums and applications

Philippe Michel

We prove nontrivial bounds for general bilinear forms in hyper-Kloosterman sums when the sizes of both variables may be below the range controlled by Fourier-analytic methods (Polya-Vinogradov range). We then derive applications to the second moment of cus ...

Annal Mathematics2017

Elastic and Inelastic Analysis of Frames with a Force-Based Higher-Order 3D Beam Element Accounting for Axial-Flexural-Shear-Torsional Interaction

João Saraiva Esteves Pacheco de Almeida

When one of the dimensions of a structural member is not clearly larger than the two orthogonal ones, engineers are usually compelled to simulate it with refined meshes of shell or solid finite elements that typically impose a large computational burden. T ...

Springer International Publishing2017

Modelling the Size Effects on the Mechanical Properties of Micro/Nano Structures

Luis Guillermo Villanueva Torrijo, Amir Musa Abazari

Experiments on micro- and nano-mechanical systems (M/NEMS) have shown that their behavior under bending loads departs in many cases from the classical predictions using Euler-Bernoulli theory and Hooke's law. This anomalous response has usually been seen a ...

MDPI Ag2015

Sequences with Minimal Time-Frequency Uncertainty

Martin Vetterli, Reza Parhizkar, Yann Barbotin

A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and frequency, defining a ...

Elsevier2015

Nonlinearity in nanomechanical cantilevers

Luis Guillermo Villanueva Torrijo

Euler-Bernoulli beam theory is widely used to successfully predict the linear dynamics of micro-and nanocantilever beams. However, its capacity to characterize the nonlinear dynamics of these devices has not yet been rigorously assessed, despite its use in ...

American Physical Society2013

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