We will now consider the problem of creating a set of bitstrings such that the bits are almost k-wise independent. Our method consists of two steps. In the first step we create a set of bitstrings such that parity on every fixed index set is almost even. In the second step we present a method to convert such a set into a set where the bits are almost k-wise independent. For presentational reaso...

We present the numerical method for solution of some linear and non-linear parabolic equation. Using idea [1], we will present the explicit unconditional stable scheme which has no restriction on the step size ratio k/h2 where k and h are step sizes for space and time respectively. We will also present numerical results to justify the present scheme.

In this paper we propose a Modiied Block Newton Method for approximating an invariant subspace S and the corresponding eigenvalues of a symmetric matrix A. The method generates a sequence of matrices Z (k) which span subspaces S k approximating S. The matrices Z (k) are calculated via a Newton step applied to a special formulation of the block eigenvalue problem for the matrix A, followed by a ...

This paper treats the problem of approximating an nth order continuous system by a system of order k < n. Optimal solutions minimizing the H1 norm exist for k = 0; n ? 1. This paper presents an iterative two-step LMI method for improving the H1 model error compared to Hankel norm reduction. As an intermediate step, the algorithm nds a generalized balanced realization such that the n ?k Hankel s...

In 1996 Freeborough proposed a method for estimating target registration error (TRE) in the absence of ground truth. In his approach, a circuit of registrations is performed using the same registration method on multiple views of the same object: 1 to 2, 2 to 3, ..., NC –1 to NC , and NC to 1 where NC is at least three and the last registration completes the circuit. Any difference between the ...

This report describes three case studies of the testing of continuous modelling software. Where possible, the testing has been conducted by following the methodology outlined in the SSfM report " Testing Continuous Modelling Software " [1]. Where following this methodology has not been possible, the advice on alternative testing methods in the report [1] has been employed. The problems studied ...

This paper introduces an iterative method to estimate the cointegrating vectors in the error correction models. The method provides the asymptotically efficient estimators for the cointegrating vectors if iterated once or more. If it is iterated until convergence, we may obtain the maximum likelihood estimator by Johansen. For all values of 1 ≤ k ≤ ∞, the k-step iterative estimators are asympto...