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.

Advertising effects on brand search and preference: Assessing the mediational role of *Aad and *Ab

Most advertising research has focussed at examining effects of advertising on attitudinal responses or brand preference and choice. However, in a natural environment, the time period between advertising exposure and purchase decision is filled with prepurchase search. Prepurchase external search refers to information search from sources other than memory, prior to making a purchase decision. Usually consumers access only a small subset of available information and base their choice decisions on it. Prepurchase search therefore acts as a filter and, the final choice depends critically on the small subset of potential inputs the consumer notes in the environment and integrates into the decision. Previous research has identified a variety of factors that affect consumers' prepurchase search behavior. However, there is little understanding of how specific advertisements designed by marketers impact consumers' prepurchase search. A marketer would like consumers to search information that reflects favorably on his/her brand. Hence, s/he would attempt to influence the brands and attributes on which consumers seek information prior to making a choice. The dissertation investigates the process by which a particular marketer's advertising influences consumers' search on available brands, i.e., the marketer's brand and other competing brands. The dissertation considers a situation where exposure to advertising occurs prior to seeking information from any other source. Hence, the impact of advertising on subsequent search behavior is the topic of interest. The dissertation develops a conceptual model of advertising effects on brand search and conducts two experiments to test the tenets of this model. Specifically, the dissertation demonstrates that attitudinal responses generated by advertising mediate advertising effects on search attitudes and behaviors. The dissertation goes on to examine how attitudinal responses generated by advertising and subsequent effects on search alter brand preference and choice. ^

Development of a new client -server architecture for context aware mobile computing

This dissertation studies the context-aware application with its proposed algorithms at client side. The required context-aware infrastructure is discussed in depth to illustrate that such an infrastructure collects the mobile user’s context information, registers service providers, derives mobile user’s current context, distributes user context among context-aware applications, and provides tailored services. The approach proposed tries to strike a balance between the context server and mobile devices. The context acquisition is centralized at the server to ensure the reusability of context information among mobile devices, while context reasoning remains at the application level. Hence, a centralized context acquisition and distributed context reasoning are viewed as a better solution overall. The context-aware search application is designed and implemented at the server side. A new algorithm is proposed to take into consideration the user context profiles. By promoting feedback on the dynamics of the system, any prior user selection is now saved for further analysis such that it may contribute to help the results of a subsequent search. On the basis of these developments at the server side, various solutions are consequently provided at the client side. A proxy software-based component is set up for the purpose of data collection. This research endorses the belief that the proxy at the client side should contain the context reasoning component. Implementation of such a component provides credence to this belief in that the context applications are able to derive the user context profiles. Furthermore, a context cache scheme is implemented to manage the cache on the client device in order to minimize processing requirements and other resources (bandwidth, CPU cycle, power). Java and MySQL platforms are used to implement the proposed architecture and to test scenarios derived from user’s daily activities. To meet the practical demands required of a testing environment without the impositions of a heavy cost for establishing such a comprehensive infrastructure, a software simulation using a free Yahoo search API is provided as a means to evaluate the effectiveness of the design approach in a most realistic way. The integration of Yahoo search engine into the context-aware architecture design proves how context aware application can meet user demands for tailored services and products in and around the user’s environment. The test results show that the overall design is highly effective, providing new features and enriching the mobile user’s experience through a broad scope of potential applications.

Development of a New Client-Server Architecture for Context Aware Mobile Computing

This dissertation studies the context-aware application with its proposed algorithms at client side. The required context-aware infrastructure is discussed in depth to illustrate that such an infrastructure collects the mobile user’s context information, registers service providers, derives mobile user’s current context, distributes user context among context-aware applications, and provides tailored services. The approach proposed tries to strike a balance between the context server and mobile devices. The context acquisition is centralized at the server to ensure the usability of context information among mobile devices, while context reasoning remains at the application level. Hence, a centralized context acquisition and distributed context reasoning are viewed as a better solution overall. The context-aware search application is designed and implemented at the server side. A new algorithm is proposed to take into consideration the user context profiles. By promoting feedback on the dynamics of the system, any prior user selection is now saved for further analysis such that it may contribute to help the results of a subsequent search. On the basis of these developments at the server side, various solutions are consequently provided at the client side. A proxy software-based component is set up for the purpose of data collection. This research endorses the belief that the proxy at the client side should contain the context reasoning component. Implementation of such a component provides credence to this belief in that the context applications are able to derive the user context profiles. Furthermore, a context cache scheme is implemented to manage the cache on the client device in order to minimize processing requirements and other resources (bandwidth, CPU cycle, power). Java and MySQL platforms are used to implement the proposed architecture and to test scenarios derived from user’s daily activities. To meet the practical demands required of a testing environment without the impositions of a heavy cost for establishing such a comprehensive infrastructure, a software simulation using a free Yahoo search API is provided as a means to evaluate the effectiveness of the design approach in a most realistic way. The integration of Yahoo search engine into the context-aware architecture design proves how context aware application can meet user demands for tailored services and products in and around the user’s environment. The test results show that the overall design is highly effective,providing new features and enriching the mobile user’s experience through a broad scope of potential applications.

