Optimization based methods for solving some problems in telecommunications and the internet
- Authors: Jia, Long
- Date: 2005
- Type: Text , Thesis , PhD
- Full Text:
- Description: The purpose of this thesis is to develop some new algorithms based on optimization techniques for solving some problems in some areas of telecommunications and the Internet. There are two main parts to this thesis. In the first part we discuss optimization based stochastic and queueing models in telecommunications network corrective maintenance. In the second part we develop optimization based clustering (OBC) algorithms for network evolution and multicast routing. The most typical scenario encountered during mathematical optimization modelling in telecommunications, for example, is to minimize the cost of establishment and maintenance of the networks subject to the performance constraints of the networks and the reliability constraints of the networks as well. Most of these optimization problems are global optimization, that is, they have many local minima and most of these local minima do not provide any useful information for solving these problems. Therefore, the development of effective methods for solving such global optimization problems is important. To run the telecommunications networks with cost-effective network maintenance,we need to establish a practical maintenance model and optimize it. In the first part of the thesis, we solve a known stochastic programming maintenance optimization model with a direct method and then develop some new models. After that we introduce queue programming models in telecommunications network maintenance optimization. The ideas of profit, loss, and penalty will help telecommunications companies have a good view of their maintenance policies and help them improve their service. In the second part of this thesis we propose the use of optimization based clustering (OBC) algorithms to determine level-constrained hierarchical trees for network evolution and multicast routing. This problem is formulated as an optimization problem with a non-smooth, non-convex objective function. Different algorithms are examined for solving this problem. Results of numerical experiments using some artifiicial and real-world databases are reported.
- Description: Doctor of Philosophy
Procedural modeling of water caustics and foamy water for cartoon animation
- Authors: Liao, Jing , Yu, Jinhu , Jia, Long
- Date: 2010
- Type: Text , Conference paper
- Relation: Paper presented at 18th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2010 p. 1-4
- Full Text:
- Reviewed:
- Description: We propose a method for procedural modeling and animation of cartoon water effects such as water caustics and foamy water. In our method we emulate the visual abstraction of these cartoon effects by the use of Voronoi diagrams and the motion abstraction by designing relevant controlling mechanisms corresponding to each effect. Our system enables the creation of cartoon effects with minimal intervention from the animator. Through high-level initial specification, the effects are animated procedurally in the style of hand-drawn cartoons. © 2010 IEEE.
Optimization in telecommunication network maintenance
- Authors: Jia, Long , Rubinov, Alex , Ouveysi, Iradj
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Symposium on Industrial Optimisation and the 9th Australian Optimisation Day, Perth : 30th September, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000349
Optimization based clustering algorithms in multicast group hierarchies
- Authors: Jia, Long , Ouveysi, Iradj , Rubinov, Alex , Bagirov, Adil
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the 2003 Australian Telecommunications Networks and Applications Conference, Melbourne : 8th - 10th December, 2003
- Full Text:
- Reviewed:
- Description: In this paper we propose the use of optimization based clustering algorithms to determine hierarchical multicast trees. This problem is formulated as an optimization problem with a non-smooth, non-convex objective function. Different algorithms are examined for solving this problem. Results of numerical experiments using some artificial and real-world databases are reported. We compare several optimization based clustering methods and their combinations with the k- means method. The results demonstrate the effectiveness of these algorithms.
- Description: E1
- Description: 2003000382
An intelligent learning environment for traditional Chinese medicine practitioners and students
- Authors: Jia, Long , Stranieri, Andrew , Shen, J
- Date: 2008
- Type: Text , Conference paper
- Relation: Paper presented at HIC 2008 Australia's Health Informatics Conference; The Person in the Centre, Brunswick East, Victoria : 31st August - 2nd September 2008
- Full Text:
- Description: Objectives: This study aims to support the training of Traditional Chinese Medicine practitioners by embedding an expert diagnostic model for arthritis into an Intelligent Interactive Learning Environment (IILE). Background: The increasing prevalence of Traditional Chinese Medicine (TCM) outside China is characterised by the emergence of university level practitioner training and stringent regulatory requirements. TCM differential diagnosis is a difficult task that was traditionally taught by exposure to large numbers of patients in a master-apprentice context. In university degree programs, students and novice diagnosticians cannot have the exposure to cases possible in the traditional context. An online system that engages students in the interactive construction of a virtual case and provides immediate feedback on the appropriateness of student actions and the accuracy of diagnostic conclusions can enhance student learning. The system, an Intelligent Interactive Learning Environment (IILE) is based on an approach that has been shown to improve learning outcomes in intensive care nurse training. Methods: An expert model of diagnostic reasoning elicited from TCM expert practitioners lies at the core of the IILE. The knowledge acquisition is performed using an argumentation tree representation that has been shown to be effective in structuring complex knowledge and facilitating engineer - expert interactions. Problems associated with keeping knowledge bases up to date are mitigated with the use of a knowledge model known as ripple down rules permits dynamic updating of knowledge so that knowledge bases evolve over time. A simple narrative model builds up the virtual case study as user interaction proceeds. Results and discussion: This article reports preliminary results in the study that includes an overview of TCM differential diagnosis, the argument tree, the ripple down rule representation and the narrative based IILE. Segments of the knowledge model based solely on TCM literature are illustrated.
- Description: 2003006755
Queueing programming models in telecommunication network maintenance
- Authors: Ugon, Julien , Jia, Long , Ouveysi, Iradj
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Symposium on Industrial Optimisation and the 9th Australian Optimisation Day, Perth : 30th September, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000350
Second-order sliding mode control for high-dimension uncertain multivariable systems
- Authors: Wang, Yuye , Xu, Guangrui , Jia, Long , Lu, Pengfei
- Date: 2011
- Type: Text , Conference proceedings
- Full Text: false
- Description: A second-order non-singular terminal sliding mode (NTSM) controller with hierarchical structure, is proposed for a class of uncertain high-dimensional multivariable systems. By two non-singular state transformations, the system is firstly converted into decomposed block controllable form, consisting of an input-output subsystem and an internal one. A second-order NTSM controller is designed to force the input-output subsystem to converge to zero with characteristics of fast and better tracking precision, as well as free-chattering. Meanwhile, the internal subsystem is converted into zero dynamic subsystem, which asymptotical stability and finally that of the original system is guaranteed by eigenvalue configuration method. The simulation results are presented to validate the designed method. © 2011 IEEE.
C6 : A holistic model for decision making in web services
- Authors: Sun, Zhaohao , Meredith, Grant , Jia, Long
- Date: 2009
- Type: Text , Conference paper
- Relation: Paper presented at 20th Australasian Conference on Information Systems, Monash University, Melbourne, Victoria : 2nd-4th Dec 2009 p. 904-914
- Full Text:
- Description: Web services are playing a pivotal role in e-business, service intelligence, service science and information systems. This article will examine how the main players make decisions for activities in web service lifecycle (WSLC) and propose a holistic model for decision making in web services. More specifically, this article first examines main players in web services. It also reviews the existing web service lifecycles and proposes a demand-driven web service lifecycle for web service requesters. It will then examine six driving factors for web services, look at their interrelationships and propose a holistic model for decision making in web services, C6, which consists of six Cs: communication, competition, coordination, collaboration, cooperation and control, taking into account the main players in web services and web service lifecycle (WSLC). The proposed approach will facilitate research and development of web services, e-services, service intelligence, service science and service computing.
- Description: 2003007874