The role of visual landmarks in the avian familiar area map - Commentary

The question of whether homing pigeons use visual landmarks for orientation from distant, familiar sites is an unresolved issue in the field of avian navigation. Where evidence has been found, the question still remains as to whether the landmarks are used independent of the map and compass mechanism for orientation that is so important to birds. Recent research has challenged the extent to which experiments that do not directly manipulate the visual sense can be used as evidence for compass-independent orientation. However, it is proposed that extending a new technique for research on vision in homing to include manipulation of the compasses used by birds might be able to resolve this issue. The effect of the structure of the visual sense of the homing pigeon on its use of visual landmarks is also considered.

Further evidence for visual landmark involvement in the pigeon's familiar area map

In previous experiments suggesting that previewing visual landscapes speeds homing from familiar release sites, restricted access to olfactory cues may have artefactually encouraged homing pigeons, Calumba livia, to resort to visual landmark orientation. Since evidence for the role of visual landmarks in wide-ranging avian orientation is still equivocal, Braithwaite & Guilford's (1991, Proc. R. Sec. Lond. Ser. B, 245, 183-186) 'previewing' experiments were replicated: birds were allowed or denied visual access to a familiar site prior to release, but allowed ample access to olfactory cues. In experiment 1, allowing birds to preview familiar sites for 5 min prior to release enhanced homing speeds by about 12%. In experiment 2, modified to reduce between-day effects on variation, previewing enhanced homing speeds by about 16%. These experiments support the conclusion that visual landmarks remote from sight of the loft are an important component of the familiar area map, although the nature of the landmarks and how they are encoded remain to be determined. (C) 1997 The Association for the Study of Animal Behaviour.

Order Flow and the Monetary Model of Exchange Rates: Evidence from a Novel Data Set

We propose an exchange rate model that is a hybrid of the conventional specification with monetary fundamentals and the Evans–Lyons microstructure approach. We estimate a model augmented with order flow variables, using a unique data set: almost 100 monthly observations on interdealer order flow on dollar/euro and dollar/yen. The augmented macroeconomic, or “hybrid,” model exhibits greater in-sample stability and out of sample forecasting improvement vis-à-vis the basic macroeconomic and random walk specifications.

Approximating the Set of Local Minima in Partial RNA Folding Landscapes

Motivation: We study a stochastic method for approximating the set of local minima in partial RNA folding landscapes associated with a bounded-distance neighbourhood of folding conformations. The conformations are limited to RNA secondary structures without pseudoknots. The method aims at exploring partial energy landscapes pL induced by folding simulations and their underlying neighbourhood relations. It combines an approximation of the number of local optima devised by Garnier and Kallel (2002) with a run-time estimation for identifying sets of local optima established by Reeves and Eremeev (2004).

Results: The method is tested on nine sequences of length between 50 nt and 400 nt, which allows us to compare the results with data generated by RNAsubopt and subsequent barrier tree calculations. On the nine sequences, the method captures on average 92% of local minima with settings designed for a target of 95%. The run-time of the heuristic can be estimated by O(n2D?ln?), where n is the sequence length, ? is the number of local minima in the partial landscape pL under consideration and D is the maximum number of steepest descent steps in attraction basins associated with pL.

XOR-based hash functions

Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: Objects which should be mapped to different indices are accidentally mapped to the same index. Suitable chosen hash functions can avoid conflicts in each of these situations by mapping the most frequently occurring patterns conflict-free. A particularly interesting class of hash functions are the XOR-based hash functions, which compute each set index bit as the exclusive-or of a subset of the address bits. When implementing an XOR-based hash function, it is extremely important to understand what patterns are mapped conflict-free and how a hash function can be constructed to map the most frequently occurring patterns without conflicts. Hereto, this paper presents two ways to reason about hash functions: by their null space and by their column space. The null space helps to quickly determine whether a pattern is mapped conflict-free. The column space is more useful for other purposes, e. g., to reduce the fan-in of the XOR-gates without introducing conflicts or to evaluate interbank dispersion in skewed-associative caches. Examples illustrate how these ideas can be applied to construct conflict-free hash functions.