Search for optimum conditions of sugarcane bagasse hemicellulose extraction

A process has been elaborated for one-step low lignin content sugarcane bagasse hemicellulose extraction using alkaline solution of hydrogen peroxide. To maximize the hemicellulose yields several extraction conditions were examined applying the 2(4) factorial design: H(2)O(2) concentration from 2 to 6% (w/v), reaction time from 4 to 16 h, temperature from 20 to 60 degrees C, and magnesium sulfate absence or presence (0.5%, w/v). This approach allowed selection of conditions for the extraction of low and high lignin content hemicellulose. At midpoint the yield of hemicellulose was 94.5% with more than 88% of lignin removed. Lignin removal is suppressed at low extraction temperatures and in the absence of magnesium sulfate. Hemicellulose in 86% yield with low lignin content (5.9%) was obtained with 6% H(2)O(2) treatment for 4 h and 20 degrees C. This hemicellulose is much lighter in color than samples obtained at the midpoint condition and was found suitable for subsequent enzymatic hydrolysis. (C) 2009 Elsevier B.V. All rights reserved.

Desenvolvimento de módulos para planeamento e controlo de execução de missões de veículos aéreos não tripulados

Com a evolução da tecnologia, os UAVs (unmanned aerial vehicles) são cada vez mais utilizados, não só em missões de risco para o ser Humano, mas também noutro tipo de missões, como é o caso de missões de inspeção, vigilância, busca e salvamento. Isto devese ao baixo custo das plataformas assim como à sua enorme fiabilidade e facilidade de operação. Esta dissertação surge da necessidade de aumentar a autonomia dos UAVs do projeto PITVANT (Projeto de Investigação e Tecnologia em Veículos Aéreos Não Tripulados), projeto de investigação colaborativa entre a AFA (Academia da Força Aérea) e a FEUP (Faculdade de Engenharia da Universidade do Porto), relativamente ao planeamento de trajetórias entre dois pontos no espaço, evitando os obstáculos que intersetem o caminho. Para executar o planeamento da trajetória mais curta entre dois pontos, foi implementado o algoritmo de pesquisa A*, por ser um algoritmo de pesquisa de soluções ótimas. A área de pesquisa é decomposta em células regulares e o centro das células são os nós de pesquisa do A*. O tamanho de cada célula é dependente da dinâmica de cada aeronave. Para que as aeronaves não colidam com os obstáculos, foi desenvolvido um método numérico baseado em relações trigonométricas para criar uma margem de segurança em torno de cada obstáculo. Estas margens de segurança são configuráveis, sendo o seu valor por defeito igual ao raio mínimo de curvatura da aeronave à velocidade de cruzeiro. De forma a avaliar a sua escalabilidade, o algoritmo foi avaliado com diferentes números de obstáculos. As métricas utilizadas para avaliação do algoritmo foram o tempo de computação do mesmo e o comprimento do trajeto obtido. Foi ainda comparado o desempenho do algoritmo desenvolvido com um algoritmo já implementado, do tipo fast marching.

Search for massive supersymmetric particles decaying to many jets using the ATLAS detector in pp collisions at s√=8TeV

Results of a search for decays of massive particles to fully hadronic final states are presented. This search uses 20.3 fb−1 of data collected by the ATLAS detector in s√=8TeV proton--proton collisions at the LHC. Signatures based on high jet multiplicities without requirements on the missing transverse momentum are used to search for R-parity-violating supersymmetric gluino pair production with subsequent decays to quarks. The analysis is performed using a requirement on the number of jets, in combination with separate requirements on the number of b-tagged jets, as well as a topological observable formed from the scalar sum of the mass values of large-radius jets in the event. Results are interpreted in the context of all possible branching ratios of direct gluino decays to various quark flavors. No significant deviation is observed from the expected Standard Model backgrounds estimated using jet-counting as well as data-driven templates of the total-jet-mass spectra. Gluino pair decays to ten or more quarks via intermediate neutralinos are excluded for a gluino with mass mg~<1TeV for a neutralino mass mχ~01=500GeV. Direct gluino decays to six quarks are excluded for mg~<917GeV for light-flavor final states, and results for various flavor hypotheses are presented.

Search for vector-like B quarks in events with one isolated lepton, missing transverse momentum and jets at s√= 8 TeV with the ATLAS detector

A search has been performed for pair production of heavy vector-like down-type (B) quarks. The analysis explores the lepton-plus-jets final state, characterized by events with one isolated charged lepton (electron or muon), significant missing transverse momentum and multiple jets. One or more jets are required to be tagged as arising from b-quarks, and at least one pair of jets must be tagged as arising from the hadronic decay of an electroweak boson. The analysis uses the full data sample of pp collisions recorded in 2012 by the ATLAS detector at the LHC, operating at a center-of-mass energy of 8 TeV, corresponding to an integrated luminosity of 20.3 fb−1. No significant excess of events is observed above the expected background. Limits are set on vector-like B production, as a function of the B branching ratios, assuming the allowable decay modes are B→Wt/Zb/Hb. In the chiral limit with a branching ratio of 100% for the decay B→Wt, the observed (expected) 95% CL lower limit on the vector-like B mass is 810 GeV (760 GeV). In the case where the vector-like B quark has branching ratio values corresponding to those of an SU(2) singlet state, the observed (expected) 95% CL lower limit on the vector-like B mass is 640 GeV (505 GeV). The same analysis, when used to investigate pair production of a colored, charge 5/3 exotic fermion T5/3, with subsequent decay T5/3→Wt, sets an observed (expected) 95% CL lower limit on the T5/3 mass of 840 GeV (780 GeV).

The effect of unemployment spells on subsequent wages in Spain

In our analysis we try and recover the wage loss from unemploymentin Spain and see how it is affected by previous unemploymentexperience, unemployment duration, eligibility for unemploymentbenefits, and previous wages. We also study its variations acrossgroups. Our main conclusion is that while there is some evidencethat labour market rigidities tend to lower it, the wage loss ofdisplaced workers is remarkably high: more than 30%, that is,twice the equivalent figure for the US and France. Wages in Spainsuffer from a serious mismeasurement problems that we do our best tocontrol, so that our results are less robust than the ones thatwould be obtained with better data sets. However, they indicate a large level of wage flexibility in Spain.

Search space pruning and global optimization of multiple gravity assist trajectories with deep space manoeuvres

This paper deals with the design of optimal multiple gravity assist trajectories with deep space manoeuvres. A pruning method which considers the sequential nature of the problem is presented. The method locates feasible vectors using local optimization and applies a clustering algorithm to find reduced bounding boxes which can be used in a subsequent optimization step. Since multiple local minima remain within the pruned search space, the use of a global optimization method, such as Differential Evolution, is suggested for finding solutions which are likely to be close to the global optimum. Two case studies are presented.

Search space pruning and global optimisation of Multiple Gravity Assist spacecraft trajectories

We introduce and describe the Multiple Gravity Assist problem, a global optimisation problem that is of great interest in the design of spacecraft and their trajectories. We discuss its formalization and we show, in one particular problem instance, the performance of selected state of the art heuristic global optimisation algorithms. A deterministic search space pruning algorithm is then developed and its polynomial time and space complexity derived. The algorithm is shown to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Seed priming improves endosperm weakening, germination, and subsequent seedling development of Solanum lycocarpum St. Hil.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Robust CERN LHC Higgs boson search in weak boson fusion

We demonstrate that a CERN LHC Higgs boson search in weak boson fusion production with subsequent decay to weak boson pairs is robust against extensions of the standard model or minimal supersymmetric standard model involving a large number of Higgs doublets. We also show that the transverse mass distribution provides unambiguous discrimination of a continuum Higgs signal from the standard model.

Search for a scalar or vector particle decaying into Z gamma in p(p)over-bar collisions at root s=1.96 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)