Tuned Normalization Explains the Size of Attention Modulations

The effect of attention on firing rates varies considerably within a single cortical area. The firing rate of some neurons is greatly modulated by attention while others are hardly affected. The reason for this variability across neurons is unknown. We found that the variability in attention modulation across neurons in area MT of macaques can be well explained by variability in the strength of tuned normalization across neurons. The presence of tuned normalization also explains a striking asymmetry in attention effects within neurons: when two stimuli are in a neuron's receptive field, directing attention to the preferred stimulus modulates firing rates more than directing attention to the nonpreferred stimulus. These findings show that much of the neuron-to-neuron variability in modulation of responses by attention depends on variability in the way the neurons process multiple stimuli, rather than differences in the influence of top-down signals related to attention.

Determination of electric field at and near the focus of a cylindrical lens for applications in fluorescence microscopy

We present an explicit computable integral solution of the electric field generated at the focal region of a cylindrical lens. This representation is based on vectorial diffraction theory and further enables the computation of the system point spread function of a cylindrical lens. It is assumed that there is no back-scattering and the contribution from the evanescent field is negligible. Stationary phase approximation along with the Fresnel transmission coefficients are employed for evaluating the polarization dependent electric field components. Studies were carried out to determine the polarization effects and to calculate the system resolution. The effect of s -, p - and randomly polarized light is studied on the fixed sample (electric dipole is fixed in space). Proposed approach allows better understanding of electric field effects at the focus of a cylindrical aplanatic system. This opens up future developments in the field of fluorescence microscopy and optical imaging. (C) 2013 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution 3.0 Unported License.

MRT Letter: Experimental Verification of Vectorial Theory to Determine Field at the Geometrical Focus of a Cylindrical Lens

We provide experimental evidence supporting the vectorial theory for determining electric field at and near the geometrical focus of a cylindrical lens. This theory provides precise distribution of field and its polarization effects. Experimental results show a close match (approximate to 95% using (2)-test) with the simulation results (obtained using vectorial theory). Light-sheet generated both at low and high NA cylindrical lens shows the importance of vectorial theory for further development of light-sheet techniques. Potential applications are in planar imaging systems (such as, SPIM, IML-SPIM, imaging cytometry) and spectroscopy. Microsc. Res. Tech. 77:105-109, 2014. (c) 2014 Wiley Periodicals, Inc.

Impact of African orography and the Indian summer monsoon on the low-level Somali jet

The low-level jet (LLJ) over the Indian region, which is most prominent during the monsoon (June-September) season, has been studied with a general circulation model (GCM). The role of African orography in modulating this jet is the focus of this article. The presence o African orography intensifies the cross-equatorial flow. Contrary to previous modelling Studies we find that cross-equatorial flow occurs even in the absence of African orography, though this flow is muc weaker even when the Indian monsoon rainfall is high. However, the location of the meridional jet near the equator in the Somali region is linked to the Indian monsoon rainfall rather than to the land-sea contrast over Somalia. Also, the presence of African orography, and not the strength of the Indian monsoon, controls the vertical extent of the equatorial meridional wind. In an aqua-planet simulation, the cross-equatorial flow occurs about 30 to the west of the rainfall maximum. Thus, the longitudinal location of the equatorial Somali jet depends upon the occurrence of monsoon heating, but the vertical structure of the jet is on account of the western boundary current in the atmosphere due to the East African highlands under the influence of monsoonal heat source.

Constitutive modeling of shape memory alloy wire with non-local rate kinetics

A constitutive modeling approach for shape memory alloy (SMA) wire by taking into account the microstructural phase inhomogeneity and the associated solid-solid phase transformation kinetics is reported in this paper. The approach is applicable to general thermomechanical loading. Characterization of various scales in the non-local rate sensitive kinetics is the main focus of this paper. Design of SMA materials and actuators not only involve an optimal exploitation of the hysteresis loops during loading-unloading, but also accounts for fatigue and training cycle identifications. For a successful design of SMA integrated actuator systems, it is essential to include the microstructural inhomogeneity effects and the loading rate dependence of the martensitic evolution, since these factors play predominant role in fatigue. In the proposed formulation, the evolution of new phase is assumed according to Weibull distribution. Fourier transformation and finite difference methods are applied to arrive at the analytical form of two important scaling parameters. The ratio of these scaling parameters is of the order of 10(6) for stress-free temperature-induced transformation and 10(4) for stress-induced transformation. These scaling parameters are used in order to study the effect of microstructural variation on the thermo-mechanical force and interface driving force. It is observed that the interface driving force is significant during the evolution. Increase in the slopes of the transformation start and end regions in the stress-strain hysteresis loop is observed for mechanical loading with higher rates.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Ideal Structure of the Silver Code

