Strongly minimal triangulations of (S (3) x S (1))(#3) and (S (3) x S (1))(#3)

A triangulated d-manifold K, satisfies the inequality for da parts per thousand yen3. The triangulated d-manifolds that meet the bound with equality are called tight neighbourly. In this paper, we present tight neighbourly triangulations of 4-manifolds on 15 vertices with as an automorphism group. One such example was constructed by Bagchi and Datta (Discrete Math. 311 (citeyearbd102011) 986-995). We show that there are exactly 12 such triangulations up to isomorphism, 10 of which are orientable.

SEPARATION DIMENSION OF BOUNDED DEGREE GRAPHS

The separation dimension of a graph G is the smallest natural number k for which the vertices of G can be embedded in R-k such that any pair of disjoint edges in G can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family F of total orders of the vertices of G such that for any two disjoint edges of G, there exists at least one total order in F in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on n vertices is Theta(log n). In this article, we focus on bounded degree graphs and show that the separation dimension of a graph with maximum degree d is at most 2(9) (log*d)d. We also demonstrate that the above bound is nearly tight by showing that, for every d, almost all d-regular graphs have separation dimension at least d/2]

PERCOLATION ON THE INFORMATION-THEORETICALLY SECURE SIGNAL TO INTERFERENCE RATIO GRAPH

We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes in R-2 of intensities lambda and lambda(E), respectively. A directed edge from one legitimate node A to another legitimate node B exists provided that the strength of the signal transmitted from node A that is received at node B is higher than that received at any eavesdropper node. The strength of the signal received at a node from a legitimate node depends not only on the distance between these nodes, but also on the location of the other legitimate nodes and an interference suppression parameter gamma. The graph is said to percolate when there exists an infinitely connected component. We show that for any finite intensity lambda(E) of eavesdropper nodes, there exists a critical intensity lambda(c) < infinity such that for all lambda > lambda(c) the graph percolates for sufficiently small values of the interference parameter. Furthermore, for the subcritical regime, we show that there exists a lambda(0) such that for all lambda < lambda(0) <= lambda(c) a suitable graph defined over eavesdropper node connections percolates that precludes percolation in the graphs formed by the legitimate nodes.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .

Microwave spectroscopic and theoretical investigations of the strongly hydrogen bonded hexafluoroisopropanol...water complex

This paper reports microwave spectroscopic and theoretical investigations on the interaction of water with hexafluoroisopropanol (HFIP). The HFIP monomer can exist in two conformations, antiperiplanar (AP) and synclinical (SC). The former is about 5 kJ mol(-1) more stable than the latter. Theoretical calculations predicted three potential minima for the complex, two having AP and one having SC conformations. Though, the binding energy for the HFIP(SC)...H2O turned out to be larger than that for the other two conformers having HFIP in the AP form, the global minimum for the complex in the potential energy hypersurface had HFIP in the AP form. Experimental rotational constants for four isotopologues measured using a pulsed nozzle Fourier transform microwave spectrometer, correspond to the global minimum in the potential energy hypersurface. The structural parameters and the internal dynamics of the complex could be determined from the rotational spectra of the four isotopologues. The global minimum has the HFIP(AP) as a hydrogen bond donor forming a strong hydrogen bond with H2O. To characterize the strength of the bonding and to probe the other interactions within the complex, atoms in molecules, non-covalent interaction index and natural bond orbital theoretical analyses have been performed.

Divide and Conquer: Efficient Large-Scale Structure from Motion Using Graph Partitioning

Despite significant advances in recent years, structure-from-motion (SfM) pipelines suffer from two important drawbacks. Apart from requiring significant computational power to solve the large-scale computations involved, such pipelines sometimes fail to correctly reconstruct when the accumulated error in incremental reconstruction is large or when the number of 3D to 2D correspondences are insufficient. In this paper we present a novel approach to mitigate the above-mentioned drawbacks. Using an image match graph based on matching features we partition the image data set into smaller sets or components which are reconstructed independently. Following such reconstructions we utilise the available epipolar relationships that connect images across components to correctly align the individual reconstructions in a global frame of reference. This results in both a significant speed up of at least one order of magnitude and also mitigates the problems of reconstruction failures with a marginal loss in accuracy. The effectiveness of our approach is demonstrated on some large-scale real world data sets.

