A generalized algorithm for fast two-dimensional angle estimation of a single source with uniform circular arrays

published_or_final_versio

Sustained slow-scale oscillation in higher order current-mode controlled converter

Author name used in this publication: Chi K. Tse2007-2008 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

A semi-discrete model and its approach to a solution for a wide moving jam in traffic flow

This paper investigates the analytical and numerical solutions to wide moving jams in traffic flow. Under the framework of the Lagrange coordinates, a semi-discrete model and a continuum model correlate with each other, in which the former model approaches the latter as the increment ΔM in the former model vanishes. This implies that the solution to a wide moving jam in the latter model, which can be analytically derived using the known theory, can be conceivably taken as an approximation to that of the former model. These results were verified through numerical simulations. Because a detailed understanding of the traffic phase "wide moving jam" is very important for the further development of Kerner's three-phase traffic theory, this study helps to explain the empirical features of traffic breakdown and resulting congested traffic patterns that are observed in real traffic. © 2011 Elsevier B.V. All rights reserved.postprin

An artificial bee colony algorithm for the capacitated vehicle routing problem

Session MF-03: Population-based metaheuristics for routing problems - Stream: Metaheuristics - Invited session no. 3This paper introduces an artificial bee colony heuristic for the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. The performance of the heuristic is evaluated on two sets of benchmark instances. A new scheme is also developed to improve the performance of the artificial bee colony heuristic. Computational results show that the heuristic with the new scheme produces good solutions.postprintThe 24th European Conference on Operational Research (EURO 24), Lisbon, Portual, 11-14 July 2010. In Abstract Book of EURO 24, 2010, p. 89, MF-03-

A New Method for Preliminary Identification of Gene Regulatory Networks from Gene Microarray Cancer Data Using Ridge Partial Least Squares with Recursive Feature Elimination and Novel Brier and Occurrence Probability Measures

published_or_final_versio

An artificial bee colony algorithm for the capacitated vehicle routing problem

This paper introduces an artificial bee colony heuristic for solving the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. An enhanced version of the artificial bee colony heuristic is also proposed to improve the solution quality of the original version. The performance of the enhanced heuristic is evaluated on two sets of standard benchmark instances, and compared with the original artificial bee colony heuristic. The computational results show that the enhanced heuristic outperforms the original one, and can produce good solutions when compared with the existing heuristics. These results seem to indicate that the enhanced heuristic is an alternative to solve the capacitated vehicle routing problem. © 2011 Elsevier B.V. All rights reserved.postprin

Object-based coding for plenoptic videos

A new object-based coding system for a class of dynamic image-based representations called plenoptic videos (PVs) is proposed. PVs are simplified dynamic light fields, where the videos are taken at regularly spaced locations along line segments instead of a 2-D plane. In the proposed object-based approach, objects at different depth values are segmented to improve the rendering quality. By encoding PVs at the object level, desirable functionalities such as scalability of contents, error resilience, and interactivity with an individual image-based rendering (IBR) object can be achieved. Besides supporting the coding of texture and binary shape maps for IBR objects with arbitrary shapes, the proposed system also supports the coding of grayscale alpha maps as well as depth maps (geometry information) to respectively facilitate the matting and rendering of the IBR objects. Both temporal and spatial redundancies among the streams in the PV are exploited to improve the coding performance, while avoiding excessive complexity in selective decoding of PVs to support fast rendering speed. Advanced spatial/temporal prediction methods such as global disparity-compensated prediction, as well as direct prediction and its extensions are developed. The bit allocation and rate control scheme employing a new convex optimization-based approach are also introduced. Experimental results show that considerable improvements in coding performance are obtained for both synthetic and real scenes, while supporting the stated object-based functionalities. © 2006 IEEE.published_or_final_versio