In this paper, an FIR filter design based on total least squares error criterion is investigated. The filter coefficients are obtained from the elements of the eigenvector corresponding to minimum eigenvalue of a real, symmetric and positive definite matrix. This design is not only optimal in total least squares error sense, it is also easy to incorporate linear constraints in time and frequenc...

The aim of this paper is to present modified neural network algorithms to predict whether it is best to buy, hold, or sell shares trading signals of stock market indices. Most commonly used classification techniques are not successful in predicting trading signals when the distribution of the actual trading signals, among these three classes, is imbalanced. The modified network algorithms are b...

For the past two decades, the discussion regarding the effect of ICT on health systems is becoming apparent. However, past studies have mainly focused on ICT impact on specific social-economic phenomena. Little empirical research on ICT and health systems exists. Many African countries have invested in ICT and there is a need to examine if such investments have impacted on health system of thes...

Suppose that the matrix equation AXB = C with unknown matrix X is given, where A, B, and C are known matrices of suitable sizes. The matrix nearness problem is considered over the general and least squares solutions of the matrix equation AXB = C when the equation is consistent and inconsistent, respectively. The implicit form of the best approximate solutions of the problems over the set of sy...

A square-root-free matrix QR decomposition (QRD) scheme was rederived in [1] based on [2] to simplify computations when solving least-squares (LS) problems on embedded systems. The scheme of [1] aims at eliminating both the square-root and division operations in the QRD normalization and backward substitution steps in the LS computations. It is claimed in [1] that the LS solution only requires ...

In this paper we discuss the problem of recovering the vertices of a planar polygon from its measured complex moments. Because the given, measured moments can be noisy, the recovered vertices are only estimates of the true ones. The literature offers many algorithms for solving such an estimation problem. We will restrict our discussion to the Total Least Squares (TLS) data fitting models HTLS ...

A robust filter is designed for uncertain discrete time models. The filter is based on a regularized solution and guarantees minimum state error variance. Simulation results confirm its superior performance over other robust filter designs. keywords: regularization, least-squares, robust filter, regularization parameter, parametric uncertainty.

Let G be a graph. We denote p(G) and c(G) the order of a longest path and the order of a longest cycle of G, respectively. Let κ(G) be the connectivity of G, and let σ3(G) be the minimum degree sum of an independent set of three vertices in G. In this paper, we prove that if G is a 2-connected graph with p(G) − c(G) ≥ 2, then either (i) c(G) ≥ σ3(G) − 3 or (ii) κ(G) = 2 and p(G) ≥ σ3(G)− 1. Thi...

A sequence of first–order integer–valued autoregressive type (INAR(1)) processes is investigated, where the autoregressive type coefficients converge to 1. It is shown that the limiting distribution of the joint conditional least squares estimators for this coefficient and for the mean of the innovation is normal. Consequences for sequences of Galton–Watson branching processes with unobservable...