Grabbing Your Attention: The Impact of Finding a First Target in Multiple-Target Search

For over 50 years, the Satisfaction of Search effect, and more recently known as the Subsequent Search Miss (SSM) effect, has plagued the field of radiology. Defined as a decrease in additional target accuracy after detecting a prior target in a visual search, SSM errors are known to underlie both real-world search errors (e.g., a radiologist is more likely to miss a tumor if a different tumor was previously detected) and more simplified, lab-based search errors (e.g., an observer is more likely to miss a target ‘T’ if a different target ‘T’ was previously detected). Unfortunately, little was known about this phenomenon’s cognitive underpinnings and SSM errors have proven difficult to eliminate. However, more recently, experimental research has provided evidence for three different theories of SSM errors: the Satisfaction account, the Perceptual Set account, and the Resource Depletion account. A series of studies examined performance in a multiple-target visual search and aimed to provide support for the Resource Depletion account—a first target consumes cognitive resources leaving less available to process additional targets.

To assess a potential mechanism underlying SSM errors, eye movements were recorded in a multiple-target visual search and were used to explore whether a first target may result in an immediate decrease in second-target accuracy, which is known as an attentional blink. To determine whether other known attentional distractions amplified the effects of finding a first target has on second-target detection, distractors within the immediate vicinity of the targets (i.e., clutter) were measured and compared to accuracy for a second target. To better understand which characteristics of attention were impacted by detecting a first target, individual differences within four characteristics of attention were compared to second-target misses in a multiple-target visual search.

The results demonstrated that an attentional blink underlies SSM errors with a decrease in second-target accuracy from 135ms-405ms after detection or re-fixating a first target. The effects of clutter were exacerbated after finding a first target causing a greater decrease in second-target accuracy as clutter increased around a second-target. The attentional characteristics of modulation and vigilance were correlated with second- target misses and suggest that worse attentional modulation and vigilance are predictive of more second-target misses. Taken together, these result are used as the foundation to support a new theory of SSM errors, the Flux Capacitor theory. The Flux Capacitor theory predicts that once a target is found, it is maintained as an attentional template in working memory, which consumes attentional resources that could otherwise be used to detect additional targets. This theory not only proposes why attentional resources are consumed by a first target, but encompasses the research in support of all three SSM theories in an effort to establish a grand, unified theory of SSM errors.

A busca visual da cor, como medida avaliadora do funcionamento do sistema visual: um estudo exploratório a propósito da objetividade da felicidade em crianças

Este estudo, procura explicar a modularidade da mente humana, como um conjunto de módulos, permitindo desta forma contribuir para o estudo das ciências cognitivas. Estes módulos da arquitetura mental, permitem que a nossa mente interprete a cor resultante do sistema visual e das longitudes de ondas do espetro eletromagnético refratado dos objetos. Tendo por base o estudo do sistema visual, as células sensíveis, designadas por fotorrecetores percorrem o nervo ótico até atingir o encéfalo, localizando-se aí o sistema percetivo, permitindo desta forma realizar o estudo sobre busca visual da cor, como medida avaliadora do funcionamento do sistema visual, um estudo exploratório a propósito da objetividade da felicidade em crianças, que visa explorar a busca visual disjuntiva da cor como medida objetiva do bom funcionamento mental, do bem-estar subjetivo, como construto da felicidade. A amostra foi constituída por um grupo de 49 crianças não institucionalizadas e por um grupo de 16 crianças institucionalizadas, de ambos os sexos. Para a concretização deste estudo, foi necessária a utilização de uma tarefa de busca visual disjuntiva, que utilizou as simetrias de cores pertencentes ao mesmo par oponente e cores pertencentes a diferentes pares oponentes. Os resultados sugerem que não há qualquer interferência da institucionalização no funcionamento mental, logo no bem-estar subjetivo nas crianças; ABSTRACT: This study seeks to explain the modularity of the human mind, as a set of modules, giving this way a contribution to the study of the cognitive sciences. These modules of the mental architecture, allow our mind to interpret the resulting color of the visual system and the wavelengths of the electromagnetic spectrum refracted from the objects. Based on the study of our visual system, sensitive cells known as photoreceptors, which run along the optic nerve to the encephalon, being the perceptive system located there, allowing in this way to carry out the study on visual search of colour, as an assessment measure of the functioning of the visual system, an exploratory study concerning the objectivity of happiness in children, which aims to explore the disjunctive visual search of color as an objective measure of good mental functioning, of subjective well-being, as a construct of happiness. The sample consisted of a group of 49 non institutionalized children and of a group of 16 institutionalized children from both sexes. For the implementation of this study it was necessary to use a disjunctive visual search task, which used the Symmetry of colours belonging to the same opponent pair, and colours belonging to different opponent pairs. The results suggest that there is no interference from the institutionalization in mental functioning, therefore in the children’s subjective well being.

