Benferhat, S, Dubois, D, Prade, H & Williams, M 2002, 'A Practical Approach to Revising Prioritized Knowledge Bases', Studia Logica, vol. 70, no. 1, pp. 105-130.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper investigates simple syntactic methods for revising prioritized belief bases, that are semantically meaningful in the frameworks of possibility theory and of Spohn''s ordinal conditional functions. Here, revising prioritized belief bases amounts to conditioning a distribution function on interpretations. The input information leading to the revision of a knowledge base can be sure or uncertain. Different types of scales for priorities are allowed: finite vs. infinite, numerical vs. ordinal. Syntactic revision is envisaged here as a process which transforms a prioritized belief bases into a new prioritized belief base, and thus allows a subsequent iteration.
Bremner, MJ, Dawson, CM, Dodd, JL, Gilchrist, A, Harrow, AW, Mortimer, D, Nielsen, MA & Osborne, TJ 2002, 'Practical scheme for quantum computation with any two-qubit entangling gate', PHYSICAL REVIEW LETTERS, vol. 89, no. 24.
View/Download from: Publisher's site
Bremner, MJ, Dawson, CM, Dodd, JL, Gilchrist, A, Harrow, AW, Mortimer, D, Nielsen, MA & Osborne, TJ 2002, 'Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate', Physical Review Letters, vol. 89, no. 24.
View/Download from: Publisher's site
View description>>
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical. © 2002 The American Physical Society.
Dodd, JL, Nielsen, MA, Bremner, MJ & Thew, RT 2002, 'Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries', Physical Review A. Atomic, Molecular, and Optical Physics, vol. 65, no. 4 A, pp. 403011-403014.
View description>>
Simulations and universal quantum computations using an entangling Hamiltonian and local unitaries were performed. A specific two-qubit example was given to illustrate the techniques and the general algorithm was described for the case of an arbitrary two-qubit systems. The efficiency of the algorithm and the effect of errors were then discussed.
Dodd, JL, Nielsen, MA, Bremner, MJ & Thew, RT 2002, 'Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries', PHYSICAL REVIEW A, vol. 65, no. 4.
View/Download from: Publisher's site
Koutras, CD & Peppas, P 2002, 'Weaker axioms, more ranges', Fundamenta Informaticae, vol. 51, no. 3, pp. 297-310.
View description>>
In the family of many-valued modal languages proposed by M. Fitting in 1992, every modal language is based on an underlying Heyting algebra which provides the space of truth values. The lattice of truth values is explicitly represented in the language by a set of special constants and this allows for forming weak, generalized, many-valued analogs of all classical modal axioms. Weak axioms of this kind have been recently investigated from the canonicity, completeness and correspondence perspective. In this paper, we provide some results on the effect of adopting weak versions of the axioms D, T, 4, 5 and w5 in the family of many-valued modal non-monotonic logics, à la McDermott and Doyle, introduced in [4] and further investigated in [7]. For many-valued modal languages built on finite chains, we extend the results of [7] by proving two quite general range theorems. We then hint on the relation between the modal non-monotonic logics obtained: we prove that there exist ranges which selectively pick out some of the expansions produced by the many-valued autoepistemic logics introduced in [4, 9], actually the ones with a confidence-bounded set of beliefs. However, an exact characterization of the relation between the various ranges created by the weak many-valued modal axioms still remains to be explored.
Koutras, CD, Nomikos, C & Peppas, P 2002, 'Canonicity and completeness results for many-valued modal logics', Journal of Applied Non-Classical Logics, vol. 12, no. 1, pp. 7-41.
View/Download from: Publisher's site
View description>>
We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early ́90s. Each modal language of this family is based on a Heyting algebra, which serves as the space of truth values, and is interpreted on an interesting version of possible-worlds semantics: the modal frames are directed graphs whose edges are labelled with an element of the underlying Heyting algebra. We introduce interesting generalized forms of the classical axioms D, T, B, 4, and 5 and prove that they are canonical for certain algebraic frame properties, which generalize seriality, reflexivity, symmetry, transitivity and euclideanness. Our results are quite general as they hold for any modal language built on a complete Heyting algebra.
Lin, C, J. Y., L & Y. C., L 2002, 'A neural fuzzy inference network for the motion analyses of Stewart platform'.
Lin, CT, Chung, IF, Pu, HC, Lee, TH & Chang, JY 2002, 'Genetic algorithm-based neural fuzzy decision tree for mixed scheduling in ATM networks', IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 32, no. 6, pp. 832-845.
View/Download from: Publisher's site
Lin, CT, Duh, FB & Liu, DJ 2002, 'A neural fuzzy network for word information processing', FUZZY SETS AND SYSTEMS, vol. 127, no. 1, pp. 37-48.
View/Download from: Publisher's site
Lin, CT, Lin, JY & Wu, GD 2002, 'A robust word boundary detection algorithm for variable noise-level environment in cars', IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, vol. 3, no. 1, pp. 89-101.
View/Download from: Publisher's site
Lin, CT, Wu, RC & Wu, GD 2002, 'Noisy speech segmentation/enhancement with multiband analysis and neural fuzzy networks', INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, vol. 16, no. 7, pp. 927-955.
View/Download from: Publisher's site
Liu, W & Williams, M 2002, 'Trustworthiness Of Information Sources And Information Pedigrees', Lecture Notes In Computer Science vol 2333 - Intelligent Agents Viii: Agent Theories, Architectures, And Languages, vol. 2333, pp. 290-306.
View/Download from: UTS OPUS or Publisher's site
View description>>
To survive, and indeed thrive, in an open heterogenous information sharing environment, an agent's ability to evaluate the trustworthiness of other agents becomes crucial. In this paper, we investigate a procedure for evaluating an agent's trustworthines
Nielsen, MA, Bremner, MJ, Dodd, JL, Childs, AM & Dawson, CM 2002, 'Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces', PHYSICAL REVIEW A, vol. 66, no. 2.
View/Download from: Publisher's site
Pietroni, N 2002, 'Algoritmi e Strutture Dati per la Modellazione Interattiva di Tagli su Oggetti Deformabili'.
Shieh, CS & Lin, CT 2002, 'A vector neural network for emitter identification', IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, vol. 50, no. 8, pp. 1120-1127.
View/Download from: Publisher's site
Wang, JJ, Lin, CT, Liu, SH & Wen, ZC 2002, 'Model-based synthetic fuzzy logic controller for indirect blood pressure measurement', IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 32, no. 3, pp. 306-315.
View/Download from: Publisher's site
Williams, S 2002, 'Designing for Enterprise Use: A Response to The Changing Information Environment', The New Review of Information and Library Research, vol. 7, no. N/A, pp. 93-108.
View/Download from: UTS OPUS
Wu, SJ & Lin, CT 2002, 'Discrete-time optimal fuzzy controller design: Global concept approach', IEEE TRANSACTIONS ON FUZZY SYSTEMS, vol. 10, no. 1, pp. 21-38.
View/Download from: Publisher's site
Wu, SJ & Lin, CT 2002, 'Global optimal fuzzy tracker design based on local concept approach', IEEE TRANSACTIONS ON FUZZY SYSTEMS, vol. 10, no. 2, pp. 128-143.
View/Download from: Publisher's site
Zhang, G & Wu, Y 2002, 'Lattice-valued Zp-Pan-integrals III: Relationships of Pan-integral with Fuzzy Integral, N-integral Labesgue Integral', The Journal of Fuzzy mathematics, vol. 10, no. 3, pp. 627-632.
View/Download from: UTS OPUS
Zhang, G, Wu, Y & Lu, J 2002, 'Lattice-valued Zp-Pan-integrals I: For lattice-valued Simple Functions on Lattice', The Journal of Fuzzy mathematics, vol. 10, no. 1, pp. 213-226.
View/Download from: UTS OPUS
Zhang, G, Wu, Y & Lu, J 2002, 'Lattice-valued Zp-Pan-integrals II: For lattice-valued Borel functions on Lattice', The Journal of Fuzzy mathematics, vol. 10, no. 2, pp. 503-511.
View/Download from: UTS OPUS
Zhou, W & Jia, W 2002, 'A token-based independent update protocol for managing replicated objects', Computer Systems Science and Engineering, vol. 17, no. 3, pp. 189-207.
View description>>
This paper presents the design and evaluation of a token-based protocol supporting independent updates of replicated objects. The paper makes three major contributions. Firstly, a token is used to simplify the control of update propagation and ordering. Secondly a partial commit state is introduced to support independent updates and to enhance the efficiency of transaction processing. Thirdly, a data partition methodology based on priorities is adopted to reduce update conflicts. We evaluate our protocol in comparison of two existing replication-control protocols in terms of transaction processing efficiency.
Bryan, GM, Curry, JM, McGregor, C, Holdsworth, D & Sharply, R 2002, 'Using XML to facilitate information management across multiple local government agencies', Proceedings of the Annual Hawaii International Conference on System Sciences, pp. 1190-1199.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. The main barriers to the level of electronic data interchange required to seamlessly integrate services offered by legacy systems in an Internet environment are the need for applications to share a common data definition and the non-heterogeneity in database platforms. This paper details a collaborative research initiative between the Penrith City Council, Penrith Australia and the Centre for Advanced Systems Engineering (CASE) at the University of Western Sydney. It details the development of a fully functioning XML-based prototype system that provides effective integration of services offered by a collaborating group of legacy systems. The key contribution of this work is to provide an open systems based infrastructure that allows collaborating legacy systems, based on heterogeneous database and server platforms, to offer an integrated query service over the Internet.
Denford, M, O'Neill, T & Leaney, JR 2002, 'Architecture-Based Visualisation of Computer Based Systems', Proceedings of Ninth Annual IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, IEEE International Conference and Workshop on the Engineering of Computer Based Systems, IEEE, Lund, Sweden, pp. 139-146.
View/Download from: UTS OPUS or Publisher's site
View description>>
Architecture is a central concept in the engineering of computer based systems. Given a standard architectural representation, the architecture of systems can be discussed, drawn, reasoned about and classified. Complex architectures may benefit from visualisation. Currently, tools that visualise architectures do so in two-dimensions. Above and beyond visualising the form (or structure) of the architecture in three dimensions, other characteristics of the architecture (e.g. Modularity, Performance, Evolvability, and Openness) can be shown through the visualisation. This paper focuses on the "drawing" of architectures or what is referred to as Architectural Visualisation.
Duh, FB & Lin, CT 2002, 'Radar tracking for a maneuvering target using neural fuzzy based Kalman filter', PROCEEDINGS OF THE 2002 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOL 1 & 2, IEEE International Conference on Fuzzy Systems, IEEE, HONOLULU, HI, pp. 1405-1409.
Goyal, M 2002, 'An Agent Team in a Hostile World', Proceedings of the International Conference on Artificial Intelligence, IC-AI ’02, June 24 - 27, 2002, Las Vegas, Nevada, USA, Volume 1, pp. 391-397.
Huang, M 2002, 'Creating a 2D Interactive Visual Space for Dynamic Navigation of Online Product Catalogs', Proceedings of International Conference on E-Business (ICEB2002), International Conference on e-Business, Beijing Institute of Technology Press, Beijing, China, pp. 444-450.
Huang, M 2002, 'Graph Visualization of Web Data With Domain-specific Attributes', Proceedings of the 16th International Parallel and Distributed Processing Symposium, IEEE International Parallel and Distributed Processing Symposium (was IPPS and SPDP), IEEE Computer Society, Ft. Lauderdale, USA, pp. 221-227.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper introduces a new Graph Visualization technique that can be used to visualize web objects with many associated attributes. We modify the traditional linear model of graphics-driven visualization by defining two mappings between the abstract data and physical pictures, the Geometric Mapping and the Graphical Mapping. We then use this technique to visualize a variety of domain-specific attributes associated with the web objects in a web graph, such as the access frequency and the connectivity of the web page in the web locality.
Huang, M & Doyle, BJ 2002, 'Dynamic Information Visualization in B2C e-Commerce', Proceedings of IADIS International Conference on WWW/Internet 2002, IADIS International Conference on WWW/Internet 2002, IADIS Press, Lisbon, Portugal, pp. 73-80.
View/Download from: UTS OPUS
Huang, M & Lai, W 2002, 'An Architecture for Clustered Visualization of Large Network Data', Proceedings of the 3rd International Conference on Internet Computing (IC 2002), International Conference on Internet Computing, CSREA Press, Las Vegas, USA, pp. 629-635.
Huang, M & Zhang, K 2002, 'Navigating Product Catalogs Through OFDAV Graph Visualization', Proceedings of the 8th International Conference on Distributed Multimedia Systems, The 2002 International Workshop on Visual Computing (VC 2002), Knowledge Systems Institute, San Francisco, USA, pp. 555-561.
View/Download from: UTS OPUS
Jia, W, Au, PO, He, Y & Zhou, W 2002, 'Optimal multicast tree routing for cluster computing in hypercube interconnection networks', Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, pp. 295-300.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. This paper proposes a set of novel efficient multicast routing algorithms on hypercube interconnections of cluster computers using a multicast shared-tree approach. We present some new algorithms for selecting an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient in the sense of short end-to-end average delay, load balance and lower resource utilization over hypercube cluster connections.
Lai, W, Huang, M & Tanaka, J 2002, 'Fitting Web Graph in A Display Area With No Overlaps for Web Navigation', Proceedings of the 3rd International Conference on Internet Computing, International Conference on Internet Computing, CSREA Press, Las Vegas, USA, pp. 601-607.
View/Download from: UTS OPUS
Lan, M, Yu, S, Bacher, R & Zhou, W 2002, 'A Co-Recommendation Algorithm for Web searching', Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002, pp. 479-482.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. This paper presents an approach called the Co-Recommendation Algorithm, which consists of the features of the recommendation rule and the co-citation algorithm. The algorithm addresses some challenges that are essential for further searching and recommendation algorithms. It does not require users to provide a lot of interactive communication. Furthermore, it supports other queries, such as keyword, URL and document investigations. When the structure is compared to other algorithms, the scalability is noticeably easier. The high online performance can be obtained as well as the repository computation, which can achieve a high group-forming accuracy using only a fraction of Web pages from a cluster.
Leaney, JR, Rowe, D & O'Neill, T 2002, 'Issues in the Construction of new Measures within the Discipline of Open Systems', Proceeding of The Asia Pacific Software Engineering Conference, Asia-Pacific Software Engineering Conference, IEEE Computer Society, Gold Coast, QLD, Australia, pp. 527-536.
View/Download from: UTS OPUS or Publisher's site
View description>>
Formalising a measurement is often preceded by rich discussion of the ideas, and the development of general understanding of the meaning of concepts, often over decades. As a consequence, data required to fit into a representational measurement system is usually readily available and there is a general acceptance of the intention of the measure. This paper reports on a research project which has formalised the measurement of a relatively new body of knowledge, open systems. Open systems rely on standards to guarantee interoperability, portability, scalability and user portability. The Internet is the most successful of the open systems in existence, in terms of interoperability and scalability. The first of four issues was that since the project was a research contract, and because there were very few generally understood notions of measurement foundations (or relations) within open systems, the aims and the requirements of the measurement were formalised into a measurement requirements specification (MRS). A second issue concerns the building of a relational model. Building relations in a representational measurement model is relatively straightforward in the case where the measurement entity has been around. A third issue concerned the use of the measures when the measures were (not surprisingly) complex, and had to be combined by biased combiners, the values of which not all parties would naturally agree. A fourth issue raised in the paper is the extent of the validation of the measures which was required because of the contract.
Lin, A & Huang, M 2002, 'Incorporating a Runtime Interactive Visualization into Intelligent Agents', Proceedings of the 3rd International Conference on Internet Computing (IC 2002), International Conference on Internet Computing, CSREA Press, Las Vegas, USA, pp. 608-614.
View/Download from: UTS OPUS
Lin, CT, Liu, DJ, Wu, RC & Wu, GD 2002, 'Noisy speech segmentation/enhancement with multiband analysis and neural fuzzy networks', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 301-309.
View description>>
© Springer-Verlag Berlin Heidelberg 2002. Background noise added to speech can decrease the performance of speech segmentation and enhancement. To solve this problem, new methods have been developed in this thesis. First, a new speech segmentation method (ATF-based SONFIN algorithm) is proposed in fixed noise-level environment. This method contains the multiband analysis and a neural fuzzy network, and it achieves higher recognition rate than the TF-based robust algorithm by 5%. In addition, a new speech segmentation method called RTF-based RSONFIN algorithm is proposed for variable noise-level environment. The RTF-based RSONFIN algorithm contains a recurrent neural fuzzy network. This method contains the multiband analysis and achieve higher recognition rate than the TF-based robust algorithm by 12%.
Liu, SH, Chung, IF & Lin, CT 2002, 'An optimal controller with synthetic fuzzy logic for tracking mean arterial pressure', PROCEEDINGS OF THE 2002 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOL 1 & 2, IEEE International Conference on Fuzzy Systems, IEEE, HONOLULU, HI, pp. 402-407.
Liu, SH, Lin, CT & Wang, JJ 2002, 'A model-based fuzzy logic controller for tracking mean arterial pressure', IEEE International Conference on Fuzzy Systems, pp. 1495-1497.
View/Download from: Publisher's site
View description>>
This paper proposes a new noninvasive measurement method for tracking the tendency of mean arterial pressure (MAP) in the radial artery. The designed system consists of a tonometer, a micro syringe device, and a model-based fuzzy logic controller. The proposed control system consists of a linear predictor, and a synthetic fuzzy logic controller (SFLC). The design of the fuzzy rules in each subcontroller is based on the oscillometric principle saying that the arterial vessel has the maximum compliance when the detected vessel volume pulse reaches its maximum amplitude.
Lu, J & Zhang, G 2002, 'Which Factors are Affecting e-Service Benefit - A research Framework', Proceedings of International Conference on E-Business (ICEB2002), International Conference on e-Business, Beijing Institute of Technology Press, Beijing, China, pp. 128-135.
McGregor, C & Curry, J 2002, 'XML: Implications and applications', Proceedings of the Annual Hawaii International Conference on System Sciences, p. 1543.
View/Download from: Publisher's site
McGregor, C & Kumaran, S 2002, 'An Agent-Based System for Trading Partner Management in B2B e-Commerce', 12th International Workshop on Research Issue in Data Engineering: Engineering E-Commerce/E-Business Systems, RIDE-2EC 2002, IEEE, San Jose, USA, pp. 84-89.
View/Download from: UTS OPUS or Publisher's site
View description>>
Organizations invest in B2B and workflow management systems to enable seamless integration of multiple transaction systems that support their business processes. However, knowledge of the organization's performance becomes buried within internal processing of the B2B workflow platform. This research introduces a framework that analyses workflow audit logs, utilizing DSS principles together with agent technologies, to feedback the organization's performance measures. We apply this framework to a private trading exchange case study where suppliers participate in an interorganizational order fulfillment workflow. Agents refine the organization's knowledge of supplier productivity and commitment as they learn from interactions over time with trading partners
McGregor, C & Kumaran, S 2002, 'Business process monitoring using web services in B2B e-commerce', Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002, p. 219.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. Organisations are re-engineering their B2B communications to be performed through web services. Their aim is to create modularised services that support the business processes within their organisation and also those external entities that participate in these same business processes. This improvement is at the expense of the organisation's knowledge of its performance, as this knowledge will become buried within the internal processing of the web service platform. This research introduces an approach to reclaim and improve this knowledge for the organisation by establishing a framework that enables the definition of web services, together with the logging and analysis of the enactment of web services. This framework utilises web service concepts, DSS principles, and agent technologies, to enable feedback on the organisation's performance measures through the analysis of the web services. We apply this framework to a specific case study where suppliers participate in an inter-organisational workflow via a Private Exchange in the context of order fulfilment. A key benefit of this work is that the data is stored once but provides information both to the organisation acting as the customer and the organisation acting as the supplier. It therefore removes the need for development of internal performance monitoring tools to monitor web services performance.
McGregor, C, Bryan, G, Curry, J & Tracy, M 2002, 'The e-Baby data warehouse: A case study', Proceedings of the Annual Hawaii International Conference on System Sciences, pp. 3018-3024.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. Neonatal intensive care units (NICUs) require equipment and facilities to assist and monitor premature (and some full-term) babies. This equipment outputs physiological and clinical data, but current research does not provide doctors with techniques for capturing this data in a format that is suitable for analysis and research. Additionally, regional hospitals provide limited NICU support, but, without access to a neonatologist, the baby must be moved to another hospital. This paper details a framework for clinical and physiological data capture, the storage structures within the e-Baby data warehouse, and information access through a secure intranet/Internet browser. The key contribution of this work is the infrastructure that provides a platform for patient information data capture, storage, display and analysis. A key benefit of this work is to provide a mechanism for neonatologists to receive information directly from a regional hospital, thereby preventing, in some cases, the immediate need to move the baby.
Nguyen, Q & Huang, M 2002, 'A Space-Optimized Tree Visualization', Proceedings of InfoVis 2002, IEEE Information Visualization Conference, IEEE Computer Society, Boston, USA, pp. 85-92.
View/Download from: UTS OPUS or Publisher's site
View description>>
We describe a new method for the visualization of tree structured relational data. It can be used especially for the display of very large hierarchies in a 2-dimensional space. We discuss the advantages and limitations of current techniques of tree visualization. Our strategy is to optimize the drawing of trees in a geometrical plane and maximize the utilization of display space by allowing more nodes and links to be displayed at a limit screen resolution. We use the concept of enclosure to partition the entire display space into a collection of local regions that are assigned to all nodes in tree T for the display of their sub-trees and themselves. To enable the exploration of large hierarchies, we use a modified semantic zooming technique to view the detail of a particular part of the hierarchy at a time based on user's interest. Layout animation is also provided to preserve the mental map while the user is exploring the hierarchy by changing zoomed views.
Nguyen, Q & Huang, M 2002, 'Using Space-Optimized Tree Visualisation for Web Site-Mapping', Proceedings of The International Conference on Internet Computing (IC 02), International Conference on Internet Computing, CSREA Press, Las Vegas, USA, pp. 622-628.
View/Download from: UTS OPUS
Williams, S 2002, 'Bridging The Gap Between Information Resource Design and Enterprise Content Management', Digital Libraries: People, Knowledge and Technology - Proceedings of 5th International Conference on Asian Digital Libraries, ICADL 2002, 5th International Conference on Asian Digital Libraries, Springer-Verlag, Singapore, pp. 507-515.
View/Download from: UTS OPUS
Xiang, Y & Zhou, W 2002, 'The design and development of an integrated system for object-oriented finite element computing', Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002, pp. 201-204.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. Finite element method (FEM) is widely used in science and engineering since 1960's. The vast majority of FEM software is procedure-oriented. However, this conventional style of designing FEM software encounters problems in maintenance, reuse, and expansion of the software. Recently, the object-oriented finite element method attracts the attention of many researchers, and now there is a growing interest in this method. In this paper, the object-oriented finite element (OOFE) is briefly introduced. The design and development of an integrated OOFE system is then described. A comparison of the integrated OOFE system and a procedure-oriented system shows that our OOFE system has many advantages.
Xiang, Y, Ping, Y & Zhou, W 2002, 'Object-oriented finite element analysis: A distributed approach to mesh generation', Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002, pp. 92-99.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. The object-oriented finite element method (OOFEM) has attracted the attention of many researchers. Compared with the traditional finite element method, OOFEM software has the advantages of maintenance and reuse. Moreover, it is easier to expand the architecture to a distributed one. In this paper, we introduce a distributed architecture of a object-oriented finite element preprocessor. A comparison between the distributed system and the centralised system shows that the former, presented in the paper, greatly improves the performance of mesh generation. Other finite element analysis modules could be expanded according to this architecture.
Yu, S, Zhou, W & Wu, Y 2002, 'Research on network anycast', Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002, pp. 154-161.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. Anycast is defined as a service in IPv6, which provides stateless best effort delivery of an anycast datagram to at least one, and preferably only one host. It is a topic of increasing interest. This paper is an attempt to gather and report on the work done on anycast. There are two main categories at present: network-layer anycast and application-layer anycast. Both involve anycast architectures, routing algorithms, metrics, applications, etc. We also present an efficient algorithm for application-layer anycast, and point out possible research directions based on our research.
Yu, S, Zhou, W, Huang, F & Lan, M 2002, 'An efficient algorithm for application-layer anycasting', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 74-83.
View description>>
© Springer-Verlag Berlin Heidelberg 2002. Anycasting communication is proposed in IPv6, and it is designed to support server replication by allowing applications to select and communicate with the “best” server, according to some performance or policy criteria, among the replicated servers. Originally anycast researchers focus on network layer. In this paper we pay more attention to application-layer anycasting, because at application layer we can obtain more flexibility and scalability. First of all, we describe the application-layer anycast model, and then summarize the previous work in application-layer anycasting, especially the periodical probing algorithms for updating the database of anycast resolver. After that, we present our algorithm, the requirement-based probing algorithm, an efficient and practical algorithm. In the end, we analyse the algorithms using the queuing theory and the statistics characteristics of Internet traffic. The results show that the requirement-base probing algorithm has better performance not only in the average waiting time for all anycast queries, but also in the average time used for an anycast query.
Yu, S, Zhou, W, Zhao, Y, Lan, M & Xiang, Y 2002, 'A Web-DB model on multicast and anycast', Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002, pp. 412-415.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. Most of the current web-based database systems suffer from poor performance, complicated heterogeneity, and synchronization issues. In this paper, we propose a novel mechanism for web-based database system on multicast and anycast protocols to deal with these issues. In the model, we put a castway, a network interface for database server, between database server and Web server. Castway deals with the multicast and anycast requests and responses. We propose a requirement-based server selection algorithm and an atomic multicast update algorithm for data queries and synchronizations. The model is independent from the Internet environment, it can synchronise the databases efficiently and automatically. Furthermore, the model can reduce the possibility of transaction deadlocks.
Zhang, C, Yan, X, Zhang, S & Kennedy, PJ 2002, 'Mining Very Large Databases Using Software Agents', Proceedings of the International Conference on Machine Learning and Application (ICMLA 02), International Conference on Machine Learning and Application (ICMLA 02), CSREA Press, Las Vegas, USA, pp. 84-90.
View/Download from: UTS OPUS
Zhang, K, Huang, M & Li, K 2002, 'An Integrated Visual Framework for the Human-Web Interface', Proceedings of the 4th IEEE International Workshop on Advanced Issues of E-Commerce and Web-based Information Systems, 4th IEEE International Workshop on Advanced Issues of E-Commerce and Web-based Information Systems, IEEE Computer Society Press, Newport Beach, USA, pp. 195-202.
View/Download from: UTS OPUS or Publisher's site
View description>>
The design of Web sites has been largely ad hoc, with little concern about the effectiveness of navigation and maintenance. This paper presents a general framework with a human-Web interface that supports Web design through visual programming and reverse Web engineering through visualization. The paper describes the framework in the context of a Web tool, known as HWIT which has been developed for a pilot study.
Zhou, W & Wang, L 2002, 'An analysis of update ordering in a cluster of replicated servers', Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002, pp. 28-35.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. This paper analyses update ordering and its impact on the performance of a cluster of replicated servers. We propose a model for update orderings and constraints and develop a number of algorithms for implementing different ordering constraints. A performance study is then carried out to analyse the update ordering model.