TY  - CONF
T1  - A novel visual discriminator on network traffic pattern
T2  - The Second International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2008)
Y1  - 2008
A1  - Liangxiu Han
A1  - J. Hemert
AB  - The wavelet transform has been shown to be a powerful tool for characterising network traffic. However, the resulting decomposition of a wavelet transform typically forms a high-dimension space. This is obviously problematic on compact representations, visualizations, and modelling approaches that are based on these high-dimensional data. In this study, we show how data projection techniques can represent the high-dimensional wavelet decomposition in a low dimensional space to facilitate visual analysis. A low-dimensional representation can significantly reduce the model complexity. Hence, features in the data can be presented with a small number of parameters. We demonstrate these projections in the context of network traffic pattern analysis. The experimental results show that the proposed method can effectively discriminate between different application flows, such as FTP and P2P.
JF  - The Second International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2008)
PB  - IEEE Computer Society
CY  - Valencia, Spain
ER  - 

TY  - CONF
T1  - Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO
T2  - Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006)
Y1  - 2006
A1  - Gruber, M.
A1  - van Hemert, J. I.
A1  - Raidl, G. R.
ED  - Maarten Keijzer
ED  - et al
KW  - constraint satisfaction
KW  - evolutionary computation
KW  - variable neighbourhood search
AB  - We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable neighbourhood search (VNS), an evolutionary algorithm (EA) utilising a new encoding of solutions, and an ant colony optimisation (ACO).We compare the performance in terms of effectiveness between these three hybrid methods on a suite  f popular benchmark instances, which contains instances too large to solve by current exact methods. Our results show that the EA and the ACO outperform the VNS on almost all used benchmark instances. Furthermore, the ACO yields most of the time better solutions than the EA in long-term runs, whereas the EA dominates when the computation time is strongly restricted.
JF  - Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006)
PB  - ACM
CY  - Seattle, USA
VL  - 2
ER  - 

TY  - CONF
T1  - A New Architecture for OGSA-DAI
T2  - UK e-Science All Hands Meeting
Y1  - 2005
A1  - Atkinson, M.
A1  - Karasavvas, K.
A1  - Antonioletti, M.
A1  - Baxter, R.
A1  - Borley, A.
A1  - Hong, N. C.
A1  - Hume, A.
A1  - Jackson, M.
A1  - Krause, A.
A1  - Laws, S.
A1  - Paton, N.
A1  - Schopf, J.
A1  - Sugden, T.
A1  - Tourlas, K.
A1  - Watson, P.
JF  - UK e-Science All Hands Meeting
ER  - 

TY  - CONF
T1  - A new permutation model for solving the graph k-coloring problem
T2  - Kalmàr Workshop on Logic and Computer Science
Y1  - 2003
A1  - Juhos, I.
A1  - Tóth, A.
A1  - Tezuka, M.
A1  - Tann, P.
A1  - van Hemert, J. I.
KW  - constraint satisfaction
KW  - graph colouring
AB  - This paper describes a novel representation and ordering model, that is aided by an evolutionary algorithm, is used in solving the graph k-coloring. A comparison is made between the new representation and an improved version of the traditional graph coloring technique DSATUR on an extensive list of graph k-coloring problem instances with different properties. The results show that our model outperforms the improved DSATUR on most of the problem instances.
JF  - Kalmàr Workshop on Logic and Computer Science
ER  - 

TY  - JOUR
T1  - A network traffic model based on the cascade process
JF  - Journal of Mini-Micro Computer System
Y1  - 2002
A1  - Liangxiu Han
A1  - yan Liu
A1  - Zhiwei Cen
VL  - 23
IS  - 12
ER  - 

TY  - JOUR
T1  - A new multifractal network traffic model
JF  - Journal of Chaos, solitons & fractals
Y1  - 2002
A1  - Liangxiu Han
A1  - Zhiwei Ceng
A1  - Chuanshan Gao
PB  - Elsevier Science
VL  - 13
IS  - 7
ER  - 

TY  - CONF
T1  - A new multifractal traffic model based on the wavelet transform
T2  - ISCA 14th International Conference on Parallel and Distributed Computing systems
Y1  - 2001
A1  - Chuanshan Gao
A1  - Liangxiu Han
JF  - ISCA 14th International Conference on Parallel and Distributed Computing systems
CY  - Texas, USA
ER  - 

TY  - JOUR
T1  - Neural network applied to the prediction of the failure stress for pressurized cylinders containing defects
JF  - International Journal of Pressure Vessels and Piping
Y1  - 1999
A1  - Lianghao Han
A1  - Liangxiu Han
A1  - zengdian Liu
PB  - Elsevier
VL  - 76
IS  - 4
ER  -