Trans-saccadic processing of visual and motor planning during sequential eye movements

How the brain maintains perceptual continuity across eye movements that yield discontinuous snapshots of the world is still poorly understood. In this study, we adapted a framework from the dual-task paradigm, well suited to reveal bottlenecks in mental processing, to study how information is processed across sequential saccades. The pattern of RTs allowed us to distinguish among three forms of trans-saccadic processing (no trans-saccadic processing, trans-saccadic visual processing and trans-saccadic visual processing and saccade planning models). Using a cued double-step saccade task, we show that even though saccade execution is a processing bottleneck, limiting access to incoming visual information, partial visual and motor processing that occur prior to saccade execution is used to guide the next eye movement. These results provide insights into how the oculomotor system is designed to process information across multiple fixations that occur during natural scanning.

Wavelet transform analysis of truncated fringe patterns in 3-D surface profilometry

Wavelet transform analysis of projected fringe pattern for phase recovery in 3-D shape measurement of objects is investigated. The present communication specifically outlines and evaluates the errors that creep in to the reconstructed profiles when fringe images do not satisfy periodicity. Three specific cases that give raise to non-periodicity of fringe image are simulated and leakage effects caused by each one of them are analyzed with continuous complex Morlet wavelet transform. Same images are analyzed with FFT method to make a comparison of the reconstructed profiles with both methods. Simulation results revealed a significant advantage of wavelet transform profilometry (WTP), that the distortions that arise due to leakage are confined to the locations of discontinuity and do not spread out over the entire projection as in the case of Fourier transform profilometry (FTP).

Efficient sequential assignments in proteins with reduced dimensionality 3D HN(CA)NH

We present reduced dimensionality (RD) 3D HN(CA)NH for efficient sequential assignment in proteins. The experiment correlates the N-15 and H-1 chemical shift of a residue ('i') with those of its immediate N-terminal (i - 1) and C-terminal (i + 1) neighbors and provides four-dimensional chemical shift correlations rapidly with high resolution. An assignment strategy is presented which combines the correlations observed in this experiment with amino acid type information obtained from 3D CBCA(CO)NH. By classifying the 20 amino acid types into seven distinct categories based on C-13(beta) chemical shifts, it is observed that a stretch of five sequentially connected residues is sufficient to map uniquely on to the polypeptide for sequence specific resonance assignments. This method is exemplified by application to three different systems: maltose binding protein (42 kDa), intrinsically disordered domain of insulin-like growth factor binding protein-2 and Ubiquitin. Fast data acquisition is demonstrated using longitudinal H-1 relaxation optimization. Overall, 3D HN(CA)NH is a powerful tool for high throughput resonance assignment, in particular for unfolded or intrinsically disordered polypeptides.

Studying the resistivity imaging of chicken tissue phantoms with different current patterns in Electrical Impedance Tomography (EIT)

A current injection pattern in Electrical Impedance Tomography (EIT) has its own current distribution profile within the domain under test. Hence, different current patterns have different sensitivity, spatial resolution and distinguishability. Image reconstruction studies with practical phantoms are essential to assess the performance of EIT systems for their validation, calibration and comparison purposes. Impedance imaging of real tissue phantoms with different current injection methods is also essential for better assessment of the biomedical EIT systems. Chicken tissue paste phantoms and chicken tissue block phantoms are developed and the resistivity image reconstruction is studied with different current injection methods. A 16-electrode array is placed inside the phantom tank and the tank is filled with chicken muscle tissue paste or chicken tissue blocks as the background mediums. Chicken fat tissue, chicken bone, air hole and nylon cylinders are used as the inhomogeneity to obtained different phantom configurations. A low magnitude low frequency constant sinusoidal current is injected at the phantom boundary with opposite and neighboring current patterns and the boundary potentials are measured. Resistivity images are reconstructed from the boundary data using EIDORS and the reconstructed images are analyzed with the contrast parameters calculated from their elemental resistivity profiles. Results show that the resistivity profiles of all the phantom domains are successfully reconstructed with a proper background resistivity and high inhomogeneity resistivity for both the current injection methods. Reconstructed images show that, for all the chicken tissue phantoms, the inhomogeneities are suitably reconstructed with both the current injection protocols though the chicken tissue block phantom and opposite method are found more suitable. It is observed that the boundary potentials of the chicken tissue block phantoms are higher than the chicken tissue paste phantom. SNR of the chicken tissue block phantoms are found comparatively more and hence the chicken tissue block phantom is found more suitable for its lower noise performance. The background noise is found less in opposite method for all the phantom configurations which yields the better resistivity images with high PCR and COC and proper IRMean and IRMax neighboring method showed higher noise level for both the chicken tissue paste phantoms and chicken tissue block phantoms with all the inhomogeneities. Opposite method is found more suitable for both the chicken tissue phantoms, and also, chicken tissue block phantoms are found more suitable compared to the chicken tissue paste phantom. (C) 2012 Elsevier Ltd. All rights reserved.

