A new, efficient algorithm for blind separation of uniformly distributed sources is proposed. The mixing matrix is assumed to be orthogonal by prewhitening the observed signals. The learning rule adaptively estimates the mixing matrix by conceptually rotating a unit hypercube so that all output signal components are contained within or on the hypercube. Under some ideal constraints, it has been...

A sum of real numbers equals the mutual entropy of a fuzzy set and its complement set. A " fuzzy " or multivalued set is a point in a unit hypercube. Fuzzy mutual (Kullback) entropy arises from the logarithm of a unique measure of fuzziness. The proof uses the logistic map, a diffeomorphism that maps extended real space onto the fuzzy cube embedded in it. The logistic map equates the sum of a v...

In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2,...,7. 200...

We study statistical tests of uniformity based on the Lp-distances between the m nearest pairs of points, for n points generated uniformly over the k-dimensional unit hypercube or unit torus. The number of distinct pairs at distance no more than t, for t Ä 0, is a stochastic process whose initial part, after an appropriate transformation and as n 3 `, is asymptotically a Poisson process with un...

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...

Emergency response services are critical for modern societies. This paper presents a model and a heuristic solution for the optimal deployment of many emergency response units in an urban transportation network and an application for transit mobile repair units (TMRU) in the city of Athens, Greece. The model considers the stochastic nature of such services, suggesting that a unit may be already...

We resolve a long-standing conjecture of Wilson (Ann. Appl. Probab. 14 (2004) 274–325), reiterated by Oliveira (2016), asserting that the mixing time interchange process with unit edge rates on n-dimensional hypercube is order n. This follows from sharp inequality established at level Dirichlet forms, which we also deduce macroscopic cycles emerge in constant time, and log-Sobolev exclusion 1. ...

An acyclic USO on a hypercube is formed by directing its edges in such as way that the digraph is acyclic and each face of the hypercube has a unique sink and a unique source. A path to the global sink of an acyclic USO can be modeled as pivoting in a unit hypercube of the same dimension with an abstract objective function, and vice versa. In such a way, Zadeh’s ’least entered rule’ and other h...