Interrelated product design activities sequencing with efficient tabu search algorithms

This paper proposes and investigates a metaheuristic tabu search algorithm (TSA) that generates optimal or near optimal solutions sequences for the feedback length minimization problem (FLMP) associated to a design structure matrix (DSM). The FLMP is a non-linear combinatorial optimization problem, belonging to the NP-hard class, and therefore finding an exact optimal solution is very hard and time consuming, especially on medium and large problem instances. First, we introduce the subject and provide a review of the related literature and problem definitions. Using the tabu search method (TSM) paradigm, this paper presents a new tabu search algorithm that generates optimal or sub-optimal solutions for the feedback length minimization problem, using two different neighborhoods based on swaps of two activities and shifting an activity to a different position. Furthermore, this paper includes numerical results for analyzing the performance of the proposed TSA and for fixing the proper values of its parameters. Then we compare our results on benchmarked problems with those already published in the literature. We conclude that the proposed tabu search algorithm is very promising because it outperforms the existing methods, and because no other tabu search method for the FLMP is reported in the literature. The proposed tabu search algorithm applied to the process layer of the multidimensional design structure matrices proves to be a key optimization method for an optimal product development.

Interrelated product design activities sequencing with efficient tabu search algorithms

This paper proposes and investigates a metaheuristic tabu search algorithm (TSA) that generates optimal or near optimal solutions sequences for the feedback length minimization problem (FLMP) associated to a design structure matrix (DSM). The FLMP is a non-linear combinatorial optimization problem, belonging to the NP-hard class, and therefore finding an exact optimal solution is very hard and time consuming, especially on medium and large problem instances. First, we introduce the subject and provide a review of the related literature and problem definitions. Using the tabu search method (TSM) paradigm, this paper presents a new tabu search algorithm that generates optimal or sub-optimal solutions for the feedback length minimization problem, using two different neighborhoods based on swaps of two activities and shifting an activity to a different position. Furthermore, this paper includes numerical results for analyzing the performance of the proposed TSA and for fixing the proper values of its parameters. Then we compare our results on benchmarked problems with those already published in the literature. We conclude that the proposed tabu search algorithm is very promising because it outperforms the existing methods, and because no other tabu search method for the FLMP is reported in the literature. The proposed tabu search algorithm applied to the process layer of the multidimensional design structure matrices proves to be a key optimization method for an optimal product development.

Adaptive Carrier Tracking for Mars to Earth Communications During Entry, Descent, and Landing

We propose a robust and low complexity scheme to estimate and track carrier frequency from signals traveling under low signal-to-noise ratio (SNR) conditions in highly nonstationary channels. These scenarios arise in planetary exploration missions subject to high dynamics, such as the Mars exploration rover missions. The method comprises a bank of adaptive linear predictors (ALP) supervised by a convex combiner that dynamically aggregates the individual predictors. The adaptive combination is able to outperform the best individual estimator in the set, which leads to a universal scheme for frequency estimation and tracking. A simple technique for bias compensation considerably improves the ALP performance. It is also shown that retrieval of frequency content by a fast Fourier transform (FFT)-search method, instead of only inspecting the angle of a particular root of the error predictor filter, enhances performance, particularly at very low SNR levels. Simple techniques that enforce frequency continuity improve further the overall performance. In summary we illustrate by extensive simulations that adaptive linear prediction methods render a robust and competitive frequency tracking technique.

