End point estimates for Radon transform of radial functions on non-Euclidean spaces

We prove end point estimate for Radon transform of radial functions on affine Grasamannian and real hyperbolic space. We also discuss analogs of these results on the sphere.

Accurate point matching based on multi-objective Genetic Algorithm for multi-sensor satellite imagery

This paper investigates a novel approach for point matching of multi-sensor satellite imagery. The feature (corner) points extracted using an improved version of the Harris Corner Detector (HCD) is matched using multi-objective optimization based on a Genetic Algorithm (GA). An objective switching approach to optimization that incorporates an angle criterion, distance condition and point matching condition in the multi-objective fitness function is applied to match corresponding corner-points between the reference image and the sensed image. The matched points obtained in this way are used to align the sensed image with a reference image by applying an affine transformation. From the results obtained, the performance of the image registration is evaluated and compared with existing methods, namely Nearest Neighbor-Random SAmple Consensus (NN-Ran-SAC) and multi-objective Discrete Particle Swarm Optimization (DPSO). From the performed experiments it can be concluded that the proposed approach is an accurate method for registration of multi-sensor satellite imagery. (C) 2014 Elsevier Inc. All rights reserved.

Overview of nano-drugs characteristics for clinical application: the journey from the entry to the exit point

The ever-increasing number of diseases worldwide requires comprehensive, efficient, and cost-effective modes of treatments. Among various strategies, nanomaterials fulfill most of these criteria. The unique physicochemical properties of nanoparticles have made them a premier choice as a drug or a drug delivery system for the purpose of treatment, and as bio-detectors for disease prognosis. However, the main challenge is the proper consideration of the physical properties of these nanomaterials, while developing them as potential tools for therapeutics and/or diagnostics. In this review, we focus mainly on the characteristics of nanoparticles to develop an effective and sensitive system for clinical purposes. This review will present an overview of the important properties of nanoparticles, through their journey from its route of administration until disposal from the human body after accomplishing targeted functionality. We have chosen cancer as our model disease to explain the potentiality of nano-systems for therapeutics and diagnostics in relation to several organs (intestine, lung, brain, etc.). Furthermore, we have discussed their biodegradability and accumulation probability which can cause unfavorable side effects in healthy human subjects.

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.

Fixed-orientation equilateral triangle matching of point sets

Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. 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.

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.

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.