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

C. K. Ng

dblp:27/5070 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 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
2 papers
Cellular and mobile networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 50% Emerging computing paradigms · 50%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
mobility management
0.122006
Performance Modeling of Level Switching in Multitier Mobile Communication Systems · IEEE Trans. Mob. Comput. 2006
Enhanced Distance-Based Location Management of Mobile Communication Systems Using a Cell Coordinates Approach · IEEE Trans. Mob. Comput. 2005
Cellular and mobile networks › mobility management › handover
vertical handover
0.112006
Performance Modeling of Level Switching in Multitier Mobile Communication Systems · IEEE Trans. Mob. Comput. 2006
Cellular and mobile networks › mobility management
location management
0.112005
Enhanced Distance-Based Location Management of Mobile Communication Systems Using a Cell Coordinates Approach · IEEE Trans. Mob. Comput. 2005
Cellular and mobile networks › mobility management › location management
location update and paging
0.112005
Enhanced Distance-Based Location Management of Mobile Communication Systems Using a Cell Coordinates Approach · IEEE Trans. Mob. Comput. 2005
Emerging computing paradigms › approximate and stochastic computing
stochastic computing
0.011992
Learning Probabilistic RAM Nets Using VLSI Structures · IEEE Trans. Computers 1992

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

markov modeling · 0.1continuous-time stochastic process · 0.1distance-based location management · 0.1cell coordinates · 0.1reinforcement learning · 0.0backpropagation · 0.0
YearPublicationVenuePosition
2006 Performance Modeling of Level Switching in Multitier Mobile Communication Systems
abstract
The multitier environment of mobile communication systems is an integration of different mobile systems such as cellular, cordless, and satellite systems for mobile users to communicate with anyone, anywhere, and anytime. An effective and efficient scheme is needed for mobile terminals to dynamically select the most appropriate tier of mobile system for optimizing communication cost and performance. This paper presents a model for studying the effect of level switching in a multitier environment and for the performance evaluation of level switching schemes. This model is based on the continuous-time stochastic process, which is parameterized by a set of state-transition rates and costs derived from the characteristics of the mobile systems and terminals. Several level switching schemes based on different triggering events are proposed and the performance is analyzed using the proposed model. Level switching is found to be an effective way to reduce communication costs. The performance gain increases with the frequency of the switching activities and the level switching costs are insignificant in most cases. By using the model, the most cost-effective switching scheme can be selected to match the characteristics of individual mobile users and mobile systems for optimizing overall system performance.
C. K. Ng, H. W. Chan
IEEE Trans. Mob. Comput.1
2005 Enhanced Distance-Based Location Management of Mobile Communication Systems Using a Cell Coordinates Approach
abstract
In managing the locations of mobile users in mobile communication systems, the distance-based strategy has been proven to have better performance than other dynamic strategies, but is difficult to implement. A simple approach is introduced to implement the distance-based strategy by using the cell coordinates in calculating the physical distance traveled. This approach has the advantages of being independent of the size, shape, and distribution of cells, as well as catering for the direction of movement in addition to the speed of each mobile terminal. An enhanced distance-based location management strategy is proposed to dynamically adjust the size and shape of location area for each individual mobile terminal according to the current speed and direction of movement. It can reduce the location management signaling traffic of the distance-based strategy by half when mobile terminals have predictable directions of movement. Three types of location updating schemes are discussed, namely, Circular Location Area, Optimal Location Area, and Elliptic Location Area. Paging schemes using searching techniques such as expanding distance search based on the last reported location and based on the predicted location, and expanding direction search are also explored to further reduce paging signal traffic by partitioning location areas into paging areas.
C. K. Ng, H. W. Chan
IEEE Trans. Mob. Comput.1
1992 Learning Probabilistic RAM Nets Using VLSI Structures
abstract
Hardware-realizable learning probabilistic RAMs (pRAMs) which implement local reinforcement rules utilizing synaptic rather than threshold noise in the stochastic search procedure are described. The design allows for both global and local rewards and penalties (in this latter case implementing a modified version of backpropagation). The architecture allows for serial updating of the weights of a pRAM net according to a reward/penalty learning rule. It is possible to generate a new set of pRAM outputs at least every 100 mu s, which is faster than the response time of biological neurons.>
Trevor G. Clarkson, Denise Gorse, John G. Taylor, C. K. Ng
IEEE Trans. Computers4