Reduction of magnetostatic interactions in self-organized arrays of nickel nanowires using atomic layer deposition

Ordered arrays of magnetic nanowires are commonly synthesized by electrodeposition in nanoporous alumina templates. Due to their dense packing, strong magnetostatic interactions prevent the manipulation of wires individually. Using atomic layer deposition we reduce the diameter of the pores prior to electrodeposition. This reduces magnetostatic interactions, yielding fully remanent hysteresis loops. This is a first step towards the use of such arrays for magnetic racetrack memories

Simulations of partially coherent focal plane imaging arrays: Fisher matrix approach to performance evaluation

Focal plane arrays of bolometers are increasingly employed in astronomy at far--infrared to millimetre wavelengths. The focal plane fields and the detectors are both partially coherent in these systems, but no account has previously been taken of the effect of partial coherence on array performance. In this paper, we use our recently developed coupled--mode theory of detection together with Fisher information matrix techniques from signal processing to characterize the behaviour of partially coherent imaging arrays. We investigate the effects of the size and coherence length of both the source and the detectors, and the packing density of the array, on the amount of information that can be extracted from observations with such arrays.Comment: 14 pages, 7 figures, submitted to MNRAS 7th March 200

Development of theoretical models of integrated millimeter wave antennas

Extensive radiation patterns for Linear Tapered Slot Antenna (LTSA) Single Elements are presented. The directivity of LTSA elements is predicted correctly by taking the cross polarized pattern into account. A moment method program predicts radiation patterns for air LTSAs with excellent agreement with experimental data. A moment method program was also developed for the task LTSA Array Modeling. Computations performed with this program are in excellent agreement with published results for dipole and monopole arrays, and with waveguide simulator experiments, for more complicated structures. Empirical modeling of LTSA arrays demonstrated that the maximum theoretical element gain can be obtained. Formulations were also developed for calculating the aperture efficiency of LTSA arrays used in reflector systems. It was shown that LTSA arrays used in multibeam systems have a considerable advantage in terms of higher packing density, compared with waveguide feeds. Conversion loss of 10 dB was demonstrated at 35 GHz

Activated chemoreceptor arrays remain intact and hexagonally packed

Bacterial chemoreceptors cluster into exquisitively sensitive, tunable, highly ordered, polar arrays. While these arrays serve as paradigms of cell signalling in general, it remains unclear what conformational changes transduce signals from the periplasmic tips, where attractants and repellents bind, to the cytoplasmic signalling domains. Conflicting reports support and contest the hypothesis that activation causes large changes in the packing arrangement of the arrays, up to and including their complete disassembly. Using electron cryotomography, here we show that in Caulobacter crescentus, chemoreceptor arrays in cells grown in different media and immediately after exposure to the attractant galactose all exhibit the same 12 nm hexagonal packing arrangement, array size and other structural parameters. ΔcheB and ΔcheR mutants mimicking attractant- or repellent-bound states prior to adaptation also show the same lattice structure. We conclude that signal transduction and amplification must be accomplished through only small, nanoscale conformational changes

Decoding billions of integers per second through vectorization

In many important applications -- such as search engines and relational database systems -- data is stored in the form of arrays of integers. Encoding and, most importantly, decoding of these arrays consumes considerable CPU time. Therefore, substantial effort has been made to reduce costs associated with compression and decompression. In particular, researchers have exploited the superscalar nature of modern processors and SIMD instructions. Nevertheless, we introduce a novel vectorized scheme called SIMD-BP128 that improves over previously proposed vectorized approaches. It is nearly twice as fast as the previously fastest schemes on desktop processors (varint-G8IU and PFOR). At the same time, SIMD-BP128 saves up to 2 bits per integer. For even better compression, we propose another new vectorized scheme (SIMD-FastPFOR) that has a compression ratio within 10% of a state-of-the-art scheme (Simple-8b) while being two times faster during decoding.Comment: For software, see https://github.com/lemire/FastPFor, For data, see http://boytsov.info/datasets/clueweb09gap

Parallel Optical Random Access Memory (PORAM)

It is shown that the need to minimize component count, power and size, and to maximize packing density require a parallel optical random access memory to be designed in a two-level hierarchy: a modular level and an interconnect level. Three module designs are proposed, in the order of research and development requirements. The first uses state-of-the-art components, including individually addressed laser diode arrays, acousto-optic (AO) deflectors and magneto-optic (MO) storage medium, aimed at moderate size, moderate power, and high packing density. The next design level uses an electron-trapping (ET) medium to reduce optical power requirements. The third design uses a beam-steering grating surface emitter (GSE) array to reduce size further and minimize the number of components

Interleaving schemes for multidimensional cluster errors

We present two-dimensional and three-dimensional interleaving techniques for correcting two- and three-dimensional bursts (or clusters) of errors, where a cluster of errors is characterized by its area or volume. Correction of multidimensional error clusters is required in holographic storage, an emerging application of considerable importance. Our main contribution is the construction of efficient two-dimensional and three-dimensional interleaving schemes. The proposed schemes are based on t-interleaved arrays of integers, defined by the property that every connected component of area or volume t consists of distinct integers. In the two-dimensional case, our constructions are optimal: they have the lowest possible interleaving degree. That is, the resulting t-interleaved arrays contain the smallest possible number of distinct integers, hence minimizing the number of codewords required in an interleaving scheme. In general, we observe that the interleaving problem can be interpreted as a graph-coloring problem, and introduce the useful special class of lattice interleavers. We employ a result of Minkowski, dating back to 1904, to establish both upper and lower bounds on the interleaving degree of lattice interleavers in three dimensions. For the case t≡0 mod 6, the upper and lower bounds coincide, and the Minkowski lattice directly yields an optimal lattice interleaver. For t≠0 mod 6, we construct efficient lattice interleavers using approximations of the Minkowski lattice