Concept

Fonction analytique

Publications associées (106)

On the Sums over Inverse Powers of Zeros of the Hurwitz Zeta Function and Some Related Properties of These Zeros

Recently, we have applied the generalized Littlewood theorem concerning contour integrals of the logarithm of the analytical function to find the sums over inverse powers of zeros for the incomplete gamma and Riemann zeta functions, polygamma functions, an ...

MDPI2024

Functional-Basis Analysis of Non-Stationary Signals in Modern Power Grids: Theory and Implementation in Embedded Systems

Alexandra Cameron Karpilow

Situational awareness strategies are essential for the reliable and secure operation of the electric power grid which represents critical infrastructure in modern society. With the rise of converter-interfaced renewable generation and the consequent shift ...

EPFL2024

On the Use of the Generalized Littlewood Theorem Concerning Integrals of the Logarithm of Analytical Functions for the Calculation of Infinite Sums and the Analysis of Zeroes of Analytical Functions

Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of an analytical function to obtain a few new criteria equivalent to the Riemann hypothesis. Here, the same theorem is applied to calcul ...

MDPI2023

The Källén-Lehmann representation in de Sitter spacetime

Manuel Loparco, Kamran Salehi Vaziri

We study two-point functions of symmetric traceless local operators in the bulk of de Sitter spacetime. We derive the Kallen-Lehmann spectral decomposition for any spin and show that unitarity implies its spectral densities are nonnegative. In addition, we ...

New York2023

Signal strength and integrated intensity in confocal and image scanning microscopy

Giorgio Tortarolo

The properties of signal strength and integrated intensity in a scanned imaging system are reviewed. These prop-erties are especially applied to confocal imaging systems, including image scanning microscopy. The integrated intensity, equal to the image of ...

Optica Publishing Group2023

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Nicolas Henri Bernard Flammarion

We consider the problem of sampling from a density of the form p(x) ? exp(-f (x) - g(x)), where f : Rd-+ R is a smooth function and g : R-d-+ R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework. Under ...

MICROTOME PUBL2022

WeChat as an unavoidable research tool for fieldwork, and its problems

Mengke Zhang

I did not use WeChat as my main method or main source of materials, but I realized that during my fieldwork in China, I did use WeChat very often to help me collect data, and I see the potential of using WeChat as an increasingly important method for furth ...

2022

Implicit Distance Functions: Learning and Applications in Control

Aude Billard, Mikhail Koptev, Nadia Barbara Figueroa Fernandez

This paper describes a novel approach to learn an implicit, differentiable distance function for arbitrary configurations of a robotic manipulator used for reactive control. By exploiting GPU processing, we efficiently query the learned collision represent ...

2022

An analytical inverse analysis to determine equi-biaxial tensile properties of strain-hardening UHPFRC from ringon-ring test (vol 53, 123, 2020)

Eugen Brühwiler, Emmanuel Denarié, Xiujiang Shen, Wanghu Peng

The article "An analytical inverse analysis to determine equi-biaxial tensile properties of strain-hardening UHPFRC from ringon-ring test", written by Xiujiang Shen, Eugen Bruhwiler, Emmanuel Denarie and Wanghu Peng was originally published electronically ...

SPRINGER2021

Coarse graining and large-N behavior of the d-dimensional N-clock model

Matthias Ruf

We study the asymptotic behavior of the N-clock model, a nearest neighbors ferromagnetic spin model on the d-dimensional cubic epsilon-lattice in which the spin field is constrained to take values in a discretization S-N of the unit circle S-1 consisting o ...

2021

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