Reduced dimensionality 3D HNCAN for unambiguous HN, CA and N assignment in proteins

We present here an improvisation of HNN (Panchal, Bhavesh et al., 2001) called RD 3D HNCAN for backbone (HN, CA and N-15) assignment in both folded and unfolded proteins. This is a reduced dimensionality experiment which employs CA chemical shifts to improve dispersion. Distinct positive and negative peak patterns of various triplet segments along the polypeptide chain observed in HNN are retained and these provide start and check points for the sequential walk. Because of co-incrementing of CA and N-15, peaks along one of the dimensions appear at sums and differences of the CA and N-15 chemical shifts. This changes the backbone assignment protocol slightly and we present this in explicit detail. The performance of the experiment has been demonstrated using Ubiquitin and Plasmodium falciparum P2 proteins. The experiment is particularly valuable when two neighboring amino acid residues have nearly identical backbone N-15 chemical shifts. (C) 2012 Elsevier Inc. All rights reserved.

Distinct and Contrasting Transcription Initiation Patterns at Mycobacterium tuberculosis Promoters

Although sequencing of Mycobacterium tuberculosis genome lead to better understanding of transcription units and gene functions, interactions occurring during transcription initiation between RNA polymerase and promoters is yet to be elucidated. Different stages of transcription initiation include promoter specific binding of RNAP, isomerization, abortive initiation and promoter clearance. We have now analyzed these events with four promoters of M. tuberculosis viz. P-gyrB1, P-gyrR, P-rrnPCL1 and P-metU. The promoters differed from each other in their rates of open complex formation, decay, promoter clearance and abortive transcription. The equilibrium binding and kinetic studies of various steps revealed distinct rate limiting events for each of the promoter, which also differed markedly in their characteristics from the respective promoters of Mycobacterium smegmatis. Surprisingly, the transcription at gyr promoter was enhanced in the presence of initiating nucleotides and decreased in the presence of alarmone, pppGpp, a pattern typically seen with rRNA promoters studied so far. The gyr promoter of M. smegmatis, on the other hand, was not subjected to pppGpp mediated regulation. The marked differences in the transcription initiation pathway seen with rrn and gyr promoters of M. smegmatis and M. tuberculosis suggest that such species specific differences in the regulation of expression of the crucial housekeeping genes could be one of the key determinants contributing to the differences in growth rate and lifestyle of the two organisms. Moreover, the distinct rate limiting steps during transcription initiation of each one of the promoters studied point at variations in their intracellular regulation.

Active Sequential Hypothesis Testing with Application to a Visual Search Problem

