K. Y. Michael Wong

K. Y. Michael Wong

Auto-generated profile, based on publicly available information

K. Y. Michael Wong

Hong Kong University of Science and Technology

Research Focus & Metrics

Academic Career Length

42Years (1985-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 1999 in Physical Review E
Verified
Journal Article
Closed access
PDF file
HNHidetoshi Nishimori
Hidetoshi Nishimori
KWK. Y. Michael Wong
K. Y. Michael Wong
We develop a statistical-mechanical formulation for image restoration and error-correcting codes. These problems are shown to be equivalent to the Ising spin glass with ferromagnetic bias under random external fields. We prove that the quality of restoration/decoding is maximized at a specific set of parameter values determined by the source and channel properties. For image restoration in a mean-field system a line of optimal performance is shown to exist in the parameter space. These results are illustrated by solving exactly the infinite-range model. The solutions enable us to determine how precisely one should estimate unknown parameters. Monte Carlo simulations are carried out to see how far the conclusions from the infinite-range model are applicable to the more realistic two-dimensional case in image restoration.

1 March 2010 in Neural Computation
Verified
Journal Article
Closed access
CFChi Chung Alan Fung
Chi Chung Alan Fung
KWK. Y. Michael Wong
K. Y. Michael Wong
SWSi Wu
Si Wu
Understanding how the dynamics of a neural network is shaped by the network structure and, consequently, how the network structure facilitates the functions implemented by the neural system is at the core of using mathematical models to elucidate brain functions. This study investigates the tracking dynamics of continuous attractor neural networks (CANNs). Due to the translational invariance of neuronal recurrent interactions, CANNs can hold a continuous family of stationary states. They form a continuous manifold in which the neural system is neutrally stable. We systematically explore how this property facilitates the tracking performance of a CANN, which is believed to have clear correspondence with brain functions. By using the wave functions of the quantum harmonic oscillator as the basis, we demonstrate how the dynamics of a CANN is decomposed into different motion modes, corresponding to distortions in the amplitude, position, width, or skewness of the network state. We then develop a perturbation approach that utilizes the dominating movement of the network's stationary states in the state space. This method allows us to approximate the network dynamics up to an arbitrary accuracy depending on the order of perturbation used. We quantify the distortions of a gaussian bump during tracking and study their effects on tracking performance. Results are obtained on the maximum speed for a moving stimulus to be trackable and the reaction time for the network to catch up with an abrupt change in the stimulus.

21 April 1988 in Journal of Physics A: General Physics
Verified
Journal Article
Closed access
PDF file
KWK Y M Wong
K Y M Wong
DSD Sherrington
D Sherrington

23 August 2013 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Closed access
HHHaiping Huang
Haiping Huang
KWK Y Michael Wong
K Y Michael Wong
YKYoshiyuki Kabashima
Yoshiyuki Kabashima

29 July 2013 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Open access
PDF file
CYChi Ho Yeung
Chi Ho Yeung
DSDavid Saad
David Saad
KWK. Y. Michael Wong
K. Y. Michael Wong
Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: ( i ) random graphs resembling Internet overlay networks, ( ii ) travel on the London Underground network based on Oyster card data, and ( iii ) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.

21 August 1987 in Journal of Physics A: General Physics
Verified
Journal Article
Closed access
PDF file
KWK Y M Wong
K Y M Wong
DSD Sherrington
D Sherrington
The authors study the problem of bipartitioning a random graph of fixed finite valence using a mean-field replica-symmetric theory of an Ising ferromagnet with zero magnetisation constraint. The thermodynamics is determined by the probability distribution of an auxiliary field. The expression for the ground-state energy agrees with that proposed by Mezard and Parisi (1986) using a cavity-field method, but their expression for the fraction of crazy spins is reinterpreted.