Celite corporation and Andersen Consulting have developed an advanced approach to traditional software development called the application software factory (ASF)." The approach is an integration of technology and total quality "management" techniques that includes the use of an expert system to guide module design and perform "module programming." The expert system component is called the knowledge-based design assistant and its inclusion in the ASF methodology" has significantly reduced module development time, training time, and module and communication errors.

PITCH EXPERT was developed to make expertise available to mill-site engineers to solve pitch problems in kraft pulp mills. These problems have been estimated to cause losses to the Canadian pulp and paper industry in excess of $80 million each year. The design of the system took into account not only the complexity of the process interactions and the need for accuracy and completeness of recommendations but also the ongoing need for training mill personnel and the requirement that the system be maintainable and expandable without the constant involvement of the developers. PITCH EXPERT is now accessible by modem, and the savings achieved through use of the system covered the development costs within six months of release.

The Association for the Advancement of Artificial Intelligence held its 1992 Fall Symposium Series on October 23-25 at the Royal Sonesta Hotel in Cambridge, Massachusetts. This article contains summaries of the five symposia that were conducted: Applications of AI to Real-World Autonomous Mobile Robots, Design from Physical Principles, Intelligent Scientific Computation, Issues in Description Logics: Users Meet Developers, and Probabilistic Approaches to Natural Language.

The first Robotics Exhibition and Competition sponsored by the Association for the Advancement of Artificial Intelligence was held in San Jose, California, on 14-16 July 1992 in conjunction with the Tenth National Conference on AI. This article describes the history behind the competition, the preparations leading to the competition, the threedays during which 12 teams competed in the three events making up the competition, and the prospects for other such competitions in the future.

Two projection based feedforward network learning methods for modelfree regressionproblems are studied and compared in this paper: one is the popular back-propagation learning (BPL); the other is the projection pursuit learning (PPL).

Because of the complexity of the application and the large amount of data, the problem cannot be solved by using a single method. The solution we propose is to build multimodules NNarchitectures where several NN cooperate together. Such system suffer from generic problem for whom we propose solutions. They allow to reach accurate performances for multi-valued function approximations and probability estimations. The results are compared with six other methods which have been used for this problem. We show that the methodology we have developed is general and can be used for a large variety of applications.

Because of the complexity of the application and the large amount of data, the problem cannot be solved by using a single method. The solution we propose is to build multimodules NN architectures where several NN cooperate together. Such system suffer from generic problem for whom we propose solutions. They allow to reach accurate performances for multi-valued function approximations and probability estimations. The results are compared with six other methods which have been used for this problem. We show that the methodology we have developed is general and can be used for a large variety of applications.

Two projection based feedforward network learning methods for modelfree regression problems are studied and compared in this paper: one is the popular back-propagation learning (BPL); the other is the projection pursuit learning (PPL).

There exist large classes of time series, such as those with nonlinear moving average components, that are not well modeled by feedforward networks or linear models, but can be modeled by recurrent networks. We show that recurrent neural networks are a type of nonlinear autoregressive-moving average (N ARMA) model. Practical ability will be shown in the results of a competition sponsored by the Puget Sound Power and Light Company, where the recurrent networks gave the best performance on electric load forecasting. 1 Introduction This paper will concentrate on identifying types of time series for which a recurrent network provides a significantly better model, and corresponding prediction, than a feedforward network. Our main interest is in discrete time series that are parsimoniously modeled by a simple recurrent network, but for which, a feedforward neural network is highly non-parsimonious by virtue of requiring an infinite amount of past observations as input to achieve the same accuracy in prediction. Our approach is to consider predictive neural networks as stochastic models.

There exist large classes of time series, such as those with nonlinear moving average components, that are not well modeled by feedforward networks or linear models, but can be modeled by recurrent networks. We show that recurrent neural networks are a type of nonlinear autoregressive-moving average (N ARMA) model. Practical ability will be shown in the results of a competition sponsored by the Puget Sound Power and Light Company, where the recurrent networks gave the best performance on electric load forecasting. 1 Introduction This paper will concentrate on identifying types of time series for which a recurrent network provides a significantly better model, and corresponding prediction, than a feedforward network. Our main interest is in discrete time series that are parsimoniously modeledby a simple recurrent network, but for which, a feedforward neural network is highly non-parsimonious by virtue of requiring an infinite amount of past observations as input to achieve the same accuracy in prediction. Our approach is to consider predictive neural networks as stochastic models.