Modified Adomian Decomposition Method for Van der Pol equations

In the paper, the well known Adomian Decomposition Method (ADM) is modified to solve the parabolic equations. The present method is quite different than the numerical method. The results are compared with the existing exact or analytical method. The already known existing Adomian Decomposition Method is modified to improve the accuracy and convergence. Thus, the modified method is named as Modified Adomian Decomposition Method (MADM). The Modified Adomian Decomposition Method results are found to converge very quickly and are more accurate compared to ADM and numerical methods. MADM is quite efficient and is practically well suited for use in these problems. Several examples are given to check the reliability of the present method. Modified Adomian Decomposition Method is a non-numerical method which can be adapted for solving parabolic equations. In the current paper, the principle of the decomposition method is described, and its advantages are shown in the form of parabolic equations. (C) 2014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/).

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 touch just at their boundaries.

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

Electronically nonadiabatic decomposition mechanisms of clusters of zinc and dimethylnitramine

Electronically nonadiabatic decomposition mechanisms of dimethylnitramine (DMNA) in presence of zinc metal clusters are explored. Complete active space self-consistent field (CASSCF) calculation is employed for DMNA-Zn and ONIOM (Our own N-layered integrated molecular orbital and molecular mechanics) methodology is coupled with CASSCF methodology for DMNA-Zn-10 cluster. Present computational results show that DMNA-Zn clusters undergo electronically nonadiabatic reactions, rendering nitro-nitrite isomerization followed by NO elimination. The overall reactions are also found to be highly exothermic in nature. This is the first report on electronically nonadiabatic decomposition pathways of DMNA-Zn-n neutral clusters. (C) 2014 Elsevier B.V. All rights reserved.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

Composition dependent non-ideality in aqueous binary mixtures as a signature of avoided spinodal decomposition

We explore the potential energy landscape of structure breaking binary mixtures (SBBM) where two constituents dislike each other, yet remain macroscopically homogeneous at intermediate to high temperatures. Interestingly, we find that the origin of strong composition dependent non-ideal behaviour lies in its phase separated inherent structure. The inherent structure (IS) of SBBM exhibits bi-continuous phase as is usually formed during spinodal decomposition. We draw analogy of this correlation between non-ideality and phase separation in IS to explain observation of non-ideality in real aqueous mixtures of small amphiphilic solutes, containing both hydrophilic and hydrophobic groups. Although we have not been able to obtain IS of these liquids, we find that even at room temperature these liquids sustain formation of fluctuating, transient bi-continuous phase, with limited lifetime (tau less than or similar to 20 ps). While in the model (A, B) binary mixture, the non-ideal composition dependence can be considered as a fluctuation from a phase separated state, a similar scenario is expected to be responsible for the unusually strong non-ideality in these aqueous binary mixtures.

Excited electronic state decomposition mechanisms of clusters of dimethylnitramine and aluminum

In this report, electronically non-adiabatic decomposition pathways of clusters of dimethylnitramine and aluminum (DMNA-Al and DMNA-Al-2) are discussed in comparison to isolated dimethylnitramine (DMNA). Electronically excited state processes of DMNA-Al and DMNA-Al-2 are explored using the complete active space self-consistent field (CASSCF) and the restricted active space self-consistent field (RASSCF) theories, respectively. Similar to the nitro-nitrite isomerization reaction pathway of DMNA, DMNA-Al-n clusters also exhibit isomerization pathway. However, it involves several other steps, such as, first Al-O bond dissociation, then N-N bond dissociation followed by isomerization and finally NO elimination. Furthermore, DMNA-Al-n clusters exhibit overall exothermic decomposition reaction pathway and isolated DMNA shows overall endothermic reaction channel.

Efficient QR Decomposition Using Low Complexity Column-wise Givens Rotation (CGR)

QR decomposition (QRD) is a widely used Numerical Linear Algebra (NLA) kernel with applications ranging from SONAR beamforming to wireless MIMO receivers. In this paper, we propose a novel Givens Rotation (GR) based QRD (GR QRD) where we reduce the computational complexity of GR and exploit higher degree of parallelism. This low complexity Column-wise GR (CGR) can annihilate multiple elements of a column of a matrix simultaneously. The algorithm is first realized on a Two-Dimensional (2 D) systolic array and then implemented on REDEFINE which is a Coarse Grained run-time Reconfigurable Architecture (CGRA). We benchmark the proposed implementation against state-of-the-art implementations to report better throughput, convergence and scalability.

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.

Thermal conductivity of beta-FeSi2/Si endogenous composites formed by the eutectoid decomposition of alpha-Fe2Si5

Thermoelectric properties of semiconducting beta-FeSi2 containing a homogeneous distribution of Si secondary phase have been studied. The synthesis was carried out using arc melting followed by the densification by uniaxial hot pressing. Endogenous beta-FeSi2/Si composites were produced by the eutectoid decomposition of high-temperature alpha-Fe2Si5 phase. The aging heat treatments have been carried out at various temperatures below the equilibrium eutectoid temperature for various durations in order to tune the size of the eutectoid product. Thermal properties of the samples were studied in the temperature range of 100-350 A degrees C. The microstructural investigations support the fact that the finest microstructure generated through the eutectoid decomposition of the alpha-Fe2Si5 metastable phase is responsible of the phonon scattering. The results suggest an opportunity to produce bulk iron silicide alloys with reduced thermal conductivity in order to enhance its thermoelectric performance.

Iridium-decorated multiwall carbon nanotubes and its catalytic activity with Shell 405 in hydrazine decomposition

Iridium-functionalized multiwalled carbon nanotubes (Ir-MWNT) are the future catalyst support material for hydrazine fuel decomposition. The present work demonstrates decoration of iridium particle on iron-encapsulated multiwalled carbon nanotubes (MWNT) by wet impregnation method in the absence of any stabilizer. Electron microscopy studies reveal the coated iridium particle size in the range of 5-10 nm. Elemental analysis by energy dispersive X-ray diffraction confirms 21 wt% of Ir coated over MWNT. X-ray photoelectron spectroscopy (XPS) shows 4f(5/2) and 4f(7/2) lines of iridium and confirms the metallic nature. The catalytic activity of Ir-MWNT/Shell 405 combination is performed in 1 N hydrazine micro-thrusters. The thruster performance shows increase in chamber pressure and decrease in chamber temperature when compared to Shell 405 alone. This enhanced performance is due to high thermal conducting nature of MWNTs and the presence of Ir active sites over MWNTs.

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.

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.