A Kushner-Stratonovich Monte Carlo filter applied to nonlinear dynamical system identification

A Monte Carlo filter, based on the idea of averaging over characteristics and fashioned after a particle-based time-discretized approximation to the Kushner-Stratonovich (KS) nonlinear filtering equation, is proposed. A key aspect of the new filter is the gain-like additive update, designed to approximate the innovation integral in the KS equation and implemented through an annealing-type iterative procedure, which is aimed at rendering the innovation (observation prediction mismatch) for a given time-step to a zero-mean Brownian increment corresponding to the measurement noise. This may be contrasted with the weight-based multiplicative updates in most particle filters that are known to precipitate the numerical problem of weight collapse within a finite-ensemble setting. A study to estimate the a-priori error bounds in the proposed scheme is undertaken. The numerical evidence, presently gathered from the assessed performance of the proposed and a few other competing filters on a class of nonlinear dynamic system identification and target tracking problems, is suggestive of the remarkably improved convergence and accuracy of the new filter. (C) 2013 Elsevier B.V. All rights reserved.

Efficiency limitations in a low band-gap diketopyrrolopyrrole-based polymer solar cell

We report the performance and photophysics of a low band-gap diketopyrrolopyrrole-based copolymer used in bulk heterojunction devices in combination with PC71BM. We show that the short lifetime of photogenerated excitons in the polymer constitutes an obstacle towards device efficiency by limiting the diffusion range of the exciton to the donor-acceptor heterojunction. We employ ultrafast transient-probe and fluorescence spectroscopy techniques to examine the excited state loss channels inside the devices. We use the high boiling point solvent additive 1,8-diiodooctane (DIO) to study the photoexcited state losses in different blend morphologies. The solvent additive acts as a compatibiliser between the donor and the acceptor material and leads to smaller domain sizes, higher charge formation yields and increased device efficiency.

Capacity of Gaussian Channels With Energy Harvesting and Processing Cost

Energy harvesting sensor nodes are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting green communication. In this paper, we focus on communicating reliably over an additive white Gaussian noise channel using such an energy harvesting sensor node. An important part of this paper involves appropriate modeling of energy harvesting, as done via various practical architectures. Our main result is the characterization of the Shannon capacity of the communication system. The key technical challenge involves dealing with the dynamic (and stochastic) nature of the (quadratic) cost of the input to the channel. As a corollary, we find close connections between the capacity achieving energy management policies and the queueing theoretic throughput optimal policies.

Diffraction tomography from intensity measurements: an evolutionary stochastic search to invert experimental data

We develop iterative diffraction tomography algorithms, which are similar to the distorted Born algorithms, for inverting scattered intensity data. Within the Born approximation, the unknown scattered field is expressed as a multiplicative perturbation to the incident field. With this, the forward equation becomes stable, which helps us compute nearly oscillation-free solutions that have immediate bearing on the accuracy of the Jacobian computed for use in a deterministic Gauss-Newton (GN) reconstruction. However, since the data are inherently noisy and the sensitivity of measurement to refractive index away from the detectors is poor, we report a derivative-free evolutionary stochastic scheme, providing strictly additive updates in order to bridge the measurement-prediction misfit, to arrive at the refractive index distribution from intensity transport data. The superiority of the stochastic algorithm over the GN scheme for similar settings is demonstrated by the reconstruction of the refractive index profile from simulated and experimentally acquired intensity data. (C) 2014 Optical Society of America

Enhancement of Corrosion Resistance of Zinc Coatings Using Green Additives

In the present work, morphology, microstructure, and electrochemical behavior of Zn coatings containing non-toxic additives have been investigated. Zn coatings were electrodeposited over mild steel substrates using Zn sulphate baths containing four different organic additives: sodium gluconate, dextrose, dextrin, and saccharin. All these additives are ``green'' and can be derived from food contents. Morphological and structural characterization using electron microscopy, x-ray diffraction, and texture co-efficient analysis revealed an appreciable alteration in the morphology and texture of the deposit depending on the type of additive used in the Zn plating bath. All the Zn coatings, however, were nano-crystalline irrespective of the type of additive used. Polarization and electrochemical impedance spectroscopic analysis, used to investigate the effect of the change in microstructure and morphology on corrosion resistance behavior, illustrated an improved corrosion resistance for Zn deposits obtained from plating bath containing additives as compared to the pure Zn coatings.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

AN OPTIMUM SHRINKAGE ESTIMATOR BASED ON MINIMUM-PROBABILITY-OF-ERROR CRITERION AND APPLICATION TO SIGNAL DENOISING

