A useful and flexible method based on the tabu search algorithm for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling both the phase and the position of each array element. To show the versatility of the present

Abstract—In this paper, a methodbasedon clonal selection algorithm (CLONALG) is proposedfor null steering of linear antenna arrays by controlling only the positions of selectedelements. The CLONALG is a relatively novel population-basedevolutionary algorithm inspiredby the clonal selection

sample variances towards a pooled estimate, resulting in far more stable inference when the number of arrays is small. The use of moderated t-statistics has the advantage over the posterior odds that the number of hyperparameters which need to estimated is reduced; in particular, knowledge of the non-null

be developed to sort out whether cancer tissues have distinctive signatures of gene expression over normal tissues or other types of cancer tissues. In this paper, we address the problem of selection of a small subset of genes from broad patterns of gene expression data, recorded on DNA micro-arrays. Using

next. To increase parallelism, several authors have suggested ways of predicting the direction of conditional branches with hardware that uses the history of previous branches. The different proposed predictors take advan-tage of different observed patterns in branch behavior. This paper presents a

Given a program written in a simple imperative language (assignment statements, for loops, affine indices and loop limits), this paper presents an algorithm for analyzing the patterns along which values flow as the execution proceeds. For each array or scalar reference, the result is the name

. The text T can be represented in n lg |Σ | bits by encoding each symbol with lg |Σ | bits. The goal is to support fast online queries for searching any string pattern P of m symbols, with T being fully scanned only once, namely, when the index is created at preprocessing time. The text indexing schemes

Participants searched for discrepant fear-relevant pictures (snakes or spiders) in grid-pattern arrays of fear-irrelevant pictures belonging to the same category (flowers or mushrooms) and vice versa. Fear-relevant pictures were found more quickly than fear-irrelevant ones. Fear

We present a novel implementation of compressed suffix arrays exhibiting new tradeoffs between search time and space occupancy for a given text (or sequence) of n symbols over an alphabet Σ, where each symbol is encoded by lg |Σ | bits. We show that compressed suffix arrays use just nHh + O(n lg lg

Configuring redundant disk arrays is a black art. To configure an array properly, a system administrator must understand the details of both the array and the workload it will support. Incorrect understanding of either, or changes in the workload over time, can lead to poor performance. We present