This paper presents an algorithm for incremental induction of decision trees that is able to handle both numeric and symbolic variables. In order to handle numeric variables, a new tree revision operator called`slewing' is introduced. Finally, a non-incremental method is given for nding a decision tree based on a direct metric of a candidate tree.

We introduce a novel method called constant encoding, which can be used to tamper-proof a software watermark that is embedded in the dynamic data structures of a program. Our novel tamperproofing method is based on transforming numeric or non-numeric constant values in the text of the watermarked program into function calls whose value depends on the watermark data structure. Under reasonable a...

This paper researches the accuracy of the Differential Transformation Method (DTM) for solving the Holling Tanner models which are described as two-dimensional system of ODES with quadratic and rational nonlinearities. Numerical results are compared to those obtained by the fourth-order Runge-Kutta method to illustrate the preciseness and effectiveness of the proposed method. The direct symboli...

Genetic programming suffers difficulty in discovering useful numeric constants for the terminal nodes of its sexpression trees. In earlier work we postulated a solution to this problem called numeric mutation. Here, we provide empirical evidence to demonstrate that this method provides a statistically significant improvement in GP system performance on a variety of problems.