We address the problem of designing an optimal pointwise shrinkage estimator in the transform domain, based on the minimum probability of error (MPE) criterion. We assume an additive model for the noise corrupting the clean signal. The proposed formulation is general in the sense that it can handle various noise distributions. We consider various noise distributions (Gaussian, Student's-t, and Laplacian) and compare the denoising performance of the estimator obtained with the mean-squared error (MSE)-based estimators. The MSE optimization is carried out using an unbiased estimator of the MSE, namely Stein's Unbiased Risk Estimate (SURE). Experimental results show that the MPE estimator outperforms the SURE estimator in terms of SNR of the denoised output, for low (0 -10 dB) and medium values (10 - 20 dB) of the input SNR.

SARAS MEASUREMENT OF THE RADIO BACKGROUND AT LONG WAVELENGTHS

SARAS is a correlation spectrometer connected to a frequency independent antenna that is purpose-designed for precision measurements of the radio background at long wavelengths. The design, calibration, and observing strategies admit solutions for the internal additive contributions to the radiometer response, and hence a separation of these contaminants from the antenna temperature. We present here a wideband measurement of the radio sky spectrum by SARAS that provides an accurate measurement of the absolute brightness and spectral index between 110 and 175MHz. Accuracy in the measurement of absolute sky brightness is limited by systematic errors of magnitude 1.2%; errors in calibration and in the joint estimation of sky and system model parameters are relatively smaller. We use this wide-angle measurement of the sky brightness using the precision wide-band dipole antenna to provide an improved absolute calibration for the 150 MHz all-sky map of Landecker and Wielebinski: subtracting an offset of 21.4 K and scaling by a factor of 1.05 will reduce the overall offset error to 8 K (from 50 K) and scale error to 0.8% (from 5%). The SARAS measurement of the temperature spectral index is in the range -2.3 to -2.45 in the 110-175MHz band and indicates that the region toward the Galactic bulge has a relatively flatter index.

A stabilization approach for mesh-free simulations of systems developing shocks or extreme strain localizations

A new stabilization scheme, based on a stochastic representation of the discretized field variables, is proposed with a view to reduce or even eliminate unphysical oscillations in the mesh-free numerical simulations of systems developing shocks or exhibiting localized bands of extreme deformation in the response. The origin of the stabilization scheme may be traced to nonlinear stochastic filtering and, consistent with a class of such filters, gain-based additive correction terms are applied to the simulated solution of the system, herein achieved through the element-free Galerkin method, in order to impose a set of constraints that help arresting the spurious oscillations. The method is numerically illustrated through its Applications to inviscid Burgers' equations, wherein shocks may develop as a result of intersections of the characteristics, and to a gradient plasticity model whose response is often characterized by a developing shear band as the external load is gradually increased. The potential of the method in stabilized yet accurate numerical simulations of such systems involving extreme gradient variations in the response is thus brought forth. (C) 2014 Elsevier Ltd. All rights reserved.

Novel Transmit Precoding Methods for Rayleigh Fading Multiuser TDD-MIMO Systems With CSIT and No CSIR

In this paper, we present novel precoding methods for multiuser Rayleigh fading multiple-input-multiple-output (MIMO) systems when channel state information (CSI) is available at the transmitter (CSIT) but not at the receiver (CSIR). Such a scenario is relevant, for example, in time-division duplex (TDD) MIMO communications, where, due to channel reciprocity, CSIT can be directly acquired by sending a training sequence from the receiver to the transmitter(s). We propose three transmit precoding schemes that convert the fading MIMO channel into a fixed-gain additive white Gaussian noise (AWGN) channel while satisfying an average power constraint. We also extend one of the precoding schemes to the multiuser Rayleigh fading multiple-access channel (MAC), broadcast channel (BC), and interference channel (IC). The proposed schemes convert the fading MIMO channel into fixed-gain parallel AWGN channels in all three cases. Hence, they achieve an infinite diversity order, which is in sharp contrast to schemes based on perfect CSIR and no CSIT, which, at best, achieve a finite diversity order. Further, we show that a polynomial diversity order is retained, even in the presence of channel estimation errors at the transmitter. Monte Carlo simulations illustrate the bit error rate (BER) performance obtainable from the proposed precoding scheme compared with existing transmit precoding schemes.

Combined toxicity of two crystalline phases (anatase and rutile) of Titania nanoparticles towards freshwater microalgae: Chlorella sp

In view of the increasing usage of anatase and rutile crystalline phases of titania NPs in the consumer products, their entry into the aquatic environment may pose a serious risk to the ecosystem. In the present study, the possible toxic impact of anatase and rutile nanoparticles (individually and in binary mixture) was investigated using freshwater microalgae, Chlorella sp. at low exposure concentrations (0.25, 0.5 and 1 mg/L) in freshwater medium under UV irradiation. Reduction of cell viability as well as a reduction in chlorophyll content were observed due to the presence of NPs. An antagonistic effect was noted at certain concentrations of binary mixture such as (0.25, 0.25), (0.25, 0.5), and (0.5, 0.5) mg/L, and an additive effect for the other combinations, (0.25, 1), (0.5, 0.25), (0.5, 1), (1, 0.25), (1, 0.5), and (1, 1) mg/L. The hydrodynamic size analyses in the test medium revealed that rutile NPs were more stable in lake water than the anatase and binary mixtures at 6 h, the sizes of anatase (1 mg/L), rutile NPs (1 mg/L), and binary mixture (1, 1 mg/L) were 948.83 +/- 35.01 nm, 555.74 +/- 19.93 nm, and 1620.24 +/- 237.87 nm, respectively]. The generation of oxidative stress was found to be strongly dependent on the crystallinity of the nanoparticles. The transmission electron microscopic images revealed damages in the nucleus and cell membrane of algal cells due to the interaction of anatase NPs, whereas rutile NPs were found to cause chloroplast and internal organelle damages. Mis-shaped chloroplasts, lack of nucleus, and starch-pyrenoid complex were noted in binary-treated cells. The findings from the current study may facilitate the environmental risk assessment of titania NPs in an aquatic ecosystem. (C) 2015 Elsevier B.V. All rights reserved.

