Substituent effect on fluorescence signaling of the cell permeable HSO4- receptors through single point to ratiometric response in green solvent

Two new 2-(2-aminophenyl)benzimidazole-based HSO4- ion selective receptors, 6-(4-nitrophenyl)-5,6-dihydrobenzo4,5]imidazo1,2-c]quinazoline (L1H) and 6-(4-methoxyphenyl)-5,6-dihydrobenzo4,5]imidazo1,2-c] quinazoline (L2H), and their 1 : 1 molecular complexes with HSO4- were prepared in a facile synthetic method and characterized by physicochemical and spectroscopic techniques along with the detailed structural analysis of L1H by single crystal X-ray crystallography. Both receptors (L1H and L2H) behave as highly selective chemosensor for HSO4- ions at biological pH in ethanol-water HEPES buffer (1/5) (v/v) medium over other anions such as F-, Cl-, Br-, I-, AcO-, H2PO4-, N-3(-) and ClO4-. Theoretical and experimental studies showed that the emission efficiency of the receptors (L1H and L2H) was tuned successfully through single point to ratiometric detection by employing the substituent effects. Using 3 sigma method the LOD for HSO4- ions were found to be 18.08 nM and 14.11 nM for L1H and L2H, respectively, within a very short responsive time (15-20 s) in 100 mM HEPES buffer (ethanol-water: 1/5, v/v). Comparison of the utility of the probes (L1H and L2H) as biomarkers for the detection of intracellular HSO4- ions concentrations under a fluorescence microscope has also been included and both probes showed no cytotoxic effect.

Decentralized demand-supply matching using community microgrids and consumer demand response: A scenario analysis

Developing countries constantly face the challenge of reliably matching electricity supply to increasing consumer demand. The traditional policy decisions of increasing supply and reducing demand centrally, by building new power plants and/or load shedding, have been insufficient. Locally installed microgrids along with consumer demand response can be suitable decentralized options to augment the centralized grid based systems and plug the demand-supply gap. The objectives of this paper are to: (1) develop a framework to identify the appropriate decentralized energy options for demand supply matching within a community, and, (2) determine which of these options can suitably plug the existing demand-supply gap at varying levels of grid unavailability. A scenario analysis framework is developed to identify and assess the impact of different decentralized energy options at a community level and demonstrated for a typical urban residential community Vijayanagar, Bangalore in India. A combination of LPG based CHP microgrid and proactive demand response by the community is the appropriate option that enables the Vijayanagar community to meet its energy needs 24/7 in a reliable, cost-effective manner. The paper concludes with an enumeration of the barriers and feasible strategies for the implementation of community microgrids in India based on stakeholder inputs. (C) 2014 Elsevier Ltd. All rights reserved.

Haemophilus influenzae Genome Database (HIGDB): A single point web resource for Haemophilus influenzae

Background: Haemophilus influenzae (H. Influenzae) is the causative agent of pneumonia, bacteraemia and meningitis. The organism is responsible for large number of deaths in both developed and developing countries. Even-though the first bacterial genome to be sequenced was that of H. Influenzae, there is no exclusive database dedicated for H. Influenzae. This prompted us to develop the Haemophilus influenzae Genome Database (HIGDB). Methods: All data of HIGDB are stored and managed in MySQL database. The HIGDB is hosted on Solaris server and developed using PERL modules. Ajax and JavaScript are used for the interface development. Results: The HIGDB contains detailed information on 42,741 proteins, 18,077 genes including 10 whole genome sequences and also 284 three dimensional structures of proteins of H. influenzae. In addition, the database provides ``Motif search'' and ``GBrowse''. The HIGDB is freely accessible through the URL:http://bioserverl.physicslisc.ernetin/HIGDB/. Discussion: The HIGDB will be a single point access for bacteriological, clinical, genomic and proteomic information of H. influenzae. The database can also be used to identify DNA motifs within H. influenzae genomes and to compare gene or protein sequences of a particular strain with other strains of H. influenzae. (C) 2014 Elsevier Ltd. All rights reserved.

Two-point correlation function of an exclusion process with hole-dependent rates

