Bit Steering In The Minimization Of Control Memory In Microprogrammed Digital-Computers

This correspondence presents an algorithm for microprogram control memory width minimization with the bit steering technique. The necessary and sufficient conditions to detect the steerability of two mutually exclusive sets of microcommands are established. The algorithm encodes the microcommands of the sets with a bit steering common part and also extends the theory to multiple (more than two) sets of microcommands.

Structural basis for the function of anti-idiotypic antibody in immune memory

We had earlier proposed a hypothesis to explain the mechanism of perpetuation of immunological memory based on the operation of idiotypic network in the complete absence of antigen. Experimental evidences were provided for memory maintenance through anti-idiotypic antibody (Ab2) carrying the internal image of the antigen. In the present work, we describe a structural basis for such memory perpetuation by molecular modeling and structural analysis studies. A three-dimensional model of Ab2 was generated and the structure of the antigenic site on the hemagglutinin protein H of Rinderpest virus was modeled using the structural template of hemagglutinin protein of Measles virus. Our results show that a large portion of heavy chain containing the CDR regions of Ab2 resembles the domain of the hemagglutinin housing the epitope regions. The similarity demonstrates that an internal image of the H antigen is formed in Ab2, which provides a structural basis for functional mimicry demonstrated earlier. This work brings out the importance of the structural similarity between a domain of hemagglutinin protein to that of its corresponding Ab2. It provides evidence that Ab2 is indeed capable of functioning as surrogate antigen and provides support to earlier proposed relay hypothesis which has provided a mechanism for the maintenance of immunological memory.

Structural basis for the function of anti-idiotypic antibody in immune memory

We had earlier proposed a hypothesis to explain the mechanism of perpetuation of immunological memory based on the operation of idiotypic network in the complete absence of antigen. Experimental evidences were provided for memory maintenance through anti-idiotypic antibody (Ab(2)) carrying the internal image of the antigen. In the present work, we describe a structural basis for such memory perpetuation by molecular modeling and structural analysis studies. A three-dimensional model of Ab(2) was generated and the structure of the antigenic site on the hemagglutinin protein H of Rinderpest virus was modeled using the structural template of hemagglutinin protein of Measles virus. Our results show that a large portion of heavy chain containing the CDR regions of Ab(2) resembles the domain of the hemagglutinin housing the epitope regions. The similarity demonstrates that an internal image of the H antigen is formed in Ab(2), which provides a structural basis for functional mimicry demonstrated earlier. This work brings out the importance of the structural similarity between a domain of hemagglutinin protein to that of its corresponding Ab(2). It provides evidence that Ab(2) is indeed capable of functioning as surrogate antigen and provides support to earlier proposed relay hypothesis which has provided a mechanism for the maintenance of immunological memory.

A CD8(+) T cell clone specific for antigen also recognizes peptidomimics present in anti-idiotypic antibody: Implications for T cell memory

The relay hypothesis [R. Nayak, S. Mitra-Kaushik, M.S. Shaila, Perpetuation of immunological memory: a relay hypothesis, Immunology 102 (2001) 387-395] was earlier proposed to explain perpetuation of immunological memory without requiring long lived memory cells or persisting antigen. This hypothesis envisaged cycles of interaction and proliferation of complementary idiotypic B cells (Burnet cells) and anti-idiotypic B cells (Jerne cells) as the primary reason for perpetuation of immunological memory. The presence of pepti-domimics of antigen in anti-idiotypic antibody and their presentation to antigen specific T cells was postulated to be primary reason for perpetuation of T cell memory. Using a viral hemagglutinin as a model, in this work, we demonstrate the presence of peptidomimics in the variable region of ail anti-idiotypic antibody capable of functionally mimicking the antigen derived peptides. A CD8(+) CTL clone was generated against the hemagglutinin protein which specifically responds to either peptidomimic synthesizing cells or peptidomimic pulsed antigen presenting cells. Thus, it appears reasonable that a population of activated antigen specific T cells is maintained in the body by presentation of peptidomimic through Jerne cells and other antigen presenting cells long after immunization. (C) 2007 Elsevier Inc. All rights reserved.