On generating set index functions for randomized caches

Caches hide the growing latency of accesses to the main memory from the processor by storing the most recently used data on-chip. To limit the search time through the caches, they are organized in a direct mapped or set-associative way. Such an organization introduces many conflict misses that hamper performance. This paper studies randomizing set index functions, a technique to place the data in the cache in such a way that conflict misses are avoided. The performance of such a randomized cache strongly depends on the randomization function. This paper discusses a methodology to generate randomization functions that perform well over a broad range of benchmarks. The methodology uses profiling information to predict the conflict miss rate of randomization functions. Then, using this information, a search algorithm finds the best randomization function. Due to implementation issues, it is preferable to use a randomization function that is extremely simple and can be evaluated in little time. For these reasons, we use randomization functions where each randomized address bit is computed as the XOR of a subset of the original address bits. These functions are chosen such that they operate on as few address bits as possible and have few inputs to each XOR. This paper shows that to index a 2(m)-set cache, it suffices to randomize m+2 or m+3 address bits and to limit the number of inputs to each XOR to 2 bits to obtain the full potential of randomization. Furthermore, it is shown that the randomization function that we generate for one set of benchmarks also works well for an entirely different set of benchmarks. Using the described methodology, it is possible to reduce the implementation cost of randomization functions with only an insignificant loss in conflict reduction.

Highly accurate and efficient evaluation of randomising set index functions

Randomising set index functions can reduce the number of conflict misses in data caches by spreading the cache blocks uniformly over all sets. Typically, the randomisation functions compute the exclusive ors of several address bits. Not all randomising set index functions perform equally well, which calls for the evaluation of many set index functions. This paper discusses and improves a technique that tackles this problem by predicting the miss rate incurred by a randomisation function, based on profiling information. A new way of looking at randomisation functions is used, namely the null space of the randomisation function. The members of the null space describe pairs of cache blocks that are mapped to the same set. This paper presents an analytical model of the error made by the technique and uses this to propose several optimisations to the technique. The technique is then applied to generate a conflict-free randomisation function for the SPEC benchmarks. (C) 2003 Elsevier Science B.V. All rights reserved.

Selective extracellular vesicle-mediated export of an overlapping set of microRNAs from multiple cell types

Background: MicroRNAs (miRNAs) are a class of small RNA molecules that regulate expression of specific mRNA targets. They can be released from cells, often encapsulated within extracellular vesicles (EVs), and therefore have the potential to mediate intercellular communication. It has been suggested that certain miRNAs may be selectively exported, although the mechanism has yet to be identified. Manipulation of the miRNA content of EVs will be important for future therapeutic applications. We therefore wished to assess which endogenous miRNAs are enriched in EVs and how effectively an overexpressed miRNA would be exported.

Results: Small RNA libraries from HEK293T cells and vesicles before or after transfection with a vector for miR-146a overexpression were analysed by deep sequencing. A subset of miRNAs was found to be enriched in EVs; pathway analysis of their predicted target genes suggests a potential role in regulation of endocytosis. RT-qPCR in additional cell types and analysis of publicly available data revealed that many of these miRNAs tend to be widely preferentially exported. Whilst overexpressed miR-146a was highly enriched both in transfected cells and their EVs, the cellular:EV ratios of endogenous miRNAs were not grossly altered. MiR-451 was consistently the most highly exported miRNA in many different cell types. Intriguingly, Argonaute2 (Ago2) is required for miR-451 maturation and knock out of Ago2 has been shown to decrease expression of other preferentially exported miRNAs (eg miR-150 and miR-142-3p).

Conclusion: The global expression data provided by deep sequencing confirms that specific miRNAs are enriched in EVs released by HEK293T cells. Observation of similar patterns in a range of cell types suggests that a common mechanism for selective miRNA export may exist.