Encoding of mixtures in a simple olfactory system

Natural odors are usually mixtures; yet, humans and animals can experience them as unitary percepts. Olfaction also enables stimulus categorization and generalization. We studied how these computations are performed with the responses of 168 locust antennal lobe projection neurons (PNs) to varying mixtures of two monomolecular odors, and of 174 PNs and 209 mushroom body Kenyon cells (KCs) to mixtures of up to eight monomolecular odors. Single-PN responses showed strong hypoadditivity and population trajectories clustered by odor concentration and mixture similarity. KC responses were much sparser on average than those of PNs and often signaled the presence of single components in mixtures. Linear classifiers could read out the responses of both populations in single time bins to perform odor identification, categorization, and generalization. Our results suggest that odor representations in the mushroom body may result from competing optimization constraints to facilitate memorization (sparseness) while enabling identification, classification, and generalization

Low-rank optimization with trace norm penalty

The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges superlinearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression. © 2013 Society for Industrial and Applied Mathematics.

Static analysis of Euler-Bernoulli beams with multiple unilateral cracks under combined axial and transverse loads

The paper deals with the static analysis of pre-damaged Euler-Bernoulli beams with any number of unilateral cracks and subjected to tensile or compression forces combined with arbitrary transverse loads. The mathematical representation of cracks with a bilateral behaviour (i.e. always open) via Dirac delta functions is extended by introducing a convenient switching variable, which allows each crack to be open or closed depending on the sign of the axial strain at the crack centre. The proposed model leads to analytical solutions, which depend on four integration constants (to be computed by enforcing the boundary conditions) along with the Boolean switching variables associated with the cracks (whose role is to turn on and off the additional flexibility due to the presence of the cracks). An efficient computational procedure is also presented and numerically validated. For this purpose, the proposed approach is applied to two pre-damaged beams, with different damage and loading conditions, and the results so obtained are compared against those given by a standard finite element code (in which the correct opening of the cracks is pre-assigned), always showing a perfect agreement. © 2013 Elsevier Ltd. All rights reserved.

Joint experimental and numerical approach to three-dimensional shock control bump research

Previous studies of transonic shock control bumps have often been either numerical or experimental. Comparisons between the two have been hampered by the limitations of either approach. The present work aims to bridge the gap between computational fluid dynamics and experiment by planning a joint approach from the outset. This enables high-quality validation data to be produced and ensures that the conclusions of either aspect of the study are directly relevant to the application. Experiments conducted with bumps mounted on the floor of a blowdown tunnel were modified to include an additional postshock adverse pressure gradient through the use of a diffuser as well as introducing boundary-layer suction ahead of the test section to enable the in-flow boundary layer to be manipulated. This has the advantage of being an inexpensive and highly repeatable method. Computations were performed on a standard airfoil model, with the flight conditions as free parameters. The experimental and computational setups were then tuned to produce baseline conditions that agree well, enabling confidence that the experimental conclusions are relevant. The methods are then applied to two different shock control bumps: a smoothly contoured bump, representative of previous studies, and a novel extended geometry featuring a continuously widening tail, which spans the wind-tunnel width at the rear of the bump. Comparison between the computational and experimental results for the contour bump showed good agreement both with respect to the flow structures and quantitative analysis of the boundary-layer parameters. It was seen that combining the experimental and numerical data could provide valuable insight into the flow physics, which would not generally be possible for a one-sided approach. The experiments and computational fluid dynamics were also seen to agree well for the extended bump geometry, providing evidence that, even though thebumpinteracts directly with the wind-tunnel walls, it was still possible to observe the key flow physics. The joint approach is thus suitable even for wider bump geometries. Copyright © 2013 by S. P. Colliss, H. Babinsky, K. Nubler, and T. Lutz. Published by the American Institute of Aeronautics and Astronautics, Inc.

Compact Reconfigurable Binary-Decision-Diagram Logic Circuit on a GaAs Nanowire Network

We describe a reconfigurable binary-decision-diagram logic circuit based on Shannon's expansion of Boolean logic function and its graphical representation on a semiconductor nanowire network. The circuit is reconfigured by using programmable switches that electrically connect and disconnect a small number of branches. This circuit has a compact structure with a small number of devices compared with the conventional look-up table architecture. A variable Boolean logic circuit was fabricated on an etched GaAs nanowire network having hexagonal topology with Schottky wrap gates and SiN-based programmable switches, and its correct logic operation together with dynamic reconfiguration was demonstrated.