We consider a visual search problem studied by Sripati and Olson where the objective is to identify an oddball image embedded among multiple distractor images as quickly as possible. We model this visual search task as an active sequential hypothesis testing problem (ASHT problem). Chernoff in 1959 proposed a policy in which the expected delay to decision is asymptotically optimal. The asymptotics is under vanishing error probabilities. We first prove a stronger property on the moments of the delay until a decision, under the same asymptotics. Applying the result to the visual search problem, we then propose a ``neuronal metric'' on the measured neuronal responses that captures the discriminability between images. From empirical study we obtain a remarkable correlation (r = 0.90) between the proposed neuronal metric and speed of discrimination between the images. Although this correlation is lower than with the L-1 metric used by Sripati and Olson, this metric has the advantage of being firmly grounded in formal decision theory.

Solid State and Solution Mediated Multistep Sequential Transformations in Metal-Organic Coordination Networks

Sequential transformation in a family of metal-organic framework compounds has been investigated employing both a solid-state as well as a solution mediated route. The compounds, cobalt oxy-bis(benzoate) and manganese oxybis(benzoate) having a two-dimensional structure, were reacted with bipyridine forming cobalt oxy-bis(benzoate)-4,4'-bipyridine and manganese oxy-bis(benzoate)-4,4'-bipyridine, respectively. The bipyridine containing compounds appear to form sequentially through stable intermediates. For the cobalt system, the transformation from a two-dimensional compound, Co(H2O)(2)(OBA)] (OBA = 4,4'-oxy-bis(benzoate)), I, to two different three-dimensional compounds, Co(bpy)(OBA)]center dot bpy, II, (bpy = 4,4'-bipyridine) and Co(bpy)(0.5)(OBA)], III, and reversibility between II and III have been investigated. In the manganese system, transformation from a two-dimensional compound, Mn(H2O)(2)(OBA)], Ia, to two different three-dimensional compounds, Mn (bpy)(OBA)]center dot bpy, Ha and Ha to Mn(bpy)(0.5)(OBA)], Ilia, has been investigated. It has also been possible to identify intermediate products during these transformation reactions. The possible pathways for the formation of the compounds were postulated.

A sequential dual method for structural SVMs

In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to compu- tational biology or computer vision and have been tackled using algorithms, referred to as structured output learning algorithms. We consider the problem of structured classifi- cation. In the last few years, large margin classifiers like sup-port vector machines (SVMs) have shown much promise for structured output learning. The related optimization prob -lem is a convex quadratic program (QP) with a large num-ber of constraints, which makes the problem intractable for large data sets. This paper proposes a fast sequential dual method (SDM) for structural SVMs. The method makes re-peated passes over the training set and optimizes the dual variables associated with one example at a time. The use of additional heuristics makes the proposed method more efficient. We present an extensive empirical evaluation of the proposed method on several sequence learning problems.Our experiments on large data sets demonstrate that the proposed method is an order of magnitude faster than state of the art methods like cutting-plane method and stochastic gradient descent method (SGD). Further, SDM reaches steady state generalization performance faster than the SGD method. The proposed SDM is thus a useful alternative for large scale structured output learning.

Novel algorithms for distributed sequential hypothesis testing

This paper considers sequential hypothesis testing in a decentralized framework. We start with two simple decentralized sequential hypothesis testing algorithms. One of which is later proved to be asymptotically Bayes optimal. We also consider composite versions of decentralized sequential hypothesis testing. A novel nonparametric version for decentralized sequential hypothesis testing using universal source coding theory is developed. Finally we design a simple decentralized multihypothesis sequential detection algorithm.

Cooperative distributed sequential spectrum sensing

We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.

A novel algorithm for cooperative distributed sequential spectrum sensing in Cognitive Radio

This paper considers cooperative spectrum sensing in Cognitive Radios. In our previous work we have developed DualSPRT, a distributed algorithm for cooperative spectrum sensing using Sequential Probability Ratio Test (SPRT) at the Cognitive Radios as well as at the fusion center. This algorithm works well, but is not optimal. In this paper we propose an improved algorithm- SPRT-CSPRT, which is motivated from Cumulative Sum Procedures (CUSUM). We analyse it theoretically. We also modify this algorithm to handle uncertainties in SNR's and fading.

Cooperative distributed sequential spectrum sensing

We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.