The Effects of Nitrogen Bonding on Hardness of AIN/CrN Multilayer Hard Coatings

AIN/CrN multilayer hard coatings with various bilayer thicknesses were fabricated by a reactive sputtering process. The microstructural and mechanical characterizations of multilayer coatings were investigated through transmission electron microscope (TEM) observations and the hardness measurements by nano indentation. In particular, the variation of chemical bonding states of the bilayer nitrides was elucidated by near edge X-ray absorption fine structure (NEXAFS) spectroscopy. Many broken nitrogen bonds were formed by decreasing the bilayer thickness of AIN/CrN multilayer coatings. Existence of optimum AIN/CrN multilayer coatings thickness for maximum hardness could be explained by the competition of softening by the formation of broken nitrogen bonds and strengthening induced by decreasing bilayer thickness.

Inhibition of the Interaction Between NS3 Protease and HCV IRES With a Small Peptide: A Novel Therapeutic Strategy

Recently, we have demonstrated that the protease domain of NS3 alone can bind specifically to hepatitis C virus (HCV) internal ribosome entry site (IRES) near the initiator AUG, dislodges human La protein and inhibits translation in favor of viral RNA replication. Here, by using a computational approach, the contact points of the protease on the HCV IRES were putatively mapped. A 30-mer NS3 peptide was designed from the predicted RNA-binding region that retained RNA-binding ability and also inhibited IRES-mediated translation. This peptide was truncated to 15 mer and this also demonstrated ability to inhibit HCV RNA-directed translation as well as replication. More importantly, its activity was tested in an in vivo mouse model by encapsulating the peptide in Sendai virus virosomes followed by intravenous delivery. The study demonstrates for the first time that the HCV NS3-IRES RNA interaction can be selectively inhibited using a small peptide and reports a strategy to deliver the peptide into the liver.

Studies on Ultra Wideband Triangular Patch Antennas for Imaging Applications

This paper presents simulation and experimental studies on the characterization of ultra wideband antennas for imaging applications. Various configurations of antennas were simulated for their time and frequency domain characteristics with special emphasis on flat responses for group delay and gain versus frequency. Parametric studies reported here showed that locating the capacitive feed strip near the vertex of the triangle gave better response in these respects. An antenna with operating frequency from 2.9GHz to 4.1GHz was fabricated and measured.

SOLVING VOLUME INTEGRAL EQUATION USING ScaLAPACK

In this article, we investigate the performance of a volume integral equation code on BlueGene/L system. Volume integral equation (VIE) is solved for homogeneous and inhomogeneous dielectric objects for radar cross section (RCS) calculation in a highly parallel environment. Pulse basis functions and point matching technique is used to convert the volume integral equation into a set of simultaneous linear equations and is solved using parallel numerical library ScaLAPACK on IBM's distributed-memory supercomputer BlueGene/L by different number of processors to compare the speed-up and test the scalability of the code.

RCS ENHANCEMENT DUE TO BRAGG SCATTERING

With the advances of techniques for RCS reduction, it has become practical to develop aircraft which are invisible to modern day radars. In order to detect such low visible targets it is necessary to explore other phenomenon that contributes to the scattering of incident electromagnetic wave. It is well known from the developments from the clear air scattering using RASS induced acoustic wave could be used to create dielectric constant fluctuation. The scattering from these fluctuations rather than from the aircraft have been observed to enhance the RCS of clear air, under the condition when the incident EM wave is half of the acoustic wave, the condition of Bragg scattering would be met and RCS would be enhanced. For detecting low visibility targets which are at significant distance away from the main radar, inducement of EM fluctuation from acoustic source collocated with the acoustic source is infeasible. However the flow past aircraft produces acoustic disturbances around the aircraft can be exploited to detect low visibility targets. In this paper numerical simulation for RCS enhancement due to acoustic disturbances is presented. In effect, this requires the solution of scattering from 3D inhomogeneous complex shaped bodies. In this volume surface integral equation (VSIE) is used to compute the RCS from fluctuation introduced through the acoustic disturbances. Though the technique developed can be used to study the scattering from radars of any shape and acoustic disturbances of any shape. For illustrative condition, enhancement due to the Bragg scattering are shown to improve the RCS by nearly 30dB, for air synthetic sinusoidal acoustic variation profile for a spherical scattering volume

Influence limitation in multi-campaign social networks: A Shapley value based approach

We investigate the problem of influence limitation in the presence of competing campaigns in a social network. Given a negative campaign which starts propagating from a specified source and a positive/counter campaign that is initiated, after a certain time delay, to limit the the influence or spread of misinformation by the negative campaign, we are interested in finding the top k influential nodes at which the positive campaign may be triggered. This problem has numerous applications in situations such as limiting the propagation of rumor, arresting the spread of virus through inoculation, initiating a counter-campaign against malicious propaganda, etc. The influence function for the generic influence limitation problem is non-submodular. Restricted versions of the influence limitation problem, reported in the literature, assume submodularity of the influence function and do not capture the problem in a realistic setting. In this paper, we propose a novel computational approach for the influence limitation problem based on Shapley value, a solution concept in cooperative game theory. Our approach works equally effectively for both submodular and non-submodular influence functions. Experiments on standard real world social network datasets reveal that the proposed approach outperforms existing heuristics in the literature. As a non-trivial extension, we also address the problem of influence limitation in the presence of multiple competing campaigns.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Information capacity of energy harvesting sensor nodes

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over an AWGN channel and show that the capacity achieving energy management policies are related to the throughput optimal policies. We also obtain the capacity when energy conserving sleep-wake modes are supported and an achievable rate for the system with inefficiencies in energy storage.

Low complexity adaptation for channel shortening equalizers

Since the days of Digital Subscriber Links(DSL), Time Domain Equalizers(TEQ's) have been used to combat time dispersive channels in Multicarrier Systems. In this paper, we propose computationally inexpensive techniques to recompute TEQ weights in the presence of changes in the channel, especially over fast fading channels. The techniques use no extra information except the perturbation itself, and provide excellent approximations to the new TEQ weights. The proposed adaptation techniques are shown to perform admirably well for small changes in channels for OFDM systems.

On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

On the generalized degrees of freedom of the K-user symmetric MIMO Gaussian interference channel

This work derives inner and outer bounds on the generalized degrees of freedom (GDOF) of the K-user symmetric MIMO Gaussian interference channel. For the inner bound, an achievable GDOF is derived by employing a combination of treating interference as noise, zero-forcing at the receivers, interference alignment (IA), and extending the Han-Kobayashi (HK) scheme to K users, depending on the number of antennas and the INR/SNR level. An outer bound on the GDOF is derived, using a combination of the notion of cooperation and providing side information to the receivers. Several interesting conclusions are drawn from the bounds. For example, in terms of the achievable GDOF in the weak interference regime, when the number of transmit antennas (M) is equal to the number of receive antennas (N), treating interference as noise performs the same as the HK scheme and is GDOF optimal. For K >; N/M+1, a combination of the HK and IA schemes performs the best among the schemes considered. However, for N/M <; K ≤ N/M+1, the HK scheme is found to be GDOF optimal.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Distributed STBCs with full-diversity partial interference cancellation decoding

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.

Minimizing the complexity of fast sphere decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.