Explored the use of additive tree models to represent set-symmetric distances for feature arrangements in set-theoretic or feature models. Studied arrangements of feature sets that have been proposed to represent qualitative and quantitative variation among objects in situations in which feature structures are defined in various ways. (SLD)

This paper provides operational semantics for imperative programming languages that legitimize the phraseology used in the statement and proof of a fundamental theorem of program correctness. Some of the phrases used in the theorem are normally undefined, but intuitively appealing. This paper attempts to give precise meaning to the questionable…

Examines basic issues of data mining using the theory of rough sets, a recent proposal for generalizing classical set theory. Demonstrates that a generalized rough set model can be used for generating rules from incomplete databases. Discusses the importance of rule extraction from incomplete databases in data mining. (AEF)

Two algorithms that automatically select subsets of variables (PACE algorithm) and reference variables (Fabin estimators), respectively, used for the noniterative estimators are presented. The PACE algorithm is based on a nonsymmetric matrix sweep operator. A Monte Carlo experiment compares the relative performance of these estimators and others.…

Effects of Advance Organizer (AO) lessons presenting high-order math concepts relating to set building, matching and between sets, and counting objects within sets were evaluated for rural preschoolers in comparison to traditional instruction. A pre-test/post-test assessment indicated a significant sequential transfer effect from the AO lessons.…