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...

The electrocatalytic oxidation of captopril (CAP) was studied by modified carbon nanotubes paste electrode in the presence of isoproterenol (ISPT) using cyclic voltammetry (CV), chronoamperometry and square wave voltammetry (SWV). Also, the values of catalytic rate constant (k), and electron transfer coefficient (α) for CAP were calculated. The mechanism of CA electrochemical behavior at the mo...

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 study, undoped zno and doped with fe and mn nanostructures were synthesized by hydrothermal method. the morphology of nanostructures was characterized by scanning electron microscope. the electrochemical response of the carbon paste electrode modified with nanoparticles of zno and also zno doped with fe and mn toward levodopa (l-dopa) was studied. studies of cyclic voltammetry using pro...

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...

A simple signaling method for multi-antenna broadcast channel is proposed. In the proposed method, for each user, a direction in which that user has the maximum gain is determined. The base station selects the best user in terms of the larger maximum gain, and allocates the corresponding direction to that user. In each step, the maximization is performed in the null space of the former selected...