Capturability of augmented proportional navigation (APN) guidance with nonlinear engagement dynamics

Proportional Navigation (PN) and its variants are widely used guidance philosophies. However, in the presence of target maneuver, PN guidance law is effective only for a restrictive set of initial geometries. To account for target maneuvers, the concept of Augmented Proportional Navigation (APN) guidance law was introduced and analyzed in a linearized interceptor-target engagement framework presented in literature. However, there is no work in the literature, that addresses the capturability performance of the APN guidance law in a nonlinear engagement framework. This paper presents such an analysis and obtains the conditions for capturability. It also shows that a shorter time of interception is obtained when APN is formulated in the nonlinear framework as proposed in this paper. Simulation results are given to support the theoretical findings.

Three dimensional PN based impact angle control for higher speed nonmaneuvering targets

Terminal impact angle control is crucial for enhancement of warhead effectiveness. In the literature, this problem has been addressed in the context of targets with lower speeds than the interceptor. However, in the current defence scenario, targets of much higher speed than the interceptor is a reality. This paper presents a generic proportional navigation (PN) based guidance law, that uses the standard PN and novel Retro-PN guidance laws based on the initial engagement geometry and terminal engagement requirements, for three dimensional engagement scenario against higher speed nonmaneuvering targets to control terminal impact angle. Results are obtained on the set of achievable impact angles and conditions on the navigation constant to achieve them. Simulation results are given to support the theoretical findings.

Variable field ion traps

This paper presents a technique to vary the electric field within a cylindrical ion trap (CIT) mass spectrometer while it is in operation. In this technique, the electrodes of the CIT are split into number of mini-electrodes and different voltages are applied to these split-electrodes to achieve the desired field. In our study we have investigated two geometries of the split-electrode CIT. In the first, we retain the flat endcap electrodes of the CIT but split the ring electrode into five mini-rings. In the second configuration, we split the ring electrode of the CIT into three mini-rings and also divide the endcaps into two mini-discs. By applying different potentials to the mini-rings and mini-discs of these geometries we have shown that the field within the trap can be optimized to desired values. In our study, two different types of fields were targeted. In the first, potentials were adjusted to obtain a linear electric field and, in the second, a controlled higher order even multipole field was obtained by adjusting the potential. We have shown that the different potentials required can be derived from a single RF generator by connecting appropriate capacitor terminations to split electrodes. The field within the trap can be modified by changing the values of the external capacitors. (C) 2013 Elsevier B.V. All rights reserved.

Sparse Recovery Methods Hold Promise for Diffuse Optical Tomographic Image Reconstruction

The sparse recovery methods utilize the l(p)-normbased regularization in the estimation problem with 0 <= p <= 1. These methods have a better utility when the number of independent measurements are limited in nature, which is a typical case for diffuse optical tomographic image reconstruction problem. These sparse recovery methods, along with an approximation to utilize the l(0)-norm, have been deployed for the reconstruction of diffuse optical images. Their performancewas compared systematically using both numerical and gelatin phantom cases to show that these methods hold promise in improving the reconstructed image quality.

Approximate Nearest Neighbour Field based Optic Disk Detection

Approximate Nearest Neighbour Field maps are commonly used by computer vision and graphics community to deal with problems like image completion, retargetting, denoising, etc. In this paper, we extend the scope of usage of ANNF maps to medical image analysis, more specifically to optic disk detection in retinal images. In the analysis of retinal images, optic disk detection plays an important role since it simplifies the segmentation of optic disk and other retinal structures. The proposed approach uses FeatureMatch, an ANNF algorithm, to find the correspondence between a chosen optic disk reference image and any given query image. This correspondence provides a distribution of patches in the query image that are closest to patches in the reference image. The likelihood map obtained from the distribution of patches in query image is used for optic disk detection. The proposed approach is evaluated on five publicly available DIARETDB0, DIARETDB1, DRIVE, STARE and MESSIDOR databases, with total of 1540 images. We show, experimentally, that our proposed approach achieves an average detection accuracy of 99% and an average computation time of 0.2 s per image. (C) 2013 Elsevier Ltd. All rights reserved.

