Skip to main content

Search

Show all results for

Home

Publication

A hybrid on-chip optonanomechanical transducer for ultra-sensitive force measurements

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Tobias Kippenberg, Emanuel Gavartin
2012

Abstract

We realize an integrated hybrid optonanomechanical transducer for the detection of weak forces. We propose and demonstrate with our system that dissipative feedback dramatically decreases the averaging time necessary to detect an incoherent force. (C) 2011 Optical Society of America

Official source

https://infoscience.epfl.ch/entities/publication/f82d782e-9961-4eed-8004-bd7464dc6a01

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (8)

Average-case complexity

In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the algorithm, averaged over all possible inputs. It is frequently contrasted with worst-case complexity which considers the maximal complexity of the algorithm over all possible inputs. There are three primary motivations for studying average-case complexity.

Van der Waals force

In molecular physics, the van der Waals force is a distance-dependent interaction between atoms or molecules. Unlike ionic or covalent bonds, these attractions do not result from a chemical electronic bond; they are comparatively weak and therefore more susceptible to disturbance. The van der Waals force quickly vanishes at longer distances between interacting molecules. Named after Dutch physicist Johannes Diderik van der Waals, the van der Waals force plays a fundamental role in fields as diverse as supramolecular chemistry, structural biology, polymer science, nanotechnology, surface science, and condensed matter physics.

Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.

Related publications (24)

Correlation properties of a one-dimensional repulsive Bose gas at finite temperature

We present a comprehensive study shedding light on how thermal fluctuations affect correlations in a Bose gas with contact repulsive interactions in one spatial dimension. The pair correlation function, the static structure factor, and the one-body density ...

IOP Publishing Ltd2023

Learning From Demonstration and Interactive Control of Variable-Impedance to Cut Soft Tissues

Aude Billard, Rui Wu

In this article, we propose an approach to extract variable-impedance during cutting tasks from human demonstrations, so as to ease soft-tissue cutting by robots. We model the dynamic adjustment of the human arm during interactions with the tissue and tran ...

2021

Modelling long-range interactions in multiscale simulations of ferromagnetic materials

Doghonay Arjmand

Atomistic-continuum multiscale modelling is becoming an increasingly popular tool for simulating the behaviour of materials due to its computational efficiency and reliable accuracy. In the case of ferromagnetic materials, the atomistic approach handles th ...

SPRINGER2020