Tharam S. Dillon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tharam S. Dillon has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Elizabeth Chang
School of Science, Technology and Engineering, University of the Sunshine Coast, Moreton Bay, QLD, Australia
13 shared publications - Farookh Khadeer Hussain
University of Technology
6 shared publications - Allan K. Y. Wong
Hong Kong Polytechnic University
5 shared publications - Robert Steele
Member, IEEE, Faculty of IT, University of Technology, Sydney, Australia
5 shared publications - Guangquan Zhang
University of Technology Sydney
4 shared publications - Jie Lu
University of Technology Sydney
4 shared publications
Latest Publications
- 1 January 2008
- Published by Springer Nature
- p. 457-480
Solution Concepts and an Approximation Kuhn–Tucker Approach for Fuzzy Multiobjective Linear Bilevel Programming
- 1 January 2008
- Published by Springer Nature
- p. 457-480
Solution Concepts and an Approximation Kuhn–Tucker Approach for Fuzzy Multiobjective Linear Bilevel Programming
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE International Fuzzy Systems Conference
- No. 10987584,p. 1-6
Models and Algorithm for Fuzzy Multi-objective Multi-follower Linear Bilevel Programming
Basic bilevel programming deals with hierarchical optimization problems in which the leader at the upper level attempts to optimize his/her objective, subject to a set of constraints and his/her follower's solution, and the follower at the lower level tries to find an optimized strategy according to each of possible decisions made by the leader. Three issues may be involved in a basic bilevel decision problem. One is that bilevel decision making model may involve uncertain parameters which appear either in the objective functions or constraints of the leader or the follower or both. Second, the leader and the follower may have multiple conflict objectives that should be optimized simultaneously. Third, there may have multiple followers in a real decision situation. Following our previous work, this study proposes a set of fuzzy multi-objective multi-follower linear bilevel programming models to describe the three issues. It also develops an approximation branch-and-bound algorithm to solve such kinds of problems.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE International Fuzzy Systems Conference
- No. 10987584,p. 1-6
Models and Algorithm for Fuzzy Multi-objective Multi-follower Linear Bilevel Programming
Basic bilevel programming deals with hierarchical optimization problems in which the leader at the upper level attempts to optimize his/her objective, subject to a set of constraints and his/her follower's solution, and the follower at the lower level tries to find an optimized strategy according to each of possible decisions made by the leader. Three issues may be involved in a basic bilevel decision problem. One is that bilevel decision making model may involve uncertain parameters which appear either in the objective functions or constraints of the leader or the follower or both. Second, the leader and the follower may have multiple conflict objectives that should be optimized simultaneously. Third, there may have multiple followers in a real decision situation. Following our previous work, this study proposes a set of fuzzy multi-objective multi-follower linear bilevel programming models to describe the three issues. It also develops an approximation branch-and-bound algorithm to solve such kinds of problems.
- 1 June 2007
- Published by Elsevier in Knowledge-Based Systems
- Vol. 20 (5) , 495-507
Decentralized multi-objective bilevel decision making with fuzzy demands
- 1 June 2007
- Published by Elsevier in Knowledge-Based Systems
- Vol. 20 (5) , 495-507
Decentralized multi-objective bilevel decision making with fuzzy demands
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 221-227
Privacy Support and Evaluation on an Ontological Basis
This work is concerned with user perceived privacy and how clients (which we call data subjects here) can be empowered to control their own data consistently with their own interests. To support building and evaluation of privacy-aware applications, we describe a privacy ontology, how the privacy principles relate to that and how they are influenced by the core concepts as well as by each other. We use this influence of the privacy principles to evaluate the level of privacy for a particular transaction, when applying and extending the core concepts for an application domain.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 221-227
Privacy Support and Evaluation on an Ontological Basis
This work is concerned with user perceived privacy and how clients (which we call data subjects here) can be empowered to control their own data consistently with their own interests. To support building and evaluation of privacy-aware applications, we describe a privacy ontology, how the privacy principles relate to that and how they are influenced by the core concepts as well as by each other. We use this influence of the privacy principles to evaluate the level of privacy for a particular transaction, when applying and extending the core concepts for an application domain.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 374-381
Fuzzy Decision Support for Service Selection in E-Business Environments
The emergence of semantic overlay networks as instruments to improve security, trust and stability in distributed virtual communities is recognized widely in the research community. We propose a fuzzy logic based framework which integrates social information such as trustworthiness, reputation and credibility ratings for individuals, alliances, organizations, services and products in e-commerce markets. This framework is designed to support the decision making process of autonomous agents during the selection of the optimal business partner. Fuzzy systems provide the ideal capabilities to process multiple criteria, which are composed of imprecise information and attribute definitions expressed in natural language. The proposed fuzzy models implement the DEco Arch framework and ontologies which provide details about concepts and their relationships in virtual communities
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 374-381
Fuzzy Decision Support for Service Selection in E-Business Environments
The emergence of semantic overlay networks as instruments to improve security, trust and stability in distributed virtual communities is recognized widely in the research community. We propose a fuzzy logic based framework which integrates social information such as trustworthiness, reputation and credibility ratings for individuals, alliances, organizations, services and products in e-commerce markets. This framework is designed to support the decision making process of autonomous agents during the selection of the optimal business partner. Fuzzy systems provide the ideal capabilities to process multiple criteria, which are composed of imprecise information and attribute definitions expressed in natural language. The proposed fuzzy models implement the DEco Arch framework and ontologies which provide details about concepts and their relationships in virtual communities
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 285-291
DEco Arch: Trust and Reputation Aware Service Brokering Architecture in Digital Ecosystems
Awareness of social ratings such as reputation, credibility and trustworthiness plays a key role in digital ecosystems where autonomous agents collaborate in order to publish their services or search for services. The integration of these social ratings along with attribute matching presents a novel approach and strengthens stability and confidence in autonomous distributed communities. This ensures that the selection of the optimal service is guaranteed while minimizing general security and business related risks. In this paper we discuss a framework for service registration which is hosted in a P2P environment. Service consumers can discover services which are grouped based on their contexts. Both, services and group alliances are defined through semantically enriched metadata and social ratings.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 285-291
DEco Arch: Trust and Reputation Aware Service Brokering Architecture in Digital Ecosystems
Awareness of social ratings such as reputation, credibility and trustworthiness plays a key role in digital ecosystems where autonomous agents collaborate in order to publish their services or search for services. The integration of these social ratings along with attribute matching presents a novel approach and strengthens stability and confidence in autonomous distributed communities. This ensures that the selection of the optimal service is guaranteed while minimizing general security and business related risks. In this paper we discuss a framework for service registration which is hosted in a P2P environment. Service consumers can discover services which are grouped based on their contexts. Both, services and group alliances are defined through semantically enriched metadata and social ratings.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21504938,p. 339-345
Ontology Modelling Notations for Software Engineering Knowledge Representation
This paper is intended as an analysis of software engineering ontology and to highlight characteristics of software engineering ontology that represent important design considerations for the methodology of multi-site distributed software development. Multi-site teams use software engineering ontology to assist in defining information for the exchange of semantic project information. Some features and functions of the software engineering ontology are also provided. There is no standard graphical ontology representation in the literature so far. In this paper, we also present graphical notations of modelling software engineering ontology as an alternative formalism. The use of the formalism has made it a possible alternative to model the software engineering ontology. The main aim is not only to create a graphical representation making it easier to understand but, importantly, this model should be able to capture the semantic richness of the defined software engineering ontology.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21504938,p. 339-345
Ontology Modelling Notations for Software Engineering Knowledge Representation
This paper is intended as an analysis of software engineering ontology and to highlight characteristics of software engineering ontology that represent important design considerations for the methodology of multi-site distributed software development. Multi-site teams use software engineering ontology to assist in defining information for the exchange of semantic project information. Some features and functions of the software engineering ontology are also provided. There is no standard graphical ontology representation in the literature so far. In this paper, we also present graphical notations of modelling software engineering ontology as an alternative formalism. The use of the formalism has made it a possible alternative to model the software engineering ontology. The main aim is not only to create a graphical representation making it easier to understand but, importantly, this model should be able to capture the semantic richness of the defined software engineering ontology.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 595-601
Use of Digital Ecosystem and Ontology Technology for Standardization of Medical Records
In this paper, we propose a medical records digital ecosystem (MRDES) that enables efficient use of medical records for the purpose of correct patient identification, diagnosis, appointments scheduling and the like, in everyday life as well as in emergency situations. Medical records digital environment (MRDE) is populated by interconnected medical records digital components (MRDC). MRDC are combined together to support creation of a digital infrastructure that will provide standardized use of medical records within various regions, countries and even continents. If medical records are to be recognized by different digital components at different locations, standardization of data needs to take place. Ontologies can be used for this purpose. Instantiation of the Generic Medical Record Ontology concepts result in Specific Medical Record Ontologies that act as personalized medical records. Ontology files are machine readable and are suitable to be used within MRDES. One of the key MRDC includes medical record databases that contain personal medical records. Through use of ontologies for standardization of medical records from these different databases, one big virtual database is created that contains medical records of all people. Other key MRDCs are machine-readable personal medical records as well as screening components that read those records. The advantage is that one comprehensive format for the medical records is set within this digital ecosystem and this record can be accessed, read and understood regardless of what country this person is in. This advantage is of especial importance in emergency cases. The significance of this research lies in the unification of the advances of the ontology technology and ecosystem paradigm for the purpose of establishing worldwide standardization of medical records.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 595-601
Use of Digital Ecosystem and Ontology Technology for Standardization of Medical Records
In this paper, we propose a medical records digital ecosystem (MRDES) that enables efficient use of medical records for the purpose of correct patient identification, diagnosis, appointments scheduling and the like, in everyday life as well as in emergency situations. Medical records digital environment (MRDE) is populated by interconnected medical records digital components (MRDC). MRDC are combined together to support creation of a digital infrastructure that will provide standardized use of medical records within various regions, countries and even continents. If medical records are to be recognized by different digital components at different locations, standardization of data needs to take place. Ontologies can be used for this purpose. Instantiation of the Generic Medical Record Ontology concepts result in Specific Medical Record Ontologies that act as personalized medical records. Ontology files are machine readable and are suitable to be used within MRDES. One of the key MRDC includes medical record databases that contain personal medical records. Through use of ontologies for standardization of medical records from these different databases, one big virtual database is created that contains medical records of all people. Other key MRDCs are machine-readable personal medical records as well as screening components that read those records. The advantage is that one comprehensive format for the medical records is set within this digital ecosystem and this record can be accessed, read and understood regardless of what country this person is in. This advantage is of especial importance in emergency cases. The significance of this research lies in the unification of the advances of the ontology technology and ecosystem paradigm for the purpose of establishing worldwide standardization of medical records.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21504938,p. 473-478
Detection of Fractal Breakdowns by the Holder Filter in the Novel Real-Time Traffic Pattern Detector for the Internet Applications
The novel real-time traffic pattern detector (RTPD) proposed identifies the Internet traffic pattern on the fly. Firstly it determines if a time series aggregate is stationary. Secondly it confirms if the aggregate exhibits short-range dependence (SRD) or long-range dependence (LRD). Thirdly it detects if the smooth system operation has suddenly become irregular and chaotic. This detection is achieved by computing the instantaneous value of the Holder exponent that has a (0,1) range to accommodate different degrees fractality. A smooth performance distribution such as a time series may embed a varying fractality at different times due to the system dynamics. If the Holder exponent has wandered outside the (0,1) region, fractal breakdown has occurred. The capability of detecting such breakdowns by a real-time application enables it to avoid sudden failure. This feature is of importance to the reliability of digital ecosystems, which reside on the Internet.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21504938,p. 473-478
Detection of Fractal Breakdowns by the Holder Filter in the Novel Real-Time Traffic Pattern Detector for the Internet Applications
The novel real-time traffic pattern detector (RTPD) proposed identifies the Internet traffic pattern on the fly. Firstly it determines if a time series aggregate is stationary. Secondly it confirms if the aggregate exhibits short-range dependence (SRD) or long-range dependence (LRD). Thirdly it detects if the smooth system operation has suddenly become irregular and chaotic. This detection is achieved by computing the instantaneous value of the Holder exponent that has a (0,1) range to accommodate different degrees fractality. A smooth performance distribution such as a time series may embed a varying fractality at different times due to the system dynamics. If the Holder exponent has wandered outside the (0,1) region, fractal breakdown has occurred. The capability of detecting such breakdowns by a real-time application enables it to avoid sudden failure. This feature is of importance to the reliability of digital ecosystems, which reside on the Internet.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 568-575
UNI3 - efficient algorithm for mining unordered induced subtrees using TMG candidate generation
Semi-structured data sources are increasingly in use today because of their capability of representing information through more complex structures where semantics and relationships of data objects are more easily expressed. Extraction of frequent sub-structures from such data has found important applications in areas such as Bioinformatics, XML mining, Web mining, scientific data management etc. This paper is concerned with the task of mining frequent unordered induced subtrees from a database of rooted ordered labeled subtrees. Our previous work in the area of frequent subtree mining is characterized by the efficient tree model guided (TMG) candidate enumeration, where candidate subtrees conform to the data's underlying tree structure. We apply the same approach to the unordered case, motivated by the fact that in many applications of frequent subtree mining the order among siblings is not considered important. The proposed UNI3 algorithm considers both transaction based and occurrence match support. Synthetic and real world data are used to evaluate the time performance of our approach in comparison to the well known algorithms developed for the same problem
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 568-575
UNI3 - efficient algorithm for mining unordered induced subtrees using TMG candidate generation
Semi-structured data sources are increasingly in use today because of their capability of representing information through more complex structures where semantics and relationships of data objects are more easily expressed. Extraction of frequent sub-structures from such data has found important applications in areas such as Bioinformatics, XML mining, Web mining, scientific data management etc. This paper is concerned with the task of mining frequent unordered induced subtrees from a database of rooted ordered labeled subtrees. Our previous work in the area of frequent subtree mining is characterized by the efficient tree model guided (TMG) candidate enumeration, where candidate subtrees conform to the data's underlying tree structure. We apply the same approach to the unordered case, motivated by the fact that in many applications of frequent subtree mining the order among siblings is not considered important. The proposed UNI3 algorithm considers both transaction based and occurrence match support. Synthetic and real world data are used to evaluate the time performance of our approach in comparison to the well known algorithms developed for the same problem