Antoniou, G, Courtney, A, Ernst, J & Williams, M 1996, 'A System For Computing Constrained Default Logic Extensions', Lecture Notes in Computer Science, vol. 1126, pp. 237-250.
View/Download from: Publisher's site
View description>>
The aim of this paper is to describe the algorithmic foundations of the part of the program Exten responsible for the computation of extensions in Constrained Default Logic. Exten is a system that computes extensions for various default logics. The effic
Finn, GD, Lister, R, Szabo, T, Simonetta, D, Mulder, H & Young, R 1996, 'Neural networks applied to a large biological database to analyse dairy breeding patterns', Neural Computing and Applications, vol. 4, no. 4, pp. 237-253.
View/Download from: Publisher's site
View description>>
The paper recounts the investigation of a dairy sire prediction capability based on Cascade Correlation neural networks to study influences relating the performance of offspring to their parents. The context of the problem is the artificial insemination breeding program for the Australian dairy industry. The networks are used to screen observed information in the database to relate it to best combinations of dam and sire. The voluminous data is quite noisy and is subject to genetic and environmental influences. The intention is to extract linear and nonlinear relationships from among the input variables without specifying their form. A number of scenarios are employed which recast the data into different forms. In particular, it was discovered that the problem could be restructured and the data supplemented with transformed data to produce succinct input patterns of manageable dimensionality, which allowed for a substantially improved predictive capability. It was then found that reasonable daughter predictions could be obtained of about 10%, as measured by her milk production. Results are compared with those obtained using two alternate neural network methods. Crude statistical methods are employed to evaluate the performance of the neural networks.
Fowell, S & Levy, P 1996, 'Special issue on networked learner support', EDUCATION FOR INFORMATION, vol. 14, no. 4, pp. 257-260.
Jacobs, M & Leydekkers, P 1996, 'Specification of synchronization in multimedia conferencing services using the TINA lifecycle model', Distributed Systems Engineering, vol. 3, no. 3, pp. 185-196.
View/Download from: Publisher's site
View description>>
Multimedia conferencing services have specific performance requirements with respect to the exchange of continuous media. One of these requirements is the synchronization within and between related streams. This article identifies synchronization requirements and solutions relevant for conferencing services that operate in an open distributed environment as defined in TINA-C. Based on the TINA service lifecycle, synchronization requirements and policies are described from different stakeholder perspectives. Synchronization is then specified in detail using the TINA information, computational and engineering languages. Finally, a description of the implementation of synchronization for a multimedia conferencing service is provided using a DPE platform. The synchronization object is proposed as an additional component available for the DPE that needs to deal with real-time audio-visual streams.
Jay, B & Staples, J 1996, 'Theoretical computer science in Australia and New Zealand - Preface', THEORETICAL COMPUTER SCIENCE, vol. 169, no. 1, pp. 1-1.
View/Download from: Publisher's site
Jay, CB 1996, 'Shape in computing', ACM Computing Surveys, vol. 28, pp. 355-357.
Jay, CB & Staples, J 1996, 'Preface to a special issue on Australasian research', Theoretical Computer Science, vol. 169.
Juang, CF & Lin, CT 1996, 'Self-organizing neural fuzzy inference network for indentification and control', Journal of Control Systems and Technology, vol. 4, no. 4, pp. 269-280.
View description>>
A Self-Organizing Neural Fuzzy Inference Network (SONFIN) with on-line learning ability is proposed in this paper. The SONFIN in inherently a fuzzy rule-based model possessing neural network's learning ability. In contrast to the general adaptive neural fuzzy networks, where the rules should be decided in advance before parameter learning is performed, there are no rules initially in the SONFIN. They are created and adapted as on-line learning proceeds via simultaneous structure and parameter identification. In this structure identification of the precondition part, the input space is partitioned in a flexible way according to an aligned clustering-based algorithm. As to the structure identification of the consequent part, only a singleton value selected by a clustering method is assigned to each rule initially. Afterwards, some additional terms (a linear combination of input variables) are added to the consequent part when necessary. Furthermore, to enhance the knowledge representation ability of the SONFIN, a linear transformation for each input variable can be incorporated into the network so that much fewer rules are needed or higher accuracy can be achieved. Proper linear transformation are also learned dynamically in the parameter identification phase of the SONFIN. To demonstrate the capability of the proposed SONFIN, simulations in identification and control problems are done. Effectiveness of the SONFIN is verified from these simulations.
Levy, P, Fowell, SP, Bowskill, N & Worsfold, E 1996, 'NetLinkS: A national professional development project for networked learner support', EDUCATION FOR INFORMATION, vol. 14, no. 4, pp. 261-278.
Lin, CJ & Lin, CT 1996, 'Reinforcement learning for an ART-based fuzzy adaptive learning control network', IEEE TRANSACTIONS ON NEURAL NETWORKS, vol. 7, no. 3, pp. 709-731.
View/Download from: Publisher's site
Lin, CT 1996, 'Adaptive subsethood for neural fuzzy control', INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, vol. 27, no. 10, pp. 937-955.
View/Download from: Publisher's site
Lin, CT & Lu, YC 1996, 'A neural fuzzy system with fuzzy supervised learning', IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 26, no. 5, pp. 744-763.
View/Download from: Publisher's site
Lin, CT, Kan, MC & Chung, IF 1996, 'A neural network that learns from fuzzy data for language acquisition', INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, vol. 4, no. 6, pp. 581-603.
View/Download from: Publisher's site
Xu, G, Wang, N & Wang, J 1996, 'Determination of particle size distribution and mass concentration from the forward light flux scattered within two solid angles', Zhongguo Jiguang/Chinese Journal of Lasers, vol. 23, no. 5, pp. 432-436.
View description>>
Based on Fraunhofer diffraction theory a method was proposed to determine the size distribution as well as the absolute mass concentration of solid particles from the forward light flux scattering within two solid angles. The results of theoretical analysis and numerical simulation were given and the feasibility of this method and the prospect of its application were also indicated.
Zhou, W 1996, 'Supporting fault-tolerant and open distributed processing using RPC', Computer Communications, vol. 19, no. 6-7, pp. 528-538.
View description>>
This paper is concerned mainly with the software aspects of achieving reliable operations in an open distributed processing environment. A system for supporting fault-tolerant and cross-transport protocol distributed software development is described. The fault-tolerant technique used is a variation of the recovery blocks and the distributed computing model used is the remote procedure call (RPC) model. The system incorporates fault tolerance features and cross-transport protocol communication features into the RPC system and makes them transparent to users. A buddy is set up for a fault-tolerant server to be its alternative. When an RPC to a server fails, the system will automatically switch to the buddy to seek for an alternate service. The client, the fault-tolerant server and the buddy of the server can all use a different transport protocol. To obtain this fault tolerance and cross-protocol service, users only need to specify their requirements in a descriptive interface definition language. All the maintenance of fault tolerance and the cross-protocol communication is managed by the system in a user transparent manner. By using our system, users will have confidence in their distributed programs without bothering the fault tolerance and cross-protocol communication details. Our system is small, simple, easy to use and also has the advantage of producing server and client driver programs, and finally, executable programs directly from the server definition files.
Zhou, W & Molinari, B 1996, 'A system for managing remote procedure call transactions', Journal of Systems and Software, vol. 34, no. 2, pp. 133-149.
View/Download from: Publisher's site
View description>>
This paper describes the design and implementation of a remote procedure call (RPC) transaction manager. The structures and constructions of RPC-based systems have been widely discussed, yet how to manage the RPC transactions by using these existing structures and constructions remains unclear. We have designed a system for managing RPC transactions based on our RPC transaction model. The system is designed at first to manage single RPC transactions. It is then expanded to manage parallel RPC transactions as well. Some properties of the system are described. We also present some descriptions of the preliminary implementation of our RPC transaction manager.
Antoniou, G & Williams, MA 1996, 'Default reasoning and belief revision in the CIN project', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 691-693.
Antoniou, G, Courtney, AP, Ernsttand, J & Williams, MA 1996, 'A system for computing constrained default logic extensions', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 237-250.
View/Download from: Publisher's site
View description>>
© Springer-Verlag Berlin Heidelberg 1996. The aim of this paper is to describe the algorithmic foundations of the part of the program Exten responsible for the computation of extensions in Constrained Default Logic. Exten is a system that computes extensions for various default logics. The efficiency of the system is increased by pruning techniques for the search tree. We motivate and present these techniques, and demonstrate that they can cut down the size of the search tree significantly. Quite importantly, they complement well the recently developed stratification method. This technique has to be modified to work properly with Constrained Default Logic, and we show how this can be done. Exten supports experimentation with default logic, allowing the user to set various parameters. Also it has been designed to be open to future enhancements, which are supported by its object-oriented design. Exten is part of our long-term effort to develop an integrated toolkit for intelligent information management based on nonmonotonic reasoning and befief revision methods.
Bellé, G, Jay, CB & Moggi, E 1996, 'Functorial ML', PLILP ’96, Springer Verlag, pp. 32-46.
Jay, CB 1996, 'A fresh look at parametric polymorphism: covariant types', Nineteenth Australasian Computer Science Conference Proceedings, Melbourne, Australia, 31 January – 2 February, 1996, Australian Computer Science Communications, pp. 525-534.
Jay, CB 1996, 'Data categories', Computing: The Australasian Theory Symposium Proceedings, Melbourne, Australia, 29–30 January, 1996, Australian Computer Science Communications, pp. 21-28.
Jay, CB, Clarke, DG & Edwards, JJ 1996, 'Exploiting Shape in Parallel Programming', 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing: Proceedings, IEEE, pp. 295-302.
Jay, CB, Cole, M, Sekanina, M & Steckler, PA 1996, 'A Monadic Calculus for Parallel Costing in a Functional Language of Arrays'.
Leaney, J, Peterson, C & Drane, C 1996, 'Computer systems engineering in large groups', FRONTIERS IN EDUCATION FIE'96 - 26TH ANNUAL CONFERENCE, PROCEEDINGS, VOLS 1-3, 26th Annual conference on Frontiers in Education - Technology-Based Re-Engineering Engineering Education (FIE 96), I E E E, SALT LAKE CITY, UT, pp. 1491-1494.
Lin, CT & Juang, CF 1996, 'Adaptive neural fuzzy filter and its applications', IEEE International Conference on Fuzzy Systems, pp. 564-569.
View description>>
A new kind of nonlinear adaptive filter, the adaptive neural fuzzy filter (ANFF), based upon neural network's learning ability and fuzzy if-then rule structure is proposed in this paper. The ANFF is inherently a feedforward multilayered connectionist network which can learn by itself according to numerical training data or expert knowledge represented by fuzzy if-then rules. The adaptation here includes the construction of fuzzy if-then rules (structure learning), and the tuning of the free parameters of membership functions (parameter learning). There are no hidden nodes (i.e., no membership functions and fuzzy rules) initially, and both the structure learning and parameter learning are performed concurrently as the adaptation proceeds. Two major advantages of the ANFF are: 1) a priori knowledge can be incorporated into the ANFF which makes the fusion of numerical data and linguistic information in the filter possible; and 2) no predetermination, like the number of hidden nodes, must be given, since the ANFF can find its optimal structure and parameters automatically. To demonstrate the performance of the ANFF, two applications, the nonlinear channel equalization and the adaptive noise cancellation, are simulated.
Lin, CT, Juang, CF & Li, CP 1996, 'Temperature control with a neural fuzzy inference network', SOFT COMPUTING IN INTELLIGENT SYSTEMS AND INFORMATION PROCESSING, 1996 Asian Fuzzy Systems Symposium - Soft Computing in Intelligent Systems and Information Processing, I E E E, KENTING, TAIWAN, pp. 91-96.
Rowe, D, Leaney, J & Lowe, D 1996, 'Development of a systems architecting process for computer based systems', SECOND IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS, 2nd IEEE International Conference on Engineering of Complex Computer Systems / 6th CSESAW / 4th IEEE RTAW / SES 96, I E E E, COMPUTER SOC PRESS, MONTREAL, CANADA, pp. 200-203.
View/Download from: Publisher's site
Steeples, C, Unsworth, C, Bryson, M, Goodyear, P, Riding, P, Fowell, S, Levy, P & Duffy, C 1995, 'Technological support for teaching and learning: Computer-mediated communications in higher education (CMC in HE)', COMPUTERS & EDUCATION, Computer Assisted Learning Symposium (CAL 95), PERGAMON-ELSEVIER SCIENCE LTD, UNIV CAMBRIDGE, CAMBRIDGE, ENGLAND, pp. 71-80.
View/Download from: Publisher's site
Wang, NN & Xu, GD 1996, 'Optical on-line measurements of particulate mass concentration and particle size pollutant emission', Proceedings of the International Conference on Energy and Environment, ICEE, pp. 777-781.
View description>>
In this paper, an optical measuring technique which can be used in in-situ measurements and gives the full particle size information as well as the absolute mass concentration of pollutant emissions is presented, according to the light scattering theory. Based on the Fraunhofer diffraction theory, the information about the particle size can be obtained by measuring the forward light flux at two small solid angles, and the mass concentration from the extinction measurement. Theoretical calculations and computer simulation are made to verify the validity and applicability of the presented method. Results show that it can be used to monitor and supervise the pollutant emissions in different industrial processes.
Zhou, W 1996, 'A tool for assisting the understanding of distributed programs', ACM International Conference Proceeding Series, pp. 223-230.
View/Download from: Publisher's site
Zhou, W 1996, 'Algorithm for estimating the execution time of nested transactions on a locally distributed database system', IEEE International Conference on Algorithms and Architectures for Parallel Processing, pp. 538-545.
View description>>
This paper describes an algorithm for estimating the execution time of nested transactions running on a locally distributed database system. We first establish the model of nested transactions and the model of a locally distributed database system. Then we present a non-deterministic algorithm that can evaluate the execution time of a nested transaction using general routing strategies. The last part of the paper analyses the algorithm by presenting solutions to some special cases and the lower and upper bounds of executing time estimation.
Zhou, W 1996, 'Performance evaluation of nested transactions on locally distributed database systems', Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, pp. 353-356.
View description>>
This paper describes an execution time estimating model for nested transactions running on locally distributed database systems (LDDBSs). At first the model of nested transactions and the model of an LDDBS are established. The performance evaluation model of nested transactions is then built and some calculation and simulation results of the model are analyzed.