Chen, PH, Lai, JH & Lin, CT 1998, 'Application of fuzzy control to a road tunnel ventilation system', FUZZY SETS AND SYSTEMS, vol. 100, no. 1-3, pp. 9-28.
View/Download from: Publisher's site
Chiarella, C & He, XZ 1998, 'Learning about the Cobweb', Complexity International, vol. 6.
View description>>
In this paper we consider how suppliers in a cobweb model may learn about their economic environment. Instead of assuming the one step backward-looking expectation scheme of the traditional linear cobweb model, we consider the subjective estimates of the statistical distribution of the market prices based on L-step backward time series of market clearing prices. With constant risk aversion, the cobweb model becomes nonlinear. Sufficient conditions on the local stability of the unique positive equilibrium of the nonlinear model are derived and, consequently, we show that the local stability region (of the parameters of the equation) is proportional to the lag length L When the equilibrium loses its local stability, we show that, for L=2, the model has strong 1:3 resonance bifurcation and a family of fixed points of order 3 becomes unstable on both sides of criticality. The numerical simulations suggest that the model has a simple global structure, it has no complicated dynamics as claimed recently by Boussard. However, complicated dynamics do appear when the model is modified with constant elasticity supply and demand.
He, X 1998, 'Almost Periodic Solutions Of A Competition System With Dominated Infinite Delays', Tohoku Mathematical Journal, vol. 50, no. 1, pp. 71-89.
View/Download from: Publisher's site
View description>>
In this paper, we consider an n-species almost periodic Lotka-Volterra competition system with dominated infinite delays. By constructing suitable Lyapunov functionals, we are able to show that, under a set of algebraic conditions, the system has a uniqu
He, X 1998, 'The Lyapunov Functionals For Delay Lotka-volterra-type Models', Siam Journal On Applied Mathematics, vol. 58, no. 4, pp. 1222-1236.
View/Download from: Publisher's site
View description>>
By means of Lyapunov functionals, we have succeeded in establishing the global attractivity of the positive equilibrium of n-species Lotka-Volterra systems modeled by equations of the pure-delay type with both finite and infinite delays involved. As a co
He, X & Ruan, D 1998, 'Global Stability In Chemostat-type Plankton Models With Delayed Nutrient Recycling', Journal Of Mathematical Biology, vol. 37, no. 3, pp. 253-271.
View/Download from: Publisher's site
View description>>
In this paper, we consider chemostat-type plankton models in which plankton feeds on a limiting nutrient and the nutrient is supplied at a constant rate and is partially recycled after the death of plankton by bacterial decomposition. We use a distribute
He, X, Xia, H & Ruan, D 1998, 'Global Stability In Chemostat-type Equations With Distributed Delays', Siam Journal On Mathematical Analysis, vol. 29, no. 3, pp. 681-696.
View/Download from: Publisher's site
View description>>
We consider a chemostat-type model in which a single species feeds on a limiting nutrient supplied at a constant rate. The model incorporates a general nutrient uptake function and two distributed (infinite) delays. The first delay models the fact that t
Jay, CB, Bellè, G & Moggi, E 1998, 'Functorial ML', Journal of Functional Programming, vol. 8, pp. 573-619.
Juang, CF & Lin, CT 1998, 'An on-line self-constructing neural fuzzy inference network and its applications', IEEE TRANSACTIONS ON FUZZY SYSTEMS, vol. 6, no. 1, pp. 12-32.
View/Download from: Publisher's site
Li, J & He, X 1998, 'Multiple Periodic Solutions Of Differential Delay Equations Created By Asymptotically Linear Hamiltonian Systems', Nonlinear Analysis-theory Methods & Applications, vol. 31, no. 1-2, pp. 45-54.
View/Download from: Publisher's site
View description>>
NA
Lin, CT & Kan, MC 1998, 'Adaptive fuzzy command acquisition with reinforcement learning', IEEE TRANSACTIONS ON FUZZY SYSTEMS, vol. 6, no. 1, pp. 102-121.
View/Download from: Publisher's site
Lin, CT, Jou, CP & Lin, CJ 1998, 'GA-based reinforcement learning for neural networks', INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, vol. 29, no. 3, pp. 233-247.
View/Download from: Publisher's site
Luo, X & Zhang, C 1998, 'LSlNCF: A Hybrid Uncertain Reasoning Model Based On Probability', International Journal Of Uncertainty Fuzziness And Knowledge-based Systems, vol. 6, pp. 401-422.
View/Download from: Publisher's site
View description>>
NA
Ruan, D & He, X 1998, 'Global Stability In Chemostat-type Competition Models With Nutrient Recycling', Siam Journal On Applied Mathematics, vol. 58, no. 1, pp. 170-192.
View/Download from: Publisher's site
View description>>
Freedman and Xu [J. Math. Biol., 31 (1993), pp. 513-527] proposed two chemostat-type competition models with nutrient recycling. In the first model the recycling is instantaneous, whereas in the second, the recycling is delayed. They carried out the equi
Sleiman, RJ, Catchpoole, DR & Stewart, BW 1998, 'Drug-induced death of leukaemic cells after G2/M arrest: Higher order DNA fragmentation as an indicator of mechanism', British Journal of Cancer, vol. 77, no. 1, pp. 40-50.
View/Download from: Publisher's site
View description>>
Many reports have documented apoptotic death in different cell types within hours of exposure to cytotoxic drugs; lower drug concentrations may cause cell cycle arrest at G2/M and subsequent death, which has been distinguished from 'classic' apoptosis. We have analysed etoposide-induced cell death in two lymphoblastoid T-cell lines, CCRF-CEM and MOLT-4, specifically in relation to DNA cleavage as indicated by pulse-field gel and conventional electrophoresis. High (5 μM) concentration etoposide causes 50-kb cleavage of DNA that occurs at the same time as apoptotic morphology and internucleosomal cleavage. At lower concentrations (0.5-0.05 μM), sequential change may be discerned with altered gene expression being similar to that at high dose, but preceding cell cycle arrest and 50-kb cleavage. These last changes, in turn, clearly precede internucleosomal fragmentation of DNA, vital dye staining and morphological evidence cell death. The pattern of higher order fragmentation constitutes a sensitive indicator of commitment to cell death in these cells. Morphological evidence of cell death is associated with internucleosomal fragmentation in one of the lines, but the pattern of 50-kb DNA cleavage provides the clearest evidence of commonality in death processes occurring at low and high drug concentration.
Wang, YJ & Lin, CT 1998, 'A second-order learning algorithm for multilayer networks based on block Hessian matrix', NEURAL NETWORKS, vol. 11, no. 9, pp. 1607-1622.
View/Download from: Publisher's site
Wang, YJ & Lin, CT 1998, 'Runge-Kutta neural network for identification of dynamical systems in high accuracy', IEEE TRANSACTIONS ON NEURAL NETWORKS, vol. 9, no. 2, pp. 294-307.
View/Download from: Publisher's site
Xu, YL & Zhang, C 1998, 'A Neural Network Diagnosis Model Without Disorder Independence Assumption', Pricai'98: Topics In Artificial Intelligence, vol. 1531, pp. 341-352.
View/Download from: UTS OPUS
View description>>
Generally, the disorders in a neural network diagnosis model are assumed independent each other. In this paper, we propose a neural network model for diagnostic problem solving where the disorder independence assumption is no longer necessary. Firstly, we characterize the diagnostic tasks and the causal network which is used to represent the diagnostic problem, then we describe the neural network diagnosis model, finally, some experiment results will be given.
Antoniou, G & Williams, MA 1998, 'Revising default theories', Proceedings of the International Conference on Tools with Artificial Intelligence, pp. 423-430.
View description>>
Default logic is a prominent rigorous method of reasoning with incomplete information based on assumptions. It is a static reasoning approach, in the sense that it doesn't reason about changes and their consequences. On the other hand, its nonmonotonic behaviour appears when a change to a default theory is made. This paper studies the dynamic behaviour of default logic in the face of changes, a concept that we motivate by a reference to requirements engineering. The paper defines a contraction and a revision operator, and studies their properties. This work is part of an ongoing project whose aim is to build an integrated, domain-independent toolkit of logical methods for reasoning with changing and incomplete information. The techniques described in this paper will be implemented as part of the toolkit.
Antoniou, G & Williams, MA 1998, 'Some approaches to reasoning with incomplete and changing information', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 9-44.
View/Download from: Publisher's site
Blumenstein, M & Verma, B 1998, 'Neural based segmentation and recognition technique for handwritten words', IEEE International Conference on Neural Networks - Conference Proceedings, pp. 1738-1742.
View description>>
Artificial Neural Networks (ANNs) have been successfully applied to Optical Character Recognition (OCR) yielding excellent results. In this paper a technique is presented that segments difficult printed and cursive handwriting, and then classifies the segmented characters. A conventional algorithm is used for the initial segmentation of the words, while an ANN is used to verify whether an accurate segmentation point has been found. After all segmentation points have been detected another NN is used to identify the characters which remain following the segmentation process. The C programming language, the SP2 supercomputer and a SUN workstation were used for the experiments. The technique has been tested on real-world handwriting scanned from various staff at Griffith University, Gold Coast. Some preliminary experimental results are presented in this paper.
Jay, CB & Steckler, PA 1998, 'The functional imperative: shape!', Programming languages and systems: 7th European Symposium on Programming, ESOP’98 Held as part of the joint european conferences on theory and practice of software, ETAPS’98 Lisbon, Portugal, March/April 1998, Springer Verlag, pp. 139-53.
Jay, CB, Moggi, E & Bellè, G 1998, 'Functors, types and shapes', Workshop on Generic Programming: Marstrand, Sweden, 18th June, 1998, Chalmers University of Technology, pp. 21-4.
Juang, CF & Lin, CT 1998, 'Genetic reinforcement learning through symbiotic evolution for fuzzy controller design', 1998 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AT THE IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE - PROCEEDINGS, VOL 1-2, IEEE International Conference on Fuzzy Systems at the World Congress on Computational Intelligence (WCCI 98), IEEE, ANCHORAGE, AK, pp. 1281-1285.
Lu, HY, Zhu, JG, Hui, SYR & Ramsden, VS 1998, 'A generalized dynamic transformer circuit model including all types of core losses', PEDES 1998 - 1998 International Conference on Power Electronic Drives and Energy Systems for Industrial Growth, pp. 978-983.
View/Download from: Publisher's site
View description>>
© 1998 IEEE. This paper describes a generalized dynamic transformer circuit model that includes all types of core losses, nonlinear magnetic characteristics, skin effects of eddy currents in the core, and thermal effects on hysteresis of core materials. A TLM-based transform with variable time steps is employed in the simulation. This model can provide an accurate prediction of transformer performance and core losses and is suitable for simulation of high frequency switching mode converters using transformer isolated outputs. Some interesting issues such as stray capacitance, are discussed. Simulations of a 500 W transformer in a full bridge inverter operated at 15 kHz and 25 kHz have been confirmed by experiments.
Lu, HY, Zhu, JG, Hui, SYR & Ramsden, VS 1998, 'Dynamic circuit modeling of a high frequency transformer', PESC 98 RECORD - 29TH ANNUAL IEEE POWER ELECTRONICS SPECIALISTS CONFERENCE, VOLS 1 AND 2, 29th Annual IEEE Power Electronics Specialists Conference, IEEE, FUKUOKA, JAPAN, pp. 1479-1485.
Macnish, CK & Williams, MA 1998, 'From belief revision to design revision: Applying theory change to changing requirements', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 206-220.
View/Download from: Publisher's site
View description>>
© Springer-Verlag Berlin Heidelberg 1998. The ability to correctly analyse the impact of changes to system designs is an important goal in software engineering. A framework for addressing this problem has been proposed in which logical descriptions are developed alongside traditional representations. While changes to the resulting design have been considered, no formal framework for design change has been offered. This paper proposes such a framework using techniques from the field of belief revision. It is shown that under a particular strategy for belief revision, called a maxi-adjustment, design revisions can be modelled using standard revision operators. As such, the paper also offers a new area of application for belief revision. Previous attempts to apply belief revision theory have suffered from the criticism that deduced information is held on to more strongly than the facts from which it is derived. This criticism does not apply to the present application because we are concerned with goal decomposition rather than reasoning from facts, and it makes sense that goals should be held onto more strongly than the decompositions designed to achieve them.
Moggi, E, Bellè & Jay, CB 1998, 'Monads, Shapely Functors and Traversals', Università di Genova.
Palsberg, J, Jay, CB & Noble, J 1998, 'Experiments with generic visitors', Workshop on generic programming: Marstrand, Sweden, 18th June, 1998, pp. 81-4.
Prokopenko, M & Peppas, P 1998, 'Modelling inertia in action languages', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 234-247.
View/Download from: Publisher's site
View description>>
© Springer-Verlag Berlin Heidelberg 1998. Logic-based approaches to reasoning about actions, change and causality, highlight efficient representation and processing of domain background knowledge as an important task. Action theories recently developed in the framework of action languages with inertia and ramifications [20,14] not only adopt the principle of minimal change reinforced with the policy of categorisation (assigning different degrees of inertia to language elements) but also try to incorporate background causal knowledge. In this paper we aim to trace the evolution of action languages and to explore interactions between ontological characteristics of action domains such as inertia and causality. Such an analysis should clarify how possible solutions to the frame and the ramification problems are affected by applying the policy of categorisation to causal' domains. We first attempt to identify conditions (more precisely, restrictions) which preserve the meaning of domain descriptions when moving among various analysed languages. Relaxing such restrictions can help in evaluating the role of the frame concept (and policy of categorisation, in general) in an action language with fluent-triggered causality.
Wang, YJ & Lin, CT 1998, 'Runge Kutta Neural Network for identification of continuous systems', 1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, IEEE International Conference on Systems, Man, and Cybernetics - Intelligent Systems for Humans in a Cyberworld (SMC 98), IEEE, SAN DIEGO, CA, pp. 3277-3282.
Williams, MA 1998, 'Applications of belief revision', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 287-316.
Xu, Y & Zhang, C 1998, 'Efficient and practical diagnosis model', Proceedings of the International Conference on Tools with Artificial Intelligence, pp. 367-374.
View description>>
The task of diagnosis, a typical abductive problem, is to find a hypothesis that best explains a set of observations. Generally, a neural network diagnostic reasoning model finds only one hypothesis to a set of observations. It is computationally expensive to find the hypothesis because the number of the potential hypotheses is exponentially large. Recently, we have proposed a connectionist diagnosis model to overcome the above difficulty. In this paper, we propose a method to improve the efficiency and the practicality of the model. The improved model can find more solutions, and the efficiency of the model is also improved.
Zhang, C & Li, Y 1998, 'An algorithm for plan verification in multiple agent systems', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 149-163.
View/Download from: Publisher's site
View description>>
© Springer-Verlag Berlin Heidelberg 1998. In this paper, we propose an algorithm which can improve Katz and Rosenschein’s plan verification algorithm. First, we represent the plan-like relations with adjacency lists and inverse adjacency lists to replace adjacency matrixes. Then, we present a method to avoid generating useless sub-graphs while generating the compressed set. Last, we compare two plan verification algorithms. We not only prove that our algorithm is correct, but also prove that our algorithm is better than Katz and Rosenschein’s algorithm both on time complexity and space complexity.
Zhang, C & Luo, X 1998, 'Transformation between the EMYCIN model and the bayesian network', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 205-219.
View/Download from: Publisher's site
View description>>
© Springer-Verlag Berlin Heidelberg 1998. If different expert systems use different uncertain reasoning models in a distributed expert system, it is necessary to transform the uncertainty of a proposition from one model to another when they cooperate to solve problems. This paper looks at ways to transform uncertainties between the EMYCIN model and the Bayesian network. In the past, the uncertainty management scheme employed the most extensively in expert systems was the EMYCIN model. Now the scheme is turning towards the Bayesian network. If we can combine, by means of the Internet, pre-existing stand-alone expert systems that use these two models into a distributed expert system, the ability of these individual expert systems in their real applications will be greatly improved. The work described in this paper is an important step in this direction.
Zhang, M & Zhang, C 1998, 'Investigations on solution synthesis in distributed expert systems', Proceedings of the IEEE International Conference on Intelligent Processing Systems, ICIPS, pp. 1108-1112.
View description>>
In this paper, a general procedure of distributed problem solving in DESs is formally described, solution synthesis and solution composition in DESs are compared, and the relationship between solution synthesis in DESs and conflict resolutions in DAI is analyzed. Furthermore, general methodologies used for solution synthesis in DESs are introduced and compared.
Zhu, JG, Lu, HY, Ramsden, VS & Tran, K 1997, 'Temperature dependence of magnetic hysteresis of soft ferrites', NON-LINEAR ELECTROMAGNETIC SYSTEMS, 8th International Symposium on Non-Linear Electromagnetic Systems (ISEM Braunschweig), I O S PRESS, BRAUNSCHWEIG, GERMANY, pp. 495-498.