Aquisition and extinction of two characteristics consistent with fear relevance

Fear relevance, the potential of a stimulus to become quickly associated with fear, is a characteristic assumed to have an evolutionary basis and to result in preferential processing. Previous research has shown that fear relevant stimuli share a number of characteristics, negative valence and preferential identification in a visual search task, for instance. The present research examined whether these two characteristics can be acquired by non-fear relevant stimuli (geometric shapes) as a result of Pavlovian fear conditioning. Two experiments employed an aversive learning paradigm with geometric shape CSs and a shock US, with stimulus ratings, affective priming and visual search performance assessed before and after acquisition and after extinction. Differential electrodermal responses, larger during CS1 than CS, were present during acquisition but not during extinction. Affective priming results suggest that the CS1 acquired negative valence during acquisition, which was lost during extinction. However, negative valence as indexed by more negative ratings for CS1 than for CS shapes seemed to survive extinction. Preferential attentional processing as indexed by faster detection of CS1 among CS shapes than vice versa on the visual search task also remained. The current research confirmed that characteristics of fear relevant stimuli can be acquired in an aversive learning episode and that they may be extinguished. This supports the proposal that fear relevance may be malleable through learning.

Why fear snakes and spiders? Evidence for a learning-based account of fear-relevant stimulus-processing

Fear-relevant stimuli, such as snakes, spiders and heights, preferentially capture attention as compared to nonfear-relevant stimuli. This is said to reflect an encapsulated mechanism whereby attention is captured by the simple perceptual features of stimuli that have evolutionary significance. Research, using pictures of snakes and spiders, has found some support for this account; however, participants may have had prior fear of snakes and spiders that influenced results. The current research compared responses of snake and spider experts who had little fear of snakes and spiders, and control participants across a series of affective priming and visual search tasks. Experts discriminated between dangerous and nondangerous snakes and spiders, and expert responses to pictures of nondangerous snakes and spiders differed from those of control participants. The current results dispute that stimulus fear relevance is based purely on perceptual features, and provides support for the role of learning and experience.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Derivative-free nonlinear optimization filter simplex

The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence is not necessary: direct search methods or derivative-free methods are examples of such techniques. In this work we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of simplex and filter methods. This method neither computes nor approximates derivatives, penalty constants or Lagrange multipliers.

Testing Nelder-Mead Based Repulsion Algorithms for Multiple Roots of Nonlinear Systems via a Two-Level Factorial Design of Experiments

This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as 'erf', is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.

Testing Nelder-Mead based repulsion algorithms for multiple roots of nonlinear systems via a two-level factorial design of experiments

This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as 'erf', is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.

An analysis of the use of photogrammetric sorting to audit construction and demolition waste production on site

This study analyses the area of construction and demolition waste (C & D W) auditing. The production of C&DW has grown year after year since the Environmental Protection Agency (EPA) first published a report in 1996 which provided data for C&D W quantities for 1995 (EPA, 1996a). The most recent report produced by the EPA is based on data for 2005 (EPA, 2006). This report estimated that the quantity of C&DW produced for that period to be 14 931 486 tonnes. However, this is a ‘data update’ report containing an update on certain waste statistics so any total provided would not be a true reflection of the waste produced for that period. This illustrates that a more construction site-specific form of data is required. The Department of Building and Civil Engineering in the Galway-Mayo Institute of Technology have carried out two recent research projects (Grimes, 2005; Kelly, 2006) in this area, which have produced waste production indicators based on site-specific data. This involved the design and testing of an original auditing tool based on visual characterisation and the application of conversion factors. One of the main recommendations of these studies was to compare this visual characterisation approach with a photogrammetric sorting methodology. This study investigates the application of photogrammetric sorting on a residential construction site in the Galway region. A visual characterisation study is also carried out on the same project to compare the two methodologies and assess the practical application in a construction site environment. Data collected from the waste management contractor on site was also used to provide further evaluation. From this, a set of waste production indicators for new residential construction was produced: □ 50.8 kg/m2 for new residential construction using data provided by the visual characterisation method and the Landfill Levy conversion factors. □ 43 kg/m2 for new residential construction using data provided by the photogrammetric sorting method and the Landfill Levy conversion factors. □ 23.8 kg/m2 for new residential construction using data provided by Waste Management Contractor (WMC). The acquisition of the data from the waste management contractor was a key element for testing of the information produced by the visual characterisation and photogrammetric sorting methods. The actual weight provided by the waste management contractor shows a significant difference between the quantities provided.

