Demo Data from VLDB 2026 / reviewers in the wild / expert
Chao-Yi Chen
dblp:139/4137
· DBLP profile ↗
4ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Interconnection networks and networks-on-chip · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip
crosstalk avoidance coding |
0.2 | 1 | 2015 | Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching · IEEE Trans. Computers 2015 |
Interconnection networks and networks-on-chip › bus-based interconnection
high-speed bus |
0.2 | 1 | 2015 | Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching · IEEE Trans. Computers 2015 |
Methods — techniques the papers use, named apart from their topics
markov chain analysis · 0.4bit-stuffing · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Evaluating the Performance of Chinese MultiLabel Grammatical Error Detection Using Deep Neural Networks
Tzu-Mi Lin, Chao-Yi Chen, Lung-Hao Lee, Yuen-Hsien Tseng |
ICCE | 2 |
| 2021 | Chinese Grammatical Error Detection Using Adversarial ELECTRA Transformers
Lung-Hao Lee, Man-Chen Hung, Chao-Yi Chen, Rou-An Chen, Yuen-Hsien Tseng |
ICCE | 3 |
| 2015 | Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed SwitchingabstractThe crosstalk effect is one of the main problems in deep sub-micron designs of high-speed buses. To mitigate the crosstalk effect, there are several types of crosstalk avoidance codes proposed in the literature. In this paper, we are particularly interested in generating forbidden transition codes that do not have opposite transitions on any two adjacent wires. For this, we propose asequential bit-stuffingalgorithm and aparallel bit-stuffingalgorithm. For the sequential bit-stuffing algorithm, we perform a worst-case analysis and a probabilistic analysis. We show by both theoretic analysis and simulations that the coding rate of the sequential bit-stuffing encoding scheme is quite close to the Shannon capacity. In particular, for a bus with$n=10$parallel wires, the difference is only 2.2 percent. Using a Markov chain analysis, we show that the coding rate of the parallel bit-stuffing algorithm is only slightly lower than that of the sequential bit-stuffing algorithm. The implementation complexity of the parallel bit-stuffing algorithm is linear with$n$. In comparison with the existing forbidden transition codes that use the Fibonacci representation in the literature, our bit-stuffing algorithms not only achieve higher coding rates but also have much lower implementation complexity. Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, Xuan-Chao Huang, Duan-Shin Lee, Chao-Yi Chen |
IEEE Trans. Computers | 6 |
| 2014 | Performance evaluation of an intelligent multimedia learning assistant platformabstractRecently, the literature reported that multimedia learning is more appealing and can increase learning effectiveness. Furthermore, cued retrospective reports (CRRs) can enhance students' learning performance, especially for the novices lacking prior knowledge. In this work, a multimedia learning assistant system is constructed by applying an eye-tracking technique to record and evaluate learner's CRRs. First, each student takes the test after watching the multimedia teaching animations. Those who cannot pass the test will be provided to watch the same video but with segmented video clips to reduce possible high cognitive load. Notably, one-class SVM classifier was applied to automatically judge whether the learners' concepts are correct. Experts' or high achievement peers' CRRs are provided to assist the low-achievement learners. Then, those low-achievement learners accept the second test to verify the effectiveness of our proposed system. 31 students in a junior high school participated in the pre-test, and 16 students did not pass the first test after watching the video. The experimental results revealed that these 16 students have increased their grades from 53.75 to 75. In addition, the classification rate can reach up to 94.59%. The proposed learning assistant system can effectively assist teachers in providing realtime assessment and feedback. Chenn-Jung Huang, Shun-Chih Chang, Heng-Ming Chen, Chao-Yi Chen |
FIE | 4 |