Background The original MDS(X) Project was funded (1974-1982) by the U.K. Social g m Library Unit of the University of Edinburgh. It grew out of the frustration of a research ma was produce a utility for producing measures from raw data for input into (any) multidimensional form ion d As tp://www.mimas.ac.uk/]. Until recently its main use has been on PCs erating under MD-DOS. This manual descri...

In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.

In the preceding chapter a taxonomy of pr oblem types was proposed, and some hypotheses set forth about the general kin ds of skills and knowledge needed to solve problems of each type.. The p resent chapter, adopting the same information-processing point of view as the previous one, undertakes three tasks. The first part of the chapter sets forth th e general theory of human problem Solving th...

a necessary and sufficient condition in terms of lower cut sets are given for the insertion of a $gamma-$continuous function between two comparable real-valued functions.

let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.