A network of spinal neurons known as central pattern generator (CPG) produces the rhythmic motor patterns required for coordinated swimming, walking, and running in mammals. Because the output of this network varies with time, its analysis cannot be performed by statistical methods that assume data stationarity. The present work uses short-time Fourier (STFT) and wavelet-transform (WT) algorith...

We propose the following computational assumption: in general if we try to compress the depth of a circuit family (parallel time) more than a constant factor we will suffer super-quasipolynomial blowup in the size (number of processors). This assumption is only slightly stronger than the popular assumption about the robustness of NC, and we observe that it has surprising consequences. Note also...

In this paper we present our results in adapting a Spiking Neural P system (SNP system) simulator to a high performance graphics processing unit (GPU) platform. In particular, we extend our simulations to larger and more complex SNP systems using an NVIDIA Tesla C1060 GPU. The C1060 is manufactured for high performance computing and massively parallel computations, matching the maximally parall...

We show that over any field, the solution set to a system of n linear equations in n unknowns can be computed in parallel with randomization simultaneously in poly-logarithmic time in n and with only as many processors as are utilized to multiply two n×n matrices. A time unit represents an arithmetic operation in the field. For singular systems our parallel timings are asymptotically as fast as...

The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, few parallel algorithms are known for these networks. In this paper, we present several data communication schemes and basic algorithms for these two networks. These algorithms are then used to develop parallel solutions to var...

A formula is read-once if each variable appears at most once in it. An arithmetic read-once formula is one in which the operations are addition, subtraction, multiplication, and division (and constants are allowed). We present a randomized (Las Vegas) parallel algorithm for the exact interpolation of arithmetic read-once formulas over suuciently large elds. More speciically, for n-variable read...

A constraint network is arc consistent if any value of any of its variables is compatible with at least one value of any other variable. The Arc Consistency Problem (ACP) consists in ltering out values of the variables of a given network to obtain one that is arc consistent, without eliminating any solution. ACP is known to be inherently sequential, or P-complete, so in this paper we examine so...