The Self-Association of Graphane Is Driven by London Dispersion and Enhanced Orbital Interactions

We investigated the nature of the cohesive energy between graphane sheets via multiple CH center dot center dot center dot HC interactions, using density functional theory (DFT) including dispersion correction (Grimmes D3 approach) computations of n]graphane sigma dimers (n = 6-73). For comparison, we also evaluated the binding between graphene sheets that display prototypical pi/pi interactions. The results were analyzed using the block-localized wave function (BLW) method, which is a variant of ab initio valence bond (VB) theory. BLW interprets the intermolecular interactions in terms of frozen interaction energy (Delta E-F) composed of electrostatic and Pauli repulsion interactions, polarization (Delta E-pol), charge-transfer interaction (Delta E-CT), and dispersion effects (Delta E-disp). The BLW analysis reveals that the cohesive energy between graphane sheets is dominated by two stabilizing effects, namely intermolecular London dispersion and two-way charge transfer energy due to the sigma CH -> sigma*(HC) interactions. The shift of the electron density around the nonpolar covalent C-H bonds involved in the intermolecular interaction decreases the C-H bond lengths uniformly by 0.001 angstrom. The Delta E-CT term, which accounts for similar to 15% of the total binding energy, results in the accumulation of electron density in the interface area between two layers. This accumulated electron density thus acts as an electronic glue for the graphane layers and constitutes an important driving force in the self-association and stability of graphane under ambient conditions. Similarly, the double faced adhesive tape style of charge transfer interactions was also observed among graphene sheets in which it accounts for similar to 18% of the total binding energy. The binding energy between graphane sheets is additive and can be expressed as a sum of CH center dot center dot center dot HC interactions, or as a function of the number of C-H bonds.

Event-triggered sampling using signal extrema for instantaneous amplitude and instantaneous frequency estimation

Event-triggered sampling (ETS) is a new approach towards efficient signal analysis. The goal of ETS need not be only signal reconstruction, but also direct estimation of desired information in the signal by skillful design of event. We show a promise of ETS approach towards better analysis of oscillatory non-stationary signals modeled by a time-varying sinusoid, when compared to existing uniform Nyquist-rate sampling based signal processing. We examine samples drawn using ETS, with events as zero-crossing (ZC), level-crossing (LC), and extrema, for additive in-band noise and jitter in detection instant. We find that extrema samples are robust, and also facilitate instantaneous amplitude (IA), and instantaneous frequency (IF) estimation in a time-varying sinusoid. The estimation is proposed solely using extrema samples, and a local polynomial regression based least-squares fitting approach. The proposed approach shows improvement, for noisy signals, over widely used analytic signal, energy separation, and ZC based approaches (which are based on uniform Nyquist-rate sampling based data-acquisition and processing). Further, extrema based ETS in general gives a sub-sampled representation (relative to Nyquistrate) of a time-varying sinusoid. For the same data-set size captured with extrema based ETS, and uniform sampling, the former gives much better IA and IF estimation. (C) 2015 Elsevier B.V. All rights reserved.