Glassy behavior in neural network models of associative memory

Neural network models of associative memory exhibit a large number of spurious attractors of the network dynamics which are not correlated with any memory state. These spurious attractors, analogous to "glassy" local minima of the energy or free energy of a system of particles, degrade the performance of the network by trapping trajectories starting from states that are not close to one of the memory states. Different methods for reducing the adverse effects of spurious attractors are examined with emphasis on the role of synaptic asymmetry. (C) 2002 Elsevier Science B.V. All rights reserved.

Comment on path integration of a quadratic action with a generalized memory

Using the promeasure technique, we give an alternative evaluation of a path integral corresponding to a quadratic action with a generalized memory.

Comment on “path integration of a quadratic action with a generalized memory

Using the promeasure technique, we give an alternative evaluation of a path integral corresponding to a quadratic action with a generalized memory.

Structure determination and biochemical studies on Bacillus stearothermophilus E53Q serine hydroxymethyltransferase and its complexes provide insights on function and enzyme memory

Serine hydroxymethyltransferase (SHMT) belongs to the alpha-family of pyridoxal 5'-phosphate-dependent enzymes and catalyzes the reversible conversion of L-Ser and etrahydrofolate to Gly and 5,10-methylene tetrahydrofolate. 5,10-Methylene tetrahydrofolate serves as a source of one-carbon fragment in many biological processes. SHMT also catalyzes the tetrahydrofolate-independent conversion of L-allo-Thr to Gly and acetaldehyde. The crystal structure of Bacillus stearothermophilus SHMT (bsSHMT) suggested that E53 interacts with the substrate, L-Ser and etrahydrofolate. To elucidate the role of E53, it was mutated to Q and structural and biochemical studies were carried out with the mutant enzyme. The internal aldimine structure of E53QbsSHMT was similar to that of the except for significant changes at Q53, Y60 and Y61. The wild-type enzyme, carboxyl of Gly and side chain of L-Ser were in two conformations in the respective external aldimine structures. The mutant enzyme was completely inactive for tetrahydrofolate-depen dent cleavage of L-Ser, whereas there was a 1.5-fold increase in the rate of tetrahydrofolate-independent reaction with L-allo-Thr. The results obtained from these studies suggest that E53 plays an essential role in tetrahydrofolate/5-formyl tetrahydrofolate binding and in the proper positioning of C beta of L-Ser for direct attack by N5 of tetrahydrofolate. Most interestingly, the structure of the complex obtained by cocrystallization of E53QbsSHMT with Gly and 5-formyl tetrahydrofolate revealed the gem-diamine form of pyridoxal 5'-phosphate bound to Gly and active site Lys. However, density for 5-formyl tetrahydrofolate was not observed. Gly carboxylate was in a single conformation, whereas pyridoxal 5'-phosphate had two distinct conformations. The differences between the structures of this complex and Gly external aldimine suggest that the changes induced by initial binding of 5-formyl tetrahydrofolate are retained even though 5-formyl tetrahydrofolate is absent in the final structure. Spectral studies carried out with this mutant enzyme also suggest that 5-formyl tetrahydrofolate binds to the E53QbsSHMT-Gly complex forming a quinonoid intermediate and falls off within 4 h of dialysis, leaving behind the mutant enzyme in the gemdiamine form. This is the first report to provide direct evidence for enzyme memory based on the crystal structure of enzyme complexes.

Transient analysis in Al-doped barium strontium titanate thin films grown by pulsed laser deposition

