Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.

Performance Evaluation of Distance-Hop Proportionality on 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 on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into 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 paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.

On a Novel Geometric Representation of Rotation

This paper presents a novel method of representing rotation and its application to representing the ranges of motion of coupled joints in the human body, using planar maps. The present work focuses on the viability of this representation for situations that relied on maps on a unit sphere. Maps on a unit sphere have been used in diverse applications such as Gauss map, visibility maps, axis-angle and Euler-angle representations of rotation etc. Computations on a spherical surface are difficult and computationally expensive; all the above applications suffer from problems associated with singularities at the poles. There are methods to represent the ranges of motion of such joints using two-dimensional spherical polygons. The present work proposes to use multiple planar domain “cube” instead of a single spherical domain, to achieve the above objective. The parameterization on the planar domains is easy to obtain and convert to spherical coordinates. Further, there is no localized and extreme distortion of the parameter space and it gives robustness to the computations. The representation has been compared with the spherical representation in terms of computational ease and issues related to singularities. Methods have been proposed to represent joint range of motion and coupled degrees of freedom for various joints in digital human models (such as shoulder, wrist and fingers). A novel method has been proposed to represent twist in addition to the existing swing-swivel representation.

Electrical resistivity studies of benzidine-TCNQ and its inclusion compound under high pressure

Electrical resistivity studies of the charge transfer complex benzidine—TCNQ and its inclusion compound, have been carried out up to pressures 8 GPa. Two types of behaviour were observed in these complexes under high pressure and this difference is interpreted and discussed.

Geometric representations of graphs in low dimension

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (\Delta + 2) \ln n$ dimensions, where $\Delta$ is the maximum degree of G. We also show that $\boxi(G) \le (\Delta + 2) \ln n$ for any graph G. Our bound is tight up to a factor of $\ln n$. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree $\Delta$, we show that for almost all graphs on n vertices, its boxicity is upper bound by $c\cdot(d_{av} + 1) \ln n$ where d_{av} is the average degree and c is a small constant. Also, we show that for any graph G, $\boxi(G) \le \sqrt{8 n d_{av} \ln n}$, which is tight up to a factor of $b \sqrt{\ln n}$ for a constant b.

Evolving Random Geometric Graph Models for Mobile Wireless Networks

We consider evolving exponential RGGs in one dimension and characterize the time dependent behavior of some of their topological properties. We consider two evolution models and study one of them detail while providing a summary of the results for the other. In the first model, the inter-nodal gaps evolve according to an exponential AR(1) process that makes the stationary distribution of the node locations exponential. For this model we obtain the one-step conditional connectivity probabilities and extend it to the k-step case. Finite and asymptotic analysis are given. We then obtain the k-step connectivity probability conditioned on the network being disconnected. We also derive the pmf of the first passage time for a connected network to become disconnected. We then describe a random birth-death model where at each instant, the node locations evolve according to an AR(1) process. In addition, a random node is allowed to die while giving birth to a node at another location. We derive properties similar to those above.

Synthesis, Characterization, and Electronic Structure of New Type of Heterometallic Boride Clusters

The reaction of [Cp*TaCl(4)], 1 (Cp* = eta(5)-C(5)Me(5)), with [LiBH(4)center dot THF] at -78 degrees C, followed by thermolysis in the presence of excess [BH(3)center dot THF], results in the formation of the oxatantalaborane cluster [(Cp*Ta)(2)B(4)H(10)O], 2 in moderate yield. Compound 2 is a notable example of an oxatantalaborane cluster where oxygen is contiguously bound to both the metal and boron. Upon availability of 2, a room temperature reaction was performed with [Fe(2)(CO)(9)], which led to the isolation of [(Cp*Ta)(2)B(2)H(4)O{H(2)Fe(2)(CO)(6)BH} ] 3. Compound 3 is an unusual heterometallic boride cluster in which the [Ta(2)Fe(2)] atoms define a butterfly framework with one boron atom lying in a semi-interstitial position. Likewise, the diselenamolybdaborane, [(Cp*Mo)(2)B(4)H(4)Se(2)], 4 was treated with an excess of [Fe(2)(CO)(9)] to afford the heterometallic boride cluster [(Cp*MoSe)(2)Fe(6)(CO)(13)B(2)(BH)(2)], 5. The cluster core of 5 consists of a cubane [Mo(2)Se(2)Fe(2)B(2)] and a tricapped trigonal prism [Fe(6)B(3)] fused together with four atoms held in common between the two subclusters. In the tricapped trigonal prism subunit, one of the boron atoms is completely encapsulated and bonded to six iron and two boron atoms. Compounds 2, 3, and 5 have been characterized by mass spectrometry, IR, (1)H, (11)B, (13)C NMR spectroscopy, and the geometric structures were unequivocally established by crystallographic analysis. The density functional theory calculations yielded geometries that are in close agreement with the observed structures. Furthermore, the calculated (11)B NMR chemical shifts also support the structural characterization of the compounds. Natural bond order analysis and Wiberg bond indices are used to gain insight into the bonding patterns of the observed geometries of 2, 3, and 5.

