Jiaye Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiaye Wu has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Kefeng Feng
School of Computer Science, Fudan University, Shanghai, China
1 shared publication - Peng Wang
College of Computer Science and Artificial Intelligence, Fudan University, Shanghai, China
1 shared publication - Wei Wang
College of Computer Science and Artificial Intelligence, Fudan University, Shanghai, China
1 shared publication
Latest Publications
- 31 December 2022
- Published by Channel View Publications, Ltd.
- p. 56-80
3 Teaching Mandarin Pronunciation to Mongolian Learners in Early Republican Period China: The Case of the Mongolian Han Original Sounds of the Five Regions (Meng Han Hebi Wufang Yuanyin, 蒙漢合璧五方元音)
3 Teaching Mandarin Pronunciation to Mongolian Learners in Early Republican Period China: The Case of the Mongolian Han Original Sounds of the Five Regions (Meng Han Hebi Wufang Yuanyin, 蒙漢合璧五方元音) was published in Language Standardisation and Language Variation in Multilingual Contexts on page 56.
- 31 December 2022
- Published by Channel View Publications, Ltd.
- p. 56-80
3 Teaching Mandarin Pronunciation to Mongolian Learners in Early Republican Period China: The Case of the Mongolian Han Original Sounds of the Five Regions (Meng Han Hebi Wufang Yuanyin, 蒙漢合璧五方元音)
3 Teaching Mandarin Pronunciation to Mongolian Learners in Early Republican Period China: The Case of the Mongolian Han Original Sounds of the Five Regions (Meng Han Hebi Wufang Yuanyin, 蒙漢合璧五方元音) was published in Language Standardisation and Language Variation in Multilingual Contexts on page 56.
- Open Access
- 13 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 71572-71583
L-Match: A Lightweight and Effective Subsequence Matching Approach
Many IoT (Internet of Things) applications, like the industrial internet and the smart city, collect data continuously from massive sensors. It is crucial to exploit and analyze the time series data efficiently. Subsequence matching is a fundamental task in mining time series data. Most existing woks develop the index and the matching approach for the static time series data. However, IoT applications need to continuous collect new data and deposit huge historical time series data, which pose a significant challenge for the static indexing approach. To address this challenge, we propose a lightweight index structure, L-index, and a matching approach, L-match, for the constraint normalized subsequence matching problem (cNSM). L-index is a two-layer structure and built on the simple series synopsis, the mean values of the disjoint windows. It is easy to build and update as data grows. Moreover, to further improve the efficiency for the variable query lengths, an optimization technique, named SD-pruning, is proposed. We conduct extensive experiments, and the results verify the effectiveness and efficiency of the proposed approach.
- 13 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 71572-71583
Open AccessL-Match: A Lightweight and Effective Subsequence Matching Approach
Many IoT (Internet of Things) applications, like the industrial internet and the smart city, collect data continuously from massive sensors. It is crucial to exploit and analyze the time series data efficiently. Subsequence matching is a fundamental task in mining time series data. Most existing woks develop the index and the matching approach for the static time series data. However, IoT applications need to continuous collect new data and deposit huge historical time series data, which pose a significant challenge for the static indexing approach. To address this challenge, we propose a lightweight index structure, L-index, and a matching approach, L-match, for the constraint normalized subsequence matching problem (cNSM). L-index is a two-layer structure and built on the simple series synopsis, the mean values of the disjoint windows. It is easy to build and update as data grows. Moreover, to further improve the efficiency for the variable query lengths, an optimization technique, named SD-pruning, is proposed. We conduct extensive experiments, and the results verify the effectiveness and efficiency of the proposed approach.