Wanlin Pang, Robert J. Hilderman, Howard J. Hamilton, and Scott D. Goodwin Department of Computer Science University of Regina Regina, Saskatchewan, Canada, S4S 0A2 fpang,hilder,hamilton,[email protected] Abstract We present the Path-Based Generalization and Bias-Based Generalization algorithms for attribute-oriented induction using concept generalization digraphs. Concept generalization d...

The dominating graph of a H has as its vertices all sets H, with an edge between two if one can be obtained from the other by addition or deletion single vertex H. In this paper we prove that any tree Hamilton path. We also show how result about binary strings leads to proof cycle on n path and only is not multiple 4.

This paper interrelates the performance criteria involving path independent curvilinear integrals, the multitime maximum principle, the multitime Hamilton-Jacobi-Bellman PDEs and the multitime dynamic programming, to study the linear-quadratic regulator problems and to characterize the optimal control by means of multitime variant of the Riccati PDE that may be viewed as a feedback law. Section...

An ordinary unambiguous integral representation for the finite propagator of a quantum system is obtained by path integrating in phase space. The skeletonization of the canonical action by means of pieces described by a complete solution of the Hamilton-Jacobi equation leads to a simple composition law that reduces the multiple integration to a sole one. Thus the finite quantum propagator can b...

A Gray code is a Hamilton path H on the n-cube, Q n. By labeling each edge of Q n with the dimension that changes between its incident vertices, a Gray code can be thought of as a sequence H = t 1 ; t 2 ; : : : ; t N-1 (with N = 2 n and each t i satisfying 1 t i n). The sequence H deenes an (undirected) graph of transitions, G H , whose vertex set is f1; 2; : : : ; ng and whose edge set E(G H) ...

In this paper, we consider the two-player state and control path-dependent stochastic zero-sum differential game. our problem setup, process, which is controlled by players, dependent on (current past) paths of processes players. Furthermore, running cost objective functional depends both We use notion non-anticipative strategies to define lower upper value functionals game, where unlike existi...

Previously the authors characterized the 3-connected graphs with a Hamilton path containing only two contractible edges. In this paper we extend this result by showing that if a 3-connected graph has a diameter containing only two contractible edges, then that diameter is a Hamilton path. INTRODUCTION AND TERMINOLOGY All graphs in this paper are finite, undirected and simple. Let G be a 3-conne...