Thin films of (Ba0.5Sr0.5)TiO3 (BST) with different concentrations of Al doping were grown using a pulsed laser deposition technique. dc leakage properties were studied as a function of Al doping level and compared to that of undoped BST films. With an initial Al doping level of 0.1 at. % which substitutes Ti in the lattice site, the films showed a decrease in the leakage current, however, for 1 at. % Al doping level the leakage current was found to be relatively higher. Current time measurements at elevated temperatures on 1 at. % Al doped BST films revealed space-charge transient type characteristics. A complete analysis of the transient characteristics was carried out to identify the charge transport process through variation of applied electric field and ambient temperature. The result revealed a very low mobility process comparable to ionic motion, and was found responsible for the observed feature. Calculation from ionic diffusivity and charge transport revealed a conduction process associated with an activation energy of around 1 eV. The low mobility charge carriers were identified as oxygen vacancies in motion under the application of electric field. Thus a comprehensive understanding of the charge transport process in highly acceptor doped BST was developed and it was conclusive that the excess of oxygen vacancies created by intentional Al doping give rise to space-charge transient type characteristics. © 2001 American Institute of Physics.

Variable Granularity Access Tracking Scheme for Improving the Performance of Software Transactional Memory

Software transactional memory (STM) has been proposed as a promising programming paradigm for shared memory multi-threaded programs as an alternative to conventional lock based synchronization primitives. Typical STM implementations employ a conflict detection scheme, which works with uniform access granularity, tracking shared data accesses either at word/cache line or at object level. It is well known that a single fixed access tracking granularity cannot meet the conflicting goals of reducing false conflicts without impacting concurrency adversely. A fine grained granularity while improving concurrency can have an adverse impact on performance due to lock aliasing, lock validation overheads, and additional cache pressure. On the other hand, a coarse grained granularity can impact performance due to reduced concurrency. Thus, in general, a fixed or uniform granularity access tracking (UGAT) scheme is application-unaware and rarely matches the access patterns of individual application or parts of an application, leading to sub-optimal performance for different parts of the application(s). In order to mitigate the disadvantages associated with UGAT scheme, we propose a Variable Granularity Access Tracking (VGAT) scheme in this paper. We propose a compiler based approach wherein the compiler uses inter-procedural whole program static analysis to select the access tracking granularity for different shared data structures of the application based on the application's data access pattern. We describe our prototype VGAT scheme, using TL2 as our STM implementation. Our experimental results reveal that VGAT-STM scheme can improve the application performance of STAMP benchmarks from 1.87% to up to 21.2%.

Temperature-pressure-induced solid-solid < 100 > to < 110 > reorientation in FCC metallic nanowire: a molecular dynamic study

Atomistic simulation of initial < 100 > oriented FCC Cu nanowires shows a novel coupled temperature-pressure dependent reorientation from < 100 > to < 110 > phase. A temperature-pressure-induced solid-solid < 100 > to < 110 > reorientation diagram is generated for Cu nanowire with varying cross-sectional sizes. A critical pressure is reported for Cu nanowires with varying cross-sectional sizes, above which an initial < 100 > oriented nanowire shows temperature independent reorientation into the < 110 > phase. The effect of surface stresses on the < 100 > to < 110 > reorientation is also studied. The results indicate that above a critical cross-sectional size for a given temperature-pressure, < 100 > to < 110 > reorientation is not possible. It is also reported here that for a given applied pressure, an increase in temperature is required for the < 100 > to < 110 > reorientation with increasing cross-sectional size of the nanowire. The temperature-pressure-induced solid-solid < 100 > to < 110 > reorientation diagram reported in the present paper could further be used as guidelines for controlling the reorientations/shape memory in nano-scale applications of FCC metallic nanowires.

Virtually cool ternary content addressable memory

Fast content addressable data access mechanisms have compelling applications in today's systems. Many of these exploit the powerful wildcard matching capabilities provided by ternary content addressable memories. For example, TCAM based implementations of important algorithms in data mining been developed in recent years; these achieve an an order of magnitude speedup over prevalent techniques. However, large hardware TCAMs are still prohibitively expensive in terms of power consumption and cost per bit. This has been a barrier to extending their exploitation beyond niche and special purpose systems. We propose an approach to overcome this barrier by extending the traditional virtual memory hierarchy to scale up the user visible capacity of TCAMs while mitigating the power consumption overhead. By exploiting the notion of content locality (as opposed to spatial locality), we devise a novel combination of software and hardware techniques to provide an abstraction of a large virtual ternary content addressable space. In the long run, such abstractions enable applications to disassociate considerations of spatial locality and contiguity from the way data is referenced. If successful, ideas for making content addressability a first class abstraction in computing systems can open up a radical shift in the way applications are optimized for memory locality, just as storage class memories are soon expected to shift away from the way in which applications are typically optimized for disk access locality.