Microstructure evolution and metastable phase formation in laser-ablation-deposited films of Ti5Si3 intermetallic compound

Thin films of Ti62.5Si37.5 composition were deposited by the pulsed-laser ablation technique on single-crystal Nad substrates at room temperature and on ′single-crystal′ superalloy substrates at elevated temperatures. Both vapour and liquid droplets generated by pulsed-laser ablation of the target become quenched on the substrate. Amorphization had taken place in the process of quenching of vapour-plasma as well as small liquid droplets on NaCl substrates at room temperature. In addition to the formation of Ti5Si3, a metastable fcc phase (a 0 = 0.433 nm) also forms in micron-sized large droplets as well as in the medium-sized submicron droplets. The same metastable fcc phase nucleates during deposition from the vapour state at 500°C and at 600°C on a superalloy substrate as well as during crystallization of the amorphous phase. The evolution of the metastable fcc phase in the Ti-Si system during non-equilibrium processing is reported for the first time.

Geometric Decision Tree

In this paper, we present a new algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess the goodness of hyperplanes at each node while learning a decision tree in top-down fashion. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy for assessing the hyperplanes in such a way that the geometric structure in the data is taken into account. At each node of the decision tree, we find the clustering hyperplanes for both the classes and use their angle bisectors as the split rule at that node. We show through empirical studies that this idea leads to small decision trees and better performance. We also present some analysis to show that the angle bisectors of clustering hyperplanes that we use as the split rules at each node are solutions of an interesting optimization problem and hence argue that this is a principled method of learning a decision tree.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

Synthesis and structure of Bi2Ce2O7: a new compound exhibiting high solar photocatalytic activity

A facile method of solution combustion was used to synthesize a new solid solution Bi2Ce2O7. The structure was determined from powder X-ray diffraction (PXRD) and found to crystallize in the space group Fm (3) over barm with cell parameter a = 5.46936(9) angstrom. The particle sizes varied from 5 to 6 nm. The degradation of cationic dye malachite green (MG) was investigated under solar radiation as the band gap of the material is 2.34 eV.

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.

Highly luminescent and thermally stable lanthanide coordination polymers designed from 4-(dipyridin-2-yl)aminobenzoate: efficient energy transfer from Tb3+ to Eu3+ in a mixed lanthanide coordination compound

Herein, a new aromatic carboxylate ligand, namely, 4-(dipyridin-2-yl)aminobenzoic acid (HL), has been designed and employed for the construction of a series of lanthanide complexes (Eu3+ = 1, Tb3+ = 2, and Gd3+ = 3). Complexes of 1 and 2 were structurally authenticated by single-crystal X-ray diffraction and were found to exist as infinite 1D coordination polymers with the general formulas {Eu(L)(3)(H2O)(2)]}(n) (1) and {Tb(L)(3)(H2O)]center dot(H2O)}(n) (2). Both compounds crystallize in monoclinic space group C2/c. The photophysical properties demonstrated that the developed 4-(dipyridin-2-yl)aminobenzoate ligand is well suited for the sensitization of Tb3+ emission (Phi(overall) = 64%) thanks to the favorable position of the triplet state ((3)pi pi*) of the ligand the energy difference between the triplet state of the ligand and the excited state of Tb3+ (Delta E) = (3)pi pi* - D-5(4) = 3197 cm(-1)], as investigated in the Gd3+ complex. On the other hand, the corresponding Eu3+ complex shows weak luminescence efficiency (Phi(overall) = 7%) due to poor matching of the triplet state of the ligand with that of the emissive excited states of the metal ion (Delta E = (3)pi pi* - D-5(0) = 6447 cm(-1)). Furthermore, in the present work, a mixed lanthanide system featuring Eu3+ and Tb3+ ions with the general formula {Eu0.5Tb0.5(L)(3)(H2O)(2)]}(n) (4) was also synthesized, and the luminescent properties were evaluated and compared with those of the analogous single-lanthanide-ion systems (1 and 2). The lifetime measurements for 4 strongly support the premise that efficient energy transfer occurs between Tb3+ and Eu3+ in a mixed lanthanide system (eta = 86%).