We consider an exclusion process on a ring in which a particle hops to an empty neighboring site with a rate that depends on the number of vacancies n in front of it. In the steady state, using the well-known mapping of this model to the zero-range process, we write down an exact formula for the partition function and the particle-particle correlation function in the canonical ensemble. In the thermodynamic limit, we find a simple analytical expression for the generating function of the correlation function. This result is applied to the hop rate u(n) = 1 + (b/n) for which a phase transition between high-density laminar phase and low-density jammed phase occurs for b > 2. For these rates, we find that at the critical density, the correlation function decays algebraically with a continuously varying exponent b - 2. We also calculate the two-point correlation function above the critical density and find that the correlation length diverges with a critical exponent nu = 1/(b - 2) for b < 3 and 1 for b > 3. These results are compared with those obtained using an exact series expansion for finite systems.

Robust tracking with interest points: A sparse representation approach

Visual tracking is an important task in various computer vision applications including visual surveillance, human computer interaction, event detection, video indexing and retrieval. Recent state of the art sparse representation (SR) based trackers show better robustness than many of the other existing trackers. One of the issues with these SR trackers is low execution speed. The particle filter framework is one of the major aspects responsible for slow execution, and is common to most of the existing SR trackers. In this paper,(1) we propose a robust interest point based tracker in l(1) minimization framework that runs at real-time with performance comparable to the state of the art trackers. In the proposed tracker, the target dictionary is obtained from the patches around target interest points. Next, the interest points from the candidate window of the current frame are obtained. The correspondence between target and candidate points is obtained via solving the proposed l(1) minimization problem. In order to prune the noisy matches, a robust matching criterion is proposed, where only the reliable candidate points that mutually match with target and candidate dictionary elements are considered for tracking. The object is localized by measuring the displacement of these interest points. The reliable candidate patches are used for updating the target dictionary. The performance and accuracy of the proposed tracker is benchmarked with several complex video sequences. The tracker is found to be considerably fast as compared to the reported state of the art trackers. The proposed tracker is further evaluated for various local patch sizes, number of interest points and regularization parameters. The performance of the tracker for various challenges including illumination change, occlusion, and background clutter has been quantified with a benchmark dataset containing 50 videos. (C) 2014 Elsevier B.V. All rights reserved.

Transitory second-order reciprocal connection for two surfaces in point contact

This paper investigates the instantaneous spatial higher pair to lower pair substitute-connection which is kinematically equivalent up to acceleration analysis for two smooth surfaces in point contact. The existing first-order equivalent substitute-connection consisting of a Hooke's joint (U-joint) and a spherical joint (S-joint) connected by an additional link is extended up to second-order. A two step procedure is chalked out for achieving this equivalence. First, the existing method is employed for velocity equivalence. In the second step, the two centers of substitution are obtained as a conjugate relationship involving the principal normal curvatures of the surfaces at the contact point and the screw coordinates of the instantaneous screw axis (ISA) of the first-order relative motion. Unlike the classical planar replacement, this particular substitution cannot be done by merely examining the profiles of the contacting surfaces. An illustrative example of a three-link direct-contact mechanism is presented. (C) 2014 Elsevier Ltd. All rights reserved.

GLOBAL REGISTRATION OF MULTIPLE POINT CLOUDS USING SEMIDEFINITE PROGRAMMING

Consider N points in R-d and M local coordinate systems that are related through unknown rigid transforms. For each point, we are given (possibly noisy) measurements of its local coordinates in some of the coordinate systems. Alternatively, for each coordinate system, we observe the coordinates of a subset of the points. The problem of estimating the global coordinates of the N points (up to a rigid transform) from such measurements comes up in distributed approaches to molecular conformation and sensor network localization, and also in computer vision and graphics. The least-squares formulation of this problem, although nonconvex, has a well-known closed-form solution when M = 2 (based on the singular value decomposition (SVD)). However, no closed-form solution is known for M >= 3. In this paper, we demonstrate how the least-squares formulation can be relaxed into a convex program, namely, a semidefinite program (SDP). By setting up connections between the uniqueness of this SDP and results from rigidity theory, we prove conditions for exact and stable recovery for the SDP relaxation. In particular, we prove that the SDP relaxation can guarantee recovery under more adversarial conditions compared to earlier proposed spectral relaxations, and we derive error bounds for the registration error incurred by the SDP relaxation. We also present results of numerical experiments on simulated data to confirm the theoretical findings. We empirically demonstrate that (a) unlike the spectral relaxation, the relaxation gap is mostly zero for the SDP (i.e., we are able to solve the original nonconvex least-squares problem) up to a certain noise threshold, and (b) the SDP performs significantly better than spectral and manifold-optimization methods, particularly at large noise levels.

