This paper describes Multiple Interactive Outputs in a Single Tree (MIOST), a new form of Genetic Programming (GP). Our approach is based on two ideas. Firstly, we have taken inspiration from graph-GP representations. With this idea we decided to explore the possibility of representing programs as graphs with oriented links. Secondly, our individuals could have more than one output. This idea w...

ii We certify that we have read this thesis and that, in our opinion, it is satisfactory in scope and quality as a thesis for the degree of Master of Science in Information and Computer Sciences.

Aiming to solve the problem of crop yield forecasting and accurate fertilization, this paper presents a method based on optimized design ideas about fertilization decision-making. The algorithm is based on a variety of fertilizer function fittings, and weighting optimal solutions to obtain the fertilizing amount. The algorithm in this paper which uses the interpolation algorithm improves the ra...

In this paper a tool is presented for the development of numerical libraries for an object-oriented environment. The development of libraries has become more complicated as libraries have become larger and the subroutines have become more complex. In the object{oriented environment this development is further complicated by the object interface which usually resides between the application and ...

This paper presents an on-going research work on the implementation of feature-based machining via macro programming. Repetitive machining features such as holes, slots, pockets etc can readily be encapsulated in macros. Each macro consists of methods on how to machine the shape as defined by the feature. The macro programming technique comprises of a main program and subprograms. The main prog...

In this paper an extension of narrowing-based functional logic languages is proposed: Every partial deenition of a function can be completed with a default rule. In a concrete function call, the default rule is applicable when the normal ones determine that they cannot compute the value of the call. The use of the default rule, in the presence of a goal with variables, is constructive. The oper...

Computer codes are developed to calculate Clebsch–Gordan coefficients of SU(3) in both SU(2)and SO(3)-coupled bases. The efficiency of this code derives from the use of vector coherent state theory to evaluate the required coefficients directly without recursion relations. The approach extends to other compact semi-simple Lie groups. The codes are given in subroutine form so that users can inco...

In this paper we examine how an executable logic speciication can be obtained from COBOL programs via reverse engineering, which is semantically equivalent to the original source. For this purpose we deene a speciication language COPRA and show how various imperative constructs, such as GOTOs and subroutine calls, can be handled in this language. This speciication is generated automatically and...

For linear systems of equations arising from circuit simulation, we studied the efficiency of the reordering algorithm integrated in the MA27 subroutine package from Duff and Reid. Our conclusion is that the algorithm performs extraordinarily well, provided that the nearly-dense rows and columns of the matrix have been removed prior to reordering. Thus, we recommend the reordering implementatio...