Mathematical symbols and computing methods in high dimensional biomimetic informatics and their applications

High dimensional biomimetic informatics (HDBI) is a novel theory of informatics developed in recent years. Its primary object of research is points in high dimensional Euclidean space, and its exploratory and resolving procedures are based on simple geometric computations. However, the mathematical descriptions and computing of geometric objects are inconvenient because of the characters of geometry. With the increase of the dimension and the multiformity of geometric objects, these descriptions are more complicated and prolix especially in high dimensional space. In this paper, we give some definitions and mathematical symbols, and discuss some symbolic computing methods in high dimensional space systematically from the viewpoint of HDBI. With these methods, some multi-variables problems in high dimensional space can be solved easily. Three detailed algorithms are presented as examples to show the efficiency of our symbolic computing methods: the algorithm for judging the center of a circle given three points on this circle, the algorithm for judging whether two points are on the same side of a hyperplane, and the algorithm for judging whether a point is in a simplex constructed by points in high dimensional space. Two experiments in blurred image restoration and uneven lighting image correction are presented for all these algorithms to show their good behaviors.

Compact universal logic gates realized using quantization of current in nanodevices

This paper proposes novel universal logic gates using the current quantization characteristics of nanodevices. In nanodevices like the electron waveguide (EW) and single-electron (SE) turnstile, the channel current is a staircase quantized function of its control voltage. We use this unique characteristic to compactly realize Boolean functions. First we present the concept of the periodic-threshold threshold logic gate (PTTG), and we build a compact PTTG using EW and SE turnstiles. We show that an arbitrary three-input Boolean function can be realized with a single PTTG, and an arbitrary four-input Boolean function can be realized by using two PTTGs. We then use one PTTG to build a universal programmable two-input logic gate which can be used to realize all two-input Boolean functions. We also build a programmable three-input logic gate by using one PTTG. Compared with linear threshold logic gates, with the PTTG one can build digital circuits more compactly. The proposed PTTGs are promising for future smart nanoscale digital system use.

High dimensional imagery geometry and it's applications

Because of information digitalization and the correspondence of digits and the coordinates, Information Science and high-dimensional space have consanguineous relations. With the transforming from the information issues to the point analysis in high-dimensional space, we proposed a novel computational theory, named High dimensional imagery geometry (HDIG). Some computational algorithms of HDIG have been realized using software, and how to combine with groups of simple operators in some 2D planes to implement the geometrical computations in high-dimensional space is demonstrated in this paper. As the applications, two kinds of experiments of HDIG, which are blurred image restoration and pattern recognition ones, are given, and the results are satisfying.

Electron resonant tunneling through InAs/GaAs quantum dots embedded in a Schottky diode with an AlAs insertion layer

Molecular beam epitaxy was employed to manufacture self-assembled InAs/GaAs quantum dot Schottky resonant tunneling diodes. By virtue of a thin AlAs insertion barrier, the thermal current was effectively reduced and electron resonant tunneling through quantum dots under both forward and reverse biased conditions was observed at relatively high temperature of 77 K. The ground states of quantum dots were found to be at similar to 0.19 eV below the conduction band of GaAs matrix. The theoretical computations were in conformity with experimental data. (c) 2006 The Electrochemical Society.

Computational information geometry and its applications

Digitization is the main feature of modern Information Science. Conjoining the digits and the coordinates, the relation between Information Science and high-dimensional space is consanguineous, and the information issues are transformed to the geometry problems in some high-dimensional spaces. From this basic idea, we propose Computational Information Geometry (CIG) to make information analysis and processing. Two kinds of applications of CIG are given, which are blurred image restoration and pattern recognition. Experimental results are satisfying. And in this paper, how to combine with groups of simple operators in some 2D planes to implement the geometrical computations in high-dimensional space is also introduced. Lots of the algorithms have been realized using software.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

on string languages generated by spiking neural p systems

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.

on quadratic bent functions in polynomial forms

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006.