Large data sets are different and new methods of display are needed for dealing with them. This paper reviews the standard problems in displaying large numbers of cases and variables, both continuous and categorical, and emphasises the need for improving current software. Much could be achieved by adding interactive tools to standard displays to provide greater flexibility and to facilitate a m...

learned many things in the last several years that have helped me in several areas of this thesis. Along with the faculty, I would like to thank the office staff who do much in the department that is unseen, and have certainly done much for me personally. I would also like to thank Phil Romig for teaching me too many things to mention. Also, I would like to thank the members of my committee, Pr...

In recent years computer hardware and software has improved to such an extent that it is common to fit large numbers of models, either to ensure the ”best” is found or to combine the results from all of them. However, standard software is usually designed for fitting single models, perhaps including some residual analysis and model refinement, but not for analysing many models. Fitting large nu...

Data fitting is a fundamental tool in scientific research and engineering applications. Generally, there are two ingredients in solving data fitting problems. One is the fitting representation, and the other is the fitting method. Nowadays, the fitting of larger and larger quantities of data sets requires more compact fitting representation and faster fitting methods. The T-spline is a recently...

This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...

We provide an extension of the notion of chain-valued frame introduced by Pultr and Rodabaugh in [Category theoretic aspects of chain-valued frames: parts I and II, Fuzzy Sets and Systems 159 (2008) 501–528 and 529–558] by relaxing the assumption that L be a complete chain. As a result of this investigation we formulate the category L-Frm of L-frames under the weaker assumption that L is a comp...