Molecular Dynamics Perspective on the Protein Thermal Stability: A Case Study Using SAICAR Synthetase

The enzyme SAICAR synthetase ligates aspartate with CAIR (5'-phosphoribosyl-4-carboxy-5-aminoimidazole) forming SAICAR (5-amino-4-imidazole-N-succinocarboxamide ribonucleotide) in the presence of ATP. In continuation with our previous study on the thermostability of this enzyme in hyper-/thermophiles based on the structural aspects, here, we present the dynamic aspects that differentiate the mesophilic (E. coli, E. chaffeensis), thermophilic (G. kaustophilus), and hyperthermophilic (M. jannaschii, P. horikoshii) SAICAR synthetases by carrying out a total of 11 simulations. The five functional dimers from the above organisms were simulated using molecular dynamics for a period of 50 ns each at 300 K, 363 K, and an additional simulation at 333 K for the thermophilic protein. The basic features like root-mean-square deviations, root-mean-square fluctuations, surface accessibility, and radius of gyration revealed the instability of mesophiles at 363 K. Mean square displacements establish the reduced flexibility of hyper-/thermophiles at all temperatures. At the simulations time scale considered here, the long-distance networks are considerably affected in mesophilic structures at 363 K. In mesophiles, a comparatively higher number of short-lived (having less percent existence time) C alpha, hydrogen bonds, hydrophobic interactions are formed, and long-lived (with higher percentage existence time) contacts are lost. The number of time-averaged salt-bridges is at least 2-fold higher in hyperthermophiles at 363 K. The change in surface accessibility of salt-bridges at 363 K from 300 K is nearly doubled in mesophilic protein compared to proteins from other temperature classes.

H.264 COMPRESSED VIDEO CLASSIFICATION USING HISTOGRAM OF ORIENTED MOTION VECTORS (HOMV)

In this paper, we have proposed a simple and effective approach to classify H.264 compressed videos, by capturing orientation information from the motion vectors. Our major contribution involves computing Histogram of Oriented Motion Vectors (HOMV) for overlapping hierarchical Space-Time cubes. The Space-Time cubes selected are partially overlapped. HOMV is found to be very effective to define the motion characteristics of these cubes. We then use Bag of Features (B OF) approach to define the video as histogram of HOMV keywords, obtained using k-means clustering. The video feature, thus computed, is found to be very effective in classifying videos. We demonstrate our results with experiments on two large publicly available video database.

Performance metrics in a hybrid MPI-OpenMP based molecular dynamics simulation with short-range interactions

We discuss the computational bottlenecks in molecular dynamics (MD) and describe the challenges in parallelizing the computation-intensive tasks. We present a hybrid algorithm using MPI (Message Passing Interface) with OpenMP threads for parallelizing a generalized MD computation scheme for systems with short range interatomic interactions. The algorithm is discussed in the context of nano-indentation of Chromium films with carbon indenters using the Embedded Atom Method potential for Cr-Cr interaction and the Morse potential for Cr-C interactions. We study the performance of our algorithm for a range of MPI-thread combinations and find the performance to depend strongly on the computational task and load sharing in the multi-core processor. The algorithm scaled poorly with MPI and our hybrid schemes were observed to outperform the pure message passing scheme, despite utilizing the same number of processors or cores in the cluster. Speed-up achieved by our algorithm compared favorably with that achieved by standard MD packages. (C) 2013 Elsevier Inc. All rights reserved.

Elastic Resources Framework in IaaS, preserving performance SLAs

Elasticity in cloud systems provides the flexibility to acquire and relinquish computing resources on demand. However, in current virtualized systems resource allocation is mostly static. Resources are allocated during VM instantiation and any change in workload leading to significant increase or decrease in resources is handled by VM migration. Hence, cloud users tend to characterize their workloads at a coarse grained level which potentially leads to under-utilized VM resources or under performing application. A more flexible and adaptive resource allocation mechanism would benefit variable workloads, such as those characterized by web servers. In this paper, we present an elastic resources framework for IaaS cloud layer that addresses this need. The framework provisions for application workload forecasting engine, that predicts at run-time the expected demand, which is input to the resource manager to modulate resource allocation based on the predicted demand. Based on the prediction errors, resources can be over-allocated or under-allocated as compared to the actual demand made by the application. Over-allocation leads to unused resources and under allocation could cause under performance. To strike a good trade-off between over-allocation and under-performance we derive an excess cost model. In this model excess resources allocated are captured as over-allocation cost and under-allocation is captured as a penalty cost for violating application service level agreement (SLA). Confidence interval for predicted workload is used to minimize this excess cost with minimal effect on SLA violations. An example case-study for an academic institute web server workload is presented. Using the confidence interval to minimize excess cost, we achieve significant reduction in resource allocation requirement while restricting application SLA violations to below 2-3%.

Toward Real-Time Availability of 3D Temperature Maps Created with Temporally Constrained Reconstruction

PurposeTo extend the previously developed temporally constrained reconstruction (TCR) algorithm to allow for real-time availability of three-dimensional (3D) temperature maps capable of monitoring MR-guided high intensity focused ultrasound applications. MethodsA real-time TCR (RT-TCR) algorithm is developed that only uses current and previously acquired undersampled k-space data from a 3D segmented EPI pulse sequence, with the image reconstruction done in a graphics processing unit implementation to overcome computation burden. Simulated and experimental data sets of HIFU heating are used to evaluate the performance of the RT-TCR algorithm. ResultsThe simulation studies demonstrate that the RT-TCR algorithm has subsecond reconstruction time and can accurately measure HIFU-induced temperature rises of 20 degrees C in 15 s for 3D volumes of 16 slices (RMSE = 0.1 degrees C), 24 slices (RMSE = 0.2 degrees C), and 32 slices (RMSE = 0.3 degrees C). Experimental results in ex vivo porcine muscle demonstrate that the RT-TCR approach can reconstruct temperature maps with 192 x 162 x 66 mm 3D volume coverage, 1.5 x 1.5 x 3.0 mm resolution, and 1.2-s scan time with an accuracy of 0.5 degrees C. ConclusionThe RT-TCR algorithm offers an approach to obtaining large coverage 3D temperature maps in real-time for monitoring MR-guided high intensity focused ultrasound treatments. Magn Reson Med 71:1394-1404, 2014. (c) 2013 Wiley Periodicals, Inc.

Design of a Low Power 64 Point FFT Architecture for WLAN Applications

This paper presents a Radix-4(3) based FFT architecture suitable for OFDM based WLAN applications. The radix-4(3) parallel unrolled architecture presented here, uses a radix-4 butterfly unit which takes all four inputs in parallel and can selectively produce one out of the four outputs. A 64 point FFT processor based on the proposed architecture has been implemented in UMC 130nm 1P8M CMOS process with a maximum clock frequency of 100 MHz and area of 0.83mm(2). The proposed processor provides a throughput of four times the clock rate and can finish one 64 point FFT computation in 16 clock cycles. For IEEE 802.11a/g WLAN, the processor needs to be operated at a clock rate of 5 MHz with a power consumption of 2.27 mW which is 27% less than the previously reported low power implementations.

High Throughput, Low Latency, Memory Optimized 64K Point FFT Architecture using Novel Radix-4 Butterfly Unit

In this paper we propose a fully parallel 64K point radix-4(4) FFT processor. The radix-4(4) parallel unrolled architecture uses a novel radix-4 butterfly unit which takes all four inputs in parallel and can selectively produce one out of the four outputs. The radix-4(4) block can take all 256 inputs in parallel and can use the select control signals to generate one out of the 256 outputs. The resultant 64K point FFT processor shows significant reduction in intermediate memory but with increased hardware complexity. Compared to the state-of-art implementation 5], our architecture shows reduced latency with comparable throughput and area. The 64K point FFT architecture was synthesized using a 130nm CMOS technology which resulted in a throughput of 1.4 GSPS and latency of 47.7 mu s with a maximum clock frequency of 350MHz. When compared to 5], the latency is reduced by 303 mu s with 50.8% reduction in area.

