Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

Factor graph based joint detection/decoding for LDPC coded large-MIMO systems

In this paper, we employ message passing algorithms over graphical models to jointly detect and decode symbols transmitted over large multiple-input multiple-output (MIMO) channels with low density parity check (LDPC) coded bits. We adopt a factor graph based technique to integrate the detection and decoding operations. A Gaussian approximation of spatial interference is used for detection. This serves as a low complexity joint detection/decoding approach for large dimensional MIMO systems coded with LDPC codes of large block lengths. This joint processing achieves significantly better performance than the individual detection and decoding scheme.

Stabilization and Structural Alteration of the G-Quadruplex DNA Made from the Human Telomeric Repeat Mediated by Troger's Base Based Novel Benzimidazole Derivatives

Ligand-induced stabilization of the G-quadruplex DNA structure derived from the single-stranded 3'-overhang of the telomeric DNA is an attractive strategy for the inhibition of the telomerase activity. The agents that can induce/stabilize a DNA sequence into a G-quadruplex structure are therefore potential anticancer drugs. Herein we present the first report of the interactions of two novel bisbenzimidazoles (TBBz1 and TBBz2) based on Troger's base skeleton with the G-quadruplex DNA (G4DNA). These Troger's base molecules stabilize the G4DNA derived from a human telomeric sequence. Evidence of their strong interaction with the G4DNA has been obtained from CD spectroscopy, thermal denaturation, and UV-vis titration studies. These ligands also possess significantly higher affinity toward the G4DNA over the duplex DNA. The above results obtained are in excellent agreement with the biological activity, measured in vitro using a modified TRAP assay. Furthermore, the ligands are selectively more cytotoxic toward the cancerous cells than the corresponding noncancerous cells. Computational studies suggested that the adaptive scaffold might allow these ligands to occupy not only the G-quartet planes but also the grooves of the G4DNA.

Evaluation of Fracture Parameters by Double-G, Double-K Models and Crack Extension Resistance for High Strength and Ultra High Strength Concrete Beams

This paper presents the advanced analytical methodologies such as Double- G and Double - K models for fracture analysis of concrete specimens made up of high strength concrete (HSC, HSC1) and ultra high strength concrete. Brief details about characterization and experimentation of HSC, HSC1 and UHSC have been provided. Double-G model is based on energy concept and couples the Griffith's brittle fracture theory with the bridging softening property of concrete. The double-K fracture model is based on stress intensity factor approach. Various fracture parameters such as cohesive fracture toughness (4), unstable fracture toughness (K-Ic(c)), unstable fracture toughness (K-Ic(un)) and initiation fracture toughness (K-Ic(ini)) have been evaluated based on linear elastic fracture mechanics and nonlinear fracture mechanics principles. Double-G and double-K method uses the secant compliance at the peak point of measured P-CMOD curves for determining the effective crack length. Bi-linear tension softening model has been employed to account for cohesive stresses ahead of the crack tip. From the studies, it is observed that the fracture parameters obtained by using double - G and double - K models are in good agreement with each other. Crack extension resistance has been estimated by using the fracture parameters obtained through double - K model. It is observed that the values of the crack extension resistance at the critical unstable point are almost equal to the values of the unstable fracture toughness K-Ic(un) of the materials. The computed fracture parameters will be useful for crack growth study, remaining life and residual strength evaluation of concrete structural components.

Diversity in ranking via resistive graph centers

Users can rarely reveal their information need in full detail to a search engine within 1--2 words, so search engines need to "hedge their bets" and present diverse results within the precious 10 response slots. Diversity in ranking is of much recent interest. Most existing solutions estimate the marginal utility of an item given a set of items already in the response, and then use variants of greedy set cover. Others design graphs with the items as nodes and choose diverse items based on visit rates (PageRank). Here we introduce a radically new and natural formulation of diversity as finding centers in resistive graphs. Unlike in PageRank, we do not specify the edge resistances (equivalently, conductances) and ask for node visit rates. Instead, we look for a sparse set of center nodes so that the effective conductance from the center to the rest of the graph has maximum entropy. We give a cogent semantic justification for turning PageRank thus on its head. In marked deviation from prior work, our edge resistances are learnt from training data. Inference and learning are NP-hard, but we give practical solutions. In extensive experiments with subtopic retrieval, social network search, and document summarization, our approach convincingly surpasses recently-published diversity algorithms like subtopic cover, max-marginal relevance (MMR), Grasshopper, DivRank, and SVMdiv.