Optical microscopy methods for understanding learning and memory

Structural dynamics of dendritic spines is one of the key correlative measures of synaptic plasticity for encoding short-term and long-term memory. Optical studies of structural changes in brain tissue using confocal microscopy face difficulties of scattering. This results in low signal-to-noise ratio and thus limiting the imaging depth to few tens of microns. Multiphoton microscopy (MpM) overcomes this limitation by using low-energy photons to cause localized excitation and achieve high resolution in all three dimensions. Multiple low-energy photons with longer wavelengths minimize scattering and allow access to deeper brain regions at several hundred microns. In this article, we provide a basic understanding of the physical phenomena that give MpM an edge over conventional microscopy. Further, we highlight a few of the key studies in the field of learning and memory which would not have been possible without the advent of MpM.

Generating Efficient Data Movement Code for Heterogeneous Architectures with Distributed-Memory

Programming for parallel architectures that do not have a shared address space is extremely difficult due to the need for explicit communication between memories of different compute devices. A heterogeneous system with CPUs and multiple GPUs, or a distributed-memory cluster are examples of such systems. Past works that try to automate data movement for distributed-memory architectures can lead to excessive redundant communication. In this paper, we propose an automatic data movement scheme that minimizes the volume of communication between compute devices in heterogeneous and distributed-memory systems. We show that by partitioning data dependences in a particular non-trivial way, one can generate data movement code that results in the minimum volume for a vast majority of cases. The techniques are applicable to any sequence of affine loop nests and works on top of any choice of loop transformations, parallelization, and computation placement. The data movement code generated minimizes the volume of communication for a particular configuration of these. We use a combination of powerful static analyses relying on the polyhedral compiler framework and lightweight runtime routines they generate, to build a source-to-source transformation tool that automatically generates communication code. We demonstrate that the tool is scalable and leads to substantial gains in efficiency. On a heterogeneous system, the communication volume is reduced by a factor of 11X to 83X over state-of-the-art, translating into a mean execution time speedup of 1.53X. On a distributed-memory cluster, our scheme reduces the communication volume by a factor of 1.4X to 63.5X over state-of-the-art, resulting in a mean speedup of 1.55X. In addition, our scheme yields a mean speedup of 2.19X over hand-optimized UPC codes.

A comparative study of multiple attribute tree and inverted file structures for large bibliographic files

A variety of data structures such as inverted file, multi-lists, quad tree, k-d tree, range tree, polygon tree, quintary tree, multidimensional tries, segment tree, doubly chained tree, the grid file, d-fold tree. super B-tree, Multiple Attribute Tree (MAT), etc. have been studied for multidimensional searching and related problems. Physical data base organization, which is an important application of multidimensional searching, is traditionally and mostly handled by employing inverted file. This study proposes MAT data structure for bibliographic file systems, by illustrating the superiority of MAT data structure over inverted file. Both the methods are compared in terms of preprocessing, storage and query costs. Worst-case complexity analysis of both the methods, for a partial match query, is carried out in two cases: (a) when directory resides in main memory, (b) when directory resides in secondary memory. In both cases, MAT data structure is shown to be more efficient than the inverted file method. Arguments are given to illustrate the superiority of MAT data structure in an average case also. An efficient adaptation of MAT data structure, that exploits the special features of MAT structure and bibliographic files, is proposed for bibliographic file systems. In this adaptation, suitable techniques for fixing and ranking of the attributes for MAT data structure are proposed. Conclusions and proposals for future research are presented.