Performance evaluation of typical approximation algorithms for nonconvex l(p)-minimization in diffuse optical tomography

The sparse estimation methods that utilize the l(p)-norm, with p being between 0 and 1, have shown better utility in providing optimal solutions to the inverse problem in diffuse optical tomography. These l(p)-norm-based regularizations make the optimization function nonconvex, and algorithms that implement l(p)-norm minimization utilize approximations to the original l(p)-norm function. In this work, three such typical methods for implementing the l(p)-norm were considered, namely, iteratively reweighted l(1)-minimization (IRL1), iteratively reweighted least squares (IRLS), and the iteratively thresholding method (ITM). These methods were deployed for performing diffuse optical tomographic image reconstruction, and a systematic comparison with the help of three numerical and gelatin phantom cases was executed. The results indicate that these three methods in the implementation of l(p)-minimization yields similar results, with IRL1 fairing marginally in cases considered here in terms of shape recovery and quantitative accuracy of the reconstructed diffuse optical tomographic images. (C) 2014 Optical Society of America

Conserved water-mediated recognition and dynamics of NAD(+) (carboxamide group) to hIMPDH enzyme: water mimic approach toward the design of isoform-selective inhibitor

Inosine monophosphate dehydrogenase (IMPDH) enzyme involves in GMP biosynthesis pathway. Type I hIMPDH is expressed at lower levels in all cells, whereas type II is especially observed in acute myelogenous leukemia, chronic myelogenous leukemia cancer cells, and 10 ns simulation of the IMP-NAD(+) complex structures (PDB ID. 1B3O and 1JCN) have revealed the presence of a few conserved hydrophilic centers near carboxamide group of NAD(+). Three conserved water molecules (W1, W, and W1 `) in di-nucleotide binding pocket of enzyme have played a significant role in the recognition of carboxamide group (of NAD(+)) to D274 and H93 residues. Based on H-bonding interaction of conserved hydrophilic (water molecular) centers within IMP-NAD(+)-enzyme complexes and their recognition to NAD(+), some covalent modification at carboxamide group of di-nucleotide (NAD(+)) has been made by substituting the -CONH(2)group by -CONHNH2 (carboxyl hydrazide group) using water mimic inhibitor design protocol. The modeled structure of modified ligand may, though, be useful for the development of antileukemic agent or it could be act as better inhibitor for hIMPDH-II.

Predicting gene ontology annotations of orphan GWAS genes using protein-protein interactions

Background: The number of genome-wide association studies (GWAS) has increased rapidly in the past couple of years, resulting in the identification of genes associated with different diseases. The next step in translating these findings into biomedically useful information is to find out the mechanism of the action of these genes. However, GWAS studies often implicate genes whose functions are currently unknown; for example, MYEOV, ANKLE1, TMEM45B and ORAOV1 are found to be associated with breast cancer, but their molecular function is unknown. Results: We carried out Bayesian inference of Gene Ontology (GO) term annotations of genes by employing the directed acyclic graph structure of GO and the network of protein-protein interactions (PPIs). The approach is designed based on the fact that two proteins that interact biophysically would be in physical proximity of each other, would possess complementary molecular function, and play role in related biological processes. Predicted GO terms were ranked according to their relative association scores and the approach was evaluated quantitatively by plotting the precision versus recall values and F-scores (the harmonic mean of precision and recall) versus varying thresholds. Precisions of similar to 58% and similar to 40% for localization and functions respectively of proteins were determined at a threshold of similar to 30 (top 30 GO terms in the ranked list). Comparison with function prediction based on semantic similarity among nodes in an ontology and incorporation of those similarities in a k nearest neighbor classifier confirmed that our results compared favorably. Conclusions: This approach was applied to predict the cellular component and molecular function GO terms of all human proteins that have interacting partners possessing at least one known GO annotation. The list of predictions is available at http://severus.dbmi.pitt.edu/engo/GOPRED.html. We present the algorithm, evaluations and the results of the computational predictions, especially for genes identified in GWAS studies to be associated with diseases, which are of translational interest.