A hybrid RTS-BP algorithm for improved detection of large-MIMO M-QAM signals

Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive tabu search (RTS) algorithm, as well as a factor-graph based belief propagation (BP) algorithm for low-complexity large-MIMO detection. The motivation for the present work arises from the following two observations on the above two algorithms: i) Although RTS achieved close to optimal performance for 4-QAM in large dimensions, significant performance improvement was still possible for higher-order QAM (e.g., 16-, 64-QAM). ii) BP also achieved near-optimal performance for large dimensions, but only for {±1} alphabet. In this paper, we improve the large-MIMO detection performance of higher-order QAM signals by using a hybrid algorithm that employs RTS and BP. In particular, motivated by the observation that when a detection error occurs at the RTS output, the least significant bits (LSB) of the symbols are mostly in error, we propose to first reconstruct and cancel the interference due to bits other than LSBs at the RTS output and feed the interference cancelled received signal to the BP algorithm to improve the reliability of the LSBs. The output of the BP is then fed back to RTS for the next iteration. Simulation results show that the proposed algorithm performs better than the RTS algorithm, and semi-definite relaxation (SDR) and Gaussian tree approximation (GTA) algorithms.

Molecular Design of Synthetic Benzimidazoles for the Switchover of the Duplex to G-quadruplex DNA Recognition

Benzimidazole derivatives are well known for their antibacterial, antiviral, anticonvulsant, antihistaminic, anthelmintic and antidepressant activities. Benzimidazole's unique base-selective DNA recognition property has been studied widely. However, most of the early benzimidazole systems have been targeted towards the binding of duplex DNA. Here we have shown the evolution and progress of the design and synthesis of new benzimidazole systems towards selective recognition of the double-stranded DNA first. Then in order to achieve selective recognition of the G-quadruplex DNA and utilize their potential as future anti-cancer drug candidates, we have demonstrated their selective cytotoxicity towards the cancer cells and potent telomerase inhibition ability.

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes just touch at their boundaries. Further, this construction can be realized in linear time.

On the secret key capacity of the harary graph PIN model

A pairwise independent network (PIN) model consists of pairwise secret keys (SKs) distributed among m terminals. The goal is to generate, through public communication among the terminals, a group SK that is information-theoretically secure from an eavesdropper. In this paper, we study the Harary graph PIN model, which has useful fault-tolerant properties. We derive the exact SK capacity for a regular Harary graph PIN model. Lower and upper bounds on the fault-tolerant SK capacity of the Harary graph PIN model are also derived.

Fretting wear behaviour of hydroxyapatite-titanium composites in simulated body fluid, supplemented with 5 g l(-1) bovine serum albumin

Damaged articulating joints can be repaired or replaced with synthetic biomaterials, which can release wear debris due to articulation, leading to the osteolysis. In a recent work, it has been shown that it is possible to achieve a better combination of flexural strength/fracture toughness as well as in vitro bioactivity and cytocompatibility properties in spark plasma sintered hydroxyapatite-titanium (HA-Ti) composites. Although hydroxyapatite and titanium are well documented for their good biocompatibility, nanosized hydroxyapatite (HA) and titanium (Ti) particles can cause severe toxicity to cells. In order to address this issue, fretting wear study of HA-Ti composites under dry and wet (1x SBF, supplemented with 5 g l(-1) bovine serum albumin (BSA)) condition was performed to assess the wear resistance as well as wear debris formation, in vitro. The experimental results reveal one order of magnitude lower wear rate for HA-10 wt% Ti (7.5 x 10(-5) mm(3) N-1 m(-1)) composite than monolithic HA (3.9 x 10(-4) mm(3) N-1 m(-1)) in simulated body fluid. The difference in the tribological properties has been analyzed in the light of phase assemblages and mechanical properties. Overall, the results suggest the potential use of HA-Ti composites over existing HA-based biocomposites in orthopedic as well as dental applications.

Information content of molecular graph and prediction of gas phase thermal entropy of organic compounds

Entropy is a fundamental thermodynamic property that has attracted a wide attention across domains, including chemistry. Inference of entropy of chemical compounds using various approaches has been a widely studied topic. However, many aspects of entropy in chemical compounds remain unexplained. In the present work, we propose two new information-theoretical molecular descriptors for the prediction of gas phase thermal entropy of organic compounds. The descriptors reflect the bulk and size of the compounds as well as the gross topological symmetry in their structures, all of which are believed to determine entropy. A high correlation () between the entropy values and our information-theoretical indices have been found and the predicted entropy values, obtained from the corresponding statistically significant regression model, have been found to be within acceptable approximation. We provide additional mathematical result in the form of a theorem and proof that might further help in assessing changes in gas phase thermal entropy values with the changes in molecular structures. The proposed information-theoretical molecular descriptors, regression model and the mathematical result are expected to augment predictions of gas phase thermal entropy for a large number of chemical compounds.

