Ultrasound-modulated optical tomography: recovery of amplitude of vibration in the insonified region from boundary measurement of light correlation

We address a certain inverse problem in ultrasound-modulated optical tomography: the recovery of the amplitude of vibration of scatterers [p(r)] in the ultrasound focal volume in a diffusive object from boundary measurement of the modulation depth (M) of the amplitude autocorrelation of light [phi(r, tau)] traversing through it. Since M is dependent on the stiffness of the material, this is the precursor to elasticity imaging. The propagation of phi(r, tau) is described by a diffusion equation from which we have derived a nonlinear perturbation equation connecting p(r) and refractive index modulation [Delta n(r)] in the region of interest to M measured on the boundary. The nonlinear perturbation equation and its approximate linear counterpart are solved for the recovery of p(r). The numerical results reveal regions of different stiffness, proving that the present method recovers p(r) with reasonable quantitative accuracy and spatial resolution. (C) 2011 Optical Society of America

Novel Pentameric Structure of the Diarrhea-Inducing Region of the Rotavirus Enterotoxigenic Protein NSP4

A novel pentameric structure which differs from the previously reported tetrameric form of the diarrhea-inducing region of the rotavirus enterotoxin NSP4 is reported here. A significant feature of this pentameric form is the absence of the calcium ion located in the core region of the tetrameric structures. The lysis of cells, the crystallization of the region spanning residues 95 to 146 of NSP4 (NSP4(95-146)) of strain ST3 (ST3: NSP4(95-146)) at acidic pH, and comparative studies of the recombinant purified peptide under different conditions by size-exclusion chromatography (SEC) and of the crystal structures suggested pH-, Ca(2+)-, and protein concentration-dependent oligomeric transitions in the peptide. Since the NSP4(95-146) mutant lacks the N-terminal amphipathic domain (AD) and most of the C-terminal flexible region (FR), to demonstrate that the pentameric transition is not a consequence of the lack of the N- and C-terminal regions, glutaraldehyde cross-linking of the Delta N72 and Delta N94 mutant proteins, which contain or lack the AD, respectively, but possess the complete C-terminal FR, was carried out. The results indicate the presence of pentamers in preparations of these longer mutants. Detailed SEC analyses of Delta N94 prepared under different conditions, however, revealed protein concentration-dependent but metal ion-and pH-independent pentamer accumulation at high concentrations which dissociated into tetramers and lower oligomers at low protein concentrations. While calcium appeared to stabilize the tetramer, magnesium in particular stabilized the dimer. Delta N72 existed primarily in the multimeric form under all conditions. These findings of a calcium-free NSP4 pentamer and its concentration-dependent and largely calcium-independent oligomeric transitions open up a new dimension in an understanding of the structural basis of its multitude of functions.

Swarm intelligence algorithms for integrated optimization of piezoelectric actuator and sensor placement and feedback gains

Swarm intelligence algorithms are applied for optimal control of flexible smart structures bonded with piezoelectric actuators and sensors. The optimal locations of actuators/sensors and feedback gain are obtained by maximizing the energy dissipated by the feedback control system. We provide a mathematical proof that this system is uncontrollable if the actuators and sensors are placed at the nodal points of the mode shapes. The optimal locations of actuators/sensors and feedback gain represent a constrained non-linear optimization problem. This problem is converted to an unconstrained optimization problem by using penalty functions. Two swarm intelligence algorithms, namely, Artificial bee colony (ABC) and glowworm swarm optimization (GSO) algorithms, are considered to obtain the optimal solution. In earlier published research, a cantilever beam with one and two collocated actuator(s)/sensor(s) was considered and the numerical results were obtained by using genetic algorithm and gradient based optimization methods. We consider the same problem and present the results obtained by using the swarm intelligence algorithms ABC and GSO. An extension of this cantilever beam problem with five collocated actuators/sensors is considered and the numerical results obtained by using the ABC and GSO algorithms are presented. The effect of increasing the number of design variables (locations of actuators and sensors and gain) on the optimization process is investigated. It is shown that the ABC and GSO algorithms are robust and are good choices for the optimization of smart structures.

Ultrasound modulated optical tomography: Young's modulus of the insonified region from measurement of natural frequency of vibration

We demonstrate a method to recover the Young's modulus (E) of a tissue-mimicking phantom from measurements of ultrasound modulated optical tomography (UMOT). The object is insonified by a dualbeam, confocal ultrasound transducer (US) oscillating at frequencies f(0) and f(0) + Delta f and the variation of modulation depth (M) in the autocorrelation of light traversed through the focal region of the US transducer against Delta f is measured. From the dominant peaks observed in the above variation, the natural frequencies of the insonified region associated with the vibration along the US transducer axis are deduced. A consequence of the above resonance is that the speckle fluctuation at the resonance frequency has a higher signal-to-noise to ratio (SNR). From these natural frequencies and the associated eigenspectrum of the oscillating object, Young's modulus (E) of the material in the focal region is recovered. The working of this method is confirmed by recovering E in the case of three tissue-mimicking phantoms of different elastic modulus values. (C) 2011 Optical Society of America

Interference Alignment Algorithms for the K User Constant MIMO Interference Channel

