scispace - formally typeset
J

Jun Yang

Researcher at Duke University

Publications -  177
Citations -  5497

Jun Yang is an academic researcher from Duke University. The author has contributed to research in topics: Tuple & Wireless sensor network. The author has an hindex of 37, co-authored 167 publications receiving 5195 citations. Previous affiliations of Jun Yang include University of California, Berkeley & Durham University.

Papers
More filters
Patent

Cross-domain processing for noise and echo suppression

Jun Yang
TL;DR: In this article, an adaptive echo cancellation filter is used to reduce background noise and residual echo in an audio-based system, and the audio signal is then further processed in the frequency domain to reduce residual echo.

Adaptive Null-Forming Scheme in

TL;DR: An effective adaptive null-forming scheme for two nearby microphones in endfire orientation that are used in digital hearing aids and in many other hearing devices is proposed and the effectiveness of the proposed system and the accuracy of its implementation are demonstrated.
Journal ArticleDOI

Introduction to the Special Issue on Combating Digital Misinformation and Disinformation

TL;DR: This issue presents an overview of innovative research primarily at the intersection of information credibility, machine learning, and data science, from theory to practice, with a focus on combating misinformation and disinformation.
Patent

Non-uniform adaptive echo cancellation

TL;DR: In this article, an audio-based system may perform echo cancellation by decomposing an input audio signal and a corresponding reference signal into sub-signals corresponding to different frequency bands and implementing adaptive filtering independently for each frequency band.
Proceedings ArticleDOI

NEXSORT: sorting XML in external memory

TL;DR: It is proved that the I/O lower bound for sorting XML in external memory is /spl Theta/(max{n,nlog/sub m/(k/B)}), where n is the number of blocks in the input XML document, m is thenumber of main memory blocks available for sorting, B is theNumber of elements that can fit in one block, and k is the maximum fan-out of the input document tree.