The Silver code has captured a lot of attention in the recent past,because of its nice structure and fast decodability. In their recent paper, Hollanti et al. show that the Silver code forms a subset of the natural order of a particular cyclic division algebra (CDA). In this paper, the algebraic structure of this subset is characterized. It is shown that the Silver code is not an ideal in the natural order but a right ideal generated by two elements in a particular order of this CDA. The exact minimum determinant of the normalized Silver code is computed using the ideal structure of the code. The construction of Silver code is then extended to CDAs over other number fields.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Characterization of substrate UpA binding to RNase A--computer modelling and energetics approach.

In the past two decades RNase A has been the focus of diverse investigations in order to understand the nature of substrate binding and to know the mechanism of enzyme action. Although this system is reasonably well characterized from the view point of some of the binding sites, the details of interactions in the second base binding (B2) site is insufficient. Further, the nature of ligand-protein interaction is elucidated generally by studies on RNase A-substrate analog complexes (mainly with the help of X-ray crystallography). Hence, the details of interactions at atomic level arising due to substrates are inferred indirectly. In the present paper, the dinucleotide substrate UpA is fitted into the active site of RNase A Several possible substrate conformations are investigated and the binding modes have been selected based on Contact Criteria. Thus identified RNase A-UpA complexes are energy minimized in coordinate space and are analysed in terms of conformations, energetics and interactions. The best possible ligand conformations for binding to RNase A are identified by experimentally known interactions and by the energetics. Upon binding of UpA to RNase A the changes associated,with protein back bone, Side chains in general and at the binding sites in particular are described. Further, the detailed interactions between UpA and RNase A are characterized in terms of hydrogen bonds and energetics. An extensive study has helped in interpreting the diverse results obtained from a number of experiments and also in evaluating the extent of changes the protein and the substrate undergo in order to maximize their interactions.

Parallel computing concepts and methods for floquet analysis of helicopter trim and stability

Floquet analysis is widely used for small-order systems (say, order M < 100) to find trim results of control inputs and periodic responses, and stability results of damping levels and frequencies, Presently, however, it is practical neither for design applications nor for comprehensive analysis models that lead to large systems (M > 100); the run time on a sequential computer is simply prohibitive, Accordingly, a massively parallel Floquet analysis is developed with emphasis on large systems, and it is implemented on two SIMD or single-instruction, multiple-data computers with 4096 and 8192 processors, The focus of this development is a parallel shooting method with damped Newton iteration to generate trim results; the Floquet transition matrix (FTM) comes out as a byproduct, The eigenvalues and eigenvectors of the FTM are computed by a parallel QR method, and thereby stability results are generated, For illustration, flap and flap-lag stability of isolated rotors are treated by the parallel analysis and by a corresponding sequential analysis with the conventional shooting and QR methods; linear quasisteady airfoil aerodynamics and a finite-state three-dimensional wake model are used, Computational reliability is quantified by the condition numbers of the Jacobian matrices in Newton iteration, the condition numbers of the eigenvalues and the residual errors of the eigenpairs, and reliability figures are comparable in both the parallel and sequential analyses, Compared to the sequential analysis, the parallel analysis reduces the run time of large systems dramatically, and the reduction increases with increasing system order; this finding offers considerable promise for design and comprehensive-analysis applications.

Diaphragmless shock wave generators for industrial applications of shock waves

