The number of objects that can be maintained in visual working memory without interference is limited. We present simulations of a model of visual working memory in ventral prefrontal cortex that has this constraint as well. One layer in ventral PFC represents all objects in memory. These representations are used to bind the features of the objects. If there are too many objects, their represen...

Let L be chosen uniformly at random from among the latin squares of order n ≥ 4 and let r, s be arbitrary distinct rows of L. We study the distribution of σr,s, the permutation of the symbols of L which maps r to s. We show that for any constant c > 0, the following events hold with probability 1− o(1) as n → ∞: (i) σr,s has more than (log n)1−c cycles, (ii) σr,s has fewer than 9√n cycles, (iii...

The number of objects that can be maintained in visual working memory without interference is limited. We present simulations of a model of visual working memory in ventral prefrontal cortex that has this constraint as well. One layer in ventral PFC constitutes a ’blackboard’ representation of all objects in memory. These representations are used to bind the features (shape, color, location) of...

In most current feature modelling systems, blends are modelled as a kind of features too. These systems use a boundary representation (Brep) to describe the shape of a product. It is shown that the practice of basing specification of blends on conventional Breps is ineffective. A solution to this problem is introduced in which blends are described at a higher level. Blends are defined in a feat...

In traditional text classification, a classifier is built using labeled training documents of every class. This paper studies a different problem. Given a set P of documents of a particular class (called positive class) and a set U of unlabeled documents that contains documents from class P and also other types of documents (called negative class documents), we want to build a classifier to cla...

The classification of structurable tori with nontrivial involution, which was begun by Allison and Yoshii, is completed. New examples of struct-urable tori are obtained using a construction of structurable algebras from a semilinear version of cubic forms satisfying the adjoint identity. The classification uses techniques borrowed from quadratic forms over Z 2 and from the geometry of generaliz...

Tree structures are a natural way of describing occurrence relationships between attributes in a dataset. We define a new class of tree patterns for unordered 0–1 data and consider the problem of discovering frequently occurring members of this pattern class. Intuitively, a tree T occurs in a row u of the data, if the attributes of T that occur in u form a subtree of T containing the root. We s...

In this paper, we solve a problem posed by the late Rodica Simion regarding type B Gram determinants, cf. [5]. We present this in a fashion influenced by the work of W.B.R.Lickorish on Witten-Reshetikhin-Turaev invariants of 3-manifolds. We will give a history of this problem in a sequel paper in which we also plan to address other related questions by Simion [6, 5] and connect the problem to F...

Buildings require both for construction and due, to their comparatively long life cycle for maintenance, significant raw material and energy resources. So far available knowledge about resource consumption during an entire life cycle of a building is still quite rare, because various criteria affect each other and/or overlay mutually. In this thesis work a software concept is presented using an...