We determine and characterise relative equilibria for arrays of point vortices in a three-dimensional quasi-geostrophic flow. The are equally spaced along two horizontal rings whose centre lies on the same vertical axis. An additional vortex may be placed this Depending parameters defining array, equal or opposite sign. address linear stability arrays. find both stable unstable equilibria, depe...

The array factor (sidelobe level, SLL) of a linear array is optimized using modified continuous genetic algorithms in this work. The amplitudes and phases of the currents as well as the separation of the antennas are all taken as variables to be controlled. The results of the design using modified GA versions are compared with other methods. Two design problems were studied using several contin...

This correspondence improves and extends bounds on the numbers of sensors, redundancies, and holes for sparse linear arrays to sparse planar and volume arrays. As an application, the efficiency of regular planar and volume arrays with redundancies but no holes is deduced. Also, examples of new redundancy and hole square arrays, found by exhaustive computer search, are given.

Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...

When applied to array processing, the Pisarenko harmonic decomposition (PHD) method is limited to linear equispaced arrays. We present an approach that allows us to extend it to general arrays, although for the ease of exposition, we consider only sparse linear arrays. We exploit the fact that the PHD can be seen as a deconvolution or model-fitting approach that minimizes an `1 norm and can thu...

For a large number N of data points, linear FFF arrays consisting of | 2 N) processors provide significant economy in hardware. In this paper we discuss the radix-2 decimation-in-frequency Cooley-Tukey algorithm implemented on linear arrays, thereby allowing a continuous real-time application using a word-serial input data stream to the linear arrays. In order to avoid memory access and data pa...

Iowa State University 1.1 Basic Definitions and Properties . . . . . . . . . . . . . . . . . . . . 1-1 1.2 Linear Time Construction Algorithms . . . . . . . . . . . . . 1-4 Suffix Trees vs. Suffix Arrays • Linear Time Construction of Suffix Trees • Linear Time Construction of Suffix Arrays • Space Issues 1.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

This paper addresses the problem of computing transitive closure of a given directed graph on linear systolic arrays (SA). We have designed three linear SAs, including two static SAs and a bi-directional SA. Then we compare obtained arrays in term of execution time, number of processing elements and efficiency.

The evolution of linear arrays of rigid spheres and deformable drops in a Poiseuille flow between parallel walls is investigated to determine the effect of particle deformation on the collective dynamics in confined particulate flows.Wefind that linear arrays of rigid spheres aligned in the flowdirection exhibit a particlepairing instability and are unstable to lateral perturbations. Linear arr...

In this study, Salmonella Typhimurium bacteria removal from polluted water has been investigated using multiwall carbon nanotubes arrays. Experimental results reveal that the contact time, the bacterial concentration and the weight of multiwall carbon nanotubes arrays have positive significant effects on the bacteria removal efficiency. Increasing the contact time and the weight of multiwall ca...