The prime focus of this study is to design a 50 mm internal diameter diaphragmless shock tube that can be used in an industrial facility for repeated loading of shock waves. The instantaneous rise in pressure and temperature of a medium can be used in a variety of industrial applications. We designed, fabricated and tested three different shock wave generators of which one system employs a highly elastic rubber membrane and the other systems use a fast acting pneumatic valve instead of conventional metal diaphragms. The valve opening speed is obtained with the help of a high speed camera. For shock generation systems with a pneumatic cylinder, it ranges from 0.325 to 1.15 m/s while it is around 8.3 m/s for the rubber membrane. Experiments are conducted using the three diaphragmless systems and the results obtained are analyzed carefully to obtain a relation between the opening speed of the valve and the amount of gas that is actually utilized in the generation of the shock wave for each system. The rubber membrane is not suitable for industrial applications because it needs to be replaced regularly and cannot withstand high driver pressures. The maximum shock Mach number obtained using the new diaphragmless system that uses the pneumatic valve is 2.125 +/- 0.2%. This system shows much promise for automation in an industrial environment.

Topology Optimization of Micromachined Structures with the Manufacturing Constraints of KOH Etching of (110) Silicon

The focus of this paper is on designing useful compliant micro-mechanisms of high-aspect-ratio which can be microfabricated by the cost-effective wet etching of (110) orientation silicon (Si) wafers. Wet etching of (110) Si imposes constraints on the geometry of the realized mechanisms because it allows only etch-through in the form of slots parallel to the wafer's flat with a certain minimum length. In this paper, we incorporate this constraint in the topology optimization and obtain compliant designs that meet the specifications on the desired motion for given input forces. Using this design technique and wet etching, we show that we can realize high-aspect-ratio compliant micro-mechanisms. For a (110) Si wafer of 250 µm thickness, the minimum length of the etch opening to get a slot is found to be 866 µm. The minimum achievable width of the slot is limited by the resolution of the lithography process and this can be a very small value. This is studied by conducting trials with different mask layouts on a (110) Si wafer. These constraints are taken care of by using a suitable design parameterization rather than by imposing the constraints explicitly. Topology optimization, as is well known, gives designs using only the essential design specifications. In this work, we show that our technique also gives manufacturable mechanism designs along with lithography mask layouts. Some designs obtained are transferred to lithography masks and mechanisms are fabricated on (110) Si wafers.

FREP: A Soft-Error Resilient Pipelined RISC Architecture

Soft error has become one of the major areas of attention with the device scaling and large scale integration. Lot of variants for superscalar architecture were proposed with focus on program re-execution, thread re-execution and instruction re-execution. In this paper we proposed a fault tolerant micro-architecture of pipelined RISC. The proposed architecture, Floating Resources Extended pipeline (FREP), re-executes the instructions using extended pipeline stages. The instructions are re-executed by hybrid architecture with a suitable combination of space and time redundancy.

Thermally induced phase separation in P alpha MSAN/PMMA blends in presence of functionalized multiwall carbon nanotubes: Rheology, morphology and electrical conductivity

The focus of this work is the evaluation and analysis of the state of dispersion of functionalized multiwall carbon nanotubes (CNTs), within different morphologies formed, in a model LCST blend (poly[(alpha-methylstyrene)-co-(acrylonitrile)]/poly(methyl-methacryla te), P alpha MSAN/PMMA). Blend compositions that are expected to yield droplet-matrix (85/15 P alpha MSAN/PMMA and 15/85 P alpha MSAN/PMMA, wt/wt) and co-continuous morphologies (60/40 P alpha MSAN/PMMA, wt/wt) upon phase separation have been combined with two types of CNTs; carboxylic acid functionalized (CNTCOOH) and polyethylene modified (CNTPE) up to 2 wt%. Thermally induced phase separation in the blends has been studied in-situ by rheology and dielectric (conductivity) spectroscopy in terms of morphological evolution and CNT percolation. The state of dispersion of CNTs has been evaluated by transmission electron microscopy. The experimental results indicate that the final blend morphology and the surface functionalization of CNT are the main factors that govern percolation. In presence of either of the CNTs, 60/40 P alpha MSAN/PMMA blends yield a droplet-matrix morphology rather than co-continuous and do not show any percolation. On the other hand, both 85/15 P alpha MSAN/PMMA and 15/85 P alpha MSAN/PMMA blends containing CNTPEs show percolation in the rheological and electrical properties. Interestingly, the conductivity spectroscopy measurements demonstrate that the 15/85 P alpha MSAN/PMMA blends with CNTPEs that show insulating properties at room temperature for the miscible blends reveal highly conducting properties in the phase separated blends (melt state) as a result of phase separation. By quenching this morphology, the conductivity can be retained in the blends even in the solid state. (C) 2011 Elsevier Ltd. All rights reserved.