Characterization of friction at three contact pairs by photoelastic Isotropic point (IP)

Friction coefficient between a circular-disk periphery and V-block surface was determined by introducing the concept of isotropic point (IP) in isochromatic field of the disk under three-point symmetric loading. IP position on the symmetry axis depends on active coefficient of friction during experiment. We extend this work to asymmetric loading of circular disk in which case two frictional contact pairs out of three loading contacts, independently control the unconstrained IP location. Photoelastic experiment is conducted on particular case of asymmetric three-point loading of circular disk. Basics of digital image processing are used to extract few essential parameters from experimental image, particularly IP location. Analytical solution by Flamant for half plane with a concentrated load, is utilized to derive stress components for required loading configurations of the disk. IP is observed, in analytical simulations of three-point asymmetric normal loading, to move from vertical axis to the boundary along an ellipse-like curve. When friction is included in the analysis, IP approaches the center with increase in loading friction and it goes away with increase in support friction. With all these insights, using experimental IP information, friction angles at three contact pairs of circular disk under asymmetric loading, are determined.

Reduced Look Ahead Orthogonal Matching Pursuit

Compressed Sensing (CS) is an elegant technique to acquire signals and reconstruct them efficiently by solving a system of under-determined linear equations. The excitement in this field stems from the fact that we can sample at a rate way below the Nyquist rate and still reconstruct the signal provided some conditions are met. Some of the popular greedy reconstruction algorithms are the Orthogonal Matching Pursuit (OMP), the Subspace Pursuit (SP) and the Look Ahead Orthogonal Matching Pursuit (LAOMP). The LAOMP performs better than the OMP. However, when compared to the SP and the OMP, the computational complexity of LAOMP is higher. We introduce a modified version of the LAOMP termed as Reduced Look Ahead Orthogonal Matching Pursuit (Reduced LAOMP). Reduced LAOMP uses prior information from the results of the OMP and the SP in the quest to speedup the look ahead strategy in the LAOMP. Monte Carlo simulations of this algorithm deliver promising results.

A comparative study of failure features in aerospace grade unidirectional and bidirectional woven CFRP composite laminates under four-point bend fatigue loads

Damage mechanisms in unidirectional (UD) and bi-directional (BD) woven carbon fiber reinforced polymer (CFRP) laminates subjected to four point flexure, both in static and fatigue loadings, were studied. The damage progression in composites was monitored by observing the slopes of the load vs. deflection data that represent the stiffness of the given specimen geometry over a number of cycles. It was observed that the unidirectional composites exhibit gradual loss in stiffness whereas the bidirectional woven composites show a relatively quicker loss during stage II of fatigue damage progression. Both, the static and the fatigue failures in unidirectional carbon fiber reinforced polymer composites originates due to generation of cracks on compression face while in bidirectional woven composites the damage ensues from both the compression and the tensile faces. These observations are supported by a detailed fractographic analysis.

Spectral Clustering with Jensen-type kernels and their multi-point extensions

Motivated by multi-distribution divergences, which originate in information theory, we propose a notion of `multipoint' kernels, and study their applications. We study a class of kernels based on Jensen type divergences and show that these can be extended to measure similarity among multiple points. We study tensor flattening methods and develop a multi-point (kernel) spectral clustering (MSC) method. We further emphasize on a special case of the proposed kernels, which is a multi-point extension of the linear (dot-product) kernel and show the existence of cubic time tensor flattening algorithm in this case. Finally, we illustrate the usefulness of our contributions using standard data sets and image segmentation tasks.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.