Simultaneous rate-synchrony codes in populations of spiking neurons

Firing rates and synchronous firing are often simultaneously relevant signals, and they independently or cooperatively represent external sensory inputs, cognitive events, and environmental situations such as body position. However, how rates and synchrony comodulate and which aspects of inputs are effectively encoded, particularly in the presence of dynamical inputs, are unanswered questions. We examine theoretically how mixed information in dynamic mean input and noise input is represented by dynamic population firing rates and synchrony. In a subthreshold regime, amplitudes of spatially uncorrelated noise are encoded up to a fairly high input frequency, but this requires both rate and synchrony output channels. In a suprathreshold regime, means and common noise amplitudes can be simultaneously and separately encoded by rates and synchrony, respectively, but the input frequency for which this is possible has a lower limit.     

ESR and Mössbauer studies of the precipitation process of various ferrites from silicate glasses

ESR and Mössbauer studies of the precipitation process of various ferrites from silicate glasses were made to characterize the precipitation mechanism. The changes in linewidth (H _1/2) and effectiveg-value (g _eff) in the ESR spectra of the precipitation process are well explained in terms of super-exchange interaction between magnetic ions and interparticle dipolar interaction between precipitated ferrites. The precipitation tendency of spinel type ferrites from silicate glasses was found to be in the following order: NiFe₂O₄CoFe₂O₄>Fe₃O₄ZnFe₂O₄, MnFe₂O₄. The above order coincided with the order of octahedral site preference energies of divalent transition metal ions.     

Learning commutative deterministic finite state automata in polynomial time