G-Quadruplex Structures Formed at the HOX11 Breakpoint Region Contribute to Its Fragility during t(10;14) Translocation in T-Cell Leukemia

The t(10;14) translocation involving the HOX11 gene is found in several T-cell leukemia patients. Previous efforts to determine the causes of HOX11 fragility were not successful. The role of non-B DNA structures is increasingly becoming an important cause of genomic instability. In the present study, bioinformatics analysis revealed two G-quadruplex-forming motifs at the HOX11 breakpoint cluster. Gel shift assays showed formation of both intra- and intermolecular G-quadruplexes, the latter being more predominant. The structure formation was dependent on four stretches of guanines, as revealed by mutagenesis. Circular dichroism analysis identified parallel conformations for both quadruplexes. The non-B DNA structure could block polymerization during replication on a plasmid, resulting in consistent K K+-dependent pause sites, which were abolished upon mutation of G-motifs, thereby demonstrating the role of the stretches of guanines even on double-stranded DNA. Extrachromosomal assays showed that the G-quadruplex motifs could block transcription, leading to reduced expression of green fluorescent protein (GFP) within cells. More importantly, sodium bisulfite modification assay showed the single-stranded character at regions I and II of HOX11 in the genome. Thus, our findings suggest the occurrence of G-quadruplex structures at the HOX11 breakpoint region, which could explain its fragility during the t(10;14) translocation.

Morphological Effects of G-Quadruplex Stabilization Using a Small Molecule in Zebrafish

Zebrafish (Danio rerio) embryos are transparent and advantageous for studying early developmental changes due to ex utero development, making them an appropriate model for studying gene expression changes as a result of molecular targeting. Zebrafish embryos were injected with a previously reported G-quadruplex selective ligand, and the phenotypic changes were recorded. We report marked discrepancies in the development of intersegmental vessels. In silico analysis determined that the putative G-quadruplex motif occur in the upstream promoter region of the Cdh5 (N-cadherin) gene. A real-time polymerase chain reaction-based investigation indicated that in zebrafish, CDH-2 (ZN-cad) was significantly downregulated in the ligand-treated embryos. Biophysical characterization of the interaction of the ligand with the G-quadruplex motif found in this promoter yielded strong binding and stabilization of the G-quadruplex with this ligand. Hence, we report for the first time the phenotypic impact of G-quadruplex targeting with a ligand in a vertebrate organism. This study has unveiled not only G-quadruplex targeting in non-human animal species but also the potential that G-quadruplexes can provide a ready tool for understanding the phenotypic effects of targeting certain important genes involved in differentiation and developmental processes in a living eukaryotic organism.

Two-pion low-energy contribution to the muon g-2 with improved precision from analyticity and unitarity

The two-pion contribution from low energies to the muon magnetic moment anomaly, although small, has a large relative uncertainty since in this region the experimental data on the cross sections are neither sufficient nor precise enough. It is therefore of interest to see whether the precision can be improved by means of additional theoretical information on the pion electromagnetic form factor, which controls the leading-order contribution. In the present paper, we address this problem by exploiting analyticity and unitarity of the form factor in a parametrization-free approach that uses the phase in the elastic region, known with high precision from the Fermi-Watson theorem and Roy equations for pi pi elastic scattering as input. The formalism also includes experimental measurements on the modulus in the region 0.65-0.70 GeV, taken from the most recent e(+)e(-) ->pi(+)pi(-) experiments, and recent measurements of the form factor on the spacelike axis. By combining the results obtained with inputs from CMD2, SND, BABAR, and KLOE, we make the predictions a(mu)(pi pi,LO)2m(pi), 0.30 GeV] = (0.553 +/- 0.004) x 10(-10) and a(mu)(pi pi,LO)0.30 GeV; 0.63 GeV] = (133.083 +/- 0.837) x 10(-10). These are consistent with the other recent determinations and have slightly smaller errors.

Lovasz theta function, SVMs and Finding Dense Subgraphs

In this paper we establish that the Lovasz theta function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM-theta graphs, on which Lovasz theta function can be approximated well by a Support vector machine (SVM). We show that Erdos-Renyi random G(n, p) graphs are SVM-theta graphs for log(4)n/n <= p < 1. Even if we embed a large clique of size Theta(root np/1-p) in a G(n, p) graph the resultant graph still remains a SVM-theta graph. This immediately suggests an SVM based algorithm for recovering a large planted clique in random graphs. Associated with the theta function is the notion of orthogonal labellings. We introduce common orthogonal labellings which extends the idea of orthogonal labellings to multiple graphs. This allows us to propose a Multiple Kernel learning (MKL) based solution which is capable of identifying a large common dense subgraph in multiple graphs. Both in the planted clique case and common subgraph detection problem the proposed solutions beat the state of the art by an order of magnitude.