Observation of correlated spin-orbit order in a strongly anisotropic quantum wire system

Quantum wires with spin-orbit coupling provide a unique opportunity to simultaneously control the coupling strength and the screened Coulomb interactions where new exotic phases of matter can be explored. Here we report on the observation of an exotic spin-orbit density wave in Pb-atomic wires on Si(557) surfaces by mapping out the evolution of the modulated spin-texture at various conditions with spin-and angle-resolved photoelectron spectroscopy. The results are independently quantified by surface transport measurements. The spin polarization, coherence length, spin dephasing rate and the associated quasiparticle gap decrease simultaneously as the screened Coulomb interaction decreases with increasing excess coverage, providing a new mechanism for generating and manipulating a spin-orbit entanglement effect via electronic interaction. Despite clear evidence of spontaneous spin-rotation symmetry breaking and modulation of spin-momentum structure as a function of excess coverage, the average spin polarization over the Brillouin zone vanishes, indicating that time-reversal symmetry is intact as theoretically predicted.

Graph Modification Problems: A Modern Perspective

We give an overview of recent results and techniques in parameterized algorithms for graph modification problems.

Query Click and Text Similarity Graph for Query Suggestions

Query suggestion is an important feature of the search engine with the explosive and diverse growth of web contents. Different kind of suggestions like query, image, movies, music and book etc. are used every day. Various types of data sources are used for the suggestions. If we model the data into various kinds of graphs then we can build a general method for any suggestions. In this paper, we have proposed a general method for query suggestion by combining two graphs: (1) query click graph which captures the relationship between queries frequently clicked on common URLs and (2) query text similarity graph which finds the similarity between two queries using Jaccard similarity. The proposed method provides literally as well as semantically relevant queries for users' need. Simulation results show that the proposed algorithm outperforms heat diffusion method by providing more number of relevant queries. It can be used for recommendation tasks like query, image, and product suggestion.

Kinematics and dynamics of Jansen leg mechanism: A bond graph approach

The Jansen mechanism is a one degree-of-freedom, planar, 12-link, leg mechanism that can be used in mobile robotic applications and in gait analysis. This paper presents the kinematics and dynamics of the Jansen leg mechanism. The forward kinematics, accomplished using circle intersection method, determines the trajectories of various points on the mechanism in the chassis (stationary link) reference frame. From the foot point trajectory, the step length is shown to vary linearly while step height varies non-linearly with change in crank radius. A dynamic model for the Jansen leg mechanism is proposed using bond graph approach with modulated multiport transformers. For given ground reaction force pattern and crank angular speed, this model helps determine the motor torque profile as well as the link and joint stresses. The model can therefore be used to rate the actuator torque and in design of the hardware and controller for such a system. The kinematics of the mechanism can also be obtained from this dynamic model. The proposed model is thus a useful tool for analysis and design of systems based on the Jansen leg mechanism. (C) 2015 Elsevier B.V. All rights reserved.

Weak-coupling superconductivity in a strongly correlated iron pnictide

Iron-based superconductors have been found to exhibit an intimate interplay of orbital, spin, and lattice degrees of freedom, dramatically affecting their low-energy electronic properties, including superconductivity. Albeit the precise pairing mechanism remains unidentified, several candidate interactions have been suggested to mediate the superconducting pairing, both in the orbital and in the spin channel. Here, we employ optical spectroscopy (OS), angle-resolved photoemission spectroscopy (ARPES), ab initio band-structure, and Eliashberg calculations to show that nearly optimally doped NaFe0.978Co0.022As exhibits some of the strongest orbitally selective electronic correlations in the family of iron pnictides. Unexpectedly, we find that the mass enhancement of itinerant charge carriers in the strongly correlated band is dramatically reduced near the Gamma point and attribute this effect to orbital mixing induced by pronounced spin-orbit coupling. Embracing the true band structure allows us to describe all low-energy electronic properties obtained in our experiments with remarkable consistency and demonstrate that superconductivity in this material is rather weak and mediated by spin fluctuations.

Falcon: A Graph Manipulation Language for Heterogeneous Systems

Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy-even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues, we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations.