Visual search and eye movements: Studies of perceptual span

In visual search one tries to find the currently relevant item among other, irrelevant items. In the present study, visual search performance for complex objects (characters, faces, computer icons and words) was investigated, and the contribution of different stimulus properties, such as luminance contrast between characters and background, set size, stimulus size, colour contrast, spatial frequency, and stimulus layout were investigated. Subjects were required to search for a target object among distracter objects in two-dimensional stimulus arrays. The outcome measure was threshold search time, that is, the presentation duration of the stimulus array required by the subject to find the target with a certain probability. It reflects the time used for visual processing separated from the time used for decision making and manual reactions. The duration of stimulus presentation was controlled by an adaptive staircase method. The number and duration of eye fixations, saccade amplitude, and perceptual span, i.e., the number of items that can be processed during a single fixation, were measured. It was found that search performance was correlated with the number of fixations needed to find the target. Search time and the number of fixations increased with increasing stimulus set size. On the other hand, several complex objects could be processed during a single fixation, i.e., within the perceptual span. Search time and the number of fixations depended on object type as well as luminance contrast. The size of the perceptual span was smaller for more complex objects, and decreased with decreasing luminance contrast within object type, especially for very low contrasts. In addition, the size and shape of perceptual span explained the changes in search performance for different stimulus layouts in word search. Perceptual span was scale invariant for a 16-fold range of stimulus sizes, i.e., the number of items processed during a single fixation was independent of retinal stimulus size or viewing distance. It is suggested that saccadic visual search consists of both serial (eye movements) and parallel (processing within perceptual span) components, and that the size of the perceptual span may explain the effectiveness of saccadic search in different stimulus conditions. Further, low-level visual factors, such as the anatomical structure of the retina, peripheral stimulus visibility and resolution requirements for the identification of different object types are proposed to constrain the size of the perceptual span, and thus, limit visual search performance. Similar methods were used in a clinical study to characterise the visual search performance and eye movements of neurological patients with chronic solvent-induced encephalopathy (CSE). In addition, the data about the effects of different stimulus properties on visual search in normal subjects were presented as simple practical guidelines, so that the limits of human visual perception could be taken into account in the design of user interfaces.

Locality and order-invariant logics

Malli on logiikassa käytetty abstraktio monille matemaattisille objekteille. Esimerkiksi verkot, ryhmät ja metriset avaruudet ovat malleja. Äärellisten mallien teoria on logiikan osa-alue, jossa tarkastellaan logiikkojen, formaalien kielten, ilmaisuvoimaa malleissa, joiden alkioiden lukumäärä on äärellinen. Rajoittuminen äärellisiin malleihin mahdollistaa tulosten soveltamisen teoreettisessa tietojenkäsittelytieteessä, jonka näkökulmasta logiikan kaavoja voidaan ajatella ohjelmina ja äärellisiä malleja niiden syötteinä. Lokaalisuus tarkoittaa logiikan kyvyttömyyttä erottaa toisistaan malleja, joiden paikalliset piirteet vastaavat toisiaan. Väitöskirjassa tarkastellaan useita lokaalisuuden muotoja ja niiden säilymistä logiikkoja yhdistellessä. Kehitettyjä työkaluja apuna käyttäen osoitetaan, että Gaifman- ja Hanf-lokaalisuudeksi kutsuttujen varianttien välissä on lokaalisuuskäsitteiden hierarkia, jonka eri tasot voidaan erottaa toisistaan kasvavaa dimensiota olevissa hiloissa. Toisaalta osoitetaan, että lokaalisuuskäsitteet eivät eroa toisistaan, kun rajoitutaan tarkastelemaan äärellisiä puita. Järjestysinvariantit logiikat ovat kieliä, joissa on käytössä sisäänrakennettu järjestysrelaatio, mutta sitä on käytettävä siten, etteivät kaavojen ilmaisemat asiat riipu valitusta järjestyksestä. Määritelmää voi motivoida tietojenkäsittelyn näkökulmasta: vaikka ohjelman syötteen tietojen järjestyksellä ei olisi odotetun tuloksen kannalta merkitystä, on syöte tietokoneen muistissa aina jossakin järjestyksessä, jota ohjelma voi laskennassaan hyödyntää. Väitöskirjassa tutkitaan minkälaisia lokaalisuuden muotoja järjestysinvariantit ensimmäisen kertaluvun predikaattilogiikan laajennukset yksipaikkaisilla kvanttoreilla voivat toteuttaa. Tuloksia sovelletaan tarkastelemalla, milloin sisäänrakennettu järjestys lisää logiikan ilmaisuvoimaa äärellisissä puissa.

Topological stability through tame retractions

A smooth map is said to be stable if small perturbations of the map only differ from the original one by a smooth change of coordinates. Smoothly stable maps are generic among the proper maps between given source and target manifolds when the source and target dimensions belong to the so-called nice dimensions, but outside this range of dimensions, smooth maps cannot generally be approximated by stable maps. This leads to the definition of topologically stable maps, where the smooth coordinate changes are replaced with homeomorphisms. The topologically stable maps are generic among proper maps for any dimensions of source and target. The purpose of this thesis is to investigate methods for proving topological stability by constructing extremely tame (E-tame) retractions onto the map in question from one of its smoothly stable unfoldings. In particular, we investigate how to use E-tame retractions from stable unfoldings to find topologically ministable unfoldings for certain weighted homogeneous maps or germs. Our first results are concerned with the construction of E-tame retractions and their relation to topological stability. We study how to construct the E-tame retractions from partial or local information, and these results form our toolbox for the main constructions. In the next chapter we study the group of right-left equivalences leaving a given multigerm f invariant, and show that when the multigerm is finitely determined, the group has a maximal compact subgroup and that the corresponding quotient is contractible. This means, essentially, that the group can be replaced with a compact Lie group of symmetries without much loss of information. We also show how to split the group into a product whose components only depend on the monogerm components of f. In the final chapter we investigate representatives of the E- and Z-series of singularities, discuss their instability and use our tools to construct E-tame retractions for some of them. The construction is based on describing the geometry of the set of points where the map is not smoothly stable, discovering that by using induction and our constructional tools, we already know how to construct local E-tame retractions along the set. The local solutions can then be glued together using our knowledge about the symmetry group of the local germs. We also discuss how to generalize our method to the whole E- and Z- series.

Phospholipid cytochrome c interactions

The ability of the peripherally associated membrane protein cytochrome c (cyt c) to bind phospholipids in vitro was studied using fluorescence spectroscopy and large unilamellar liposomes. Previous work has shown that cyt c can bind phospholipids using two distinct mecha- nisms and sites, the A-site and the C-site. This binding is mediated by electrostatic or hydrophobic interactions, respectively. Here, we focus on the mechanism underlying these interactions. A chemically modified cyt c mutant Nle91 was used to study the ATP-binding site, which is located near the evolutionarily invariant Arg 91 on the protein surface. This site was also demonstrated to mediate phospholipid binding, possibly by functioning as a phospholipid binding site. Circular dichroism spectroscopy, time resolved fluorescence spectroscopy of zinc- porphyrin modified [Zn2+-heme] cyt c and liposome binding studies of the Nle91 mutant were used to demonstrate that ATP induces a conformational change in membrane- bound cyt c. The ATP-induced conformational changes were mediated by Arg 91 and were most pronounced in cyt c bound to phospholipids via the C-site. It has been previously reported that the hydrophobic interaction between phospho- lipids and cyt c (C-site) includes the binding of a phospholipid acyl chain inside the protein. In this mechanism, which is known as extended phospholipid anchorage, the sn-2 acyl chain of a membrane phospholipid protrudes out of the membrane surface and is able to bind in a hydrophobic cavity in cyt c. Direct evidence for this type of bind- ing mechanism was obtained by studying cyt c/lipid interaction using fluorescent [Zn2+- heme] cyt c and fluorescence quenching of brominated fatty acids and phospholipids. Under certain conditions, cyt c can form fibrillar protein-lipid aggregates with neg- atively charged phospholipids. These aggregates resemble amyloid fibrils, which are involved in the pathogenesis of many diseases. Congo red staining of these fibers con- firmed the presence of amyloid structures. A set of phospholipid-binding proteins was also found to form similar aggregates, suggesting that phospholipid-induced amyloid formation could be a general mechanism of amyloidogenesis.

Search for High-Mass Resonances Decaying to Dimuons at CDF

We present a search for high-mass neutral resonances using dimuon data corresponding to an integrated luminosity of 2.3 fb$^{-1}$ collected in {$p\bar p$} collisions at {$\sqrt{s}$ = 1.96 TeV} by the CDF II detector at the Fermilab Tevatron. No significant excess above the standard model expectation is observed in the dimuon invariant-mass spectrum. We set 95% confidence level upper limits on $\sigma \cdot BR (p \bar{p} \to X \to \mu \bar{\mu})$, where $X$ is a boson with spin 0, 1, or 2. Using these cross section limits, we determine lower mass limits on sneutrinos in R-parity-violating supersymmetric models, $Z'$ bosons, and Kaluza-Klein gravitons in the Randall-Sundrum model.

Search for narrow resonances lighter than ϒ mesons

We report a search for narrow resonances, produced in $p\bar{p}$ collisions at $\sqrt{s}=1.96$ TeV, that decay into muon pairs with invariant mass between 6.3 and 9.0 GeV/c^2. The data, collected with the CDF~II detector at the Fermilab Tevatron collider, correspond to an integrated luminosity of 630 pb$^{-1}$. We use the dimuon invariant mass distribution to set 90% upper credible limits of about 1% to the ratio of the production cross section times muonic branching fraction of possible narrow resonances to that of the $\Upsilon(1{\rm S})$ meson.

Search for new color-octet vector particle decaying to t tbar in p pbar collisions at sqrt{s} = 1.96 TeV

We present the result of a search for a massive color-octet vector particle, (e.g. a massive gluon) decaying to a pair of top quarks in proton-antiproton collisions with a center-of-mass energy of 1.96 TeV. This search is based on 1.9 fb$^{-1}$ of data collected using the CDF detector during Run II of the Tevatron at Fermilab. We study $t\bar{t}$ events in the lepton+jets channel with at least one $b$-tagged jet. A massive gluon is characterized by its mass, decay width, and the strength of its coupling to quarks. These parameters are determined according to the observed invariant mass distribution of top quark pairs. We set limits on the massive gluon coupling strength for masses between 400 and 800 GeV$/c^2$ and width-to-mass ratios between 0.05 and 0.50. The coupling strength of the hypothetical massive gluon to quarks is consistent with zero within the explored parameter space.

Innate Immune Recognition of RNA-virus infection in human macrophages

Innate immunity and host defence are rapidly evoked by structurally invariant molecular motifs common to microbial world, called pathogen associated molecular patterns (PAMPs). In addition to PAMPs, endogenous molecules released in response to inflammation and tissue damage, danger associated molecular patterns (DAMPs), are required for eliciting the response. The most important PAMPs of viruses are viral nucleic acids, their genome or its replication intermediates, whereas the identity and characteristics of virus infection-induced DAMPs are poorly defined. PAMPs and DAMPs engage a limited set of germ-line encoded pattern recognition receptors (PRRs) in immune and non-immune cells. Membrane-bound Toll-like receptors (TLRs), cytoplasmic retinoic acid inducible gene-I (RIG-I)-like receptors (RLRs) and nucleotide-binding oligomerization domain-like receptor (NLRs) are important PRRs involved in the recognition of the molecular signatures of viral infection, such as double-stranded ribonucleic acids (dsRNAs). Engagement of PRRs results in local and systemic innate immune responses which, when activated against viruses, evoke secretion of antiviral and pro-inflammatory cytokines, and programmed cell death i.e., apoptosis of the virus-infected cell. Macrophages are the central effector cells of innate immunity. They produce significant amounts of antiviral cytokines, called interferons (IFNs), and pro-inflammatory cytokines, such as interleukin (IL)-1β and IL-18. IL-1β and IL-18 are synthesized as inactive precursors, pro-IL-1β and pro-IL-18, that are processed by caspase-1 in a cytoplasmic multiprotein complex, called the inflammasome. After processing, these cytokines are biologically active and will be secreted. The signals and secretory routes that activate inflammasomes and the secretion of IL-1β and IL-18 during virus infections are poorly characterized. The main goal of this thesis was to characterize influenza A virus-induced innate immune responses and host-virus interactions in human primary macrophages during an infection. Methodologically, various techniques of cellular and molecular biology, as well as proteomic tools combined with bioinformatics, were utilized. Overall, the thesis provides interesting insights into inflammatory and antiviral innate immune responses, and has characterized host-virus interactions during influenza A virus-infection in human primary macrophages.

Vision based indoor positioning in a retail environment

Modern smart phones often come with a significant amount of computational power and an integrated digital camera making them an ideal platform for intelligents assistants. This work is restricted to retail environments, where users could be provided with for example navigational in- structions to desired products or information about special offers within their close proximity. This kind of applications usually require information about the user's current location in the domain environment, which in our case corresponds to a retail store. We propose a vision based positioning approach that recognizes products the user's mobile phone's camera is currently pointing at. The products are related to locations within the store, which enables us to locate the user by pointing the mobile phone's camera to a group of products. The first step of our method is to extract meaningful features from digital images. We use the Scale- Invariant Feature Transform SIFT algorithm, which extracts features that are highly distinctive in the sense that they can be correctly matched against a large database of features from many images. We collect a comprehensive set of images from all meaningful locations within our domain and extract the SIFT features from each of these images. As the SIFT features are of high dimensionality and thus comparing individual features is infeasible, we apply the Bags of Keypoints method which creates a generic representation, visual category, from all features extracted from images taken from a specific location. A category for an unseen image can be deduced by extracting the corresponding SIFT features and by choosing the category that best fits the extracted features. We have applied the proposed method within a Finnish supermarket. We consider grocery shelves as categories which is a sufficient level of accuracy to help users navigate or to provide useful information about nearby products. We achieve a 40% accuracy which is quite low for commercial applications while significantly outperforming the random guess baseline. Our results suggest that the accuracy of the classification could be increased with a deeper analysis on the domain and by combining existing positioning methods with ours.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.