This paper considers the degrees of freedom (DOF) for a K user multiple-input multiple-output (MIMO) M x N interference channel using interference alignment (IA). A new performance metric for evaluating the efficacy of IA algorithms is proposed, which measures the extent to which the desired signal dimensionality is preserved after zero-forcing the interference at the receiver. Inspired by the metric, two algorithms are proposed for designing the linear precoders and receive filters for IA in the constant MIMO interference channel with a finite number of symbol extensions. The first algorithm uses an eigenbeamforming method to align sub-streams of the interference to reduce the dimensionality of the interference at all the receivers. The second algorithm is iterative, and is based on minimizing the interference leakage power while preserving the dimensionality of the desired signal space at the intended receivers. The improved performance of the algorithms is illustrated by comparing them with existing algorithms for IA using Monte Carlo simulations.

Discrete control algorithms for a tubular ammonia reactor

The specific objective of this paper is to develop direct digital control strategies for an ammonia reactor using quadratic regulator theory and compare the performance of the resultant control system with that under conventional PID regulators. The controller design studies are based on a ninth order state-space model obtained from the exact nonlinear distributed model using linearization and lumping approximations. The evaluation of these controllers with reference to their disturbance rejection capabilities and transient response characteristics, is carried out using hybrid computer simulation.

Fast Robust Pattern Classification Algorithms for Real Time Neuro-Motor Prosthetic Applications

In this paper, we give a brief review of pattern classification algorithms based on discriminant analysis. We then apply these algorithms to classify movement direction based on multivariate local field potentials recorded from a microelectrode array in the primary motor cortex of a monkey performing a reaching task. We obtain prediction accuracies between 55% and 90% using different methods which are significantly above the chance level of 12.5%.

Prototype learning methods for online handwriting recognition

In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of the training samples of a given class are used to select prototypes. In the second method, cumulative distance to allographs of different orientation is used as a criterion to decide if the sample is representative of the group. The latter method is presumed to offset the possible orientation effect. This method still uses fixed number of prototypes for each of the classes. Finally, a prototype set growing algorithm is proposed, with a view to better model the differences in complexity of different character classes. The proposed algorithms are tested and compared for both writer independent and writer adaptation scenarios.

Determinant: Old algorithms, new insights (Extended Abstract)

In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial, in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations, and show that they tally with well-known algorithms arrived at independently from considerations in linear algebra.

Tamarind orchards: Agroforestry for dry lands

Agroforestry has a potential for sequestering as much carbon if not more than forests. Massive benefits can be channeled to small farmers and landless labourers through cultivation of Tamarind and other fast growing and fruit yielding trees. This paper describes a project started by small farmers and landless labourers in a semiarid areas of south India. The aim is to upgrade dryland holdings of the member families through economically sound dry land horticulture, community woodlots, and planting of fast growing species along orchard and field boundaries. The small farmers invest massive labour inputs and project gives economic benefits to change their land use practices and improve environmental quality. This paper describes the planning. processes of the project, hurdles in finding AIJ partners, current monitoring procedures and costs of C sequestration. This shows this project is economically viable on its own, but initially needed, and continues to need Carbon credit investment in order to spread rapidly across the geopolitical region covered by the organization. It argues that economic gains to small farmers and landless labourers are the most certain way of achieving massive biomass increase and soil carbon replenishment, and that multiple holistic benefits are achieved through this kind of project.

Synthesis of configurable architectures for DSP algorithms

ASICs offer the best realization of DSP algorithms in terms of performance, but the cost is prohibitive, especially when the volumes involved are low. However, if the architecture synthesis trajectory for such algorithms is such that the target architecture can be identified as an interconnection of elementary parameterized computational structures, then it is possible to attain a close match, both in terms of performance and power with respect to an ASIC, for any algorithmic parameters of the given algorithm. Such an architecture is weakly programmable (configurable) and can be viewed as an application specific instruction-set processor (ASIP). In this work, we present a methodology to synthesize ASIPs for DSP algorithms.

Performance evaluation of neural network algorithms for multisensor data fusion in an airborne track while scan radar

This paper deals with the solution to the problem of multisensor data fusion for a single target scenario as detected by an airborne track-while-scan radar. The details of a neural network implementation, various training algorithms based on standard backpropagation, and the results of training and testing the neural network are presented. The promising capabilities of RPROP algorithm for multisensor data fusion for various parameters are shown in comparison to other adaptive techniques

A unified view of the Apriori-based algorithms for frequent episode discovery

Frequent episode discovery framework is a popular framework in temporal data mining with many applications. Over the years, many different notions of frequencies of episodes have been proposed along with different algorithms for episode discovery. In this paper, we present a unified view of all the apriori-based discoverymethods for serial episodes under these different notions of frequencies. Specifically, we present a unified view of the various frequency counting algorithms. We propose a generic counting algorithm such that all current algorithms are special cases of it. This unified view allows one to gain insights into different frequencies, and we present quantitative relationships among different frequencies.Our unified view also helps in obtaining correctness proofs for various counting algorithms as we show here. It also aids in understanding and obtaining the anti-monotonicity properties satisfied by the various frequencies, the properties exploited by the candidate generation step of any apriori-based method. We also point out how our unified view of counting helps to consider generalization of the algorithm to count episodes with general partial orders.

Fast algorithms for frequent episode discovery in event sequences

In this paper we consider the process of discovering frequent episodes in event sequences. The most computationally intensive part of this process is that of counting the frequencies of a set of candidate episodes. We present two new frequency counting algorithms for speeding up this part. These, referred to as non-overlapping and non-inteleaved frequency counts, are based on directly counting suitable subsets of the occurrences of an episode. Hence they are different from the frequency counts of Mannila et al [1], where they count the number of windows in which the episode occurs. Our new frequency counts offer a speed-up factor of 7 or more on real and synthetic datasets. We also show how the new frequency counts can be used when the events in episodes have time-durations as well.