We present evidence for a novel relational luring effect (RLE) in recognition memory. Participants performed a continuous associative recognition task in which they had to discriminate between new, old and recombined word pairs. Participants made more false alarms and responded more slowly to lures (TABLE CLOTH) that were relationally similar to studied pairs (FLOOR CARPET). RTs and false alarm...

In this paper we consider the following problems: how many different subsets of Σ can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such subsets are represented by words of length t? For the first problem, we give upper and lower bounds of the form α 2 n in the binary case. For the second problem, we giv...

The CDF and D0 collaborations at Fermilab’s Tevatron pp̄ collider have in place an extensive program to measure fundamental properties of the top quark. Recent results from Run I ( √ s = 1.8 TeV) and Run II ( √ s = 1.96 TeV) on the top quark’s production, mass, and decays are presented here. All results are consistent within their uncertainties with the Standard Model expectations for the top qu...

We present two variations of Duval’s algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for strings containing runs of the smallest character in the alphabet. Experimental results show that it is faster than Duval’s original algorithm, more than ten...

Observations are generated according to a regression with normal error as a function of time, when the process is in control. The process potentially changes at some unknown point of time and then the ensuing observations are normal with the same mean function plus an arbitrary function under suitable regularity conditions. The problem is to obtain a stopping rule that is optimal in the sense t...

In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n′ + m′ + mn′ + nm′ +mn) where n and m are the lengths of the maps and n′ and m′ are the sizes of run-length encoded maps. We show that this algorithm makes a significant improvement for the real biological data, dividing the computing time by a factor 30 on a significant set of data.

A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length n. A number of associated problems have also been investigated. In this paper we consider a ne...

Extracting a block of interest referred to as segmenting a specified block in an image and studying its characteristics is of general research interest, and could be a challenging if such a segmentation task has to be carried out directly in a compressed image. This is the objective of the present research work. The proposal is to evolve a method which would segment and extract a specified bloc...

The objective of this paper is to present explicit analytical formulas for evaluating important characteristics of Double Moving Average control chart (DMA) for Poisson distribution. The most popular characteristics of a control chart are Average Run Length ( 0 ARL ) the mean of observations that are taken before a system is signaled to be out-of control when it is actually still incontrol, and...

sever& texture features are introduced from a proposed higher-order statistical matrix, the gray level gap length matrix (GLGLM). The GLGLM measures the gray level variations in an image. It complements the gray level run length matrix (GLRLM) and is more superior when the number of gray level is large. Features extracted from the weighted GLGLM can be used to estimate the size distribution of ...