2,344 research outputs found

    Deep Room Recognition Using Inaudible Echos

    Full text link
    Recent years have seen the increasing need of location awareness by mobile applications. This paper presents a room-level indoor localization approach based on the measured room's echos in response to a two-millisecond single-tone inaudible chirp emitted by a smartphone's loudspeaker. Different from other acoustics-based room recognition systems that record full-spectrum audio for up to ten seconds, our approach records audio in a narrow inaudible band for 0.1 seconds only to preserve the user's privacy. However, the short-time and narrowband audio signal carries limited information about the room's characteristics, presenting challenges to accurate room recognition. This paper applies deep learning to effectively capture the subtle fingerprints in the rooms' acoustic responses. Our extensive experiments show that a two-layer convolutional neural network fed with the spectrogram of the inaudible echos achieve the best performance, compared with alternative designs using other raw data formats and deep models. Based on this result, we design a RoomRecognize cloud service and its mobile client library that enable the mobile application developers to readily implement the room recognition functionality without resorting to any existing infrastructures and add-on hardware. Extensive evaluation shows that RoomRecognize achieves 99.7%, 97.7%, 99%, and 89% accuracy in differentiating 22 and 50 residential/office rooms, 19 spots in a quiet museum, and 15 spots in a crowded museum, respectively. Compared with the state-of-the-art approaches based on support vector machine, RoomRecognize significantly improves the Pareto frontier of recognition accuracy versus robustness against interfering sounds (e.g., ambient music).Comment: 29 page

    Bounded Gaps Between Products of Distinct Primes

    Full text link
    Let r≥2r \ge 2 be an integer. We adapt the Maynard-Tao sieve to produce the asymptotically best-known bounded gaps between products of rr distinct primes. Our result applies to positive-density subsets of the primes that satisfy certain equidistribution conditions. This improves on the work of Thorne and Sono

    A new proof of some polynomial inequalities related to pseudo-splines

    Get PDF
    AbstractPseudo-splines of type I were introduced in [I. Daubechies, B. Han, A. Ron, Z. Shen, Framelets: MRA-based constructions of wavelet frames, Appl. Comput. Harmon. Anal. 14 (2003) 1–46] and [Selenick, Smooth wavelet tight frames with zero moments, Appl. Comput. Harmon. Anal. 10 (2000) 163–181] and type II were introduced in [B. Dong, Z. Shen, Pseudo-splines, wavelets and framelets, Appl. Comput. Harmon. Anal. 22 (2007) 78–104]. Both types of pseudo-splines provide a rich family of refinable functions with B-splines, interpolatory refinable functions and refinable functions with orthonormal shifts as special examples. In [B. Dong, Z. Shen, Pseudo-splines, wavelets and framelets, Appl. Comput. Harmon. Anal. 22 (2007) 78–104], Dong and Shen gave a regularity analysis of pseudo-splines of both types. The key to regularity analysis is Proposition 3.2 in [B. Dong, Z. Shen, Pseudo-splines, wavelets and framelets, Appl. Comput. Harmon. Anal. 22 (2007) 78–104], which also appeared in [A. Cohen, J.P. Conze, Régularité des bases d'ondelettes et mesures ergodiques, Rev. Mat. Iberoamericana 8 (1992) 351–365] and [I. Daubechies, Ten Lectures on Wavelets, CBMS-NSF Series in Applied Mathematics, SIAM, Philadelphia, 1992] for the case l=N−1. In this note, we will give a new insight into this proposition

    Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

    Full text link
    Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.Comment: 26 pages, 6 fgures; IEEE Journals on Selected Areas in Communications, 201

    DENFIS: Dynamic Evolving Neural-Fuzzy Inference System and its Application for Time Series Prediction

    Get PDF
    This paper introduces a new type of fuzzy inference systems, denoted as DENFIS (dynamic evolving neural-fuzzy inference system), for adaptive on-line and off-line learning, and their application for dynamic time series prediction. DENFIS evolve through incremental, hybrid (supervised/unsupervised), learning and accommodate new input data, including new features, new classes, etc. through local element tuning. New fuzzy rules are created and updated during the operation of the system. At each time moment the output of DENFIS is calculated through a fuzzy inference system based on m-most activated fuzzy rules which are dynamically chosen from a fuzzy rule set. Two approaches are proposed: (1) dynamic creation of a first-order TakagiSugeno type fuzzy rule set for a DENFIS on-line model; (2) creation of a first-order TakagiSugeno type fuzzy rule set, or an expanded high-order one, for a DENFIS off-line model. A set of fuzzy rules can be inserted into DENFIS before, or during its learning process. Fuzzy rules can also be extracted during the learning process or after it. An evolving clustering method (ECM), which is employed in both on-line and off-line DENFIS models, is also introduced. It is demonstrated that DENFIS can effectively learn complex temporal sequences in an adaptive way and outperform some well known, existing models
    • …
    corecore