Optimització i implementació en Simulink de l'adquisició d'un senyal GPS amb blocs FFT

Aquest projecte es tracta de la optimització i la implementació de l’etapa d’adquisició d’un receptor GPS. També inclou una revisió breu del sistema GPS i els seus principis de funcionament. El procés d’adquisició s’ha estudiat amb detall i programat en els entorns de treball Matlab i Simulink. El fet d’implementar aquesta etapa en dos entorns diferents ha estat molt útil tant de cara a l’aprenentatge com també per la comprovació dels resultats obtinguts. El principal objectiu del treball és el disseny d’un model Simulink que es capaç d’adquirir una senyal capturada amb hardware real. En realitat, s’han fet dues implementacions: una que utilitza blocs propis de Simulink i l’altra que utilitza blocs de la llibreria Xilinx. D’aquesta manera, posteriorment, es facilitaria la transició del model a la FPGA utilitzant l’entorn ISE de Xilinx. La implementació de l’etapa d’adquisició es basa en el mètode de cerca de fase de codi en paral·lel, el qual empra la operació correlació creuada mitjançant la transformada ràpida de Fourier (FFT). Per aquest procés es necessari realitzar dues transformades (per a la senyal entrant i el codi de referència) i una antitransformada de Fourier (per al resultat de la correlació). Per tal d’optimitzar el disseny s’utilitza un bloc FFT, ja que tres blocs consumeixen gran part dels recursos d’una FPGA. En lloc de replicar el bloc FFT, en el model el bloc és compartit en el temps gràcies a l’ús de buffers i commutadors, com a resultat la quantitat de recursos requerits per una implementació en una FPGA es podria reduir considerablement.

Estudio sobre la extracción de puntos característicos en imágenes y sus aplicaciones

En aquest treball realitzem un estudi sobre la detecció y la descripció de punts característics, una tecnologia que permet extreure informació continguda en les imatges. Primerament presentem l'estat de l'art juntament amb una avaluació dels mètodes més rellevants. A continuació proposem els nous mètodes que hem creat de detecció i descripció, juntament amb l'algorisme òptim anomenat DART, el qual supera l'estat de l'art. Finalment mostrem algunes aplicacions on s'utilitzen els punts DART. Basant-se en l'aproximació de l'espai d'escales Gaussià, el detector proposat pot extreure punts de distint tamany invariants davant canvis en el punt de vista, la rotació i la iluminació. La reutilització de l'espai d'escales durant el procés de descripció, així com l'ús d'estructures simplificades i optimitzades, permeten realitzar tot el procediment en un temps computacional menor a l'obtingut fins al moment. Així s'aconsegueixen punts invariants i distingibles de forma ràpida, el qual permet la seva utilització en aplicacions com el seguiment d'objectes, la reconstrucció d'escenaris 3D i en motors de cerca visual.

Pre-hatching maternal effects and the tasty chick hypothesis

Question: Are maternal effects (i.e. maternal transfer of immune components to their offspring via the placenta or the egg) specifically directed to the offspring on which ectoparasites predictably aggregate? Organisms: The barn owl (Tyto alba) because late-hatched offspring are the main target of the ectoparasitic fly Carnus hemapterus. Hypothesis: Pre-hatching maternal effects enhance parasite resistance of late- compared with early-hatched nestlings. Search method: To disentangle the effect of natal from rearing ranks on parasite intensity, we exchanged hatchlings between nests to allocate early- and late-hatched hatchlings randomly in the within-brood age hierarchy. Result: After controlling for rearing ranks, cross-fostered late-hatched nestlings were less parasitized but lighter than cross-fostered early-hatched nestlings. Conclusion: Pre-hatching maternal effects increase parasite resistance of late-hatched offspring at a growth cost.