Suppose G = (V,E) is a simple graph and k is a fixed positive integer. A vertex z k-neighborhood-covers an edge (x, y) if d(z, x) ≤ k and d(z, y) ≤ k. A k-neighborhoodcovering set is a set C of vertices such that every edge in E is k-neighborhood-covered by some vertex in C. A k-neighborhood-independent set is a set of edges in which no two distinct edges can be k-neighborhood-covered by the sa...

This paper describes a method for recognizing real three-dimensional objects in non-controlled backgrounds using independent component analysis to eliminate redundant image information present in each object image. The proposed method is a two-step process that allows a coarse color-based detection and an exact localization using shape information. The paper describes an efficient implementatio...

Given a graph G and a positive integer k, denote by G[k] the graph obtained from G by replacing each vertex of G with an independent set of size k. A graph G is called pseudo-k Hamiltonian-connected if G[k] is Hamiltonian-connected, i.e., every two distinct vertices of G[k] are connected by a Hamiltonian path. A graph G is called pseudo Hamiltonian-connected if it is pseudo-k Hamiltonian-connec...

Derandomization of Chernoff bound with union bound is already proven in many papers. We here give another explicit version of it that obtains a construction of size that is arbitrary close to the probabilistic nonconstructive size. We apply this to give a new simple polynomial time constructions of almost k-wise independent sets. We also give almost tight lower bounds for the size of k-wise ind...

We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate categorical independence ratio is computable in polynomial time for cographs.

For xed integers k 3 and hypergraphs G on N vertices, which contain edges of cardinalities at most k, and are uncrowded, i.e., do not contain cycles of lengths 2; 3, or 4, and with average degree for the i-element edges bounded by O(T i 1 (lnT )(k i)=(k 1)), i = 3; : : : ; k, for some number T 1, we show that the independence number (G) satis es (G) = ((N=T ) (lnT )1=(k 1)). Moreover, an indepe...

Teleoperation system performances suffer from the delays in the communications line. These delays are usually variable time delays. The customary wave variable technique used for constant time delays cannot provide satisfactory results to stabilize the system under variable delays. Another problem occurs in the position tracking performance of the limitedworkspace teleoperation systems. Althoug...

We present a computationally tractable approach to dynamically measure statistical dependencies in multivariate non-Gaussian signals. The approach makes use of extensions of independent component analysis to calculate information coupling, as a proxy measure for mutual information, between multiple signals and can be used to estimate uncertainty associated with the information coupling measure ...

Shadowing has become a well-known method to improve learners’ overall proficiency. Our previous studies realized automatic scoring of shadowing speech using HMM phoneme posteriors, called GOP (Goodness of Pronunciation) and learners’ TOEIC scores were predicted adequately. In this study, we enhance our studies from multiple angles: 1) a much larger amount of shadowing speech is collected, 2) ma...

One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 logn-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 logn. The explicit construction of such a graph is a major open problem. We show that a reasonable hardness assumption implies that in polynomial time one can construct a list containing pol...