Nematode neuropeptides: Localization, isolation and functions

Historically, peptidergic substances (in the form of neurosecretions) were linked to moulting in nematodes. More recently, there has been a renewal of interest in nematode neurobiology, initially triggered by studies demonstrating the localization of peptide immunoreactivities to the nervous system. Here, David Brownlee, Ian Fairweather, Lindy Holden-Dye and Robert Walker will review progress on the isolation of nematode neuropeptides and efforts to unravel their physiological actions and inactivation mechanisms. Future avenues for research are suggested and the potential exploitation of peptidergic pathways in future therapeutic strategies highlighted.

Structure observed in measured electron energy distribution functions in capacitively coupled radio frequency hydrogen plasmas

Electron energy probability functions measured with a passively compensated Langmuir probe in asymmetric capacitively coupled hydrogen and deuterium plasmas exhibit structure. The otherwise relatively continuous distribution appears to have an abrupt peak in electron density near 5 eV. This structure occurs at a higher energy in deuterium than hydrogen and there is a correlation between floating potential and the voltage at which the structure is observed in the second derivative of the I(V) characteristic. While the cause of the structure has yet to be clarified, spectroscopic observations and computer-based hydrogen models indicate that the high energy tail of the distribution is strongly modulated during the radio frequency cycle. The effect of this modulation on plasma properties and probe measurements has yet to be explored. (C) 1999 American Institute of Physics. [S0003-6951(99)00819-0].

A COMPARISON OF EXPERIMENTAL AND THEORETICAL ELECTRON-ENERGY DISTRIBUTION-FUNCTIONS IN A MULTICUSP ION-SOURCE

Experimental and theoretical electron energy distribution functions (EEDFS) measured in and calculated for the driver of a multicusp ion source operating in hydrogen are compared. The results show that atomic physics based theoretical models can accurately predict the EEDF in such discharges if some appropriate experimentally determined quantities are used as input parameters. The magnitude and shape of the EEDF is found to be particularly sensitive to the effective surface area to volume ratio for electrons.

ELECTRON-ENERGY DISTRIBUTION-FUNCTIONS AND NEGATIVE-ION CONCENTRATIONS IN TANDEM AND HYBRID MULTICUSP NEGATIVE HYDROGEN-ION SOURCES

The second derivative of a Langmuir probe characteristic is used to establish the electron energy distribution function (EEDF) in both a tandem and hybrid multicusp H- ion source. Moveable probes are used to establish the spatial variation of the EEDF. The negative ion density is measured by laser induced photo-detachment. In the case of the hybrid source the EEDF consists of a cold Maxwellian in the central region of the source; the electron temperature increases with increasing discharge current (rising from 0.3 eV at 1 A to 1.2 eV at 50 A when the pressure is 0.4 Pa). A hot-electron tail exists in the EEDF of the driver region adjacent to each filament which is shown to consist of a distinct group of primary electrons at low pressure (0.08 Pa) but becomes degraded mainly through inelastic collisions at higher pressures (0.27 Pa). The tandem source, on the other hand, has a single driver region which extends throughout the central region. The primary electron confinement times are much longer so that even at the lowest pressure considered (0.07 Pa) the primaries are degraded. In both cases the measured EEDF at specific locations and values of discharge operating parameters are used to establish the rate coefficients for the processes of importance in H- production and destruction.

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.