Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Cheng Siong Lee

dblp:09/5400 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Computer networks · 1Databases, data management, data science and information retrieval · 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 networks
1 paper
Cellular and mobile networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › mobility management
handover
0.011997
Teletraffic Performance of Mobile Radio Networks with Hierarchical Cells and Overflow · IEEE J. Sel. Areas Commun. 1997
Cellular and mobile networks › heterogeneous networks
hierarchical cellular networks
0.011997
Teletraffic Performance of Mobile Radio Networks with Hierarchical Cells and Overflow · IEEE J. Sel. Areas Commun. 1997
Cellular and mobile networks
mobility management
0.011997
Teletraffic Performance of Mobile Radio Networks with Hierarchical Cells and Overflow · IEEE J. Sel. Areas Commun. 1997
Performance modeling and evaluation › network performance analysis
teletraffic analysis
0.011997
Teletraffic Performance of Mobile Radio Networks with Hierarchical Cells and Overflow · IEEE J. Sel. Areas Commun. 1997

Methods — techniques the papers use, named apart from their topics

queueing analysis · 0.0markov chain · 0.0
YearPublicationVenuePosition
2019 An Explainable Deep Fusion Network for Affect Recognition Using Physiological Signals
abstract
Affective computing is an emerging research area which provides insights on human's mental state through human-machine interaction. During the interaction process, bio-signal analysis is essential to detect human affective changes. Currently, machine learning methods to analyse bio-signals are the state of the art to detect the affective states, but most empirical works mainly deploy traditional machine learning methods rather than deep learning models due to the need for explainability. In this paper, we propose a deep learning model to process multimodal-multisensory bio-signals for affect recognition. It supports batch training for different sampling rate signals at the same time, and our results show significant improvement compared to the state of the art. Furthermore, the results are interpreted at the sensor- and signal- level to improve the explainaibility of our deep learning model.
Jionghao Lin, Shirui Pan, Cheng Siong Lee, Sharon L. Oviatt
CIKM3
1997 Teletraffic Performance of Mobile Radio Networks with Hierarchical Cells and Overflow
abstract
Wireless mobile networks, comprising a hierarchical layer of cells, use the cell layering to provide alternate routing for calls. This paper proposes a model for multilayered wireless mobile communications networks that provides a unified treatment of overflow to account for intra- and interlayer overflow. This takes account of the inherent overlap between cells in the same layer and between layers, and hence the prospect of controlling the overflow to achieve a tradeoff between new call and handover performance. The mobility of users within the layers is included in the model, and this allows handover performance to be estimated. Network performance is evaluated in terms of caller-perceived performance by calculating the probability of call failure using a Markov chain model of call progress. An example is presented that provides a comparison of the network performance for a range of overflow policies. The main contribution of this paper is the development of an analytic method that treats overflow in a unified manner. This allows the approximate performance of overflow strategies that balance the need to maintain calls in progress with the desire to accept more new calls to be evaluated for large networks.
Paul Fitzpatrick, Cheng Siong Lee, Bob Warfield
IEEE J. Sel. Areas Commun.2