FOWELL, S & LEVY, P 1995, 'DEVELOPING A NEW PROFESSIONAL PRACTICE - A MODEL FOR NETWORKED LEARNER SUPPORT IN HIGHER-EDUCATION', JOURNAL OF DOCUMENTATION, vol. 51, no. 3, pp. 271-280.
View/Download from: Publisher's site
FOWELL, SP & LEVY, P 1995, 'COMPUTER-MEDIATED COMMUNICATION IN THE INFORMATION CURRICULUM - AN INITIATIVE IN COMPUTER-SUPPORTED COLLABORATIVE LEARNING', EDUCATION FOR INFORMATION, vol. 13, no. 3, pp. 193-210.
Jay, CB 1995, 'A semantics for shape', Science of Computer Programming, vol. 25, pp. 251-283.
Jay, CB 1995, 'Covariant types'.
Jay, CB & Ghani, N 1995, 'The virtues of eta-expansion', J. of Functional Programming, vol. 5, pp. 135-154.
Alchourron, Gärdenfors and Makinson have developed and investigated a set of rationality postulates which appear to capture much of what is required of any rational system of theory revision. This set of postulates describes a class of revision functions, however it does not provide a constructive way of defining such a function. There are two principal constructions of revision functions, namely an epistemic entrenchment and a system of spheres. We refer to their approach as the AGM paradigm. We provide a new constructive modeling for a revision function based on a nice preorder on models, and furthermore we give explicit conditions under which a nice preorder on models, an epistemic entrenchment, and a system of spheres yield the same revision function. Moreover, we provide an identity which captures the relationship between revision functions and update operators (as defined by Katsuno and Mendelzon). © 1995, Duke University Press. All Rights Reserved.
PFEIFFER, M & LEANEY, J 1995, 'THE SIMPLE RELIABLE MONITOR - A FORMALIZATION OF THE CONCEPT OF A SAFE SOFTWARE MONITOR', AUSTRALIAN COMPUTER JOURNAL, vol. 27, no. 1, pp. 9-15.
Wang, J, Xu, G & Wang, N 1995, 'Mathematical model for calculating the flux of laser scattering by single particle in arbitrary directions', Yingyong Jiguang/Applied Laser Technology, vol. 15, no. 2, pp. 79-78.
A formula for calculating the scattered light intensity from a single particle by using the Mie's theory was derived here, and based on which, the scattered light-flux in a certain solid-angle in arbitrary direction was further obtained to correct the mistake occuring in the expression on the light-flux existed in one of the references listed.
Chang, HT, Shyu, JM, Lin, CT, Chen, OTC, Deng, HJ, Chen, WJ, Luo, SR, Hsu, YR, Lu, YC & Shyu, HC 1995, 'Pipelined fuzzy reasoning processor with software development system and its application on the crane control problem', Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 3658-3665.
Fuzzy reasoning processors have been employed in many commercial and industrial applications. A high-performance pipelined, single-instruction-stream, and single-data-stream architecture of fuzzy reasoning engine has been designed. Based on this architecture, the proposed VLSI processor for embedded real-time fuzzy logic applications was fabricated in a 0.8-mm CMOS technology. Its computation power can reach 2.5 Million Fuzzy Logic Inferences Per Second (MFLIPS) at a system clock of 20 MHz. In order to efficiently realize fuzzy applications, a software development system under Microsoft Windows has also been designed. For the purpose of showing its effectiveness, we have carried out the experiments to successfully control the crane system. Experimental results have shown the efficient cooperative control of the proposed fuzzy reasoning processor with software development system and can be contrast with conventional computer software interface control.
Jay, CB 1995, 'Polynomial Polymorph\-ism', Proceedings of the Eighteenth Australasian Computer Science Conference: Glenelg, South Australia 1–3 February, 1995, ACS Communications, pp. 237-243.
Jay, CB 1995, 'Shape Analysis for Parallel Computing', Proceedings of the fourth international parallel computing workshop: Imperial College London, 25–26 September, 1995, Imperial College/Fujitsu Parallel Computing Research Centre, pp. 287-298.
LIN, CJ & LIN, CT 1995, 'REINFORCEMENT LEARNING FOR ART-BASED FUZZY ADAPTIVE LEARNING CONTROL NETWORKS', PROCEEDINGS OF 1995 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS I-IV, 4th IEEE International Conference on Fuzzy Systems/2nd International Fuzzy Engineering Symposium (FUZZY-IEEE/IFES 95), I E E E, YOKOHAMA, JAPAN, pp. 1299-1306.
LIN, CT, LIN, CJ & CHUNG, IF 1995, 'Neural fuzzy control of unstable nonlinear systems', 1995 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, 1995 IEEE International Conference on Systems, Man and Cybernetics - Intelligent Systems for the 21st-Century, I E E E, VANCOUVER, CANADA, pp. 3666-3671.
Lister, R & Stone, JV 1995, 'Empirical study of the time complexity of various error functions with conjugate gradient back propagation', IEEE International Conference on Neural Networks - Conference Proceedings, pp. 237-241.
We describe an empirical comparison of the scaling behaviour of six error functions, on a conjugate gradient form of Back Propagation. We classify the functions according to the limit behaviours of their respective error signals, as the target value and the actual output value approach opposite extremes. These limit behaviours are zero limit, finite limit, and infinite limit. Despite such a wide divergence in their limit behaviours, we find that all six error functions exhibit a median run-time order of approximately O(N 4) on the N-2-N encoder. This result indicates that, while some factors affecting the scaling behaviour of standard and conjugate gradient Back Propagation have been previously identified (such as saturation), other factors remain unidentified.
We propose a three-class taxonomy of error functions, based on the limit behaviour of the error signal. We classify four established error functions: the quadratic, Fahlman's Quickprop, entropy, and the exception error function. We introduce two new error functions, and benchmark all six on the N-2-N encoder. The two new functions found correct solutions faster and more reliably than the established functions.
Williams, MA 1995, 'Conditionalizing expectations', ANZIIS 1995 - Proceedings of the 3rd Australian and New Zealand Conference on Intelligent Information Systems, pp. 111-116.
View/Download from: Publisher's site
© 1995 IEEE. All rights reserved. An information system characterizes a view of the world. Typically this view is incomplete and subject to change, as a consequence such systems use nonmonotonic reasoning to form expectations about the world, and they modify their expectations as new information is acquired. For instance, database systems use the closed world assumption a very naive variety of nonmonotonic reasoning, and their expectations are updated when new information becomes available in the form of transactions. Gardenfors and Makinson have shown that nonmontonic inferences can be constructed from a preference ordering of expectations. In this paper we adapt the process of conditionalization and techniques developed in the area of belief revision to handle changes in the nonmonotonic information encapsulated in an expectation ordering. Thereby providing a mechanism for modeling the removal of old expectations, the incorporation of new expectations, as well as the raising and lowering of existing expectations. Changes to the expectation ordering using conditionalization are based on a relative measure of minimal change.
This paper presents a generic recursive algorithm for fault-tolerant computing. The algorithm uses recursive majority voting to achieve fault tolerance on a multiprocessor system. Both space and time redundancy are employed dynamically in the algorithm. By defining different parameters, the algorithm can be applied to different situations. The correctness and performance analysis of the algorithm are also described.
Zhou, W 1995, 'Providing fault-tolerant services in an open client/service paradigm', Proceedings of IEEE Singapore International Conference on Networks/International Conference on Information Engineering IEEE SICON/ICIE, pp. 576-580.
The design and understanding of fault-tolerant open distributed systems is a very difficult task. We have to deal with not only all the complex problems of open distributed systems when all the components are well, but also the more complex problems when some of the components fail. This paper proposes a fault-tolerant computing model on open distributed systems. The performance of the model is simulated and analysed. A prototype implementation of the model using Remote Procedure Calls (RPCs) is also described.
Jay, CB 1995, 'P2'.