The key issue affecting Cognitive Diagnostic Models (CDMs) is how to specify attributes and the Q-matrix. In this paper, we first attempt to use the Boolean Matrix Factorization (BMF) method to express conjunctive models in CDMs. Because BMF is an NPhard problem [2], we propose a recursive method that updates the attribute matrix (its rank equals to one) in each step. As Boolean algebra is irre...

Recently recursive algorithm has been used in getting Fisher criterion based linear discriminants through which the features obtained are statistically uncorrelated. This paper investigates a simpler and faster approach to compute uncorrelated discriminants. This is done by first mapping the input data onto an uncorrelated feature space and computing Fisher criterion based discriminants in that...

This paper proposes a simple method for estimating the position of a robot from relatively few sensor readings. Our algorithms are intended for applications where sensor readings are expensive or otherwise limited and the readings that are taken are subject to considerable errors or noise. Our method is capable of converging to a position estimate with greater accuracy using fewer measurements ...

Recently, a new eigenvalue problem, called the transmission eigenvalue problem, has attracted many researchers. The problem arose in inverse scattering theory for inhomogeneous media and has important applications in a variety of inverse problems for target identification and nondestructive testing. The problem is numerically challenging because it is non-selfadjoint and nonlinear. In this pape...

In this paper we present an implementation of the well known “fast multipole” method for the efficient calculation of dipole fields, that uses polynomials in the Cartesian coordinates rather than spherical harmonics. This has considerable efficiency and simplicity advantages. We have implemented it in the context of an arbitrary hierarchical system of cells – no periodic mesh is required. The i...

the computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. it is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of new-ton's method, but previous researchers have mentioned that some...

Constructive type theory is a very expressive programming language. However, general recursive algorithms have no direct formalisation in type theory since they contain recursive calls that do not satisfy any syntactic condition that guarantees termination. We present a method to formalise general recursive algorithms in type theory that uses an inductive predicate to characterise termination a...