We consider the problem of learning the commutative subclass of regular languages in the on-line model of predicting {0,1∼-valued functions from examples and reinforcements due to Littlestone [7,4]. We show that the entire class of commutative deterministic finite state automata (CDFAs) of an arbitrary alphabet sizek is predictable inO(s ^k) time with the worst case number of mistakes bounded above byO(s ^kk logs), wheres is the number of states in the target DFA. As a corollary, this result implies that the class of CDFAs is also PAC-learnable from random labeled examples in timeO(s ^k) with sample complexity, using a different class of representations. The mistake bound of our algorithm is within a polynomial, for a fixed alphabet size, of the lower boundO(s+k) we obtain by calculating the VC-dimension of the class. Our result also implies the predictability of the class of finite sets of commutative DFAs representing the finite unions of the languages accepted by the respective DFAs. Part of this work was supported by the Office of Naval Research under contract number N00014-87-K-0401 while the author was at the Department of Computer and Information Science, University of Pennsylvania, and N0014-86-K-0454 while at the Department of Computer and Information Sciences, U.C. Santa Cruz. The author’s email address is abe@IBL.CL.nec.co.jp     

A high‐performance sorting algorithm for multicore single‐instruction multiple‐data processors

Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both single‐instruction multiple‐data (SIMD) instructions and thread‐level parallelism. In this paper, we propose a new high‐performance sorting algorithm, called aligned‐access sort (AA‐sort), that exploits both the SIMD instructions and thread‐level parallelism available on today's multicore processors. Our algorithm consists of two phases, an in‐core sorting phase and an out‐of‐core merging phase. The in‐core sorting phase uses our new sorting algorithm that extends combsort to exploit SIMD instructions. The out‐of‐core algorithm is based on mergesort with our novel vectorized merging algorithm. Both phases can take advantage of SIMD instructions. The key to high performance is eliminating unaligned memory accesses that would reduce the effectiveness of SIMD instructions in both phases. We implemented and evaluated the AA‐sort on PowerPC 970MP and Cell Broadband Engine platforms. In summary, a sequential version of the AA‐sort using SIMD instructions outperformed IBM's optimized sequential sorting library by 1.8 times and bitonic mergesort using SIMD instructions by 3.3 times on PowerPC 970MP when sorting 32 million random 32‐bit integers. Also, a parallel version of AA‐sort demonstrated better scalability with increasing numbers of cores than a parallel version of bitonic mergesort on both platforms. Copyright © 2011 John Wiley & Sons, Ltd.     

Role of disorder-order transformation in consolidation of ceramics

The ordering of stacking-disordered silicon carbide prepared from the elements by high energy ball milling was investigated during sintering. A sharp increase in density in the temperature region 1700–1800°C was associated with a decrease in the disorder. Samples which had low disorder density showed a more continuous sintering behavior with temperature. Highly dense (up to 99% relative density) SiC can be obtained at 1900°C under a pressure of 70 MPa with no hold time. Similar results were observed for structurally disordered carbon with 10 at% of boron. The sintering behavior exhibited an abrupt density increase in the narrow temperature region of 1450–1600°C and was associated with disorder-order transformation.     

粉末注射成形奥氏体不锈钢的疲劳和冲击强度

本文的目的是研究粉末性能对粉末注射成形奥氏体不锈钢的力学性能(特别是疲劳和冲击强度)的影响。试样用混有聚酰氨粘结剂系的水雾化(WA)和气雾化(GA)粉末制成。注射坯在空气中脱粘，而后在不同温度、不同保温时间下真空烧结。粉末性能对烧结体的密度、显微组织和力学性能有显著影响。孔和析出物显示出Ostward时效，而孔和析出物的长大满足Lifshitz-Wagner方程。WA和GA粉末试样的疲劳极限分别约为300MPa和310MPa。它们的疲劳强度略低于常规锻材。烧结体的冲击值随密度增加线性增大。     

LaBGeO5 single crystals in glass and second-harmonic generation

Flower-shaped crystals with diameters of 100–200 μm consisting of LaBGeO₅ (LBGO) single crystals similar to petals were observed in the interior of transparent LBGO surface-crystallized glasses. Each flower-shaped crystal was radially grown from the surface of the included bubbles. A more intense second-harmonic generation was observed from the LBGO crystallized glasses with the flower-shaped LBGO single crystals compared to the samples without such crystals based on the Maker fringe technique and second-harmonic (SH) generation microscopy. The SH intensity for the flower-shaped LBGO single crystals monotonically decreased with increasing temperature up to 350 °C, less than the Curie temperature reported so far (530 °C). It is considered that the internal compressive stress induced by the difference in the thermal expansion between the LBGO single crystal and the corresponding glass affect the ferroelectric property of the flower-shaped LBGO single crystals in glass.     

Efficient distribution-free population learning of simple concepts

We consider a variant of the ‘population learning model’ proposed by Kearns and Seung [8], in which the learner is required to be ‘distribution-free’ as well as computationally efficient. A population learner receives as input hypotheses from a large population of agents and produces as output its final hypothesis. Each agent is assumed to independently obtain labeled sample for the target concept and output a hypothesis. A polynomial time population learner is said to PAC-learn a concept class, if its hypothesis is probably approximately correct whenever the population size exceeds a certain bound which is polynomial, even if the sample size for each agent is fixed at some constant. We exhibit some general population learning strategies, and some simple concept classes that can be learned by them. These strategies include the ‘supremum hypothesis finder’, the ‘minimum superset finder’ (a special case of the ‘supremum hypothesis finder’), and various voting schemes. When coupled with appropriate agent algorithms, these strategies can learn a variety of simple concept classes, such as the ‘high–low game’, conjunctions, axis-parallel rectangles and others. We give upper bounds on the required population size for each of these cases, and show that these systems can be used to obtain a speed up from the ordinary PAC-learning model [11], with appropriate choices of sample and population sizes. With the population learner restricted to be a voting scheme, what we have is effectively a model of ‘population prediction’, in which the learner is to predict the value of the target concept at an arbitrarily drawn point, as a threshold function of the predictions made by its agents on the same point. We show that the population learning model is strictly more powerful than the population prediction model. Finally, we consider a variant of this model with classification noise, and exhibit a population learner for the class of conjunctions in this model. This revised version was published online in June 2006 with corrections to the Cover Date.     

Partial redundancy elimination for access expressions by speculative code motion

We present a new memory access optimization for Java to perform aggressive code motion for speculatively optimizing memory accesses by applying partial redundancy elimination (PRE) techniques. First, to reduce as many barriers as possible and to enhance code motion, we perform alias analysis to identify all the regions in which each object reference is not aliased. Secondly, we find all the possible barriers. Finally, we perform code motions in three steps. For the first step, we apply a non‐speculative PRE algorithm to move load instructions and their following instructions in the backwards direction of the control flow graph. For the second step, we apply a speculative PRE algorithm to move some of them aggressively before the conditional branches. For the third step, we apply our modified version of a non‐speculative PRE algorithm to move store instructions in the forward direction of the control flow graph and to even move some of them after the merge points. We implemented our new algorithm in our production‐level Java just‐in‐time compiler. Our experimental results show that our speculative algorithm improves the average (maximum) performance by 13.1% (90.7%) for jBYTEmark and 1.4% (4.4%) for SPECjvm98 over the fastest algorithm previously described, while it increases the average (maximum) compilation time by 0.9% (2.9%) for both benchmark suites. Copyright © 2004 John Wiley & Sons, Ltd.     

Lysophosphatidylinositol Induced Morphological Changes and Stress Fiber Formation through the GPR55-RhoA-ROCK Pathway

We previously reported that lysophosphatidylinositol (LPI) functions as an endogenous agonist of GPR55, a novel cannabinoid receptor. However, the physiological roles of LPI-GPR55 have not yet been elucidated in detail. In the present study, we found that LPI induced morphological changes in GPR55-expressing HEK293 cells. LPI induced the cell rounding of GPR55-expressing HEK293 cells but not of empty-vector-transfected cells. LPI also induced the activation of small GTP-binding protein RhoA and increased stress fiber formation in GPR55-expressing HEK293 cells. The inhibition of RhoA and Rho kinase ROCK by the C3 exoenzyme and the ROCK inhibitor reduced LPI-induced cell rounding and stress fiber formation. These results clearly indicated that the LPI-induced morphological changes and the assembly of the cytoskeletons were mediated through the GPR55-RhoA-ROCK pathway.