Samsung’s new app claims to alleviate motion sickness using sound
Samsung released a new free app today called Hearapy, now available for Android devices through the Google Play store, that it claims can reduce the symptoms of motion sickness using just sound. The app's functionality is very straightforward. It plays a low 100Hz sine wave tone through a pair of connected headphones for 60 seconds. […]
Andrew Liszewski
is a senior reporter who’s been covering and reviewing the latest gadgets and tech since 2006, but has loved all things electronic since he was a kid.
Samsung released a new free app today called Hearapy, now available for Android devices through the Google Play store, that it claims can reduce the symptoms of motion sickness using just sound.
The app’s functionality is very straightforward. It plays a low 100Hz sine wave tone through a pair of connected headphones for 60 seconds. This is supposed to stimulate the vestibular system – the parts of the inner ear that are responsible for orientation and maintaining balance. The app allows the duration of the tone to be adjusted between 40 to 120 seconds, but a full minute of listening is supposed to provide relief from motion sickeness symptoms like nausea for up to two hours. It can be repeated as needed.
Samsung says the app was inspired by research conducted by Nagoya University in Japan released last year that found specific sound wavelengths helped to reduce “the staggering and discomfort felt by people that were asked to read a document in a moving vehicle.” It’s not a guaranteed cure, however, and the effectiveness may vary based on the headphones you’re using. Samsung recommends pairing the app with its Galaxy Buds 4 Pro, but while Hearapy works with most headphones or earbuds, they need to be able to reproduce the tone at an 80 to 85-decibel volume level for it to be most effective.
Follow topics and authors from this story to see more like this in your personalized homepage feed and to receive email updates.
- Andrew Liszewski
The Verge AI
https://www.theverge.com/tech/904579/samsung-hearapy-mobile-app-galaxy-buds-motion-sickness-symptomsSign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
More about
releaseavailable
CogPic: A Multimodal Dataset for Early Cognitive Impairment Assessment via Picture Description Tasks
arXiv:2604.01626v1 Announce Type: new Abstract: The automated evaluation of cognitive status utilizing multimedia technologies presents a promising frontier in early dementia diagnosis. However, the development of robust machine learning models for cognitive impairment detection is frequently hindered by the scarcity of large-scale, strictly synchronized, and clinically validated multimodal datasets. To bridge this critical gap, we introduce the CogPic database, a comprehensive multimodal benchmark meticulously designed for fine-grained cognitive impairment detection. The dataset comprises strictly synchronized audio, visual, and linguistic data continuously collected from 574 participants during a naturalistic picture description task. To establish highly reliable diagnostic ground truth,
HippoMM: Hippocampal-inspired Multimodal Memory for Long Audiovisual Event Understanding
arXiv:2504.10739v2 Announce Type: replace-cross Abstract: Comprehending extended audiovisual experiences remains challenging for computational systems, particularly temporal integration and cross-modal associations fundamental to human episodic memory. We introduce HippoMM, a computational cognitive architecture that maps hippocampal mechanisms to solve these challenges. Rather than relying on scaling or architectural sophistication, HippoMM implements three integrated components: (i) Episodic Segmentation detects audiovisual input changes to split videos into discrete episodes, mirroring dentate gyrus pattern separation; (ii) Memory Consolidation compresses episodes into summaries with key features preserved, analogous to hippocampal memory formation; and (iii) Hierarchical Memory Retriev
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
More in Releases
trunk/834da621b18df19b513ee787c6926d43f928adfc: add API to check if a tensor is symm-mem-tensor (#178947)
In Helion autotuner, we need clone a input symm memory tensor properly if the kernel inplace update it. That requires us to know if a tensor is a symm memory tensor. Right now I call rendezvous for the tensor. If no exception is thrown, then it's a symm memory tensor. But it's not ideal there will be a lot of warnings complaining calling rendezvous on non-symm memory tensor I'll need to pass in the process group name to this API. But fundamentally check if a tensor is a symmetric memory tensor does not require the process group name. Pull Request resolved: #178947 Approved by: https://github.com/ngimel , https://github.com/fegin
DGAI: Decoupled On-Disk Graph-Based ANN Index for Efficient Updates and Queries
arXiv:2510.25401v3 Announce Type: replace Abstract: On-disk graph-based indexes are favored for billion-scale Approximate Nearest Neighbor Search (ANNS) due to their high performance and cost-efficiency. However, existing systems typically rely on a coupled storage architecture that co-locates vectors and graph topology, which introduces substantial redundant I/O during index updates, thereby degrading usability in dynamic workloads. In this paper, we propose a decoupled storage architecture that physically separates heavy vectors from the lightweight graph topology. This design substantially improves update performance by reducing redundant I/O during updates. However, it introduces I/O amplification during ANNS, leading to degraded query efficiency.To improve query performance within the
A Simple Average-case Analysis of Recursive Randomized Greedy MIS
arXiv:2604.01462v1 Announce Type: new Abstract: We revisit the complexity analysis of the recursive version of the randomized greedy algorithm for computing a maximal independent set (MIS), originally analyzed by Yoshida, Yamamoto, and Ito (2009). They showed that, on average per vertex, the expected number of recursive calls made by this algorithm is upper bounded by the average degree of the input graph. While their analysis is clever and intricate, we provide a significantly simpler alternative that achieves the same guarantee. Our analysis is inspired by the recent work of Dalirrooyfard, Makarychev, and Mitrovi\'c (2024), who developed a potential-function-based argument to analyze a new algorithm for correlation clustering. We adapt this approach to the MIS setting, yielding a more di
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!